Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "s = input()\r\nn = len(s)\r\np, curr = n - 1, 0\r\nwhile s[p] != '#':\r\n\tif s[p] == ')': curr += 1\r\n\telse: curr -= 1\r\n\tp -= 1\r\n\tif curr < 0:\r\n\t\tprint(-1)\r\n\t\texit()\r\ncnt_hash, curr = s.count('#'), 0\r\nfor i in range(p):\r\n\tif s[i] == '(': curr += 1\r\n\telse: curr -= 1\r\n\tif curr < 0:\r\n\t\tprint(-1)\r\n\t\texit()\r\nres = s.count('(') - s.count(')') - (cnt_hash - 1)\r\nif res <= 0:\r\n\tprint(-1)\r\n\texit()\r\ncnt_hash -= 1\r\nprint('\\n'.join('1'*cnt_hash))\r\nprint(s.count('(') - s.count(')') - cnt_hash)\r\n", "s = input()\r\nans = []\r\ncount = 0\r\nlast_pos = s.rfind('#')\r\nfor i, c in enumerate(s):\r\n if c == '(':\r\n count += 1\r\n elif c == ')':\r\n count -= 1\r\n elif c == '#' and i == last_pos:\r\n num = max(1, s.count('(') * 2 - len(s) + 1)\r\n count -= num\r\n ans.append(num)\r\n else:\r\n count -= 1\r\n ans.append(1)\r\n if count < 0:\r\n print(-1)\r\n break\r\nelse:\r\n for t in ans:\r\n print(t)\r\n \r\n\r\n", "s=input()\r\nlis=[0 for i in range(len(s))]\r\nlis1=[]\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n lis[i]=1\r\n if s[i]==')':\r\n lis[i]=-1\r\n if s[i]==\"#\":\r\n lis[i]=0\r\n lis1.append(i)\r\n\r\nif sum(lis)<=0:\r\n print(-1)\r\nelse:\r\n n=sum(lis)\r\n if n<len(lis1):\r\n print(-1)\r\n else:\r\n for i in range(len(lis1)-1):\r\n lis[lis1[i]]=-1\r\n lis[lis1[len(lis1)-1]]=-(n+1-len(lis1))\r\n lis2=[lis[0]]\r\n c=1\r\n if lis[0]<0:\r\n c=0\r\n else:\r\n for i in range(1,len(lis)):\r\n lis2.append(lis[i]+lis2[i-1])\r\n if lis2[i]<0:\r\n c=0\r\n break\r\n if c==0:\r\n print(-1)\r\n else:\r\n for i in range(len(lis1)-1):\r\n print(1)\r\n print(n+1-len(lis1))\r\n \r\n \r\n \r\n \r\n \r\n", "s = input()\r\nl = []\r\nb = False\r\nu = [0] * len(s)\r\nfor i in range(len(s) - 2, -1, -1):\r\n u[i] = u[i + 1] + (s[i + 1] != '(')\r\n u[i] -= (s[i + 1] == '(')\r\n u[i] = max(u[i], 0)\r\n\r\nd = 0\r\nfor i in range(len(s)):\r\n if s[i] == '#':\r\n l += [d - u[i]]\r\n d -= d - u[i]\r\n b = True\r\n elif s[i] == ')':\r\n d -= 1\r\n if d < 0 and not b:\r\n l += [-1]\r\n break\r\n else:\r\n d += 1\r\nd = 0\r\nb = False\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i] == '#':\r\n b = True\r\n break\r\n elif s[i] == '(':\r\n d -= 1\r\n if d < 0 and not b:\r\n l += [-1]\r\n break\r\n else:\r\n d += 1\r\n\r\nif min(l) < 1:\r\n print(-1)\r\nelse:\r\n for i in l:\r\n print(i)", "s=input();\r\nans=[];\r\ncount=0;\r\nlast_pos=s.rfind('#');\r\nn=len(s);\r\nfor i in range(n):\r\n if s[i]=='(':\r\n count+=1;\r\n elif s[i]==')':\r\n count-=1;\r\n elif s[i]=='#' and i==last_pos:\r\n num=max(1,s.count('(')*2-len(s)+1)\r\n count-=num;\r\n ans.append(num);\r\n else:\r\n count-=1;\r\n ans.append(1);\r\n if count<0:\r\n print(-1);\r\n exit(0)\r\nfor t in ans:\r\n print(t)", "# 494A\r\n# θ(|s|) time\r\n# θ(|s|) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n s = read(0)\r\n n = len(s)\r\n ex = 2 * s.count('(') - n\r\n if ex < 0:\r\n return -1\r\n res = []\r\n l = i = 0\r\n last = s.rfind('#')\r\n for i in range(n):\r\n c = s[i]\r\n if c == '(':\r\n l += 1\r\n elif c == ')':\r\n l -= 1\r\n else:\r\n if l == 0:\r\n return -1\r\n k = 1 if i < last else 1 + ex\r\n res.append(k)\r\n l -= k\r\n if l < 0:\r\n return -1\r\n return res\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = '\\n'.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "#input\r\n\r\ns=str(input())\r\n\r\n\r\n\r\n#variables\r\n\r\nx=b=0\r\n\r\nr=[]\r\n\r\n\r\n\r\n#main\r\n\r\nfor i in range(len(s)):\r\n\r\n\tif s[i]=='(':\r\n\r\n\t\tb+=1\r\n\r\n\telif s[i]==')':\r\n\r\n\t\tb-=1\r\n\r\n\telse:\r\n\r\n\t\tb-=1\r\n\r\n\t\tx=b\r\n\r\n\t\tr.append(1)\r\n\r\n\tif b<0:\r\n\r\n\t\tprint(-1)\r\n\r\n\t\tquit()\r\n\r\nif b<=x:\r\n\r\n\tr[-1]+=b\r\n\r\n\tx=b=0\r\n\r\n\tfor i in range(len(s)):\r\n\r\n\t\tif s[i]=='(':\r\n\r\n\t\t\tb+=1\r\n\r\n\t\telif s[i]==')':\r\n\r\n\t\t\tb-=1\r\n\r\n\t\telse:\r\n\r\n\t\t\tb-=r[x]\r\n\r\n\t\t\tx+=1\r\n\r\n\t\tif b<0:\r\n\r\n\t\t\tprint(-1)\r\n\r\n\t\t\tquit()\r\n\r\nelse:\r\n\r\n\tprint(-1)\r\n\r\n\tquit()\r\n\r\n\r\n\r\n#output\r\n\r\nfor i in range(len(r)):\r\n\r\n\tprint(r[i])", "#!/usr/bin/env python\n# coding=utf-8\n\nimport sys\nS = input()\nN = S.count(\"#\")\nD = S.count(\"(\") - S.count(\")\") - N + 1\nif D <= 0:\n print(-1)\n sys.exit()\nS = S.split(\"#\")\nS = \")\".join(S[:-1]) + \")\" * D + S[-1]\nLvl = 0\nfor C in S:\n if C == \"(\":\n Lvl += 1\n if C == \")\":\n Lvl -= 1\n if Lvl < 0:\n print(-1)\n sys.exit()\nfor I in range(N - 1):\n print(1)\nprint(D)\n", "import sys\nst = input()\na = 0\nb = 0\nlast = 0\nv = []\nfor s in st:\n\tif s == \"(\":\n\t\ta += 1\n\telif s == \")\":\n\t\ta -= 1\n\telif s == \"#\":\n\t\ta -= 1\n\t\tv.append(1)\n\tif a < 0:\n\t\tprint(-1)\n\t\tsys.exit()\n\nv[-1] += a\ni=0\na = 0\nfor s in st:\n\tif s == \"(\":\n\t\ta += 1\n\telif s == \")\":\n\t\ta -= 1\n\telif s == \"#\":\n\t\ta -= v[i]\n\t\ti += 1\n\tif a < 0:\n\t\tprint(-1)\n\t\tsys.exit()\nif a != 0:\n\tprint(-1)\nelse:\n\tfor vs in v:\n\t\tprint(vs)\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "# HEY STALKER\r\ndef solve():\r\n l = list(input())\r\n n = len(l)\r\n idx = 0\r\n c = 0\r\n for i in l:\r\n if i == \"#\":\r\n c += 1\r\n for t in range(n-1, -1, -1):\r\n if l[t] == \"#\":\r\n idx = t\r\n break\r\n for t in range(n):\r\n if l[t] == \"#\":\r\n l[t] = \")\"\r\n k = [0 for t in range(n)]\r\n if l[0] == ')':\r\n return [-1]\r\n k[0] = 1\r\n for t in range(1, n):\r\n if l[t] == \")\":\r\n k[t] = k[t-1] - 1\r\n else:\r\n k[t] = k[t-1] + 1\r\n if k[t] < 0:\r\n return [-1]\r\n v = [0 for i in range(n)]\r\n if l[-1] == \"(\":\r\n return [-1]\r\n v[-1] = 1\r\n for t in range(n-2, idx-1, -1):\r\n if l[t] == \")\":\r\n v[t] = v[t+1] + 1\r\n else:\r\n v[t] = v[t+1] - 1\r\n v[idx] -= 1\r\n k[idx] += 1\r\n if v[idx] < 0:\r\n return [-1]\r\n if v[idx] == k[idx] or k[idx] == 0:\r\n return [-1]\r\n if v[idx] >= k[idx]:\r\n return [-1]\r\n ans = k[idx] - v[idx]\r\n x = [1 for i in range(c)]\r\n x[-1] = ans\r\n return x\r\nz = solve()\r\nfor iu in z:\r\n print(iu)", "s = input()\r\nlast = s.rfind('#')\r\ndif = s.count('(')-s.count(')')-s.count('#')\r\ntry:\r\n assert dif >= 0\r\n lev = 0\r\n out = []\r\n for i in range(len(s)):\r\n c = s[i]\r\n if c == '(': lev += 1\r\n elif c == ')':\r\n lev -= 1\r\n assert lev >= 0\r\n elif c == '#':\r\n lev -= 1\r\n if i == last:\r\n out.append(dif+1)\r\n lev -= dif\r\n else:\r\n out.append(1)\r\n assert lev >= 0\r\n assert lev == 0\r\n for x in out: print(x)\r\nexcept AssertionError:\r\n print(-1)\r\n \r\n", "'''import sys\r\nst = input()\r\na = 0\r\nb = 0\r\nlast = 0\r\nv = []\r\nfor s in st:\r\n\tif s == \"(\":\r\n\t\ta += 1\r\n\telif s == \")\":\r\n\t\ta -= 1\r\n\telif s == \"#\":\r\n\t\ta -= 1\r\n\t\tv.append(1)\r\n\tif a < 0:\r\n\t\tprint(-1)\r\n\t\tsys.exit()\r\n\r\nv[-1] += a\r\ni=0\r\na = 0\r\nfor s in st:\r\n\tif s == \"(\":\r\n\t\ta += 1\r\n\telif s == \")\":\r\n\t\ta -= 1\r\n\telif s == \"#\":\r\n\t\ta -= v[i]\r\n\t\ti += 1\r\n\tif a < 0:\r\n\t\tprint(-1)\r\n\t\tsys.exit()\r\nif a != 0:\r\n\tprint(-1)\r\nelse:\r\n\tfor vs in v:\r\n\t\tprint(vs)'''\r\n\r\n\r\nimport sys\r\na=0\r\ns=input()\r\nl=[]\r\nfor i in s:\r\n\tif(i=='('):\r\n\t\ta=a+1\r\n\telif(i==')'):\r\n\t\ta=a-1\r\n\telse:\r\n\t\ta=a-1\r\n\t\tl.append(1)\r\n\tif(a<0):\r\n\t\tprint(-1)\r\n\t\tsys.exit()\r\nl[-1]+=a\r\na=0\r\nk=0\r\nfor j in s:\r\n\tif(j=='('):\r\n\t\ta=a+1\r\n\telif(j==')'):\r\n\t\ta=a-1\r\n\telse:\r\n\t\ta=a-l[k]\r\n\t\tk=k+1\r\n\tif(a<0):\r\n\t\tprint(-1)\r\n\t\tsys.exit()\r\n\r\nif(a!=0):\r\n\tprint(-1)\r\nelse:\r\n\tfor j in l:\r\n\t\tprint(j)", "s=input()\r\nw=s.rindex(\"#\")\r\nq=0\r\n\r\nfor i in range(len(s)-1,w,-1) :\r\n if s[i]==\"(\" :\r\n q+=1\r\n else :\r\n q-=1\r\n if q>0 :\r\n print(-1)\r\n exit()\r\nd=0\r\nzz=[]\r\nfor i in range(w) :\r\n if s[i]==\"(\" :\r\n d+=1\r\n elif s[i]==\")\" :\r\n d-=1\r\n else :\r\n d-=1\r\n zz.append(1)\r\n if d<0 :\r\n print(-1)\r\n exit()\r\ny=q+d\r\nif y<=0 :\r\n print(-1)\r\nelse :\r\n zz.append(y)\r\n print(\"\\n\".join(map(str,zz)))\r\n \r\n \r\n", "s = input()\r\nc = s.count('#')\r\nmylist = []\r\nresult = s.count('(') - s.count(')')\r\nif result > 0:\r\n for i in range(c):\r\n if i == c - 1:\r\n mylist.append(result - c + 1)\r\n else:\r\n mylist.append(1)\r\nelse:\r\n mylist.append(-1)\r\ns = list(s)\r\nj = 1\r\nfor i in range(len(s)):\r\n if j < c:\r\n if s[i] == '#':\r\n s[i] = ')'\r\n j = j + 1\r\n else:\r\n if s[i] == '#':\r\n s[i] = ')' * mylist[len(mylist) - 1] \r\ns = ''.join(s)\r\na = 0\r\nb = 0\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n a = a + 1\r\n elif s[i] == ')':\r\n b = b + 1\r\n if a < b:\r\n mylist = [-1]\r\n break\r\nfor i in mylist:\r\n print(i)\r\n ", "s = input()\r\nc = 0; t = s.rfind('#')\r\nans = []; b = True\r\nfor i in range(t):\r\n if s[i] == '(': c += 1\r\n elif s[i] == ')': c -= 1\r\n else:\r\n c -= 1\r\n ans.append(1)\r\n if c < 0:\r\n b = False\r\n break\r\nm = c\r\nfor i in range(t + 1, len(s)):\r\n if s[i] == '(': c += 1\r\n else: c -= 1\r\n m = min(m, c)\r\n\r\nif b and m > 0 and m == c:\r\n ans.append(m)\r\n print(*ans, sep = '\\n')\r\nelse:\r\n print(-1)\r\n", "s = input().strip()\r\nif s == '#':\r\n print(-1)\r\n exit(0)\r\nb1 = 0\r\nfor i in s: \r\n if i == '(':\r\n b1 += 1\r\n else:\r\n b1 -= 1\r\nb1 += 1\r\nk = s.count('#')\r\nl = 0\r\nb2 = 0\r\nif (b1 <= 0):\r\n print(-1)\r\n exit(0)\r\nfor i in s:\r\n if i == '(':\r\n b2 += 1\r\n elif i == ')':\r\n b2 -= 1\r\n else:\r\n if i == '#':\r\n l += 1\r\n if l < k:\r\n b2 -= 1\r\n else:\r\n b2 -= b1\r\n if (b2 < 0):\r\n print(-1)\r\n exit(0)\r\nif b2 != 0:\r\n print(-1)\r\nelse:\r\n print(*([1] * (k - 1) + [b1]), sep = '\\n')", "import itertools\r\nimport math\r\n\r\ndef main():\r\n s = input()\r\n n = s.count(\"#\")\r\n\r\n d = s.count(\"(\") - s.count(\")\") - n + 1\r\n if d <= 0:\r\n print(-1)\r\n return\r\n s = s.split(\"#\")\r\n s = \")\".join(s[:-1]) + \")\" * d + s[-1]\r\n \r\n lvl = 0\r\n for c in s:\r\n if c == \"(\": lvl += 1\r\n if c == \")\": lvl -= 1\r\n if lvl < 0:\r\n print(-1)\r\n return\r\n\r\n for i in range(n - 1):\r\n print(1)\r\n print(d)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nS = input()\r\nA = []\r\nmi,ma=0,0\r\nfor c in S:\r\n if c=='(':\r\n mi+=1\r\n ma+=1\r\n elif c==')':\r\n mi=max(0,mi-1)\r\n ma-=1\r\n else:\r\n mi = 0\r\n ma = ma-1\r\n if ma<0 or ma<mi:\r\n exit(print(-1))\r\n A.append((mi,ma))\r\n#print(A)\r\n \r\nif A[-1][0]!=0:\r\n exit(print(-1))\r\n \r\nans = []\r\ncur = 0\r\nfor c in S[::-1]:\r\n A.pop()\r\n \r\n if c==')':\r\n cur+=1\r\n elif c=='(':\r\n cur-=1\r\n else:\r\n t = max(1,A[-1][0]-cur)\r\n ans.append(t)\r\n cur+=t\r\n \r\nfor a in ans[::-1]:\r\n print(a)\r\n\r\n \r\n \r\n\r\n\r\n \r\n ", "s = input().replace(\"()\", \"\")\r\nt = s.count(\"(\") - s.count(\")\") - s.count(\"#\")\r\nif t < 0 or s.index(\"#\") < s.index(\"(\"): \r\n print(-1)\r\n quit()\r\nl = [1]*s.count(\"#\")\r\nl[-1] += t\r\ni = [k for k, l in enumerate(s) if l == \"#\"]\r\na, b = 0, 0\r\nfor x in range(len(s)):\r\n if s[x] == \"(\":\r\n a += 1\r\n elif s[x] == \")\":\r\n b += 1\r\n elif s[x] == \"#\" and x != i[-1]:\r\n b += 1\r\n elif s[x] == \"#\":\r\n b += t + 1\r\n if a < b:\r\n print(-1)\r\n quit()\r\n # print(a, b, s)\r\nif a != b:\r\n print(-1)\r\nelse:\r\n print(\"\\n\".join(map(str, l)))\r\n \r\n \r\n", "s = input()\nleft_paranthesis = sum(i == '(' for i in s)\nright_paranthesis = sum(i == ')' for i in s)\nhashes = sum(i == '#' for i in s)\nif left_paranthesis < right_paranthesis + hashes:\n print(-1)\n exit()\nelif left_paranthesis == right_paranthesis + hashes:\n s.replace('#', ')')\n lp = 0\n rp = 0\n for i in s:\n if i == '(':\n lp += 1\n else:\n rp += 1\n if rp > lp:\n print(-1)\n exit()\n for i in range(hashes):\n print(1)\nelse:\n excess = left_paranthesis - right_paranthesis - hashes + 1\n l = s.rfind('#')\n ans = []\n for i, j in enumerate(s):\n if j != '#':\n ans.append(j)\n elif i != l:\n ans.append(')')\n else:\n ans.append(')' * excess)\n ans = ''.join(ans)\n lp = 0\n rp = 0\n for i in ans:\n if i == '(':\n lp += 1\n else:\n rp += 1\n if rp > lp:\n print(-1)\n exit()\n for i in range(hashes - 1):\n print(1)\n print(excess)\n\n", "import sys\r\ns = input()\r\nx = 0\r\ny = 0\r\nv = []\r\nfor _ in s:\r\n if _ == \"(\":\r\n x += 1\r\n elif _ == \")\":\r\n x -= 1\r\n elif _ == \"#\":\r\n x -= 1\r\n v.append(1)\r\n if x < 0:\r\n print(-1)\r\n sys.exit()\r\nv[-1] += x\r\ni = 0\r\nx = 0\r\nfor _ in s:\r\n if _ == \"(\":\r\n x += 1\r\n elif _ == \")\":\r\n x -= 1\r\n elif _ == \"#\":\r\n x -= v[i]\r\n i += 1\r\n if x < 0:\r\n print(-1)\r\n sys.exit()\r\nif x != 0:\r\n\tprint(-1)\r\nelse:\r\n\tfor _ in v:\r\n\t\tprint(_)# 1698064613.8114018", "s = input()\r\nopening = 0\r\nclosing = 0\r\nall_symbols = []\r\nlast_empty = -1\r\nfor i in range(len(s)):\r\n ch = s[i]\r\n if ch == '(':\r\n opening += 1\r\n elif ch == ')':\r\n closing += 1\r\n else:\r\n last_empty = i\r\n all_symbols.append(ch)\r\nif len(s) - opening - closing > opening - closing or (last_empty == -1 and opening != closing):\r\n print(-1)\r\nelse:\r\n ans = []\r\n k = opening - closing\r\n cnt = 0\r\n for i in range(len(s)):\r\n ch = all_symbols[i]\r\n if ch == '#':\r\n if i == last_empty:\r\n ans.append(k)\r\n cnt -= k\r\n else:\r\n ans.append(1)\r\n k -= 1\r\n cnt -= 1\r\n elif ch == '(':\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0:\r\n print(-1)\r\n exit()\r\n if cnt != 0:\r\n print(-1)\r\n else:\r\n for elem in ans:\r\n print(elem)\r\n", "def solve(s):\r\n cnt, d, mid = 0, 0, len(s)\r\n for ch in s:\r\n if ch == '(':\r\n d += 1\r\n continue\r\n d -= 1\r\n if d < 0:\r\n print('-1')\r\n return\r\n if ch == '#':\r\n cnt += 1\r\n mid = d\r\n elif mid > d:\r\n mid = d\r\n if mid < d:\r\n print('-1')\r\n else:\r\n for i in range(cnt - 1): print(1)\r\n print(d + 1)\r\ns = input()\r\nsolve(s)", "import sys\r\nS=input()\r\nN=S.count(\"#\")\r\nD=S.count(\"(\")-S.count(\")\")-N+1\r\nif D<=0:\r\n print(-1)\r\n sys.exit()\r\nS=S.split(\"#\")\r\nS=\")\".join(S[:-1])+\")\"*D+S[-1]\r\nLvl=0\r\nfor C in S:\r\n if C==\"(\":\r\n Lvl+=1\r\n if C==\")\":\r\n Lvl-=1\r\n if Lvl<0:\r\n print(-1)\r\n sys.exit()\r\nfor I in range(N-1):\r\n print(1)\r\nprint(D)\r\n", "s=input()\r\nx=0\r\ntf=True\r\nc1=0\r\nc2=0\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n c1+=1\r\n x+=1\r\n else:\r\n x-=1\r\n if x<0:\r\n tf=False\r\n break\r\n if s[i]=='#':\r\n c2+=1\r\n ind=i\r\nif tf:\r\n x=0\r\n ls=len(s)\r\n for i in range(len(s)):\r\n if s[i]=='(':\r\n x+=1\r\n else:\r\n x-=1\r\n if i==ind:\r\n x-=(2*c1-ls)\r\n if x<0:\r\n tf=False\r\n break\r\n if tf:\r\n for _ in range(c2-1):\r\n print(1)\r\n print(1+2*c1-ls)\r\n \r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "import functools\r\nimport math\r\nimport random\r\nfrom collections import defaultdict,deque\r\nfrom heapq import heapify,heappop,heappush\r\nimport bisect\r\nfrom collections import Counter\r\nimport collections\r\nfrom functools import lru_cache\r\nimport time\r\nfrom typing import List\r\nfrom math import log\r\nfrom random import randint,seed\r\nfrom time import time\r\nfrom bisect import bisect_left,bisect_right\r\n\r\n\r\nl = 0\r\ncnt = 0\r\nf = True\r\ns=input()\r\nfor c in s:\r\n if c == '(':\r\n l += 1\r\n elif c == ')':\r\n l -= 1\r\n if l < 0:\r\n f = False\r\n break\r\n else:\r\n l -= 1\r\n cnt += 1\r\n if l < 0:\r\n f = False\r\n break\r\n\r\nif not f:\r\n print(-1)\r\nelse:\r\n ans=[]\r\n for _ in range(cnt - 1):\r\n ans.append(1)\r\n if cnt: ans.append(l+1)\r\n l=0\r\n j=0\r\n for c in s:\r\n if c=='(':\r\n l+=1\r\n elif c==')':\r\n l-=1\r\n if l<0:\r\n f=False\r\n break\r\n else:\r\n l-=ans[j]\r\n j+=1\r\n if l<0:\r\n f=False\r\n break\r\n if not f or l!=0: print(-1)\r\n else:\r\n for x in ans:\r\n print(x)\r\n", "#!/usr/bin/env python3\n\ns = input()\ncount = 0\nres = []\nlast = s.rfind(\"#\")\n\nfor i, c in enumerate(s):\n if c == '(':\n count += 1\n elif c == ')':\n count -= 1\n else:\n if i < last:\n res.append(1)\n count -= 1\n else:\n num = max(1, 1 + s.count(\"(\") - s.count(\"#\") - s.count(\")\"))\n res.append(num)\n count -= num\n if count < 0:\n res = []\n print(-1)\n break\nfor i in res:\n print(i)\n", "s=input()\r\nn=len(s)\r\na=0\r\nans=''\r\nc=1\r\nc1=s.count('#')\r\nfor i in range(n):\r\n if(s[i]=='#'):\r\n c4=i\r\n ans+=')'\r\n else:\r\n ans+=s[i]\r\nfor i in ans:\r\n if(i=='('):\r\n a+=1\r\n else:\r\n a-=1\r\n if(a<0):\r\n c=0\r\n break\r\nif(c==0):\r\n print(-1)\r\nelse:\r\n c2=ans.count('(')\r\n c3=ans.count(')')\r\n ans=ans[:c4+1]+')'*(c2-c3)+ans[c4+1:]\r\n a=0\r\n for i in ans:\r\n if(i=='('):\r\n a+=1\r\n else:\r\n a-=1\r\n if(a<0):\r\n c=0\r\n break\r\n if(c==0 or a!=0):\r\n print(-1)\r\n else:\r\n for i in range(c1-1):\r\n print(1)\r\n print(c2-c3+1)", "#S = open(\"input.txt\").readline().rstrip()\nS = input().rstrip()\na, b, c = S.count(\"(\"), S.count(\")\"), S.count(\"#\")\nd = a - b\nif d >= c:\n\tRes = [1] * (c - 1) + [d - c + 1]\n\t#print(Res)\n\tbalans = 0\n\tflag = True\n\tfor i in S:\n\t\t#print(balans, i)\n\t\tif i == \"(\":\n\t\t\tbalans += 1\n\t\telif i == \")\":\n\t\t\tbalans -= 1\n\t\telse:\n\t\t\tbalans -= (d != Res[-1]) + d * (d == Res[-1])\n\t\t\td -= 1\n\t\tif balans < 0:\n\t\t\tflag = False\n\t\t#print(balans, i)\n\tif flag:\n\t\tfor i in Res:\n\t\t\tprint(i)\n\telse:\n\t\tprint(-1)\nelse:\n\tprint(-1)", "s = input()\nresult = []\npos = 0\nstate = 0\nfor i in range(len(s)):\n if s[i] == '(':\n state += 1\n elif s[i] == ')':\n state -= 1\n elif s[i] == '#':\n x = max(1, state)\n state -= x\n result.append(x)\n\n if state < 0:\n while pos < len(result) and result[pos] <= 1:\n pos += 1\n if pos >= len(result):\n result = [-1]\n break\n result[pos] -= 1\n state += 1\n\nif state > 0:\n result = [-1]\n\nfor r in result:\n print(r)\n", "#!/usr/bin/env python\ntxt = input()\nhli = txt.rfind('#')\nfail = False\n\ndef check(s,e):\n return 0\n\nsc1 = 0\nfor i in range(0,hli):\n if txt[i] == '(':\n sc1 += 1\n else:\n sc1 -= 1\n\n if sc1 < 0:\n fail = True\n break\n\nsc2 = 0\nif not fail:\n for i in range(len(txt)-1,hli,-1):\n if txt[i] == ')':\n sc2 += 1\n else:\n sc2 -= 1\n\n if sc2 < 0:\n fail = True\n break\n\nif fail or (sc1-sc2<1):\n print(-1)\nelse:\n for i in range(txt.count('#')-1):\n print(1)\n print(sc1-sc2)\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()\r\n\r\n\r\na = s.count('(')\r\nb = s.count(')')\r\nc = s.count('#')\r\n\r\nif a < b + c:\r\n print(-1)\r\nelse:\r\n rest = a - b\r\n ans = [1] * (c - 1) + [rest - c + 1] # greedy, put ) most right\r\n new_s = ''\r\n cnt = 0\r\n for c in s:\r\n if c != '#':\r\n new_s += c\r\n else:\r\n new_s += ')' * ans[cnt]\r\n cnt += 1\r\n flag = True\r\n l, r = 0 ,0\r\n #print(new_s)\r\n for c in new_s:\r\n #print(c)\r\n if c == '(':\r\n l += 1\r\n elif c == ')':\r\n r += 1\r\n #print(r, l)\r\n if r > l:\r\n\r\n flag = False\r\n break\r\n\r\n if flag:\r\n for num in ans:\r\n print(num)\r\n else:\r\n print(-1)\r\n\r\n", "s = input()\r\nn = s.rfind(\"#\")\r\nerror = 0\r\ns1 = 0\r\ns2 = 0\r\ns3 = 0\r\ns4 = s.count(\"(\")\r\ns5 = s.count(\")\")\r\ns6 = 0\r\nfor num in range(n):\r\n if s[num]==\"(\" :\r\n s2 += 1\r\n elif s[num]==\")\":\r\n s3 += 1\r\n if s[num]==\"#\" :\r\n s1 += 1\r\n s3 += 1\r\n if s3 > s2:\r\n error=1\r\nif s1+s5 < s4:\r\n s6 = s4-s5-s1\r\n s3 += s6\r\nelse:\r\n error = 1\r\nfor num in range(n,len(s)):\r\n if s[num]==\"(\" :\r\n s2 += 1\r\n elif s[num]==\")\":\r\n s3 += 1\r\n if s3 > s2:\r\n error=1\r\nif error == 1:\r\n print(-1)\r\nelse:\r\n while s1>0:\r\n print(1)\r\n s1-=1\r\n print(s6)\r\n \r\n", "def solve():\r\n s = input()\r\n stack = []\r\n t=-1\r\n for i, c in enumerate(s):\r\n if c in ')#':\r\n if not stack:\r\n print(-1)\r\n return\r\n if c=='#':t=i\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n if stack and stack[-1]>t:\r\n print(-1)\r\n return\r\n\r\n m = s.count(\"#\")\r\n for i in range(m - 1):\r\n print(1)\r\n print(len(stack) + 1)\r\n return\r\n\r\nsolve()", "word = list(input())\nleftbracket = 0\nrightbracket = 0\nhashtag = 0\nprintarray = []\ndidntwork = 0\nfor i in range(len(word)):\n if word[i] == '(':\n leftbracket += 1\n elif word[i] == ')':\n rightbracket += 1\n elif word[i] == '#':\n hashtag += 1\n rightbracket += 1\n if rightbracket > leftbracket:\n didntwork = 1\nfinal = leftbracket-rightbracket\nleftbracket = 0\nrightbracket = 0\nnew_hashtag = hashtag\nfor i in range(len(word)):\n if word[i] == '(':\n leftbracket += 1\n elif word[i] == ')':\n rightbracket += 1\n elif word[i] == '#':\n if new_hashtag == 1:\n rightbracket += 1+final\n else:\n new_hashtag -= 1\n rightbracket += 1\n if rightbracket > leftbracket:\n didntwork = 1\nif didntwork == 0:\n for i in range(hashtag-1):\n print(1)\n print(1+final)\nelse:\n print(-1)\n\n \t \t\t\t\t\t\t \t\t \t\t \t\t\t \t \t\t \t\t \t", "l = [i for i in input()]\nstack = []\nvalid = True\nn_hashes = 0\nn_open_free = 0\nfor i in range(len(l)):\n if l[i] == ')' or l[i] == '#':\n if len(stack) == 0:\n valid = False\n break\n last_open = stack.pop(-1)\n l[last_open] = 0\n if l[i] == ')':\n l[i] = 0\n n_open_free = max(0, n_open_free-1)\n else:\n n_hashes += 1\n l[i] = '*'\n n_open_free = 0\n elif l[i] == '(':\n stack.append(i)\n n_open_free+=1\nif n_open_free != 0:\n valid = False\nif valid:\n answer = [1]*n_hashes\n open_counter = 0\n current_hash = 0\n for i in range(len(l)):\n if l[i] == '(':\n open_counter+=1\n elif l[i] == '*':\n answer[current_hash] += open_counter\n open_counter = 0\n current_hash+=1\n for elem in answer:\n print(elem)\nelse:\n print(-1)\n\n \t \t \t\t \t\t \t\t \t\t \t\t\t", "s=input()\narray=[]\nc=0\nfor r in s:\n if r=='(':c+=1\n else:\n if r=='#':array.append(1)\n c-=1\n if c<0:\n print(-1)\n exit(0)\narray[-1]+=c\ni=0\nc=0\nfor r in s:\n if r=='(':c+=1\n else:\n if r=='#':\n c-=array[i]\n i+=1\n else:\n c-=1\n if c<0:\n print(-1)\n exit(0)\nprint(*array,sep='\\n')\n", "s = [*input()]\r\nans = []\r\nt = h = 0\r\n\r\nfor i in range(len(s)):\r\n t += 1 if s[i] == '(' else -1\r\n if t < 0:\r\n print(-1)\r\n exit()\r\n if s[i] == '#':\r\n s[i] = ')'\r\n ans.append(1)\r\n h = i\r\n\r\nans[-1] += t\r\ns = s[:h] + [')'] * t + s[h:]\r\n\r\nt = 0\r\n\r\nfor i in s:\r\n t += 1 if i == '(' else -1\r\n if t < 0:\r\n print(-1)\r\n exit()\r\n\r\nprint(*ans, sep='\\n')", "def checktail(s):\r\n d=0\r\n for p in range(len(s)-1,-1,-1):\r\n if s[p]==')':\r\n d+=1\r\n elif s[p]=='(':\r\n d-=1\r\n if d<0:\r\n print(-1)\r\n return\r\n else:break\r\n checkhead(s)\r\n \r\ndef checkhead(s):\r\n diff=0\r\n res=[]\r\n for i,c in enumerate(s):\r\n if c=='(':\r\n diff+=1\r\n elif c==')':\r\n diff-=1\r\n if diff<0:\r\n print(-1)\r\n return\r\n else:\r\n if diff>0:\r\n res.append(1)\r\n diff-=1\r\n else:\r\n print(-1)\r\n return\r\n res[-1]+=diff\r\n for r in res:\r\n print(r)\r\nif __name__=='__main__':\r\n s=input().strip()\r\n checktail(s)", "arr = input().strip()\n\nlast_hash = arr.rindex(\"#\")\nstack_left = []\nstack_right = []\nresult = []\n\n\nfor i in arr[:last_hash]:\n if i == \"(\":\n stack_left += [\"(\"]\n else:\n if i == \"#\": result += [\"1\"]\n if stack_left and stack_left[-1] == \"(\":\n stack_left.pop()\n else:\n stack_left += [\")\"]\n\nif \")\" in stack_left:\n result = [\"-1\"]\nelse:\n for i in arr[last_hash+1:]:\n if i == \"(\":\n stack_right += [\"(\"]\n else:\n if stack_right and stack_right[-1] == \"(\":\n stack_right.pop()\n else:\n stack_right += [\")\"]\n if \"(\" in stack_right:\n result = [\"-1\"]\n else:\n total = len(stack_left) - len(stack_right)\n if total <= 0:\n result = [\"-1\"]\n else: result += [f\"{total}\"]\nprint('\\n'.join(result))\n\n \t \t\t\t\t \t \t\t\t \t \t \t\t\t", "def checktail(s):\r\n d=0\r\n for p in range(len(s)-1,-1,-1):\r\n if s[p]=='#':break\r\n d+=1 if s[p]==')' else -1\r\n if d<0:\r\n print(-1)\r\n return\r\n checkhead(s)\r\n \r\ndef checkhead(s):\r\n diff,res=0,[]\r\n for c in s:\r\n diff+=1 if c=='(' else -1\r\n if diff<0:\r\n print(-1)\r\n return\r\n if c=='#':res.append(1)\r\n res[-1]+=diff\r\n for r in res:print(r)\r\nif __name__=='__main__':\r\n s=input().strip()\r\n checktail(s)" ]

[ "#!/usr/bin/env python\n# coding:utf-8\n# Copyright (C) dirlt\n\nfrom sys import stdin\n\n\ndef run(n, m, pixels):\n ans = 1 << 30\n\n acc = [[0] * (m + 1) for _ in range(n + 1)]\n for i in range(n):\n for j in range(m):\n acc[i + 1][j + 1] = acc[i + 1][j] + int(pixels[i][j])\n for j in range(m):\n acc[i + 1][j + 1] += acc[i][j + 1]\n # print(acc)\n\n for k in range(2, max(n, m) + 1):\n r, c = (n + k - 1) // k, (m + k - 1) // k\n res = 0\n for i in range(r):\n for j in range(c):\n x, y = i * k, j * k\n x2, y2 = min(x + k - 1, n - 1), min(y + k - 1, m - 1)\n zero = acc[x2 + 1][y2 + 1] - acc[x][y2 + 1] - acc[x2 + 1][y] + acc[x][y]\n # print(x, y, k, zero, k * k - zero)\n res += min(zero, k * k - zero)\n # print(k, res)\n ans = min(ans, res)\n print(ans)\n\n\ndef main():\n n, m = [int(x) for x in stdin.readline().split()]\n pixels = []\n for i in range(n):\n pixels.append(stdin.readline().strip())\n run(n, m, pixels)\n\n\nif __name__ == '__main__':\n import os\n\n if os.path.exists('tmp.in'):\n stdin = open('tmp.in')\n main()\n", "n,m = [int(x) for x in input().split()]\r\n \r\nb = [2,3]\r\nfor i in range(4,2500):\r\n j = 2\r\n flag = False\r\n while j*j <= i:\r\n if i%j == 0:\r\n flag = True\r\n break\r\n j+=1\r\n if not flag:\r\n b.append(i)\r\n \r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n \r\nk = max(n,m)\r\n \r\nansw = 10000000\r\n \r\nfor num in [2,3,5,7]:\r\n if num<k:\r\n size = num*num\r\n n1,m1=(n-1)//num+1,(m-1)//num+1\r\n c = []\r\n for i in range(n1):\r\n c.append([0]*m1)\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '1':\r\n c[i//num][j//num] += 1\r\n \r\n res = 0\r\n for i in range(n1):\r\n for j in range(m1):\r\n res += min(c[i][j],size-c[i][j])\r\n \r\n answ = min(res,answ)\r\n else:\r\n break\r\n \r\nprint(answ)", "n,m=map(int,input().split())\r\ns=[]\r\nfor _ in range(n):\r\n s.append([int(el) for el in input()])\r\nans=float(\"inf\")\r\nmem=[[0]*(m+1) for _ in range(n+1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n mem[i][j]+=s[i][j]+mem[i][j-1]\r\nfor j in range(m):\r\n for i in range(n):\r\n mem[i][j]+=mem[i-1][j]\r\nfor k in range(2,min(n,m)+1):\r\n temp=0\r\n for i in range(0,n,k):\r\n for j in range(0,m,k):\r\n x,y=min(n,i+k)-1,min(m,j+k)-1\r\n cost=mem[x][y]-mem[i-1][y]-mem[x][j-1]+mem[i-1][j-1]\r\n temp+=min(cost,k**2-cost)\r\n ans=min(ans,temp)\r\nprint(ans)", "from sys import stdin as fin\n# fin = open(\"ih2e2017a.in\", \"r\")\n# fout = open(\"ih2e2017a.in\", \"a\")\n\n# for i in range(2500):\n# for j in range(2500):\n# print('1' if (i % 2) == (j % 2) else '0', end='', file=fout)\n# print(file=fout)\n\n\ndef check(x, y):\n if x < 0 or y < 0:\n return 0\n else:\n return d[x][y]\n\ndef check2(x, y):\n if x < 0 or y < 0:\n return 0\n else:\n return d[min(x, n - 1)][min(y, m - 1)]\n\ndef border(a, b):\n d, m = divmod(a, b)\n return b * (d + (m != 0))\n\n\n# print('lol')\nn, m = map(int, fin.readline().split())\n# field = tuple(fin.readline().strip() for i in range(n))\nfield = fin.readlines()\n# print(\"inp\")\n# print(len(field), len(field[0]))\nd = [[None] * m for i in range(n)]\nd[0][0] = int(field[0][0]) #field[0][0]\nfor i in range(n):\n for j in range(m):\n d[i][j] = check(i - 1, j) + check(i, j - 1) - check(i - 1, j - 1) + int(field[i][j])# field[i][j]\n\nminv = float('inf')\nfor k in range(2, max(n, m)):\n cv = 0\n # print(k)\n for i in range(k - 1, border(n, k), k):\n for j in range(k - 1, border(m, k), k):\n ccnt = check2(i, j) - check2(i - k, j) - check2(i, j - k) + check2(i - k, j - k)\n cv += min(ccnt, k**2 - ccnt)\n minv = min(minv, cv)\n\nprint(minv)\n\nfin.close()" ]

[ "n,k =[int(i) for i in input().split(' ')]\nprint(k*(6*n-1))\nfor i in range(n):\n\tprint(k*(6*i+1), k*(6*i+2), k*(6*i+3), k*(6*i+5))\n\t\n", "n,k=[int(e) for e in input().split()]\r\nprint(k*(6*(n-1)+5))\r\nfor i in range(n):\r\n print(k*(6*i+1),k*(6*i+2),k*(6*i+3),k*(6*i+5))", "a, b = map(int, input().split(' '))\n\nprint((6*a-1)*b)\n\nfor i in range(a):\n\n print((6*i+1)*b, (6*i+2)*b, (6*i+3)*b, (6*i+5)*b)\n\n\n\n\n\n# Made By Mostafa_Khaled", "n, k = map(int, input().split())\n\nl = [1, 2, 3, 5]\n\nprint((6 * n - 1) * k)\n\nfor i in range(n):\n for j in l:\n print((6 * i + j) * k, end=' ')\n print()\n\n \t\t \t\t \t\t\t \t\t\t\t\t \t \t\t\t \t \t\t", "n, k = map(int, input().split())\r\nprint(k * (6*n - 1))\r\nfor i in range(n):\r\n print(k *(6 * i + 1), k *(6 *i +2), k *(6 *i +3), k *(6 *i +5))\r\n", "#!/usr/bin/python3\n\nimport sys\nimport heapq\n\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\ndef compatible(n, s):\n for m in s:\n if gcd(n, m) > 1:\n return False\n return True\n\nif __name__ == '__main__':\n n, k = map(int, sys.stdin.readline().split())\n \n print(((n-1)*6 + 5) * k)\n for i in range(n):\n s = [6*i + 1, 6*i + 2, 6*i + 3, 6*i + 5]\n print(' '.join(str(k*i) for i in s))\n ", "\"\"\"\r\nCodeforces Contest 272 Div 1 Problem B\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\ndef main():\r\n n,k = read()\r\n print((6*n-1)*k)\r\n for i in range(n):\r\n print((6*i+1)*k, (6*i+2)*k, (6*i+3)*k, (6*i+5)*k)\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,k=map(int,input().split())\r\nprint((6*n-1)*k)\r\nfor i in range(0,6*n,6):\r\n print((i+1)*k,(i+2)*k,(i+3)*k,(i+5)*k)", "import sys\n\ndef main():\n # fin = open(\"input.txt\", \"r\")\n fin = sys.stdin\n fout = sys.stdout\n\n n, k = map(int, fin.readline().split())\n m = 5 + 6 * (n - 1)\n m *= k\n\n print(m)\n print(k, 2 * k, 3 * k, 5 * k)\n idx = 1\n for i in range(1, n):\n idx += 6\n print(idx * k, (idx + 1) * k, (idx + 2) * k, (idx + 4) * k)\n\n fin.close()\n fout.close()\n\nmain()", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, k):\r\n answer = []\r\n for x in range(n):\r\n answer.append([k*(6*x+1), \r\n k*(6*x+3),\r\n k*(6*x+4),\r\n k*(6*x+5)])\r\n print(k*(6*(n-1)+5))\r\n return answer\r\n \r\n \r\nn, k = [int(x) for x in input().split()]\r\nanswer = process(n, k)\r\nfor a, b, c, d in answer:\r\n sys.stdout.write(f'{a} {b} {c} {d}\\n')", "n,k=map(int,input().split())\r\nprint(k*(6*n-1))\r\nfor i in range(0,6*n,6):\r\n print(k*(i+1),k*(i+2),k*(i+3),k*(i+5))", "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\nfrom math import gcd\r\ndef main():\r\n n,k=rm()\r\n print((6*n-1)*k)\r\n c=2\r\n for i in range(1,n+1):\r\n x,y,z=6*i-1,6*i-3,6*i-5\r\n while 1:\r\n if gcd(x,c)!=1 or gcd(y,c)!=1 or gcd(z,c)!=1:c+=2\r\n else:break\r\n print(x*k,y*k,z*k,c*k)\r\n c+=2\r\nmain()" ]

[ "n,k = map(int,input().split())\r\ncell = list(map(str,input().strip()))\r\na = cell.index(\"G\")\r\nb = cell.index(\"T\")\r\nif(a>b):\r\n if((a-b)%k != 0):\r\n print(\"NO\")\r\n else:\r\n for i in range(1,(a-b)//k + 1):\r\n if(cell[b + k*i] == \"#\"):\r\n print(\"NO\")\r\n break\r\n elif(cell[b + k*i] == \"G\"):\r\n print(\"YES\")\r\n break\r\nelse:\r\n if((b-a)%k != 0):\r\n print(\"NO\")\r\n else:\r\n for i in range(1,(b-a)//k + 1):\r\n if(cell[a + k*i] == \"#\"):\r\n print(\"NO\")\r\n break\r\n elif(cell[a + k*i] == \"T\"):\r\n print(\"YES\")\r\n break", "import sys\nONLINE_JUDGE = True\n\nif not ONLINE_JUDGE:\n sys.stdin = open(\"input.txt\", \"r\")\n\n############ ---- Input Functions ---- ############\n\ndef inp(): # integer\n return(int(input()))\ndef inlt(): # lists\n return(list(map(int,input().split())))\ndef insr(): # list of characters\n s = input()\n return(list(s))\ndef invr(): # space seperate integers\n return(map(int,input().split()))\n\n############ ---- Solution ---- ############\nn, k = inlt()\nline = insr()\n\nstart = line.index(\"G\")\nend = line.index(\"T\")\n\nif start > end:\n k = -k\n\ndef valid_dir():\n if k > 0:\n return start <= end\n else:\n return start >= end\n\nres = \"NO\"\n\nwhile valid_dir() and (start < n and start >= 0):\n if start == end:\n res = \"YES\"\n break\n if line[start] == \"#\":\n res = \"NO\"\n break\n start += k\n\nsys.stdout.write(res)\n\n\n\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn, k = map(int, input().split())\r\narr = list(input())\r\npos = arr.index(\"G\")\r\ntarget = arr.index(\"T\")\r\nif pos > target:\r\n flag = 0\r\n for i in range(pos, target - 1, -k):\r\n if arr[i] == \"#\":\r\n flag = 0\r\n break\r\n elif arr[i] == \"T\":\r\n flag = 1\r\n break\r\n else:\r\n continue\r\n if flag == 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n flag = 0\r\n for i in range(pos, target + 1, k):\r\n if arr[i] == \"#\":\r\n flag = 0\r\n break\r\n elif arr[i] == \"T\":\r\n flag = 1\r\n break\r\n else:\r\n continue\r\n if flag == 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "# LUOGU_RID: 101647844\nn, k = map(int, input().split())\r\ns = input()\r\nx = s.find('G')\r\ny = s.find('T')\r\nprint(((y - x) % k == 0 and s[x:y:k].find('#') == -1 and s[x:y:-k].find('#') == -1) and 'YES' or 'NO')", "import sys\r\nn,k = map(int,input().split())\r\nstring = input()\r\ngpos = string.index('G')\r\ntpos = string.index('T')\r\n\r\nno = 0\r\nif gpos < tpos:\r\n while gpos != tpos:\r\n gpos += k\r\n if gpos >= n or gpos > tpos or string[gpos] == '#':\r\n no = 1\r\n break\r\n\r\nelse:\r\n while gpos != tpos:\r\n gpos -= k\r\n if gpos < 0 or gpos < tpos or string[gpos] == '#':\r\n no = 1\r\n break\r\nif no == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\n\r\nline = list(map(int, sys.stdin.readline().split()))\r\nk = line[1]\r\nlength = line[0]\r\n\r\nline = sys.stdin.readline()[:-1]\r\ngrasshopper = 0\r\ntarget = 0\r\nfor i in range(len(line)):\r\n if line[i] == 'G':\r\n grasshopper = i\r\n elif line[i] == 'T':\r\n target = i\r\nif (grasshopper > target):\r\n k *= -1\r\nreachable = True\r\nif (grasshopper - target) % k != 0:\r\n reachable = False\r\nfor i in range(grasshopper, target, k):\r\n if line[i] == '#':\r\n reachable = False\r\nif reachable:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nif s.index(\"G\")>s.index(\"T\"):\r\n s=s[::-1]\r\nif \"T\" in s[s.index(\"G\")::k].split(\"#\")[0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def add_possible_jumps(n, k, visited, current, stack):\r\n if current - k >= 0 and not visited[current - k]:\r\n stack.append(current - k)\r\n if current + k < n and not visited[current + k]:\r\n stack.append(current + k)\r\n\r\n\r\ndef ostap_and_grasshopper(n, k, sequence):\r\n visited = [False] * n\r\n start = sequence.find(\"G\")\r\n visited[start] = True\r\n stack = []\r\n add_possible_jumps(n, k, visited, start, stack)\r\n while len(stack) > 0:\r\n current = stack.pop()\r\n if sequence[current] == \"T\":\r\n return True\r\n else:\r\n visited[current] = True\r\n if sequence[current] == \".\":\r\n add_possible_jumps(n, k, visited, current, stack)\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n [n, k] = input().split(\" \")\r\n sequence = input()\r\n output = ostap_and_grasshopper(int(n), int(k), sequence)\r\n print(\"YES\" if output else \"NO\")\r\n", "n,k=map(int,input().split())\r\nst=input()\r\ng_idx=st.index('G')\r\nt_idx=st.index('T')\r\nif g_idx<t_idx:\r\n st=st[g_idx:t_idx+1]\r\nelse:\r\n st=st[t_idx:g_idx+1]\r\n st=st[::-1]\r\ni=0\r\nable=False\r\nwhile i<len(st):\r\n if st[i]=='#':\r\n able=False\r\n break\r\n elif st[i]=='T':\r\n able=True\r\n break\r\n i+=k\r\n\r\nif able:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\n\r\ndisa=disb=-1\r\nstr=input()\r\nFlag=True\r\nfor i in range(a):\r\n if str[i]=='G' :\r\n disa=i\r\n if str[i]=='T' :\r\n disb=i\r\n\r\nif disa>disb:\r\n disa,disb=disb,disa\r\n\r\nif (disb-disa)%b:\r\n Flag=False\r\nelse:\r\n for i in range(disa,disb+1,b):\r\n if str[i]=='#':\r\n Flag=False\r\n\r\nif Flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, j = map(int, input().split())\nv = input()\ng = v.index('G')\nt = v.index('T')\nd = t - g\nif d % j != 0:\n print(\"NO\")\nelse:\n if d > 0:\n if (all([x != '#' for x in v[g:t:j]])):\n print(\"YES\")\n else:\n print(\"NO\")\n if d < 0:\n if (all([x != '#' for x in v[t:g:j]])):\n print(\"YES\")\n else:\n print(\"NO\")\n", "#!/usr/bin/env python3\n\n# ------------------------------\n# cs104c/assignment1/Grasshopper.py\n# Copyright (C) 2017\n# Drew Romanyk\n# ------------------------------\n\n# -------\n# imports\n# -------\n\nimport sys\n\n\n# -------\n# two_button_solve\n# -------\n\ndef grasshopper_solve(r, w):\n \"\"\"\n :param r: reader\n :param w: writer\n :return: Write out the number of steps it took to get to the specified number\n \"\"\"\n # Setup\n data = r.readline().split()\n num_cells = int(data[0])\n hop_distance = int(data[1])\n path = list(r.readline())\n path.pop()\n\n hopper_index = 0\n target_index = 0\n\n for i, val in enumerate(path):\n if val == 'G':\n hopper_index = i\n elif val == 'T':\n target_index = i\n\n result = \"NO\"\n queue = [hopper_index]\n visited = {}\n while len(queue) != 0:\n cur_index = queue.pop(0)\n\n if cur_index == target_index:\n result = \"YES\"\n break\n\n if cur_index not in visited:\n visited[cur_index] = True\n\n # go left hop_distance\n left_dist = cur_index - hop_distance\n if left_dist >= 0 and path[left_dist] != \"#\":\n queue.append(left_dist)\n\n # go right hop_distance\n right_dist = cur_index + hop_distance\n if right_dist < num_cells and path[right_dist] != \"#\":\n queue.append(right_dist)\n\n w.write(result + \"\\n\")\n\n\n# -------\n# main\n# -------\n\nif __name__ == \"__main__\":\n grasshopper_solve(sys.stdin, sys.stdout)\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, k = map(int, input().split())\r\ns = input()\r\ng = s.find(\"G\")\r\nt = s.find(\"T\")\r\na = abs(g - t)\r\nif a % k != 0:\r\n\tprint(\"NO\")\r\n\texit()\r\nfor i in range(min(g, t), max(g, t), k):\r\n\tif s[i] == \"#\":\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")\r\n", "\r\na, b=map(int, input().split())\r\nc=input()\r\ncnt=0\r\nd=0\r\ng=c[::b]\r\ncnt=c.find('G')\r\nd=c.find('T')\r\nif cnt>d:\r\n cnt, d=d, cnt\r\nif (cnt-d)%b!=0:\r\n print(\"NO\")\r\nelse:\r\n for i in range(cnt, d, b):\r\n if c[i]==\"#\":\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\n \r\n\r\n ", "n,k = map(int,input().split())\r\na = input()\r\nhopper = 0\r\ninsect = 0\r\nfor i in range(n):\r\n if a[i]=='G': hopper = i\r\n if a[i]=='T': insect = i\r\nstart = hopper\r\n#print(insect,hopper)\r\nif insect<hopper: k = -1*k\r\nfound = False\r\nwhile start<n and start>=0:\r\n if a[start]=='T': found = True\r\n if a[start]=='#': break\r\n start+=k\r\nif(found): print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n", "n, m = map(int, input().split())\r\na = input()\r\ng = a.find('G')\r\nt = a.find('T')\r\nx = abs(g-t)\r\nif x%m!=0:\r\n print('NO')\r\nelif g>t:\r\n while g!=t:\r\n g-=m\r\n if a[g]=='#':\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\nelse:\r\n while g != t:\r\n g += m\r\n if a[g] == '#':\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n", "n,k=map(int,input().split(' '))\r\ns=input()\r\ns=s[min(s.index('G'),s.index('T')):n]\r\np=0\r\nfor i in range(0,len(s),k):\r\n\tif s[i]=='#':\r\n\t\tbreak\r\n\tif (s[i]=='T' or s[i]=='G') and i>0:\r\n\t\tp=1\r\nif p>0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n, k = map(int, input().split(' '))\ns = input()\ng, h = s.find('G'), s.find('T')\ng, h = min(g,h), max(g,h)\nif (h - g) % k != 0 or any([c == '#' for c in s[g:h:k]]): print('NO')\nelse: print('YES')", "n, k = map(int, input().split())\r\ns = input().strip('.#')\r\ndist = len(s) - 1\r\nprint('NO' if dist % k or '#' in s[0:dist:k] else 'YES')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nind=s.index(\"G\")\r\nind1=s.index(\"T\")\r\nstart=min(ind,ind1)\r\nend=max(ind,ind1)\r\nwhile start<end:\r\n start+=k\r\n if start<n and s[start]==\"#\":\r\n break\r\nif start==end:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "import sys\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\nline = sys.stdin.readline()\r\n\r\nidx_g = line.index('G')\r\nidx_t = line.index('T')\r\n\r\nidx_max = max(idx_g, idx_t)\r\nidx_min = min(idx_g, idx_t)\r\n\r\nif (idx_max - idx_min) % k != 0:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nfor idx in range(idx_min + k, idx_max - k + 1, k):\r\n if line[idx] != '.':\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nprint(\"YES\")\r\nsys.exit()", "data = input()\r\nn = data.split(\" \")[0]\r\ns = data.split(\" \")[1]\r\n\r\np = True\r\npos = 0\r\np_insecto = 0\r\ntrampas = []\r\n\r\n\r\ncelda = input()\r\n\r\nfor i in range(0, len(celda)):\r\n if celda[i] == 'G':\r\n pos = i\r\n if celda[i] == 'T':\r\n p_insecto = i\r\n if celda[i] == '#':\r\n trampas.append(i)\r\n\r\nif pos > p_insecto:\r\n c = pos\r\n pos = p_insecto\r\n p_insecto = c\r\n\r\nd = p_insecto-pos\r\n\r\nif d%int(s) != 0 and p:\r\n print(\"NO\")\r\n p = False\r\n\r\naux = pos+int(s)\r\n\r\nwhile aux <= p_insecto-int(s):\r\n if celda[aux] == '#' and p:\r\n print(\"NO\")\r\n p = False\r\n aux = aux+int(s)\r\nif p:\r\n print(\"YES\")", "n,k = map(int, input().split())\nway=input()\n\na= way.find('G')\nb=way.find('T')\nf=1\nif (b-a)%k==0:\n\t\n\tm=(b-a)/k\n\tif m>0:\n\t\twhile way[a+k*f]=='.':\n\t\t\tf+=1\n\t\tif f==m:\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\tif m<0:\n\t\twhile way[a-k*f]=='.':\n\t\t\tf+=1\n\t\tif f==abs(m):\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\t\t\n\t\t\t\n\t\t\n#\tprint(a,b)\nelse:\n\tprint('NO')", "def solution():\r\n number = input()\r\n seq = input()\r\n\r\n n = int(number.split()[0])\r\n k = int(number.split()[1])\r\n\r\n i = seq.find('T')\r\n j = seq.find('G')\r\n\r\n i, j = min(i, j), max(i, j)\r\n\r\n while i + k <= j:\r\n i += k\r\n if seq[i] == '#':\r\n return False\r\n if seq[i] =='T' or seq[i] == 'G':\r\n return True\r\n return False\r\n\r\n\r\nif(solution()==True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "import copy\r\n\r\ndef ints():\r\n return [int(x) for x in input().split(\" \")]\r\n\r\ndef arr(length, default=0):\r\n return [copy.deepcopy(default) for _ in range(length)]\r\n\r\nn, k = ints()\r\ngrid = input()\r\nvis = arr(len(grid), False)\r\ng = grid.find(\"G\")\r\nt = grid.find(\"T\")\r\n\r\nst = [g]\r\n\r\nwhile st:\r\n node = st.pop()\r\n if node < 0 or node >= n: continue\r\n if grid[node] == '#': continue\r\n if vis[node]: continue\r\n vis[node] = True\r\n if node == t:\r\n print(\"YES\")\r\n break\r\n\r\n st.append(node + k)\r\n st.append(node - k)\r\n\r\nif not vis[t]:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\ns=input()\r\npg,pt=0,0\r\nfor i in range(len(s)):\r\n if s[i]=='G':\r\n pg=i\r\n elif s[i]=='T':\r\n pt=i\r\nif pg>pt:\r\n pg,pt=pt,pg\r\nif (pt-pg)%k!=0:\r\n print('NO')\r\nelse:\r\n while pg<pt:\r\n if s[pg]=='#':\r\n print('NO')\r\n break\r\n pg+=k\r\n else:\r\n print('YES')\r\n", "def solve(s,k):\n G_index = 0\n T_index = 0\n for i in range(len(s)):\n if s[i] == \"G\":\n G_index = i\n if s[i] == \"T\":\n T_index = i\n if T_index > G_index :\n for i in range(G_index, T_index+1,k):\n if s[i] == \"#\":\n return \"NO\"\n if s[i] == \"T\":\n return \"YES\"\n if G_index > T_index :\n for i in range(G_index, T_index-1,-k):\n if s[i] == \"#\":\n return \"NO\"\n if s[i] == \"T\":\n return \"YES\"\n return \"NO\"\n \n\n \n\ndef main():\n n,k = map(int, input().split(' '))\n s = input()\n print(solve(s,k))\n\nmain()", "n, k = map(int, input().split())\ns = input()\nx, y = s.index(\"G\"), s.index(\"T\")\nx, y = min(x, y), max(x, y)\nfor i in range(x, y + 1, k):\n if s[i] == \"#\":\n print(\"NO\")\n break\nelse:\n if i != y:\n print(\"NO\")\n else:\n print(\"YES\")\n", "_, jumps = map(int,input().split())\r\ncourse = input()\r\nif course.index(\"G\") < course.index(\"T\"):\r\n\tfor i in range(course.index(\"G\"), course.index(\"T\")+1,jumps):\r\n\t\tif course[i] == \"#\":\r\n\t\t\tprint(\"NO\")\r\n\t\t\tbreak\r\n\t\tif course[i] == \"T\":\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tfor i in range(course.index(\"T\"), course.index(\"G\")+1,jumps):\r\n\t\tif course[i] == \"#\":\r\n\t\t\tprint(\"NO\")\r\n\t\t\tbreak\r\n\t\tif course[i] == \"G\":\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"NO\")", "import math\r\nn,k=map(int, input().split())\r\n#n=int(input())\r\n#l=list(map(int, input().split()))\r\ns=input()\r\nx=0\r\nif s.index('G')>s.index('T'):\r\n s=s[::-1]\r\nfor i in range(s.index('G'),n,k):\r\n if s[i]=='#':\r\n x=-1\r\n break\r\n elif s[i]=='T':\r\n x=1\r\n break\r\nprint(\"YES\" if x==1 else \"NO\")", "n,k=map(int,input().split())\r\ns=input()\r\na=s.index('G')\r\nb=s.index('T')\r\na,b=min(a,b),max(a,b)\r\nif (b-a)%k!=0:\r\n print('NO')\r\n exit()\r\nfor i in range(a,b+1,k):\r\n if s[i]=='#':\r\n print('NO')\r\n exit()\r\nprint('YES')", "n, k = map(int, input().split())\r\ns = list(input())\r\ngi, ti = None, None\r\nfor i in range(n):\r\n if s[i] == \"G\":\r\n gi = i\r\n if s[i] == \"T\":\r\n ti = i\r\n\r\nif gi > ti:\r\n s[gi], s[ti] = \"T\", \"G\"\r\n gi, ti = ti, gi\r\n\r\nif (ti - gi)%k != 0:\r\n print(\"NO\")\r\nelse:\r\n for i in range(gi, ti+1, k):\r\n if s[i] == \"#\":\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "n,k=map(int,input().split())\r\n\r\ns=[x for x in input()]\r\n\r\n\r\nfor i in range(n):\r\n\tif s[i]==\"G\":\r\n\t\ta=i\r\n\tif s[i]==\"T\":\r\n\t\tb=i\t\r\n# print(a,b)\t\t\r\n# print(len(s))\r\nif a<b:\r\n\r\n\twhile(a<b):\r\n\t\t# if a>b:\r\n\t\t# \tbreak\r\n\t\tif a+k>b:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\n\t\telif s[a+k]==\"#\":\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\n\t\telif s[a+k]==\".\":\r\n\t\t\ta=a+k\r\n\t\t\t# print(a)\r\n\t\t\r\n\t\telif s[a+k]==\"T\":\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\t\t\r\n\r\n\t\t\t\r\nelse:\r\n\r\n\t\twhile(b<a):\r\n\t\t\tif b+k>a:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\texit()\r\n\t\t\telif s[b+k]==\"#\":\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\texit()\r\n\t\t\telif s[b+k]==\".\":\r\n\t\t\t\tb=b+k\r\n\t\t\telif b>a:\r\n\t\t\t\tbreak\r\n\t\t\telif s[b+k]==\"G\":\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit()\t\t\r\n\r\n\r\nprint(\"NO\")\r\n\r\n# n,n1,n2=map(int,input().split())\r\n\r\n# a=[int(x) for x in input().split()]\r\n\r\n\r\n# a.sort(reverse=True)\r\n\r\n# for i in range(n-n1-n2):\r\n# \ta.pop(n-i-1)\r\n# # print(a)\r\n# Sum=0\r\n# Sum2=0\r\n# if n1>n2:\r\n# \tfor i in range(n2):\r\n# \t\tSum2+=a[i]\r\n# \tSum=Sum2/n2\r\n# \t# print(Sum2)\r\n# \tSum2=0\t\r\n# \tfor j in range(n2,len(a)):\t\r\n# \t\t# print(a[j])\r\n# \t\tSum2+=a[j]\r\n# \t# print(Sum2)\t\r\n# \t# Sum2/=n1\t\t\t\r\n# \tSum+=Sum2/n1\r\n\r\n# else:\r\n# \tfor i in range(n1):\r\n# \t\tSum2+=a[i]\r\n# \tSum=Sum2/n1\r\n# \t# print(Sum2)\r\n# \tSum2=0\t\r\n# \tfor j in range(n1,len(a)):\t\r\n# \t\t# print(a[j])\r\n# \t\tSum2+=a[j]\r\n# \t# print(Sum2)\t\r\n# \t# Sum2/=n2\t\t\t\r\n# \tSum+=Sum2/n2\r\n\r\n\t\r\n# print(Sum)\t\t\r\n", "n,k=list(map(int,input().split()))\r\ns=input()\r\ng=s.index(\"G\")\r\nt=s.index(\"T\")\r\nyoxla=0\r\nif g<t:\r\n if (t-g)%k==0:\r\n for i in range(g,t,k):\r\n if s[i]==\"#\":\r\n yoxla=1\r\n break\r\n else:\r\n yoxla=1\r\nelif g>t:\r\n if (g-t)%k==0:\r\n for i in range(g,t,-k):\r\n if s[i]==\"#\":\r\n yoxla=1\r\n break\r\n else:\r\n yoxla=1\r\nif yoxla==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input().split()[1])\r\ns = input().strip(\".#\")\r\nprint(\"YES\" if (len(s)-1)%k == 0 and '#' not in s[::k] else \"NO\")", "n, k = map(int, input().split())\r\ns, res, ins, pl = input(), \"YES\", 0, 0\r\nfor x in range(n):\r\n if s[x] == 'G': ins = x\r\n elif s[x] == 'T': pl = x\r\nif pl > ins:\r\n while True:\r\n pl -= k\r\n if pl < ins or s[pl] == '#':\r\n res = \"NO\"\r\n break\r\n elif pl == ins: break\r\nelse:\r\n while True:\r\n pl += k\r\n if pl > ins or s[pl] == '#':\r\n res = \"NO\"\r\n break\r\n elif pl == ins: break\r\nprint(res)", "def can_eat(k, s):\r\n i = 0\r\n while s[i] not in 'GT':\r\n i += 1\r\n while True:\r\n for j in range(i + 1, i + k):\r\n if s[j] in 'GT':\r\n return False\r\n i += k\r\n if s[i] == '#':\r\n return False\r\n if s[i] in 'GT':\r\n return True\r\n\r\nprint('YES' if can_eat(int(input().split()[1]), input()) else 'NO')", "n, k = tuple(map(int, input().split()))\nfield = input()\ncurrpos = field.find(\"G\")\nT = field.find(\"T\")\nif T < currpos:\n # target is to the left\n while currpos >= 0:\n if field[currpos] == 'T':\n print(\"YES\")\n break\n elif field[currpos] == '#':\n print(\"NO\")\n break\n currpos -= k\n if currpos < 0:\n print(\"NO\")\nelse:\n # target is to the right\n while currpos < len(field):\n if field[currpos] == 'T':\n print(\"YES\")\n break\n elif field[currpos] == '#':\n print(\"NO\")\n break\n currpos += k\n if currpos >= len(field):\n print(\"NO\")\n\n", "import math\r\nimport sys\r\nimport re\r\ndef g(n , s , k):\r\n if abs(s.index('G') - s.index('T')) == k:\r\n return 'YES'\r\n elif abs(s.index('G') - s.index('T'))%k != 0:\r\n return 'NO'\r\n else:\r\n if s.index('G')<s.index('T'):\r\n m = s.index('G') + k\r\n while m < n:\r\n if s[m] == '#':\r\n return 'NO'\r\n elif s[m] == 'T':\r\n return 'YES'\r\n else:\r\n m = m + k\r\n else:\r\n m = s.index('G') - k\r\n while m>=0:\r\n if s[m] == '#':\r\n return 'NO'\r\n elif s[m] == 'T':\r\n return 'YES'\r\n else:\r\n m = m - k\r\n \r\n \r\n \r\nn , k = map(int , input().rstrip().split())\r\ns = input()\r\nprint(g(n , s , k))", "n, k = map(int, input().split())\r\nl = input()\r\nG = l.index(\"G\")\r\nT = l.index(\"T\")\r\nanswer = \"YES\"\r\nfor i in range(min(G, T), max(G, T)+1):\r\n if l[i] == \"#\" and abs(i - G) % k == 0 or\\\r\n l[i] == \"T\" and abs(G - T) % k != 0:\r\n answer = \"NO\"\r\n\r\nprint(answer)\r\n", "n,k=input().split(\" \")\r\nst=input()\r\ng,t = st.index('G'),st.index('T')\r\nif g > t: \r\n\ti = g - t\r\n\tst = st[::-1]\r\n\tg,t = st.index('G'),st.index('T')\r\nelse: i = t - g\r\nif i % int(k) == 0:\r\n\tif \"#\" in st[g:t:int(k)]:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n , k = [int(i) for i in input().split()]\nterrain = input()\n\ngrass = terrain.index('G')\ntarget = terrain.index('T')\nhit_target_flag = False\nif grass > 0:\n position = grass\n while position >= 0 and terrain[position] != \"#\":\n position -= k\n if position == target:\n hit_target_flag = True\n break\nif not hit_target_flag and grass < n-1 :\n position = grass\n while position <= n-1 and terrain[position] != '#':\n position += k\n if position == target:\n hit_target_flag = True\n break\nif hit_target_flag:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "if __name__ == '__main__':\r\n n, k = str(input()).split()\r\n n, k = int(n), int(k)\r\n line = str(input())\r\n pos_l, pos_r = -1, -1\r\n for i in range(n):\r\n if line[i] in ('G', 'T'):\r\n if pos_l >= 0:\r\n pos_r = i\r\n else:\r\n pos_l = i\r\n if (pos_r - pos_l) % k > 0:\r\n print('NO')\r\n else:\r\n flag = True\r\n for i in range(pos_l, pos_r, k):\r\n if line[i] == '#':\r\n flag = False\r\n break\r\n if flag:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "string=input()\r\ns=string.split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nstring1=input()\r\nl=[]\r\nfor i in range(len(string1)):\r\n l.append(string1[i])\r\nindex_start=0\r\nindex_finish=0\r\nfor i in range(n):\r\n if(l[i]==\"G\"):\r\n index_start=i\r\n if(l[i]==\"T\"):\r\n index_finish=i\r\nif(index_finish>index_start):\r\n if((index_finish-index_start)%k!=0):\r\n print(\"NO\")\r\n else:\r\n if(((index_finish-index_start)/k)==1):\r\n print(\"YES\")\r\n else:\r\n i=index_start\r\n found=0\r\n while(i!=index_finish):\r\n if(l[i]==\"#\"):\r\n found=1 \r\n break\r\n i=i+k\r\n \r\n if(found==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n if((index_start-index_finish)%k!=0):\r\n print(\"NO\")\r\n else:\r\n if(((index_start-index_finish)/k)==1):\r\n print(\"YES\")\r\n else:\r\n i=index_finish\r\n found=0\r\n while(i!=index_start):\r\n if(l[i]==\"#\"):\r\n found=1 \r\n break\r\n i=i+k\r\n \r\n if(found==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import sys\n\nn, k = map(int, sys.stdin.readline().split())\nline = input()\n\ng = line.find('G')\nt = line.find('T')\n\nbeg = min(g, t)\nend = max(g, t)\n\nans = True\nif (beg-end) % k != 0:\n ans = False\n\nfor i in range(beg, end, k):\n if line[i] == '#':\n ans = False\n break\n\nif ans:\n print('YES')\nelse:\n print('NO')\n", "len, n = map(int, input().split())\r\nstr = input()\r\nc1, c2 = 0, 0\r\ng = str.find('G')\r\nt = str.find('T')\r\nc1, c2 = 1, 0\r\nif g > t:\r\n for i in range(t, g+1, n):\r\n if str[i] == '#':\r\n c2 = 1\r\n print(\"NO\")\r\n exit()\r\n elif str[i] == 'G':\r\n c2 = 1\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\nelse:\r\n for i in range(g, t+1, n):\r\n if str[i] == '#':\r\n c2 = 1\r\n print(\"NO\")\r\n exit()\r\n elif str[i] == 'T':\r\n c2 = 1\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\n", "n, k = list(map(int, input().split()))\r\ns = input()\r\ng = s.find(\"G\")\r\nt = s.find(\"T\")\r\nif t > g:\r\n if t != len(s) - 1:\r\n s = s[g : t+1 : k]\r\n else:\r\n s = s[g :: k]\r\nelse:\r\n if t != 0:\r\n s = s[g : t - 1: -k]\r\n else:\r\n s = s[g :: -k]\r\nif s.count(\"#\") == 0 and s.find(\"T\") != -1:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")\r\n\r\n", "def hop(nums:int, jump:int, cells:str):\r\n g_index = cells.find('G')\r\n t_index = cells.find('T')\r\n\r\n dir = 1\r\n if t_index < g_index:\r\n dir = -1\r\n\r\n cur = int(g_index)\r\n while cur >= 0 and cur < nums:\r\n if cells[cur] == 'T':\r\n return \"YES\"\r\n elif cells[cur] == '#':\r\n break\r\n cur += jump*dir\r\n if cur < 0 or cur >= nums:\r\n break\r\n\r\n return \"NO\"\r\n\r\n\r\ndef main():\r\n nums, jump = input().split()\r\n cells = input()\r\n\r\n print(hop(int(nums), int(jump), cells))\r\n\r\nif __name__ == \"__main__\":\r\n # execute only if run as a script\r\n main()", "n, k = map(int, input().strip().split())\ns = input().strip()\ng = s.index('G')\nt = s.index('T')\nif abs(t-g) % k != 0:\n\tprint('NO')\nelse:\n\tans = 'YES'\n\tfor i in range(min(t, g), max(t, g)+1, k):\n\t\tif s[i] == '#':\n\t\t\tans = 'NO'\n\t\t\tbreak\n\tprint(ans)", "(n, k), s = map(int, input().split()), input()\r\n \r\nfor i in range(min(s.find('G'), s.find('T')) + k, n, k):\r\n if s[i] == '#':\r\n print('NO')\r\n break\r\n if s[i] in 'GT':\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "def main():\n (n, k) = map(int, input().split(' '))\n s = list(input())\n G = s.index('G')\n T = s.index('T')\n v = set()\n for j in range(G, n, k):\n if s[j] == '#':\n break\n v.add(j)\n for j in range(G, -1, -k):\n if s[j] == '#':\n break\n v.add(j)\n return \"YES\" if T in v else \"NO\"\n\nprint(main())\n", "n,m=map(int,input().split())\r\na=list(input())\r\nif abs(a.index('G')-a.index('T'))%m!=0:\r\n print(\"No\")\r\nelse:\r\n i=a.index('G')\r\n j=a.index('T')\r\n if i>j:\r\n flag=0\r\n while i>=j:\r\n if a[i]=='#':\r\n print(\"No\")\r\n flag=1\r\n break\r\n else:\r\n i=i-m\r\n if flag==0:\r\n print(\"Yes\")\r\n else:\r\n flag=0\r\n while i<=j:\r\n if a[i]=='#':\r\n print(\"No\")\r\n flag=1\r\n break\r\n else:\r\n i=i+m\r\n if flag==0:\r\n print(\"Yes\")", "a, b = map(int, input().split())\r\ns = input().strip('#.')\r\nprint('NO' if ((len(s) - 1) % b or \"#\" in s[0:len(s):b]) else 'YES')", "'''input\n6 2\n..GT..\n'''\nn, k = map(int, input().split())\nc = list(input())\na, b = c.index(\"G\"), c.index(\"T\")\na, b = min(a, b), max(a, b)\nprint(\"YES\" if (b-a) % k == 0 and \"#\" not in c[a:b+1:k] else \"NO\")", "from collections import deque\n\nif __name__ == '__main__':\n found = False\n num_cells, jump_length = tuple(map(int, input().strip().split()))\n line = input().strip()\n target = line.find('T')\n visited = set()\n queue = deque()\n queue.appendleft(line)\n while queue:\n line = queue.pop()\n visited.add(line)\n g_idx = line.find('G')\n if g_idx + jump_length == target or g_idx - jump_length == target:\n found = True\n break\n if g_idx + jump_length < len(line) and line[g_idx+jump_length] != '#':\n new_line = list(line)\n new_line[g_idx] = '.'\n new_line[g_idx+jump_length] = 'G'\n new_line = ''.join(new_line)\n if new_line not in visited:\n queue.appendleft(new_line)\n if g_idx - jump_length >= 0 and line[g_idx-jump_length] != '#':\n new_line = list(line)\n new_line[g_idx] = '.'\n new_line[g_idx-jump_length] = 'G'\n new_line = ''.join(new_line)\n if new_line not in visited:\n queue.appendleft(new_line)\n if found:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "n,k = map(int,input().split())\r\ns = input()\r\ng,t,l = s.index('G'),s.index('T'),len(s)\r\nif t>=g:\r\n\twhile g<l:\r\n\t\tg += k\r\n\t\tif g>=l:\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n\t\tif s[g] == '#':\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n\t\tif s[g] == 'T':\r\n\t\t\tprint('YES')\r\n\t\t\tbreak\r\nelse:\r\n\twhile g>=0:\r\n\t\tg -= k\r\n\t\tif g<0:\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n\t\tif s[g] == '#':\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n\t\tif s[g] == 'T':\r\n\t\t\tprint('YES')\r\n\t\t\tbreak", "n,k=map(int,input().split())\r\ns=input()\r\n\r\ngrass=0\r\nins=0\r\na=str()\r\n\r\nfor i in range(n):\r\n if(s[i]=='G'):\r\n grass=i\r\n break\r\n \r\nfor i in range(n):\r\n if(s[i]=='T'):\r\n ins=i\r\n break\r\n \r\nif((max(ins,grass)-min(ins,grass))%k!=0):\r\n a=\"NO\"\r\nelse:\r\n i=min(ins,grass)\r\n i+=k\r\n j=max(ins,grass)\r\n #print(i,j)\r\n while(i<=j):\r\n if(s[i]=='#'):\r\n a=\"NO\"\r\n break\r\n if(s[i]=='T'):\r\n a=\"YES\"\r\n break\r\n if(s[i]=='G'):\r\n a=\"YES\"\r\n break\r\n i+=k\r\n #print(i)\r\n else:\r\n a=\"NO\"\r\n \r\nprint(a)", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\nif s.index('G')>s.index('T'):s=s[::-1]\r\nx=s.index('G')\r\nfor i in range(x,n):\r\n x+=k\r\n if x>n-1 or s[x]=='#':print(\"NO\");break\r\n elif s[x]=='T':print(\"YES\");break", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-12-01 21:55:26\nLastEditTime: 2021-12-01 22:02:15\nDescription: Ostap and Grasshopper\nFilePath: CF735A.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n s = input().strip()\n start = min(s.index(\"G\"), s.index(\"T\"))\n end = max(s.index(\"G\"), s.index(\"T\"))\n if (end - start) % k != 0:\n print(\"NO\")\n else:\n for i in range(start, end + 1, k):\n if s[i] == \"#\":\n print(\"NO\")\n break\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n func()\n", "n,k=map(int,input().split())\r\na=input()\r\nx,y=sorted([a.index('G'),a.index('T')])\r\nprint('YNEOS'[x%k!=y%k or any(a[x]=='#'for x in range(x,y,k))::2])", "n, k = list(map(int,input().split()))\r\ns = input()\r\nx = s.find('G')\r\nans = False\r\nfor i in range(x, n, k):\r\n if s[i] == '#':\r\n ans = False\r\n break\r\n if s[i] == 'T':\r\n ans = True\r\n break\r\nif ans == True:\r\n print(\"YES\")\r\nelse :\r\n for i in range(x, -1, -k):\r\n if s[i] == '#':\r\n ans = False\r\n break\r\n if s[i] == 'T':\r\n ans = True\r\n break\r\n if ans == True :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\ns = input()\r\nflag = True\r\nfor i in range(min(s.index('G'), s.index('T')), max(s.index('G'), s.index('T')), k):\r\n\tif s[i] == '#':\r\n\t\tflag = False\r\nprint('YES' if abs(s.index('G') - s.index('T')) % k == 0 and flag else 'NO')", "def solve(length, k, array):\n g = 0\n t = 0\n i = 0\n while i < length:\n if array[i] == 'G':\n g = i\n elif array[i] == 'T':\n t = i\n i += 1\n if (g-t)%k != 0:\n print('NO')\n return\n dir = 1\n if g > t:\n dir = -1\n while g != t:\n g += dir*k\n if array[g] == '#':\n print('NO')\n return\n print('YES')\n return\n\ndef main():\n x = tuple(map(int, input().rstrip().split()))\n array = input().rstrip()\n solve(x[0], x[1], array)\n\nif __name__ == '__main__':\n main()\n", "n,k=map(int,input().split())\r\ns=input()\r\na=s.find('G')\r\nb=s.find('T')\r\nif(abs(a-b)%k!=0):\r\n print(\"NO\")\r\nelse:\r\n f=1\r\n for i in range(min(a,b),max(a,b)+1,k):\r\n if(s[i]=='#'):\r\n f=0\r\n print(\"NO\")\r\n break\r\n if(f==1):\r\n print(\"YES\")", "n,k=[int(i) for i in input().split()]\r\ngame=list(input())\r\nfor i in range(len(game)):\r\n\tif game[i]=='T':\r\n\t\tst=i\r\n\tif game[i]=='G':\r\n\t\ten=i\r\nout='YES'\r\nif (max(st,en)-min(st,en))%k!=0:\r\n\t\tout='NO'\t\t\r\nfor i in range(min(st,en),max(st,en),k):\r\n\tif game[i]=='#':\r\n\t\tout='NO'\r\n\t\tbreak\r\nprint(out)\t\r\n\r\n\t\r\n\t\r\n\t\r\n", "# Ostap and Grasshopper\ndef grass(s, k):\n l = s.index('G')\n r = s.index('G')\n while l >= 0:\n if s[l] == '#':\n break\n if s[l] == 'T':\n return \"YES\"\n l -= k\n\n while r < len(s):\n if s[r] == '#':\n break\n if s[r] == 'T':\n return \"YES\"\n r += k\n\n return \"NO\"\n\n\nn, k = list(map(int, input().split()))\ns = input()\nprint(grass(s, k))\n", "N, K = map(int, input().split())\nS = input()\nbad = set([])\nfor i, s in enumerate(S):\n if s == \"#\":\n bad.add(i + 1)\n elif s == \"G\":\n start = i + 1\n elif s == \"T\":\n end = i + 1\nif start < end:\n while start < end:\n start += K\n if start in bad:\n print(\"NO\")\n exit()\n if start == end:\n print(\"YES\")\n exit()\n else:\n print(\"NO\")\n exit()\n\nwhile start > end:\n start -= K\n if start in bad:\n print(\"NO\")\n exit()\nif start == end:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,k=map(int,input().split())\r\ns=list(input())\r\ng,t,f=s.index(\"G\"),s.index(\"T\"),0\r\nif abs(g-t)>=k and abs(g-t)%k==0:\r\n\tfor x in range(min(g,t)+k,max(g,t),k):\r\n\t\tif s[x]==\"#\":\r\n\t\t\tf=1\r\n\t\t\tbreak\r\nelse:f=1\r\nif f==0:print(\"YES\")\r\nelse:print(\"NO\")", "from sys import exit\r\nn, k = map(int, input().split())\r\nstr = input()\r\nfor i in range(len(str)):\r\n if str[i] == 'G':\r\n s = i\r\n if str[i] == 'T':\r\n t = i\r\nif s > t:\r\n s, t = t, s\r\nif (t - s) % k != 0:\r\n print(\"NO\")\r\n exit(0)\r\nfor i in range(s, t, k):\r\n if str[i] == '#':\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "import sys\r\n\r\ndef checkLeft(i, k, str):\r\n\twhile (i >= 0):\r\n\t\tif str[i] == 'T':\r\n\t\t\treturn True\r\n\t\telif str[i] == '#':\r\n\t\t\treturn False\r\n\t\ti -= k\r\n\treturn False\r\n\r\ndef checkRight(j, k, str):\r\n\twhile (j < len(str)):\r\n\t\tif str[j] == 'T':\r\n\t\t\treturn True\r\n\t\telif str[j] == '#':\r\n\t\t\treturn False\r\n\t\tj += k\r\n\treturn False\r\n\r\n\r\n\r\nline = sys.stdin.readline()\r\nstr = sys.stdin.readline()\r\n\r\nnums = line.split(\" \")\r\nn = int(nums[0])\r\nk = int(nums[1])\r\n\r\ni = str.find('G')\r\nj = str.find('G')\r\n\r\n\r\nif checkLeft(i, k, str) or checkRight(i, k, str):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ns=str(input())\r\nc=0\r\ntarget=s.index(\"T\")\r\nstart=s.index(\"G\")\r\nif (target-start)%m==0:\r\n \r\n if target-start>0:\r\n for i in range(start,target+1,m):\r\n if s[i]==\"#\":\r\n c=1\r\n break\r\n else:\r\n for i in range(target,start+1,m):\r\n if s[i]==\"#\":\r\n c=1\r\n break\r\nelse:\r\n c=1\r\nif c==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n ", "n, k=list(map(int,input().split()))\r\nstr1=input()\r\nind1=str1.index('G')\r\nind2=str1.index('T')\r\nif ind1>ind2:\r\n str1=str1[::-1]\r\nind3=str1.index('G')\r\nind4=str1.index('T')\r\nstr1=str1[:max(ind3,ind4)+1]\r\nstr1=str1[min(ind3,ind4):]\r\nm=0\r\nfor i in range(len(str1)):\r\n try:\r\n if str1[m+k]=='#':\r\n print('NO')\r\n break\r\n elif str1[m+k]=='T':\r\n print('YES')\r\n break\r\n m+=k\r\n except:\r\n print('NO')\r\n break", "def main():\n _,k = map(int, input().split())\n arr = input()\n G = 0\n T = 0\n for i in range(len(arr)):\n if arr[i] == 'G':\n G = i\n elif arr[i] == 'T':\n T = i\n while(G>T):\n G -= k\n if G == T:\n print('YES')\n return\n elif G < T or arr[G] == '#':\n print('NO')\n return\n while(G<T):\n G += k\n if G == T:\n print('YES')\n return\n elif G > T or arr[G] == '#':\n print('NO')\n return\nmain()", "n, k = map(int, input().split())\r\ns = input()\r\ng = 0\r\nwhile s[g] != 'G':\r\n g += 1\r\nt = 0\r\nwhile s[t] != 'T':\r\n t += 1\r\nif t < g:\r\n t, g = g, t\r\nif (t - g) % k > 0:\r\n print(\"NO\")\r\nelse:\r\n for i in range(g, t, k):\r\n if s[i] == '#':\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip().split('\\n')\r\n n, k = map(int, s[0].split())\r\n x, y = sorted((s[1].index('G'), s[1].index('T')))\r\n if (y-x)%k: return 'NO'\r\n return ('NO', 'YES')[all(s[1][i] == '.' for i in range(x+k, y, k))]\r\n\r\nprint(main())\r\n", "nums = input().split()\ntemp = input()\npos = list(temp)\njump = int(nums[1])\nstart = temp.index('G')\nq = []\nq.append(start)\nfound = False\nwhile q:\n index = q.pop(0)\n if index >= 0 and index < int(nums[0]):\n current = pos[index]\n pos[index] = 'V'\n if current == 'T':\n print('YES')\n found = True\n break\n if current == '.' or current == 'G':\n q.append(index + jump)\n q.append(index - jump)\nif not found:\n print('NO')\n\n", "from sys import stdin,stdout\r\ndef solve():\r\n n,k=map(int, stdin.readline().strip().split())\r\n s=stdin.readline().strip()\r\n a=s.index(\"G\")\r\n b=s.index(\"T\")\r\n if abs(a-b)%k!=0:\r\n print(\"NO\")\r\n return\r\n if a>b:a,b=b,a\r\n for i in range(a,b+1,k):\r\n if s[i]==\"#\":\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\nfor i in range(1):\r\n solve()\r\n\r\n\r\n", "n , k = map(int,input().split())\r\ns = list(input())\r\ntindex = s.index(\"T\")\r\ngindex = s.index(\"G\")\r\nif tindex >gindex:\r\n for char in s[gindex:tindex+1:k]:\r\n if char == \"T\":\r\n print(\"YES\")\r\n exit()\r\n if char == \"#\":\r\n print(\"NO\")\r\n exit()\r\n print(\"NO\")\r\nelse:\r\n for char in s[tindex:gindex+1:k]:\r\n if char == \"G\":\r\n print(\"YES\")\r\n exit()\r\n if char == \"#\":\r\n print(\"NO\")\r\n exit()\r\n print(\"NO\")", "def solution(l1,l2):\r\n n = l1[0]\r\n k = l1[1]\r\n if l2.index(\"G\")<l2.index(\"T\"):lower,upper=\"G\",\"T\"\r\n else:lower,upper=\"T\",\"G\"\r\n\r\n slizey = l2[min(l2.index(lower),l2.index(upper)):max(l2.index(lower),l2.index(upper))+1]\r\n i=0\r\n if (l2.index(upper)-l2.index(lower))%k:\r\n return \"NO\"\r\n while i<len(slizey):\r\n if slizey[i]==\"#\":\r\n return \"NO\"\r\n i+=k\r\n return \"YES\"\r\n \r\n \r\n \r\n \r\n\r\n \r\ndef answer():\r\n l1=[int(x) for x in input().split()]\r\n l2=list(input())\r\n print(solution(l1,l2))\r\nanswer()", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n n,k = map(int,input().split())\r\n s = str(input())\r\n i = s.find('G')\r\n j = s.find('T')\r\n if i < j:\r\n if (j-i)%k == 0:\r\n while i != j:\r\n if s[i] == '#':\r\n print(\"NO\")\r\n exit()\r\n i += k\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n if (i - j)%k == 0:\r\n while i != j:\r\n if s[i] == '#':\r\n print(\"NO\")\r\n exit()\r\n i -= k\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\nn,k = map(int, input().split(' '))\r\ns = input()\r\ng_ind = s.index('G')\r\nt_ind = s.index('T')\r\nind = g_ind\r\nif g_ind > t_ind:\r\n r = \"NO\"\r\n while ind > t_ind-1 and s[ind] != '#':\r\n if ind == t_ind:\r\n r = \"YES\"\r\n break\r\n ind -= k\r\n print(r)\r\nelse:\r\n r = \"NO\"\r\n while ind < t_ind+1 and s[ind] != '#':\r\n if ind == t_ind:\r\n r = \"YES\"\r\n break\r\n ind += k\r\n print(r)", "import sys\r\nn, j = [int(a_temp) for a_temp in input().strip().split()]\r\nline = input().strip()\r\nt=g=-1\r\nfor i,c in enumerate(line):\r\n if c=='T':\r\n t = i\r\n elif c=='G':\r\n g = i\r\ndistance = abs(t-g)\r\nif j>n or distance%j!=0:\r\n print(\"NO\")\r\nelse:\r\n if t<g:\r\n t,g = g,t\r\n while (t!=g):\r\n g+=j\r\n if line[g]=='#':\r\n print(\"NO\")\r\n sys.exit()\r\n print(\"YES\")", "inpLine=input()\r\ninpLine=inpLine.split()\r\nn=int(inpLine[0])\r\nk=int(inpLine[1])\r\n\r\nseq=input()\r\n\r\ngrass=-1\r\ninsect=-1\r\n\r\nfor i in range (len(seq)):\r\n if seq[i] == \"G\":\r\n grass=i\r\n elif seq[i]==\"T\":\r\n insect=i\r\n if grass!=-1 and insect!=-1:\r\n break\r\n\r\n\r\nif grass>insect:\r\n for i in range(grass,insect-1,-k):\r\n if i==insect:\r\n print(\"YES\")\r\n exit()\r\n if seq[i] == \"#\":\r\n print(\"NO\")\r\n exit()\r\n\r\nelse:\r\n for i in range(grass,insect + 1,k):\r\n if i==insect:\r\n print(\"YES\")\r\n exit()\r\n if seq[i]==\"#\":\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"No\")", "n,k = map(int,input().split())\r\ns = input()\r\nst = s.find(\"G\")\r\nt = s.find(\"T\")\r\nif abs(st - t) % k != 0:\r\n print(\"NO\")\r\nelse:\r\n ans = \"YES\"\r\n for i in range(min(st,t),max(st,t),k):\r\n if s[i] == \"#\":\r\n ans = \"NO\"\r\n break\r\n print(ans)\r\n", "k=int(input().split()[1])\r\ns=input().strip(\".#\")\r\nprint(\"NO\"if(len(s)-1)%k or\"#\"in s[0:len(s):k]else\"YES\")", "# find the relative position between G and T\n# G needs to get to T\n\ndef solution(s, step):\n # get idx of G and idx of T\n idxG, idxT = 0, 0\n for i in range(len(s)):\n if s[i] == 'G':\n idxG = i\n if s[i] == 'T':\n idxT = i\n # now we have the position, if G < T, from left to right\n # if G > T, from right to left\n if idxG < idxT:\n while idxG < len(s):\n if s[idxG] == 'T':\n return 'YES'\n elif s[idxG] == '#':\n return 'NO'\n idxG += step\n return 'NO'\n else:\n while idxG >= 0:\n if s[idxG] == 'T':\n return 'YES'\n elif s[idxG] == '#':\n return 'NO'\n idxG -= step\n return 'NO'\n\n\nif __name__ == '__main__':\n n, step = input().strip().split()\n s = input()\n print(solution(s, int(step)))", "n,k=map(int,input().split())\r\ns=input()\r\nx=s.index('G')\r\ny=s.index('T')\r\nif \"#\" in s:\r\n\tz=s.index('#')\r\nflag=0\r\nif x>y:\r\n\tif (x-y)%k==0:\r\n\t\tfor i in range(y,x):\r\n\t\t\tif s[i]==\"#\" and (x-i)%k==0:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\t\telif i==x-1:\r\n\t\t\t\tflag=1\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tbreak\r\nelif x<y:\r\n\tif (y-x)%k==0:\r\n\t\tfor i in range(x,y):\r\n\t\t\tif s[i]==\"#\" and (i-x)%k==0:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\t\telif i==y-1:\r\n\t\t\t\tflag=1\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tbreak\r\nif flag==0:\r\n\tprint(\"NO\")", "n,k=map(int,input().split())\r\ns=input()\r\nx,y=s.index(\"G\"),s.index(\"T\")\r\nif (x-y)%k!=0:\r\n print(\"NO\")\r\nelse:\r\n flag=0\r\n if x > y:\r\n k=-1*k\r\n for i in range(x,y,k):\r\n if s[i]==\"#\":\r\n flag=1\r\n if flag:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "def solution():\r\n n, k = map(int, input().split())\r\n ways = input()\r\n\r\n gi = ways.index('G')\r\n ti = ways.index('T')\r\n\r\n dis = abs(gi - ti)\r\n\r\n r = dis % k\r\n\r\n if r != 0:\r\n print('NO')\r\n return\r\n\r\n q = dis // k\r\n\r\n if gi < ti:\r\n for i in range(q):\r\n if ways[gi + i * k] == '#':\r\n print('NO')\r\n return\r\n else:\r\n for i in range(q):\r\n if ways[gi - i * k] == '#':\r\n print('NO')\r\n return\r\n\r\n print('YES')\r\n\r\nsolution()", "n, k = map(int, input().split())\nstring = input()\ng = string.index('G')\nt = string.index('T')\nif abs((t - g)) % k == 0:\n for i in range(min(g, t), max(g, t), k):\n if string[i] == '#':\n print('NO')\n exit()\n print('YES')\n \nelse:\n print('NO')\n \t\t \t \t \t\t \t \t \t\t\t\t \t", "n,k = map(int,input().split(\" \"))\nfield = input()\nflag = True\ndistance = field.find('T')-field.find('G')\nif abs(distance) % k != 0:\n flag = False\nelse:\n direction = distance > 0\n for i in range(field.find('G'),field.find('T'),k if direction else -k):\n flag = (flag and (field[i] != '#'))\nprint(\"YES\" if flag else \"NO\")\n", "n,k = map(int,input().split())\r\nn -= 1\r\nf = input().strip()\r\nt,g = f.index('T'),f.index('G')\r\nif t > g:\r\n w = 0\r\n while g + k <= n:\r\n g += k\r\n a = f[g]\r\n if a == 'T':\r\n w = 1\r\n break\r\n if a != '.':\r\n break\r\n print('NO'if not w else'YES')\r\nelse:\r\n w = 0\r\n while g - k >= 0:\r\n g -= k\r\n a = f[g]\r\n if a == 'T':\r\n w = 1\r\n break\r\n if a != '.':\r\n break\r\n print('NO'if not w else'YES')", "n,k=list(map(int,input().strip().split()))\r\na=input()\r\nt=a.index(\"G\")\r\np=a.index(\"T\")\r\nif t==p:\r\n print(\"YES\")\r\nelif p>t:\r\n for i in range(t,n,k):\r\n if a[i]==\"T\":\r\n print(\"YES\")\r\n break\r\n elif a[i]==\"#\":\r\n print(\"NO\")\r\n break\r\n else:\r\n pass\r\n else:\r\n print(\"NO\")\r\nelse:\r\n a=a[::-1]\r\n t=n-t-1\r\n for i in range(t,n,k):\r\n if a[i]==\"T\":\r\n print(\"YES\")\r\n break\r\n elif a[i]==\"#\":\r\n print(\"NO\")\r\n break\r\n else:\r\n pass\r\n else:\r\n print(\"NO\")\r\n\r\n", "# print(\"Input n and k\")\nn, k = (int(x) for x in input().split())\n# print(\"Input the row\")\nst = input()\n\nstart = st.find(\"G\")\nfinish = st.find(\"T\")\nfound = False\n\nif start < finish: # Moving to the right\n pos = start\n while pos < len(st):\n if st[pos] == \"T\":\n found = True\n break\n elif st[pos] == \"#\" or pos > finish:\n break\n else:\n pos += k\nelse: # Moving to the left\n pos = start\n while pos >= 0:\n if st[pos] == \"T\":\n found = True\n break\n elif st[pos] == \"#\" or pos < finish:\n break\n else:\n pos -= k\n\nif found == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "n,k=map(int,input().split())\r\ns=list(input())\r\nflag=1\r\nfor i in range(n):\r\n if(s[i]=='G'):\r\n x=i\r\n if(s[i]=='T'):\r\n y=i\r\nif(abs(x-y)%k!=0):\r\n print(\"NO\")\r\nelse:\r\n if(x<y):\r\n for i in range(x,y+1,k):\r\n if(s[i]==\"#\"):\r\n print(\"NO\")\r\n flag=0\r\n break\r\n if(flag==1):\r\n print(\"YES\")\r\n elif(y<x):\r\n for i in range(y,x+1,k):\r\n if(s[i]==\"#\"):\r\n flag=0\r\n print(\"NO\")\r\n break\r\n if(flag==1):\r\n print(\"YES\")\r\n else:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\nline = input()\r\ngras_pos=line.index('G')\r\nins_pos=line.index('T')\r\ndis=abs(gras_pos-ins_pos)\r\nif dis%k==0:\r\n path_start=min(gras_pos,ins_pos)\r\n path_end=max(gras_pos,ins_pos)\r\n path_clear=True\r\n for i in range(path_start+k,path_end,k):\r\n if line[i]=='#':\r\n path_clear=False\r\n break\r\n if path_clear:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k=map(int,input().split())\r\ns=input().strip()\r\n\r\nm=min(s.index('G'),s.index('T'))\r\nflag=0\r\nfor i in range(m+k,n,k):\r\n if s[i]=='#':\r\n flag=1\r\n print(\"NO\")\r\n break\r\n if s[i]=='G' or s[i]=='T':\r\n flag=1\r\n print(\"YES\")\r\n break\r\nif flag==0:\r\n print('NO')\r\n \r\n", "import sys\nlines = [line.strip() for line in sys.stdin]\nn, k = map(int, lines[0].split(' '))\nmaze = lines[1]\n\nstart = maze.index('G')\nend = maze.index('T')\noffset = abs(start - end)\n\nlessThan = None\n\nwhile True:\n if start < 0 or start >= n:\n print(\"NO\")\n sys.exit(0)\n\n if maze[start] == '#':\n print(\"NO\")\n sys.exit(0)\n\n if start == end:\n print(\"YES\")\n sys.exit(0)\n\n if start < end:\n start += k\n if start > end:\n print(\"NO\")\n sys.exit(0)\n\n else:\n start -= k\n if start < end:\n print(\"NO\")\n sys.exit(0)\n", "n,k=map(int,input().split())\r\nlst=list(input())\r\nkuzne4ik=lst.index(\"G\")\r\ntarakan=lst.index(\"T\")\r\nif kuzne4ik<tarakan:\r\n while True:\r\n kuzne4ik+=k\r\n if kuzne4ik>n-1:\r\n print(\"NO\")\r\n exit()\r\n if lst[kuzne4ik]==\"T\":\r\n print(\"YES\")\r\n exit()\r\n if lst[kuzne4ik]==\"#\":\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n while True:\r\n if kuzne4ik<0:\r\n print(\"NO\")\r\n exit()\r\n kuzne4ik-=k\r\n if lst[kuzne4ik]==\"#\":\r\n print(\"NO\")\r\n exit()\r\n if lst[kuzne4ik]==\"T\":\r\n print(\"YES\")\r\n exit()\r\n \r\n ", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[n, k] = list(map(int, input().split()))\r\ns = input()\r\n\r\ndef dfs(v):\r\n vis[v] = 1\r\n res = False\r\n if s[v] == 'T':\r\n return True\r\n if v+k < n and vis[v+k] == 0 and s[v+k] != '#':\r\n res |= dfs(v+k)\r\n if v-k >= 0 and vis[v-k] == 0 and s[v-k] != '#':\r\n res |= dfs(v-k)\r\n return res\r\n\r\nvis = [0 for i in range(n)]\r\nfor i in range(n):\r\n if s[i] == 'G':\r\n if dfs(i) == True: \r\n print('YES')\r\n exit(0)\r\n else:\r\n print('NO')\r\n exit(0)\r\n \r\n", "n,k = map(int, input().split())\r\ns = input()\r\nif s.index(\"G\") < s.index(\"T\"):\r\n subset_s = s[s.index(\"G\"): s.index(\"T\")+1]\r\nelse:\r\n subset_s = (s[s.index(\"T\"): s.index(\"G\")+1])[::-1]\r\nfor i in range(0,len(subset_s),k):\r\n if subset_s[i]==\"#\":\r\n print(\"NO\")\r\n break\r\n if subset_s[i]==\"T\":\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n,k = map(int,input().split())\r\ns = input()\r\nT = -1\r\nG = -1\r\nfor i in range(len(s)):\r\n\tif(s[i]=='T'):\r\n\t\tT=i\r\n\telif(s[i]=='G'):\r\n\t\tG=i\r\nif T<G:\r\n\twhile(G>=0):\r\n\t\tG-=k\r\n\t\tif(G<0):\r\n\t\t\tG+=k\r\n\t\t\tprint('NO')\r\n\t\t\texit(0)\r\n\t\tif(s[G]=='#'):\r\n\t\t\tprint('NO')\r\n\t\t\texit(0)\r\n\t\telif(T==G):\r\n\t\t\tprint('YES')\r\n\t\t\texit(0)\r\nelse:\r\n\twhile(G<n):\r\n\t\tG+=k\r\n\t\tif(G>=n):\r\n\t\t\tG-=k\r\n\t\t\tprint('NO')\r\n\t\t\texit(0)\r\n\t\tif(s[G]=='#'):\r\n\t\t\tprint('NO')\r\n\t\t\texit(0)\r\n\t\telif(T==G):\r\n\t\t\tprint('YES')\r\n\t\t\texit(0)\r\nprint('NO')", "n, k = map(int, input().split())\r\na = list(input())\r\nb = a.index(\"G\")\r\nc = a.index(\"T\")\r\nif c < b: a[c] = \"G\"; a[b] = \"T\"; c,b = b,c\r\nif abs(c - b) % k != 0: print(\"NO\")\r\nelse:\r\n for i in range(b,c+1,k):\r\n if a[i] == \"#\": print(\"NO\"); exit()\r\n print(\"YES\")", "n,k=map(int,input().split())\r\ns=input()\r\na=s.index(\"G\")\r\nb=s.index(\"T\")\r\nif b>a:\r\n c=b-a\r\n if c%k!=0:\r\n print(\"NO\")\r\n else:\r\n for i in range(a+k,n,k):\r\n if s[i]==\"#\":\r\n print(\"NO\")\r\n break\r\n if s[i]==\"T\":\r\n print(\"YES\")\r\n break\r\nif a>b:\r\n c=a-b\r\n if c%k!=0:\r\n print(\"NO\")\r\n else:\r\n for i in range(a-k,-1,-k):\r\n if s[i]==\"#\":\r\n print(\"NO\")\r\n break\r\n if s[i]==\"T\":\r\n print(\"YES\")\r\n break \r\n \r\n", "import sys\r\nfrom collections import deque\r\n\r\ninputs = sys.stdin.read().split('\\n')\r\nparas = inputs[0].split(' ')\r\nnumCells, hopDist = int(paras[0]), int(paras[1])\r\nline = inputs[1]\r\n\r\nstartPos = 0\r\ngoalPos = 0\r\nfor idx, cell in enumerate(line):\r\n\tif cell == 'G':\r\n\t\tstartPos = idx\r\n\telif cell == 'T':\r\n\t\tgoalPos = idx\r\n\r\nif abs(goalPos - startPos) % hopDist != 0:\r\n\tprint(\"NO\")\r\n\texit()\r\n\r\ncurrPos = startPos\r\nwhile (True):\r\n\tcurrPos += (hopDist if goalPos > startPos else -hopDist)\r\n\tif line[currPos] == '#':\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\telif line[currPos] == 'T':\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\r\n\r\n", "# A. Ostap and Grasshopper\n\nn, k = map(int, input().split())\ns = input()\n\ng = s.index('G')\nt = s.index('T')\n\nif abs(g - t) % k == 0:\n sign = 1 if g < t else -1\n while g != t:\n if s[g] == '#':\n break\n g += sign * k\n\nif g == t:\n print('YES')\nelse:\n print('NO')\n", "n, k = map(int, input().split())\r\nw = input()\r\n\r\ng = w.index('G')\r\nt = w.index('T')\r\ngt = abs(g - t)\r\nif gt % k != 0:\r\n print(\"NO\")\r\nelse:\r\n s = 1 if t > g else -1\r\n ok = all(w[g + i*s*k] != '#' for i in range(1, abs(g - t) // k))\r\n print([\"NO\",\"YES\"][ok])", "n, k = [int(x) for x in input().split()]\r\nline = input()\r\n\r\njumpLen = k if line.find('G') < line.find('T') else -k\r\npos = line.find('G')\r\nwhile True:\r\n pos += jumpLen\r\n if (pos < 0) or (pos >= n) or line[pos] == '#':\r\n print('NO')\r\n break\r\n if line[pos] == 'T':\r\n print('YES')\r\n break", "n, k = list(map(int, input().split()))\nmaze = input()\nspots = list(maze)\ngrass = [spots.index('G')]\ntarget = spots.index('T')\n\nwhile grass:\n look = grass.pop()\n if 0<=look<n:\n if look == target:\n print('YES')\n exit()\n if spots[look] != '#':\n spots[look]='#'\n grass.append(look+k)\n grass.append(look-k)\nprint('NO')\n", "n, k = map(int, input().split())\r\nline = input()\r\nsteps = []\r\nposg, post = line.index('G') , line.index('T')\r\ndist = abs(line.index('G') - line.index('T'))\r\n\r\nif dist%k != 0:\r\n\tprint(\"NO\")\r\n\texit()\r\n\r\nwhile posg != post:\r\n\tif post > posg:\r\n\t\tposg+=k\r\n\telse:\r\n\t\tposg-=k\r\n\tsteps.append(line[posg])\r\n\r\nif '#' in steps:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "l,t = map(int,input().split())\r\na = input()\r\nif a.index(\"T\") < a.index(\"G\"):a = a[::-1]\r\nb = a.index(\"G\")\r\nfor i in range(b,l,t):\r\n if a[i] == \"T\":\r\n print(\"YES\")\r\n break\r\n elif a[i] == \"#\":\r\n print(\"NO\")\r\n break\r\nelse:print(\"NO\")", "def grass():\r\n import sys\r\n # input\r\n n, m = (int(x) for x in input().split())\r\n l = input()\r\n\r\n g_pos = l.index('G')\r\n t_pos = l.index('T')\r\n if t_pos < g_pos:\r\n t_pos, g_pos = g_pos, t_pos\r\n \r\n g = g_pos\r\n while g < len(l):\r\n if l[g] == '#':\r\n print(\"NO\")\r\n return\r\n elif g == t_pos:\r\n print(\"YES\")\r\n return\r\n g += m\r\n print(\"NO\")\r\n \r\ngrass()", "n,k = map(int,input().split())\r\nl = input()\r\ni = l.find('G')\r\nt = False\r\nwhile i < n - k :\r\n i += k\r\n if l[i] == 'T':\r\n print('YES')\r\n t = True\r\n break\r\n elif l[i] == '#':\r\n break\r\nwhile i > k - 1 :\r\n i -= k\r\n if l[i] == 'T':\r\n print('YES')\r\n t = True\r\n break\r\n elif l[i] == '#':\r\n break\r\nif t == False:\r\n print('NO')\r\n", "import copy\nlst=list(map(int,input().split(\" \")))\nn=lst[0]\nk=lst[1]\ns=input()\np_G=copy.copy(s.find('G'))\np_T=copy.copy(s.find('T'))\ni=1\nif abs(p_T - p_G) %k==0:\n while(not p_T == p_G):\n p_T += ((p_G - p_T)//abs(p_G - p_T))*(i*k)\n if s[p_T] =='#':\n print('NO')\n break\n elif p_T==p_G:\n print('YES')\nelse:\n print('NO')\n\n\t\t\t \t \t\t \t\t\t\t \t\t\t \t\t", "from sys import stdin\r\n\r\n#Respectively, n-length of line and k cells of jumping distance\r\nn, k = map(int, stdin.readline().rstrip().split())\r\n\r\n#Line of cells\r\ncells = stdin.readline().split()[0]\r\n\r\ng_pos = cells.index('G') #position of grasshopper\r\n\r\nt_pos = cells.index('T') #position of insect\r\n\r\noutput = ''\r\n\r\nif g_pos > t_pos: #if position of grasshopper greater than insect\r\n ptr = g_pos - k\r\n while ptr >= 0:\r\n if cells[ptr] == '#':\r\n output = 'NO'\r\n break\r\n elif cells[ptr] == 'T':\r\n output = 'YES'\r\n break\r\n else:\r\n ptr = ptr - k\r\n if ptr < 0:\r\n output = 'NO'\r\nelse: #if position of grasshopper less than insect\r\n ptr = g_pos + k\r\n while ptr < n:\r\n if cells[ptr] == '#':\r\n output = 'NO'\r\n break\r\n elif cells[ptr] == 'T':\r\n output = 'YES'\r\n break\r\n else:\r\n ptr = ptr + k\r\n if ptr >= n:\r\n output = 'NO'\r\n\r\nprint(output)\r\n", "#!/usr/bin/env python3\n\nimport sys\n\nf_line = sys.stdin.readline()\nf_input = f_line.split()\ncell_size = int(f_input[0])\njump_size = int(f_input[1])\n\ns_line = sys.stdin.readline()\ns_input = list(s_line)\n\neaten = False\ncurr_index = 0\nanimal_received = 0\nwhile (eaten == False and curr_index < cell_size):\n if(s_input[curr_index] == 'G' or s_input[curr_index] == \"T\"):\n if(animal_received == 0):\n animal_received = 1\n curr_index = curr_index + jump_size\n elif(animal_received == 1):\n eaten = True\n elif(animal_received == 1):\n if(s_input[curr_index] == '.'):\n curr_index = curr_index + jump_size\n else:\n curr_index = curr_index + cell_size + 2\n else:\n curr_index = curr_index + 1\n\nif(eaten == False):\n print(\"NO\")\nelse:\n print(\"YES\")\n", "# author: dgauraang\r\nclass Node:\r\n def __init__(self, value='.', adj_list=None):\r\n if adj_list == None:\r\n self.adj_list = []\r\n else:\r\n self.adj_list = adj_list\r\n \r\n self.value = value\r\n self.scratch = 0\r\n\r\n def add_node (self, node):\r\n self.adj_list.append(node)\r\n \r\n def get_node (self, index):\r\n return self.adj_list[index]\r\n\r\n def dfs (self, k):\r\n visited = set()\r\n stack = []\r\n stack.append(self)\r\n self.scratch = 0\r\n found = False\r\n\r\n while (len(stack) > 0):\r\n curr_node = stack.pop()\r\n curr_scratch = curr_node.scratch\r\n\r\n if curr_scratch == 0:\r\n # Don't add children to stack\r\n if curr_node.value == '#':\r\n continue\r\n # Finished\r\n elif curr_node.value == 'T':\r\n stack.clear()\r\n found = True\r\n print('YES')\r\n\r\n if curr_node not in visited:\r\n visited.add(curr_node)\r\n\r\n new_scratch = (curr_scratch + 1) % k\r\n\r\n for node in curr_node.adj_list:\r\n node.scratch = new_scratch\r\n stack.append(node)\r\n\r\n if not found:\r\n print('NO')\r\n\r\nif __name__ == '__main__':\r\n # Gather input\r\n nk_arr = input().split(' ')\r\n n = int(nk_arr[0])\r\n k = int(nk_arr[1])\r\n\r\n line = input()\r\n # Build graph\r\n g_node = Node(value='G')\r\n init_pos = line.index('G')\r\n start_node = g_node\r\n\r\n for i in range(init_pos + 1, len(line)):\r\n start_node.add_node(Node(value=line[i]))\r\n start_node = start_node.adj_list[-1]\r\n \r\n start_node = g_node\r\n\r\n for i in range(init_pos - 1, -1, -1):\r\n start_node.add_node(Node(value=line[i]))\r\n start_node = start_node.adj_list[-1]\r\n\r\n g_node.dfs(k)\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\ns = input().split()[0]\r\ng = s.find('G')\r\nt = s.find('T')\r\nmi = min(g,t)\r\nma = max(g,t)\r\nans = s[mi:ma+1:k]\r\nif ((ma-mi)%k!=0):\r\n print ('NO')\r\nelif ans.find('#') > -1:\r\n print ('NO')\r\nelse:\r\n print ('YES')", "n, k = map(int, input().split())\n\ns = input()\n\ng = -1\nt = -1\n\nfor i in range(n):\n if s[i] == 'G':\n g = i\n\n if s[i] == 'T':\n t = i\n\nst = g\n\nwhile True:\n st += k\n if st >= n or s[st] == '#':\n break\n\n if st == t:\n print(\"YES\")\n exit()\n\nwhile True:\n st -= k\n if st < 0 or s[st] == '#':\n break\n\n if st == t:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\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\ni1,i2=s.index('G'),s.index('T')\r\nif abs(i2-i1)%k==0:\r\n i=min(i1,i2)\r\n flag=0\r\n for i in range(i,max(i1,i2)+1,k):\r\n if s[i]=='#':\r\n flag=1 \r\n break \r\n if flag==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\ns=input()\r\n\r\nfor i in s:\r\n if i=='G':\r\n g = s.index(i)\r\n elif i=='T':\r\n t = s.index(i)\r\na=min(g,t)\r\nb=max(g,t)\r\nflag=0;\r\nfor i in range(a, b+1, k):\r\n if s[i] == '#' :\r\n break\r\n if i == b:\r\n flag=1\r\n break\r\nif flag==0:print (\"NO\")\r\nelse:print (\"YES\")\r\n", "n,k = map(int,input().split())\r\nl=list(input())\r\nfor i in range(n):\r\n\tif(l[i]==\"G\" or l[i]==\"T\"):\r\n\t\tfor j in range(i,n,k):\r\n\t\t\tif(j==i):\r\n\t\t\t\tcontinue\r\n\t\t\tif(l[j]==\"#\"):\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\tbreak\r\n\t\t\telif(l[j]==\"G\" or l[j]==\"T\"):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\tbreak\r\n", "a, b = map(int, input().split())\r\nd = input().split('G')\r\nif 'T' in d[0]:\r\n e = list(d[0].split('T')[1])\r\n e.insert(0, 'T')\r\n e.append('G')\r\n flag1 = True\r\n flag2 = False\r\n for i in range(0, len(e), b):\r\n if e[i] == 'G':\r\n flag2 = True\r\n elif e[i] == '#':\r\n flag1 = False\r\n break\r\n if flag1 and flag2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n e = list(d[1].split('T')[0])\r\n e.append('T')\r\n e.insert(0, 'G')\r\n flag1 = True\r\n flag2 = False\r\n for i in range(0, len(e), b):\r\n if e[i] == 'T':\r\n flag2 = True\r\n elif e[i] == '#':\r\n flag1 = False\r\n break\r\n if flag1 and flag2:\r\n print('YES')\r\n else:\r\n print('NO')", "n,k = map(int,input().split())\r\nst = input()\r\ng_pos = st.find('G')\r\nt_pos = st.find('T')\r\ndiff = abs(t_pos - g_pos)\r\nif(diff % k == 0):\r\n if(t_pos > g_pos):\r\n pos = g_pos + k\r\n while(st[pos] != 'T' and st[pos] != '#'):\r\n g_pos = pos\r\n pos = g_pos + k\r\n if(st[pos] == '#'):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n pos = g_pos - k\r\n while(st[pos] != 'T' and st[pos] != '#'):\r\n g_pos = pos\r\n pos = g_pos - k\r\n if(st[pos] == '#'):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport math\r\ndef sol():\r\n lineLength, jump = (int(x) for x in sys.stdin.readline().split())\r\n line = sys.stdin.readline()\r\n grasshoppa = 0\r\n index = 0\r\n for i in range(lineLength):\r\n if 'G' == line[i]:\r\n grasshoppa = i\r\n index = i\r\n break\r\n while grasshoppa >= 0:\r\n if line[grasshoppa] == 'T':\r\n print(\"YES\")\r\n return\r\n elif line[grasshoppa] == '#':\r\n break\r\n grasshoppa -= jump\r\n grasshoppa = index\r\n while grasshoppa <= lineLength:\r\n if line[grasshoppa] == 'T':\r\n print(\"YES\")\r\n return\r\n elif line[grasshoppa] == '#':\r\n break\r\n grasshoppa += jump\r\n print(\"NO\")\r\nsol()", "def solve():\n n, k = map(int, input().split())\n line = input()\n g, t = line.find('G'), line.find('T')\n hop = k * (-1 if g > t else 1)\n while g >= 0 and g < len(line):\n if line[g] == '#':\n print('NO')\n return\n elif line[g] == 'T':\n print('YES')\n return\n g += hop\n print('NO')\n\nsolve()\n", "k=int(input().split()[1])\r\ns=input()\r\nx=s.find('G')\r\ny=s.find('T')\r\nif x>y: x,y=y,x\r\nprint(\"YES\" if (y-x)%k==0 and all([s[i]!='#' for i in range(x,y+1,k)]) else \"NO\")", "\ndef f(n, k, s):\n g_index = -1\n i_index = -1\n\n for i, c in enumerate(s):\n if c == \"T\":\n i_index = i\n if c == \"G\":\n g_index = i\n\n if abs(g_index - i_index) % k != 0:\n print(\"NO\")\n return\n\n comp = None\n add = k\n if g_index > i_index:\n comp = lambda x: x >= 0\n add = -k\n else:\n comp = lambda x: x < n\n\n while comp(g_index):\n if s[g_index] == \"#\":\n print(\"NO\")\n return\n if s[g_index] == \"T\":\n print(\"YES\")\n return\n g_index += add\n\n\n\n\nn, k = map(int, input().split())\ns = input()\nf(n,k,s)\n", "\ndef soln():\n n_num_cells, k_len_jmp = (int(_) for _ in input().split())\n cells = list(input())\n g_indx = cells.index('G')\n t_indx = cells.index('T')\n\n # Will I Converge??\n dist = t_indx - g_indx\n if dist % k_len_jmp != 0:\n print(\"NO\")\n return\n\n # left_indx, right_indx = (current_indx - k_len_jmp), (current_indx + k_len_jmp)\n # Should I go L or R?\n go_right = True if (g_indx <= t_indx) else False\n\n while(g_indx != t_indx):\n # Index out of bounds?!\n if (g_indx < 0 or g_indx >= n_num_cells) or (cells[g_indx] == '#'):\n print(\"NO\")\n return\n g_indx = (g_indx + k_len_jmp) if go_right else (g_indx - k_len_jmp)\n\n print(\"YES\")\n return\n\nsoln()\n", "n,k = input().split()\r\na = list(input())\r\nn=int(n)\r\nk=int(k)\r\nfor i in range(0,n):\r\n if(a[i]=='G'):\r\n g=i\r\n elif(a[i]=='T'):\r\n t=i\r\nma=max(g,t)\r\nmi=min(g,t)\r\np=1\r\nfor i in range(mi,ma,k):\r\n if(a[i]=='#'):\r\n p=0\r\nif((p==0) or (ma-mi)%k!=0 ):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "length_line,length_jump=input().split(' ',1)\nlength_line=int(length_line)\nlength_jump=int(length_jump)\n\n#找到起点和终点的位置\nline=input()\nfor i in range(0,length_line):\n if line[i]=='G':\n start=i\n if line[i]=='T':\n end=i\n\n#路径长度和步长是否相符\nif (end-start)%length_jump==0:\n #统一从左往右走\n if start<end:\n min=start\n max=end\n else:\n min=end\n max=start\n \n #验证路中间有无障碍\n jumps=(max-min)//length_jump\n obstacle=0\n for j in range(1,jumps+1):\n if line[min+j*length_jump]=='#':\n obstacle=1\n if obstacle==1:\n print('NO')\n else:\n print('YES')\nelse:\n print('NO')\n\t\t\t \t \t\t\t \t\t \t \t\t \t\t \t", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions, collections\r\n# ===============================\r\nn, k = [int(x) for x in input().split()]\r\ns = str(input())\r\ng = s.find(\"G\")\r\nt = s.find(\"T\")\r\n\r\nif g > t:\r\n\ttemp = t\r\n\tt = g\r\n\tg = temp\r\n\ts = s[:g] + \"G\" + s[g+1:t] + \"T\" + s[t+1:]\r\n\r\nflag = False\r\nfor i in range(g, t+1, k):\r\n\tif s[i] == \"T\":\r\n\t\tflag = True\r\n\telif s[i] == \"#\":\r\n\t\tflag = False\r\n\t\tbreak\r\n\r\nprint(\"YES\" if flag else \"NO\")\r\n", "n , k = map(int , input().split()) \r\ns = input() \r\nli = [ i for i in s ]\r\nstart = li.index('G') \r\nli[start] = 'T'\r\nidx = li.index('T') \r\nflag = \"NO\"\r\nfor i in range(idx , n , k ) : \r\n if i+k > n-1 : \r\n break\r\n elif li[i+k] == \".\" : \r\n continue \r\n elif li[i+k] == 'T': \r\n flag = 'YES' \r\n break\r\n elif li[i+k] != \".\" or li[i+k] != \"T\" : \r\n break\r\nprint(flag)\r\n", "strLength, jumpLength = map(int, input().split())\r\nline = str(input())\r\n\r\ngrasshopper = line.find(\"G\")\r\ntarget = line.find(\"T\")\r\n\r\nif abs(grasshopper - target) % jumpLength != 0:\r\n\tprint(\"NO\")\r\nelse:\r\n\r\n\tchecker = None\r\n\ti = 0\r\n\tj = 1\r\n\r\n\tif grasshopper < target:\r\n\t\twhile target - grasshopper > i:\r\n\t\t\tif line[grasshopper + (jumpLength * j)] == \"#\":\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\tchecker = True\r\n\t\t\t\tbreak\r\n\r\n\t\t\ti = i + jumpLength\r\n\t\t\tj = j + 1\r\n\r\n\t\tif not checker:\r\n\t\t\tprint(\"YES\")\r\n\r\n\telif target < grasshopper:\r\n\t\twhile grasshopper - target > i:\r\n\t\t\tif line[grasshopper - (jumpLength * j)] == \"#\":\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\tchecker = True\r\n\t\t\t\tbreak\r\n\r\n\t\t\ti = i + jumpLength\r\n\t\t\tj = j + 1\r\n\r\n\t\tif not checker:\r\n\t\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"YES\")", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\ns=list(input())\r\nk1=s.index('G')\r\nk2=s.index('T')\r\nif(k1>k2):\r\n c1=1\r\n c2=0\r\n for i in range(k1,k2-1,-k):\r\n if(i==k2):\r\n c2=1\r\n break\r\n if(s[i]=='#'):\r\n c1=0\r\n break\r\nelse:\r\n c1=1\r\n c2=0\r\n for i in range(k1,k2+1,k):\r\n if(i==k2):\r\n c2=1\r\n break\r\n if(s[i]=='#'):\r\n c1=0\r\n break\r\nif(c1==1 and c2==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\ns=list(input())\nt=s.index(\"T\")\ng=s.index(\"G\")\ntemp=abs(t-g)\n\np1=max(t,g)\np2=min(t,g)\nflag=0\nwhile p1!=p2 and p1>0:\n p1 -= k\n\n if s[p1]==\"#\":\n print(\"NO\")\n flag=1\n break\n else:\n continue\nif p1!=p2 and flag==0:\n print(\"NO\")\nelif flag==0:\n print(\"YES\")", "n, k = map(int, input().split(\" \"))\ns = input()\nG, T = s.find(\"G\"), s.find(\"T\")\nG, T = min(G, T), max(G, T)\nif (T-G) % k:\n print(\"NO\")\n exit()\nfor step in range(G+k, T, k):\n if s[step] == \"#\":\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "n, k = [int(s) for s in input().split(' ')]\r\ns = input()\r\nif s.find('T') < s.find('G'):\r\n s = s[::-1]\r\ns = s[s.find('G')::k]\r\nif s.find('T') == -1 or (s.find('#') != -1 and s.find('#') < s.find('T')):\r\n print('NO')\r\nelse:\r\n print('YES')", "n, k = map(int, input().split())\ns = input()\ng = s.find('G')\nt = s.find('T')\n\nl = g-k\nif t <= l:\n while l >= 0 and s[l] != '#':\n if s[l] == 'T':\n print('YES')\n exit()\n l -= k\n\nr = g+k\nif t >= r:\n while r < len(s) and s[r] != '#':\n if s[r] == 'T':\n print('YES')\n exit()\n r += k\n\nprint('NO')", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nb > a\r\ngcd(b,a) == 1\r\n\r\nn = 1000\r\nb => (2,n+1)\r\n a = n-b\r\n if gcd(a,b) == 1:\r\n cnt += 1\r\nprint(cnt)\r\n\r\n6\r\n1 5\r\n2 4 x\r\n\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x ! x x\r\nx x x x x\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndirections = [[-1,-1],[-1,1],[1,-1],[1,1]]\r\n\r\ndef isCross(i,j,grid):\r\n for di, dj in directions:\r\n if grid[i+di][j+dj] != 'X':\r\n return False\r\n return True\r\n\r\ndef solve():\r\n n, k = MII()\r\n s = I().strip()\r\n\r\n t_idx = -1\r\n g_idx = -1\r\n\r\n for i,c in enumerate(s):\r\n if c == 'G':\r\n g_idx = i\r\n if c == 'T':\r\n t_idx = i\r\n\r\n if t_idx < g_idx:\r\n s = s[t_idx:g_idx+1]\r\n else:\r\n s = s[g_idx:t_idx+1]\r\n\r\n valid = True\r\n seen = set()\r\n for i in range(0,len(s),k):\r\n if s[i] == '#':\r\n valid = False\r\n break\r\n seen.add(s[i])\r\n print(\"YES\" if valid and 'G' in seen and 'T' in seen else \"NO\")\r\n\r\nsolve() ", "def string_func(s, x):\r\n pos_G = string.find(\"G\")\r\n pos_T = string.find(\"T\")\r\n\r\n for i in range(pos_G, pos_T+1, x):\r\n if s[i] == \"#\": return \"NO\"\r\n if s[i] == \"T\": return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\nn, k = map(int, input().split())\r\nstring = input()\r\n\r\nif string.find(\"G\") < string.find(\"T\"): pass\r\nelse: string = string[::-1]\r\n\r\nprint(string_func(string, k))", "while True:\r\n try:\r\n n, k = map(int, input().split())\r\n str = input()\r\n sta = 0\r\n end = 0\r\n for i in range(len(str)):\r\n if str[i] == 'G':\r\n sta = i\r\n if str[i] == 'T':\r\n end = i\r\n if sta > end:\r\n sta, end = end, sta\r\n if (end - sta) % k != 0:\r\n print(\"NO\")\r\n continue\r\n flag = 0\r\n for i in range(sta, end, k):\r\n if str[i] == '#':\r\n flag = 1\r\n break\r\n if flag:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n except EOFError:\r\n break", "[n, k] = map(int, input().split(' '))\ndata = input()\ng = 0\nt = 0\nfor i in range(n):\n if data[i] == 'G':\n g = i\n break\nfor i in range(n):\n if data[i] == 'T':\n t = i\n break\n[t, g] = [max(t, g), min(t, g)]\ndiff = t - g\nif diff % k != 0:\n print('NO')\n quit()\nfor i in range(g + k, t + 1, k):\n if data[i] == 'T' or data[i] == 'G':\n print('YES')\n quit()\n elif data[i] == '#':\n print('NO')\n quit()\n elif data[i] == '.':\n continue\nprint('NO')", "# for testCase in range(int(input())):\nn ,k = map(int ,input().split())\ns = input()\nok = True\nstrt = min(s.find('G') ,s.find('T'))\ndes = max(s.find('G') ,s.find('T'))\nif (des-strt)%k != 0:\n ok = False\nwhile strt < des:\n if s[strt] == '#':\n ok = False\n break;\n strt += k\nif ok:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, k = map(int, input().split())\r\ne = input()\r\nx, y, p, z = 0, 0, 0, 0\r\nfor i in range(n):\r\n if ord(e[i]) >= 60:\r\n if z == 0:\r\n x = i\r\n z = 1\r\n else:\r\n y = i\r\nif x % k != y % k:\r\n print(\"NO\")\r\nelse:\r\n for i in range(x, y, k):\r\n if ord(e[i]) < 36:\r\n p += 1\r\n if p > 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")# 1697805128.3034897", "def solve(s, k):\r\n g = s.index(\"G\")\r\n t = s.index(\"T\")\r\n if abs(g - t) % k != 0:\r\n return \"NO\"\r\n\r\n start = g\r\n fin = t + 1\r\n if g > t:\r\n k = -k\r\n fin -= 2\r\n\r\n for i in range(start, fin, k):\r\n if s[i] == \"T\":\r\n return \"YES\"\r\n elif s[i] == \"#\":\r\n return \"NO\"\r\n return \"NO\"\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n print(solve(input(), k))\r\n\r\n\r\nmain()\r\n", "n,k=map(int,input().split());s=list(input())\r\na,b=s.index('G'),s.index('T')\r\nif (a-b)%k:print('NO')\r\nelse:\r\n con=True\r\n for i in range(min(a,b),max(a,b)+1,k):\r\n if s[i]=='#':print('NO');con=False;break\r\n if con:print('YES')", "x = input().split()\r\nn = int(x[0])\r\nk = int(x[1])\r\nlist1 = list(input())\r\n\r\npos_grass = 0\r\npos_insect = 0\r\nfor i in list1:\r\n if i == 'G':\r\n pos_grass = list1.index(i)\r\n elif i == \"T\":\r\n pos_insect = list1.index(i)\r\n\r\nif pos_insect>pos_grass:\r\n flag = 0\r\n for i in range(pos_grass+k,n,k):\r\n if list1[i] == \"T\":\r\n flag += 1\r\n break\r\n if list1[i] == \"#\":\r\n break\r\n if flag>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n flag = 0\r\n for i in range(pos_grass-k,-1,-k):\r\n if list1[i] == \"T\":\r\n flag += 1\r\n break\r\n if list1[i] == \"#\":\r\n break\r\n if flag>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n", "n, k = map(int, input().split())\r\ncells = input().strip()\r\n\r\n# Find the indices of the grasshopper and the insect\r\ngh_index = cells.index('G')\r\ninsect_index = cells.index('T')\r\n\r\n# Check if the insect is reachable from the grasshopper\r\nif abs(insect_index - gh_index) % k != 0:\r\n print(\"NO\")\r\nelse:\r\n # Check if there are any obstacles between the grasshopper and the insect\r\n step = k if insect_index > gh_index else -k\r\n i = gh_index + step\r\n while i != insect_index:\r\n if cells[i] == '#':\r\n print(\"NO\")\r\n break\r\n i += step\r\n else:\r\n print(\"YES\")\r\n", "n,k=map(int,input().split(\" \"))\r\ns=input()\r\nif s.index(\"G\")>s.index(\"T\"):\r\n\ts=s[::-1]\r\nfor i in range(s.index(\"G\"),n,k):\r\n\tif s[i]==\"T\":\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\n\telif s[i]==\"#\":\r\n\t\t\tprint(\"NO\")\r\n\t\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "n,k = list(map(int, input().split(\" \")))\r\ns=input()\r\nif s.index(\"G\")<s.index(\"T\"):\r\n p=s[s.index(\"G\")+k::k]\r\nelse: p=s[s.index(\"G\")-k::-k]\r\nprint(\"YES\" if \"T\" in p and \"#\" not in p[:p.index(\"T\")] else \"NO\" )", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,k = get_int_list()\r\ns = get_string()\r\nif s.index('G') < s.index('T'):\r\n i = s.index('G')\r\n flag = False\r\n while i+k < n:\r\n i += k\r\n if s[i] == 'T':\r\n flag = True\r\n break\r\n if s[i] == '#':\r\n flag = False\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n i = s.index('G')\r\n flag = False\r\n while i-k >= 0:\r\n i -= k\r\n if s[i] == 'T':\r\n flag = True\r\n break\r\n if s[i] == '#':\r\n flag = False\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import defaultdict\n\njump = int(input().split(\" \")[1])\n\nboard = input()\n\ngrasshopper = board.index(\"G\")\ntarget = board.index(\"T\")\n\nstack = [grasshopper]\nseen = defaultdict(lambda: False)\n\nwhile len(stack) > 0:\n curr = stack.pop()\n seen[curr] = True\n\n nxt = curr + jump\n prv = curr - jump\n\n if not seen[nxt] and nxt < len(board) and board[nxt] != '#':\n if nxt == target:\n print(\"YES\", end=\"\")\n exit()\n stack.append(nxt)\n\n if not seen[prv] and prv >= 0 and board[prv] != '#':\n if prv == target:\n print(\"YES\", end=\"\")\n exit()\n stack.append(prv)\n\nprint(\"NO\", end=\"\")\n\n\n\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn,k=read_ints()\r\n\ta=read()\r\n\tfor i in range(n):\r\n\t\tif a[i]=='G':\r\n\t\t\ts=i\r\n\t\telif a[i]=='T':\r\n\t\t\te=i\r\n\tif (e-s)%k!=0:\r\n\t\tprint(\"NO\")\r\n\t\treturn\r\n\twhile s!=e:\r\n\t\tif s<e:\r\n\t\t\ts+=k\r\n\t\telse:\r\n\t\t\ts-=k\r\n\t\tif a[s]=='#':\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn\r\n\tprint(\"YES\")\r\n\r\nsolve()\r\n", "def Gr(s,g,t,k) :\r\n for i in range(g,t+1,k) :\r\n if s[i]==\"T\" :\r\n return \"YES\"\r\n if s[i]==\"#\" :\r\n return \"NO\"\r\n return \"NO\"\r\nn,k=list(map(int,input().split()))\r\ns=input()\r\nfor i in range(n) :\r\n if s[i]==\"G\" :\r\n g=i\r\n if s[i]==\"T\" :\r\n t=i\r\nprint(Gr(s,g,t,k) if g<t else Gr(s,g,t-2,-k)) \r\n\r\n", "def solve (n,k,line):\r\n\r\n\tpos = line.index('G')\r\n\tposT = line.index('T')\r\n\r\n\tif (posT < pos):\r\n\t\tk = -1 * k\r\n\r\n\twhile((pos < n and pos >= 0) and line[pos] != '#'):\r\n\t\tif (line[pos] == 'T'):\r\n\t\t\tprint(\"YES\")\r\n\t\t\treturn;\r\n\t\tpos += k\r\n\tprint(\"NO\")\r\n\r\ndef main ():\r\n\ta = list(map(int,input().split()))\r\n\tn = a[0]\r\n\tk = a[1]\r\n\tline = input()\r\n\tsolve(n,k,line)\r\n\r\n\r\n\r\nmain()", "def f():\r\n n, k = map(int, input().split())\r\n s = input()\r\n G_index = s.index('G')\r\n T_index = s.index('T')\r\n if G_index < T_index:\r\n for i in range(G_index, T_index + 1, k):\r\n if s[i] == '#':\r\n return False\r\n if i == T_index:\r\n return True\r\n return False\r\n else:\r\n for i in range(G_index, T_index - 1, -k):\r\n if s[i] == '#':\r\n return False\r\n if i == T_index:\r\n return True\r\n return False\r\n\r\nif f():\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=input().split(\" \")\nst=input()\ng,t = st.index('G'),st.index('T')\nif g > t: \n\ti = g - t\n\tst = st[::-1]\n\tg,t = st.index('G'),st.index('T')\nelse: i = t - g\nif i % int(k) == 0:\n\tj = g\n\twhile j in range(g,t):\n\t\tif st[j] == '#':\n\t\t\tprint(\"NO\")\n\t\t\tbreak\n\t\telse:\n\t\t\tj += int(k)\n\t\tif st[j] == 'T':\n\t\t\tprint(\"YES\")\n\t\t\tbreak\n\nelse:\n\tprint(\"NO\")\n", "# Problem: https://codeforces.com/problemset/problem/735/A\n\nimport sys\n\nn, hop = input().split(' ')\n\npath = [char for char in input()]\n\n# print(path)\n\ngPosition = path.index('G')\niPosition = path.index('T')\n\nif gPosition > iPosition:\n # print(path)\n path.reverse()\n # print(path)\n gPosition = path.index('G')\n iPosition = path.index('T')\n\n# print(hop, \": Hop\")\n# print(iPosition, \": iPosition\")\n# print(gPosition, \": gPosition\")\n# for i in range(gPosition, iPosition+1, int(hop)):\n # print(i)\n\nif(abs(gPosition-iPosition) % int(hop) == 0):\n for index in range(gPosition, iPosition+1, int(hop)):\n if path[index] == 'T':\n print(\"YES\")\n sys.exit()\n elif path[index] == '#':\n print(\"NO\")\n sys.exit()\nprint(\"NO\")", "from queue import deque\r\n\r\ndef runProgram():\r\n params = [int(i) for i in input().split()]\r\n line = list(input())\r\n\r\n startInd = line.index('G')\r\n length = len(line)\r\n\r\n visitedArr = [False for i in range(length)]\r\n visitedArr[startInd] = True\r\n\r\n q = deque()\r\n q.append(startInd)\r\n while(q):\r\n index = q.popleft() + params[1]\r\n if(index < length and not line[index] == '#' and not visitedArr[index]):\r\n if(line[index] == 'T'):\r\n return \"YES\"\r\n visitedArr[index] = True\r\n q.append(index)\r\n index -= 2*params[1]\r\n if(index >= 0 and not line[index] == '#' and not visitedArr[index]):\r\n if(line[index] == 'T'):\r\n return \"YES\"\r\n visitedArr[index] = True\r\n q.append(index)\r\n return \"NO\"\r\n\r\nprint(runProgram())", "n, k=list(map(int, input().split()))\r\nstring=input().strip('.#')\r\nprint('NO' if (len(string)-1)%k or '#' in string[0:len(string)-1:k] else 'YES')", "import math\n\nn, k = map(int, input().split())\ncells = input()\n\ndef findPath(n,k,cells):\n line = []\n grasshoper_pos = None\n target_pos = None\n counter = 0\n for char in cells:\n line.append(char)\n if char == \"G\":\n grasshoper_pos = counter\n elif char == \"T\":\n target_pos = counter\n counter += 1\n\n if abs(target_pos - grasshoper_pos) % k == 0:\n if target_pos > grasshoper_pos:\n for x in range(grasshoper_pos, target_pos, k):\n if line[x] == \"#\":\n return \"NO\"\n else:\n for x in reversed(range(grasshoper_pos, target_pos, -k)):\n if line[x] == \"#\":\n return \"NO\"\n return \"YES\"\n else:\n return \"NO\"\n\nprint(findPath(n,k,cells))", "n,k = map(int,input().split())\r\ns = input()\r\ni = 1\r\ntru = \"NO\"\r\na = s.index('G')\r\nif s.index('G') < s.index('T'):\r\n while(a+k*i <= s.index('T') ):\r\n if a+k*i < len(s):\r\n if s[a+k*i]=='#':\r\n break\r\n if s[a+k*i]=='T':\r\n tru = \"YES\"\r\n break\r\n i+=1\r\nelse:\r\n s = s[::-1]\r\n a = s.index('G')\r\n while(a+k*i <= s.index('T') ):\r\n if a+k*i < len(s):\r\n if s[a+k*i]=='#':\r\n break\r\n if s[a+k*i]=='T':\r\n tru = \"YES\"\r\n break\r\n i+=1\r\nprint(tru)", "def ostap():\r\n n, k = [int(num) for num in input().split()]\r\n str = input()\r\n g, t = str.find('G'), str.find('T')\r\n start, stop = min(g, t), max(g, t)\r\n jump_status = (start - stop) % k\r\n\r\n if jump_status == 0:\r\n for i in range(start, stop, k):\r\n if str[i] == '#':\r\n return \"NO\"\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nprint(ostap())", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = list(input().rstrip())\r\nu = []\r\nfor i in range(n):\r\n if s[i] == 71 or s[i] == 84:\r\n u.append(i)\r\nif (u[1] - u[0]) % k:\r\n ans = \"NO\"\r\nelse:\r\n ans = \"YES\"\r\n for i in range(u[0], u[1], k):\r\n if s[i] == 35:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "from sys import exit\r\nn, k = map(int, input().split())\r\nstr = input()\r\ns, t = str.index('G'), str.index('T')\r\nif s > t:\r\n s, t = t, s\r\nif (t - s) % k != 0:\r\n print(\"NO\")\r\n exit(0)\r\nfor i in range(s, t, k):\r\n if str[i] == '#':\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "n, k = [int(s) for s in input().split(' ')]\r\ns = input()\r\ng = s.index('G')\r\nt = s.index('T')\r\nif (g - t) % k == 0 and '#' not in s[min(g, t): max(g, t) + 1: k]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k = map(int,input().split())\ns = input()\ni = 0\nst = -1\ndef jump(st):\n while(st<n):\n st+=k\n if(st>=n or s[st]=='#'):\n return \"NO\"\n if(s[st]=='T' or s[st]=='G'):\n return \"YES\"\n return \"NO\"\nwhile(i<n):\n if(s[i]=='T' or s[i]=='G'):\n if(st==-1):\n st=i\n break\n i+=1\nprint(jump(st))\n\t \t \t\t\t \t \t\t\t\t\t \t \t\t \t\t\t", "n,k=map(int,input().split())\r\ns=str(input())\r\ng=s.index('G')\r\nt=s.index('T')\r\n#print(g,t,k)\r\nif abs(g-t)%k!=0:\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n x=abs(g-t)//k\r\n i=min(g,t)\r\n l=[]\r\n for j in range(1,x+1):\r\n l.append(i+j*k)\r\n if s[j*k+i]=='#':\r\n #print(s[j*k+i])\r\n print(\"NO\")\r\n exit()\r\n#print(l)\r\nprint(\"YES\")", "NandK = input().split()\nn, k = [int(i) for i in NandK]\n\nline = input()\ngIndex = line.index('G')\ntIndex = line.index('T')\n\nstepsAway = tIndex-gIndex\n\nif stepsAway%k != 0:\n print (\"NO\")\n exit()\n\ncurrPos = gIndex\nif stepsAway < 0:\n k = -1*k\nwhile True:\n currPos += k\n if line[currPos] == '#':\n print (\"NO\")\n exit()\n elif line[currPos] == 'T':\n print (\"YES\")\n exit()\n", "n,k = map(int, input().split())\na = input()\n#find the position of G and T\nfor i in range(n):\n\tif a[i] == \"G\":\n\t\tfirst = i\n\telif a[i] == \"T\":\n\t\tlast = i\n#switch orders if TG instead of GT\nif first > last:\n\tx = last\n\tlast = first\n\tfirst = x\n#judge if divisible\nif (last-first)%k != 0:\n\tprint(\"NO\")\nelse:\n\tflag = 0\n\tfor j in range(first,last,k):\n\t\tif a[j] ==\"#\":\n\t\t\tflag = 1\n\t\t\tbreak\n\tprint(\"YES\" if flag == 0 else \"NO\")\n", "k = int(input().split()[1])\r\ns = input()\r\na, b = s.find(\"G\"), s.find(\"T\")\r\nif (a - b)%k != 0:\r\n print(\"NO\")\r\nelse:\r\n if a>b: a, b = b, a\r\n print(\"NO\" if \"#\" in s[a:b:k] else \"YES\")\r\n", "n, k = [int(i) for i in input().split()]\r\ns = input()\r\na = s.find('G')\r\nb = s.find('T')\r\nif abs(a - b) % k == 0:\r\n flag = True\r\n flag_win = False\r\n while flag:\r\n if a > b:\r\n a -= k\r\n if s[a] == '#':\r\n flag = False\r\n elif a == b:\r\n flag = False\r\n flag_win = True\r\n if a < b:\r\n a += k\r\n if s[a] == '#':\r\n flag = False\r\n elif a == b:\r\n flag = False\r\n flag_win = True\r\n if flag_win:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "a,b=map(int,input().split())\nx=list(input())\nG=x.index(\"G\")\nT=x.index(\"T\")\nf=\"YES\"\nfor i in range(min(G,T),max(G,T)+1):\n if x[i]==\"#\" and abs(i-G)%b==0:f=\"NO\"\n elif x[i]==\"T\" and abs(G-T)%b!=0:f=\"NO\"\nprint(f)\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\na = s.index('G')\r\nb = s.index('T')\r\n\r\ni = a\r\nans = 'NO'\r\nif b < a:\r\n \r\n while i - k >= 0 and s[i - k] != '#':\r\n i -= k\r\n if s[i] == 'T':\r\n ans = 'YES'\r\nelse:\r\n \r\n while i + k < n and s[i + k] != '#':\r\n i += k\r\n if s[i] == 'T':\r\n ans = 'YES'\r\n \r\nprint(ans)", "n, k = [int(x) for x in input().split()]\r\ns = input()\r\nti = s.index('T')\r\ngi = s.index('G')\r\nd = abs(gi - ti)\r\nr = d % k\r\nif r!= 0:\r\n print(\"NO\")\r\nelse:\r\n if ti < gi:\r\n ti, gi = gi, ti\r\n bad = False\r\n for i in range(gi + k, ti, k):\r\n if s[i] == '#':\r\n bad = True\r\n break\r\n if bad:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "from math import ceil\nInput=lambda:map(int,input().split())\n\ndef cal(s,G,T,k):\n for i in range(G,T+1,k):\n if s[i] == '#':\n return False\n return True\n\nn, k = Input()\ns = input()\nG = s.index('G')\nT = s.index('T')\nif G > T:\n G,T = T,G\n# V0 + k*i\n# G + k*i\n\n#G + k * i == T\n#T - G == k*i\ni = (T-G)/k\nif ceil(i) - i != 0:\n print(\"NO\")\n exit()\nprint(\"YES\" if cal(s,G,T,k) else \"NO\")\n", "n = list(map(int, input().rstrip().split()))\r\npath = input()\r\nskip = n[1]\r\nGind = path.index(\"G\")\r\nGind += skip\r\n\r\nfound = 0\r\nwhile(Gind < len(path)):\r\n if(path[Gind] == \"#\"):\r\n break\r\n if(path[Gind] == \"T\"):\r\n found = 1\r\n break\r\n Gind += skip\r\nGind = path.index(\"G\")\r\nwhile(Gind >= 0):\r\n if(path[Gind] == \"#\"):\r\n break\r\n if(path[Gind] == \"T\"):\r\n found = 1\r\n break\r\n Gind -= skip\r\n\r\nif(found == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int,input().split())\r\nl = list(input())\r\ng = l.index(\"G\")\r\nt = l.index(\"T\")\r\nif g > t:\r\n\tflag = 0\r\n\tfor i in range(g-k,t-1,-k):\r\n\t\tif l[i] == \"#\":\r\n\t\t\tflag = 1\r\n\t\t\tprint(\"no\")\r\n\t\t\tbreak\r\n\t\telif l[i] == \".\":\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tflag = 1\r\n\t\t\tprint(\"yes\")\r\n\t\t\tbreak\r\n\tif flag == 0:\r\n\t\tprint(\"no\")\r\nelse:\r\n\tflag = 0\r\n\tfor i in range(g+k,t+1,k):\r\n\t\tif l[i] == \"#\":\r\n\t\t\tflag = 1\r\n\t\t\tprint(\"no\")\r\n\t\t\tbreak\r\n\t\telif l[i] == \".\":\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tflag = 1\r\n\t\t\tprint(\"yes\")\r\n\t\t\tbreak\r\n\tif flag == 0:\r\n\t\tprint(\"no\")", "n, k = [int(x) for x in input().split()]\r\ns = input()\r\n\r\nsg = s.find('G')\r\nst = s.find('T')\r\n\r\nif sg > st:\r\n k *= -1\r\n\r\nwhile True:\r\n sg += k\r\n if sg == st:\r\n print('YES')\r\n exit()\r\n elif sg > n - 1 or sg < 0:\r\n print('NO')\r\n exit()\r\n elif s[sg] == '#':\r\n print('NO')\r\n exit()\r\n", "l=input().split()\r\nl=list(map(int,l))\r\nn=l[0]\r\nk=l[1]\r\ns=input()\r\nfor i in s:\r\n\tif i=='G':\r\n\t\tg=s.index(i)\r\n\r\n\telif i=='T':\r\n\t\tt=s.index(i)\r\n\r\na=min(g,t)\r\nb=max(g,t)\r\nflag=0;\r\nfor i in range(a,b+1,k):\r\n\tif(s[i]=='#'):\r\n\t\tbreak\r\n\r\n\tif i==b:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==0:\r\n\tprint (\"NO\")\r\nelse:\r\n\tprint (\"YES\")\r\n", "# https://codeforces.com/problemset/problem/735/A\r\n\r\nn, k = map(int, input().split())\r\n\r\nT_index = None\r\nG_index = None\r\n\r\nl = 0\r\nstring = input()\r\nfor i in string:\r\n if i == \"T\" or i == \"G\":\r\n break\r\n l += 1\r\n\r\nfor i in range(l + k, n, k):\r\n\r\n if string[i] == \"T\" or string[i] == \"G\":\r\n print(\"YES\")\r\n break\r\n elif string[i] == \"#\":\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "\"\"\"\nSolution to the 735A problem on CodeForces.\n\"\"\"\nimport sys\n\ndef find_first(line):\n for char in line:\n if char == \"G\":\n return True\n elif char == \"T\":\n return False\n\ndef find_gh(line):\n for i in range(len(line)):\n if line[i] == \"G\":\n return i\n\ndef gh_solver(num_of_cells, jump, line):\n assert num_of_cells == len(line)\n right = find_first(line)\n gh_index = find_gh(line)\n if right:\n while True:\n gh_index += jump\n if gh_index >= len(line) or line[gh_index] == \"#\":\n return False\n elif line[gh_index] == \"T\":\n return True\n else:\n while True:\n gh_index -= jump\n if gh_index < 0 or line[gh_index] == \"#\":\n return False\n elif line[gh_index] == \"T\":\n return True\n\n\ndef main():\n \"\"\"\n Docstring.\n \"\"\"\n num_of_cells, jump = [int(i) for i in str(sys.stdin.readline()).split(\" \")]\n input_line = str(sys.stdin.readline())\n if gh_solver(num_of_cells, jump, input_line[:len(input_line)-1]):\n print (\"YES\")\n else:\n print(\"NO\")\n\n\n\nif __name__ == \"__main__\":\n main()\n", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\ng,t=s.index('G'),s.index('T')\r\ncheck=1 \r\nif g<t:\r\n if (t-g)%k!=0:\r\n print('NO')\r\n else:\r\n for i in range(g+k,t+1,k):\r\n if s[i]=='#':\r\n check=0\r\n break\r\n if check==0:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n if (g-t)%k!=0:\r\n print('NO')\r\n else:\r\n for i in range(g-k,t-1,-k):\r\n if s[i]=='#':\r\n check=0\r\n break\r\n if check==0:\r\n print('NO')\r\n else:\r\n print('YES')", "n, k = [int(i) for i in input().split()]\r\ns = list(input())\r\nif s.index('G') > s.index('T'):\r\n s.reverse()\r\nj, t, flag = s.index('G'), s.index('T'), 0\r\nwhile t - j > 0:\r\n if j + k < n and (s[j + k] == '.' or s[j + k] == 'T') and t - j - k >= 0:\r\n j += k\r\n flag = 1\r\n else:\r\n flag = 0\r\n break\r\nprint(\"YES\" if flag == 1 else \"NO\")\r\n", "import math\nline = input().split(\" \")\nn, k = int(line[0]), int(line[1])\n\npath = list(input())\nstart = path.index(\"G\")\ntarget = path.index(\"T\")\nif math.fabs(target-start)%k==0:\n if start>target:\n i = target\n j = start\n else:\n i = start\n j = target\n \n found = True\n\n while i<j:\n if path[i]==\"#\":\n found = False\n print(\"NO\")\n break\n else:\n i+=k\n \n if found:\n print(\"YES\")\n\nelse:\n print(\"NO\")\n\n\n", "#!/usr/bin/env python3\n\nimport fileinput\nimport sys\n\ndef main():\n\tlength, jump = input('').split(\" \")\n\tline2 = (input(''))\n\tlength=int(length)\n\tjump=int(jump)\n\n\tposition = line2.find(\"G\")#G stands for grasshopper\n\n\ttarget = line2.find(\"T\")\n\n\n\t#need a way to detect if we pass the target\n\n\t#print(length, jump, position, target)\n\n\n\tif(target > position):\n\t\twhile position != target:\n\t\t\tif((not(jump <= (length-1)-position)) or (line2[position+jump] == \"#\")):\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tposition = position + jump\n\telif(target < position):\n\t\twhile position != target:\n\t\t\tif(not(jump <= position) or line2[position-jump] == \"#\"):\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tposition = position - jump\n\n\tif(position == target):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nif __name__ == '__main__':\n\tmain()", "\r\nn, k = map(int, input().split())\r\n\r\nl = list(input())\r\n\r\nindG = l.index('G')\r\ntarget = l.index('T')\r\n\r\nif abs(target - indG) % k != 0:\r\n\tprint('NO')\r\n\texit()\r\n\r\n\r\nfor i in range(min(indG, target), max(indG, target), k):\r\n\tif i == min(indG, target):\r\n\t\tcontinue\r\n\t\r\n\tif l[i] == '#':\r\n\t\tprint('NO')\r\n\t\tbreak\r\n\r\nelse:\r\n\tprint('YES')", "def f():\r\n n, k = map(int, input().split())\r\n s = input()\r\n g, t = s.index('G'), s.index('T')\r\n if g > t:\r\n g, t = t, g\r\n for i in range(g, t + 1, k):\r\n if s[i] == '#':\r\n return False\r\n if i == t:\r\n return True\r\n return False\r\n\r\nif f():\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = [int(x) for x in input().split()]\r\nbox = list(input())\r\njump = []\r\npos = 0\r\ntarget = 0\r\nob = []\r\nfor i in range (n):\r\n if box[i] == 'G':\r\n jump.append(1)\r\n pos = i\r\n elif box[i] == 'T':\r\n target = i\r\n jump.append(2)\r\n elif box[i] == '#':\r\n ob.append(i)\r\n jump.append(3)\r\n else:\r\n jump.append(0)\r\nif pos < target:\r\n for i in range (pos, target):\r\n if jump[i] == 3:\r\n if abs(i - pos) % k == 0:\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n for i in range (pos, target, -1):\r\n if jump[i] == 3:\r\n if abs(i - pos) % k == 0:\r\n print(\"NO\")\r\n exit()\r\nif abs(target - pos) % k == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\ns = input()\ng = s.find('G')\nt = s.find('T')\nvisited = set()\n\ndef solve(s, g, t, k):\n stack = []\n stack.append(g)\n while len(stack) != 0:\n u = stack.pop()\n v = u + k\n w = u - k\n if s[u] == '#':\n continue\n if v == t or w == t:\n return \"YES\"\n if v < len(s) and v not in visited:\n stack.append(v)\n visited.add(v)\n if w >= 0 and w not in visited:\n stack.append(w)\n visited.add(w)\n return \"NO\"\n\nprint(solve(s, g, t, k))", "if __name__ == '__main__':\n l, k = [int(i) for i in input().strip().split()]\n arena = input().strip()\n starting_pos = arena.index(\"G\")\n for i in range(arena.index(\"G\"),len(arena),k):\n if arena[i] == \"#\":\n break\n elif arena[i] == \".\" or arena[i] == \"G\":\n continue\n else:\n print(\"YES\")\n exit(0)\n for i in range(starting_pos,-1,-k):\n if arena[i] == \"#\":\n break\n elif arena[i] == \".\" or arena[i] == \"G\":\n continue\n else:\n print(\"YES\")\n exit(0)\n print(\"NO\")", "n, k = map(int, input().split())\r\ns = input()\r\ng = s.find('G')\r\nt = s.find('T')\r\n\r\nif abs(t-g) % k != 0:\r\n print(\"NO\")\r\nelse:\r\n if t > g:\r\n for i in range(g, t+1, k):\r\n if s[i] == '#':\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n else:\r\n for i in range(t, g+1, k):\r\n if s[i] == '#':\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\ns = input()\r\nl, r = s.find('T'), s.find('G')\r\nl, r = min(l, r), max(l, r)\r\nprint('YES' if '#' not in s[l + k: r:k] and (r - l) % k == 0 else 'NO')", "n, k = map(int, input().split())\r\ns = input()\r\nG, T = s.find('G'), s.find('T')\r\nif G > T:\r\n for i in range(T, G + 1, k):\r\n if s[i] != '#':\r\n if s[i] == 'G':\r\n exit(print('YES'))\r\n else:\r\n break\r\nif G < T:\r\n for i in range(G, T + 1, k):\r\n if s[i] != '#':\r\n if s[i] == 'T':\r\n exit(print('YES'))\r\n else:\r\n break\r\nprint('YES' if G == T else 'NO')\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\ng = 0\r\nt = 0\r\nfor i in range(n):\r\n if s[i] == 'G':\r\n g = i\r\n elif s[i] == 'T':\r\n t = i\r\n \r\nif g > t:\r\n k *= -1\r\n t -= 1\r\nelse:\r\n t += 1\r\n\r\nyes = False\r\nfor i in range(g, t, k):\r\n if s[i] == '#':\r\n break\r\n if s[i] == 'T':\r\n yes = True\r\n break\r\n\r\nif yes:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\narr=list(input())\r\nstarting=arr.index(\"G\")\r\nend=arr.index(\"T\")\r\nif end<starting:\r\n starting,end=end,starting\r\ni=starting\r\nbroken=0\r\nwhile i<=end:\r\n if arr[i]==\"#\":\r\n broken+=1\r\n break\r\n i+=k\r\nif abs(starting-end)%k==0 and broken==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = input().rstrip()\r\n\r\ng_loc = data.find('G')\r\ni_loc = data.find('T')\r\n\r\nif abs(g_loc - i_loc) % k == 0:\r\n ans = True\r\n if g_loc < i_loc:\r\n for i in range(g_loc, i_loc, k):\r\n if data[i] == '#':\r\n ans = False\r\n break\r\n else:\r\n for i in range(i_loc, g_loc, k):\r\n if data[i] == '#':\r\n ans = False\r\n break\r\n print(\"YES\" if ans else \"NO\")\r\nelse:\r\n print(\"NO\")", "# Bismillahir Rahmanir Rahim\r\n# Abu Hurayra - Handle: HurayraIIT\r\nimport sys\r\nimport math\r\nfrom xmlrpc.client import gzip_decode\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, k = map(int, input().split())\r\n s = rs()\r\n tpos = 0\r\n gpos = 0\r\n for i in range(n):\r\n if s[i]=='T':\r\n tpos = i\r\n if s[i]=='G':\r\n gpos = i\r\n flag = 1\r\n if gpos < tpos:\r\n for i in range(gpos, tpos+1, k):\r\n if i==gpos:\r\n continue\r\n if s[i] == '#':\r\n flag = 0\r\n break\r\n if i==tpos:\r\n flag += 1\r\n else:\r\n for i in range(tpos, gpos+1, k):\r\n if i==tpos:\r\n continue\r\n if s[i] == '#':\r\n flag = 0\r\n break\r\n if i==gpos:\r\n flag += 1\r\n \r\n if flag < 2:\r\n ws(\"NO\")\r\n else:\r\n ws(\"YES\")\r\n \r\n\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n t = 1\r\n while t:\r\n t -= 1\r\n main()\r\n", "b = list(map(int,input().split()))\r\na = str(input())\r\nfor i in range(0,len(a)):\r\n if(a[i] == \"G\"):\r\n c = i\r\n elif(a[i] == \"T\"):\r\n d = i\r\nif(c>d):\r\n while True:\r\n if(c - b[1] < d):\r\n print(\"NO\")\r\n break\r\n elif(c - b[1] == d):\r\n print(\"YES\")\r\n break\r\n elif(a[c - b[1]] == \"#\"):\r\n print(\"NO\")\r\n break\r\n else:\r\n c = c - b[1]\r\n \r\nelse:\r\n while True:\r\n if(c + b[1] > d):\r\n print(\"NO\")\r\n break\r\n elif(c + b[1] == d):\r\n print(\"YES\")\r\n break\r\n elif(a[c + b[1]] == \"#\"):\r\n print(\"NO\")\r\n break\r\n else:\r\n c = c + b[1]\r\n \r\n ", "_, step = map(int, input().split(' '))\r\ns = str(input())\r\nstart = min(s.index('G'), s.index('T'))\r\nfor i in range(start + step, len(s), step):\r\n if (s[i] == 'T' or s[i] == 'G'):\r\n print('YES')\r\n break\r\n if (s[i] == '#'):\r\n print('NO')\r\n break\r\nelse:\r\n print('NO')", "a, b = input().split()\r\nb = int(b)\r\ns = input()\r\nfirst = 0\r\nfor i in range(0,len(s)):\r\n if(s[i] == 'G' or s[i] == 'T'):\r\n first = i\r\n break\r\nfor i in range(first + b, len(s), b):\r\n if(s[i] == 'G' or s[i] == 'T'):\r\n print(\"YES\")\r\n exit()\r\n if(s[i] == '#'):\r\n print(\"NO\")\r\n exit()\r\nprint(\"NO\") \r\n", "n,k = map(int, input().split())\r\na = input()\r\ng = a.index('G')\r\nt = a.index('T')\r\nobs = [i for i in range(min(g,t)+1,max(g,t)) if a[i] == '#']\r\n\r\nif abs(g-t)%k != 0:\r\n print('NO')\r\nelse:\r\n for i in obs:\r\n if abs(i-g)%k == 0:\r\n print('NO')\r\n break\r\n else: print('YES')", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,k = map(int, wtf[0].split())\r\n S = wtf[1]\r\n Gi = S.index('G')\r\n Ti = S.index('T')\r\n d = Gi-Ti\r\n if d > 0:\r\n S = S[Ti+1:Gi+1]\r\n else:\r\n S = S[Gi+1:Ti+1]\r\n n= len(S)\r\n f = False\r\n if n%k == 0:\r\n f = True\r\n for i in range(k-1, n, k):\r\n if S[i] == '#':\r\n f = False\r\n break\r\n print('YES' if f is True else 'NO')\r\n", "lst = []\r\nn, k = list(map(int, input().split()))\r\ns = input()\r\nfor i in range(len(s)):\r\n if (s[i] == \"#\"):\r\n lst.append(i)\r\nx = s.index(\"T\")\r\ny = s.index(\"G\")\r\nz = abs(x - y)\r\nif (z % k != 0):\r\n print(\"NO\")\r\nelse:\r\n ok = False\r\n j = 0\r\n if (len(lst) == 0):\r\n print(\"YES\")\r\n else:\r\n for i in range(min(x,y), max(x,y) + 1, k):\r\n if (i in lst):\r\n ok = True\r\n break\r\n if (ok):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\na = input()\r\ng = 1\r\nl, r = a.index('G'), a.index('T')\r\nif l > r:\r\n l, r = r, l\r\nwhile l + k<= r:\r\n if a[l] == '#':\r\n g = 0\r\n l += k\r\nif l == r and g:\r\n print('YES')\r\nelse:\r\n print('NO')", "[n, k] = [int(x) for x in input().split()]\r\ns = input()\r\nl = min(s.index('G'), s.index('T')); r = max(s.index('G'), s.index('T'))\r\nif abs(l-r)%k != 0: print('NO')\r\nelse:\r\n noObst = True\r\n if l == s.index('G'):\r\n for i in range(l, r+1, k):\r\n if s[i] == '#':\r\n noObst = False\r\n break\r\n else:\r\n for i in range(r, l+1, -k):\r\n if s[i] == '#':\r\n noObst = False\r\n break\r\n print('YES' if noObst else 'NO')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\ng_pos = s.index('G')\r\ntarget_pos = s.index('T')\r\nflag=0\r\n\r\nif target_pos > g_pos:\r\n \r\n for i in range(g_pos,n,k):\r\n if s[i]=='#':\r\n break\r\n elif s[i]=='T':\r\n flag=1\r\nelse:\r\n for i in range(g_pos,-1,-k):\r\n if s[i]=='#':\r\n break\r\n elif s[i]=='T':\r\n flag=1\r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "n, k = map(int, input().split())\nlen_G = list(input())\na = len_G.index('G') +1\nb = len_G.index('T') +1\nc_index = [i for i, e in enumerate(len_G) if e == '#']\nc_index = [x+1 for x in c_index]\nli = []\nresult = False\n\nif a < b :\n minus = b - a\n if minus % k == 0:\n temp = a\n while temp < b:\n temp = temp + k \n\n if any(x in c_index for x in li):\n result = False\n break\n\n\n if temp == b:\n result = True\n break\n li.append(temp)\n\nif a > b :\n minus = a - b\n if minus % k == 0:\n temp = a\n while temp > b:\n temp = temp - k \n if any(x in c_index for x in li):\n result = False\n break\n if temp == b:\n result = True\n break\n li.append(temp)\n\nif result:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t\t \t\t \t \t\t \t\t\t", "n, k = list(map(int, input().split()))\r\ns = input().strip('.#')\r\nprint('NO') if (len(s) - 1) % k or '#' in s[:len(s):k] else print('YES')", "def f(s, n, k):\r\n a = b = 0\r\n st = set()\r\n for i in range(n):\r\n if(s[i] == \"#\"):\r\n st.add(i)\r\n elif(s[i] == \"G\"):\r\n a = i\r\n elif(s[i] == \"T\"):\r\n b = i\r\n l = min(a, b)\r\n r = max(a, b)\r\n if((r - l) % k != 0):\r\n return \"NO\"\r\n for i in st:\r\n if(l < i < r):\r\n if((i - l) % k == 0):\r\n return \"NO\"\r\n return \"YES\"\r\n \r\n[n , k] = list(map(int,input().split(\" \")))\r\ns = input()\r\nprint(f(s,n,k))\r\n", "n, k = map(int, input().split())\r\ns = list(input())\r\ng = 0\r\nt = 0\r\n\r\nfor i,m in enumerate(s):\r\n\tif m == 'T' or m=='G':\r\n\t\tfor j in range(i+k,len(s),k):\r\n\t\t\tif(s[j] == '#'):\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\texit(0)\r\n\t\t\tif(s[j] == 'G' or s[j] == 'T'):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit(0)\r\nprint(\"NO\")", "n,k=input().split()\r\nn,k=int(n),int(k)\r\ns=str(input())\r\na=abs(s.index('G')-s.index('T'))\r\nif(a%k==0):\r\n c=0\r\n for i in range(min(s.index('G'),s.index('T')),max(s.index('G'),s.index('T')),k):\r\n if s[i]==\"#\":\r\n c+=1\r\n print(\"NO\")\r\n break\r\n if(c==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\ns = input()\r\nif abs(s.find('G') - s.find('T')) % k == 0:\r\n for i in range(min(s.find('G'), s.find('T')), max(s.find('G'), s.find('T')), k):\r\n if s[i] == '#':\r\n print('NO')\r\n exit()\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, k = map(int, input().split())\ns = input()\ni = s.find(\"G\")\nans = 0\nwhile i < n:\n if s[i] == \"#\":\n break\n if s[i] == \"T\":\n ans = 1\n break\n i += k\ni = s.find(\"G\")\nwhile i > -1:\n if s[i] == \"#\":\n break\n if s[i] == \"T\":\n ans = 1\n break\n i -= k\nif ans == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "inp = input().split(' ')\nn = int(inp[0])\nk = int(inp[1])\ninp = input()\nstart = -1\nend = -1\nfor i in range(len(inp)):\n if inp[i] == 'G':\n start = i\n if inp[i] == 'T':\n end = i\nif start > end:\n start, end = end, start\nif (end - start) % k != 0:\n print('NO')\n exit()\nfor x in range(start, end, k):\n if inp[x] == '#':\n print('NO')\n exit()\nprint('YES')\n", "def solve(s, k):\r\n i = min(s.index('G'), s.index('T')) + k\r\n while i < len(s):\r\n if s[i] == '#': return \"NO\"\r\n if s[i] in ['G', 'T']: return \"YES\"\r\n i += k\r\n return \"NO\"\r\n\r\nn, k = map(int, input().split())\r\nprint(solve(input(), k))\r\n", "n, k = map(int, input().split())\ns = input()\ng, t = s.index('G'), s.index('T')\n\nif (abs(g - t)) % k == 0:\n for i in range(min(g, t), max(g, t), k):\n if s[i] == '#':\n print('NO')\n exit()\n \n print('YES')\nelse:\n print('NO')", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\ns = input()\r\n\r\ng_ind = 0\r\nt_ind = 0\r\nfor i in range(0, n):\r\n if(s[i] == 'G'):\r\n g_ind = i\r\n elif(s[i] == 'T'):\r\n t_ind = i\r\n\r\nstart = 0\r\nend =0\r\nif(g_ind < t_ind):\r\n start = g_ind\r\n end = t_ind\r\nelse:\r\n start = t_ind\r\n end = g_ind\r\n\r\nres = True\r\nif((end - start) % k != 0):\r\n res = False\r\nelse:\r\n while (start < end):\r\n if (s[start] == '#'):\r\n res = False\r\n break\r\n start += k\r\n\r\nif(res):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k=map(int,input().split())\r\nA=input()\r\nn1=A.index(\"T\")\r\nn2=A.index(\"G\")\r\nd=A.index(\"T\")-A.index(\"G\")\r\nif(d%(k)==0):\r\n s=0\r\n i=min(n1,n2)\r\n while(i<=max(n1,n2)):\r\n if(A[i]==\"#\"):\r\n s=1\r\n break\r\n else:\r\n i+=k\r\n if(s==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "\"\"\"\nProblem 735A: Ostap and Grasshopper\nhttp://codeforces.com/problemset/problem/735/A\n\"\"\"\n\nn, k = [int(x) for x in input().split(' ')]\nstring = input()\n\ng_index = string.index('G')\nt_index = string.index('T')\n\nif g_index > t_index:\n elems = list(string)\n elems[g_index], elems[t_index] = elems[t_index], elems[g_index]\n g_index, t_index = t_index, g_index\n string = ''.join(elems)\n\nif abs(g_index - t_index) % k != 0:\n print('NO')\nelse:\n i = g_index\n\n while i < n:\n if string[i] == 'T':\n print('YES')\n break\n\n if string[i] == '#':\n print('NO')\n break\n \n i += k\n", "n,k=map(int,input().split())\r\ns=input()\r\nif(s.index('T')<s.index('G')):\r\n x=0\r\n i=s.index('G')\r\n while i>=0:\r\n i-=k\r\n if(i>=0 and s[i]=='#'):\r\n break\r\n elif(i>=0 and s[i]=='T'):\r\n x=1\r\n break\r\n if(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n x=0\r\n i=s.index('G')\r\n while i<n:\r\n i+=k\r\n if(i<n and s[i]=='#'):\r\n break\r\n elif(i<n and s[i]=='T'):\r\n x=1\r\n break\r\n if(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,k=map(int, input().split())\r\ns1=str(input())\r\ns=list(i for i in s1)\r\nfor i in range(n):\r\n if s[i]=='G' and i+k<n:\r\n if s[i+k]==\"#\":\r\n break\r\n if s[i+k]==\"T\":\r\n print(\"YES\")\r\n exit()\r\n s[i+k]='G'\r\nfor i in range(n):\r\n if s[-i-1]=='G' and -1-i-k>=-n:\r\n if s[-i-1-k]==\"#\":\r\n break\r\n if s[-i-1-k]==\"T\":\r\n print(\"YES\")\r\n exit()\r\n s[n-i-1-k]='G'\r\nprint(\"NO\")\r\n", "from sys import exit\r\nn, k=map(int,input().split())\r\nstr=input()\r\ns,t=str.index('G'),str.index('T')\r\nif s>t:\r\n s,t=t,s\r\nif(t-s)%k!=0:\r\n print(\"NO\")\r\n exit(0)\r\nfor i in range(s,t,k):\r\n if str[i]=='#':\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "n, k = map(int, input().split())\r\ns = input()\r\nidG = s.index(\"G\")\r\nidT = s.index(\"T\")\r\n\r\n# jump forward\r\nif idG < idT:\r\n for i in range(idG+k, n, k):\r\n if s[i] == \"#\":\r\n print(\"NO\")\r\n break\r\n elif s[i] == \"T\":\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n\r\n# jump backward\r\nelse:\r\n for i in range(idG-k, -1, -k):\r\n if s[i] == \"#\":\r\n print(\"NO\")\r\n break\r\n elif s[i] == \"T\":\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")", "\r\n_, step = map(int, input().split())\r\ns = input()\r\n\r\ng = s.index('G')\r\nt = s.index('T')\r\n\r\nif t < g:\r\n t, g = g, t\r\n\r\nok = True\r\nif (t - g) % step != 0:\r\n ok = False\r\nelse:\r\n for i in range(g + step, t, step):\r\n if s[i] == '#':\r\n ok = False\r\n break\r\n\r\nprint(('NO', 'YES')[ok])\r\n", "n,k=[int(item) for item in input().split()]\r\ns=list(input())\r\n\r\ng = s.index(\"G\")\r\nt = s.index(\"T\")\r\nv = 0\r\nif g < t: v = k\r\nelse : v = -k\r\ni = g\r\nwhile i >= 0 and i < n:\r\n if i == t:\r\n print(\"YES\")\r\n break\r\n elif s[i] == \"#\":\r\n print(\"NO\")\r\n break\r\n i += v\r\nelse:\r\n print(\"NO\")", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn,k=map(int,input().split())\r\na=input()\r\nx=a.index(\"G\")\r\ny=a.index(\"T\")\r\nif (y-x)%k==0:\r\n\tif x<y:\r\n\t\tp=(y-x)//k\r\n\t\twhile p:\r\n\t\t\tx+=k\r\n\t\t\tif a[x]==\"#\":\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\texit()\r\n\t\t\tp-=1\r\n\telse:\r\n\t\tp=(x-y)//k\r\n\t\twhile p:\r\n\t\t\tx-=k\r\n\t\t\tif a[x]==\"#\":\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\texit()\r\n\t\t\tp-=1\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,k=map(int,input().split())\r\ns=input()\r\nt=s.index(\"T\")\r\ng=s.index(\"G\")\r\ndef f(s,t,g):\r\n\tif abs(t-g)%k==0:\r\n\t\tif g>t:\r\n\t\t\ts=s[::-1]\r\n\t\tt=s.index(\"T\")\r\n\t\tg=s.index(\"G\")\r\n\t\tfor i in range(g,t,k):\r\n\t\t\t# print(s[i],i)\r\n\t\t\tif s[i]==\"#\":\r\n\t\t\t\treturn \"NO\"\r\n\t\treturn \"YES\"\r\n\treturn \"NO\"\r\nprint(f(s,t,g))", "n, k = map(int, input().split())\n\nsequence = input()\n\nindex_G = sequence.find('G')\nindex_T = sequence.find('T')\n\nflag = True\n\nif index_T > index_G:\n for i in range(index_G, n, k):\n if i > index_T:\n flag = False\n print(\"NO\")\n break\n \n elif i == index_T:\n flag = False\n print(\"YES\")\n break\n \n elif sequence[i] == '#':\n flag = False\n print(\"NO\")\n break\n\n if flag:\n print(\"NO\")\n\nflag = True\n\nif index_T < index_G:\n for i in range(index_G, -1, -k):\n if i < index_T:\n flag = False\n print(\"NO\")\n break\n elif i == index_T:\n flag = False\n print(\"YES\")\n break\n elif sequence[i] == '#':\n flag = False\n print(\"NO\")\n break\n \n if flag:\n print(\"NO\")", "n,l = map(int, input().split())\r\ns = input()\r\ngi, ti = s.index('G'), s.index('T')\r\nif ti < gi: gi,ti = ti,gi\r\nse = set(s[gi:ti+1:l])\r\nprint('YES' if 'G' in se and 'T' in se and '#' not in se else 'NO')", "import sys\ninput = sys.stdin.readline\n\nn, k = [int(i) for i in input().split()]\ns = input()\npozicia = s.index(\"G\")\nciel = s.index(\"T\")\nvzdialenost = abs(s.index(\"G\") - s.index(\"T\"))\nodpoved = \"YES\"\nif vzdialenost % k:\n print(\"NO\")\n sys.exit()\nwhile pozicia != ciel:\n if pozicia < ciel:\n if s[pozicia + k] != \"#\" or \"#\" not in s:\n pozicia += k\n else:\n odpoved = \"NO\"\n break\n else:\n if s[pozicia - k] != \"#\" or \"#\" not in s:\n pozicia -= k\n else:\n odpoved = \"NO\"\n break\nprint(odpoved)\n", "n,k=map(int,input().strip().split(' '))\r\ns=input()\r\ng=s.index('G')\r\nt=s.index('T')\r\nif(g<t):\r\n i=g\r\n u=0\r\n while(True):\r\n \r\n \r\n i+=k\r\n if(i==t):\r\n \r\n \r\n u=1\r\n break\r\n if(i>t):\r\n break\r\n if(s[i]=='#'):\r\n break\r\n if(u==0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n i=t\r\n u=0\r\n while(True):\r\n \r\n i+=k\r\n if(i==g):\r\n u=1\r\n break\r\n if(i>g):\r\n break\r\n if(s[i]=='#'):\r\n break\r\n if(u==0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n \r\n ", "a,b = map(int,input().split())\r\nn = input()\r\nk = \"NO\"\r\nfor j in range(a):\r\n if n[j]==\"G\":\r\n for i in range(j,a,b):\r\n if n[i]==\"#\":\r\n break\r\n if n[i]==\"T\":\r\n k = \"YES\"\r\n break\r\n for i in range(j,-1,-b):\r\n if n[i]==\"#\":\r\n break\r\n if n[i]==\"T\":\r\n k = \"YES\"\r\n break\r\nprint(k)\r\n", "from collections import deque\n\n\nn, k = map(int, input().split())\nline = list(input())\nqueue = deque()\nfor idx, i in enumerate(line):\n if i == 'G':\n queue.append(idx)\n line[idx] = '#'\nres = False\nwhile len(queue) > 0:\n el = queue.popleft()\n if el - k >= 0 and line[el - k] != '#':\n queue.append(el - k)\n if line[el - k] == 'T':\n res = True\n break\n line[el - k] = '#'\n if el + k < n and line[el + k] != '#':\n queue.append(el + k)\n if line[el + k] == 'T':\n res = True\n break\n line[el + k] = '#'\nprint('YES' if res else 'NO')\n", "n, k = list(map(int, input().split()))\ns = input()\nstart = s.index('G')\nfor i in range(start, len(s), k):\n if s[i] == '#':\n break\n elif s[i] == 'T':\n print(\"YES\")\n exit()\nfor i in range(start, -1, -k):\n if s[i] == '#':\n break\n elif s[i] == 'T':\n print(\"YES\")\n exit()\nprint(\"NO\")\n", "\r\n\r\ndef posLeft(curPos, lt, num):\r\n #global globExit\r\n global check\r\n #if (globExit == True):\r\n #print('new procedure LEFT ' + str(num))\r\n #print('## PROCEDURE LEFT ' + str(num) + '## current pos = ' + str(curPos+1))\r\n if (curPos == finishPos):\r\n #print('## PROCEDURE LEFT ' + str(num) + '## end with TRUE')\r\n check = True\r\n return 0\r\n #print('YES')\r\n #globExit = False\r\n #return True\r\n elif (curPos < 0):\r\n #print('## PROCEDURE LEFT ' + str(num) + '## end with FALSE')\r\n return 0\r\n elif (lt[curPos] == '#'):\r\n #print('## PROCEDURE LEFT ' + str(num) + '## end with FALSE')\r\n return 0\r\n #globExit = False\r\n #return False\r\n \r\n elif (curPos != finishPos):\r\n #print('## PROCEDURE LEFT ' + str(num) + '## INTO new Procedure LEFT')\r\n posLeft(curPos-k, lt, num+1)\r\n\r\ndef posRight(curPos, lt, num):\r\n global check\r\n #global globExit\r\n #if (globExit):\r\n #print('new procedure RIGHT ' + str(num))\r\n #print('## PROCEDURE RIGHT ## current pos = ' + str(curPos+1))\r\n if (curPos == finishPos):\r\n #print('## PROCEDURE RIGHT ' + str(num) + '## end with TRUE')\r\n check = True\r\n #globExit = False\r\n #print('YES')\r\n #return True\r\n elif (curPos > len(lt)-1):\r\n #print('## PROCEDURE RIGHT ' + str(num) + '## end with FALSE')\r\n #globExit = False\r\n #return False\r\n return 0\r\n elif (lt[curPos] == '#'):\r\n #print('## PROCEDURE RIGHT ' + str(num) + '## end with FALSE')\r\n return 0\r\n \r\n elif (curPos != finishPos):\r\n #print('## PROCEDURE RIGHT '+ str(num) + '## INTO new Procedure Right')\r\n posRight(curPos+k, lt, num+1)\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\nlt = list(input())\r\n\r\n#globExit = True\r\ncheck = False\r\n#startPos = -100\r\n\r\ni1 = 0\r\nfor i in lt:\r\n if (i == 'G'):\r\n startPos = i1\r\n if (i == 'T'):\r\n finishPos = i1\r\n i1 += 1\r\n\r\n#pL =\r\nposLeft(startPos, lt, 1)\r\n#globExit = True\r\n#pR =\r\nposRight(startPos, lt, 1)\r\n#if ( (pL == True) or (pR == True) ):\r\nif (check):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\ng=s.index('G')\r\nt=s.index('T')\r\nif(t>g):\r\n while(t>=g):\r\n if(s[g]=='#'):\r\n print(\"NO\")\r\n exit()\r\n elif(t==g):\r\n print(\"YES\")\r\n exit()\r\n g+=k\r\nelse:\r\n while(t<=g):\r\n if(s[g]=='#'):\r\n print(\"NO\")\r\n exit()\r\n elif(t==g):\r\n print(\"YES\")\r\n exit()\r\n g-=k\r\nprint(\"NO\")", "def can_reach_insect(n, k, line):\r\n grasshopper_index = line.index('G')\r\n insect_index = line.index('T')\r\n if (insect_index - grasshopper_index) % k == 0:\r\n direction = 1 if insect_index > grasshopper_index else -1\r\n for i in range(grasshopper_index + direction * k, insect_index, direction * k):\r\n if line[i] == '#':\r\n return \"NO\"\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nn, k = map(int, input().split())\r\nline = input().strip()\r\nresult = can_reach_insect(n, k, line)\r\nprint(result)\r\n", "n, k = map(int, input().split())\r\nl = input()\r\n\r\nl = l[min(l.index('G'), l.index('T'))\r\n : max(l.index('G'), l.index('T')) + 1]\r\n\r\n\r\ndef jumper(l, k):\r\n if (len(l) - 1) % k is 0:\r\n for i in range(0, len(l), k):\r\n if l[i] is '#':\r\n return 'NO'\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\nprint(jumper(l, k))\r\n", "l,j = map(int,input().split())\r\nCourse = list(map(str,input().split()))\r\nG = 0\r\nT = 0\r\nobstacle_map = list()\r\njmap = list()\r\nfor k in range(len(Course)):\r\n for i in range(l):\r\n if Course[k][i] == \"G\":\r\n G = i+1\r\n if Course[k][i] == \"T\":\r\n T = i+1\r\n if Course[k][i] == \"#\":\r\n obstacle_map.append(i+1)\r\nGT = abs(G-T)\r\nctr=G\r\nfor i in range(min(T,G),max(T,G),j):\r\n jmap.append(i)\r\nCtr = 0\r\nfor i in jmap: \r\n if i in obstacle_map:\r\n Ctr+=1\r\nif GT%j == 0 and Ctr==0: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k = int(input().split()[1])\r\ns = input().strip(\".#\")\r\nprint(\"NO\" if (len(s)-1)%k or \"#\" in s[0:len(s):k] else \"YES\")", "x = input().split()\r\nn, k = int(x[0]), int(x[1])\r\n\r\ns = input()\r\nstart = s.index(\"G\")\r\nend = s.index(\"T\")\r\n\r\nif (start-end)%k != 0:\r\n print(\"NO\")\r\nelse:\r\n works = True\r\n for i in range(min(start, end), max(start, end), k):\r\n if s[i] == \"#\":\r\n works = False\r\n if works:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n, k = map(int, input().split())\nway = input()\nif way.index('T') < way.index('G'):\n way = way[::-1]\ni = way.index('G')\nwhile True:\n if i > len(way) - 1:\n print('NO')\n break\n if way[i] == '#':\n print('NO')\n break\n if way[i] == 'T':\n print('YES')\n break\n i = i + k \n", "def get_ans(n,k,l,g,t):\r\n\tif t<g:\r\n\t\ti = g-k\r\n\t\twhile(i>=t):\r\n\t\t\tif l[i] == \"#\":\r\n\t\t\t\tbreak\r\n\t\t\tif l[i] == 'T':\r\n\t\t\t\treturn(\"YES\")\r\n\t\t\ti = i-k\r\n\t\treturn(\"NO\")\r\n\r\n\telse:\r\n\t\ti = g\r\n\t\twhile(i<=t):\r\n\t\t\tif l[i] == \"#\":\r\n\t\t\t\tbreak\r\n\t\t\tif l[i] == 'T':\r\n\t\t\t\treturn(\"YES\")\r\n\t\t\ti = i+k\r\n\t\treturn(\"NO\")\r\n\r\n\r\nn,k = list(map(int, str(input()).strip().split()))\r\ns = str(input()).strip()\r\nl = [s[i] for i in range(len(s))]\r\n\r\n\r\ng = l.index('G')\r\nt = l.index('T')\r\n\r\n#print(l, t, g)\r\n\r\nprint(get_ans(n,k,l,g,t))", "n,k = map(int,input().split())\r\ns = input()\r\ng = s.index('G')\r\nt = s.index('T')\r\nif g>t:\r\n k = -k\r\ni = 1000\r\nu = 0\r\nwhile(i>0):\r\n if g!=t:\r\n try:\r\n if(s[g+k]!='#'):\r\n g+=k\r\n except:\r\n pass\r\n else:\r\n u+=1\r\n pass\r\n i-=1\r\nif u>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nx=s.find('G')\r\ny=s.find('T')\r\nflag=0\r\nif x<y:\r\n if (y-x)%k!=0:\r\n flag=1\r\n for i in range(x,y+1,k):\r\n if flag==1:\r\n break\r\n if s[i]=='#':\r\n flag=1\r\n break\r\nelse :\r\n if (x-y)%k!=0:\r\n flag=1\r\n for i in range(x,y+1,-1*k):\r\n if flag==1:\r\n break\r\n if s[i]=='#':\r\n flag=1\r\n break\r\n \r\nif flag==0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n,k=map(int,input().split())\r\np=list(str(input()))\r\n\r\nif p.index(\"G\")>p.index(\"T\"):\r\n p=p[::-1]\r\n \r\nfor i in range(p.index(\"G\"),n,k):\r\n if p[i]==\"#\":\r\n print(\"NO\")\r\n break\r\n if p[i]==\"T\":\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def main():\n [n, k] = [int(_) for _ in input().split()]\n line = input()\n index_g = line.index('G')\n index_t = line.index('T')\n distance = abs(index_g - index_t)\n\n if distance % k != 0:\n print('NO')\n else:\n has_obstacles = False\n\n for i in range(min(index_t, index_g), max(index_t, index_g) + 1, k):\n if line[i] == '#':\n has_obstacles = True\n break\n\n print('NO' if has_obstacles else 'YES')\n\n\nif __name__ == '__main__':\n main()\n", "\r\nn , k = map(int,input().split())\r\n\r\ns = input()\r\nans = \"NO\"\r\n\r\nif s.index('G') > s.index('T'):\r\n s = s[::-1]\r\n\r\ni = s.index('G')\r\n\r\nwhile i < n:\r\n\r\n if s[i] == 'T':\r\n ans = \"YES\"\r\n break\r\n elif s[i] == '.':\r\n i += k\r\n elif s[i] == '#':\r\n ans = 'NO'\r\n break\r\n else:\r\n i += k\r\n\r\nprint(ans)", "n,k = map(int,input().split())\r\ns = input()\r\n\r\nsg = s.index('G')\r\nst = s.index('T')\r\nif sg>st:\r\n sg,st = st,sg\r\n\r\nif (st-sg)%k:\r\n print(\"NO\")\r\nelse:\r\n for i in range(sg+k,st,k):\r\n if s[i]=='#':\r\n print(\"NO\")\r\n break;\r\n else:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\ns = input().strip('.#')\r\nl = len(s) - 1\r\nprint('NO' if l % k or '#' in s[0:l:k] else 'YES')", "n, x = map(int, input().split())\r\ns = input()\r\nans = 0\r\npoka = s.find('T')\r\nforing = s.find('G')\r\nif(poka < foring):\r\n for i in range(foring-x, -1, -x):\r\n if(s[i] == '#'):\r\n break\r\n elif(s[i] == 'T'):\r\n ans = 1\r\n break\r\nelse:\r\n for i in range(foring+x, n, x):\r\n if(s[i] == '#'):\r\n break\r\n elif(s[i] == 'T'):\r\n ans = 1\r\n break\r\nif(ans):print(\"YES\")\r\nelse:print(\"NO\")", "n, k = map(int, input().split())\r\ns = input()\r\nls = list(s)\r\nans = 'YES'\r\ncount = ls.index('G')\r\ncount1 = ls.index('T')\r\ndiff = abs(count - count1)\r\nif diff % k != 0:\r\n ans = 'NO'\r\nelif diff % k == 0:\r\n if count < count1:\r\n while count < count1:\r\n count += k\r\n if count < count1:\r\n if ls[count] == '#':\r\n ans = 'NO'\r\n break\r\n if count > count1:\r\n ans = 'NO'\r\n break\r\n\r\n elif count > count1:\r\n while count > count1:\r\n count -= k\r\n if count > count1:\r\n if ls[count] == '#':\r\n ans = 'NO'\r\n break\r\n if count < count1:\r\n ans = 'NO'\r\n break\r\nprint(ans)\r\n\r\n" ]

[ "n,m,x1,y1,x2,y2 = map(int, input().split())\r\nn = abs(x1 - x2)\r\nm = abs(y1 - y2)\r\nif n > 4 or m > 4:\r\n print(\"Second\")\r\nelif n <= 3 and m <= 3:\r\n print(\"First\")\r\nelif min(n, m) <= 2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n,m,X,Y,x,y=map(int,input().split())\r\na=[abs(X-x),abs(Y-y)]\r\na.sort()\r\nprint(\"First\" if a[1]<5 and a[0]+a[1]<7 else \"Second\")" ]

[ "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn,m=map(int,input().strip().split())\r\na=[]\r\nL=[]\r\nR=[]\r\nt={}\r\nfor i in range(n):\r\n b=input()\r\n a.append(b)\r\n L.append(9000000)\r\n R.append(0)\r\n t[i]=0\r\na.reverse()\r\nfor i in range(n):\r\n for j in range(m+2):\r\n if a[i][j]=='1':\r\n L[i]=min(L[i],j)\r\n R[i]=max(R[i],j)\r\n t[i]=1\r\nL1=0\r\nR1=9000000\r\nans=0\r\nfor i in range(n):\r\n if t[i]==0:\r\n L1+=1\r\n R1+=1\r\n continue\r\n ans=min(L1+R[i],R1+m+1-L[i])\r\n L2=min(L1+R[i]*2+1,R1+m+2)\r\n R2=min(R1+(m+1-L[i])*2+1,m+2+L1)\r\n L1=L2\r\n R1=R2\r\nprint(ans)\r\n\r\n", "n_and_m = input()\r\nn, m = n_and_m.split() #n - кол-во целых чисел, k - кол-во элем. заданной посл-ти меньше либо равны x(результат программы)\r\nn = int(n)\r\nm = int(m)\r\n\r\np = [input() for y in range(n)][::-1]\r\n\r\nl = r = d = 0\r\ni = j = 0\r\nfor y, t in enumerate(p):\r\n if '1' in t:\r\n l, r = min(l - i, r - j) + 2 * m + 2, min(l + i, r + j)\r\n i = t.find('1')\r\n j = t.rfind('1')\r\n l, r, d = l - i, r + j, y\r\nprint(min(l, r) + d)", "floors, rooms = map(int, input().split())\nm = []\n\nfor i in range(floors):\n m.append(input())\n\ndef solve(current, f=1, cost=0, lastFloor=0):\n if f == lastFloor:\n return cost\n\n currentFloor = floors - f - 1\n first, last = m[currentFloor - 1].find(\"1\"), m[currentFloor - 1].rfind(\"1\") \n if first == -1:\n return solve(current, f + 1, cost + 1, lastFloor)\n #return solve(current, f+1, cost+1)\n return min(solve(last, f+1, cost + current + last + 1, lastFloor),\n solve(first, f+1, cost + (rooms + 1 - current) + 1 + (rooms + 1 - first), lastFloor))\n\nlastFloor = -1\nfor i in range(floors):\n if \"1\" in m[i]:\n lastFloor = floors - i - 1\n break\nif lastFloor == -1:\n print(\"0\")\nelif floors == 1:\n print(m[0].rfind(\"1\"))\nelse:\n for i,x in enumerate(reversed(m)):\n pos = x.rfind(\"1\")\n if pos != -1:\n print( solve(pos, i, pos + i, lastFloor ))\n break\n", "import sys\n\ndef main():\n n,m = map(int,sys.stdin.readline().split())\n m+=2\n z = []\n for i in range(n):\n z.append(sys.stdin.readline().rstrip())\n\n ans = 0\n y = n-1\n x = 0\n q = [[x,y,ans]]\n for i in range(n-1,-1,-1):\n first =-1\n last = -1\n for j in range(m):\n if z[i][j] == '1':\n if first == -1:\n first = j\n last = j\n if first == -1 and last == -1:\n continue\n if i == n-1:\n q[0] = [last,n-1,last]\n continue\n if first == last :\n for t in q:\n t[2]+= min(t[0]+first, m-1-t[0]+m-1-first) + t[1]-i\n t[0] = first\n t[1] = i\n continue\n size = len(q)\n for s in range(size):\n t = q[s]\n q.append([last,i,t[2]+t[0]+last+t[1]-i])\n t[2]+= m-1-t[0]+m-1-first + t[1] - i\n t[0] = first\n t[1] = i\n q[s] = t\n ans = q[0][2]\n for i in range(len(q)):\n if q[i][2] < ans:\n ans = q[i][2]\n\n print(ans)\n\n\nmain()", "n, m = map(int, input().split())\r\na = [list(map(int, input())) for i in range(n)]\r\na.reverse()\r\ndp = [[0, 0] for i in range(n + 2)]\r\ndp[0][1]= 10000\r\nlast_none = -1\r\nlast = -1\r\nfor i in range(1, n + 1):\r\n f, l = -1, -1\r\n for j in range(1, m + 1):\r\n if a[i - 1][j] == 1:\r\n if f == -1:\r\n f = j\r\n l = j\r\n \r\n if f == -1:\r\n if last_none == -1:\r\n last_none = i\r\n if last + 1 == i:\r\n last_none = i\r\n dp[i][0] = dp[i - 1][0] + 1\r\n dp[i][1] = dp[i - 1][1] + 1\r\n continue\r\n else:\r\n last = i\r\n dp[i][0] = min(dp[i - 1][0] + 2 * l, dp[i - 1][1] + m + 1) + 1\r\n dp[i][1] = min(dp[i - 1][1] + 2 * (m + 1 - f), dp[i - 1][0] + m + 1) + 1\r\n\r\nt = last\r\nf, l = -1, -1\r\nif t != -1:\r\n for j in range(1, m + 1):\r\n if a[t - 1][j] == 1:\r\n if f == -1:\r\n f = j\r\n l = j\r\n\r\n ans = min(dp[t - 1][0] + l, dp[t - 1][1] + (m + 1 - f))\r\nelse:\r\n ans = 0\r\n \r\nprint(ans)\r\n", "n, m = list(map(int, input().split()))\r\nhouse = []\r\n\r\n\r\ndef look_right(position, house):\r\n x, y = position\r\n l = len(house[y])\r\n count = l - x\r\n ps = 0\r\n while ps == 0:\r\n pos = [l-1, y - 1]\r\n for i in range(l-1, -1, -1):\r\n if house[y-1][i] == 1:\r\n pos[0] = i\r\n ps += 1\r\n if ps > 0:\r\n count += l-pos[0]-1\r\n return {'cnt': count, 'position': pos, 'light': ps}\r\n else:\r\n y -= 1\r\n count += 1\r\n\r\n\r\ndef look_left(position, house):\r\n x, y = position\r\n l = len(house[y])\r\n count = x + 1\r\n ps = 0\r\n while ps == 0:\r\n pos = [0, y - 1]\r\n for i in range(0, l):\r\n if house[y-1][i] == 1:\r\n pos[0] = i\r\n ps += 1\r\n if ps > 0:\r\n count += pos[0]\r\n return {'cnt': count, 'position': pos, 'light': ps}\r\n else:\r\n count += 1\r\n y -= 1\r\n\r\nlights = 0\r\nfor _ in range(n):\r\n rooms = list(map(int, list(input().strip())))\r\n for i in rooms:\r\n if i == 1:\r\n lights += 1\r\n house.append(rooms)\r\nposition = [0, n-1]\r\npassed = 0\r\ntotal = 0\r\nwhile position[1] >= 0:\r\n for i in range(len(house[0])):\r\n if house[position[1]][i] == 1:\r\n position[0] = i\r\n total=(i+n-position[1]-1)\r\n passed+=1\r\n if total==0:\r\n position[1]-=1\r\n else:\r\n break\r\n#print(position)\r\n#print(lights)\r\n#print(passed)\r\nstates = []\r\nstates.append({'l': {'cnt': total, 'position': position, 'light': passed}, 'r': {'cnt': total, 'position': position, 'light': passed}})\r\ni=0\r\nwhile states[i]['l']['light'] < lights:\r\n position_l = states[i]['l']['position']\r\n l_l = look_left(position_l, house)\r\n l_r = look_right(position_l, house)\r\n\r\n position_r = states[i]['r']['position']\r\n r_l = look_left(position_r, house)\r\n r_r = look_right(position_r, house)\r\n\r\n if l_l['cnt']+states[i]['l']['cnt'] < r_l['cnt']+states[i]['r']['cnt']:\r\n sl = {'cnt': states[i]['l']['cnt']+l_l['cnt'], 'position': l_l['position'], 'light': states[i]['l']['light']+l_l['light']}\r\n else:\r\n sl = {'cnt': states[i]['r']['cnt'] + r_l['cnt'], 'position': r_l['position'],\r\n 'light': states[i]['r']['light'] + r_l['light']}\r\n\r\n if l_r['cnt']+states[i]['l']['cnt'] < r_r['cnt']+states[i]['r']['cnt']:\r\n sr = {'cnt': states[i]['l']['cnt'] + l_r['cnt'], 'position': l_r['position'],\r\n 'light': states[i]['l']['light'] + l_r['light']}\r\n else:\r\n sr = {'cnt': states[i]['r']['cnt'] + r_r['cnt'], 'position': r_r['position'],\r\n 'light': states[i]['r']['light'] + r_r['light']}\r\n\r\n states.append({'l': sl, 'r': sr})\r\n i += 1\r\n\r\nprint(min(states[i]['l']['cnt'], states[i]['r']['cnt']))\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, m = map(int, input().split())\r\ninf = pow(10, 9) + 1\r\nx = []\r\nfor _ in range(n):\r\n s = list(input().rstrip())\r\n l, r = inf, -inf\r\n for i in range(1, m + 1):\r\n if s[i] & 1:\r\n l, r = min(l, i), max(r, i)\r\n x.append((l, r))\r\nx.reverse()\r\nwhile x and x[-1][0] == inf:\r\n x.pop()\r\n n -= 1\r\npow2 = [1]\r\nfor _ in range(n):\r\n pow2.append(2 * pow2[-1])\r\nans = inf\r\nfor i in range(pow2[n]):\r\n now, ans0 = 0, 0\r\n for j in range(n):\r\n l, r = x[j]\r\n if l ^ inf:\r\n if not now:\r\n ans0 += r\r\n u = r\r\n else:\r\n ans0 += m - l + 1\r\n u = l\r\n else:\r\n u = 0 if not now else m + 1\r\n if j == n - 1:\r\n break\r\n if not i & pow2[j]:\r\n ans0 += u + 1\r\n now = 0\r\n else:\r\n ans0 += m + 2 - u\r\n now = 1\r\n ans = min(ans, ans0)\r\nprint(ans)", "def simulate(n, m, first, last, mask):\r\n pos = 'left'\r\n time = 0\r\n\r\n for floor in range(n - 1):\r\n action = mask & 1\r\n mask >>= 1\r\n\r\n if pos == 'left':\r\n if action == 0:\r\n time += 2 * last[floor]\r\n else:\r\n time += m + 1\r\n pos = 'right'\r\n else:\r\n if action == 0:\r\n time += 2 * (m + 1 - first[floor])\r\n else:\r\n time += m + 1\r\n pos = 'left'\r\n\r\n time += 1\r\n\r\n if pos == 'left':\r\n time += last[n - 1]\r\n else:\r\n time += m + 1 - first[n - 1]\r\n\r\n return time\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n\r\n building = []\r\n for i in range(n):\r\n building.append(list(map(int, input())))\r\n\r\n i_max = None\r\n for i in range(n):\r\n if any(x == 1 for x in building[i]):\r\n i_max = i\r\n break\r\n\r\n if i_max is None:\r\n i_max = n\r\n n = n - i_max\r\n\r\n if n == 0:\r\n print(0)\r\n return\r\n\r\n building = building[::-1]\r\n building = building[:n]\r\n\r\n first = [m + 1] * n\r\n last = [0] * n\r\n\r\n for i in range(n):\r\n for j in range(m + 2):\r\n if building[i][j] == 1:\r\n if first[i] == m + 1:\r\n first[i] = j\r\n last[i] = j\r\n\r\n min_time = 10 * ((m + 1) * n + n)\r\n for mask in range(2 ** (n - 1)):\r\n min_time = min(min_time, simulate(n, m, first, last, mask))\r\n\r\n print(min_time)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\n\r\ninf = float('inf')\r\nans = inf\r\n\r\ndef solve():\r\n global ans\r\n n, m = map(int, input().split())\r\n room = [[int(i) for i in input()] for j in range(n)]\r\n room.reverse()\r\n\r\n exits = [False] * n\r\n\r\n for i in range(n - 1, -1, -1):\r\n if any(room[i]):\r\n exits[i] = True\r\n\r\n if i - 1 >= 0:\r\n exits[i - 1] |= exits[i]\r\n\r\n # print(exits)\r\n\r\n if not exits[0]:\r\n ans = 0\r\n else:\r\n dfs(0, n, m, room, exits, 0, 0)\r\n\r\n print(ans)\r\n\r\ndef dfs(floor, n, m, room, exits, pos, move):\r\n global ans\r\n\r\n k = -1\r\n\r\n if pos == 0:\r\n for j in range(m + 1, -1, -1):\r\n if room[floor][j]:\r\n k = j\r\n break\r\n else:\r\n k = 0\r\n else:\r\n for j in range(0, m + 2):\r\n if room[floor][j]:\r\n k = j\r\n break\r\n else:\r\n k = m + 1\r\n\r\n move += abs(k - pos)\r\n\r\n if floor == n - 1 or not exits[floor + 1]:\r\n ans = min(ans, move)\r\n return\r\n else:\r\n dfs(floor + 1, n, m, room, exits, 0, move + k + 1)\r\n dfs(floor + 1, n, m, room, exits, m + 1, move + m + 1 - k + 1)\r\n\r\nif __name__ == '__main__':\r\n solve()", "import sys\r\nfrom itertools import accumulate\r\nfrom operator import or_\r\n\r\ninf = float('inf')\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n s = [[int(j) for j in input()] for i in range(n)][::-1]\r\n\r\n e = [any(si) for si in s]\r\n es = e[:] + [False]\r\n es = list(accumulate(es[::-1], or_))[::-1]\r\n\r\n if not es[0]:\r\n print(0)\r\n else:\r\n lim = 0\r\n\r\n for i in range(n + 1):\r\n if not es[i]:\r\n lim = i - 1\r\n break\r\n\r\n left, right = -1, inf\r\n\r\n for i in range(lim):\r\n if not e[i]:\r\n left, right = min(left + 1, right + m + 2), min(right + 1, left + m + 2)\r\n else:\r\n kr = rindex(s[i], 1)\r\n kl = s[i].index(1)\r\n left, right = min(left + 1 + 2*kr, right + m + 2), min(right + 1 + 2*(m + 1 - kl), left + m + 2)\r\n\r\n kr = rindex(s[lim], 1)\r\n kl = s[lim].index(1)\r\n\r\n ans = min(left + 1 + kr, right + m + 2 - kl)\r\n\r\n print(ans)\r\n\r\ndef rindex(arr, x):\r\n return len(arr) - 1 - arr[::-1].index(x)\r\n\r\nif __name__ == '__main__':\r\n solve()", "def counti(i,curr,stairs,s,s2):\r\n if i==n:\r\n return 0\r\n else:\r\n if on[i]!=-1:\r\n a=(m+2-L[i])+stairs+(m+2-curr)\r\n b=R[i]-1+stairs+curr-1\r\n stairs=1\r\n \r\n s=a\r\n x=counti(i+1,L[i],1,s,s2)\r\n s+=x\r\n \r\n s2=b\r\n y=counti(i+1,R[i],1,s,s2)\r\n s2+=y\r\n \r\n return min(s,s2)\r\n \r\n else:\r\n return counti(i+1,curr,stairs+1,s,s2)\r\n\r\nn,m=list(map(int,input().split()))\r\nLi=[]\r\nfor i in range(n):\r\n Li.append(input())\r\non=[]\r\nL=[]\r\nR=[]\r\nfor s in Li[::-1]:\r\n c=0\r\n count=1\r\n p=-1\r\n for i in s:\r\n if c==0 and i=='1':\r\n c=1\r\n L.append(count)\r\n on.append(1)\r\n if i=='1':\r\n p=count\r\n count+=1\r\n if p==-1:\r\n L.append(-1)\r\n R.append(-1)\r\n on.append(-1)\r\n else:\r\n R.append(p)\r\nc=0\r\ncurr=1\r\nif on[0]!=-1:\r\n c+=R[0]-curr\r\n curr=R[0]\r\nstairs=1\r\nc+=counti(1,curr,stairs,0,0)\r\nprint(c)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,M = map(int, input().split())\r\nS = []\r\nfor _ in range(N):\r\n S.append(input())\r\n \r\nS = S[::-1]\r\nwhile S and not '1' in S[-1]:\r\n S.pop()\r\n\r\nif not S:\r\n exit(print(0))\r\n\r\nN = len(S)\r\nINF=float(\"inf\")\r\ndp = [[INF,INF] for _ in range(N+1)]\r\ndp[0][0] = -1\r\nfor i in range(N):\r\n if '1' not in S[i]:\r\n dp[i+1][0] = dp[i][0]+1\r\n dp[i+1][1] = dp[i][1]+1\r\n continue\r\n \r\n last,first=0,M+1\r\n for j in range(1,M+1):\r\n if S[i][j]=='1':\r\n last = max(last, j)\r\n first = min(first, j)\r\n \r\n if i+1<N:\r\n dp[i+1][0] = min(dp[i][0]+1+last*2, dp[i][1]+M+2)\r\n dp[i+1][1] = min(dp[i][1]+1+(M+1-first)*2, dp[i][0]+M+2)\r\n else:\r\n dp[i+1][0] = min(dp[i][0]+1+last, dp[i][1]+1+(M+1-first))\r\n dp[i+1][1] = min(dp[i][1]+1+(M+1-first), dp[i][0]+1+last)\r\n\r\nprint(min(dp[-1]))", "n, m = map(int, input().split())\r\nnum = float('inf')\r\nleft = 0\r\nright = 1\r\nL, R = [], []\r\nfor i in range(n):\r\n s = input()\r\n if '1' not in s:\r\n L.append(-1)\r\n R.append(-1)\r\n else:\r\n L.append(s.index('1'))\r\n R.append(s.rindex('1'))\r\nk = 0\r\nwhile k < n and R[k] == -1:\r\n k += 1\r\nfor i in range(1 << n):\r\n tmp = 0\r\n pre = left\r\n for j in range(n - 1, k - 1, -1):\r\n if j == k:\r\n if pre == left:\r\n tmp += R[j]\r\n else:\r\n tmp += m + 1 - L[j]\r\n break\r\n if i & 1 << j:\r\n if pre == left:\r\n if R[j] == -1:\r\n pass\r\n else:\r\n tmp += R[j] * 2\r\n else:\r\n tmp += m + 1\r\n pre = left\r\n else:\r\n if pre == left:\r\n tmp += m + 1\r\n else:\r\n if R[j] == -1:\r\n pass\r\n else:\r\n tmp += (m + 1 - L[j]) * 2\r\n pre = right\r\n tmp += 1\r\n num = min(num, tmp)\r\n\r\nprint(num)\r\n", "from sys import stdin as fin\n# fin = open(\"cfr417b.in\", \"r\")\n\ndef f(i, csum, csl=True):\n global num_f, l_a, r_a, minv\n l, r = l_a[i], r_a[i]\n if i == num_f:\n csum += r if csl else l\n minv = min(minv, csum)\n else:\n f(i + 1, csum + m + 2, not csl)\n f(i + 1, csum + (r if csl else l) * 2 + 1, csl)\n # print(num_f)\n\nn, m = map(int, fin.readline().split())\narr = [list(int(sym) for sym in fin.readline().strip()) for i in range(n)]\ncsl = True\ncnt = 0\n# print(arr)\nborder = 0\nfor i in range(n):\n if 1 in arr[i]:\n break\n else:\n border += 1\nl_a, r_a = [], []\nnum_f = -1\nminv = float('inf')\nfor i in range(n - 1, border - 1, -1):\n if 1 in arr[i]:\n l = arr[i].index(1)\n r = list(reversed(arr[i])).index(1)\n l = (m + 2 - l - 1)\n r = (m + 2 - r - 1)\n else:\n l = r = 0\n # print(l, r, m + 2 - l - 1, csl)\n l_a.append(l)\n r_a.append(r)\n num_f += 1\n continue\nif num_f > -1:\n f(0, 0)\n print(minv)\nelse:\n print(0)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\na = 0\r\nb = m+1\r\nc = [0, 0]\r\ng = [input()[:-1] for _ in range(n)]\r\nfor i in range(n-1, 0, -1):\r\n if '1' in g[i]:\r\n c = [g[i].rindex('1') if a + g[i].rindex('1')*2 < b+m+1 else g[i].index('1'), m+1-g[i].index('1') if b + (m+1-g[i].index('1'))*2 < a + m + 1 else m+1-g[i].rindex('1')]\r\n a, b = min(a + g[i].rindex('1')*2, b+m+1)+1, min(b + (m+1-g[i].index('1'))*2, a + m + 1)+1\r\n else:\r\n a += 1\r\n b += 1\r\n c[0] += 1\r\n c[1] += 1\r\nif '1' in g[0]:\r\n print(min(a + g[0].rindex('1'), b + m + 1 - g[0].index('1')))\r\nelse:\r\n print(min(a-c[0], b-c[1]))\r\n", "from math import inf\r\n\r\n\r\nn, m = map(int, input().split())\r\nlights = [input() for i in range(n)][::-1]\r\n\r\nans = [[0, 0] for i in range(n)]\r\nlast_floor = n\r\n\r\n\r\ndef furthest_one(index, rev=False):\r\n if not rev:\r\n return lights[index].rfind('1')\r\n\r\n else:\r\n return lights[index][::-1].rfind('1')\r\n\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if '1' not in lights[i]:\r\n last_floor = i\r\n\r\n else:\r\n break\r\n\r\n\r\nans[0][1] = (m + 1)\r\n\r\nfor i in range(1, last_floor):\r\n paths = [[inf for j in range(2)] for i in range(2)]\r\n\r\n paths[0][0] = ans[i - 1][0]\r\n paths[0][1] = ans[i - 1][0]\r\n paths[1][0] = ans[i - 1][1]\r\n paths[1][1] = ans[i - 1][1]\r\n\r\n if '1' not in lights[i - 1]:\r\n paths[0][0] += 1\r\n paths[0][1] += (m + 2)\r\n paths[1][0] += (m + 2)\r\n paths[1][1] += 1\r\n\r\n else:\r\n paths[0][0] += (furthest_one(i - 1) * 2 + 1)\r\n paths[1][1] += (furthest_one(i - 1, rev=True) * 2 + 1)\r\n paths[0][1] += (m + 2)\r\n paths[1][0] += (m + 2)\r\n\r\n ans[i][0] = min(paths[0][0], paths[1][0])\r\n ans[i][1] = min(paths[0][1], paths[1][1])\r\n\r\n # print(ans[i][0], ans[i][1])\r\n\r\n\r\nmoves = min(ans[last_floor - 1][0] + furthest_one(last_floor - 1),\r\n ans[last_floor - 1][1] + furthest_one(last_floor - 1, rev=True))\r\nprint(moves if moves >= 0 else 0)", "import sys\r\n\r\ninf = float('inf')\r\nans = inf\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n s = [None] * n\r\n for i in range(n - 1, -1, -1):\r\n s[i] = [int(j) for j in input()]\r\n\r\n e = [any(si) for si in s]\r\n es = e[:] + [False]\r\n\r\n for i in range(n - 1, -1, -1):\r\n es[i] |= es[i + 1]\r\n\r\n # print(es)\r\n\r\n if not es[0]:\r\n print(0)\r\n elif es[0] and (not es[1]):\r\n k = -1\r\n\r\n for j in range(m, 0, -1):\r\n if s[0][j]:\r\n k = j\r\n break\r\n\r\n print(k)\r\n else:\r\n lim = 0\r\n\r\n for i in range(n + 1):\r\n if not es[i]:\r\n lim = i - 1\r\n break\r\n\r\n if not e[0]:\r\n left = 0\r\n right = m + 1\r\n else:\r\n for j in range(m, 0, -1):\r\n if s[0][j]:\r\n kr = j\r\n break\r\n\r\n left = 2*kr\r\n right = m + 1\r\n\r\n # print(left, right)\r\n\r\n for i in range(1, lim):\r\n if not e[i]:\r\n left, right = min(left + 1, right + m + 2), min(right + 1, left + m + 2)\r\n else:\r\n kr = kl = -1\r\n\r\n for j in range(m, 0, -1):\r\n if s[i][j]:\r\n kr = j\r\n break\r\n\r\n for j in range(1, m + 1):\r\n if s[i][j]:\r\n kl = j\r\n break\r\n\r\n left, right = min(left + 1 + 2*kr, right + m + 2), min(right + 1 + 2*(m + 1 - kl), left + m + 2)\r\n\r\n # print(left, right)\r\n\r\n kr = kl = -1\r\n\r\n for j in range(m, 0, -1):\r\n if s[lim][j]:\r\n kr = j\r\n break\r\n\r\n for j in range(1, m + 1):\r\n if s[lim][j]:\r\n kl = j\r\n break\r\n\r\n ans = min(left + 1 + kr, right + 1 + m + 1 - kl)\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "def minimum(floor,j,s,n,m):\n\tif(s==[]):\n\t\treturn 0\n\tif(floor==0):\n\t\tif(j==0):\n\t\t\treturn s[floor].rfind('1')\n\t\telse:\n\t\t\treturn m+1-s[floor].find('1')\n\tif(j==0):\n\t\treturn min(2*s[floor].rfind('1')+1+minimum(floor-1,0,s,n,m),m+2+minimum(floor-1,m+1,s,n,m))\n\telse:\n\t\treturn min(2*(m+1-s[floor].find('1'))+1+minimum(floor-1,m+1,s,n,m),m+2+minimum(floor-1,0,s,n,m))\n\ninp=input().split()\nn=int(inp[0])\nm=int(inp[1])\ns=[]\nfor i in range(n):\n\ts.append(input())\ncounter=0\nwhile(s!=[]):\n\tif(s[0].find('1')==-1):\n\t\tcounter+=1\n\t\ts.pop(0)\n\telse:\n\t\tbreak\ncounter2=0\ns2=[]\nfor val in s:\n\tif(val.find('1')==-1):\n\t\tcounter2+=1\n\telse:\n\t\ts2.append(val)\n\nprint(minimum(n-1-counter-counter2,0,s2,n,m)+counter2)", "import math\r\n\r\nn, m = 0, 0\r\nright_distance = []\r\nleft_distance = []\r\n\r\n\r\ndef calculate_left_distance(floor_structure):\r\n global left_distance\r\n for i in range(n):\r\n for j in range(m, 0, -1):\r\n if floor_structure[i][j] == '1':\r\n left_distance.append(j)\r\n break\r\n else:\r\n left_distance.append(0)\r\n\r\n\r\ndef calculate_right_distance(floor_structure):\r\n global right_distance\r\n for i in range(n):\r\n for j in range(1, m + 1):\r\n if floor_structure[i][j] == '1':\r\n right_distance.append(m + 1 - j)\r\n break\r\n else:\r\n right_distance.append(0)\r\n\r\n\r\ndef calculate_time(floor_structure, pos, index):\r\n if index == 0:\r\n if pos == 'l':\r\n return left_distance[index]\r\n return right_distance[index]\r\n if pos == 'l':\r\n left=calculate_time(floor_structure, 'l', index - 1)\r\n right=calculate_time(floor_structure, 'r', index - 1)\r\n if left==0:\r\n return left_distance[index]\r\n return min( left+(2 * left_distance[index]) + 1,\r\n right+m + 2)\r\n else:\r\n left = calculate_time(floor_structure, 'r', index - 1)\r\n right = calculate_time(floor_structure, 'l', index - 1)\r\n if left == 0:\r\n return right_distance[index]\r\n return min(left + (2 * right_distance[index]) + 1,\r\n right + m + 2)\r\n\r\n\r\ndef main():\r\n global n, m\r\n n, m = [int(x) for x in input().split()]\r\n floor_structure = []\r\n for i in range(n):\r\n temp = input()\r\n floor_structure.append(temp)\r\n calculate_left_distance(floor_structure)\r\n calculate_right_distance(floor_structure)\r\n # print(left_distance)\r\n # print(right_distance)\r\n print(calculate_time(floor_structure, 'l', n - 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import Counter\r\nimport sys\r\n\r\ndef left_time(floor):\r\n light_counter = Counter(floor)\r\n # print(light_counter)\r\n # print(light_counter['1'])\r\n if light_counter['1'] == 0:\r\n return 0\r\n else:\r\n last_light_search = 1\r\n while last_light_search <= len(floor):\r\n # print(last_light_search)\r\n if floor[-last_light_search] == '1':\r\n return((len(floor) - last_light_search) * 2)\r\n break\r\n else:\r\n last_light_search += 1\r\n \r\n\r\ndef right_time(floor):\r\n light_counter = Counter(floor)\r\n if light_counter['1'] == 0:\r\n return 0\r\n else:\r\n last_light_search = 0\r\n while True:\r\n if floor[last_light_search] == '1':\r\n return ((len(floor) - last_light_search - 1) * 2)\r\n break\r\n else:\r\n last_light_search += 1\r\n\r\nfloors_nr, rooms_nr = (int(x) for x in input().split())\r\nbuilding_scheme = []\r\nworth_counting_flag = False\r\nfor i in range(floors_nr):\r\n floor_i = input()\r\n c = Counter(floor_i)\r\n if not worth_counting_flag and c['1'] > 0:\r\n worth_counting_flag = True\r\n if worth_counting_flag:\r\n building_scheme.append(floor_i)\r\n\r\nif len(building_scheme) == 0:\r\n print(0)\r\n sys.exit()\r\n \r\noptimal_time = [(-1, 10000)]\r\n\r\nlast_floor = building_scheme[0]\r\nbuilding_scheme = building_scheme[1:]\r\nfor floor in building_scheme[::-1]:\r\n prefix_left, prefix_right = optimal_time[-1]\r\n \r\n keep_right_left = rooms_nr + 1 + prefix_left + 1\r\n keep_right_right = right_time(floor) + prefix_right + 1\r\n keep_right = min(keep_right_left, keep_right_right)\r\n \r\n keep_left_left = left_time(floor) + prefix_left + 1\r\n keep_left_right = rooms_nr + 1 + prefix_right + 1\r\n keep_left = min(keep_left_left, keep_left_right)\r\n \r\n optimal_time.append((keep_left, keep_right))\r\n\r\n# print(optimal_time)\r\n\r\nlast_floor_time = min(optimal_time[-1][0] + 1 + left_time(last_floor) // 2, optimal_time[-1][1] + 1 + right_time(last_floor) // 2)\r\nprint(last_floor_time)\r\n \r\n \r\n\r\n\r\n", "n, m = [int(x) for x in input().split()]\nB = [None]*n\nL = [-1]*n\nR = [-1]*n\nT = [False]*n\nfor i in range(n):\n B[n-1-i] = [int(x) for x in input()]\n for j in range(len(B[n-1-i])):\n if B[n-1-i][j] == 1:\n T[n-1-i] = True\n L[n-1-i] = j\n break\n for j in range(len(B[n-1-i])-1, -1, -1):\n if B[n-1-i][j] == 1:\n R[n-1-i] = j\n break\n \ncost = [[0 for x in range(2)] for y in range(n)]\ncost[0] = [0, m +1]\nfor fl in range(1, n):\n if T[fl-1]:\n cost[fl][0] = min(cost[fl-1][1]+m+2, cost[fl-1][0] + 2*(R[fl-1])+1)\n cost[fl][1] = min(cost[fl-1][0]+m+2, cost[fl-1][1] + 2*(m+1-L[fl-1])+1)\n else:\n cost[fl][0] = cost[fl-1][0] + 1\n cost[fl][1] = cost[fl-1][1] + 1\nlast = n - 1\nwhile last >= 0 and T[last] == False:\n last -= 1\nif last < 0:\n print(0)\nelif last == 0 and not T[last]:\n print(0)\nelse:\n print(min(cost[last][0] + R[last], cost[last][1] + m+1-L[last]))\n\n", "import sys\r\nimport io, os\r\nimport math\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nceil = math.ceil\r\n# arr=list(map(int, input().split()))\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\ndef lastf(arr,beg):\r\n if(beg==0):\r\n ed=-1\r\n for i in range(len(arr)-1,-1,-1):\r\n if(arr[i]==\"1\"):\r\n ed=i\r\n break\r\n if(ed==-1):\r\n return 0\r\n return ed\r\n else:\r\n ed=-1\r\n for i in range(len(arr)):\r\n if(arr[i]==\"1\"):\r\n ed=i\r\n break\r\n if(ed==-1):\r\n return 0\r\n return len(arr)-1-ed\r\ndef cost(arr,beg,ed):\r\n if(beg!=ed):\r\n return len(arr)-1\r\n if(beg==0):\r\n ed1=-1\r\n for i in range(len(arr)-1,-1,-1):\r\n if(arr[i]==\"1\"):\r\n ed1=i\r\n break\r\n if(ed1==-1):\r\n return 0\r\n return 2*ed1\r\n else:\r\n ed1=-1\r\n for i in range(len(arr)):\r\n if(arr[i]==\"1\"):\r\n ed1=i\r\n break\r\n if(ed1==-1):\r\n return 0\r\n return 2*(len(arr)-ed1-1)\r\ndef allz(s):\r\n trig=True\r\n for i in range(len(s)):\r\n if(s[i]==\"1\"):\r\n trig=False\r\n break\r\n return trig\r\ndef main():\r\n arr=list(map(int, input().split()))\r\n n=arr[0]\r\n m=arr[1]\r\n floor=[]\r\n trig=True\r\n for i in range(n):\r\n s=strinp(90)\r\n if(trig):\r\n if(allz(s)):\r\n continue\r\n else:\r\n floor.append(s)\r\n trig=False\r\n else:\r\n floor.append(s)\r\n floor.reverse()\r\n tn=n\r\n n=len(floor)\r\n if(n==0):\r\n print(0)\r\n sys.exit()\r\n if(n==1):\r\n print(lastf(floor[0],0))\r\n exit()\r\n dpl=[0]*n\r\n dpr=[0]*n\r\n dpl[0]=cost(floor[0],0,0)\r\n dpr[0]=cost(floor[0],0,m+1)\r\n for i in range(1,n):\r\n arr=floor[i]\r\n if(i==n-1):\r\n dpr[i]=dpr[i-1]+lastf(arr,m+1)+1\r\n dpl[i]=dpl[i-1]+lastf(arr,0)+1\r\n else:\r\n dpr[i]=1+min(dpl[i-1]+cost(arr,0,m+1),dpr[i-1]+cost(arr,m+1,m+1))\r\n dpl[i]=1+min(dpl[i-1]+cost(arr,0,0),dpr[i-1]+cost(arr,m+1,0))\r\n print(min(dpl[-1],dpr[-1]))\r\nmain()", "import itertools\r\n\r\nn, m = map(int, input().split())\r\n\r\nfloors = []\r\nmax_lit = -1\r\nfor floor_n in range(n-1, -1, -1):\r\n cur_floor = input()\r\n floors.insert(0, cur_floor)\r\n if max_lit == -1 and any(c == '1' for c in cur_floor):\r\n max_lit = floor_n + 1\r\n\r\nif max_lit == -1:\r\n print('0')\r\n exit()\r\n\r\n\r\ndef calc_path(path):\r\n left = True\r\n result = 0\r\n for floor in range(max_lit):\r\n switch_stairs = path[floor]\r\n if left:\r\n pos = floors[floor].rfind('1')\r\n dist = 0 if pos == -1 else pos\r\n else:\r\n pos = floors[floor].find('1')\r\n dist = 0 if pos == -1 else m + 1 - pos\r\n is_last = floor == max_lit-1\r\n result += dist\r\n if switch_stairs:\r\n if not is_last:\r\n result += m + 1 - dist\r\n left = not left\r\n else:\r\n if not is_last:\r\n result += dist\r\n if not is_last:\r\n result += 1\r\n return result\r\n\r\n\r\nmin_v = -1\r\n\r\nfor p in itertools.product([False, True], repeat=max_lit):\r\n v = calc_path(p)\r\n if min_v == -1 or min_v > v:\r\n min_v = v\r\n\r\nprint(min_v)\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nInf = int(1e9+7)\r\n\r\n[n, m] = list(map(int, input().split()))\r\nbld = list()\r\nfor i in range(n):\r\n bld.append(input())\r\nbld.reverse()\r\n\r\nlef = [m+1 for i in range(n)]\r\nrig = [0 for i in range(n)]\r\nlast = -1\r\nfor i in range(n):\r\n for j in range(m+2):\r\n if bld[i][j] == '1':\r\n lef[i] = min(lef[i], j)\r\n rig[i] = max(rig[i], j)\r\n last = max(last, i)\r\n\r\ndp = [[Inf for j in range(2)] for i in range(n)]\r\ndp[0][0] = 0\r\nfor i in range(last):\r\n dp[i+1][0] = min(dp[i+1][0], dp[i][1]+m+1+1)\r\n dp[i+1][0] = min(dp[i+1][0], dp[i][0]+2*rig[i]+1)\r\n dp[i+1][1] = min(dp[i+1][1], dp[i][0]+m+1+1)\r\n dp[i+1][1] = min(dp[i+1][1], dp[i][1]+2*(m+1-lef[i])+1)\r\nif last == -1:\r\n print('0')\r\n exit(0)\r\nelif last == 0:\r\n res = rig[0]\r\nelse:\r\n res = min(dp[last][0]+rig[last], dp[last][1]+(m+1-lef[last]))\r\nprint(res)\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nans=0\r\ndp=[[0,0] for i in range(n)]\r\ndp[n-1][0]=0\r\ndp[n-1][1]=m+1\r\nfor i in range(n-1,0,-1):\r\n x=l[i][::-1]\r\n if '1' in l[i]:\r\n a=x.index('1')\r\n b=l[i].index('1')\r\n else:\r\n a=m+1\r\n b=m+1\r\n dp[i-1][0]=min(dp[i][0]+2*(m+1-a)+1,dp[i][1]+m+2)\r\n dp[i-1][1]=min(dp[i][1]+2*(m-b+1)+1,dp[i][0]+m+2)\r\nfor i in range(n):\r\n if '1' in l[i]:\r\n a=l[i][::-1].index('1')\r\n b=l[i].index('1')\r\n ans=min(dp[i][0]+m+1-a,dp[i][1]+m+1-b)\r\n break\r\nprint(ans)\r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\nL = [list(input()) for i in range(n)]\nlight_floors = [n - i - 1 for i in range(n) if \"1\" in L[i]]\nif len(light_floors) == 0:\n print(0)\n exit()\nlimit = max(light_floors)\n\ndef rec(i, lst):\n if i == limit:\n # first: left\n # print(list(reversed(L[-1])))\n if \"1\" in L[-1]:\n cnt = m + 2 - list(reversed(L[-1])).index(\"1\") - 1\n else:\n cnt = 0\n now = cnt\n for j, l in enumerate(lst):\n if l == \"l\":\n cnt += now\n cnt += 1\n if \"1\" in L[-1 - j - 1]:\n next_pos = (m + 2 - list(reversed(L[-1 - j - 1])).index(\"1\") - 1)\n else:\n next_pos = 0\n cnt += next_pos\n now = next_pos\n else:\n cnt += (m + 2 - now - 1)\n cnt += 1\n if \"1\" in L[-1 - j - 1]:\n next_pos = L[-1 - j - 1].index(\"1\")\n else:\n next_pos = m + 2 - 1\n cnt += (m + 2 - next_pos - 1)\n now = next_pos\n return cnt\n\n return min(rec(i + 1, lst + [\"l\"]), rec(i + 1, lst + [\"r\"]))\n\n\nprint(rec(0, []))\n", "n, m = map(int, input().split())\np = [input() for y in range(n)][::-1]\nl = r = d = 0\ni = j = 0\nfor y, t in enumerate(p):\n if '1' in t:\n l, r = min(l - i, r - j) + 2 * m + 2, min(l + i, r + j)\n i, j = t.find('1'), t.rfind('1')\n l, r, d = l - i, r + j, y\nprint(min(l, r) + d)\n \t \t\t\t \t\t\t\t \t\t\t \t\t\t\t\t \t\t \t\t", "def sol():\r\n\r\n n, m = map(int, input().split(' '))\r\n\r\n mapp = []\r\n\r\n for a in range(n):\r\n s = list(input())\r\n s = [c == \"1\" for c in s]\r\n mapp.insert(0, s[1:-1])\r\n\r\n res = None\r\n #print(mapp)\r\n\r\n empty_floor = n\r\n while True:\r\n litup = False\r\n for x in mapp[empty_floor-1]:\r\n if x:\r\n litup = True\r\n break\r\n if not litup:\r\n empty_floor -= 1\r\n else:\r\n break\r\n if empty_floor < 0:\r\n break\r\n\r\n if empty_floor <= 0:\r\n return 0\r\n\r\n #print(\"empty_floor\", empty_floor)\r\n\r\n for comb in range(2**(empty_floor-1)):\r\n temp = 0\r\n c = bin(comb)[2:]\r\n c = \"0\" * ((empty_floor-1)-len(c)) + c\r\n c = list(c)\r\n c = [x == \"1\" for x in c]\r\n\r\n #print(\"c\", c)\r\n\r\n last = False # start from left\r\n if empty_floor != 1:\r\n for i, x in enumerate(c):\r\n if x != last:\r\n temp += m+1 + 1\r\n else:\r\n f = None\r\n #print(i)\r\n #print(\"last\", last)\r\n for j, y in enumerate(mapp[i]):\r\n if y:\r\n f = j\r\n if last:\r\n break\r\n if f is None:\r\n temp += 1\r\n else:\r\n if last:\r\n temp += 2 * (m - f) + 1\r\n else:\r\n temp += 2 * (f + 1) + 1\r\n last = x\r\n\r\n\r\n #final floor:\r\n f = None\r\n for j, y in enumerate(mapp[empty_floor-1]):\r\n if y:\r\n f = j\r\n if last:\r\n break\r\n if f is not None:\r\n #print(f, \"f\")\r\n if c[-1]:\r\n temp += m - f\r\n else:\r\n temp += f + 1\r\n\r\n if res is None:\r\n res = temp\r\n res = min(res, temp)\r\n\r\n #print(c, temp)\r\n\r\n\r\n return res\r\n\r\nprint(sol())" ]

[ "I = lambda: map(int, input().split())\r\n\r\n_, m = I()\r\nA = list(I())\r\nx, y = 2*A.count(-1), 2*A.count(1)\r\nB = []\r\n\r\nfor _ in range(m):\r\n L, R = I()\r\n k = R-L+1\r\n B.append(1 - (k%2 or x<k or y<k))\r\n\r\nprint(*B)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc1=a.count(1)\r\nc2=a.count(-1)\r\nfor i in range(m):\r\n\tl,r=map(int,input().split())\r\n\tif l==r:\r\n\t\tprint(0)\r\n\t\tcontinue\r\n\telif (r-l+1)%2:\r\n\t\tprint(0)\r\n\t\tcontinue\r\n\telse:\r\n\t\tif ((r-l+1)//2)<=c1 and ((r-l+1)//2)<=c2:\r\n\t\t\tprint(1)\r\n\t\telse:\r\n\t\t\tprint(0)", "n, m = map(int, input().split())\na = input().split().count('1')\nb = min(a, n - a) * 2\nans = []\nfor i in range(m):\n l, r = map(int, input().split())\n length = r - l + 1\n ans += ['0'] if length % 2 or length > b else ['1']\nprint('\\n'.join(ans))\n", "n,m=map(int,input().split())\r\na=input().split()\r\nmn=a.count(\"-1\")\r\nmn=min(mn,n-mn)\r\nans=\"\"\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n if (r-l)%2==1 and mn>=(r-l+1)//2:ans+=\"1\\n\"\r\n else:ans+=\"0\\n\"\r\nprint(ans)", "n,q = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nt = 0\r\nd = {1:0,-1:0}\r\nans = \"\"\r\nfor i in range(n):\r\n\td[l[i]] = d[l[i]] + 1\r\nfor i in range(q):\r\n\tl1,r1 = map(int,input().split())\r\n\tif (-l1+r1)%2 == 0:\r\n\t\tans += \"0\\n\"\r\n\telif d[1] >= (r1-l1+1)//2 and d[-1] >= (r1-l1+1)//2:\r\n\t\tans += \"1\\n\"\r\n\telse:\r\n\t\tans += \"0\\n\"\r\nprint(ans)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nx=l1.count(-1)\r\nx=min(x,n-x)\r\nx=2*x\r\nans=[]\r\n\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n if (r-l+1)%2==1:\r\n ans.append(0)\r\n elif (r-l+1)%2==0 and (r-l+1)<=x:\r\n ans.append(1)\r\n else :\r\n ans.append(0)\r\nfor item in ans:\r\n print(item)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na_plus = a.count(1)\r\na_minus = a.count(-1)\r\ns = ''\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n length = r - l + 1\r\n s += '0\\n' if length % 2 or length // 2 > a_plus or length // 2 > a_minus else '1\\n'\r\nprint(s)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = []\r\nc1= c2= 0\r\n\r\nfor value in a :\r\n if value == 1:\r\n c1 += 1\r\n else:\r\n c2 +=1\r\n\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n myr = r - l + 1 \r\n result = 1 if myr % 2 == 0 and c1 >= myr // 2 and c2 >= myr // 2 else 0\r\n ans.append(result)\r\n\r\nfor val in ans:\r\n print(val)\r\n\r\n", "import sys\r\nn,m=[int(x) for x in sys.stdin.readline().strip().split()]\r\nl=[int(x) for x in sys.stdin.readline().strip().split()]\r\nx,y=0,0\r\nfor i in range(n):\r\n if(l[i]==1):\r\n x=x+1\r\ny=n-x\r\nfor u in range(m):\r\n a,b=[int(x) for x in sys.stdin.readline().strip().split()]\r\n s=b-a+1\r\n if(s%2==0 and s//2<=y and s//2<=x):\r\n print(1)\r\n else:\r\n print(0)\r\n", "l = input().split(' ')\r\nn = int(l[0])\r\nm = int(l[1])\r\nl = input().split(' ')\r\nminus = 0\r\nplus = 0\r\nfor i in range(n):\r\n if int(l[i]) == 1:\r\n plus += 1\r\n else:\r\n minus += 1\r\nres = [0]*m\r\nfor i in range(m):\r\n l = input().split(' ')\r\n d = int(l[1]) - int(l[0]) + 1\r\n if d % 2 == 0 and d // 2 <= minus and d // 2 <= plus:\r\n res[i] = 1\r\nfor i in range(m):\r\n print(res[i])", "def solve(n,m,arr,mat):\n\td={-1:0 , 1:0}\n\tfor i in arr:\n\t\td[i]+=1\n\n\tfor i in mat :\n\t\tdif = i[1]-i[0] +1\n\t\tif dif%2==0 :\n\t\t\tif d[-1]>= dif//2 and d[1]>=dif//2 :\n\t\t\t\tprint(1)\n\t\t\telse :\n\t\t\t\tprint(0)\n\t\telse:\n\t\t\tprint(0)\n\n\n\t\n\n\n\t\t\n\n\t\n\n\n\nl3=input()\nl3=[int(x) for x in l3.split(' ')]\nl4=input()\nl4=[int(x) for x in l4.split(' ')]\nmat=[]\nfor i in range(l3[1]) :\n\tl6=input()\n\tl6=[int(x) for x in l6.split(' ')]\n\tmat.append(l6)\n\n\n\n\nsolve(l3[0],l3[1] ,l4 ,mat)\n", "import sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\n*a, = map(int, input().split())\r\nc1 = a.count(1)\r\nc2 = a.count(-1)\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n r = r - l + 1\r\n if r % 2:\r\n print(0)\r\n else:\r\n if r // 2 <= min(c1, c2):\r\n print(1)\r\n else:\r\n print(0)", "n,m=map(int,input().split())\r\nl=list(input().split())\r\np,q=0,0\r\nc=\"\"\r\nfor x in l:\r\n\tif x==\"1\":\r\n\t\tp+=1\r\n\telse:\r\n\t\tq+=1\r\nfor i in range(m):\r\n\ta,b=map(int,input().split())\r\n\tif (b-a+1)%2==0 and p>=(b-a+1)//2 and q>=(b-a+1)//2:\r\n\t\tc+=\"1\\n\"\r\n\telse:\r\n\t\tc+=\"0\\n\"\r\nprint(c)", "n,m = map(int,input().split())\r\na = input()\r\np,q = a.count('1'), a.count('-')\r\nj = ['0']*m\r\nc = 2*min(p-q, q)\r\nfor i in range(m):\r\n l,r = map(int,input().split())\r\n if (r-l)&1 and (r-l)<c: j[i] = '1'\r\nprint('\\n'.join(j))\r\n", "n,m=map(int, input().split())\r\narr=list(map(int, input().split()))\r\nl=[]\r\nfor i in range(m):\r\n a,b=map(int, input().split())\r\n l.append([a,b])\r\nx=arr.count(1)\r\ny=arr.count(-1)\r\nfor i in range(m):\r\n if (l[i][1]-l[i][0]+1)%2==0:\r\n a=l[i][1]-l[i][0]+1\r\n if ((a//2)>x or (a//2)>(y)):\r\n print(0)\r\n else:\r\n print(1)\r\n else:\r\n print(0)", "def main():\r\n n, m = [int(x) for x in input().split()]\r\n lst = [int(x) for x in input().split()]\r\n one = lst.count(1)\r\n out = \"\"\r\n\r\n while m:\r\n m -= 1\r\n l, r = [int(x) for x in input().split()]\r\n diff = r - l + 1\r\n if diff % 2 == 0 and one >= diff / 2 and (n-one) >= diff / 2:\r\n out += \"1\\n\"\r\n else:\r\n out += \"0\\n\"\r\n print(out)\r\n\r\n\r\nmain()", "n,m = map(int,input().split())\r\nl=input().split()\r\na=l.count(\"-1\")\r\na=min(a,n-a)\r\nans=\"\"\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x=y-x+1\r\n \r\n if(x%2==0 and x//2<=a ):\r\n ans+=\"1\\n\"\r\n else:\r\n ans+=\"0\\n\"\r\nprint(ans)", "n , m = map(int,input().split())\r\narr = input().split()\r\nx = arr.count('1')\r\ny = n - x\r\nans = ''\r\nfor j in range(m):\r\n l , r = map(int,input().split())\r\n if (r - l + 1) % 2 == 0 and min(x , y) >= (r - l + 1)//2 :\r\n ans += '1\\n'\r\n else:\r\n ans += '0\\n'\r\nprint(ans)\r\n\r\n\r\n", "# Problem Link: https://codeforces.com/problemset/problem/302/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\nn, q = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\n\r\ncount_negs = 0\r\nfor el in arr:\r\n if el == -1:\r\n count_negs += 1\r\n\r\ncount_pos = n - count_negs\r\n\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n dist = (r - l + 1)\r\n if dist%2 == 1:\r\n print(0)\r\n else:\r\n if count_negs >= dist//2 and count_pos >= dist//2:\r\n print(1)\r\n else:\r\n print(0)\r\n", "n,m=map(int, input().split())\r\np=input().split()\r\nt=p.count(\"-1\")\r\nt=min(t, n-t)\r\ns=\"\"\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n if (r-l)% 2==1 and t>=(r-l+1)//2:\r\n s+=\"1\\n\"\r\n else:\r\n s+=\"0\\n\"\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\ns=len(input().replace(\"1\",\"\").replace(\" \",\"\"))\r\nsb=min([n-s,s])\r\nss=\"\"\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n diff=(b-a+1)\r\n if diff%2==0 and diff<=sb<<1 :\r\n ss+=\"1\\n\"\r\n else:\r\n ss+=\"0\\n\"\r\nprint(ss)", "n, m = (int(i) for i in input().split())\na = sum(int(i) for i in input().split())\nx = min(n + a, n - a)\nres = []\nfor _ in range(m):\n l, r = (int(i) for i in input().split())\n sz = r - l + 1\n res += [1 if sz & 1 == 0 and sz <= x else 0]\nprint(*res, sep=\"\\n\")\n", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n\r\nn,m=RI()\r\nl=RI()\r\n\r\nneg=0\r\nfor i in l:\r\n if(i==-1):\r\n neg+=1\r\npos=n-neg\r\nfor i in range(m):\r\n a,b=RI()\r\n t=b-a+1\r\n if(t%2==0 and t//2<=neg and t//2<=pos):\r\n print(1)\r\n else:\r\n print(0)\r\n", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ncoutone,coutmone=0,0\r\nfor i,x in enumerate(lst):\r\n if x==1:coutone+=1\r\n else:coutmone+=1\r\nfrom sys import stdin\r\nres=''\r\nfor i in range(m):\r\n l,r=map(int,stdin.readline().split())\r\n x,y=(r-l+1)//2,(r-l+1)%2\r\n if y==0:\r\n if coutone>=x and coutmone>=x:res+='1\\n'\r\n else:res+='0\\n'\r\n else:res+='0\\n'\r\nprint(res[:m*2-1])", "n, m = list(map(int, input().split(' ')))\r\na = input().split(' ').count('-1')\r\ns = []\r\nfor _ in range(m):\r\n l, r = list(map(int, input().split(' ')))\r\n if (r - l) % 2 and min(a, n - a) >= (r - l + 1) // 2:\r\n s.append('1\\n')\r\n else:\r\n s.append('0\\n')\r\nprint(''.join(s))", "n, m=map(int,input().split())\r\na=list(map(int, input().split()))\r\np=\"\"\r\ns=sum(a)\r\n\r\nif s>0:\r\n\td=n-s\r\n\tneg=pos=d//2\r\n\tpos+=s\r\nelse:\r\n\td=n+s\r\n\tneg=pos=d//2\r\n\tneg-=s\r\n\r\nfor i in range(m):\r\n\tl, r=map(int, input().split())\r\n\td=(r-l)+1\r\n\tr=d%2\r\n\tif r:\r\n\t\tp+=\"0\\n\"\r\n\telse:\r\n\t\tif d//2<=neg and d//2<=pos:\r\n\t\t\tp+=\"1\\n\"\r\n\t\telse:\r\n\t\t\tp+=\"0\\n\"\r\n#Printing Every line made TLE...\r\nprint(p)", "I = lambda: map(int, input().split())\r\nn, m = I()\r\nx = sum(x > 0 for x in I())\r\nx = min(x, n - x)\r\no = []\r\nwhile m:\r\n l, r = I()\r\n o += [[0, 1][(r - l) % 2 and (r - l + 1) // 2 <= x]]\r\n m -= 1\r\nprint(*o)", "N, M = map(int, input().split())\n\nA = input().split()\n\ncount_one = A.count('1')\n\nsolution = []\n\nqueries = []\nfor i in range(M):\n Li, Ri = map(int, input().split())\n if ( (Ri-Li+1)%2 == 0 and\n (Ri-Li+1)//2 <= min(count_one, N-count_one)):\n solution.append('1')\n continue\n else:\n solution.append('0')\n\nprint('\\n'.join(solution))\n", "import sys\n\ndef main():\n (n, m) = map(int, sys.stdin.readline().split(' '))\n a = list(map(int, sys.stdin.readline().split(' ')))\n ones = 0\n negs = 0\n for ai in a:\n if ai == 1:\n ones += 1\n else:\n negs += 1\n for i in range(m):\n (l, r) = map(int, sys.stdin.readline().split(' '))\n count = r - l + 1\n if count % 2 != 0:\n sys.stdout.write(\"0\\n\")\n else:\n if ones >= count // 2 and negs >= count // 2:\n sys.stdout.write(\"1\\n\")\n else:\n sys.stdout.write(\"0\\n\")\nmain()\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na_min = min(a.count(1), a.count(-1))\r\ns = ''\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n length = r - l + 1\r\n s += '0\\n' if length % 2 or length // 2 > a_min else '1\\n'\r\nprint(s)\r\n", "z=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nd=[]\r\ns=x.count(-1)\r\nb=x.count(1)\r\nfor i in range(z[1]):\r\n c=0\r\n f=list(map(int,input().split()))\r\n c=f[1]-f[0]+1\r\n if c%2!=0:\r\n d.append(0)\r\n elif c//2<=s and c//2<=b:\r\n d.append(1)\r\n else:\r\n d.append(0)\r\nfor i in d:\r\n print(i)\r\n\r\n\r\n", "inp = input().split()\nn, m = int(inp[0]), int(inp[1])\nvet = input().split()\noccur = min(vet.count('-1'), n - vet.count('-1'))\nres = []\nwhile(m>0):\n line = input().split()\n first, second = int(line[0]), int(line[1])\n aux = (second - first) % 2\n aux2 = (second - first + 1) // 2\n\n if occur < aux2 or aux != 1: res.append('0')\n else: res.append('1')\n m-=1\n\nprint('\\n'.join(res))\n\n\t \t \t \t\t\t\t\t\t \t\t\t", "import sys\r\nfrom collections import Counter\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n n, m = map(int, inp[0].split())\r\n c = Counter(map(int, inp[1].split()))\r\n out = []\r\n for r in inp[2:]:\r\n s, e = map(int, r.split())\r\n t = e - s + 1\r\n if t%2: out.append(0)\r\n else: out.append(int(c[1] >= t//2 and c[-1] >= t//2))\r\n return out\r\n \r\nprint(*main(), sep='\\n')\r\n", "I=lambda:map(int,input().split())\r\n_,m=I()\r\ns=list(I())\r\nx=2*s.count(-1)\r\ny=2*s.count(1)\r\nb=[]\r\nfor _ in range(m):\r\n l,r=map(int,input().split())\r\n k=r-l+1\r\n b.append(1-(k%2 or x<k or y<k))\r\nprint(*b)\r\n", "nm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\nkol1=0\r\nkolm1=0\r\nv0and1=[]\r\na=input().split()\r\nfor i in range(n):\r\n if a[i]=='1':\r\n kol1+=1\r\n continue\r\n kolm1+=1\r\nfor i in range(m):\r\n b=input().split()\r\n b[0]=int(b[0])\r\n b[1]=int(b[1])\r\n if (b[1]-b[0]+1)%2==0 and (b[1]-b[0]+1)//2<=kol1 and (b[1]-b[0]+1)//2<=kolm1:\r\n v0and1.append(1)\r\n continue\r\n v0and1.append(0)\r\nfor i in range(m):\r\n print(v0and1[i]) ", "from collections import deque\r\n\r\nlines = [w.rstrip() for w in open(0).readlines()]\r\ndeq = deque(lines)\r\nn, m = map(int, deq.popleft().split())\r\nlst = list(map(int, deq.popleft().split()))\r\npl = lst.count(1)\r\nmi = n - pl\r\nres = []\r\nfor _ in range(m):\r\n a, b = map(int, deq.popleft().split())\r\n m = b-a+1\r\n r = [0, 1][m % 2 == 0 and min(pl, mi) >= m // 2]\r\n res.append(r)\r\nprint(\"\\n\".join(str(x) for x in res))", "n,m=map(int,input().split())\r\nsa=input().count(\"-\")\r\nsa=min([n-sa,sa])\r\nss=[]\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n b-=a\r\n ss.append((b%2 and b<=sa<<1) and \"1\\n\" or \"0\\n\")\r\nprint(\"\".join(ss))", "n, m = map(int, input().split())\r\nn_one = len(input().strip()) - (2 * n - 1)\r\nless = min(n_one, n - n_one) * 2\r\nres = [None] * m\r\n\r\nfor i in range(0, m):\r\n l, r = map(int, input().split())\r\n q = r - l + 1\r\n res[i] = '1' if q % 2 == 0 and q <= less else '0'\r\n\r\nprint('\\n'.join(res))\r\n", "n , m = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\npos = 0\r\nneg = 0\r\nfor x in a:\r\n if x>0: pos+=1\r\n elif x < 0: neg+=1\r\n\r\nsol =[]\r\nfor i in range(0,m):\r\n a , b = (int(x) for x in input().split())\r\n if (b-a)%2 != 0 and (b-a+1)//2 <= pos and (b-a+1)//2 <= neg:\r\n sol.append(1)\r\n else:\r\n sol.append(0)\r\n \r\nfor x in sol:\r\n print(x)", "n, m = map(int, input().split())\nc1 = sum(x > 0 for x in map(int, input().split()))\nc1 = min(c1, n - c1)\na = []\nfor _ in range(0, m):\n s, e = map(int, input().split())\n d = (e - s) + 1\n a += [[0, 1][d % 2 == 0 and c1 >= d // 2]]\nprint(*a)\n", "n,m=map(int,input().split())\r\ns=len(input().replace(\"1\",\"\").replace(\" \",\"\"))\r\ns=min([n-s,s])\r\nss=\"\"\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n a=(b-a+1)\r\n if a%2==0 and a<=s<<1 :\r\n ss+=\"1\\n\"\r\n else:\r\n ss+=\"0\\n\"\r\nprint(ss)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na_plus = a.count(1)\r\na_min = min(a_plus, n - a_plus)\r\nres = []\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n length = r - l + 1\r\n res += ['0'] if length % 2 or length // 2 > a_min else ['1']\r\nprint('\\n'.join(res))", "n,m=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nneg=list1.count(-1)\r\npos=n-neg\r\nans=\"\"\r\nx=min(neg,pos)\r\nfor i in range(m):\r\n\tl,r=map(int,input().split())\r\n\ty=r-l+1\r\n\tif y%2==0 and y<=x*2:\r\n\t\tans+='1\\n'\r\n\telse:\r\n\t\tans+='0\\n'\r\nprint(ans)", "n,m=map(int, input().split())\r\na=input().split()\r\nd=a.count(\"-1\")\r\nd=min(d, n-d)\r\ns=\"\"\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n if (r-l)% 2==1 and d>=(r-l+1)//2:\r\n s+=\"1\\n\"\r\n else:\r\n s+=\"0\\n\"\r\nprint(s)\r\n", "import sys\r\n \r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\t\r\ndef mints(): \r\n\treturn map(int, minp().split())\r\n \r\ndef solve():\r\n\tn, m = mints()\r\n\ta = list(mints())\r\n\tones = a.count(1)\r\n\tmones = n-ones\r\n\tfor i in range(m):\r\n\t\tl, r = mints()\r\n\t\tc = r-l+1\r\n\t\tif c % 2 == 1:\r\n\t\t\tprint(0)\r\n\t\telif c//2 <= ones and c//2 <= mones:\r\n\t\t\tprint(1)\r\n\t\telse:\r\n\t\t \tprint(0)\r\n \r\nsolve()", "x,z=map(int,input().split())\r\ny=list(map(int,input().split()))\r\na=y.count(1)\r\nans=\"\"\r\nfor i in range(z):\r\n n,m=map(int,input().split())\r\n if((m-n+1)%2==0 and a>=(m-n+1)//2 and x-a>=(m-n+1)//2):\r\n ans+=\"1\\n\"\r\n else:\r\n ans+=\"0\\n\"\r\nprint(ans)", "n,m = map(int,input().split())\r\nx=[int(w) for w in input().split()]\r\n\r\np=x.count(1)\r\nt=n-p\r\ns=\"\"\r\nfor j in range(m):\r\n l,r=map(int,input().split())\r\n e=r-l+1\r\n if e%2 or min(p,t)<e//2:\r\n s+='0\\n'\r\n else:\r\n s+='1\\n'\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\nsa = input().count(\"-\")\r\nsa = min([n - sa, sa])\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n b -= a\r\n if b % 2 and b <= sa << 1:\r\n print(1)\r\n else:\r\n print(0)\r\n", "# A. Eugeny and Array\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\npositives = a.count(1)\nnegatives = a.count(-1)\nmn = min(positives, negatives)\n\noutput = list()\nfor _ in range(m):\n l, r = map(int, input().split())\n if (r - l + 1) % 2 == 0 and (r - l + 1) / 2 <= mn:\n output.append('1')\n else:\n output.append('0')\n\nprint('\\n'.join(output))\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n\r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n\r\ndef solve():\r\n\tn,m=read_ints()\r\n\tcm,cp=0,0\r\n\tfor x in read_ints():\r\n\t\tif x>0:\r\n\t\t\tcp+=1\r\n\t\telse:\r\n\t\t\tcm+=1\r\n\tfor k in range(m):\r\n\t\tl,r=read_ints()\r\n\t\ts=r-l+1\r\n\t\tif s%2==0 and cp>=s//2 and cm>=s//2:\r\n\t\t\tprint(1)\r\n\t\telse:\r\n\t\t\tprint(0)\r\n\r\nsolve()\r\n", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,m = get_ints()\r\nar = get_list()\r\noup = [0]*m\r\ncount1,count2 = 0,0\r\nfor x in ar:\r\n if x==1:\r\n count1 += 1\r\ncount2 = n-count1\r\nfor i in range(m):\r\n l,r = get_ints()\r\n t = r-l+1\r\n if t%2==1 or (t%2==0 and (t/2>count1 or t/2>count2)):\r\n pass\r\n else:\r\n oup[i] = 1\r\nprint(*oup)", "n,m=map(int, input().split())\r\na=input().split()\r\nx=a.count(\"-1\")\r\nx=min(x, n-x)\r\ns=\"\"\r\nfor i in range(m):\r\n l, r=map(int, input().split())\r\n if (r-l)% 2==1 and x>=(r-l+1)//2:\r\n s+=\"1\\n\"\r\n else:\r\n s+=\"0\\n\"\r\nprint(s)", "n,m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nb = a.count(1)\r\nc = min(b,n-b)\r\ns = ''\r\nfor i in range(m):\r\n left,right = map(int, input().split())\r\n length = right - left + 1\r\n if length % 2 or length //2 > c:\r\n s += \"0\\n\"\r\n else:\r\n s += \"1\\n\"\r\nprint(s)\r\n", "a,q = map(int,input().split())\r\nx = [int(x) for x in input().split()]\r\nm = x.count(-1)\r\nre = min(m,a-m)\r\nans = ''\r\nfor i in range(q):\r\n l,r = map(int,input().split())\r\n t = (r-l)+1\r\n if (t%2==0)and(t//2<=re):\r\n ans+='1\\n'\r\n else:\r\n ans+='0\\n'\r\nprint(ans)\r\n\r\n", "n, m = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\narr = input().split(\" \")\r\n\r\nx = 0\r\ny = 0\r\n\r\nfor i in range(n):\r\n arr[i] = int(arr[i])\r\n if arr[i] == 1:\r\n x += 1\r\n else:\r\n y += 1\r\n\r\n\r\n\r\nqueries = []\r\nfor i in range(m):\r\n t1, t2 = input().split(\" \")\r\n queries.append([int(t1), int(t2)])\r\n\r\nfor query in queries:\r\n lenSegment = query[1] - query[0] + 1\r\n if lenSegment % 2 == 0 and x >= lenSegment / 2 and y >= lenSegment / 2:\r\n print(1) \r\n else:\r\n print(0)", "n, p = map(int, input().split())\r\nsumP = sumN = 0\r\nfor i in list(map(int, input().split())):\r\n if i == 1: sumP += 1\r\n else: sumN += 1\r\nres = []\r\nfor i in range(p):\r\n x, y = map(int, input().split())\r\n res.append('1' if min(sumP, sumN) >= (y - x + 1) // 2 and (y - x) % 2 == 1 else '0')\r\nprint('\\n'.join(res))\r\n", "from sys import stdin,stdout\r\nn,m=[int(x) for x in stdin.readline().split()]\r\narr=[int(x) for x in stdin.readline().split()]\r\npositive=arr.count(1)\r\nnegative=n-positive\r\nmi=min(positive,negative)\r\nans=\"\"\r\nfor i in range(m):\r\n a,b=[int(x) for x in stdin.readline().split()]\r\n if ((b-a)+1)%2==0 and mi>=(b-a+1)/2:\r\n print(1)\r\n else:\r\n print(0)", "n, m = map(int, input().split())\r\na = input().split().count('1')\r\na = min(a, n-a)\r\ns = \"\"\r\nfor _ in range(m):\r\n\tl, r = map(int, input().split())\r\n\tif (r-l)%2==1 and a>=(r-l+1)//2:\r\n\t\ts+=\"1\\n\"\r\n\telse:\r\n\t\ts+=\"0\\n\"\r\nprint(s)", "from sys import stdin\r\n\r\nn, m = map(int, stdin.readline().strip().split())\r\narr = list(map(int, stdin.readline().strip().split()))\r\na, b = arr.count(-1), arr.count(1)\r\n\r\nfor i in range(m):\r\n l, r = map(int, stdin.readline().strip().split())\r\n d = r - l + 1\r\n if d % 2 == 0:\r\n print(1 if min(a, b) >= d // 2 else 0)\r\n else:\r\n print(0)\r\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nmat=[]\r\nfor i in range(m):\r\n mat.append(list(map(int,input().split())))\r\nl1=arr.count(1)\r\nl2=arr.count(-1)\r\nfor i in mat:\r\n len=(i[1]-i[0])+1\r\n if len%2==0:\r\n if l1>=len//2 and l2>=len//2:\r\n print(1)\r\n else:\r\n print(0)\r\n else:\r\n print(0)" ]

[ "n = int(input())\np = [[] for i in range(n + 1)]\nfor j in range(n - 1):\n a, b = map(int, input().split())\n p[a].append(b)\n p[b].append(a)\ndef g(b, c):\n x = y = d = 0\n for a in p[b]:\n if a != c:\n s, z = g(a, b)\n z, y, x = sorted([x, y, z])\n d = max(d, s)\n return max(d, x + y), x + 1\nprint(max(g(a, b)[0] * g(b, a)[0] for a in range(n + 1) for b in p[a] if b > a))\n \t \t\t \t\t\t\t\t\t\t\t\t\t\t\t\t \t\t \t", "def put():\n return map(int, input().split())\n\ndef length(i,p, u,v):\n vis[i]=1\n max_i, max_here_i, sec_max_here_i = 0, 0, 0\n for j in tree[i]:\n if j!=p and (i,j) not in [(u,v), (v,u)]:\n max_j, max_here_j = length(j,i,u,v)\n if max_here_j >= max_here_i:\n sec_max_here_i = max_here_i\n max_here_i = max_here_j\n elif max_here_j > sec_max_here_i:\n sec_max_here_i = max_here_j\n max_i = max(max_i, max_j)\n max_i = max(max_i, max_here_i+sec_max_here_i+1)\n return max_i, max_here_i+1\n\n\nn = int(input())\ntree = [[] for _ in range(n)]\nvis = [0]*n\nedge = []\nfor _ in range(n-1):\n x,y = put()\n x,y = x-1,y-1\n edge.append((x,y))\n tree[x].append(y)\n tree[y].append(x)\nans = 0\nfor u,v in edge:\n l1,_ = length(u,-1,u,v)\n l2,_ = length(v,-1,u,v)\n ans = max((l1-1)*(l2-1), ans)\nprint(ans)\n", "from queue import Queue\n\nans=0\n\ndef farthest(u,p):\n dist = [1<<30] * n\n q = Queue()\n q.put(u)\n dist[u] = 0\n while(q.empty() is False):\n v = q.get()\n for vv in list[v]:\n if vv != p and dist[vv] > dist[v] + 1:\n dist[vv] = dist[v] + 1\n q.put(vv)\n retv = u\n retd = 0\n for i in range(n):\n if dist[i] != 1<<30 and dist[i] > retd:\n retd = dist[i]\n retv = i\n return retv, retd;\n\n\ndef findDia(u,v):\n return farthest(farthest(u,v)[0],v)[1]\n\n\ndef dfs(u,p):\n global ans\n for v in list[u]:\n if v != p:\n ans = max(ans, findDia(u,v) * findDia(v,u))\n dfs(v, u)\n\nn = int(input())\nlist = [[] for i in range(n)]\nfor i in range(n-1):\n u, v = map(int, input().split())\n u = u-1\n v = v-1\n list[u].append(v)\n list[v].append(u)\n\ndfs(0, -1)\nprint(ans)\n", "def dfs(node, depth):\r\n max_depth = 0\r\n farthest_node = node\r\n visit[node] = True\r\n for neighbor in AdjList[node]:\r\n if node == erase_1 and neighbor == erase_2:\r\n continue\r\n if node == erase_2 and neighbor == erase_1:\r\n continue\r\n if not visit[neighbor]:\r\n temp1, temp2 = dfs(neighbor, depth + 1)\r\n if temp2 > max_depth:\r\n max_depth = temp2\r\n farthest_node = temp1\r\n return farthest_node, max(max_depth, depth)\r\n\r\n\r\ndef find_tree_diameter(node):\r\n for index in range(1, n + 1):\r\n visit[index] = False\r\n farthest_node, temp = dfs(node, 0)\r\n for index in range(1, n + 1):\r\n visit[index] = False\r\n farthest_node, diameter = dfs(farthest_node, 0)\r\n return diameter\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n EdgeList = []\r\n AdjList = {}\r\n visit = [False]\r\n erase_1 = 0\r\n erase_2 = 0\r\n for i in range(1, n + 1):\r\n AdjList[i] = []\r\n visit.append(False)\r\n for i in range(1, n):\r\n s = input().split(' ')\r\n a = int(s[0])\r\n b = int(s[1])\r\n EdgeList.append(a)\r\n EdgeList.append(b)\r\n AdjList[a].append(b)\r\n AdjList[b].append(a)\r\n i = 0\r\n ans = 0\r\n while i < len(EdgeList):\r\n erase_1 = EdgeList[i]\r\n erase_2 = EdgeList[i + 1]\r\n temp1 = find_tree_diameter(erase_1)\r\n temp2 = find_tree_diameter(erase_2)\r\n ans = max(temp1 * temp2, ans)\r\n i += 2\r\n print(ans)\r\n\r\n", "def BFSMax(s):\r\n dist = [100000] * 205\r\n dist[s] = 0\r\n q = [s]\r\n while q:\r\n t = q.pop()\r\n for i in g2[t]:\r\n if dist[i] == 100000:\r\n dist[i] = dist[t] + 1\r\n q = [i] + q\r\n \r\n m = -1\r\n for i in dist:\r\n if i != 100000:\r\n m = max(m, i)\r\n return m\r\n \r\ndef BFSCompConex(s):\r\n vertex = []\r\n dist = [100000] * 205\r\n dist[s] = 0\r\n q = [s]\r\n while q:\r\n t = q.pop()\r\n vertex.append(t)\r\n for i in g2[t]:\r\n if dist[i] == 100000:\r\n dist[i] = dist[t] + 1\r\n q = [i] + q\r\n \r\n return vertex\r\n \r\nfrom copy import deepcopy\r\n# En esta lista vamos a guardar las conexiones entre\r\n# las ciudades, es decir, las aristas del grafo\r\ne = [] \r\n# Esta va a ser la lista de adyacencia de nuestro \r\n# grafo\r\ng = [[] for _ in range(205)]\r\n# Aqui guardamod la cantidad de ciudades, es decir,\r\n# la cantidad de vertices \r\nx = int(input())\r\nfor i in range(x-1):\r\n a, b = map(int, input().split())\r\n # Annadimos los valores a nuestra lista de \r\n # adyacencia\r\n g[a].append(b)\r\n g[b].append(a)\r\n # Annadimos las aristas a nuestra lista\r\n e.append([a,b])\r\n \r\n# En ans guardamos la respuesta\r\nanswer = 0\r\nfor i in e:\r\n #Creamos una copia de nuestra lista de adyacencia \r\n g2 = deepcopy(g)\r\n # En cada iteracion removemos una arista, o sea, \r\n # la eliminamos de la copia que hicimos de la \r\n # lista de adyacencia\r\n g2[i[0]].remove(i[1])\r\n g2[i[1]].remove(i[0])\r\n # Buscamos todas las ciudades que tenemos en una\r\n # componente conexa\r\n a1 = BFSCompConex(i[0])\r\n # Buscamos todas las ciudades que tenemos en la \r\n # otra componente conexa\r\n a2 = BFSCompConex(i[1])\r\n \r\n m1 = 0\r\n m2 = 0\r\n # Hallamos el diametro de la primera componente \r\n # conexa\r\n for e in a1:\r\n m1 = max(m1, BFSMax(e))\r\n \r\n # Hallamos el diametro de la segunda componente\r\n # conexa\r\n for e in a2:\r\n m2 = max(m2, BFSMax(e))\r\n \r\n # Actualizamos nuestro beneficio\r\n answer = max(answer, m1*m2)\r\n\r\n # Pintamos la respuesta\r\nprint(answer)", "# LUOGU_RID: 110991300\nfrom sys import stdin \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\ndef dfs(u, fa) : \n global tot \n\n f[u] = t = 0 \n for v in Map[u].keys() : \n if v == fa : continue \n dfs(v, u) \n tot = max(tot, f[u] + f[v] + 1) \n f[u] = max(f[u], f[v] + 1)\n\nn = int(input())\nMap = [dict() for i in range(n + 1)] \nedge = []\ntot = ans = 0 \n\nfor i in range(n - 1) : \n u,v = get() \n Map[u][v] = Map[v][u] = 1\n edge.append((u,v)) \n\nfor i in range(n - 1) : \n num = 0 \n f = [0] * (n + 1) \n dfs(edge[i][0], edge[i][1]) \n num = tot ; tot = 0 \n f = [0] * (n + 1)\n dfs(edge[i][1], edge[i][0]) \n ans = max(ans, num * tot) \n tot = 0 \n\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\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\nvec = []\r\nadj = [set() for i in r(n)]\r\nfor i in r(n-1):\r\n a, b = map(lambda x: x-1, II())\r\n adj[a].add(b)\r\n adj[b].add(a)\r\n vec.append((a,b))\r\ndef dfs(i):\r\n q = deque([i])\r\n dis = [-1]*n\r\n dis[i] = 0\r\n while q:\r\n t = q.pop()\r\n for x in adj[t]:\r\n if dis[x] == -1:\r\n dis[x] = dis[t] + 1\r\n q.append(x)\r\n return dis.index(max(dis)), max(dis)\r\ndef diameter(i):\r\n index = dfs(i)[0]\r\n return dfs(index)[1]\r\nres = -INF()\r\nfor a, b in vec:\r\n adj[a].remove(b)\r\n adj[b].remove(a)\r\n res = max(res,diameter(a)*diameter(b))\r\n adj[a].add(b)\r\n adj[b].add(a)\r\np(res)", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n\r\n def get_diameter(u):\r\n depth, v = dfs(u, set())\r\n return dfs(v, set())[0]\r\n\r\n def dfs(u, visited):\r\n visited.add(u)\r\n max_depth, deepest_node = -1, u\r\n for v in adj_list[u]:\r\n if v not in visited:\r\n depth, w = dfs(v, visited)\r\n if depth > max_depth:\r\n max_depth, deepest_node = depth, w\r\n return max_depth + 1, deepest_node\r\n\r\n n = int(input())\r\n roads = []\r\n adj_list = [set() for _i in range(n+1)]\r\n for _i in range(n-1):\r\n u, v = map(int, input().split())\r\n roads.append((u, v))\r\n adj_list[u].add(v)\r\n adj_list[v].add(u)\r\n\r\n ans = 0\r\n for u, v in roads:\r\n adj_list[u].remove(v)\r\n adj_list[v].remove(u)\r\n ans = max(ans, get_diameter(u) * get_diameter(v))\r\n adj_list[u].add(v)\r\n adj_list[v].add(u)\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "def dfs(v):\n for u in graph[v]:\n if dist[u] == -1:\n dist[u] = dist[v] + 1\n dfs(u)\n\n\nn = int(input())\ngraph = [[] for i in range(n)]\nedges = []\nfor i in range(n - 1):\n u, v = map(int, input().split())\n edges.append((u - 1, v - 1))\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n\nans = 0\nfor e in edges:\n graph[e[0]].remove(e[1])\n graph[e[1]].remove(e[0])\n\n dist = [-1] * n\n dist[e[0]] = 0\n dfs(e[0])\n far = e[0]\n for v in range(n):\n if dist[far] < dist[v]:\n far = v\n dist = [-1] * n\n dist[far] = 0\n dfs(far)\n prod = max(dist)\n \n dist = [-1] * n\n dist[e[1]] = 0\n dfs(e[1])\n far = e[1]\n for v in range(n):\n if dist[far] < dist[v]:\n far = v\n dist = [-1] * n\n dist[far] = 0\n dfs(far)\n prod = prod * max(dist)\n \n ans = max(ans, prod)\n \n graph[e[0]].append(e[1])\n graph[e[1]].append(e[0])\nprint(ans)", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(s, x):\r\n q = deque()\r\n q.append(s)\r\n visit[s] = 1\r\n while q:\r\n i = q.popleft()\r\n for j, c in G[i]:\r\n if x ^ c and not visit[j]:\r\n visit[j] = 1\r\n q.append(j)\r\n q.append(i)\r\n dist[i] = 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 x ^ c and not dist[j] ^ -1:\r\n dist[j] = di + 1\r\n q.append(j)\r\n return di\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n G[a].append((b, i))\r\n G[b].append((a, i))\r\nans = 0\r\nfor i in range(n - 1):\r\n visit = [0] * (n + 1)\r\n dist = [-1] * (n + 1)\r\n m1 = bfs(1, i)\r\n for j in range(2, n + 1):\r\n if not visit[j]:\r\n m2 = bfs(j, i)\r\n break\r\n ans = max(ans, m1 * m2)\r\nprint(ans)", "from collections import *\n\nn = int(input())\nct = 0\ng = defaultdict(set)\nedges = []\nwhile ct < n:\n try:\n u,v = map(int, input().split())\n edges.append([u,v])\n g[u].add(v)\n g[v].add(u)\n ct += 1\n except:\n break\n\n\ndef cut(u,v):\n g[u].remove(v)\n g[v].remove(u)\n ans = 0\n def dfs(pre, node):\n nonlocal ans\n # return the maximum number of nodes of all path start from node\n v1,v2 = 0, 0\n color[node] = 1\n for nei in g[node]:\n if nei == pre: continue\n res = dfs(node, nei)\n if res > v1:\n v2 = v1\n v1 = res\n \n elif res > v2:\n v2 = res\n cur = v1 + v2\n ans = cur if cur > ans else ans\n return 1 + v1\n\n\n\n ds = []\n color = [0] * (n + 1)\n \n for node in range(1, n + 1):\n if color[node] == 0:\n dfs(-1, node)\n ds.append(ans)\n ans = 0\n g[v].add(u)\n g[u].add(v)\n return ds[0] * ds[1]\nres = 0\nfor u,v in edges:\n ans = cut(u,v)\n if ans > res: res = ans\nprint(res)\n \n \n\n\n \n\n", "import sys\nfrom functools import cache\n\n\ndef readnums()->list:\n return list(map(int, sys.stdin.readline().split()))\n\nN = readnums()[0]\nedges = []\ntree = [[] for _ in range(N)]\n\n@cache\ndef dfs(parent: int, node: int) -> tuple:\n # if tree[node] == [parent]: # leave node\n # return 0, 0\n from_leaves = 0\n from_node = [0]\n for child in tree[node]:\n if child == parent:\n continue\n a, b = dfs(node, child)\n from_leaves = max(b, from_leaves)\n from_node.append(a + 1)\n from_node.sort()\n if len(from_node) > 1:\n from_leaves = max(from_leaves, from_node[-1] + from_node[-2])\n # print(f\"p = {parent}, node = {node}, result = ({from_node[-1]}, {from_leaves})\")\n return from_node[-1], from_leaves\n\nfor _ in range(N - 1):\n a, b = readnums()\n a, b = a - 1, b - 1\n edges.append((a, b))\n tree[a].append(b)\n tree[b].append(a)\n\nresult = 0\nfor a, b in edges:\n result = max(result, max(dfs(a, b)) * max(dfs(b, a)))\nprint(result)", "def split(st):\r\n x = st.strip().split(' ')\r\n return int(x[0]), int(x[1])\r\n\r\n\r\ndef dfs(at, visited):\r\n for i in range(len(A[at])):\r\n if visited[A[at][i]] == 0:\r\n visited[A[at][i]] = 1\r\n dfs(A[at][i], visited)\r\n\r\n \r\ndef dfs_with_depth(at, visited, d):\r\n for i in range(len(A[at])):\r\n if visited[A[at][i]] == 0:\r\n visited[A[at][i]] = 1\r\n d[A[at][i]] = d[at] + 1\r\n dfs_with_depth(A[at][i], visited, d)\r\n\r\n\r\ndef find_max_path(mask):\r\n # print(mask)\r\n max_d = 0\r\n u = -1\r\n for i in range(1, N+1):\r\n if (mask[i] == 0) and (len(A[i]) == 1):\r\n u = i\r\n break\r\n\r\n if u == -1:\r\n return max_d\r\n\r\n d = [0 for i in range(N+1)]\r\n visited = [0 for i in range(N+1)]\r\n for i in range(N+1):\r\n visited[i] = mask[i]\r\n\r\n visited[u] = 1\r\n \r\n dfs_with_depth(u, visited, d)\r\n for i in range(N+1):\r\n if d[i] > max_d:\r\n max_d = d[i]\r\n u = i\r\n\r\n if max_d == 0:\r\n return max_d\r\n\r\n d = [0 for i in range(N+1)]\r\n visited = [0 for i in range(N+1)]\r\n for i in range(N+1):\r\n visited[i] = mask[i]\r\n\r\n visited[u] = 1\r\n dfs_with_depth(u, visited, d)\r\n # print(u, d)\r\n for i in range(N+1):\r\n if d[i] > max_d:\r\n max_d = d[i]\r\n u = i\r\n\r\n return max_d\r\n\r\nif __name__==\"__main__\":\r\n global A\r\n global N\r\n\r\n N = int(input())\r\n A = [[] for _ in range(N+1)]\r\n\r\n all_edges = []\r\n\r\n for _ in range(N-1):\r\n u, v = split(input())\r\n A[u] += [v]\r\n A[v] += [u]\r\n\r\n all_edges += [(u, v)]\r\n\r\n ans = 0\r\n for t in range(len(all_edges)):\r\n u = all_edges[t][0]\r\n v = all_edges[t][1]\r\n # print(u, v)\r\n\r\n visited1 = [0 for i in range(N+1)]\r\n visited1[u] = 1\r\n visited1[v] = 1\r\n dfs(u, visited1)\r\n\r\n visited1[v] = 0\r\n d1 = find_max_path([1 - a for a in visited1])\r\n d2 = find_max_path(visited1)\r\n\r\n ans = max(ans, d1*d2)\r\n\r\n print(ans)\r\n\r\n\r\n", "n = int(input())\r\ne = [[*map(int,input().split())] for _ in range(n-1)]\r\nedge = [set() for _ in range(n+1)]\r\nfor u,v in e:\r\n edge[u].add(v)\r\n edge[v].add(u)\r\n\r\ndef dfs(u,r):\r\n res = [u,0]\r\n for v in edge[u]:\r\n if v!=r:\r\n w,d = dfs(v,u)\r\n if d+1>res[1]: res = [w,d+1]\r\n return res\r\n\r\nres = 0\r\nfor u,v in e:\r\n edge[u].remove(v)\r\n edge[v].remove(u)\r\n uu,_ = dfs(u,0)\r\n vv,_ = dfs(v,0)\r\n res = max(res,dfs(uu,0)[1]*dfs(vv,0)[1])\r\n edge[u].add(v)\r\n edge[v].add(u)\r\nprint(res)", "from collections import defaultdict\n\nadjV = defaultdict(list)\n\ndef DFS(u, t, visited, depth):\n max_d = depth\n farest_leaf = u\n visited.add(u)\n for v in adjV[u]:\n if v == t:\n continue\n elif v not in visited:\n visited.add(v)\n d, f = DFS(v, t, visited, depth + 1)\n if max_d < d:\n max_d = d\n farest_leaf = f\n return max_d, farest_leaf\n\ndef find_max(u,t):\n visited = set()\n max_d,farest_leaf = DFS(u,t,visited,0)\n visited = set()\n max_d,farest_leaf = DFS(farest_leaf,t,visited,0)\n return max_d\n\nif __name__ == \"__main__\":\n n = int(input())\n for i in range(n-1):\n inp = input().split(' ')\n u = int(inp[0])\n v = int(inp[1])\n adjV[u].append(v)\n adjV[v].append(u)\n \n ans = 0\n for u in range(1, n + 1):\n for v in adjV[u]:\n group_1 = find_max(u,v)\n group_2 = find_max(v,u)\n ans = max(ans, group_1 * group_2)\n \n print(ans)", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nadj = [[] for _ in range(n)]\r\nedges = [[0, 0] for _ in range(n - 1)]\r\nfor i, (u, v) in enumerate(map(int, input().split()) for _ in range(n - 1)):\r\n adj[u - 1].append(v - 1)\r\n adj[v - 1].append(u - 1)\r\n edges[i] = u - 1, v - 1\r\n\r\n\r\ndef get_dia(adj, start):\r\n from collections import deque\r\n n = len(adj)\r\n dq = deque([(start, -1)])\r\n\r\n while dq:\r\n end1, par = dq.popleft()\r\n for dest in adj[end1]:\r\n if dest != par:\r\n dq.append((dest, end1))\r\n\r\n prev = [-1] * n\r\n prev[end1] = -2\r\n dq = deque([(end1, 0)])\r\n\r\n while dq:\r\n end2, diameter = dq.popleft()\r\n for dest in adj[end2]:\r\n if prev[dest] == -1:\r\n prev[dest] = end2\r\n dq.append((dest, diameter + 1))\r\n\r\n return end1, end2, diameter, prev\r\n\r\n\r\nans = 0\r\nfor u, v in edges:\r\n adj[u].remove(v)\r\n adj[v].remove(u)\r\n dia1 = get_dia(adj, u)[2]\r\n dia2 = get_dia(adj, v)[2]\r\n ans = max(ans, dia1 * dia2)\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\nprint(ans)\r\n" ]

[ "s=input()\nt=s[0]+s[1:].replace('at','@',1)\ns=t[0]+t[1:-1].replace('dot','.')+t[-1]\nprint(s)\n\n\t\t \t \t\t\t \t \t\t \t \t\t \t", "str=input().strip()\nstr=str[0]+str[1:].replace(\"at\",\"@\",1)\nstr=str[0]+str[1:-1].replace(\"dot\",\".\")+str[-1]\nprint(str)\n \t \t \t\t\t\t \t \t\t \t \t\t \t \t", "def is_dot(s, i):\r\n if i != 0 and i + 3 < len(s) and s[i] == 'd' and s[i + 1] == 'o' and s[i + 2] == 't':\r\n return True\r\n return False\r\n\r\n\r\ndef is_at(t, j):\r\n if j != 0 and j + 2 < len(t) and t[j] == 'a' and t[j + 1] == 't':\r\n return True\r\n return False\r\n\r\n\r\ndef email(s):\r\n m = ''\r\n i = 0\r\n flag = 0\r\n while i < len(s):\r\n if is_dot(s, i):\r\n m += \".\"\r\n i += 3\r\n else:\r\n if is_at(s, i) and flag == 0:\r\n m += \"@\"\r\n flag = 1\r\n i += 2\r\n else:\r\n m += s[i]\r\n i += 1\r\n return m\r\n\r\n\r\nprint(email(input()))\r\n", "s=input()\nif len(s)>2:\n if s[:3]=='dot':\n s='['+s[3:]\n if s[-3:]=='dot':\n s=s[:-3]+'['\nif len(s)>1:\n if s[:2]=='at':\n s='&'+s[2:]\n if s[-2:]=='at':\n s=s[:-2]+'&'\ns=s.replace('dot','.')\nk=s.find('at')\ns=s[:k]+'@'+s[k+2:]\ns=s.replace('&','at').replace('[','dot')\nprint(s)", "a =input()\r\nprint(a[0] + a[1:-1].replace('dot', '.').replace('at','@', 1)+ a[-1])", "inp = input()\ndef transGmail(inp):\n dotIndx = inp.find(\"dot\",1,len(inp)-1)\n while dotIndx != -1:\n inp = inp[0:dotIndx]+'.'+inp[dotIndx+3:]\n dotIndx = inp.find(\"dot\",1,len(inp)-1)\n if dotIndx == -1:\n break\n atIndx = inp.find(\"at\",1,len(inp)-1)\n inp = inp[0:atIndx]+'@'+inp[atIndx+2:]\n print(inp)\ntransGmail(inp)\n\t \t\t \t\t \t\t \t\t \t \t \t\t\t\t \t \t", "def main():\n desc = input()\n chunk = desc[1:-1]\n chunk = chunk.replace(\"at\", \"@\", 1)\n chunk = chunk.replace(\"dot\", \".\")\n print(desc[0] + chunk + desc[-1])\nmain()\n \t\t \t \t \t \t \t\t\t \t \t\t \t\t \t\t", "s= input() \r\n\r\ns = s.replace(\"at\" , '@')\r\ns = s.replace(\"dot\" , \".\")\r\nif s[0] == \".\" : \r\n s = \"dot\" + s[1: ]\r\nelif s[0] == \"@\" : \r\n s = \"at\" + s[1 : ]\r\nif s[-1] == \".\" : \r\n s = s[:-1] + \"dot\" \r\nelif s[-1] == \"@\" : \r\n s = s[ : -1] + \"at\"\r\nat = 1 \r\nfor i in range(0 , len(s) ) : \r\n if s[i] == \"@\" : \r\n at = i \r\n break \r\nx = s[at + 1 : ].replace(\"@\" , \"at\") \r\ns = s[ : at + 1 ] + x \r\nprint(s)", "import re\r\ns = input()\r\ns = s[0] + re.sub('dot', '.', s[1:-1]) + s[-1]\r\ns = s[0] + re.sub('at', '@', s[1:-1], count=1) + s[-1]\r\nprint(s)", "import sys\r\n\r\ntry:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\ninput = sys.stdin.readline\r\n\r\nt = 1\r\n# t = int(input())\r\n\r\nwhile t:\r\n t -= 1\r\n\r\n s = input().strip()\r\n a = s[1:-1].replace(\"dot\", \".\")\r\n a = a.replace(\"at\", \"@\", 1)\r\n print(s[0]+a+s[-1])\r\n\r\n", "s=str(input())\r\nl=[s[0]]\r\ni=1\r\nflag=True\r\nwhile i<len(s)-2:\r\n if s[i:i+3]==\"dot\":\r\n l.append('.')\r\n i+=3\r\n elif s[i:i+2]==\"at\" and flag:\r\n l.append('@')\r\n flag=False\r\n i+=2\r\n else:\r\n l.append(s[i])\r\n i+=1\r\nif s[-3:]==\"dot\":\r\n l=l[:-1]+['d','o','t']\r\nelif s[-4:-1]==\"dot\":\r\n l+=[s[-1]]\r\nelif s[-3:-1]=='at' and s.count('at')==1:\r\n l+=[s[-1]]\r\nelif l[-1]=='@':\r\n l+=[s[-2],s[-1]]\r\nelse:\r\n l+=[s[-2],s[-1]]\r\n\r\nprint(''.join(l))\r\n ", "a=(input())\r\nb=a[1:-1]\r\nb=b.replace('at','@')\r\nl=''\r\nfor i in range(len(a)):\r\n if b[i]=='@':\r\n l+='@'\r\n x=b[i+1:].replace('@','at')\r\n l+=x\r\n break\r\n else:\r\n l+=b[i]\r\nl=l.replace('dot','.')\r\nx=a[0]+l+a[-1]\r\nprint(x)", "a = input()\r\na = a[0]+a[1:-1].replace(\"dot\", \".\")+a[-1]\r\na = a[0]+a[1:-1].replace(\"at\", \"@\", 1)+a[-1]\r\nprint(a)", "a = input()\r\nif a.find(\"at\") == 0:\r\n a = a.replace(\"at\", \"@\", 2)\r\nelse:\r\n a = a.replace(\"at\", \"@\", 1)\r\na = a.replace(\"dot\", \".\")\r\nif a[0] == \"@\":\r\n a = \"at\" + a[1:]\r\nif a[0] == \".\":\r\n a = \"dot\" + a[1:]\r\nif a[-1] == \"@\":\r\n a = a[:-1] + \"at\"\r\nif a[-1] == \".\":\r\n a = a[:-1] + \"dot\"\r\nprint(a)", "a=input()\r\nb=a[1:len(a)-1].replace('dot','.')\r\nb=a[0]+b\r\nif len(a)!=1:b+=a[-1]\r\nk=b[1:len(b)-1].replace('at','@',1)\r\nk=b[0]+k\r\nif len(b)!=1:k+=b[-1]\r\nprint(k)", "a = input()\r\nans = \"\"\r\ni = 0\r\nn = len(a)\r\ncnt = 0\r\nwhile i < n:\r\n if not i + 3 >= n and a[i:i+3] == \"dot\" and i != 0:\r\n ans += \".\"\r\n i += 3\r\n elif cnt == 0 and i != 0 and a[i:i+2] == \"at\":\r\n cnt = 1\r\n ans += \"@\"\r\n i += 2\r\n else:\r\n ans += a[i]\r\n i += 1\r\nprint(ans)", "d='dot'\r\nR=str.replace\r\ns=R(input(),d,'.')\r\ns=s[0]+R(s[1:],'at','@',1)\r\nif s[0]=='.':s=d+s[1:]\r\nif s[-1]=='.':s=s[:-1]+d\r\nprint(s)", "s=input()\r\ns1=s[0]\r\nn=len(s)\r\ni=1\r\nf=0\r\nwhile i<n:\r\n if i<n-3 and s[i:i+3]==\"dot\":\r\n s1=s1+\".\"\r\n i+=3\r\n elif s[i:i+2]==\"at\" and f==0:\r\n s1=s1+\"@\"\r\n i+=2\r\n f=1\r\n else:\r\n s1=s1+s[i]\r\n i+=1\r\nprint(s1)", "s = input()\r\nx = s[1:len(s)-1]\r\nf ,l = s[0] , s[len(s)-1]\r\n# print(x)\r\nx = (x.replace('dot','.'))\r\n\r\ni = x.find('at')\r\nx = x.replace('at','@',1)\r\n# print(x)\r\nprint(f,x,l,sep=\"\")\r\n# dotdot", "from sys import stdin\r\ninput=stdin.readline\r\nvoiceEmail = input()\r\ndotReplaced = voiceEmail[1:len(voiceEmail) - 2].replace('dot', '.')\r\nvoiceEmail = voiceEmail[0] + dotReplaced + voiceEmail[len(voiceEmail) - 2:]\r\natReplaced = voiceEmail[1:len(voiceEmail) - 2].replace('at', '@', 1)\r\nvoiceEmail = voiceEmail[0] + atReplaced + voiceEmail[len(voiceEmail) - 2:]\r\nprint(voiceEmail)", "s = input()\r\ns = s.replace(\"at\", \"@\", 1).replace(\"dot\", \".\")\r\nif s[0] == '.':\r\n s = 'dot' + s[1:]\r\nif s[len(s) -1 ] == '.':\r\n s = s[:-1]+ 'dot'\r\n\r\nif s[0] == '@':\r\n s = s.replace(\"at\", \"@\", 1)\r\n s = 'at' + s[1:]\r\n\r\nprint(s)", "# cook your dish here\r\nl=list(input())\r\ns=''\r\ns+=l[0]\r\ni=1\r\nd=0\r\nwhile(i<len(l)-1):\r\n if(i+2<len(l)-1 and l[i]=='d' and l[i+1]=='o' and l[i+2]=='t'):\r\n s+='.'\r\n i+=3\r\n elif(i+1<len(l)-1 and d==0 and l[i]=='a' and l[i+1]=='t'):\r\n s+='@'\r\n i+=2\r\n d=1\r\n else:\r\n s+=l[i]\r\n i+=1\r\ns+=l[-1]\r\nprint(s)\r\n \r\n", "s = input()\ns = s[0] + s[1:].replace('at', '@', 1)\nprint(s[0] + s[1:-1].replace('dot', '.') + s[-1])\n", "m = input()\r\nm = m.replace(\"at\",\"@\")\r\nm = m.replace(\"dot\",\".\")\r\nif m[0] == \".\":\r\n m = \"dot\" + m[1:]\r\nif m[-1] == \".\":\r\n m = m[:-1] + \"dot\"\r\nif m[0] == \"@\":\r\n m = \"at\" + m[1:]\r\nif m.count(\"@\") > 1:\r\n n = m.find(\"@\")\r\n m = m[:n+1] + m[n+1:].replace(\"@\",\"at\")\r\n \r\n \r\nprint(m)", "s = input()\r\ns = s[0] + s[1:len(s) - 1].replace('at', '@', 1) + s[-1]\r\ns = s[0] + s[1:len(s) - 1].replace('dot', '.') + s[-1]\r\nprint(s)", "a=input()\r\na=a[0]+a[1:].replace('at','@',1)\r\nprint(a[0]+a[1:-1].replace('dot','.')+a[-1])", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = deque(list(input().rstrip()))\r\nans = []\r\nf = 0\r\nans.append(s.popleft())\r\nwhile s:\r\n if len(s) >= 2 and s[0] + s[1] == \"at\" and not f:\r\n f = 1\r\n ans.append(\"@\")\r\n for _ in range(2):\r\n s.popleft()\r\n elif len(s) >= 3 and s[0] + s[1] + s[2] == \"dot\":\r\n ans.append(\".\")\r\n for _ in range(3):\r\n s.popleft()\r\n else:\r\n ans.append(s.popleft())\r\nif ans[-1] == \".\":\r\n ans.pop()\r\n ans.append(\"dot\")\r\nsys.stdout.write(\"\".join(ans))", "# Code by : Sam._.072\r\n\r\ns = input()\r\ni, n, z = 0, len(s), 0\r\nwhile i < n:\r\n if (i == 0 and s[:4] == 'dot') or (i == n-3 and s[i:i+3] == 'dot'):\r\n print('dot',end=\"\")\r\n i += 3\r\n elif i == 0 and s[:3] == 'at':\r\n print('at',end=\"\")\r\n i = 2\r\n elif i != 0 and s[i:i+3] == 'dot':\r\n print('.',end=\"\")\r\n i += 3\r\n elif i != 0 and z == 0 and s[i:i+2] == 'at':\r\n print('@',end=\"\")\r\n i += 2\r\n z = -1\r\n else:\r\n print(s[i],end=\"\")\r\n i += 1\r\n", "l=list(input())\r\nj=1\r\ne=0\r\nwhile(j<len(l)-2):\r\n if(l[j]=='d' and l[j+1]=='o' and l[j+2]=='t' and j<len(l)-3):\r\n l[j]='.'\r\n l[j+1]='0'\r\n l[j+2]='0'\r\n j+=3\r\n elif(l[j]=='a' and l[j+1]=='t' and e==0):\r\n l[j]='@'\r\n l[j+1]='0'\r\n j+=2\r\n e+=1\r\n else:\r\n j+=1\r\nfor i in range(len(l)):\r\n if(l[i]!='0'):\r\n print(l[i],end=\"\")\r\n \r\n ", "n=input()\n\nn=n.replace('dot','.')\nif n[0]=='.':\n n='dot'+n[1:]\nif n[-1]=='.':\n n=n[0:-1]+'dot'\nn=n.replace('at','@',1)\nif n[0]=='@':\n n='at'+n[1:].replace('at','@',1)\n\nprint(n)", "s = input()\r\ns = (s[0] + s[1:-1].replace(\"dot\", \".\")+s[-1])\r\nk = s.find('at', 1)\r\nprint(s[:k] + '@' + s[k + 2:])", "line = input()\r\n\r\nmetAt = False\r\ni = 1\r\n\r\nwhile i < len(line) - 3:\r\n if not metAt and line[i:i + 2] == 'at':\r\n line = line[:i] + '@' + line[i + 2:]\r\n metAt = True\r\n elif line[i:i + 3] == 'dot':\r\n line = line[:i] + '.' + line[i + 3:]\r\n\r\n i += 1\r\n\r\nif not metAt and line[-3:-1] == 'at':\r\n line = line[:-3] + '@' + line[-1]\r\n\r\nprint(line)\r\n\r\n''' 012345\r\nline = 'abcdot'\r\n\r\n\r\n'''", "a=input()\nprint(a[0]+a[1:len(a)-1].replace(\"at\", \"@\",1).replace(\"dot\",\".\")+a[len(a)-1])\n \t\t\t\t \t\t \t \t\t \t\t\t \t \t\t \t", "from collections import deque, Counter, OrderedDict\r\nfrom heapq import nsmallest, nlargest\r\n\r\ndef binNumber(n,size):\r\n return bin(n)[2:].zfill(size)\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\ndef iar():\r\n return list(map(int,input().split()))\r\n\r\ndef ini():\r\n return int(input())\r\n\r\ndef isp():\r\n return map(int,input().split())\r\n\r\ndef sti():\r\n return str(input())\r\n\r\n\r\n# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\nif __name__ == \"__main__\":\r\n s = sti()\r\n m = s[0]\r\n i = 1\r\n at = 0\r\n while i < len(s):\r\n if i+3 < len(s) and s[i:i+3] == \"dot\":\r\n m += \".\"\r\n i += 3\r\n elif i+2 < len(s) and s[i:i+2] == \"at\" and at == 0:\r\n m += \"@\"\r\n i += 2\r\n at = 1\r\n else:\r\n m += s[i]\r\n i += 1\r\n print(m)\r\n\r\n\r\n \r\n", "s = input()\r\nd = \"\"\r\ne = \"\"\r\ncount = 0\r\nflag = 0\r\nfor i in range(0, len(s)):\r\n d += s[i]\r\n if flag == 0:\r\n if \"at\" in d:\r\n if i > 1:\r\n flag = 1\r\n for j in range(count, i-1):\r\n e += s[j]\r\n e +=\"@\"\r\n else:\r\n e += d\r\n count = i+1\r\n d = \"\"\r\n if \"dot\" in d:\r\n if i > 2 and i != len(s)-1:\r\n for j in range(count, i-2):\r\n e += s[j]\r\n e +=\".\"\r\n else:\r\n e += d\r\n count = i+1\r\n d = \"\"\r\nif len(d) > 0:\r\n e += d\r\nprint(e)", "s = list(input())\r\nn = len(s)\r\n\r\nif n <= 2:\r\n print(*s, sep=\"\")\r\n quit()\r\n\r\nj = 0\r\nk = 0\r\n\r\nans = []\r\nflag = False\r\nfor i in range(1, n - 1):\r\n ans.append(s[i])\r\n if len(ans) >= 3 and ans[-3] == \"d\" and ans[-2] == \"o\" and ans[-1] == \"t\":\r\n ans.pop()\r\n ans.pop()\r\n ans.pop()\r\n ans.append(\".\")\r\n\r\n if not flag and len(ans) >= 2 and ans[-2] == \"a\" and ans[-1] == \"t\":\r\n ans.pop()\r\n ans.pop()\r\n ans.append(\"@\")\r\n flag = True\r\n \r\n\r\nprint(s[0],*ans,s[-1], sep=\"\")", "s = input()\r\nss = s[1:-1].replace(\"at\", \"@\", 1).replace(\"dot\", \".\")\r\nprint(s[0]+ss+s[-1])", "a = input()\r\nans = a[0]\r\nj = 1\r\nwhile j < len(a):\r\n if j + 3 < len(a):\r\n if a[j:j + 3:] == 'dot':\r\n j += 3\r\n ans += '.'\r\n else:\r\n ans += a[j]\r\n j += 1\r\n else:\r\n ans += a[j]\r\n j += 1\r\nnewans = ans[0]\r\nj = 1\r\nprov = True\r\nwhile j < len(ans):\r\n if j + 2 < len(ans):\r\n if ans[j:j + 2] == 'at' and prov and j != len(ans) - 2:\r\n j += 2\r\n newans += '@'\r\n prov = False\r\n else:\r\n newans += ans[j]\r\n j += 1\r\n else:\r\n newans += ans[j]\r\n j += 1\r\nprint(newans)", "\r\n # ///==========Libraries, Constants and Functions=============///\r\n#mkraghav\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\ndef int1():return int(input())\r\n\r\nimport string\r\n\r\nimport math\r\n\r\n\r\nfrom itertools import combinations\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef main():\r\n\r\n l=(input())\r\n j2=len(l)\r\n\r\n s=list(l)\r\n s.pop()\r\n j=l[len(l)-4:len(l)-1]\r\n\r\n j3=l.index('at')\r\n\r\n if j3==0:\r\n\r\n q4=l[:j3+2]\r\n q5=l[j3+2:]\r\n q5=q5.replace('at','@',1)\r\n l=q4+q5\r\n else:\r\n l=l.replace('at','@',1)\r\n\r\n if 'dot' in l:\r\n i=(l.index('dot'))\r\n else:\r\n i=100000\r\n\r\n if (l.count('dot'))>=1 and i!=0:\r\n l=l.replace('dot','.')\r\n\r\n\r\n elif i==0 :\r\n l4=l[:i+3]\r\n l5=l[i+3:]\r\n l5=l5.replace('dot','.')\r\n l=l4+l5\r\n\r\n\r\n\r\n\r\n if j=='dot':\r\n\r\n\r\n l=l[:len(l)-2]+'dot'\r\n print(l)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = str(input())\r\n\r\ns = s.replace(\"at\",\"@\",1)\r\ns = s.replace(\"dot\",\".\")\r\n\r\nif s[0]==\".\":\r\n\ts = \"dot\"+s[1:]\r\n\r\nif s[0]==\"@\":\r\n\ts = s.replace(\"at\",\"@\",1)\r\n\ts = \"at\"+s[1:]\r\n\t\r\n\r\nif s[len(s)-1]==\".\":\r\n\ts = s[:len(s)-1]+\"dot\"\r\n\r\nprint(s)", "t = input()\r\nt = t[0] + t[1: -1].replace('dot', '.') + t[-1]\r\nk = t.find('at', 1)\r\nprint(t[:k] + '@' + t[k + 2:])", "s = input()\r\nc1 = s[0]\r\nc2 = s[-1]\r\n \r\ns = s[1:-1]\r\n \r\ns = s.replace(\"dot\", \".\")\r\ns = s.replace(\"at\", \"@\", 1)\r\n \r\nprint(c1 + s + c2)\r\n\r\n# Your last C/C++ code is saved below:\r\n# #include <iostream>\r\n# using namespace std;\r\n\r\n# #define ll long long\r\n# #define fi first \r\n# #define se second\r\n\r\n# typedef vector <>\r\n# typedef vector <ii> vii\r\n\r\n# int main() {\r\n# \tint n, k;\r\n# cin >> n >> k;\r\n \r\n \r\n# }\r\n\r\n\r\n" ]

[ "M, Mod = 10**3 + 3, 10**9 + 7\nn, m, k = [int(x) for x in input().split()]\nif m == 0:\n print(0)\nelif m == 1:\n print(pow(k, n, Mod))\nelse:\n C = [[0 for j in range(M)] for i in range(M)]\n for i in range(n + 1):\n C[i][0] = 1\n for j in range(1, i + 1):\n C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % Mod\n F = [0 for j in range(M)]\n for i in range(1, n + 1):\n F[i] = pow(i, n, Mod)\n for j in range(1, i):\n F[i] = (F[i] - F[j] * C[i][j] % Mod + Mod) % Mod\n R1, R2 = [1], [1]\n for i in range(1, n + 1):\n R1.append(R1[i-1] * pow(i, Mod-2, Mod) % Mod)\n for i in range(1, 2 * n + 1):\n if i > k:\n break\n R2.append(R2[i - 1] * (k - i + 1)%Mod)\n tot = 0\n for i in range(n + 1):\n x = pow(i,(m-2)*n,Mod)\n for j in range(n - i + 1):\n if i + 2 * j > k:\n break\n tot = (tot + R2[2 * j + i] * R1[j] % Mod * R1[j] % Mod * R1[i] % Mod * F[i + j] % Mod * F[i + j] % Mod * x) % Mod;\n print(tot)\n" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ns2 = str(input())\r\nif \"1\" in s2 or \"2\" in s2:\r\n print(\"No\")\r\nelse:\r\n an = \"\"\r\n s = list(s2)\r\n for i in range(len(s)):\r\n if s2[i] == \"4\":\r\n s[i] = \"6\"\r\n elif s2[i] == \"5\":\r\n s[i] = \"9\"\r\n elif s2[i] == \"8\":\r\n s[i] = \"0\"\r\n for i in range(len(s)):\r\n an += s[i]\r\n if len(an) == 1:\r\n if an[0] == \"3\" or an[0] == \"7\":\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\" if an == an[::-1] else \"No\")", "m=[8,-1,-1,3,6,9,4,7,0,5]\r\na=input()\r\nl=len(a)\r\nprint('Yes'if all(m[ord(a[i])-48]==ord(a[l-i-1])-48 for i in range(l))else'No')", "# coding: utf-8\r\n\r\na = [8, -1, -1, 3, 6, 9, 4, 7, 0, 5]\r\ns = input()\r\n\r\nprint('Yes') if all(a[int(s[i])] == int(s[len(s) - i - 1]) for i in range(len(s))) else print('No')", "s=input()\r\ns1=''\r\nfor i in s:\r\n if i=='0':\r\n s1+='8'\r\n elif i=='1':\r\n s1+=''\r\n elif i=='2':\r\n s1+=''\r\n elif i=='3':\r\n s1+='3'\r\n elif i=='4':\r\n s1+='6'\r\n elif i=='5':\r\n s1+='9'\r\n elif i=='6':\r\n s1+='4'\r\n elif i=='7':\r\n s1+='7'\r\n elif i=='8':\r\n s1+='0'\r\n elif i=='9':\r\n s1+='5'\r\nif s!=s1[::-1]:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n#print(' '.join([str(i) for i in a]))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-21 15:41:19\nLastEditTime: 2021-11-21 15:45:19\nDescription: Touchy-Feely Palindromes\nFilePath: CF784D.py\n'''\n\n\ndef func():\n base = [\"23\", \"10\", \"30\", \"11\", \"13\", \"12\", \"31\", \"33\", \"32\", \"21\"]\n s1 = input().strip()\n s2 = \"\"\n for item in s1:\n s2 += base[int(item)]\n print(\"Yes\" if s2 == s2[::-1] else \"No\")\n\n\nif __name__ == '__main__':\n func()\n", "'''input\r\n373\r\n'''\r\n'''input\r\n121\r\n'''\r\n'''input\r\n436\r\n'''\r\nt = str(int(input()))\r\na = {'0':' .','1':'. ','2':'. ','3':'..','4':'..','5': '. ','6':'..','7':'..','8':'. ','9':' .'}\r\nb = {'0':'..','1':' ','2':'. ','3':' ','4':' .','5': ' .','6':'. ','7':'..','8':'..','9':'. '}\r\ndef isp(x):\r\n\tx = ''.join(x)\r\n\ty = ''.join(reversed(x))\r\n\treturn x == y\r\nprint('Yes' if isp(a[x] for x in t) and isp(b[x] for x in t) else 'No')", "from sys import stdin,stdout\r\n# from os import _exit\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn = input().strip()\r\nm = \"\"\r\nfor i in n[::-1]:\r\n if i==\"3\" or i==\"7\":\r\n m+=i\r\n elif i==\"4\":\r\n m+=\"6\"\r\n elif i==\"6\":\r\n m+=\"4\"\r\n elif i==\"5\":\r\n m+=\"9\"\r\n elif i==\"9\":\r\n m+=\"5\"\r\n elif i==\"0\":\r\n m+=\"8\"\r\n elif i==\"8\":\r\n m+=\"0\"\r\nif m==n:\r\n print(\"Yes\\n\")\r\nelse:\r\n print(\"No\\n\")\r\n", "# ⠁⠃⠉⠙⠑⠋⠛⠓⠊⠚\n# 1234567890\n\nR = [\n (\"1\", \"' \"),\n (\"2\", \": \"),\n (\"3\", \"''\"),\n (\"4\", \"':\"),\n (\"5\", \"'.\"),\n (\"6\", \":'\"),\n (\"7\", \"::\"),\n (\"8\", \":.\"),\n (\"9\", \".'\"),\n (\"0\", \".:\"),\n]\n\ns = input()\nfor a,b in R:\n s = s.replace(a,b)\nprint(\"Yes\" if s==s[::-1] else \"No\")\n", "print([\"No\",\"Yes\"][(lambda x:min([x[i]+x[::-1][i]in[\"33\",\"46\",\"59\",\"77\",\"80\",\"64\",\"95\",\"08\"]for i in range(len(x))]))(input())])", "d = {'0': '8', '3': '3', '4': '6', '5': '9',\r\n '6': '4', '7': '7', '8': '0', '9': '5'}\r\ns = input()\r\ns1 = ''.join(d[c] for c in reversed(s) if c in d)\r\nif s == s1:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "p = input()\r\nl = len(p) - 1\r\nans = \"\"\r\ns=[\"23\", \"10\", \"30\", \"11\", \"13\", \"12\", \"31\", \"33\", \"32\",\"21\"]\r\nfor x in p:\r\n ans+=s[ord(x) -48]\r\nif ans == ans[::-1]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")" ]

[ "a = input()\r\nb = []\r\nh = ''\r\nc = 0\r\nfor i in a:\r\n\tif i == 'Q':\r\n\t\tc += 1\r\nif c == 0:\r\n\tprint('Yes')\r\n\texit(0)\r\nr = -1\r\nfor i in range(1001):\r\n\tif i*i == c:\r\n\t\tr = i\r\n\t\tbreak\r\nif r == -1:\r\n\tprint('No')\r\n\texit(0)\r\nh = [a.split('Q')[0], a.split('Q')[-1]]\r\nc = [len(h[0]), len(h[1])]\r\nif c[0] % 2 != 0 or c[1] % 2 != 0:\r\n\tprint('No')\r\n\texit(0)\r\nc[0] //= 2\r\nc[1] //= 2\r\nresp = ''\r\ni = c[0]\r\nwhile True:\r\n\tif i >= len(a):\r\n\t\tbreak\r\n\tif r == 0 and a[i] == 'Q':\r\n\t\tbreak\r\n\tresp += a[i]\r\n\tif r == 0 and a[i] == 'H':\r\n\t\tc[1] -= 1\r\n\tif c[1] == 0 and r == 0:\r\n\t\tbreak\r\n\tif a[i] == 'Q':\r\n\t\tr -= 1\r\n\tif r == -1:\r\n\t\tprint('No')\r\n\t\texit(0)\r\n\ti += 1\r\n\r\n\r\ndef hq(a):\r\n\tresp = ''\r\n\tfor i in a:\r\n\t\tif i == 'H':\r\n\t\t\tresp += 'H'\r\n\t\telse:\r\n\t\t\tresp += a\r\n\treturn resp\r\n\r\nif a == hq(resp):\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')\r\n" ]

[ "# Description of the problem can be found at http://codeforces.com/problemset/problem/387/A\r\n\r\nl_s = list(map(int, input().split(\":\")))\r\nl_t = list(map(int, input().split(\":\")))\r\n\r\nif l_t[1] > l_s[1]:\r\n l_s[0] -= 1\r\n \r\nprint(\"%02d:%02d\" % ((l_s[0] - l_t[0]) % 24, (l_s[1] - l_t[1]) % 60))", "a,b=map(int, input().split(':'))\r\nc,d=map(int, input().split(':'))\r\nk=a*60+ b-c*60-d\r\nif k < 0:\r\n k+=60*24\r\na=k//60\r\nb=k% 60\r\nprint(str(a//10) + str(a%10)+':'+str(b//10)+str(b%10))\r\n", "bangun = input().split(\":\")\nlama_tidur = input().split(\":\")\nmenit = int(bangun[1]) - int(lama_tidur[1])\njam = int(bangun[0]) - int(lama_tidur[0])\nif menit < 0:\n menit += 60\n jam -= 1\nif jam < 0:\n jam += 24\nA = str(menit)\nB = str(jam)\nif len(A) < 2:\n A = \"0\"+A\nif len(B)<2:\n B = \"0\"+B\nprint(B+\":\"+A)\n \t \t \t\t \t\t \t\t \t\t \t \t\t\t\t\t", "s = input().split(':')\r\nt = input().split(':')\r\ns = int(s[0]) * 60 + int(s[1])\r\nt = int(t[0]) * 60 + int(t[1])\r\ns -= t\r\nif s < 0:\r\n s += 24 * 60\r\nprint('%02d:%02d' % (s // 60, s % 60))", "\r\ns=input().split(':')\r\na=int(s[0])\r\nb=int(s[1])\r\n\r\ns=input().split(':')\r\nx=int(s[0])\r\ny=int(s[1])\r\n\r\nb=b-y\r\nif b<0:\r\n\tb=b+60\r\n\ta-=1\r\na=a-x\r\nif a<0:\r\n\ta=a+24\r\n\r\nif a<10:\r\n\tprint('0',end=\"\")\r\nprint(a,end=\"\")\r\n\r\nprint(\":\",end=\"\")\r\nif b<10:\r\n\tprint(0,end=\"\")\r\nprint(b,end=\"\")\r\n", "def time(h,m):\n if h < 0:\n h += 24\n if h <10:\n h = f'{0}{h}'\n if m < 10:\n m = f'{0}{m}'\n return f'{h}:{m}'\n\ndef solve(s, t):\n sh,sm = map(int, s.split(':'))\n th,tm = map(int,t.split(':'))\n tot_s = sh*60+sm\n tot_t = th*60+tm\n res = tot_s - tot_t\n return time(res//60, res%60)\n\n \n\n \ndef main() :\n # n = int(input())\n # arr = list(map(int, input().split(' ')))\n # arr = []\n # for _ in range(4):\n # i = input()\n # arr.append(i)\n s = input()\n t = input()\n print(solve(s,t))\nmain()\n", "from sys import stdin\r\nfrom datetime import datetime, timedelta\r\n\r\ndef main():\r\n\ts = stdin.readline().strip()\r\n\tt = stdin.readline().strip()\r\n\r\n\ts = datetime.strptime(s, '%H:%M')\r\n\tt = datetime.strptime(t, '%H:%M')\r\n\r\n\tt = timedelta(hours = t.hour, minutes = t.minute)\r\n\r\n\tp = s - t\r\n\r\n\tprint('{:02}:{:02}'.format(p.hour, p.minute))\r\n\r\nif __name__ == '__main__': main()", "s1=input()\r\ns2=input()\r\nans1=int(s1[:2])-int(s2[:2])\r\nans2=int(s1[3:])-int(s2[3:])\r\nif ans2>=0:\r\n k2=\"0\"+str(ans2)\r\n if ans1>=0:\r\n k1=\"0\"+str(ans1)\r\n print(k1[-2:]+\":\"+k2[-2:])\r\n else:\r\n ans1+=24\r\n k1=\"0\"+str(ans1)\r\n print(k1[-2:]+\":\"+k2[-2:])\r\nelse:\r\n ans2+=60\r\n ans1-=1\r\n k2=\"0\"+str(ans2)\r\n if ans1>=0:\r\n k1=\"0\"+str(ans1)\r\n print(k1[-2:]+\":\"+k2[-2:])\r\n else:\r\n ans1+=24\r\n k1=\"0\"+str(ans1)\r\n print(k1[-2:]+\":\"+k2[-2:])\r\n \r\n \r\n \r\n \r\n", "a=input().split(':')\r\nb=input().split(':')\r\na=int(a[0])*60+int(a[1])\r\nb=int(b[0])*60+int(b[1])\r\na=(a+1440-b)%1440\r\nprint(f'{a//60:02d}:{a%60:02d}')", "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\ncur=input().strip() ; curHou=int(cur[:2]) ; curMin=int(cur[3:])\r\ntime=input().strip() ; tiHou=int(time[:2]) ; tiMin=int(time[3:]) ; cond=False\r\nif curMin>=tiMin:\r\n sMin=curMin-tiMin\r\nelse:\r\n sMin=60+(curMin-tiMin) ; cond=True\r\n\r\nif curHou==0:curHou=24\r\nif tiHou==0:tiHou=24\r\nif curHou>=tiHou:\r\n sHour=curHou-tiHou\r\nelse:\r\n sHour=24+(curHou-tiHou)\r\nif cond :\r\n if sHour==0:\r\n sHour=23\r\n else:\r\n sHour-=1\r\nsHour=str(sHour)\r\nif len(sHour)==1:\r\n sHour=\"0\"+sHour\r\nsMin=str(sMin)\r\nif len(sMin)==1 :\r\n sMin=\"0\"+sMin\r\nprint(sHour+\":\"+sMin)\r\n\r\n\r\n\r\n\r\n", "I = lambda: map(int, input().split(':'))\r\n\r\nh, m = I()\r\ndh, dm = I()\r\nh, m = h - dh, m - dm\r\nh, m = (h + m // 60) % 24, m % 60\r\n\r\nprint(f'{h:02}:{m:02}')", "h1, m1 = map(int, input().split(':'))\r\nh2, m2 = map(int, input().split(':'))\r\nif (m1 < m2):\r\n m1 += 60\r\n h1 -= 1\r\nif (h1 < h2):\r\n h1 += 24\r\nr1, r2 = str(h1 - h2), str(m1 - m2)\r\nprint('0' * (2-len(r1)) + r1 + \":\" + '0' * (2-len(r2)) + r2)\r\n", "a1,a2=map(int,input().split(':'))\r\nb1,b2=map(int,input().split(':'))\r\n\r\nif(a1<b1 or (a1==b1 and a2<b2)):\r\n a1=a1+24\r\n\r\na1=a1-b1\r\na2=a2-b2\r\n\r\nif(a2<0):\r\n a1-=1\r\n a2+=60\r\n\r\nprint(\"%02d:%02d\"%(a1,a2))", "def tmins():\r\n sh, sm = map(int, input().split(':'))\r\n return 60 * sh + sm\r\n \r\nt = tmins() - tmins()\r\nif t < 0:\r\n t += 60*24\r\n \r\nprint('%02d:%02d' % (t//60, t%60))", "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(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n ch, cm = map(int, S().split(':'))\r\n dh, dm = map(int, S().split(':'))\r\n dmins = dm + dh*60\r\n ctime = ch*60 + cm \r\n x = ctime - dmins\r\n h, m = divmod(x, 60)\r\n h = 24+h if h<0 else h \r\n h = str(h)\r\n m = str(m)\r\n if len(h)==1: h = '0'+h \r\n if len(m)==1: m = '0'+m\r\n return h+':'+m\r\n \r\nif __name__ == '__main__':\r\n print(main())", "finish = str(input())\ndistance = str(input())\n\ndef get_minutes(time):\n h, m = time.split(':')\n h = int(h)\n m = int(m)\n result = h * 60 + m\n return result\n\ndef get_clock(minutes):\n h = minutes // 60\n m = minutes - (60 * h)\n return (h, m)\n\nfinish = get_minutes(finish)\ndistance = get_minutes(distance)\n\nresult_minutes = finish - distance\nif result_minutes < 0:\n result_minutes = (24 * 60) + result_minutes\n\nh, m = get_clock(result_minutes)\nresult = ''\nif len(str(h)) == 1:\n result = f'0{h}:'\nelse:\n result = f'{h}:'\n\nif len(str(m)) == 1:\n result = result + f'0{m}'\nelse:\n result = result + f'{m}'\n\nprint(result)\n", "#!/usr/bin/python3 -SOO\nh,m = map(int,input().strip().split(':'))\nh_,m_ = map(int,input().strip().split(':'))\nh -= h_\nm -= m_\nif m < 0:\n h -= 1\n m = 60+m\nif h < 0: h %= 24\nprint('%02d:%02d'%(h,m))\n", "s = input().split(\":\")\nt = input().split(\":\")\nanswer = []\nhourWakeUp = int(s[0])\nminuteWakeUp = int(s[1])\nhourSleep = int(t[0])\nminuteSleep = int(t[1])\nif minuteWakeUp < minuteSleep:\n minuteWakeUp = minuteWakeUp + 60\n hourWakeUp -= 1\nif hourWakeUp < hourSleep:\n hourWakeUp = hourWakeUp + 24\nhourAnswer = str(hourWakeUp - hourSleep).zfill(2)\nminuteAnswer = str(minuteWakeUp - minuteSleep).zfill(2)\nanswer.append(hourAnswer)\nanswer.append(minuteAnswer)\nans = \":\".join(answer)\nprint(ans)\n\n\t\t \t \t\t \t \t \t\t\t \t\t\t", "h1, m1 = map(int, input().split(':'))\r\nh2, m2 = map(int, input().split(':'))\r\nh1 -= h2\r\nm1 -= m2\r\nif m1 < 0:\r\n\tm1 += 60\r\n\th1 -= 1\r\nif h1 < 0:\r\n\th1 += 24\r\nprint(\"{:02}:{:02}\".format(h1, m1))", "sh,sm=map(int,input().split(':'))\r\nth,tm=map(int,input().split(':'))\r\nst,tt=sh*60+sm,th*60+tm\r\nat=st-tt\r\nif at>=0:\r\n hh = at // 60\r\n mm = at - hh * 60\r\nelif at<0:\r\n at=24*60 +at\r\n hh = at // 60\r\n mm = at - hh * 60\r\nprint(str(hh).zfill(2)+':'+str(mm).zfill(2))\r\n", "from datetime import datetime\nimport re\nFORMAT = '%H:%M'\ntime1 = input()\ntime2 = input()\ntdelta = str(datetime.strptime(time1, FORMAT) - datetime.strptime(time2, FORMAT))\nprint('{:0>5}'.format(re.findall(r'[0-9]?\\d:\\d\\d', tdelta)[0]))\n", "s = input() # current time\r\nt = input() # duration of sleep\r\n\r\n# Convert s and t to minutes\r\ns_minutes = int(s[:2]) * 60 + int(s[3:])\r\nt_minutes = int(t[:2]) * 60 + int(t[3:])\r\n\r\n# Calculate the time George went to bed, in minutes\r\np_minutes = s_minutes - t_minutes\r\nif p_minutes < 0:\r\n p_minutes += 24 * 60 # add a day in minutes if p is negative\r\n\r\n# Convert p_minutes back to the \"hh:mm\" format\r\np_hours = p_minutes // 60\r\np_minutes = p_minutes % 60\r\nprint(\"{:02d}:{:02d}\".format(p_hours, p_minutes))\r\n", "hour, mnt = map(int,input().split(\":\"))\r\n\r\ndurH, durM = map(int,input().split(\":\"))\r\n\r\nresM = mnt - durM\r\n\r\nsn = ((resM//(abs(resM)+.1))-abs(resM//(abs(resM)+.1)))/-2\r\n\r\nresM += sn*60\r\n\r\nresH = hour - durH - sn\r\n\r\nresH += ((resH//(abs(resH)+.1))-abs(resH//(abs(resH)+.1)))*-12\r\n\r\nprint(f\"{str(int(resH)).zfill(2)}:{str(int(resM)).zfill(2)}\")", "a,b=map(int,input().split(':'))\nc,d=map(int,input().split(':'))\ny=b-d+60*(b<d)\nif b<d:\n x=a-1-c+24*(a-1<c)\nelse:\n x=a-c+24*(a<c)\nprint(x if x>=10 else '0'+str(x),end=\":\")\nprint(y if y>=10 else '0'+str(y))", "q = input()\r\nw= input()\r\nq = q.split(\":\")\r\nw= w.split(\":\")\r\n\r\na=int(q[0])\r\nb=int(w[0])\r\naa=int(q[1])\r\nbb=int(w[1])\r\n\r\nif aa<bb:\r\n aa=aa+60\r\n a=a-1\r\n\r\nrr= aa-bb\r\n\r\nif a<b:\r\n a=a+24\r\n\r\ngg = a-b\r\nif gg <10:\r\n gg = \"0\"+str(gg)\r\nif rr <10:\r\n rr = \"0\"+str(rr)\r\n\r\n\r\n\r\nprint(str(gg)+\":\"+str(rr))\r\n ", "if __name__ == '__main__':\r\n h0, m0 = str(input()).split(':')\r\n h1, m1 = str(input()).split(':')\r\n h = int(h0) - int(h1)\r\n m = int(m0) - int(m1)\r\n if m < 0:\r\n m += 60\r\n h -= 1\r\n if h < 0:\r\n h += 24\r\n print('%02d' % h + ':' + '%02d' % m)\r\n", "from sys import stdin\n\n\ndef main():\n (h, m), (dh, dm) = (tuple(map(int, stdin.readline().strip().split(':'))) for _ in (0, 1))\n return '{:0>2d}:{:0>2d}'.format(*divmod(((h - dh) * 60 + m - dm) % 1440, 60))\n\n\nprint(main())\n", "s = input()\r\nt = input()\r\nhours = int(s[0:2]) - int(t[0:2])\r\nminutes = int(s[3:]) - int(t[3:])\r\nif minutes < 0:\r\n minutes += 60\r\n hours -= 1\r\nif hours < 0:\r\n hours += 24\r\nif hours < 10:\r\n hours = f\"0{hours}\"\r\nif minutes < 10:\r\n minutes = f\"0{minutes}\"\r\nprint(f\"{hours}:{minutes}\")\r\n", "s=list(map(int,input().split(\":\")))\r\nt=list(map(int,input().split(\":\")))\r\nc=0\r\nif t[1]>s[1]:\r\n\ts[1]+=60\r\n\ts[1]-=t[1]\r\n\tc+=1\r\nelse:\r\n\ts[1]-=t[1]\r\nif s[0]-(t[0]+c)<0:\r\n\td=t[0]+c-s[0]\r\n\ts[0]=24-d\r\nelse:\r\n\ts[0]-=(t[0]+c)\r\ns=list(map(str,s))\r\nfor i in range(2):\r\n\tif len(s[i])==1:\r\n\t\ts[i]=\"0\"+s[i]\r\nprint(\":\".join(s))", "h,m = map(int, input().split(':'))\r\nh += 23\r\nm += 60\r\nth, tm = map(int, input().split(':'))\r\nh = h - th\r\nm = m - tm\r\nh = (h + m//60) % 24\r\nm = m % 60\r\nif h < 10:\r\n h = '0'+str(h)\r\nif m < 10:\r\n m = '0' + str(m)\r\nprint(str(h) + ':' + str(m))", "s1,s2 = input(),input()\r\ns1h,s1m = map(int,s1.split(\":\"))\r\ns2h,s2m = map(int,s2.split(\":\"))\r\nresult_in_integer = s1h*60+s1m-s2h*60-s2m\r\nif result_in_integer < 0:\r\n result_in_integer = 24*60 + result_in_integer\r\nh = str(result_in_integer//60) \r\nif len(h) == 1:\r\n h = \"0\"+h\r\nm = str(result_in_integer%60)\r\nif len(m) == 1:\r\n m = \"0\"+m\r\nprint(f\"{h}:{m}\")", "def solve():\r\n h, m = map(int, input().split(':'))\r\n return 60 * h + m\r\n\r\nt = solve() - solve()\r\nif t < 0:\r\n t += 60 * 24\r\nprint('%02d:%02d' % (t // 60, t % 60))\r\n", "s, t = input(), input()\r\ns = (int(s[0]) * 10 + int(s[1])) * 60 + int(s[3]) * 10 + int(s[4])\r\nt = (int(t[0]) * 10 + int(t[1])) * 60 + int(t[3]) * 10 + int(t[4])\r\nfor u in range(t):\r\n s -= 1\r\n if s == -1: s = 1439\r\nprint(s // 600, s // 60 % 10, \":\", s % 60 // 10, s % 60 % 10, sep = \"\") ", "h_1, m_1 = map(int, input().split(':'))\r\nh_2, m_2 = map(int, input().split(':'))\r\n\r\ncur_time = h_1 * 60 + m_1\r\nsleep_time = h_2 * 60 + m_2\r\n\r\nresult_time = 1440 + cur_time - sleep_time if cur_time - sleep_time < 0 else cur_time - sleep_time\r\n\r\nresult_h = '0' + str(result_time // 60) if result_time // 60 < 10 else str(result_time // 60)\r\nresult_m = '0' + str(result_time % 60) if result_time % 60 < 10 else str(result_time % 60)\r\n\r\nprint( f'{result_h}:{result_m}' )", "woke_hr, woke_min = map(int, input().split(\":\"))\r\ndur_hr, dur_min = map(int, input().split(\":\"))\r\nst_sleep_hr, st_sleep_min = 0, 0\r\n\r\nif woke_min < dur_min: st_sleep_min = (60 + woke_min) - dur_min; dur_hr += 1\r\nelse: st_sleep_min = woke_min - dur_min\r\n\r\nif st_sleep_min in range(0, 10): st_sleep_min = \"0\"+str(st_sleep_min)\r\nelse: st_sleep_min = str(st_sleep_min)\r\n\r\nst_sleep_hr = (woke_hr - dur_hr) % 24\r\n\r\nif st_sleep_hr in range(0, 10): st_sleep_hr = \"0\"+str(st_sleep_hr)\r\nelse: st_sleep_hr = str(st_sleep_hr)\r\n\r\nprint(\"\".join([st_sleep_hr, \":\", st_sleep_min]))", "cur_hr, cur_min = map(int, input().split(':'))\r\ndur_hr, dur_min = map(int, input().split(':'))\r\n\r\ncur = cur_hr * 60 + cur_min\r\ndur = dur_hr * 60 + dur_min\r\n\r\nsleep = (cur - dur)% 1440\r\n\r\nsleep_hr = sleep // 60\r\nsleep_min = sleep % 60\r\n\r\nprint(str(sleep_hr).rjust(2,'0') + ':' + str(sleep_min).rjust(2,'0'))\r\n", "\ns=input().split(':')\na=int(s[0])\nb=int(s[1])\n\ns=input().split(':')\nx=int(s[0])\ny=int(s[1])\n\nb=b-y\nif b<0:\n\tb=b+60\n\ta-=1\na=a-x\nif a<0:\n\ta=a+24\n\nif a<10:\n\tprint('0',end=\"\")\nprint(a,end=\"\")\n\nprint(\":\",end=\"\")\nif b<10:\n\tprint(0,end=\"\")\nprint(b,end=\"\")\n", "s, t = (tuple(map(int, input().split(':'))) for i in \"01\")\r\nz = ((s[0], 24)[not s[0]] - t[0]) * 60 + s[1] - t[1]\r\nprint('{:02}:{:02}'.format((z // 60) % 24, z % 60))", "*s, = map(int, input().split(\":\"))\r\n*t, = map(int, input().split(\":\"))\r\ns = s[0] * 60 + s[1]\r\nt = t[0] * 60 + t[1]\r\nif t > s:\r\n t -= s\r\n s = 1440 - t\r\nelse:\r\n s -= t\r\nhh = '0' * (2 - len(str(s // 60))) + str(s // 60)\r\nmm = '0' * (2 - len(str(s % 60))) + str(s % 60)\r\nprint(hh + ':' + mm)\r\n", "import datetime\r\nfrom datetime import timedelta\r\ntimeNow = input()\r\nduration = input().split(':')\r\ntime_obj = datetime.datetime.strptime(timeNow, '%H:%M') - timedelta(hours=int(duration[0]), minutes=int(duration[1]))\r\ntime_obj = time_obj.time().strftime(\"%H:%M\")\r\n\r\nprint(time_obj)\r\n", "s=input().split(':')\r\ns[0]=int(s[0])\r\ns[1]=int(s[1])\r\nt=input().split(':')\r\nt[0]=int(t[0])\r\nt[1]=int(t[1])\r\ndef v(n):\r\n n=str(n)\r\n if len(n)==1:\r\n return '0'+n\r\n else:\r\n return n \r\nif s[0]>=t[0] and s[1]>=t[1]:\r\n print(v(s[0]-t[0])+':'+v(s[1]-t[1]))\r\nelif s[0]>t[0] and s[1]<t[1]:\r\n print(v(s[0]-t[0]-1)+':'+v(s[1]+60-t[1]))\r\nelif s[0]==t[0] and s[1]<t[1]:\r\n print('23'+':'+v(s[1]+60-t[1]))\r\nelif s[0]<t[0] and s[1]>=t[1]:\r\n print(v(24-(t[0]-s[0]))+':'+v(s[1]-t[1])) \r\nelif s[0]<t[0] and s[1]<t[1]: \r\n print(v(24-(t[0]-s[0])-1)+':'+v(60+s[1]-t[1])) ", "s = input().split(\":\")\r\nt = input().split(\":\")\r\n\r\nh = int(s[0]) - int(t[0])\r\n\r\nm = int(s[1]) - int(t[1])\r\nwhile m < 0:\r\n m += 60\r\n h -= 1\r\nwhile h < 0:\r\n h += 24\r\n\r\n\r\nmstr = ''\r\nif m < 10:\r\n mstr = '0' + str(m)\r\nelse:\r\n mstr = str(m)\r\n\r\nhstr = ''\r\nif h < 10:\r\n hstr = '0' + str(h)\r\nelse:\r\n hstr = str(h)\r\n\r\nprint(hstr + ':' + mstr)\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nch, cm = map(int, input().split(':'))\r\nsh, sm = map(int, input().split(':'))\r\n\r\ntmp = ch * 60 + cm - (sh * 60 + sm)\r\nwhile tmp < 0:\r\n tmp = 24 * 60 + tmp\r\n\r\nprint(\"{:02}\".format(tmp // 60) + \":\" + \"{:02}\".format(tmp % 60))", "hs,ms = map(int,input().split(\":\"))\r\nht,mt = map(int,input().split(\":\"))\r\n\r\nif ht <= hs:\r\n hs-=ht\r\n if mt <= ms:\r\n ms-=mt\r\n elif hs > 0:\r\n hs-=1\r\n x = 60 - mt\r\n if x + ms < 60:\r\n ms+=x\r\n else:\r\n hs+=1\r\n ms = (ms+x)-60\r\n elif hs == 0:\r\n hs = 23\r\n x = 60 - mt\r\n if x + ms < 60:\r\n ms+=x\r\n else:\r\n hs = 00\r\n ms = (ms+x)-60\r\nelif ht > hs:\r\n hs = 24 - (ht-hs)\r\n if mt <= ms:\r\n ms-=mt\r\n elif hs > 0:\r\n hs-=1\r\n x = 60 - mt\r\n if x + ms < 60:\r\n ms+=x\r\n else:\r\n hs+=1\r\n ms = (ms+x)-60\r\n elif hs == 0:\r\n hs = 23\r\n x = 60 - mt\r\n if x + ms < 60:\r\n ms+=x\r\n else:\r\n hs = 00\r\n ms = (ms+x)-60\r\nif hs < 10 and ms < 10:\r\n print(f\"0{hs}:0{ms}\")\r\nelif hs >= 10 and ms < 10:\r\n print(f\"{hs}:0{ms}\")\r\nelif hs < 10 and ms >= 10:\r\n print(f\"0{hs}:{ms}\")\r\nelse: print(f\"{hs}:{ms}\")", "woke_hr, woke_min = map(int, input().split(\":\"))\r\ndur_hr, dur_min = map(int, input().split(\":\"))\r\nst_sleep_hr, st_sleep_min = 0, 0\r\n\r\nif woke_min < dur_min: st_sleep_min = (60 + woke_min) - dur_min; dur_hr += 1\r\nelse: st_sleep_min = woke_min - dur_min\r\n# add 60 if time of waking up(min part) is less than duration(min part of course). Then sub 1 form woke_hr/ add 1 to dur_hr to balance the 60 min.\r\n\r\n\r\nif st_sleep_min in range(0, 10): st_sleep_min = \"0\"+str(st_sleep_min) # just for the sake of output\r\nelse: st_sleep_min = str(st_sleep_min)\r\n\r\nst_sleep_hr = (woke_hr - dur_hr) % 24\r\n\r\nif st_sleep_hr in range(0, 10): st_sleep_hr = \"0\"+str(st_sleep_hr) # just for the sake of output\r\nelse: st_sleep_hr = str(st_sleep_hr)\r\n\r\nprint(\"\".join([st_sleep_hr, \":\", st_sleep_min]))", "from datetime import datetime\ns = datetime.strptime(input(), '%H:%M')\nt = datetime.strptime(input(), '%H:%M')\n\nsec = (s - t).seconds\nhours, rem = divmod(sec, 60**2)\nminutes, sec = divmod(rem, 60)\nprint(str(hours).zfill(2) + ':' + str(minutes).zfill(2))\n", "import sys\r\nimport math\r\n\r\nsh, sm = [int(x) for x in (sys.stdin.readline()).split(\":\")]\r\nth, tm = [int(x) for x in (sys.stdin.readline()).split(\":\")]\r\n\r\nrm = sm - tm\r\nif(rm < 0):\r\n th += 1\r\n rm = 60 + rm\r\n \r\nrh = sh - th\r\nif(rh < 0):\r\n rh = 24 + rh\r\n \r\noutrh = \"\"\r\nif(rh < 10):\r\n outrh = \"0\" + str(rh)\r\nelse:\r\n outrh = str(rh)\r\n\r\noutrm = \"\"\r\nif(rm < 10):\r\n outrm = \"0\" + str(rm)\r\nelse:\r\n outrm = str(rm)\r\n \r\nprint(outrh + \":\" + outrm)", "# LUOGU_RID: 92912857\ns = input()\r\nt = input()\r\ns1 = int(s[0:2])*60+int(s[3:5])\r\nt1 = int(t[0:2])*60+int(t[3:5])\r\ns1 = s1 - t1\r\nif s1<0: \r\n s1 = s1+24*60\r\ns11 = s1//60\r\ns22 = s1 % 60\r\nif s11//10 == 0:\r\n print('0'+str(s11)+\":\",end='')\r\nelse:\r\n print(str(s11)+\":\",end='')\r\nif s22//10 == 0:\r\n print('0'+str(s22),end='')\r\nelse:\r\n print(str(s22),end='')", "from datetime import *\na = input().split(\":\")\nb = input().split(\":\")\nx = datetime(1,1,3,int(a[0]),int(a[1]))\ny = timedelta(hours=int(b[0]),minutes=int(b[1]))\nz = str(x - y).split(' ')[1].split(\":\")\nprint(\"%s:%s\"%(z[0],z[1]))\n", "now_h, now_m = map(int, input().split(\":\"))\r\nsleep_h, sleep_m = map(int, input().split(\":\"))\r\n\r\nborrow = False\r\nif now_m >= sleep_m:\r\n result_m = now_m - sleep_m\r\nelse:\r\n result_m = 60 - (sleep_m-now_m)\r\n borrow = True\r\n\r\nif borrow:\r\n now_h -= 1\r\nif now_h >= sleep_h:\r\n result_h = now_h - sleep_h\r\nelse:\r\n result_h = 24 - (sleep_h-now_h)\r\nwhile result_h < 0:\r\n result_h += 24\r\n\r\n\r\nresult_h = str(result_h)\r\nresult_m = str(result_m)\r\n\r\nif len(result_h) == 1:\r\n result_h = \"0\"+result_h\r\nif len(result_m) == 1:\r\n result_m = \"0\"+result_m\r\n\r\nprint(f\"{result_h}:{result_m}\")\r\n", "sh,sm = map(int,input().split(':'))\r\nth,tm = map(int,input().split(':'))\r\nl = (sh-th)%24\r\nr = (sm-tm)\r\nif r<0:\r\n l = (l-1)%24\r\n r = r%60\r\nprint(l if l>9 else '0'+str(l),end=':')\r\nprint(r if r>9 else '0'+str(r))\r\n", "jawab=[0,0]\na=input().split(\":\")\nb=input().split(\":\")\nif int(a[1])<int(b[1]):\n if a[0]!=\"00\":\n a[0]=int(a[0])-1\n else:\n a[0]=23\n a[1] = int(a[1])+60\n jawab[1]= str(a[1] - int(b[1]))\nelse:\n jawab[1]= str(int(a[1]) - int(b[1]))\n\nif int(a[0])<int(b[0]):\n if a[0]==\"00\":\n a[0]=23\n b[0]=int(b[0])-1\n else:\n b[0]= int(b[0])-int(a[0])-1\n a[0]=23\n jawab[0]=str(a[0]-b[0])\nelse:\n jawab[0]=str(int(a[0]) - int(b[0]))\n\nif len(jawab[0])==1:\n jawab[0]=\"0\"+str(jawab[0])\nif len(jawab[1])==1:\n jawab[1]=\"0\"+str(jawab[1])\n\nprint(\":\".join(jawab))\n\n\t\t\t \t \t \t\t \t\t \t\t \t \t \t", "DAY_SECONDS = 86400\r\n\r\ndef get_seconds(s):\r\n return s[0] * 3600 + s[1] * 60\r\n\r\ndef seconds_to_time(s):\r\n h = (s // 3600) % 24\r\n m = (s // 60) % 60\r\n return \"{0:02d}:{1:02d}\".format(h, m)\r\n\r\ndef solve(s, t):\r\n s = [int(x) for x in s.strip().split(\":\")]\r\n t = [int(x) for x in t.strip().split(\":\")]\r\n sec = get_seconds(s) - get_seconds(t)\r\n sec = sec if sec >= 0 else DAY_SECONDS + sec\r\n return seconds_to_time(sec)\r\n\r\ndef main():\r\n s = input()\r\n t = input()\r\n print(solve(s, t))\r\n\r\nif __name__ == '__main__':\r\n main()", "s=input()\r\nt=input()\r\nc=0\r\nif int(s[3:])-int(t[3:])>=0:\r\n t1=str(int(s[3:])-int(t[3:]))\r\n if int(t1)<10:t1='0'+t1\r\nelse:\r\n t1=int(s[3:])-int(t[3:])\r\n t1=str(60+t1)\r\n if int(t1)<10:t1='0'+t1\r\n c=1\r\nif c==1:\r\n if int(s[:2])-int(t[:2])-1>=0:\r\n t2=str(int(s[:2])-int(t[:2])-1)\r\n if int(t2)<10:t2='0'+t2\r\n else:\r\n t2=int(s[:2])-int(t[:2])-1\r\n t2=str(24+t2)\r\n if int(t2)<10:t2='0'+t2\r\nelse:\r\n if int(s[:2])-int(t[:2])>=0:\r\n t2=str(int(s[:2])-int(t[:2]))\r\n if int(t2)<10:t2='0'+t2\r\n else:\r\n t2=int(s[:2])-int(t[:2])\r\n t2=str(24+t2)\r\n if int(t2)<10:t2='0'+t2\r\nans=t2+':'+t1\r\nprint(ans)\r\n", "wakeup = input().split(\":\")\r\nsleepTime = input().split(\":\")\r\nwakeupHour = int(wakeup[0])\r\nwakeupMinute = int(wakeup[1])\r\nsleepHour = int(sleepTime[0])\r\nsleepMinute = int(sleepTime[1])\r\nanswerHour = wakeupHour - sleepHour\r\nanswerMinute = wakeupMinute - sleepMinute\r\nanswerSeconds = 0\r\nminTxt = \"\"\r\nhourTxt = \"\"\r\nif(answerMinute < 0):\r\n answerMinute += 60\r\n answerHour -= 1\r\nif(answerHour < 0):\r\n answerHour += 24\r\n\r\nif(answerMinute < 10):\r\n minTxt = \"0\" + str(answerMinute)\r\nelse:\r\n minTxt = answerMinute\r\nif(answerHour < 10):\r\n hourTxt = \"0\" + str(answerHour)\r\nelse:\r\n hourTxt = answerHour\r\n \r\nprint(f\"{hourTxt}:{minTxt}\")", "# your code goes here\r\ns=input()\r\nt=input()\r\ns=s.split(':')\r\nt=t.split(':')\r\n#print(s,t)\r\nh1=int(s[0])\r\nh2=int(t[0])\r\nm1=int(s[1])\r\nm2=int(t[1])\r\n#print(h1,h2,m1,m2)\r\nif(m1<m2):\r\n h2=h2+1\r\n m1=m1+60\r\nm1=m1-m2\r\nif h1<h2:\r\n h1=h1+24\r\nh1=h1-h2\r\nh1=str(h1)\r\nm1=str(m1)\r\n\r\nif(len(h1)==1):\r\n h1='0'+h1;\r\nif(len(m1)==1):\r\n m1='0'+m1;\r\n\r\nprint(h1,end=\"\")\r\nprint(\":\",end=\"\")\r\nprint(m1)", "h, m = map(int, input().split(\":\"))\r\nhh, mm = map(int, input().split(\":\"))\r\n\r\nh = h* 60 \r\nhh = hh * 60\r\nm += h\r\nmm += hh\r\not = m - mm\r\nif ot<0:\r\n ot = 24*60 - abs(ot)\r\notm = str(ot % 60)\r\noth = str(ot // 60)\r\nif len(oth) == 1:\r\n oth = \"0\" + oth\r\nif len(otm) == 1:\r\n otm = \"0\" + otm\r\nprint(oth+\":\"+otm) ", "s = [int(x) for x in input().split(':')]\nt = [int(x) for x in input().split(':')]\ns = s[0] * 60 + s[1]\nt = t[0] * 60 + t[1]\ns -= t\nif s < 0:\n\ts += 24 * 60\nprint(\"{:02d}:{:02d}\".format(s // 60, s % 60))\n", "t1 = list(map(int,(input().split(':'))))\r\nt2 = list(map(int,(input().split(':'))))\r\ndiff1 = t1[0] - t2[0]\r\ndiff2 = t1[1]- t2[1]\r\nif diff2 < 0:\r\n diff2+=60\r\n diff1-=1\r\nif diff1<0 :\r\n diff1+=24\r\ns = str(diff1).zfill(2) + ':' + str(diff2).zfill(2)\r\nprint(s)", "end = list(map(int, input().split(\":\")))\r\nduration = list(map(int, input().split(\":\")))\r\nstart = [0, 0]\r\nstart[1] = end[1] - duration[1]\r\nstart[0] = end[0] - duration[0]\r\n\r\nstart[0], start[1] = (start[0]+start[1]//60)%24, start[1]%60\r\n\r\nprint(f\"{start[0]:02}:{start[1]:02}\")", "s=input()\r\nt=input()\r\nvstal=60*(int(s[0])*10+int(s[1]))+10*int(s[3])+int(s[4])\r\nspal=60*(int(t[0])*10+int(t[1]))+10*int(t[3])+int(t[4])\r\nleg=(vstal-spal)%(24*60)\r\n\r\n\r\nx0=(leg//600)\r\nx1=(leg//60)%10\r\nx2=':'\r\nx3=(leg%60)//10\r\nx4=(leg%60)%10\r\nprint(str(x0)+str(x1)+x2+str(x3)+str(x4))\r\n\r\n\r\n", "I=lambda:map(int,input().split(\":\"))\r\nh,m=I()\r\nph,pm=I()\r\nh,m=h-ph, m-pm\r\nh, m = (h+m//60)%24, m%60\r\nprint(f\"{h:02}:{m:02}\")", "def func(s):\r\n a, b = list(map(int, s.split(\":\")))\r\n return a*60+b\r\n\r\nct = func(input())\r\nts = func(input())\r\n\r\nans = ct - ts\r\nif ans < 0:\r\n ans += 60*24\r\n\r\nprint(\"%02i:%02i\" % (ans//60, ans%60))\r\n", "a, b = map(int, input().split(':'))\r\nc, d = map(int, input().split(':'))\r\ndef pr(c, d): print(c // 10, c % 10, ':', d // 10, d % 10, sep = '', end = '')\r\nif b >= d: d = b - d\r\nelse:\r\n c += 1\r\n d = 60 + b - d\r\nif c == 24: pr(a, d)\r\nelse:\r\n if a >= c: pr(a - c, d)\r\n else: pr(24 + a - c, d)", "s_hour, s_minute = map(int, input().split(\":\"))\r\nt_hour, t_minute = map(int, input().split(\":\"))\r\n\r\nif s_minute < t_minute:\r\n s_minute = 60 + s_minute - t_minute\r\n if s_hour == 0:\r\n s_hour = 23\r\n else:\r\n s_hour -= 1\r\nelse:\r\n s_minute -= t_minute\r\n\r\nif s_hour < t_hour:\r\n s_hour = 24 + s_hour - t_hour\r\n\r\nelse:\r\n s_hour -= t_hour\r\n\r\ntime =(2 - len(str(s_hour)))*\"0\" + str(s_hour) + \":\" + (2 - len(str(s_minute)))*\"0\" + str(s_minute)\r\nprint(time)\r\n", "s = str(input())\r\nt = str(input())\r\n\r\nc = int(s[0:2])*60 + int(s[3:5]) - int(t[0:2])*60 - int(t[3:5])\r\nif(c<0):\r\n c += 1440\r\nhours = c//60\r\nminutes = c%60\r\n\r\nif(hours<10):\r\n p = '0' + str(hours) + ':'\r\nelse:\r\n p = str(hours) + ':'\r\n\r\nif(minutes<10):\r\n p = p + '0' + str(minutes)\r\nelse:\r\n p = p + str(minutes)\r\nprint(p)", "t = input()\r\nT = t.split(\":\")\r\nHT = int(T[0])\r\nMT = int(T[1])\r\ns = input()\r\nS = s.split(\":\")\r\nHS = int(S[0])\r\nMS = int(S[1])\r\nMR = MT - MS\r\nif(MR<0):\r\n MR+=60\r\n HT-=1\r\nHR = HT - HS\r\nif(HR<0):\r\n HR+=24\r\nif(HR<10):\r\n h=\"0\"+str(HR)\r\nelse:\r\n h=str(HR)\r\nif(MR<10):\r\n m=\"0\"+str(MR)\r\nelse:\r\n m=str(MR)\r\nprint(h+\":\"+m)", "a = input().split(':')\r\nb = input().split(':')\r\n\r\n\r\n\r\nx = int(a[0]) * 60 + int(a[1])\r\ny = int(b[0]) * 60 + int(b[1])\r\n\r\n\r\nif y>x: x = ((int(a[0])+24) * 60 ) + int(a[1])\r\n\r\n\r\nz = x - y\r\n\r\nhr = str(z // 60).rjust(2 , '0')\r\nz %=60\r\nmi = str(z).rjust(2 , '0')\r\n\r\nprint(f\"{hr}:{mi}\")\r\n\r\n", "H1, M1 = list(map(int, input().split(':')))\r\nH2, M2 = list(map(int, input().split(':')))\r\nMin1, Min2 = H1 * 60 + M1, H2 * 60 + M2\r\nResult = (Min1 - Min2 if Min1 - Min2 >= 0 else Min1 - Min2 + 1440)\r\nprint(Result // 60 if len(str(Result // 60)) == 2 else '0' + str(Result // 60), end=\":\")\r\nprint(Result % 60 if len(str(Result % 60)) == 2 else '0' + str(Result % 60))\r\n", "'''input\n00:01\n00:00\n'''\ns, t = list(map(int, input().split(\":\"))), list(map(int, input().split(\":\")))\na, b, c, d = s[0], s[1], t[0], t[1]\nx = []\nif b >= d:\n\tx.append(str(b-d).zfill(2))\nelse:\n\tx.append(str((b-d) % 60).zfill(2))\n\ta -= 1\nx.insert(0, str((a-c) % 24).zfill(2))\nprint(\":\".join(x))\n\n\n\n\n\n\n\n", "s = input()\r\nt = input()\r\n\r\nhs = int(s[:2])\r\nms = int(s[3:5])\r\nht = int(t[:2])\r\nmt = int(t[3:5])\r\n\r\nhr = 0\r\nmr = 0\r\nif hs < ht:\r\n hr = 24 - abs(hs - ht)\r\nelse:\r\n hr = hs - ht\r\n\r\nif ms < mt:\r\n mr = 60 - abs(ms - mt)\r\n hr = hr - 1 if hr > 0 else 23\r\nelse:\r\n mr = ms - mt\r\n\r\nprint(str(hr).zfill(2) + ':' + str(mr).zfill(2))", "\r\ns = list(map(int, input().split(':')))\r\nt = list(map(int, input().split(':')))\r\n\r\ntime_to_bed = [s[0] - t[0], s[1] - t[1]]\r\n\r\nif time_to_bed[1] < 0:\r\n\ttime_to_bed[1] += 60\r\n\ttime_to_bed[0] += -1\r\n\r\nif time_to_bed[0] < 0:\r\n\ttime_to_bed[0] += 24\r\n\r\nif time_to_bed[0] // 10 == 0:\r\n\ttime_to_bed[0] = '0' + str(time_to_bed[0])\r\nif time_to_bed[1] // 10 == 0:\r\n\ttime_to_bed[1] = '0' + str(time_to_bed[1])\r\n\r\nprint(*time_to_bed, sep = ':')\r\n", "#Program George and Sleep\n\ndef main():\n wake = input()\n sleep = input()\n time1 = [int(sleep[:2]),int(sleep[3:])]\n time2 = [int(wake[:2]),int(wake[3:])]\n if time2[0] > time1[0]:\n total = time2[0]-time1[0],time2[1]-time1[1]\n if total[1]<0:\n total = total[0]-1,60+total[1]\n elif time2[0] == time1[0]:\n total = time2[0]-time1[0],time2[1]-time1[1]\n if total[1]<0:\n total = 23,60+total[1]\n elif time2[0] < time1[0]:\n total = 24+(time2[0]-time1[0]),time2[1]-time1[1]\n if total[1]<0:\n total = total[0]-1,60+total[1]\n output = []\n for x in range(len(total)):\n if total[x]<10:\n output.append(\"0\"+str(total[x]))\n else:\n output.append(str(total[x]))\n print(\"{}:{}\".format(output[0],output[1]))\nmain()\n \t\t \t\t\t \t \t \t \t \t \t \t \t", "h, m = [int(x) for x in input().split(':')]\r\nh_del, m_del = [int(x) for x in input().split(':')]\r\n\r\nif m - m_del < 0:\r\n h = (h - 1) % 24\r\nm = (m - m_del) % 60\r\nh = (h - h_del) % 24\r\n\r\nm = str(m)\r\nh = str(h)\r\n\r\nif len(m) == 1:\r\n m = '0' + m\r\nif len(h) == 1:\r\n h = '0' + h\r\n\r\nprint(h + ':' + m)\r\n", "# LUOGU_RID: 92907907\ntime_1 = input().split(\":\")\r\ntime_2 = input().split(\":\")\r\na1, b1 = int(time_1[0]), int(time_1[1])\r\na2, b2 = int(time_2[0]), int(time_2[1])\r\nc1 = a1*60 + b1\r\nc2 = a2*60 + b2\r\nif c1 < c2:\r\n c1 += 1440\r\nd = c1 - c2\r\ne1 = d//60\r\ne2 = d%60\r\nprint(\"{:02}:{:02}\".format(e1, e2))\r\n", "a,b=map(int,input().split(\":\"))\r\nc,d=map(int,input().split(\":\"))\r\ne=a*60+b\r\nf=c*60+d\r\nj=e-f\r\nif(j<0):\r\n j=24*60+j\r\nj1=str(j//60)\r\nj2=str(j%60)\r\nif(len(j1)==1):\r\n j1=\"0\"+j1\r\nif(len(j2)==1):\r\n j2=\"0\"+j2\r\nres=j1+\":\"+j2\r\nprint(res)", "'''\r\nCreated on Jun 4, 2014\r\n\r\n@author: Nathaniel\r\n'''\r\nend = input().split(':')\r\nstart = input().split(':')\r\nstartmin = int(start[0])\r\nendmin = int(end[0])\r\nstartsec = int(start[1])\r\nendsec = int(end[1])\r\n\r\nsecdiff = endsec-startsec\r\nmindiff = endmin-startmin\r\nif secdiff<0:\r\n secdiff+=60\r\n mindiff-=1\r\nif mindiff<0:\r\n mindiff+=24\r\n\r\nprint (('0' if mindiff < 10 else '') + str(mindiff) +':'+ ('0' if secdiff<10 else '') + str(secdiff))\r\n", "a,b,c,d=map(int,(input()+\":\"+input()).split(\":\"))\r\nx=(1440+(a-c)*60+b-d)%1440\r\ng=lambda x:\"0\"*(2-len(x))+x\r\nprint(g(str(x//60))+\":\"+g(str(x%60)))", "s=[int(x) for x in input().split(\":\")]\r\nd=[int(x) for x in input().split(\":\")]\r\nif s[1]<d[1]:\r\n s[0]-=1\r\n s[1]+=60\r\nif s[0]<d[0]:\r\n s[0]+=24\r\nif s[0]-d[0]<10:\r\n print(\"0\",end='')\r\nprint(\"{0}:\".format(s[0]-d[0]),end='')\r\nif s[1]-d[1]<10:\r\n print(\"0\",end='')\r\nprint(\"{0}\".format(s[1]-d[1]),end='')\r\n", "s = input()\r\nt = input()\r\nt2 = int(t[0:2]) * 60 + int(t[3:])\r\ns2 = int(s[0:2]) * 60 + int(s[3:])\r\nx = 1440\r\nif t2 > s2:\r\n\tx += s2 - t2\r\nelse:\r\n\tx = s2 - t2\r\nh1 = x // 60\r\nm1 = x % 60\r\nh = str(h1)\r\nm = str(m1)\r\nif h1 < 10:\r\n\th = \"0\" + str(h1)\r\nif m1 < 10:\r\n\tm = \"0\" + str(m1)\r\nprint(h+\":\"+m)", "s = list(map(int, input().split(\":\")))\r\nt = list(map(int, input().split(\":\")))\r\n\r\nms = s[0] * 60 + s[1]\r\nmt = t[0] * 60 + t[1]\r\n\r\nif ms >= mt:\r\n h, m = divmod(ms - mt, 60)\r\n print(f\"{h:02}:{m:02}\")\r\nelse:\r\n h, m = divmod(ms + 24 * 60 - mt, 60)\r\n print(f\"{h:02}:{m:02}\")\r\n", "sh,sm = map(int,input().split(\":\"))\r\nts,tm = map(int,input().split(\":\"))\r\nrm = sm - tm\r\nif rm<0:\r\n rm+=60\r\n ts+=1\r\nrh = (sh - ts + 24)%24\r\nprint(\"%02d:%02d\" % (rh,rm))\r\n", "fir = input().split(':')\r\nsec = input().split(':')\r\n\r\nah = int(fir[0])\r\nam = int(fir[1])\r\nbh = int(sec[0])\r\nbm = int(sec[1])\r\n\r\nif(ah < bh or (ah == bh and am < bm)):\r\n ah += 24\r\nah -= bh\r\nam -= bm\r\nif(am < 0):\r\n ah -= 1\r\n am+= 60\r\nprint('%02d:%02d'%(ah,am))", "s=list(map(int,input().split(\":\")))\r\nt=list(map(int,input().split(\":\")))\r\nif s[-1]>=t[-1]:\r\n mm=str(s[-1]-t[-1])\r\nelse:\r\n mm=str(s[-1]+60-t[-1])\r\n s[0]=s[0]-1\r\nhh=s[0]-t[0]\r\nif hh<0:\r\n hh=24+hh\r\nhh=str(hh)\r\nif len(hh)<2:\r\n hh=\"0\"+hh\r\nif len(mm)<2:\r\n mm=\"0\"+mm\r\nrs=hh+\":\"+mm\r\nprint(rs)", "a,b=map(int,input().split(':'))\r\nc,d=map(int,input().split(':'))\r\na*=60\r\nc*=60\r\nris=a+b-c-d\r\nif ris<0:ris=1440+ris\r\nprint('0'*(2-len(str(ris//60)))+str(ris//60)+':'+'0'*(2-len(str(ris%60)))+str(ris%60))", "current = input()\r\nsleep = input()\r\n\r\nhour_current = current[:current.index(':')]\r\nmin_current = current[current.index(':')+1:]\r\n\r\nhour_sleep = sleep[:sleep.index(':')]\r\nmin_sleep = sleep[sleep.index(':')+1:]\r\nx=0\r\ncurrent_in_min = int(hour_current)*60 + int(min_current)\r\nsleep_in_min = int(hour_sleep)*60 + int(min_sleep)\r\n\r\nbed_time = current_in_min - sleep_in_min\r\nif bed_time < 0 :\r\n bed_time = 24*60 + bed_time\r\n out_hour = bed_time // 60\r\n out_min = bed_time % 60\r\nelse:\r\n out_hour = bed_time // 60\r\n out_min = bed_time % 60\r\nif out_hour < 10 :\r\n out_hour = \"0\"+str(out_hour)\r\nif out_min < 10 :\r\n out_min = \"0\" + str(out_min)\r\nprint(str(out_hour) + \":\" + str(out_min))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 11 12:10:04 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nsh,sm = tuple(map(int,input().split(':')))\r\nth,tm = tuple(map(int,input().split(':')))\r\n\r\nh,m=0,0\r\n\r\nif tm>sm:\r\n m = sm-tm+60\r\n h = -1\r\nelse:\r\n m = sm-tm\r\n\r\nh += sh - th\r\n\r\nif h<0:\r\n h=24+h\r\n\r\nh = str(h)\r\nm = str(m)\r\n\r\nif len(h)==1:\r\n h = '0'+h\r\nif len(m)==1:\r\n m = '0'+m\r\nprint(f'{h}:{m}')\r\n", "wake_up_time = input().split(':')\r\nsleep_duration = input().split(':')\r\n\r\nwake_up_time = 60 * int(wake_up_time[0]) + int(wake_up_time[1])\r\nsleep_duration = 60 * int(sleep_duration[0]) + int(sleep_duration[1])\r\n\r\nbed_time = wake_up_time - sleep_duration\r\n\r\nif bed_time < 0:\r\n bed_time += 24 * 60\r\n\r\nprint('{:0>2d}:{:0>2d}'.format(*divmod(bed_time, 60)))\r\n\r\n", "t1=input().split(':')\r\nt2=input().split(':')\r\nh1=int(t1[0])\r\nm1=int(t1[1])\r\nh2=int(t2[0])\r\nm2=int(t2[1])\r\nif(h1<h2 or(h1==h2 and m1<m2)):\r\n h1+=24\r\nh1=h1-h2\r\nm1=m1-m2\r\nif(m1<0):\r\n h1-=1\r\n m1+=60\r\nprint('%02d:%02d'%(h1,m1))", "current_time = input()\ntime_duration = input()\n\ncurrent_time_min = int(current_time[:2]) * 60 + int(current_time[3:])\ntime_duration_min = int(time_duration[:2]) * 60 + int(time_duration[3:])\nt_min = current_time_min - time_duration_min\n\nif current_time_min < time_duration_min:\n t_min = 24 * 60 - abs(t_min)\n\nhour = \"0\" + str(t_min // 60) if t_min // 60 < 10 else str(t_min // 60)\nminute = \"0\" + str(t_min % 60) if t_min % 60 < 10 else str(t_min % 60)\nprint(f\"{hour}:{minute}\")\n", "jam,menit=map(int,input().split(':'))\nlamajam,lamamenit=map(int,input().split(':'))\na=jam-lamajam\nb=menit-lamamenit\nif b<0: a-=1\na=a%24\nb=b%60\nif a<10:\n\ta='0'+str(a)\nif b<10:\n\tb='0'+str(b)\nprint(str(a)+':'+str(b))\n\t \t \t \t\t \t\t\t \t\t\t\t\t\t \t\t\t \t", "hours,minutes=map(int,input().split(\":\"))\r\nhour,minute=map(int,input().split(\":\"))\r\n\r\nhours,minutes = hours-hour,minutes-minute\r\n\r\n\r\nhours,minutes = (hours+minutes//60)%24 , minutes%60\r\n\r\n\r\nprint(f\"{hours:02}:{minutes:02}\")", "s = list(map(int,input().split(':')))\r\ns = (24+s[0])*60+s[1]\r\nt = list(map(int,input().split(':')))\r\nt = t[0]*60+t[1]\r\np = (s - t) % (24 * 60)\r\np = '{:02}:{:02}'.format(p//60, p % 60)\r\nprint(p)\r\n", "h,m = [int(x) for x in input().split(\":\")]\r\nhdiff, mdiff = [int(x) for x in input().split(\":\")]\r\n\r\nm1=m-mdiff\r\nh1=h-hdiff\r\nif m1<0:\r\n m1=60+m1\r\n h1=h1-1\r\nif h1<0:\r\n h1=24+h1\r\nh1=str(h1)\r\nm1=str(m1)\r\nprint(h1.zfill(2)+\":\"+m1.zfill(2))", "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\nconvert minutes; if overflow add to hours mod 60\r\nconvert hours; if overflow mod 24\r\n'''\r\n\r\ndef solve():\r\n sh, sm = I().split(':')\r\n th, tm = I().split(':')\r\n sh = int(sh)\r\n sm = int(sm)\r\n th = int(th)\r\n tm = int(tm)\r\n\r\n if sh < th or (sh == th and sm < tm):\r\n sh += 24\r\n \r\n if sm < tm:\r\n sm += 60\r\n sh -= 1\r\n \r\n ph = sh - th\r\n pm = sm - tm\r\n\r\n print(\"{:02d}\".format(ph) +':'+ \"{:02d}\".format(pm))\r\n\r\nsolve()", "s=input().strip()\r\np=input().strip()\r\nans=int(s[:2])*60+int(s[3:])-int(p[:2])*60-int(p[3:])\r\nans=ans%1440\r\nt=('0' if ans//60<10 else '') + str(ans//60) + ':' + ('0' if ans%60<10 else '')+str(ans%60)\r\nprint(t)", "s,t=input(),input()\r\nh1=int(s[0:2])\r\nh2=int(t[0:2])\r\nm1=int(s[3:])\r\nm2=int(t[3:])\r\nm3=m1-m2\r\nif(m3<0):\r\n m3=60+m1-m2\r\n h3=h1-h2-1\r\n if(h3<0):\r\n h3=24+h3\r\nelse:\r\n h3=h1-h2\r\n if(h3<0):\r\n h3+=24\r\nif(h3<10 and m3<10):\r\n print('0',h3,':','0',m3,sep=\"\")\r\nelif(h3>=10 and m3<10):\r\n print(h3,':','0',m3,sep=\"\")\r\nelif(h3<10 and m3>=10):\r\n print('0',h3,':',m3,sep=\"\")\r\nelse:\r\n print(h3,':',m3,sep=\"\")", "h1, m1 = map(int, input().split(':'))\nh2, m2 = map(int, input().split(':'))\nt = h1 * 60 + m1 - h2 * 60 - m2\nh = t // 60\nh %= 24\nm = t % 60\nprint(str(h // 10) + str(h % 10) + ':' + str(m // 10) + str(m % 10))", "s=input()\r\n\r\nwh=int(s[0]+s[1])\r\nwm=int(s[3]+s[4])\r\n\r\ns=input()\r\n\r\nth=int(s[0]+s[1])\r\ntm=int(s[3]+s[4])\r\n\r\ntm+=th*60\r\n\r\nwm+=wh*60\r\n\r\nwm-=tm\r\nif(wm<0):\r\n wm=1440+wm\r\nansh=str(wm//60)\r\nansm=str(wm%60)\r\nif(len(ansh)<2):\r\n ansh='0'+ansh\r\nif(len(ansm)<2):\r\n ansm='0'+ansm\r\nprint(ansh+\":\"+ansm)\r\n", "sh, sm = map(int, input().split(\":\"))\r\nth, tm = map(int, input().split(\":\"))\r\n\r\nh, m = sh - th, sm - tm\r\nh, m = (h + m // 60) % 24, m % 60\r\nprint(str(h).rjust(2, \"0\") + \":\" + str(m).rjust(2, \"0\"))", "string = input()\r\ntime = string.split(\":\")\r\na, b = int(time[0]), int(time[1])\r\nstring = input()\r\ntime = string.split(\":\")\r\nh, m = int(time[0]), int(time[1])\r\nx = a * 60 + b\r\ny = h * 60 + m\r\nif x < y:\r\n x += 1440\r\nt = x - y\r\ntemp = t // 60 % 24\r\np = str(temp)\r\nif temp < 10:\r\n p = \"0\" + p\r\ntemp = t % 60\r\nq = str(temp)\r\nif temp < 10:\r\n q = \"0\" + q\r\nprint(\"%s:%s\" % (p, q))", "s = input()\r\nt = input()\r\n\r\ns_hours, s_minutes = map(int, s.split(\":\"))\r\nt_hours, t_minutes = map(int, t.split(\":\"))\r\n\r\nhours = s_hours - t_hours\r\nminutes = s_minutes - t_minutes\r\n\r\nif minutes < 0:\r\n minutes += 60\r\n hours -= 1\r\n\r\nhours = (hours + 24) % 24\r\n\r\ntime_formatted = f\"{hours:02d}:{minutes:02d}\"\r\nprint(time_formatted)\r\n", "a,b=map(int,input().split(':'));c,d=map(int,input().split(':'));x,y=0,0\r\nif b>=d:y=b-d\r\nelse:a-=1;y=60-d+b\r\nif (a-c)<0:x=24+a-c\r\nelse:x=a-c\r\nx,y=str(x),str(y)\r\nprint('0'*abs(len(x)-2)+x+':'+'0'*abs(len(y)-2)+y)", "t1 = list(map(int, input().split(':')))\r\nt2 = list(map(int, input().split(':')))\r\nt1[0] -= t2[0]\r\nt1[1] -= t2[1]\r\nif t1[1] < 0:\r\n t1[0] -= 1\r\n t1[1] += 60\r\nif t1[0] < 0:\r\n t1[0] += 24\r\nprint(\"%02d:%02d\" % (t1[0], t1[1]))", "h1, m1 = map(int, input().split(':'))\r\nh2, m2 = map(int, input().split(':'))\r\nt = (1440 + 60 * (h1 - h2) + m1 - m2) % 1440\r\nprint(f'{t // 60:02}:{t % 60:02}')", "hw, mw = map(int, input().split(':'))\r\nhs, ms = map(int, input().split(':'))\r\n\r\nw = hw * 60 + mw\r\ns = hs * 60 + ms\r\nb = (w - s) % 1440\r\n\r\nhb = int(b / 60)\r\nmb = int(b % 60)\r\n\r\nrhb = str(100+hb)\r\nrmb = str(100+mb)\r\n\r\nprint(rhb[-2:], end=\":\")\r\nprint(rmb[-2:])", "def ui(a):\r\n a = str(a)\r\n return '0'*(2-len(a))+a\r\na,b = map(int,input().split(':'))\r\nc,d = map(int,input().split(':'))\r\nt1 = 60*a+b\r\nt2 = 60*c+d\r\nif t1>=t2:\r\n dt = t1-t2\r\nelse:\r\n dt = 1440-t2+t1\r\nprint(ui(dt//60),':',ui(dt%60),sep='')", "s = input()\r\na = int(s[0:2]) * 60 + int(s[3:5])\r\ns = input()\r\nb = int(s[0:2]) * 60 + int(s[3:5])\r\nc = (a - b + (60 * 24)) % (60 * 24)\r\nprint(c // 60 // 10, c // 60 % 10, sep='', end=':')\r\nprint(c % 60 // 10, c % 60 % 10, sep='')", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(map(int, input()[:-1].split(':')))\r\nt = list(map(int, input()[:-1].split(':')))\r\n\r\na, b = s[0] - t[0], s[1] - t[1]\r\nif b < 0:\r\n b += 60\r\n a -= 1\r\n\r\nif a < 0:\r\n a += 24\r\n\r\nif 0 <= a < 10:\r\n a = '0' + str(a)\r\nelse:\r\n a = str(a)\r\n\r\nif 0 <= b < 10:\r\n b = '0' + str(b)\r\nelse:\r\n b = str(b)\r\nprint(a + ':' + b)\r\n", "class Time:\n\tdef __init__(self, hh, mm):\n\t\tself.h = hh\n\t\tself.m = mm\n\t\n\tdef __sub__(self, other):\n\t\tres_h = (self.h-other.h) % 24\n\t\tres_m = (self.m-other.m) % 60\n\t\tif self.m-other.m < 0:\n\t\t\tres_h = (res_h-1) % 24\n\t\treturn Time(res_h, res_m)\n\t\n\tdef __str__(self):\n\t\treturn '{}:{}'.format(str(self.h).zfill(2), str(self.m).zfill(2))\n\ncur_time = Time(*list(map(int, input().split(':'))))\nsleep_time = Time(*list(map(int, input().split(':'))))\nprint(cur_time-sleep_time)\n", "a = list(input().split(':'))\r\ns = int(a[0]) * 60 + int(a[1])\r\na = list(input().split(':'))\r\nt = int(a[0]) * 60 + int(a[1])\r\nres = (24 * 60 + s - t)%(24*60)\r\nh = res//60\r\nm = res%60\r\nans = \"\"\r\nif h < 10:\r\n ans += \"0\"\r\nans+= str(h)\r\nans+= \":\"\r\nif m < 10:\r\n ans += \"0\"\r\nans+= str(m)\r\nprint(ans)\r\n", "s = [*map(int, input().split(':'))]\r\nt = [*map(int, input().split(':'))]\r\ns[0] = [s[0], 24][s[0] == 0]\r\nz = s[0] * 60 + s[1] - (t[0] * 60 + t[1])\r\nprint('{:02}:{:02}'.format((z // 60) % 24, z % 60))", "from datetime import datetime, date, time, timedelta\r\n\r\ndef hours_minutes(td):\r\n return td.seconds//3600, (td.seconds//60)%60\r\n\r\nstrdtupper = input().split(':')\r\nstrdtsleep = input().split(':')\r\n\r\ndtup = time(int(strdtupper[0]),int(strdtupper[1]))\r\ndtsleep = time(int(strdtsleep[0]),int(strdtsleep[1]))\r\n\r\nanswerdate = timedelta(minutes = dtup.minute, hours = dtup.hour) - timedelta(minutes = dtsleep.minute, hours = dtsleep.hour)\r\n\r\ndateZ = hours_minutes(answerdate)\r\n\r\nprint('{}:{}'.format((lambda x:'0{}'.format(x) if x//10 <= 0 else x)(dateZ[0]),(lambda x:'0{}'.format(x) if x//10 <= 0 else x)(dateZ[1])))", "\r\ns = [int(x) for x in input().split(':')]\r\n\r\nt = [int(x) for x in input().split(':')]\r\n\r\ns = s[0] * 60 +s[1]\r\nt = t[0] * 60 + t[1]\r\n\r\ns -= t\r\nif s < 0 :\r\n s += 24 * 60\r\n\r\nprint('{:02d}:{:02d}'.format(s//60 , s % 60))\r\n\r\n\r\n\r\n\r\n", "s, t = map(lambda x: int(x[0]) * 60 + int(x[1]), (input().split(\":\") for i in \"''\"))\r\nprint('{:02}:{:02}'.format((24 + (s - t) // 60) % 24, (s - t) % 60))", "s = list(map(int, input().split(\":\")))\r\nt = list(map(int, input().split(\":\")))\r\n\r\ndiff = []\r\n\r\nif t[-1] > s[-1]:\r\n diff.append(s[-1] + 60 - t[-1])\r\n diff.append(s[0] - t[0] - 1)\r\nelse:\r\n diff.append(s[-1] - t[-1])\r\n diff.append(s[0] - t[0]) \r\n\r\nif diff[-1] < 0:\r\n diff[-1] += 24\r\n \r\nprint(\":\".join([\"0\" + i if len(i) == 1 else i for i in map(str, diff[:: -1])]))", "h1, m1 = list(map(int, input().split(':')))\r\nh2, m2 = list(map(int, input().split(':')))\r\nif (m2 > m1):\r\n\tm1 += 60\r\n\th1 -= 1\r\nh1 -= h2\r\nm1 -= m2\r\nif (h1 < 0):\r\n\th1 += 24\r\nh = ''\r\nm = ''\r\nif (h1 < 10):\r\n\th = '0'\r\nh += str(h1)\r\nif (m1 < 10):\r\n\tm = '0'\r\nm += str(m1)\r\nprint(h, m, sep = ':', end = '\\n')\r\n", "# https://codeforces.com/problemset/problem/387/A\n# 900\n\nch, cm = map(int, input().split(\":\"))\nsh, sm = map(int, input().split(\":\"))\n\nm = cm - sm\nif m < 0:\n sh += 1\n m = 60 + m\n\n\nh = ch - sh\nif h < 0:\n h = 24 + h\n\nprint(f\"{h:02}:{m:02}\")", "a,b=input().split(':'),input().split(':')\nd=(int(a[1])-int(b[1]))%60\nif a[1]<b[1]:\n\tif a[0] <= b[0]:\n\t\tc=(int(a[0])-int(b[0])-1)%24\n\telse:\n\t\tc=int(a[0])-int(b[0])-1\nelse:\n\tif a[0]<b[0]:\n\t\tc=(int(a[0])-int(b[0]))%24\n\telse:\n\t\tc=int(a[0])-int(b[0])\n\nif c<10:\n\tc='0'+str(c)\nif d<10:\n\td='0'+str(d)\nprint('{}:{}'.format(c,d))\n\n \t \t \t\t\t\t \t\t\t\t\t\t\t\t \t", "sh, sm = map(int, input().split(':'))\r\nth, tm = map(int, input().split(':'))\r\nsh -= th\r\nsm -= tm\r\nif sm < 0:\r\n sm += 60\r\n sh -= 1\r\nif sh < 0:\r\n sh += 24\r\nprint(str(sh).zfill(2) + ':' + str(sm).zfill(2))", "l1 = [int(x) for x in input().split(\":\")]\r\nfinalh,finalm = l1[0], l1[1]\r\nl2 = [int(x) for x in input().split(\":\")]\r\ndiffh, diffm = l2[0], l2[1]\r\nfinalsum = finalh*60+finalm\r\ndiffsum = diffh*60+diffm\r\n#print(finalsum,diffsum)\r\nk = (finalsum-diffsum)%(24*60)\r\n\r\nhour = int(k/60)\r\nminute = k%60\r\nif hour ==0:\r\n hour = \"00\"\r\nelif hour <10:\r\n hour = \"0\"+str(hour)\r\nelse:\r\n hour = str(hour)\r\nif minute ==0:\r\n minute = \"00\"\r\nelif minute <10:\r\n minute = \"0\"+str(minute)\r\nelse:\r\n minute = str(minute)\r\nprint(hour+\":\"+minute)\r\n", "s = str(input())\r\nh = int(s.split(\":\")[0])\r\nm = int(s.split(\":\")[1])\r\nt = str(input())\r\nh1 = int(t.split(\":\")[0])\r\nm1 = int(t.split(\":\")[1])\r\nans_h=0\r\nans_m=0\r\nif m>=m1:\r\n ans_m = m - m1\r\nelse:\r\n ans_m = m+60 - m1\r\n if h!=0:\r\n h = h-1\r\n else:\r\n h = 23\r\nif h>=h1:\r\n ans_h = h-h1\r\nelse:\r\n ans_h = h + 24 - h1\r\nans_h = str(ans_h)\r\nans_m = str(ans_m)\r\nif len(ans_m)==1:\r\n ans_m = '0'+ans_m\r\nif len(ans_h)==1:\r\n ans_h = '0' + ans_h\r\nprint(ans_h+\":\"+ans_m)", "import os\r\nline_number = 1\r\ncurrent_working_dir = os.getcwd()\r\nmy_local_machine = current_working_dir.find('rachel')\r\n# print(my_local_machine)\r\n\r\ndef myinput():\r\n global line_number, lines, my_local_machine\r\n if line_number == 1:\r\n lines = lines.split('\\n')\r\n\r\n # print(len(lines))\r\n if my_local_machine > 0:\r\n line = lines[line_number]\r\n else:\r\n line = input()\r\n \r\n line_number += 1\r\n return(line)\r\n\r\nlines = '''\r\n00:00\r\n01:00\r\n'''\r\nimport datetime \r\n\r\nstart = myinput() \r\nl = myinput() \r\nstart_hour = int(start[0:2])\r\nstart_minute = int(start[3:])\r\nlength = int(l[0:2]) * 60 + int(l[3:])\r\n\r\nstart = datetime.datetime(100, 1, 1, start_hour, start_minute, 0)\r\nend = start - datetime.timedelta(minutes=length)\r\nresult = str(end.time())\r\nprint(result[:5])", "def get(s):\r\n return int(s[:2]) * 60 + int(s[3:5])\r\ndef disp(s):\r\n s = str(s)\r\n if len(s) == 1:\r\n s = '0' + s\r\n print(end = s)\r\nm1 = get(str(input()))\r\nm2 = get(str(input()))\r\nwhile m2 > 0:\r\n m1 -= 1\r\n if m1 == -1:\r\n m1 = 1439\r\n m2 -= 1\r\ndisp(int(m1 / 60))\r\nprint(end = ':')\r\ndisp(m1 % 60)\r\n", "def minutes(x, y):\r\n return x * 60 + y\r\n\r\n\r\na, b = map(int, input().split(':'))\r\nc, d = map(int, input().split(':'))\r\ndelta_time = minutes(a, b) - minutes(c, d)\r\nif delta_time < 0:\r\n delta_time += 24 * 60\r\nprint(\"%02d:%02d\" % (delta_time // 60, delta_time % 60))\r\n", "s1=input()\r\ns2=input()\r\nb=int(s1[3:5])\r\nd=int(s2[3:5])\r\na=int(s1[0:2])\r\nc=int(s2[0:2])\r\ny=0\r\nx=0\r\nif(b-d<0):\r\n y=60+b-d\r\n a=a-1\r\nelse:\r\n y=b-d\r\nif(a-c<0):\r\n x=24+a-c\r\nelse:\r\n x=a-c\r\nk=''\r\nif(x<10):\r\n k=k+'0'+str(x)\r\nelse:\r\n k=k+str(x)\r\nk=k+':'\r\nif(y<10):\r\n k=k+'0'+str(y)\r\nelse:\r\n k=k+str(y)\r\nprint(k)", "s = list(map(int, input().split(':')))\nt = list(map(int, input().split(':')))\n\nm = s[1] - t[1]\nif m < 0:\n s[0] -= 1\n m += 60\nh = s[0] - t[0]\nif h < 0:\n h += 24\nprint(str(h).zfill(2) + \":\" + str(m).zfill(2))\n", "h=[]\r\nm=[]\r\n\r\nfor _ in range(2):\r\n x,y = list(map(int, input().split(':')))\r\n h.append(x)\r\n m.append(y)\r\n \r\nh[0]=h[0]-h[1]\r\nm[0]=m[0]-m[1]\r\n\r\nif m[0]<0:\r\n h[0]-=1\r\n m[0]+=60\r\n \r\nif h[0]<0:\r\n h[0]+=24\r\n \r\nif h[0]>=0 and h[0]<=9:\r\n h[0]='0'+str(h[0])\r\n \r\nif m[0]>=0 and m[0]<=9:\r\n m[0]='0'+str(m[0])\r\n \r\nprint(f\"{h[0]}:{m[0]}\")", "h,m = map(int, input().split(':'))\r\nh1, m1 = map(int, input().split(':'))\r\na = h*60+m-h1*60-m1\r\na += 1440*(a<0)\r\nprint(f'{\"0\"*(a//60<10)}{a//60}:{\"0\"*(a%60<10)}{a%60}')\r\n", "s = input().split(':')\r\np = input().split(':')\r\n\r\nh1, m1 = int(s[0]), int(s[1])\r\nh2, m2 = int(p[0]), int(p[1])\r\n\r\nm3 = m1 - m2\r\nh3 = h1 - h2\r\n\r\nif m3 < 0:\r\n h3 -= 1\r\n m3 += 60\r\n\r\nif h3 < 0:\r\n h3 += 24\r\n\r\nif h3 < 10:\r\n h3 = '0' + str(h3)\r\nelse:\r\n h3 = str(h3)\r\nif m3 < 10:\r\n m3 = '0' + str(m3)\r\nelse:\r\n m3 = str(m3)\r\n\r\nprint(h3 + ':' + m3)\r\n", "s = list(map(int, input().split(':')))\r\nt = list(map(int, input().split(':')))\r\n\r\nhours_diff = s[0] - t[0]\r\nminutes_diff = s[1] - t[1]\r\n\r\nif minutes_diff < 0:\r\n hours_diff -= 1\r\n minutes_diff += 60\r\n\r\nhours_diff = (hours_diff + 24) % 24\r\np = f'{hours_diff:02d}:{minutes_diff:02d}'\r\n\r\nprint(p)", "time1 = list(map(int, input().split(':')))\r\ntime2 = list(map(int, input().split(':')))\r\noutput = []\r\nif time1[1] - time2[1] < 0:\r\n output.append(time1[1] - time2[1]+60)\r\n time1[0] -= 1\r\nelse:\r\n output.append(time1[1] - time2[1])\r\n\r\nif time1[0] - time2[0] < 0:\r\n output.append(time1[0] - time2[0]+24)\r\nelse:\r\n output.append(time1[0] - time2[0])\r\n\r\nif int(output[0])<10:\r\n output[0] = '0' + str(output[0])\r\n\r\nif int(output[1]) < 10:\r\n output[1] = '0' + str(output[1])\r\n\r\nprint(str(output[1]) + ':' + str(output[0]))", "s=input()\r\nt=input()\r\nh0=int(s[:2])\r\nh1=int(t[:2])\r\nm0=int(s[3:])\r\nm1=int(t[3:])\r\nhp=h0-h1\r\nmp=m0-m1\r\nif mp<0:\r\n mp+=60\r\n hp-=1\r\nif hp<0:\r\n hp+=24\r\nprint(\"%02d:%02d\" % (hp,mp))\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"George and Sleep\"\r\n# Class: A\r\n\r\nimport sys\r\n\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef printf(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n s = list(map(int, input().split(\":\")))\r\n t = list(map(int, input().split(\":\")))\r\n s = s[0]*60+s[1]\r\n t = t[0]*60+t[1]\r\n print(str((s-t)//60+24*((s-t)//60<0)).zfill(2)+\":\"+str((s-t)%60).zfill(2))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for t in range(int(input())):\r\n Solve()", "sh, sm = map(int, input().split(':'))\r\nth, tm = map(int, input().split(':'))\r\ntotal = (sh * 60 + sm + 24 * 60 - (th * 60 + tm)) % (24 * 60)\r\nprint(\"{:>02d}:{:>02d}\".format(total//60, total % 60))", "from datetime import datetime, timedelta, time\r\n\r\nnow = datetime.strptime(input(), '%H:%M')\r\ntd = datetime.strptime(input(), '%H:%M')\r\nh = (now - td).seconds // 3600\r\nm = (now -td).seconds // 60 % 60\r\ns = time (h,m)\r\nprint(s.strftime('%H:%M'))", "s=input()\r\nt=input()\r\na,b,res=int(s[0:2])*60+int(s[3:]),int(t[0:2])*60+int(t[3:]),0\r\nif a<b:\r\n res=1440+a-b\r\nelse:\r\n res=a-b\r\ns1=res//60\r\ns2=res-s1*60\r\nans=''\r\nif s1<10:\r\n ans+='0'+str(s1)\r\nelse:\r\n ans+=str(s1)\r\nans+=':'\r\nif s2<10:\r\n ans+='0'+str(s2)\r\nelse:\r\n ans+=str(s2)\r\nprint(ans)", "fir = input().split(':') #输入并分割\nsec = input().split(':') #输入并分割\n\nah = int(fir[0]) #转换\nam = int(fir[1]) #转换\nbh = int(sec[0]) #转换\nbm = int(sec[1]) #转换\n\nif(ah<bh or(ah==bh and am<bm)): #如果第一个时间小于第二个时间，则将第一个时间加上24小时\n ah=ah+24\nah=ah-bh #小时相减\nam=am-bm #分钟相减\nif(am<0): #退位\n ah=ah-1\n am=60+am\nprint('%02d:%02d'%(ah,am)) #格式化输出", "s = input()\r\nt = input()\r\n\r\nimport datetime\r\n\r\nsTime = datetime.datetime.strptime(s, '%H:%M')\r\ntTime = datetime.datetime.strptime(t, '%H:%M')\r\n\r\nx = sTime - tTime\r\n\r\ndays, seconds = x.days, x.seconds\r\nhours = seconds // 3600\r\nminutes = (seconds % 3600) // 60\r\n\r\nstrmin = str(minutes)\r\nstrhour = str(hours)\r\n\r\nif minutes < 10 : strmin = '0'+strmin\r\nif hours < 10 : strhour = '0'+strhour\r\nprint(strhour + \":\" + strmin)\r\n\r\n", "sh,sm=map(int,input().split(':'))\r\nth,tm=map(int,input().split(':'))\r\nst,tt=sh*60+sm,th*60+tm\r\nat=st-tt\r\nif at>=0:\r\n hh = at // 60\r\n mm = at - hh * 60\r\n if len(str(hh)) == 1:\r\n hh = '0' + str(hh)\r\n if len(str(mm)) == 1:\r\n mm = '0' + str(mm)\r\nif at<0:\r\n at=24*60 +at\r\n hh = at // 60\r\n mm = at - hh * 60\r\n if len(str(hh)) == 1:\r\n hh = '0' + str(hh)\r\n if len(str(mm)) == 1:\r\n mm = '0' + str(mm)\r\nprint(str(hh)+':'+str(mm))\r\n\r\n", "s1=input()\r\ns2=input()\r\nh1,m1=s1.split(':')\r\nh2,m2=s2.split(':')\r\nm=int(m1)-int(m2)\r\nh=int(h1)-int(h2)-1*(m<0)\r\nprint(str(h%24).zfill(2),str(m%60).zfill(2),sep=':')\r\n\r\n\r\n", "from collections import Counter\r\nimport statistics\r\nimport math\r\nints = lambda: list(map(int, input().split()))\r\nst = lambda x: statistics.mode(x)\r\ncnr = lambda x: Counter(x)\r\ntw = lambda n: (n&(n-1)==0) and n!=0\r\n\r\nh1,m1=map(int, input().split(\":\"))\r\nh2,m2=map(int, input().split(\":\"))\r\n\r\nh3,m3=h1-h2,m1-m2\r\nif m3<0: m3=60+m3; h3-=1\r\nif h3<0: h3=24+h3\r\nif len(str(h3))==1: h3=\"0\"+str(h3)\r\nif len(str(m3))==1: m3=\"0\"+str(m3)\r\nprint(h3,m3,sep=\":\")\r\n", "s1=input().strip()\r\ns2=input().strip()\r\nh1=int(s1[:2])\r\nh2=int(s2[:2])\r\nm1=int(s1[3:])\r\nm2=int(s2[3:])\r\nh3=h1-h2\r\nm3=m1-m2\r\nif m3<0:\r\n m3=60+m3\r\n h3-=1\r\nif h3<0:\r\n h3=24+h3\r\nprint((2-len(str(h3)))*'0'+str(h3)+':'+(2-len(str(m3)))*'0'+str(m3))\r\n", "from datetime import datetime\ns = input()\nt = input()\nt1 = datetime.strptime(s,\"%H:%M\")\nt2 = datetime.strptime(t,\"%H:%M\")\n\nm_diff = t1.minute - t2.minute\nh_diff = h_diff = t1.hour - t2.hour\nif m_diff >= 0:\n\tif h_diff < 0:\n\t\th_diff = 24 + h_diff\nelif m_diff < 0:\n\tm_diff = 60 + m_diff\n\th_diff -=1\n\tif h_diff < 0:\n\t\th_diff = 24 + h_diff\t\n\n#print (h_diff,m_diff)\n\n\"\"\"s = \"\"\nif h_diff < 10:\n\ts = \"0\"+str(h_diff)\nelse:\n\ts = str(h_diff)\t\n\nprint (s)\n\"\"\"\n\nif h_diff < 10:\n\ts = \"0\"+str(h_diff)\n\tif m_diff < 10:\n\t\ts = s +\":\" + \"0\"+str(m_diff)\n\telse:\n\t\ts = s + \":\" +str(m_diff)\nelse:\n\ts = str(h_diff)\t\n\tif m_diff < 10:\n\t\ts = s + \":\"+\"0\"+str(m_diff)\n\telse:\n\t\ts = s +\":\"+ str(m_diff)\n\nprint(s)\n", "f=input().split(':')\r\ns=input().split(':')\r\nh=int(f[0])\r\np=int(f[1])\r\nj=int(s[0])\r\no=int(s[1])\r\nif(h<j or(h==j and p<o)): h=h+24\r\nh=h-j\r\np=p-o\r\nif(p<0):\r\n h=h-1\r\n p=60+p\r\nprint('%02d:%02d'%(h,p))", "a = input().split(':')\nb = input().split(':')\nc1 = int(a[0])-int(b[0])\nc2 = int(a[1])-int(b[1])\nif c2<0:\n c2+=60\n c1-=1\nif c1<0:\n c1+=24\nc1 = str(c1)\nc2 = str(c2)\nif len(c1) == 1:\n c1 = '0'+c1\nif len(c2) == 1:\n c2 = '0'+c2\nprint(c1+':'+c2)\n\t \t \t \t \t\t\t \t\t \t \t\t \t", "h,m=map(int,input().split(':'))\r\n\r\nt,y=map(int,input().split(':'))\r\n\r\n\r\nm=m-y\r\n\r\nd=1 if m<0 else 0\r\n\r\nh-=d\r\nm=m%60\r\n\r\nh-=t\r\n\r\nh=h%24\r\n\r\nh=str(h);m=str(m)\r\nif len(h)==1:h='0'+h\r\nif len(m)==1:m='0'+m\r\nprint(h+':'+m)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Apr 8 14:14:45 2019\n\n@author: xungao\n\"\"\"\n\na,b=(map(int,input().split(':')))\nc,d=(map(int,input().split(':')))\nt1 = a*60+b\nt2 = c*60+d\nif t1>=t2:\n t3 = t1-t2\nelse:\n t3 = 24*60+t1-t2\nprint(f'%02d:%02d'%(t3//60,t3%60))", "x1,y1=map(int,input().split(\":\"))\r\nx2,y2=map(int,input().split(\":\"))\r\nfrom datetime import *\r\nx=datetime(2021,4,5,x1,y1,0,0)-timedelta(hours=x2,minutes=y2)\r\nprint(str(x)[11:16])", "def printtime(a):\r\n h = a//60\r\n m = a%60\r\n if h < 10:\r\n h = '0' + str(h)\r\n if m < 10:\r\n m = '0' + str(m)\r\n print(h,m, sep = ':')\r\n \r\nh1,m1 = (int(i) for i in input().split(\":\"))\r\nh2,m2 = (int(i) for i in input().split(\":\"))\r\n\r\nt1 = h1*60+m1\r\nt2 = h2*60+m2\r\nif t1 >= t2:\r\n printtime(t1-t2)\r\nelse:\r\n printtime(24*60 - t2 + t1)", "up = list(map(int,input().split(sep=':')))\r\ntime = list(map(int, input().split(sep=':')))\r\na = up[0]*60 + up[1]\r\nb = time[0]*60 + time[1]\r\nif a - b >= 0:\r\n m = (a-b)//60\r\n n = (a-b)%60\r\n\r\nelse:\r\n m = (24*60 + a -b)//60\r\n n = (24*60+a-b)%60\r\nprint(str(m).zfill(2),str(n).zfill(2),sep=':')", "#!/usr/bin/python3\r\ncurrent = str(input())\r\nsleepingDur = str(input())\r\n\r\nH1 = int(current[0:2])\r\nM1 = int(current[3:5])\r\n\r\nH2 = int(sleepingDur[0:2])\r\nM2 = int(sleepingDur[3:5])\r\n\r\nsleepingHour = H1 - H2\r\nsleepingMinute = M1 - M2\r\n\r\nif sleepingMinute < 0:\r\n sleepingMinute += 60; sleepingHour -= 1\r\nif sleepingHour < 0:\r\n sleepingHour += 24\r\nfinalShit = \"\"\r\nif sleepingHour < 10 :\r\n finalShit += \"0\"\r\nfinalShit += str(sleepingHour)+\":\"\r\nif sleepingMinute < 10:\r\n finalShit += \"0\"\r\nfinalShit+=str(sleepingMinute)\r\n\r\nprint(finalShit)\r\n", "h2, m2 = map(int, input().split(':'))\r\nh_sleep, m_sleep = map(int, input().split(':'))\r\n\r\nt2 = m2 + h2 * 60\r\nt_sleep = m_sleep + h_sleep * 60\r\n\r\nt2 -= t_sleep\r\nif t2 < 0:\r\n t2 += 60 * 24\r\n\r\nprint('0' * (2 - len(str(t2 // 60))) + str(t2 // 60) + ':' + '0' * (2 - len(str(t2 % 60))) + str(t2 % 60))\r\n", "I = lambda: map(int, input().split(':'))\r\n\r\nh, m = I()\r\ndh, dm = I()\r\nh, m = h-dh, m-dm\r\nh, m = (h+m//60)%24, m%60\r\n\r\nprint(f'{h:02}:{m:02}')", "import math\nimport bisect\n\nfrom math import gcd, floor, sqrt, log\nfrom collections import defaultdict as dd\n\nI = lambda: int(input())\ntup = lambda: map(int, input().split())\nlst = lambda: list(map(int, input().split()))\n\nt = 1\n#t = I()\n\nwhile t:\n\n h1, m1 = map(int, input().split(':'))\n h2, m2 = map(int, input().split(':'))\n\n m = m1 - m2\n h = h1 - h2\n\n if m < 0:\n m += 60\n h -= 1\n \n if h < 0:\n h += 24\n\n print(\"{0:02d}:{1:02d}\".format(h,m))\n\n \n\n\n\n t -= 1\n\n\n ", "s=input()\nt=input()\nhrs=int(s[:2])-int(t[:2])\nmins=int(s[3:])-int(t[3:])\nif mins<0:\n\tmins+=60\n\thrs-=1\nif hrs<0:\n\thrs+=24\nhrs=str(hrs)\nmins=str(mins)\nif len(hrs)==1:\n\thrs='0'+hrs\nif len(mins)==1:\n\tmins='0'+mins\nprint(hrs+':'+mins)", "t1 = list(input())\r\nt2 = list(input())\r\n\r\nh1 = int(t1[0] + t1[1])\r\nm1 = int(t1[3] + t1[4])\r\nh2 = int(t2[0] + t2[1])\r\nm2 = int(t2[3] + t2[4])\r\n\r\nif m1 < m2 :\r\n m1 += 60\r\n h2 += 1\r\n\r\nif h1 < h2 :\r\n h1 += 24\r\nh3 = str(h1 - h2) \r\nm3 = str(m1 - m2)\r\n\r\nif len(h3) == 1 :\r\n h3 = \"0\" + h3\r\nif len(m3) == 1 :\r\n m3 = \"0\" + m3\r\nprint(h3 + \":\" + m3)", "n = [int(k) for k in input().split(':')]\r\nm = [int(k) for k in input().split(':')]\r\nk = n[0]*60 + n[1]\r\nj = m[0]*60 + m[1]\r\ndef h(x):\r\n for s in range(2 - len(x)):\r\n x = str(0) + x\r\n return x\r\ndef f(x):\r\n a = int(x/60)\r\n b = x%60\r\n c = h(str(a))+':'+h(str(b))\r\n return c\r\nif k >= j:\r\n print(f(k-j))\r\nelse:\r\n print(f(k+24*60-j))", "h, m = map(int, input().split(':'))\r\nhh, mm = map(int, input().split(':'))\r\ns = h * 60 + m\r\nt = hh * 60 + mm\r\nans = s - t\r\nif ans < 0:\r\n ans = 1440 + ans\r\nif len(str(ans // 60)) == 1:\r\n if len(str(ans % 60)) == 1:\r\n print(f'0{ans // 60}:0{ans % 60}')\r\n else:\r\n print(f'0{ans // 60}:{ans % 60}')\r\nelse:\r\n if len(str(ans % 60)) == 1:\r\n print(f'{ans // 60}:0{ans % 60}')\r\n else:\r\n print(f'{ans // 60}:{ans % 60}')", "s = [int(x) for x in input().split(\":\")]\r\nt = [int(x) for x in input().split(\":\")]\r\ns1 = s[0] * 60 + s[1] + 1440\r\nt1 = t[0] * 60 + t[1]\r\np = (s1 - t1) % 1440\r\nprint(\"0\" * (2 - len(str(p // 60))) + str(p // 60) + \":\" + \"0\" * (2 - len(str(p % 60))) + str(p % 60))", "s = input()\r\nt = input()\r\nmms = int(s[:2]) * 60 + int(s[3:])\r\nmmt = int(t[:2]) * 60 + int(t[3:])\r\ndiff = (mms + 1440 - mmt) % 1440\r\nh = diff // 60\r\nm = diff % 60\r\nprint(str(h).zfill(2) + ':' + str(m).zfill(2))", "a,b=map(int, input().split(':'))\r\nc,d=map(int, input().split(':'))\r\nr=a*60+ b-c*60-d\r\nif r < 0:\r\n r+=60*24\r\na=r//60\r\nb=r% 60\r\nprint(str(a//10) + str(a%10)+':'+str(b//10)+str(b%10))\r\n", "a = list(map(int,input().split(\":\")))\r\nb = list(map(int,input().split(\":\")))\r\nh = 0\r\nm = 0\r\nif(a[1]<b[1]):\r\n a[0] -= 1\r\n m = 60+a[1]-b[1]\r\nelse:\r\n m = a[1]-b[1]\r\n\r\nif(a[0]<b[0]):\r\n h = 24+a[0]-b[0]\r\nelse:\r\n h = a[0]-b[0]\r\nif(h<10):\r\n h = \"0\"+str(h)\r\nif(m<10):\r\n m = \"0\"+str(m)\r\nprint(str(h)+\":\"+str(m))", "a=list(map(int,input().split(\":\")))\r\nb=list(map(int,input().split(\":\")))\r\nif a[1]<b[1]:\r\n a[0]-=1\r\n a[1]+=60\r\nif a[0]<b[0]:\r\n a[0]+=24\r\nx=str(a[0]-b[0])\r\ny=str(a[1]-b[1])\r\nif len(x)==1:\r\n x=\"0\"+x\r\nif len(y)==1:\r\n y=\"0\"+y\r\nprint(x+\":\"+y)", "ch,m=input().split(\":\")\r\ntch,tm=input().split(\":\")\r\n\r\nch=int(ch)\r\ntch=int(tch)\r\nm=int(m)\r\ntm=int(tm)\r\n\r\ns1=ch*60+m\r\ns2=tch*60+tm\r\n\r\ns3=s1-s2\r\n\r\nif s3<0:\r\n s3=24*60+s3\r\n\r\nch=s3//60\r\nm=s3%60\r\n\r\nif(ch<10):\r\n print(\"0\"+str(ch),end=\":\")\r\nelse:\r\n print(str(ch),end=\":\")\r\n\r\nif(m<10):\r\n print(\"0\"+str(m))\r\nelse:\r\n print(str(m))", "s = input()\r\nt = input()\r\n\r\n\r\nminutes = (int(s[:2])*60 + int(s[3:])) - (int(t[:2])*60 + int(t[3:]))\r\nresult = minutes if minutes >= 0 else 1440 + minutes\r\n\r\nprint('{:02}:{:02}'.format(result//60, result%60))\r\n", "from math import floor\ns = input().split(':')\nt = input().split(':')\n\ns = int(s[0])*60 + int(s[1])\nt = int(t[0])*60 + int(t[1])\n\nw = s-t\n\nif w < 0:\n w = 24*60 + w\n\nh = ''\nm = ''\n\nif floor(w/60) < 10:\n h = '0'+str(floor(w/60))\nelse:\n h = str(floor(w/60))\n\nif w%60 < 10:\n m = '0'+str(w%60)\nelse:\n m = str(w%60)\n\nprint(h+':'+m)\n\n \t\t \t \t \t \t\t \t \t\t\t \t \t\t\t", "s,t=input().split(\":\"),input().split(\":\")\r\nlist1=[0,0,0,0]\r\nif 0<=int(s[0])<=23 and 0<=int(t[0])<=23 and 0<=int(s[1])<=59 and 0<=int(t[1])<=59:\r\n if int(s[1])>=int(t[1]):\r\n a=str(int(s[1])-int(t[1]))\r\n if int(a)>9:\r\n list1[2],list1[3]=int(a[0]),int(a[1])\r\n else:\r\n list1[2],list1[3]=0,int(a[0])\r\n else:\r\n a=str(60+(int(s[1])-int(t[1])))\r\n if int(a)>9:\r\n list1[2],list1[3]=int(a[0]),int(a[1])\r\n else:\r\n list1[2],list1[3]=0,int(a[0])\r\n a=int(t[0])+1\r\n t[0]=a\r\n if int(s[0])>=int(t[0]):\r\n a=str(int(s[0])-int(t[0]))\r\n if int(a)>9:\r\n list1[0],list1[1]=int(a[0]),int(a[1])\r\n else:\r\n list1[0],list1[1]=0,int(a[0])\r\n else:\r\n a=str(24+(int(s[0])-int(t[0])))\r\n if int(a)>9:\r\n list1[0],list1[1]=int(a[0]),int(a[1])\r\n else:\r\n list1[0],list1[1]=0,int(a[0])\r\n\r\nprint(str(list1[0])+str(list1[1])+\":\"+str(list1[2])+str(list1[3]))", "hh,mm = map(int,input().split(\":\"))\r\nhh2,mm2 = map(int,input().split(\":\"))\r\nhh -= hh2\r\nmm -= mm2\r\nif mm < 0:\r\n hh -= 1\r\n mm += 60\r\nif hh < 0:\r\n hh += 24\r\nprint(\"0\"*(2-len(str(hh)))+str(hh)+\":\"+\"0\"*(2-len(str(mm)))+str(mm))\r\n", "# coding: utf-8\ns = [int(i) for i in input().split(':')]\nstime = s[0]*60+s[1]+24*60\nt = [int(i) for i in input().split(':')]\nttime = t[0]*60+t[1]\nptime = stime-ttime\nprint('%02d:%02d' % (ptime//60%24,ptime%60) )\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\nc,d=map(int,input().split(':'))\r\n\r\ne=b-d\r\nif(e<0):\r\n e+=60\r\n c+=1\r\n\r\nf=(a-c+24)%24\r\nprint('%02i:%02i'%(f,e))", "s=input().split(':')\r\nt=input().split(':')\r\nx=int(s[0])-int(t[0])\r\ny=int(s[1])-int(t[1])\r\nif y<0:\r\n\ty+=60\r\n\tx-=1\r\nif x<0:\r\n\tx+=24\r\nif x<10:\r\n\tprint(0,end='')\r\n\tprint(x,end='')\r\nelse:\r\n\tprint(x,end='')\r\nprint(':',end='')\r\nif y<10:\r\n\tprint(0,end='')\r\n\tprint(y)\r\nelse:\r\n\tprint(y)", "now = input()\ndur = input()\na=int(now.split(':')[0])\nb=int(now.split(':')[1])\nc=int(dur.split(':')[0])\nd=int(dur.split(':')[1])\n\nif b>=d :\n\tmin = b-d\nif d>b:\n\tmin = 60 + b-d\n\ta -= 1\nif a>=c :\n\thour = a-c\nif c>a :\n\thour = 24 + a-c\n\n\nif hour<10:\n\thour = '0'+str(hour)\nif min<10:\n\tmin = '0'+str(min)\n\t\nprint (str(hour) + ':' + str(min))\n\t\t\t\t\t\t\t\t \t\t\t\t \t \t\t \t \t\t\t\t", "h, s = list(map(int, input().split(\":\")))\r\nh1, s1 = list(map(int, input().split(\":\")))\r\nminit = 60*h+s\r\na = 60*h1+s1\r\nb = minit - a\r\nc = b // 60\r\nd = b % 60\r\nif c < 0:\r\n c = 24 + c\r\nelif c < 0:\r\n d = 60 + b\r\nprint(\"{}:{}\".format(str(c).zfill(2),str(d).zfill(2)))" ]

[ "shoes = list(input().split())\r\nshoes = list(map(int, shoes))\r\ncolours = []\r\ncount = 0\r\n\r\nfor i in range(len(shoes)):\r\n if shoes[i] in colours:\r\n count += 1\r\n else:\r\n colours.append(shoes[i])\r\nprint(count)\r\n", "print(4 - len(set(map(int , input().split()))))\r\n", "n = list(map(int,input().split()))\r\nn_set = set(n)\r\nprint(len(n)-len(n_set))", "s = [int(x) for x in input().split()]\r\n\r\nd ={}\r\nfor i in s:\r\n if i in d:\r\n d[i] = d[i]+1\r\n else:\r\n d[i] = 1\r\nc = 0\r\nfor i in d:\r\n if d[i] ==2:\r\n c = c+1\r\n elif d[i] ==3:\r\n c = c+2\r\n elif d[i] ==4:\r\n c = c+3\r\n\r\nprint(c)\r\n\r\n ", "\r\nnums = input().split()\r\ncopy = []\r\n\r\nfor i in range(4):\r\n if nums[i] not in copy:\r\n copy.append(nums[i])\r\n\r\nans = 4 - len(copy)\r\nprint(ans)", "m = list(map(int, input().split()))\r\nnum = 0\r\nd = dict()\r\nfor i in m:\r\n d[i] = m.count(i)\r\nprint(4 - len(d))", "h = list(map(int,input().split()))\r\nu_c = len(set(h))\r\na_need = 4 - u_c\r\nprint(a_need)", "s = input().split()\r\nprint (len(s)-len(set(s)))\r\n", "from collections import Counter\r\nimport math\r\nls = set(map(int, input().split()))\r\n\r\nprint(4 - len(ls))\r\n", "\r\ntxt = input()\r\ns = set()\r\nx = txt.split(\" \")\r\nfor i in range(len(x)):\r\n s.add(x[i])\r\nprint(4 -len(s))\r\n", "s = list(map(int, input().split(\" \")))\nd = []\ndep = 0\nfor i in s:\n if i in d:\n dep+=1\n else:\n d.append(i)\nprint(dep)", "ar = input().split()\r\nar = [int(x) for x in ar]\r\nar = list(set(ar))\r\nprint(4 - len(ar))", "arr = list(map(int, input().split()))\r\narr.sort() \r\ncount = 0\r\nfor i in range(3): \r\n if arr[i] == arr[i + 1]:\r\n count += 1\r\nprint(count)", "def min_shoes(s1, s2, s3, s4):\r\n colors = set([s1, s2, s3, s4]) \r\n return 4 - len(colors) \r\ns1, s2, s3, s4 = map(int, input().split())\r\nprint(min_shoes(s1, s2, s3, s4))\r\n", "s1, s2, s3, s4 = map(int, input().split(' '))\r\nhorseshoes = len(set([s1, s2, s3, s4]))\r\nadditional = 4 - horseshoes \r\nprint(additional)\r\n", "a = list(map(str, input().split()))\r\nstack = []\r\ncount1 = 0\r\ncount11 = 0\r\nfor i in a:\r\n if i not in stack:\r\n stack.append(i)\r\n else:\r\n count1 += 1\r\nprint(count1)", "colors = input().split()\r\ncount = 0\r\nseen = []\r\nj = 0\r\nfor i in colors:\r\n if i in seen :\r\n count+=1\r\n else :\r\n seen.append(i)\r\nprint(count)", "a = list(map(str, input().split()))\r\nvr = ''\r\nans = 0\r\nfor i in range(4):\r\n if a[i] not in vr:\r\n vr += a[i]\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "s = list(map(int,input().split()))\r\na= {}\r\nfor i in s:\r\n a[i]=0\r\nfor i in s:\r\n a[i]+=1\r\nx=0\r\nfor key in a:\r\n if a[key]>1:\r\n x+=(a[key]-1)\r\n \r\nprint(x)", "colors = list(map(int, input().split()))\ndef requirement(colors):\n y = 4-len(set(colors))\n return print(y)\nrequirement(colors)\n", "herraduras = list(map(int,input().split()))\r\ndiferentes = set(herraduras)\r\nrespuesta = 4 - len(diferentes)\r\nprint(respuesta)", "single_count = len({*input().split(' ')})\r\nprint(4-single_count)", "a=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n if i in b:\r\n continue\r\n else:\r\n b.append(i)\r\nprint(4-len(b))\r\n", "l=list(map(int,input().split()))\r\ndistinct=set(l)\r\nans=len(l) - len(distinct)\r\nprint(ans)\r\n", "s1,s2,s3,s4=map(int,input().split())\r\ntab1=[s2,s3,s4]\r\ntab2=[s1]\r\nfor i in tab1:\r\n if i not in tab2:\r\n tab2.append(i)\r\n \r\nprint(4-len(tab2))\r\n ", "s = input().split()\r\ndat = set(s)\r\nprint(4 - len(dat))", "a = list(map(int,input().split()))\r\nb = set()\r\n\r\nfor i in a:\r\n b.add(i)\r\n\r\nprint(4 - len(b))", "s1, s2, s3, s4 = map(int, input().split())\r\nl = []\r\nl.append(s1)\r\nl.append(s2)\r\nl.append(s3)\r\nl.append(s4)\r\ncounter = 0\r\nfor x in range(len(l)):\r\n for y in range(x + 1, len(l)):\r\n if l[x] == l[y]:\r\n counter += 1\r\n break\r\nprint(counter)\r\n", "a = list(map(int, input().split()))\r\nx = len(a)\r\nb = set(a)\r\ny = len(b)\r\nanswer = x - y\r\nprint(answer)", "x = list(map(int, input().split())) \r\ny=set(x)\r\nprint(len(x)-len(y))", "\r\ns1, s2, s3, s4 = map(int, input().split())\r\n\r\nuni = set([s1, s2, s3, s4])\r\n\r\nnum = len(uni)\r\n\r\nmin= max(0, 4 - num)\r\n\r\nprint(min)\r\n", "s = list(map(int,input().split()))\r\nn = []\r\nans = 0\r\nfor i in s:\r\n if s.count(i) != 0 and i not in n:\r\n ans += s.count(i) - 1\r\n n.append(i)\r\nprint(ans)", "a,b,c,d=map(int,input().split(\" \"))\r\ns=set([a,b,c,d])\r\nprint(4-len(s))", "l=list(map(int,input().split()))\r\nl1=list(set(l))\r\nprint(4-len(l1))", "a, b, c, d = map(int, input().split(\" \"))\r\nv = [a]\r\ncnt = 0\r\nif b not in v:\r\n v.append(b)\r\nelse:\r\n cnt += 1\r\nif c not in v:\r\n v.append(c)\r\nelse:\r\n cnt += 1\r\nif d not in v:\r\n v.append(d)\r\nelse:\r\n cnt += 1\r\n\r\nprint(cnt)", "colors= list(map(int,input().split()))\r\nsol=[]\r\n\r\nfor color in colors :\r\n if color not in sol :\r\n sol.append(color)\r\n\r\n\r\n\r\n\r\nprint(4-len(sol))", "s1, s2, s3, s4 = map(int, input().split())\r\ncolors = set([s1, s2, s3, s4])\r\nadditional_horseshoes = 4 - len(colors)\r\n\r\nprint(additional_horseshoes)", "n = list(map(int, input().split()))\ny = []\n\nfor m in n:\n y.append(m)\n\nt = len(set(y))\nk = len(n) - t\nprint(k)", "s1,s2,s3,s4=map(int,input().split())\r\ns=set()\r\ns.add(s1)\r\ns.add(s2)\r\ns.add(s3)\r\ns.add(s4)\r\nl=len(s)\r\nprint(4-l)", "horseshoes_colors = list(map(int, input().split()))\n\ndifferent_horseshoes_colors = []\n\nfor horseshoe_color in horseshoes_colors:\n if different_horseshoes_colors.count(horseshoe_color) == 0:\n different_horseshoes_colors.append(horseshoe_color)\n\nif len(different_horseshoes_colors) >= 4:\n print('0')\nelse:\n horseshoes_to_buy = 4 - len(different_horseshoes_colors)\n print(horseshoes_to_buy)", "nums = [int(num) for num in input().split()]\r\nnums_after = []\r\nfor _ in nums:\r\n if _ not in nums_after:\r\n nums_after.append(_)\r\nprint(len(nums) - len(nums_after))\r\n", "s = list(map(int, input().split()))\r\na = set(s)\r\n\r\nprint(len(s)-len(a))", "colors = list(map(int, input().split()))\r\n\r\ncolors2 = [] #without repetitions\r\n\r\ncounter = 0\r\n\r\nfor i in range(4):\r\n if colors[i] in colors2:\r\n counter += 1\r\n colors2.append(colors[i])\r\n\r\nprint(f'{counter}')", "colors = input().split()\r\nprint(len(colors) - len(set(colors)))", "num=input().split()\nnumset=set(num)\ndupe=4-len(numset)\nprint(dupe)", "def main(arr):\r\n return len(arr) - len(set(arr))\r\n\r\nif __name__ == \"__main__\":\r\n arr = input().split()\r\n\r\n print(main(arr))", "s = input().split(\" \")\r\nk = set()\r\nc = 0\r\nfor i in s:\r\n if i in k: \r\n c += 1\r\n else:\r\n k.add(i)\r\nprint(c)\r\n", "s = input().split()\r\nc = 0\r\n\r\nfor i in range(3):\r\n f = 0\r\n for j in range(i + 1, 4):\r\n if s[i] == s[j]:\r\n f = 1\r\n break\r\n if f == 1:\r\n c += 1\r\n\r\nprint(c)\r\n", "shoes = list(map(int,input().split()))\r\nrepeated = 0\r\ncol = -1\r\nsho = []\r\nfor i in shoes:\r\n if i in sho:\r\n repeated += 1\r\n else:\r\n sho.append(i)\r\nprint(repeated)", "s = list(map(int,input().split()))\r\nss = set(s)\r\nprint(len(s)-len(ss))", "a = input().split()\r\nprint(len(a)-len(set(a)))", "colours = input().split(' ')\r\none = colours[0]\r\ntwo = colours[1]\r\nthree = colours[2]\r\nfour = colours[3]\r\nhorseshoe = 0\r\nif one == two or one == three or one == four:\r\n horseshoe += 1\r\n if two == three or two == four:\r\n horseshoe += 1\r\n if three == four:\r\n horseshoe += 1\r\n elif three == four:\r\n horseshoe += 1\r\nelif two == three or two == four:\r\n horseshoe += 1\r\n if three == four:\r\n horseshoe += 1\r\nelif three == four:\r\n horseshoe += 1\r\nprint(horseshoe)", "n = list(map(int, input().split()))\r\n\r\nprint(4 - len(set(n)))", "def min_horseshoes_to_buy(colors):\r\n distinct_colors = len(set(colors))\r\n return 4 - distinct_colors\r\ncolors = list(map(int, input().split()))\r\nprint(min_horseshoes_to_buy(colors))", "# Input: Taking a list of strings as input and splitting them\r\nword_list = list(input().split())\r\n\r\n# Initialize a counter for duplicate words\r\nduplicate_count = 0\r\n\r\n# Sorting the list of words\r\nword_list.sort()\r\n\r\n# Loop through the list to find duplicate words\r\nfor i in range(len(word_list) - 1):\r\n # Check if the current word is the same as the next word\r\n if word_list[i] == word_list[i + 1]:\r\n # Increment the duplicate count\r\n duplicate_count += 1\r\n\r\n# Output: Print the count of duplicate words\r\nprint(duplicate_count)\r\n", "temp=list(map(int,input().split()))\r\nprint(len(temp)-len(set(temp)))", "s = list(map(int,input().split()))\r\nnew = set(s)\r\nprint(len(s)-len(new)) ", "list1=list(map(str,input().split()))\r\nlist2=set(list1)\r\na=len(list2)\r\nprint(4-a)", "s = set(list(map(int, input().split())))\r\nprint(4 - len(s))", "s = [int(i) for i in input().split()]\r\n\r\ncount = 0\r\ns.sort()\r\n\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n count = count + 1\r\n\r\nprint(count)", "s=list(map(int,input().split()))\r\np=set(s)\r\nl=len(s)-len(p)\r\nprint(l)", "s = list(map(int,input().split()))\r\np = []\r\nc = 0\r\nfor i in range(4):\r\n if s[i] not in p:\r\n p.append(s[i])\r\n else:\r\n c += 1\r\nprint(c)", "s = input().split()\r\nd = set(s)\r\n\r\nprint(4-len(d))\r\n", "l=list(map(int,input().split()))\r\nm=set(l)\r\n\r\nprint(len(l)-len(m))", "shoes = [int(num) for num in input().split()]\r\n\r\ndistinctShoes = set()\r\nres = 0\r\n\r\nfor shoe in shoes:\r\n isThere = shoe in distinctShoes\r\n if isThere:\r\n res += 1\r\n else:\r\n distinctShoes.add(shoe)\r\n\r\nprint(res)\r\n", "s = input().split()\r\nd = []\r\nc = 0\r\n\r\nfor i in s:\r\n if i not in d:\r\n c += s.count(i)-1\r\n d += [i]\r\n \r\nprint(c)", "n=input()\r\nl=[]\r\nt=n.split(' ')\r\nfor i in t :\r\n if i not in l:\r\n l.append(i)\r\n\r\nprint(4-len(l))", "l=input().split()\r\no=\"\"\r\nfor c in l:\r\n p=l.index(c)\r\n if (str(p) not in o):\r\n o+=str(p)\r\nprint(4-len(o))\r\n", "shoes = list(map(int, input().split()))\r\n\r\ndistinct_colors = len(set(shoes))\r\nminimum_horseshoes_needed = 4 - distinct_colors\r\n\r\nprint(minimum_horseshoes_needed)\r\n", "l = list(map(int,input().split()))\r\n\r\nn = len(l)\r\ns = set(l)\r\n\r\nv = len(s)\r\n\r\nprint(abs(n-v))", "s = list(map(int,input().split()))\r\ns = set(s)\r\nprint(4-len(s))\r\n", "n = list(map(int, input().split()))\r\ns = set(n)\r\nprint(len(n) - len(s))", "enter = input().split()\r\ns1 = int(enter[0])\r\ns2 = int(enter[1])\r\ns3 = int(enter[2])\r\ns4 = int(enter[3])\r\nif s1 == s2 == s3 == s4:\r\n print(3)\r\nelif s1==s2 and s3==s4 or s1==s4 and s2==s3 or s1==s3 and s2==s4 or s1==s2==s3 or s2==s3==s4 or s3==s4==s1 or s4==s1==s2:\r\n print(2)\r\nelif s1 in {s2, s3, s4} or s2 in {s3, s4} or s3 == s4:\r\n print(1)\r\nelse:\r\n print(0)", "c = list(map(int, input().split()))\r\nuc= set(c)\r\n\r\nah = 4 - len(uc)\r\n\r\nprint(ah)\r\n", "lis=list(set(list(map(int,input().split()))))\r\nprint(4-len(lis))", "a=[int(x) for x in input().split()]\r\ne=set(a)\r\nprint(len(a)-len(e))", "l=list(map(int,input().split()))\r\nk=set(l)\r\nprint(len(l)-len(k))", "a = [int(i) for i in input().split()]\r\na.sort()\r\nsom = 0\r\n\r\nfor i in range(3):\r\n if a[i] - a[i+1] == 0:\r\n som += 1\r\n\r\nprint(som)\r\n", "k=list(map(int,input().split()))\r\np=len(set(k))\r\nresult=4-p\r\nprint(result)", "k = 0\r\nn = str(input()).split()\r\nz = []\r\nfor i in n:\r\n if i not in z:\r\n z.append(i)\r\n k += 1\r\nif 4-k > 0:\r\n print(4-k)\r\nelse: print(0)", "\"\"\"не смешите мои подковы\"\"\"\r\n\r\ndef main():\r\n print(4 - len(set(input().split())))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "k=list(map(int,input().split()))\r\nr=[*set(k)]\r\nif len(r)==len(k):\r\n print(0)\r\nelse:\r\n if len(r)==3:\r\n print(1)\r\n elif len(r)==2:\r\n print(2)\r\n else:\r\n print(3)", "\r\nn= list(map(int,input().split()))\r\nb= set(n)\r\nprint(4-len(b))\r\n\r\n\r\n\r\n\r\n", "a=list(map(int,input().split()))\r\nb=set(a)\r\nprint(len(a)-len(b))", "colors = set(input().split())\r\n\r\nno_of_shoes_needed = 4 - len(colors)\r\n\r\nprint(no_of_shoes_needed)", "a, b, c, d = map(int, input().split())\r\n\r\nuv = {a, b, c, d}\r\n\r\nprint(4 - len(uv))\r\n", "n=list(map(int,input().split())) ; print(len(n)-len(set(n)))", "print(4 - len(list(set([int(i) for i in input().split()]))))", "l = list(map(int,input().split()))\r\ns = set(l)\r\nprint((abs(len(s)-len(l))))", "a = [*map(int, input().split())]\r\nl = []\r\nc = 0\r\nfor i in a:\r\n if i not in l:\r\n l.append(i)\r\n elif i in l:\r\n c += 1\r\nprint(c)", "l = input().split()\r\nl2 = []\r\n[l2.append(x) for x in l if x not in l2]\r\nprint(4-len(l2))", "a,b,c,d=map(int,input().split())\r\nx={a,b,c,d}\r\nprint(4-len(x))\r\n", "arr=[int(i) for i in input().split()]\narr.sort()\nans=0\nfor i in range(1,4):\n if arr[i]==arr[i-1]:\n ans+=1\nprint(ans)\n \t \t \t\t \t\t \t \t\t \t\t\t\t", "colors = list(map(int, input().split()))\r\n\r\nexist_colors = []\r\n\r\nfor color in colors:\r\n if color not in exist_colors:\r\n exist_colors.append(color)\r\n\r\n\r\nprint(4 - len(exist_colors))", "colors = input().split()\r\nprint(len(colors)-len(set(colors)))", "x = input().split()\r\na = {x[0]}\r\nfor i in x:\r\n a.add(i)\r\nprint(4-len(a))\r\n", "x = list(map(int, input().split()))\r\nb = set(x)\r\n\r\nprint(len(x) - len(b))", "n=list(map(int,input().split()))\r\ns=set(n)\r\nl=len(s)\r\nprint(4-l)", "c=list(map(int,input().split()))\r\ndc=len(set(c))\r\nhn=4-dc\r\nprint(hn)", "a = list(map(int,input().split()))\r\nb = set(a)\r\nprint(abs(len(b)-len(a)))\r\n", "lst = list(map(int, input().split()))\r\ns = set(lst)\r\ncnt = 0\r\nfor i in s:\r\n n = lst.count(i)\r\n if n>1:\r\n cnt+=n-1\r\nprint(cnt)", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Create a set to store the unique colors Valera already has\r\nunique_colors = set([s1, s2, s3, s4])\r\n\r\n# Calculate how many more horseshoes Valera needs to buy\r\nadditional_horseshoes_needed = 4 - len(unique_colors)\r\n\r\n# Print the result\r\nprint(additional_horseshoes_needed)\r\n", "s = list(map(int,input().split()))\r\ns.sort()\r\nk = 0\r\nif s[0] == s[1]:\r\n k += 1\r\nif s[1] == s[2]:\r\n k += 1\r\nif s[2] == s[3]:\r\n k += 1\r\nprint(k)\r\n", "x=list(map(int,input().split()))\r\nc=0\r\ny=[]\r\nfor i in x :\r\n if i in y :\r\n c+=1\r\n y.append(i)\r\n\r\nprint(c)", "s=list(map(int,input().split()))\r\nx=len(set(s))\r\nprint(len(s)-x)\r\n", "l=list(int(n) for n in input().split())\r\nnl={int(i) for i in l}\r\nprint(len(l)-len(nl))", "# https://codeforces.com/problemset/problem/228/A\r\n\r\nd = {}\r\nc = 0\r\nfor x in input().split():\r\n d[x] = 1\r\n c += 1\r\n\r\nprint(c-len(d))\r\n", "c = input().split()\r\nchecked = []\r\nr = 0\r\nfor i in range(len(c)):\r\n if c[i] in checked:\r\n r += 1\r\n checked.append(c[i])\r\nprint(r)\r\n", "# You can solve it in two approches\r\n\r\n# Approche 1\r\n# s = list(map(int, input().split())) # 1, 7, 3, 3\r\n#\r\n# sol = []\r\n# for color in s: # 1, 7, 3, 3\r\n# if color not in sol: # 1, 7, 3, 3\r\n# sol.append(color) # 1, 7, 3\r\n#\r\n# print(4 - len(sol)) # sol = 1, 7, 3 ===> 1 -> res\r\n\r\n\r\n\r\n# Approche 2\r\ns = input().split()\r\n#s = 7 7 7 7 => set(s) = set(7)\r\nprint( 4 - len(set(s)) ) # => 3", "colors = map(int, input().split(' '))\n\nn_distinct = len(set(colors))\nprint(4 - n_distinct)\n", "# https://codeforces.com/problemset/problem/228/A\r\n\r\nshoes = [int(i) for i in input().split()]\r\ndiffrent = []\r\n\r\nfor colors in shoes:\r\n if colors not in diffrent:\r\n diffrent.append(colors)\r\nprint(len(shoes)-len(diffrent))\r\n", "from collections import defaultdict\r\nfrom collections import Counter\r\nfrom collections import deque\r\nimport heapq\r\nimport math\r\n \r\n \r\ndef integer():\r\n return int(input())\r\n \r\n \r\ndef num_lst():\r\n return list(map(int, input().split()))\r\n \r\n \r\ndef string():\r\n return input()\r\n \r\n \r\ndef str_lst():\r\n return list(input().split(\" \"))\r\n\r\ndef strtolst():\r\n s = string()\r\n temp = []\r\n for char in s:\r\n temp += char\r\n return temp\r\n \r\ndef Sort(tuple):\r\n return(sorted(tuple, key = lambda a: a[1])) \r\n\r\n\r\n\r\nshoes = num_lst()\r\nshoes = set(shoes)\r\n\r\nprint(4 - len(shoes))", "listA = list(map(int,input().split(\" \")))\r\nsetA = set(listA)\r\nprint(4-len(setA))", "def min_horseshoes_to_buy(previous_horseshoes):\n \n unique_colors = len(set(previous_horseshoes))\n horseshoes_needed = 4 - unique_colors\n\n \n if horseshoes_needed < 0:\n horseshoes_needed = 0\n\n return horseshoes_needed\n\n\nprevious_horseshoes = list(map(int, input().split()))\n\n\nmin_required = min_horseshoes_to_buy(previous_horseshoes)\n\nprint(min_required)\n\n\n\t\t \t \t \t\t \t \t \t \t\t \t", "n = list(map(int, input().split()))\r\nprint(len(n) - len(set(n)))", "while True:\r\n try:\r\n a = list(map(int, input().split()))\r\n print( max(0, 4-len(set(a))))\r\n except Exception as e:\r\n break\r\n", "nums = set(input().split())\r\nprint(4-len(nums))", "shoe_colors = list(map(int, input().split()))\r\n\r\nunique_colors = len(set(shoe_colors))\r\n\r\nadditional_shoes_needed = max(0, 4 - unique_colors)\r\n\r\nprint(additional_shoes_needed)\r\n", "A = input()\r\nB = A.split(\" \")\r\nC = list(map(int, B))\r\nadd = 3\r\nif C[1] != C[0]:\r\n add -= 1\r\nif C[2] != C[0] and C[2] != C[1]:\r\n add -= 1\r\nif C[3] != C[0] and C[3] != C[1] and C[3] != C[2]:\r\n add -= 1\r\nprint(add)", "numbers = input().split(' ')\r\ncol = 0\r\nif numbers[0] == numbers[1]:\r\n col += 1\r\nif numbers[0] == numbers[2]:\r\n col += 1\r\nif numbers[0] == numbers[3]:\r\n col += 1\r\nif numbers[1] == numbers[2]:\r\n col += 1\r\nif numbers[1] == numbers[3]:\r\n col += 1\r\nif numbers[2] == numbers[3]:\r\n col += 1\r\nif col == 3:\r\n print(2)\r\nelif col == 6:\r\n print(3)\r\nelse:\r\n print(col)", "a = input().split()\r\nprint(len(a) - len(set(a)))", "result = \"\"\r\ns = input().split(\" \")\r\ncollection = set()\r\nfor x in s:\r\n collection.add(x)\r\nresult = 4 - len(collection)\r\nprint(f\"{result}\")", "#2\r\nli=list(map(int, input().split()))\r\n\r\nl=set(li) \r\n\r\nprint(4-len(l)) \r\n", "shoes_colors=list(map(str,input().split()))\r\ncounter=0\r\nchecked_shoes=[]\r\nfor i in shoes_colors:\r\n num_of_shoes=shoes_colors.count(i)\r\n if num_of_shoes >1:\r\n if i not in checked_shoes:\r\n counter+=(num_of_shoes-1)\r\n checked_shoes.append(i)\r\n else:\r\n continue\r\nprint(counter)", "c = set(map(int,input().split()))\r\nprint(4-len(c))", "value = list(map(int, input().split(' ')))\r\ncount = 0\r\nif value[0] == value[1]:\r\n count += 1\r\n value[1] = -1\r\nif value[0] == value[2]:\r\n count += 1\r\n value[2] = -1\r\nif value[0] == value[3]:\r\n count += 1\r\n value[3] = -1\r\nif value[1] != -1:\r\n if value[1] == value[2]:\r\n count += 1\r\n value[2] = -1\r\n if value[1] == value[3]:\r\n count += 1\r\n value[3] = -1\r\nif value[2] != -1:\r\n if value[2] == value[3]:\r\n count += 1\r\nprint(count)", "col = list(map(int,input().split(\" \")))\r\ncount = 0\r\ncol.sort()\r\nfor i in range(1,len(col)):\r\n if col[i-1]==col[i]:\r\n count+=1\r\n\r\nprint(count)", "lista = list(map(int, input().split()))\r\nl_updated = [lista[0]]\r\nfor i in range(1, 4):\r\n if lista[i] not in l_updated:\r\n l_updated.append(lista[i])\r\nprint(4 - len(l_updated))", "a = set(list(map(int, input().split())))\r\n\r\nprint(4 - len(a))", "m = list(map(int, input().split()))\r\nd = set(m)\r\nprint(len(m)-len(d))\r\n", "l=list(map(int,input().split()))\r\nb=len(set(l))\r\nprint(len(l)-b)", "l=list(map(int,input().split()))\r\ns=set(l)\r\nprint(len(l)-len(s))", "x=list(map(int,input().split()))\r\nc=0\r\nd={}\r\nfor i in range(len(x)):\r\n if d.get(x[i])==None:\r\n d[x[i]]=1\r\n \r\n else:\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n\r\n\r\n", "i = list(map(int, input().split()))\r\niset = set(i)\r\nprint(4-len(iset))\r\n", "import os\r\nos.system('cls')\r\ncolor=input()\r\ncolors=color.split()\r\noutput=len(colors)-len(set(colors))\r\nprint(output)", "\r\ns = list(map(int, input().split()))\r\n\r\nc = set(s)\r\n\r\na = 4 - len(c)\r\n\r\nprint(a)\r\n", "x = [int(x) for x in input().split()]\r\na=set(x)\r\nprint(4-len(a))", "ronaldo=input()\nshoes=ronaldo.split()\nnum_shoes=0\nfor i in range(4):\n for j in range(i+1,4):\n if(shoes[i]==shoes[j]):\n num_shoes+=1\n break\nprint(num_shoes)\n\t\t\t \t \t \t\t\t \t\t\t\t\t \t \t\t", "x=input()\r\na=x.split(\" \")\r\nb=0\r\nfor i in range(4):\r\n for j in range(4):\r\n if int(a[i])==int(a[j]) and i!=j:\r\n b=b+1\r\nif b<6:\r\n print(int(b//2))\r\nelif b==6:\r\n print(2)\r\nelse:\r\n print(3)", "x,n=list(map(int,input().split())),0\r\nx.sort()\r\nfor i in range(1,len(x)):\r\n if x[i]==x[i-1]:\r\n n+=1\r\nprint(n)", "print((lambda a: len(a) - len(set(a)))(input().split(' ')))", "a,b,c,d=input().split()\r\nlist=[a,b,c,d]\r\nprint(4-len(set(list)))", "nums = list(map(int,input().split()))\r\ns_nums= set(nums)\r\nresult = len(nums)-len(s_nums)\r\nprint(result)", "\r\nspam = [int(i) for i in input().split()]\r\na=set(spam)\r\nprint(len(spam)-len(a))", "# LUOGU_RID: 113370161\na=input().split()\nb=[]\nfor i in range(4):\n a[i]=int(a[i])\n if a[i] not in b:\n b.append(a[i])\nprint(4-len(b))", "# Wants to wear all shoes different color. 4 shoes total.\r\n# He has some shoes. We don't know how many.\r\n# He can buy shoes from a store.\r\n# But, he wants to buy as few shoes as possible to save money.\r\n\r\n# Colors are represented by numbers, input is given as a string.\r\n\r\ninput1 = input() # Get input from judge.\r\n\r\nshoesOwned = input1.split() # turns input into a List\r\n\r\nshoesCounted = [\"\"]*len(shoesOwned) # Make a new list with empty strings equal to the number of items in the shoeOwned List. We will look for duplicates housed in this list.\r\n\r\n\r\n# Think a way to solve this is to count the number of times each shoe appears in the given list. If the count is greater than 1, we add 1 to the number of shoes that he must purchase.\r\n\r\nshoesToBuy = 0\r\n\r\nfor i in range(len(shoesOwned)):\r\n\r\n # If the index value of shoesOwned at position i exists more than once within the shoesOwned list, then we want to assign that value to the shoesCounted list to keep a record of it.\r\n \r\n # Then, if we have at least 2 copies of that shoe color in our shoeCounted list, we add 1 to the shoesToBuy counter. Every time the program picks up on another duplicate copy, maybe a 3rd or 4th pair with the same color, it adds 1 to the counter.\r\n \r\n if shoesOwned.count(shoesOwned[i]) > 1:\r\n shoesCounted[i] = shoesOwned[i]\r\n if shoesCounted.count(shoesOwned[i]) >= 2:\r\n shoesToBuy += 1\r\n\r\nprint(shoesToBuy)\r\n", "a=list(map(int,input().split()))\r\nx=set(a)\r\nif len(x) == 4:\r\n print(0)\r\nelse:\r\n b=4-len(x)\r\n print(b)", "s=input()\r\nlis=[int(x) for x in s.split()]\r\nnew_lis=[]\r\nfor i in lis:\r\n if i not in new_lis:\r\n new_lis.append(i)\r\nprint(4-len(new_lis))", "li=list(map(int,input().split()))\r\ns=set(li)\r\nprint(4-len(s))", "st=set(map(int,input().split()))\r\nprint(4-len(st))", "a = input().split()\r\nb = 0\r\nm = []\r\nfor i in range(len(a)):\r\n if a.count(a[i]) > 1 and a[i] not in m:\r\n b=b+(a.count(a[i])-1)\r\n m.append(a[i])\r\nprint(b)", "def solve(l):\r\n s=set()\r\n for item in l:\r\n s.add(item)\r\n return 4-len(s)\r\nif __name__=='__main__':\r\n l=[]\r\n temp=input().split(' ')\r\n for item in temp:\r\n l.append(int(item))\r\n \r\n \r\n print(solve(l))\r\n", "mylist = list(map(int,input().split()))\r\n\r\nfrom collections import Counter\r\n\r\ncount=Counter(mylist)\r\n\r\ncount=sorted(count.items(),key= lambda x:x[1],reverse=True)\r\n\r\nq=0\r\nfor c in count:\r\n if c[1]>1:\r\n x = c[1]\r\n while x > 1:\r\n q+=1\r\n x-=1\r\nprint(q)", "\r\ndef solve():\r\n horseshoes = set(map(int, input().split(maxsplit=4)))\r\n return 4 - len(horseshoes)\r\n\r\n\r\nprint(solve())\r\n", "x=list(map(int,input().split()))\r\ns=set(x)\r\nprint(4-len(s))", "n=list(input().split())\r\nx=set(n)\r\nprint(len(n)-len(x))\r\n", "def horseshit(alist):\r\n blist=[]\r\n for f in alist:\r\n if f not in blist:\r\n blist.append(f)\r\n return 4-len(blist)\r\n\r\nn=input()\r\nalist=[int(x) for x in n.split()]\r\nprint(horseshit(alist))", "def minimum_horseshoes_to_buy(colors):\r\n unique_colors = set(colors)\r\n return 4 - len(unique_colors)\r\n\r\n# Read the input values\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate the minimum number of horseshoes to buy\r\nmin_horseshoes = minimum_horseshoes_to_buy(colors)\r\n\r\n# Print the result\r\nprint(min_horseshoes)\r\n", "s1, s2, s3, s4 = map(int, input().split())\nans = 0\ncount = 1\nif s1 != s2 and s1 != s3 and s1 != s4:\n count += 1\nif s2 != s3 and s2 != s4:\n count += 1\nif s3 != s4:\n count += 1\nans = 4 - count\nprint(ans)\n\t\t \t\t\t \t\t \t\t \t\t\t \t \t\t", "s1, s2, s3, s4 = map(int, input().split())\r\ndis = set([s1, s2, s3, s4])\r\nads = 4 - len(dis)\r\nprint(ads)\r\n", "s1,s2,s3,s4 = map(int, input().split())\r\nl = [s1, s2, s3, s4] \r\nprint(4 - len(set(l)))\r\n", "a = list(map(int,input().split()))\nu = set(a)\nn = len(u)\nm = 4 - n \nprint(max(0,m))", "a = list(map(int, input().split()))\r\nc = set(a)\r\nprint(len(a)-len(c))", "lst = []\r\na,b,c,d = map(int,input().split())\r\nlst.append(a)\r\nlst.append(b)\r\nlst.append(c)\r\nlst.append(d)\r\nlst = set(lst)\r\nprint(4-len(lst))", "elements = [int(el) for el in input().split(\" \")]\r\narr = []\r\nfor el in elements:\r\n if el not in arr:\r\n arr.append(el)\r\nprint(4 - len(arr))", "colors = list(map(int, input().split()))\r\ncolors = set(colors)\r\ncolors = len(colors)\r\nprint(4 - colors)", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\nunique_colors = set([s1, s2, s3, s4])\r\nminimum_horseshoes_to_buy = 4 - len(unique_colors)\r\n\r\nprint(minimum_horseshoes_to_buy)\r\n", "def my_solution(boots):\r\n print(4 - len(list(set(boots))))\r\n\r\nboots = [int(shoe) for shoe in input().split()]\r\nmy_solution(boots)", "lst=list(map(int,input().split()))\r\nlst.sort()\r\ncounter=0\r\nfor i in range(1,len(lst)):\r\n if lst[i]==lst[i-1]:\r\n counter+=1\r\nprint(counter)", "hs=list(map(int, input().split()))\r\ncolors = len(set(hs)) \r\n\r\nneeded_colors = 4 -colors\r\n\r\nprint(max(0, needed_colors))\r\n", "l = [int(x) for x in input().split()]\r\nprint(4 - len(set(l)))", "def color_list(c_list):\r\n x = set(c_list)\r\n return len(c_list) - len(x)\r\n\r\nc_list = list(map(int, input().split()))\r\n\r\nprint(color_list(c_list))", "horseshoes = set(map(int,input().split()))\r\nprint(4-len(horseshoes))\r\n", "colors = list(map(int, input().split()))\r\nlength = len(colors)\r\nset1 = set(colors)\r\nprint(length - len(set1))", "colors = input().split()\r\n\r\nfor i in range(len(colors)):\r\n colors[i] = int(colors[i])\r\n\r\ndistinct_colors = set(colors)\r\n\r\nprint(4 - len(distinct_colors))\r\n", "\r\nm=set(map(int,input().split()))\r\nprint(4-len(m))\r\n\r\n\r\n\r\n\r\n", "li=map(int,input().split())\r\ns=set(li)\r\nl=len(s)\r\nprint(max(0,4-l))", "hs = input().split(\" \")\r\nchecked = []\r\ncontador = 4\r\nnon_r = []\r\n\r\nfor dato in hs:\r\n if dato not in checked:\r\n non_r.append(dato)\r\n checked.append(dato)\r\n \r\nnon_rep = len(non_r)\r\ncontador -= non_rep\r\n\r\nif (contador == 4): print(0)\r\nelse: print(contador)\r\n\r\n", "number = set(input().split(' '))\r\nprint(4-len(number))", "x=list(map(int, input().split(\" \")))\r\nsol=[]\r\nfor i in x :\r\n if i not in sol:\r\n sol.append(i)\r\n \r\nprint (4-len(sol))", "s1,s2,s3,s4 = map(int, (input()).split())\r\nnum = 0\r\nif (s1==s2) or (s1==s3) or (s1==s4):\r\n num+=1\r\nif (s2==s3) or (s2==s4):\r\n num+=1\r\nif s3==s4:\r\n num+=1\r\nprint(num)", "l=list(map(int,input().split()))\r\nd=len(set(l))\r\nprint(4-d)", "a=list(map(int,input().split()))\r\nl=set(a)\r\nb=len(l)\r\nprint(4-b)", "a=list(map(int,input().split()))\r\na=sorted(a);c=0\r\nfor i in range (len(a)-1):\r\n if a[i]==a[i+1]:\r\n c+=1\r\nprint(c)", "data = input().split()\r\na = [int(x) for x in data]\r\ncount = 0\r\nmem = []\r\nfor i in range(0, 4):\r\n if a[i] in mem:\r\n count += 1\r\n else:\r\n mem.append(a[i])\r\nprint(count)", "n = list(map(int, input().split()))\r\nprint(abs(len(set(n)) - len(n)))", "# LUOGU_RID: 122743754\nprint(4 - len(set(input().split())))", "text=list(map(int,input().split()))\r\nresult=list()\r\nfor i in text:\r\n if not i in result:\r\n result.append(i)\r\nprint(4-len(result))\r\n", "a=input().split(\" \")\r\nprint(4-len([*set(a)]))", "a=list(map(int,input().split()))\r\nb=set(a)\r\nk=list(b)\r\nn=len(a)-len(k)\r\nprint(n)", "horseshoes = len(set(input().split()))\r\n\r\ntotal_horseshoes = 4\r\n\r\nneeded_horseshoes = total_horseshoes - horseshoes\r\n\r\nprint(needed_horseshoes)\r\n\r\n", "l = list(map(int,input().split()))\r\nbr = 0\r\nl.sort()\r\n\r\nfor i in range(len(l) - 1):\r\n if l[i] == l[i + 1]:\r\n br += 1\r\n\r\nprint(br)", "a = list(map(int, input().split()))\r\na.sort()\r\nl = 0\r\nfor i in range(1, 4):\r\n if a[i] == a[i - 1]:\r\n l += 1\r\nprint(l)# 1698326086.3191931", "def solve():\r\n s = list(map(int, input().split()))\r\n n = set(s)\r\n print(4-len(n))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 8 10:38:31 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nlist=[int(i) for i in input().split()]\r\nnum=[]\r\nfor i in list:\r\n if i not in num:\r\n num.append(i)\r\nprint(4-len(num))\r\n", "c = input().split()\r\ncolors = dict()\r\nfor x in c:\r\n if x not in colors:\r\n colors[x] = 1\r\nprint(4 - len(colors))", "s = list(map(int, input().split()))\nsSet = set(s)\nprint(len(s) - len(sSet))\n", "n = list(map(int,input().split()))\r\nprint(4 - len(set(n)))", "shoes = input().split()\r\nshoes = [int(x) for x in shoes]\r\n\r\nd = {}\r\n\r\ncounter = 0\r\nfor i in range(len(shoes)):\r\n if shoes[i] in d.keys():\r\n counter += 1\r\n else:\r\n d[shoes[i]] = 1\r\n\r\nprint(counter)", "a, b, c, d = map(int, input().split())\r\nh = {a, b, c, d}\r\nprint(4-len(set(h)))", "def main():\r\n shoes=input()\r\n shoesColors=shoes.split()\r\n counter=0\r\n for i in range (len(shoesColors)-1):\r\n for j in range (i+1,len(shoesColors)):\r\n if(shoesColors[i]==shoesColors[j]):\r\n counter+=1\r\n break\r\n print(counter)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "p=list(map(int,input().split()))\r\nx=set(p)\r\nprint(4-len(x))\r\n", "a = list(map(int, input().split()))\r\nx = set(a)\r\nprint(len(a) - len(x))", "l = list(input().split())\r\ns = set(l)\r\nprint(4 - len(s))", "shoes = [int(x) for x in input().split()]\r\nunique = set(shoes)\r\nprint(4 - len(unique))", "# LUOGU_RID: 112198236\nprint(4 - len(set(input().split())))", "info=set(input().split())\r\nn=len(info)\r\nprint(4-n)", "colors = list(map(int, input().split()))\r\n\r\ndistinct_colors = len(set(colors))\r\nminimum_horseshoes = 4 - distinct_colors\r\n\r\nprint(minimum_horseshoes)\r\n", "a = list(map(int, input().split()))\r\ncount = 0\r\nun = []\r\nunc = 0\r\nfor i in a:\r\n if i in un:\r\n unc += 1\r\n else:\r\n un.append(i)\r\nun = []\r\nprint(unc)\r\n", "n=input().split()\r\nans=[]\r\nfor i in n:\r\n if i not in ans:\r\n ans.append(i)\r\nprint(4-len(ans))", "# Input\ncolors = list(map(int, input().split()))\n\n# Find the number of unique colors Valera has\nunique_colors = len(set(colors))\n\n# Calculate the minimum number of horseshoes to buy\nminimum_to_buy = 4 - unique_colors\n\n# Ensure the result is non-negative\nminimum_to_buy = max(0, minimum_to_buy)\n\n# Print the result\nprint(minimum_to_buy)\n\n\t \t\t \t\t\t \t\t\t \t\t \t\t\t \t \t \t\t \t", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\n\r\nd = set([s1, s2, s3, s4])\r\n\r\n\r\nh = 4 - len(d)\r\n\r\n\r\nprint(h)\r\n", "l = input().split()\r\nprint(len(l)-len(set(l)))", "print(4-len(set(input().split())))", "shoes = [int(i) for i in input().split(\" \")]\r\n\r\n\r\n\r\ndef main(shoes: list):\r\n repeated = set()\r\n res = 0\r\n\r\n for i in shoes:\r\n if i in repeated:\r\n res += 1\r\n else:\r\n repeated.add(i)\r\n return res\r\n\r\nprint(main(shoes))", "a, b, c, d = map(int, input().split())\r\nx=0\r\nlist = [a,b,c,d]\r\nx = len(set(list))\r\nprint(4-x)", "horseshoes = map(int, input().split())\nprint(4 - len(set(horseshoes)))\n", "lists= map(int,input().split())\r\nsol=[]\r\nfor i in lists:\r\n if i not in sol:\r\n sol.append(i)\r\nprint(4-len(sol))", "l = list(map(int,input().split(' ')))\r\nvisited = set()\r\nfor i in l:\r\n if i not in visited:\r\n visited.add(i)\r\nprint(4-len(visited))\r\n ", "# LUOGU_RID: 113148251\nprint(4 - len(set(input().split())))", "target_list=[(int(i)) for i in input().split(\" \")]\r\n\r\ntarget_set=set(target_list)\r\nprint(len(target_list)-len(target_set))", "shoes=list(map(int,input().split()))\r\nd=dict()\r\nfor i in shoes:\r\n d[i]=shoes.count(i)\r\nc=0\r\nfor i in d:\r\n c+=d.get(i)-1\r\nprint(c)\r\n \r\n ", "arr=map(int,input().split())\r\ns=set()\r\ncount=0\r\nfor i in arr :\r\n if i in s:\r\n count+=1\r\n else:\r\n s.add(i)\r\nprint(count)", "colors = list(map(int, input().split()))\r\ncolors = set(colors)\r\ndistinct_colors = len(colors)\r\nmore_needed = 4 - distinct_colors\r\nprint(more_needed)\r\n", "l=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(1,len(l)):\r\n if l[i-1]==l[i]:\r\n c+=1\r\nprint(c)", "color=input().split()\r\ns=[]\r\nfor i in color:\r\n if not i in s:\r\n s.append(i)\r\nprint(4-len(s))", "a = list(map(int, input().split()))\r\nd = len(set(a))\r\nc = 4 - d\r\nprint(c)\r\n\r\n", "def minimum_horseshoes_to_buy(horseshoes):\r\n return 4 - len(set(horseshoes))\r\n\r\nhorseshoes = list(map(int, input().split()))\r\n\r\nprint(minimum_horseshoes_to_buy(horseshoes))\r\n\r\n", "# \t228A - Is your horseshoe on the other hoof?\r\nif __name__ == '__main__' :\r\n colors = {int(x) for x in input().split()}\r\n print(4-len(colors))", "horseshoes = list(map(int, input().split()))\r\nhorseshoes2 = []\r\n\r\nfor i in horseshoes :\r\n if i not in horseshoes2 :\r\n horseshoes2.append(i)\r\n\r\nprint(4 - len(horseshoes2))", "ask=list(map(int,input().split()))\r\nprint(4-len(list(set(ask))))", "s = set(input().split())\r\nprint(4 - len(s))", "print(4 - len(set(x for x in input().split())))\r\n", "s1,s2,s3,s4 = map(int,input().split())\r\ndistinct_colors = set([s1, s2, s3, s4])\r\nr = 4 - len(distinct_colors)\r\nprint(r)", "a,b,c,d=map(int,input().split())\r\ncolor=set([a,b,c,d])\r\nans=4-len(color)\r\nprint(ans)", "c = input().split()\r\nc.sort()\r\ntot = 0\r\nfor i in range(1,4):\r\n if int(c[i]) - int(c[i - 1]) == 0:\r\n tot += 1\r\nprint(tot)", "s=list(map(int,input().split()))\r\nq=set(list(s))\r\nprint(4-len(q))\r\n", "s = set(map(int,input().split()))\r\nprint(4-len(s))", "from collections import Counter\n\nshoes = Counter(map(int, input().split()))\nres = 0\nfor shoe in shoes.values():\n if shoe > 1:\n res += shoe - 1\nprint(res)\n", "b=set(map(str,input().split()))\r\nprint(4-len(b))\r\n ", "s = input()\r\nl = s.split(' ')\r\ns1 = set(l)\r\nprint(4-len(s1))", "input_string = input()\r\nnumbers = [int(num) for num in input_string.split()]\r\ntotal_duplicates = 0\r\nseen = set()\r\nfor number in numbers:\r\n if number in seen:\r\n total_duplicates += 1\r\n else:\r\n seen.add(number)\r\nprint(total_duplicates)\r\n\r\n", "\"\"\"\nAccomplished using the JetBrains Academy plugin by JetBrains https://plugins.jetbrains.com/plugin/10081-edutools\n\nTo modify the template, go to Preferences -> Editor -> File and Code Templates -> Other\n\"\"\"\nimport sys\n\ninput = sys.stdin.readline\n\n\n############ ---- Input Functions ---- ############\n# Int inputs\ndef inp():\n return (int(input()))\n\n# List inputs\ndef inlt():\n return (list(map(int, input().split())))\n\n# For taking string inputs. list of Chars\ndef insr():\n s = input()\n return (list(s[:len(s) - 1]))\n\n# For taking space seperated integer variable inputs.\ndef invr():\n return (map(int, input().split()))\n \nif __name__ == \"__main__\":\n shoeColors = inlt()\n currentColors = set()\n\n for color in shoeColors:\n currentColors.add(color)\n\n print(4-len(currentColors))", "l=list(map(int,input().split()))\r\nse=set(l)\r\nprint(4-len(se))", "string = input()\nvals = string.split(\" \")\n\nvalSet = set(vals)\n\nprint(4 - len(valSet))\n", "s1, s2, s3, s4 = map(int, input().split())\r\nuniquecolor= set([s1, s2, s3, s4])\r\nnumberofshoes=4-len(uniquecolor)\r\nprint(numberofshoes)", "x=list(map(int,input().split()))\r\ng=[]\r\nl=[]\r\nfor i in range(len(x)):\r\n if x[i] not in l:\r\n d=x.count(x[i])\r\n if(d>1):\r\n l.append(x[i])\r\n g.append(d-1)\r\nprint(sum(g))", "lis=list(map(int,input().split()))\r\ns=set(lis)\r\nprint(len(lis)-len(s))", "x = list(map(int, input().split()))\r\n\r\ny = set(x)\r\n\r\nprint(4 - len(y))", "a, b, c, d = map(str, input().split())\r\nx=0\r\ndict = {}\r\ndict.update({a:1})\r\ndict.update({b:2})\r\ndict.update({c:3})\r\ndict.update({d:4})\r\nprint(4-len(dict))", "colors = [i for i in input().split()]\r\nsetted_colors = list(set(colors))\r\n\r\nprint(len(colors) - len(setted_colors))\r\n", "l=list(map(int,input().split()))\r\ns=list(set(l))\r\nprint(len(l)-len(s))", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n s = set(input().split())\n print(4-len(s))\n\n\t \t\t \t\t \t \t \t \t\t\t\t\t \t\t\t\t", "print(4-len(set(list(map(int,input().split())))))\r\n", "def minimum_horseshoes_to_buy(colors):\r\n distinct_colors = len(set(colors))\r\n return max(0, 4 - distinct_colors)\r\n\r\n# Read input\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate the minimum number of horseshoes to buy and print the result\r\nprint(minimum_horseshoes_to_buy(colors))\r\n", "s=list(map(int , input().split()))\r\nst=set(s)\r\nres = 4 - len(st)\r\nprint(res)", "l=set(map(int,input().split()))\r\nprint(4-len(l))", "l=list(map(int,input().strip().split()))\r\nl.sort()\r\ncnt=[]\r\nfor i in l:\r\n if i not in cnt:\r\n cnt.append(i)\r\nprint(4-len(cnt))\r\n", "ar=list(map(int,input().strip().split()))\r\nleftPairs=set(ar)\r\nprint(4-len(leftPairs))", "shoes=list(map(int,input().split()))\r\ndict_shoes={}\r\ncount=0\r\nfor i in range(len(shoes)):\r\n if shoes.count(shoes[i])>1:\r\n dict_shoes[shoes[i]]=shoes.count(shoes[i])\r\nfor value in dict_shoes.values():\r\n count+=value-1\r\nprint(count)", "a,b,c,d=map(int,input().split())\r\ns=set()\r\ns.add(a)\r\ns.add(b)\r\ns.add(c)\r\ns.add(d)\r\nprint(4-len(s))", "horseshoe=input().split()\r\nn=set(horseshoe)\r\nx=len(n)\r\nprint(4-x)\r\n", "n = set(map(int,input().split()))\nprint(4 - len(n))", "colors = list(map(int, input().split()))\r\n\r\nprint(4-len(set(colors)))", "colors = list(map(int, input().split()))\r\n\r\ndistinct_colors = set(colors)\r\nmin_horseshoes_to_buy = 4 - len(distinct_colors)\r\n\r\nprint(min_horseshoes_to_buy)\r\n", "x=list(map(int,input().split()))\r\ny=set(x)\r\nprint(len(x)-len(y))", "c=s1,s2,s3,s4=list(map(int,input().split()))\r\na=set()\r\na.update([s1,s2,s3,s4])\r\nd=len(c)-len(a)\r\nprint(d)\r\n", "a=list(map(int,input().split()))\r\nb=list(set(a))\r\nprint(len(a)-len(b))\r\n", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Calculate the number of different colors\r\nnum_colors = len(set([s1, s2, s3, s4]))\r\n\r\n# Calculate the minimum number of horseshoes to buy\r\nmin_horseshoes = 4 - num_colors\r\n\r\nprint(min_horseshoes)", "arr=list(map(int,input().split()))\r\nar=[]\r\nfor i in arr:\r\n if i not in ar:\r\n ar.append(i)\r\nprint(4-len(ar))", "l=list(map(int,input().strip().split(\" \")))\r\nl1=[]\r\nfor i in l:\r\n if i not in l1:\r\n l1.append(i)\r\nprint(4-len(l1))\r\n", "s = list(input().split())\r\nk = 0\r\ns.sort()\r\nfor i in range(len(s) - 1):\r\n if s[i] == s[i + 1]:\r\n k += 1\r\n\r\nprint(k)", "valera_shoes = input().split()\nequal_shoes = []\nfor i in range(0, 4):\n under_analysis_shoe = valera_shoes[i]\n for j in range(0, i):\n previous_shoe = valera_shoes[j]\n if under_analysis_shoe == previous_shoe:\n equal_shoes.append(previous_shoe)\n break\nprint(len(equal_shoes))\n", "c=list(map(int,input().split()))\r\nd=len(set(c))\r\nh=4-d\r\nprint(h)", "s_c=list(map(int,input().split()))\r\nmy_set=set()\r\nmy_set.update(s_c)\r\nprint(len(s_c)-len(my_set))", "l = map(int, input().split())\r\nprint(4 - len(set(l)))", "ls=list(map(int , input().split()))\r\nprint(4-len(set(ls)))", "print(4-len(set((i for i in input().split()))))\r\n", "a=list(map(int,input().split()))\r\nc=set(a)\r\nprint(len(a)-len(c))", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\nlst = [s1, s2, s3, s4]\r\nprint(len(lst) - len(set(lst)))", "horse = input()\r\n\r\nhorses = horse.split(\" \")\r\n\r\nhorsesSet=set(horses)\r\n\r\nprint(len(horses)-len(horsesSet))\r\n\r\n", "s = list(map(int, input().split()))\ns = sorted(s)\ncount = 0 \nfor i in range(len(s)-1):\n if s[i] == s[i+1]:\n count += 1\nprint(count)", "test_str = input()\nprint(4 - len(set(test_str.split(' '))))\n\n", "inputNumbers = list(map(int, input().split()))\r\n\r\nprint(len(inputNumbers) - len(set(inputNumbers)))", "s=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in s:\r\n if i not in l:\r\n l.append(i)\r\nn=len(s)-len(l)\r\nprint(n)", "x = list(set(list(map(int,input().split()))))\r\nprint(4-len(x))\r\n", "colors = list(map(int, input().split()))\r\ndis_colors = len(set(colors))\r\nadd_horse = 4 - dis_colors\r\nadd_horse = max(0, add_horse)\r\nprint(add_horse)", "from collections import Counter\r\ns = Counter(list(map(int, input().split())))\r\nprint(4 - len(s))", "arr=list(map(int,input().split()))\r\nl=set(arr)\r\nprint(len(arr)-len(l))", "colours = [int(x) for x in input().split()]\r\nhorseshoes_needed = 4 - len(set(colours))\r\nprint(horseshoes_needed)", "\r\ns = input()\r\nx = set(map(int, s.split(\" \")))\r\nprint(4 - len(x))\r\n\r\n", "s1, s2, s3, s4 = [int(x) for x in input().split()]\r\n\r\nprint(4 - len(set([s1, s2, s3, s4])))\r\n", "\r\n\r\nnumberOfshoes = input()\r\nnumberOfshoes = numberOfshoes.split(\" \")\r\nuniqueOnes=[]\r\nfor i in numberOfshoes:\r\n if i not in uniqueOnes:\r\n uniqueOnes.append(i)\r\nprint(4-len(uniqueOnes))\r\n", "l=list(map(int,input().split()))\r\nif(len(set(l))==len(l)):\r\n print(\"0\")\r\nelse:\r\n print(len(l)-len(set(l)))", "# Read the colors of the horseshoes Valera has\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate the number of distinct colors\r\ndistinct_colors = len(set(colors))\r\n\r\n# Calculate the minimum number of horseshoes Valera needs to buy\r\nmin_horseshoes_to_buy = 4 - distinct_colors\r\n\r\n# Ensure the result is non-negative\r\nmin_horseshoes_to_buy = max(0, min_horseshoes_to_buy)\r\n\r\n# Print the result\r\nprint(min_horseshoes_to_buy)\r\n", "inp = lambda: list(map(int , input().split()))\r\nsrr = inp()\r\n\r\n\r\nprint(len(srr) - len(set(srr)))\r\n", "a=set(map(int,input().split()))\r\nprint(4-len(a))", "lista = list(map(int, input(\"\").split()))\r\ndict = {}\r\nfor i in range(len(lista)):\r\n if lista.count(lista[i])>1:\r\n if lista[i] not in dict:\r\n dict[lista[i]] = lista.count(lista[i])\r\nsoma = 0\r\nfor i in dict.values():\r\n soma += i-1\r\nprint(soma)", "a = set(map(int,input().split()))\r\nprint( 4 - len(a))\r\n", "d=list(map(int,input().split()))\r\nco=0\r\nfor i in range(len(d)):\r\n ss=d.count(d[i])\r\n if(ss>1):\r\n while ss!=1:\r\n d[i]=\".\"\r\n ss=1\r\n co+=1\r\nprint(co)\r\n", "a,b,c,d=list(map(int,input().split()))\r\ng={a,b,c,d}\r\nprint(4-len(g))", "# Hamza nachid Template\r\nimport sys\r\nfrom math import ceil\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef read_int():\r\n return int(input().strip())\r\n\r\n\r\ndef read_int_list():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef read_int_set():\r\n return set(map(int, input().split()))\r\n\r\n\r\ndef read_string():\r\n return input().strip()\r\n\r\n\r\nl=read_int_set()\r\nprint(4-len(l))\r\n\r\n\r\n\r\n\r\n\r\n", "a=list(map(int, input().split()))\r\ns=set()\r\nfor i in a:\r\n s.add(i)\r\nprint(4-len(s))\r\n", "print(4 - len(list(set(map(int, input().split())))))", "a=list(set(list(map(int,input().split()))))\r\nprint(4-len(a))\r\n", "arr = list(set(map(int, input (). split ())))\r\nif len(arr) >= 4:\r\n print (0)\r\nelse:\r\n print(4-len(arr))", "s1, s2, s3, s4 = (map(int, input().split()))\r\nlst = []\r\nlst.append(s1)\r\nlst.append(s2)\r\nlst.append(s3)\r\nlst.append(s4)\r\n\r\ns = set(lst)\r\n\r\nif len(s) == 4:\r\n print(0)\r\nelse:\r\n print(4 - len(s))\r\n\r\n", "horseshoes = list(map(int, input().split())) \r\ndistinct_colors = len(set(horseshoes)) \r\nneeded_horseshoes = 4 - distinct_colors\r\nprint(needed_horseshoes)\r\n", "n = input().split()\nprint(len(n) - len(set(n)))", "def min_additional_horseshoes(colors):\r\n return 4 - len(set(colors))\r\n\r\n\r\ncolors = list(map(int, input().split()))\r\n\r\nresult = min_additional_horseshoes(colors)\r\nprint(result)\r\n", "horseshoes = list(map(int, input().split()))\r\nunique_colors = len(set(horseshoes))\r\nadditional_horseshoes_needed = 4 - unique_colors\r\nif additional_horseshoes_needed < 0:\r\n additional_horseshoes_needed = 0\r\nprint(additional_horseshoes_needed)\r\n", "def minimum_horseshoes(col):\r\n distinct_colors = len(set(col))\r\n return max(0, 4 - distinct_colors)\r\ncol = list(map(int, input().split()))\r\nres = minimum_horseshoes(col)\r\nprint(res)\r\n", "cls=list(map(int,input().split()))\r\ndcls=set(cls)\r\nmin1=4-len(dcls)\r\nprint(min1)\r\n", "a = set(map(int, input().split()))\r\nprint(4-len(a))", "n=set(map(int,input().split()))\r\nnum=len(n)\r\nprint(4-num)", "n=list(int(i) for i in input().split())\r\nm=set(n)\r\nprint(len(n)-len(m))", "s=input().split()\r\nprint(len(s)-len(set(s)))\r\n", "h = input().split()\nc = []\nfor elem in h:\n if elem not in c:\n c.append(elem)\nprint(4 - len(c))", "import math\r\n\r\nL=list(map(int,input().split()))\r\ns=set(L)\r\nprint(4-len(s))\r\n", "s = list(map(int, input().split()))\ns.sort()\ntotal = 0\n\nfor i in range(3):\n if s[i+1] == s[i]:\n total += 1\n\nprint(total)", "a, b, c, d = map(int, input().split())\r\nbr = 0\r\nif a == b or a == c or a == d:\r\n br += 1\r\nif b == c or b == d:\r\n br += 1\r\nif c == d:\r\n br += 1\r\nprint(br)", "sandar = list(map(int, input().split()))\r\nset_san = set(sandar)\r\nprint(len(sandar)- len(set_san))", "lst = list(map(int,input().split(' ')))\r\nx = list(set(lst))\r\nprint(abs(len(x)-4))", "x = list(map(int,input().split()))\r\n\r\narr = []\r\nnum = 0\r\nfor i in range(len(x)):\r\n if x[i] in arr:\r\n num += 1\r\n continue\r\n else:\r\n arr.append(x[i])\r\n \r\nprint(num) ", "nums = [int(x) for x in input().split()]\r\nprint(len(nums) - len(set(nums)))\r\n", "arr = list(map(int, input().split()))\r\n\r\nc = 0\r\n\r\nfor i in range(len(arr)):\r\n t = arr[i]\r\n arr[i] = 1e9\r\n if t in arr:\r\n c = c + 1\r\n\r\nprint(c)", "x=list(map(int ,input().split()))\r\nlist1=[]\r\nfor i in x:\r\n if(i not in list1):\r\n list1.append(i)\r\nk=len(list1)\r\nprint(abs(4-k)) ", "def sol():\r\n l=list(map(int,input().split(\" \")))\r\n print(4-len(set(l)))\r\nsol()", "# Read input\ns1, s2, s3, s4 = map(int, input().split())\n\n# Count the distinct colors Valera already has\ndistinct_colors = len(set([s1, s2, s3, s4]))\n\n# Calculate the minimum number of additional horseshoes needed\nadditional_horseshoes_needed = 4 - distinct_colors\n\n# Print the result\nprint(additional_horseshoes_needed)\n", "l=list(map(int,input().split()))\r\na=[]\r\nfor i in l:\r\n if i in a:\r\n continue\r\n else:\r\n a.append(i)\r\nprint(4-len(a))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 19 15:09:03 2023\n\n@author: huangxiaoyuan\n\"\"\"\na,b,c,d=map(int, input().split())\nif min(a,b,c,d)>=1 and max(a,b,c,d)<=10**9:\n list1=[a,b,c,d]\n k=len(list1)\n list2=set(list1)#这里用集合，实现了相同元素的合并\n j=len(list2)\nprint(k-j)\n\n\n\n", "colors = set(map(int, input().split()))\r\nmin_horseshoes = 4 - len(colors)\r\nprint(min_horseshoes)\r\n", "n = input().split()\r\nprint(len(n) - len(set(n)))", "colors = list(map(int, input().split()))\r\ncolors_ = set(colors)\r\na = 4\r\nb = a - len(colors_)\r\nprint(b)\r\n", "podkova = list(map(int,input().split()))\r\nnew = set(podkova)\r\nprint(4 - len(new))", "# Решение задач проекта CODEFORSES, Задача 228A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Не смешите мои подковы\r\nограничение по времени на тест2 секунды\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nКонь Валера собрался с друзьями на вечеринку. Он давно следит за тенденциями моды и поэтому знает,\r\nчто сейчас очень популярно носить все подковы разного цвета. С прошлого года у Валеры остались\r\nчетыре подковы, но, возможно, некоторые из них имеют одинаковый цвет. В этом случае, чтобы не\r\nударить в грязь лицом перед своими стильными товарищами, ему нужно сходить в магазин и купить\r\nдополнительно несколько каких-нибудь подков.\r\n\r\nК счастью в магазине продаются подковы всех возможных цветов, и у Валеры имеется достаточно денег,\r\nчтобы купить любые четыре. Однако в целях экономии он хотел бы потратить как можно меньше денег,\r\nпоэтому вам нужно помочь Валере и определить, какое минимальное количество подков нужно купить,\r\nчтобы он смог надеть на вечеринку четыре подковы различного цвета.\r\n\r\nВходные данные\r\nВ первой строке через пробел записаны четыре целых числа s1, s2, s3, s4 (1 ≤ s1, s2, s3, s4 ≤ 109)\r\n— цвета подков, имеющихся у Валеры.\r\n\r\nСчитайте, что все возможные цвета пронумерованы целыми числами.\r\n\r\nВыходные данные\r\nВыведите единственное целое число — минимальное количество подков, которое нужно купить.\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=[int(i) for i in input().split()]\r\nans = 4 - len(set(a1))\r\nprint(ans)", "s= list(map(int, input().split()))\r\nse=set(s)\r\nprint(4-len(se))", "x=input()\r\nx=x.split()\r\nc=0\r\n\r\n\r\nfor j,i in enumerate(x):\r\n if (i) in x and i in x[:j]:\r\n c=c+1 \r\nprint(c)\r\n", "def minimum_horseshoes_to_buy(s1, s2, s3, s4):\r\n distinct_colors = set([s1, s2, s3, s4])\r\n additional_horseshoes_needed = 4 - len(distinct_colors)\r\n return additional_horseshoes_needed\r\n\r\n# Input\r\ns1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = minimum_horseshoes_to_buy(s1, s2, s3, s4)\r\nprint(result)\r\n", "my_str=input()\r\na=my_str.split()\r\nb=set(a)\r\nprint(4-len(b))", "from collections import Counter\r\nL = list(map(int, input().split()))\r\nC, P = Counter(L), []\r\nfor element, count in C.items():\r\n P.append(element)\r\nprint(4-len(P))", "def IsYourHorseshoeOnTheOtherHoof(): #not finished\r\n horseshoesInput = input()\r\n horseshoesInputArr = horseshoesInput.split(\" \")\r\n mainArr = [[0]*4 for j in range(2)]\r\n i = 0\r\n #print(mainArr)\r\n while (i < len(horseshoesInputArr)):\r\n i2 = 0\r\n while (i2 < len(horseshoesInputArr)):\r\n if (int(horseshoesInputArr[i]) == int(mainArr[0][i2])):\r\n mainArr[1][i2] = -20\r\n i2 += 1\r\n mainArr[0][i] = horseshoesInputArr[i]\r\n i += 1\r\n i3 = 0\r\n minHorseShoe = 0\r\n while (i3 < len(horseshoesInputArr)):\r\n if(mainArr[1][i3] == int(\"-20\")):\r\n minHorseShoe += 1\r\n i3 += 1\r\n print(minHorseShoe)\r\n \r\n\r\n '''\r\n noDistinct = 0\r\n distinct = True\r\n distinctPairs = 0\r\n i = 0 \r\n while (i < len(horseshoesInputArr)):\r\n i2 = 0\r\n distinct = True\r\n while (i2 < len(horseshoesInputArr)):\r\n if (i2 != i):\r\n if (horseshoesInputArr[i2] == horseshoesInputArr[i]):\r\n distinct = False\r\n distinctPairs += 1\r\n break\r\n i2 += 1\r\n if (distinct == True):\r\n noDistinct += 1\r\n i += 1\r\n noDistinct += distinctPairs\r\n print(len(horseshoesInputArr) - noDistinct)\r\n '''\r\n '''\r\n sameValue = 0\r\n horseshoeNumber = 0\r\n i = 0\r\n while (i < len(horseshoesInputArr)):\r\n i2 = 0\r\n horseshoeNumber = 0\r\n while (i2 < len(horseshoesInputArr)):\r\n if (i != i2):\r\n if (horseshoesInputArr[i] == horseshoesInputArr[i2]):\r\n horseshoeNumber += 1\r\n print(horseshoesInputArr[i] + \" \" + horseshoesInputArr[i2])\r\n i2 += 1\r\n sameValue += horseshoeNumber\r\n i += 1\r\n print(sameValue)\r\n '''\r\nIsYourHorseshoeOnTheOtherHoof()", "s=input().split()\r\nd=set()\r\nfor i in range(4):\r\n x=int(s[i])\r\n d.add((s[i]))\r\nprint (4-(len(d)))\r\n", "def min_horseshoes_to_buy(s1, s2, s3, s4):\r\n colors = set([s1, s2, s3, s4])\r\n return 4 - len(colors)\r\n\r\n# Example usage\r\ns1, s2, s3, s4 = map(int, input().split())\r\nprint(min_horseshoes_to_buy(s1, s2, s3, s4))", "h = list(map(int, input().split()))\r\n\r\nu = len(set(h))\r\na = 4 - u\r\n\r\nif a < 0:\r\n a = 0\r\n \r\nprint(a)", "l = list(map(int,input().split()))\r\ns = set(l)\r\nprint(len(l)-len(s))", "colors = list(map(int, input().split()))\r\n\r\nunique_colors = len(set(colors))\r\nhorseshoes_to_buy = 4 - unique_colors\r\n\r\nprint(horseshoes_to_buy)\r\n", "def solve(arr):\r\n d={}\r\n mx=0\r\n for i in arr:\r\n d[i]=d.get(i,0)+1\r\n \r\n sm=0\r\n for k,v in d.items():\r\n sm+=v-1\r\n print(sm)\r\n\r\narr=list(map(int,input().split()))\r\nsolve(arr)", "horseshoes = input().split()\r\n\r\ncount = {}\r\n\r\nfor hs in horseshoes:\r\n if hs in count:\r\n count[hs] += 1\r\n else:\r\n count[hs] = 1 \r\n\r\nsame_hs = 0\r\n\r\nfor value in count.values():\r\n if value > 1:\r\n same_hs += value - 1\r\n \r\nprint(same_hs)\r\n ", "arr = set(map(int,input().split()))\r\nprint(4 - len(arr))", "color = list(map(int, input().split()))\nunique_colors = len(set(color))\nprint(4 - unique_colors)\n\t \t \t\t\t\t \t \t \t\t \t \t \t \t\n\t \t\t\t \t\t\t\t \t\t\t \t\t \t\t\t\t\t", "valera_origin_has_horseshoes = 4 \nhorseshoe_colors = input().split(' ')\nunique_colors = set(horseshoe_colors)\n\nprint(valera_origin_has_horseshoes - len(unique_colors))", "a=input().split()\r\nn=[]\r\nfor i in a:\r\n if i not in n:\r\n n.append(i)\r\nprint(4-len(n))", "colors = list(map(int, input().split()))\r\nunique_colors = len(set(colors)) # Count the unique colors Valera has\r\nneeded_horseshoes = 4 - unique_colors # Calculate the number of additional horseshoes needed\r\nprint(needed_horseshoes)\r\n", "s1, s2, s3, s4 = map(int, input().split())\r\nans = 0\r\ncount = 1\r\nif s1 != s2 and s1 != s3 and s1 != s4:\r\n count += 1\r\nif s2 != s3 and s2 != s4:\r\n count += 1\r\nif s3 != s4:\r\n count += 1\r\nans = 4 - count\r\nprint(ans)", "print(4-len(set([int(i) for i in input().split()])))", "l=list(map(int,input().split()))\r\nb=set(l)\r\nprint(len(l)-len(b))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 17:39:00 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nset1=set(input().split())\r\nprint(4-len(set1))", "COLORS = list(map(int,list(input().split())))\r\n\r\nhave_colors = []\r\nnum_of_colors = 0\r\n\r\nfor color in COLORS:\r\n if color not in have_colors:\r\n have_colors.append(color)\r\n num_of_colors += 1\r\n\r\nprint(max(4 - num_of_colors,0))", "colors = list(map(int, input().split()))\r\nunique_colors = set(colors)\r\nneeded_horseshoes = 4 - len(unique_colors)\r\nprint(needed_horseshoes)\r\n", "a = list(map(int, input().split()))\r\n\r\nsets = set(a)\r\n\r\nprint(4 - len(sets))\r\n", "count_horseshoe = set(map(int, input().split()))\r\nprint(4-len(count_horseshoe))\r\n", "\r\nb=list(map(int,input().split()))\r\nl=[]\r\nfor i in b:\r\n if i not in l:\r\n l.append(i)\r\nprint(4-len(l))\r\n \r\n \r\n", "p = list(map(int,input().split()))\r\na = [0]*4\r\nk = 0\r\nfor i in range(4):\r\n for j in range(i+1,4):\r\n if p[i] == p[j] and p[i] != -1:\r\n p[j] = -1\r\n k += 1\r\nprint(k)\r\n", "s=input()\r\ns=s.split()\r\nl=list(s)\r\nst=set(l)\r\nprint(4-len(st))", "m=map(int,input().split())\r\nm=list(m)\r\nprint(len(m)-len(set(m)))\r\n", "l=list(map(int,input().strip().split()))\r\nif 1<=len(l)<=100:\r\n c=[]\r\n for i in l:\r\n if i not in c:\r\n c.append(i)\r\n print(len(l)-len(c))", "a = [int(i) for i in input().split()]\r\ncount = {}\r\nres = 0\r\nfor i in a:\r\n count[i] = count.get(i, 0) + 1\r\n \r\nfor i in count:\r\n if count[i] > 1:\r\n res += (count[i] - 1)\r\n\r\nprint(res)", "horseshoes = list(map(int, input().split()))\r\ndistinct_colors = len(set(horseshoes))\r\nmin_horseshoes_needed = 4 - distinct_colors\r\nprint(min_horseshoes_needed)\r\n", "arr=list(map(int,input().split()))\r\nn=len(arr)\r\nm=len(set(arr))\r\nprint(n-m)", "x = input().split(\" \")\r\notherarray3ashanzah2an = []\r\ncount = 0\r\nfor i in x:\r\n if i in otherarray3ashanzah2an:\r\n count = count + 1\r\n else:\r\n otherarray3ashanzah2an.append(i)\r\nprint(count)\r\n\r\n", "lst = [int(i) for i in input().split()]\r\nd = {}\r\nfor i in lst:\r\n d[i] = d.get(i,0)+1\r\ncnt = 0\r\nfor i in d:\r\n cnt += (d[i]-1)\r\nprint(cnt)", "l = list(map(int,input().split()))\r\nprint(len(l)-len(set(l)))\r\n", "print(4-len(set(map(int, input().split()))))", "s = set(input().split())\r\nprint(4-len(s))\r\n", "a = list(map(int,input().split()))\r\nr = [*set(a)]\r\nprint (len(a) - len(r))", "a=input()\r\nb=a.split()\r\nb.sort()\r\nd=0\r\nfor i in range(3):\r\n if b[i]==b[i+1]:\r\n d+=1\r\nprint(d)", "a,b,c,d=list(map(int,input().split()))\r\ns=set([a,b,c,d])\r\nm=4-len(s)\r\nprint(m)", "colors = list(map(int, input().split()))\r\nun = len(set(colors))\r\nc = max(0, 4 - un)\r\nprint(c)\r\n", "a = input().split()\r\na.sort()\r\ncount = 0\r\nfor i in range(1, len(a)):\r\n if a[i] == a[i-1]:\r\n count += 1\r\nprint(count)\r\n", "a , k = input().split(' ') , 0\r\na.sort()\r\nfor i in range(len(a)-1):\r\n if a[i]==a[i+1]:\r\n k+=1\r\nprint(k)\r\n", "x = list(map(int, input().split()))\r\nprint(4 - len(set(x)))", "ncolor = list(map(int, input().split()))\r\nbuy = 0\r\ndistinct_colors = set()\r\n\r\nfor color in ncolor:\r\n if color in distinct_colors:\r\n buy += 1\r\n else:\r\n distinct_colors.add(color)\r\n\r\nif buy > 0:\r\n print(buy)\r\nelse:\r\n print(4 - len(distinct_colors))", "n = set(input().split())\r\nprint(4-len(n))\r\n", "# Read the colors of horseshoes Valera has\r\ns1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Create a set to store unique colors and count how many colors Valera already has\r\nunique_colors = set([s1, s2, s3, s4])\r\ncolors_count = len(unique_colors)\r\n\r\n# Calculate the minimum number of horseshoes Valera needs to buy\r\nminimum_horseshoes_to_buy = max(0, 4 - colors_count)\r\n\r\n# Print the result\r\nprint(minimum_horseshoes_to_buy)\r\n", "txt=input()\na=txt.split()\nsum=0\nfor i in range (4):\n for j in range(i+1,4):\n if(a[i]==a[j]):\n sum+=1\n break\n\n\n\nprint(sum)\n\n\t \t \t \t \t\t\t\t\t\t\t\t \t\t \t\t", "l = map(int, input().split(\" \"))\r\nl=set(l)\r\nprint(4- len(l))", "kl=list(map(int,input().split()))\r\ns=set(kl)\r\nif len(s)<4:\r\n print(4-len(s))\r\nelse:\r\n print(0)", "l = list(map(int,input().split()))\r\nprint(4 - len(set(l)))", "lst = list(map(int, input().split(\" \")))\r\nst = set(lst)\r\nshoe = 4-len(st)\r\nprint(shoe)\r\n", "n= list(map(int, input().split()))\r\nprint(len(n)-len(set(n)))", "txt=input()\nshoes=txt.split()\n\nnum_shoes=0\nfor i in range (4):\n for j in range (i+1,4):\n if(shoes[i]==shoes[j]):\n num_shoes+=1\n break\n\n\n\nprint(num_shoes)\n\n\n\n\t \t \t\t\t\t \t \t\t \t\t\t\t \t", "'''\r\n==TEST CASE==\r\nInput:\r\n1 7 3 3\r\n\r\n652588203 931100304 931100304 652588203\r\n\r\nOutput:\r\n1\r\n\r\n3\r\n'''\r\nprint(4-len(set(input().split())))", "t = []\nfor i in input().split():\n if i not in t:\n t.append(i)\nprint(4-len(t))\n", "INF = 1e10+7\r\ncnt = 0\r\narr = list(map(int,input().split()))\r\nif(len(set(arr))==1):\r\n print(3)\r\nelse:\r\n for i in range(len(arr)):\r\n if(arr.count(arr[i])!=1):\r\n cnt+=1\r\n arr[i] = INF+1\r\n else:\r\n continue\r\n print(cnt)\r\n", "#inp : colors that valera has , what is the minimum no. of he needs to buy\r\n# loop through each color, if color appears twice , thrice, we need 2 \r\nl = []\r\nn = input().split(\" \")\r\n\r\nfor i in n:\r\n if i not in l:\r\n l.append(i)\r\n\r\nprint(4-len(l))", "has = list(map(int, input().split()))\r\nl = []\r\nfor x in has:\r\n if x not in l:\r\n l.append(x)\r\nprint(4-len(l))", "# 228A - Is your horseshoe on the other hoof? \r\n# https://codeforces.com/problemset/problem/228/A\r\n\r\n# Inputs:\r\n# 1) Índices de color de las herraduras \r\ncolores = list(map(int, input().split()))\r\n\r\n# ¿Cuántos colores poseo actualmente?\r\ncolores_actuales = len(set(colores))\r\n\r\n# ¿Cuántos colores me faltan para tener de 4 tipos?\r\ncolores_faltantes = 4 - colores_actuales\r\n\r\n# Imprime el número de herraduras de distinto color que debo comprar\r\nprint(colores_faltantes)", "a=list(map(int,input().split()))\r\nh=len(a)\r\nl=set()\r\nfor i in a:\r\n l.add(i)\r\np=len(l)\r\nprint(h-p)\r\n\r\n", "d = {}\r\nfor i in input().split():\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i] = 1\r\nsum = 0\r\nfor i in d:\r\n sum+=d[i]-1\r\n\r\nprint(sum)\r\n ", "n=list(map(int,input().split()))\r\nd=set(n)\r\nprint(len(n)-len(d))\r\n", "arr = list(map(int,input().split()))\r\narrS = set(arr)\r\nprint(len(arr)-len(arrS))\r\n", "s = input().split()\r\nprint(abs(len(set(s)) - 4))", "a = [int(x) for x in input().split()]\r\nv = []\r\nfor num in a:\r\n if num not in v:\r\n v.append(num)\r\nprint(len(a) - len(v))", "l=list(map(int,input().split()))\r\nd=[]\r\nfor i in l:\r\n if i not in d:\r\n d.append(i)\r\nprint(len(l)-len(d))", "horseshoes = list(map(int, input().split()))\r\n\r\n# Count the distinct colors of horseshoes Valera has.\r\ndistinct_colors = len(set(horseshoes))\r\n\r\n# Calculate how many additional horseshoes Valera needs to buy.\r\nadditional_horseshoes = 4 - distinct_colors\r\n\r\n# Ensure that the result is non-negative.\r\nadditional_horseshoes = max(0, additional_horseshoes)\r\n\r\nprint(additional_horseshoes)\r\n", "colors = list(map(int, input().split()))\r\nunique_colors = set(colors)\r\nadditional_horseshoes = 4 - len(unique_colors)\r\nprint(additional_horseshoes)\r\n", "n = list(map(int,input().split()))\r\nb = set(n)\r\nh = 4\r\nif b != 4:\r\n h -= len(b)\r\nprint(h)", "# def width_cal():\r\n# person_n_height = list(map(int,input().strip().split()))[:2]\r\n# n_person = person_n_height[0]\r\n# height = person_n_height[1]\r\n# list_of_heights = list(map(int,input().strip().split()))[:n_person]\r\n# width = 0\r\n# for person in range(len(list_of_heights)):\r\n# if list_of_heights[person]>height:\r\n# width+=2\r\n# else:\r\n# width+=1\r\n# return width\r\n# print(width_cal())\r\n\r\n# def winer():\r\n# num_round = int(input())\r\n# winner_list = list(input().upper())\r\n# count_A = 0\r\n# count_D = 0\r\n# for name in winner_list:\r\n# if name=='A':\r\n# count_A +=1\r\n# if name =='D':\r\n# count_D +=1\r\n# winner = 'Friendship'\r\n# if count_A>count_D:\r\n# winner = 'Anton'\r\n# return winner\r\n# if count_A < count_D:\r\n# winner = 'Danik'\r\n# return winner\r\n# return winner\r\n# print(winer())\r\n\r\n#3\r\n# def bear_bigbrother():\r\n# wt_list = list(map(int,input().strip().split()))\r\n# limak_wt = wt_list[0]\r\n# bob_wt = wt_list[1]\r\n# num_year = 0\r\n# while limak_wt<=bob_wt:\r\n# limak_wt *=3\r\n# bob_wt *= 2\r\n# num_year+=1\r\n# if limak_wt>bob_wt:\r\n# return num_year\r\n# print(bear_bigbrother())\r\n\r\n#4\r\n# def a_team():\r\n# num_problem = int(input())\r\n# # confdnce_list = []\r\n# n_confidence = 0\r\n# for i in range(num_problem):\r\n# known_list = list(map(int,input().strip().split()))[:3]\r\n# sum_known = sum(known_list)\r\n# if sum_known>1:\r\n# n_confidence+=1\r\n# return n_confidence \r\n# print(a_team())\r\n\r\n#5\r\n# def beautiful_matrix():\r\n# beautiful_index = [2,2]\r\n# index_of_1 = []\r\n# for i in range(5):\r\n# input_list = list(map(int,input().strip().split()))[:5]\r\n# if 1 in input_list:\r\n# index = input_list.index(1)\r\n# index_of_1.extend([i,index])\r\n# minimum_step = abs(index_of_1[0]-beautiful_index[0])+abs(index_of_1[1]-beautiful_index[1])\r\n# return minimum_step\r\n# print(beautiful_matrix())\r\n\r\n#6\r\n# def gravity_flip():\r\n# n_col = int(input())\r\n# list_of_element = list(map(int,input().split()))[:n_col]\r\n# reverse_list = sorted(list_of_element,reverse=False)\r\n# reverse_list_1 = \" \".join(map(str,reverse_list))\r\n# return (reverse_list_1)\r\n# print(gravity_flip())\r\n\r\n#7\r\n# def petya_strings():\r\n# eng_letters = [chr(ord('a')+i) for i in range(26)]\r\n# string_a = input().lower()\r\n# # string_a = sorted(string_a)\r\n# string_b = input().lower()\r\n# # string_b = sorted(string_b)\r\n# if len(string_a)!=len(string_b):\r\n# return None\r\n# for i in range(len(string_a)):\r\n# let_a = string_a[i]\r\n# let_b = string_b[i]\r\n# index_a = eng_letters.index(let_a)\r\n# index_b = eng_letters.index(let_b)\r\n# if index_a > index_b:\r\n# return 1\r\n# if index_a < index_b:\r\n# return -1\r\n# return 0\r\n# print(petya_strings())\r\n\r\n#8\r\n# def boy_or_girl():\r\n# user_name = input()\r\n# if len(user_name)>100:\r\n# return None\r\n# unique_name = [*set(user_name)]\r\n# if len(unique_name)%2==0:\r\n# return 'CHAT WITH HER!'\r\n# return 'IGNORE HIM!'\r\n\r\n# print(boy_or_girl())\r\n\r\n#9\r\n# def Aword():\r\n# input_word = input()\r\n# upper_letter = [chr(ord('A')+i) for i in range(26)]\r\n# # lower_letter = [chr(ord('a')+i) for i in range(26)]\r\n# upper_count = 0\r\n# lower_count = 0\r\n# for letter in input_word:\r\n# if letter in upper_letter:\r\n# upper_count+=1\r\n# else:\r\n# lower_count+=1\r\n# if upper_count>lower_count:\r\n# input_word = input_word.upper()\r\n# return input_word\r\n# if upper_count<lower_count:\r\n# input_word = input_word.lower()\r\n# return input_word\r\n# return input_word.lower()\r\n# print(Aword())\r\n\r\n#10\r\n# def Magnet():\r\n# num_magnet = int(input())\r\n# group = 1\r\n# first_magnet = input()\r\n# for i in range(1,num_magnet):\r\n# next_magnet = input()\r\n# if first_magnet!=next_magnet:\r\n# group+=1\r\n# first_magnet=next_magnet\r\n# return group\r\n# print(Magnet())\r\n\r\n#11\r\n# def sereja_dima():\r\n# num_card = int(input())\r\n# list_of_card_numb = list(map(int,input().split(' ')))[:num_card]\r\n# sreja = []\r\n# dima = []\r\n# while len(list_of_card_numb)>0:\r\n# max_sereja = max(list_of_card_numb[0],list_of_card_numb[-1])\r\n# sreja.append(max_sereja)\r\n# list_of_card_numb.remove(max_sereja)\r\n# # list_of_card_numb = new_list\r\n# if len(list_of_card_numb)>0:\r\n# max_dima = max(list_of_card_numb[0],list_of_card_numb[-1])\r\n# dima.append(max_dima)\r\n# list_of_card_numb.remove(max_dima)\r\n# # list_of_card_numb = new_list\r\n# if len(list_of_card_numb)==0:\r\n# break\r\n# sum_sereja = str(sum(sreja))\r\n# sum_dima = str(sum(dima))\r\n# return_list = [sum_sereja,sum_dima]\r\n# return ' '.join(return_list)\r\n# print(sereja_dima())\r\n\r\n#12\r\n# def stones_on_the_table():\r\n# num_stone = int(input())\r\n# color_name = input()\r\n# color_list = [i for i in color_name][:num_stone]\r\n# first_index = 0\r\n# global_count = 0\r\n# def get_count(list_ele,first):\r\n# count=0\r\n# while (first< (len(list_ele)-1)) and (len(list_ele)>1) :\r\n# if list_ele[first] == list_ele[first+1]:\r\n# list_ele.remove(list_ele[first+1])\r\n# count +=1\r\n# else:\r\n# break\r\n# return list_ele,int(count)\r\n \r\n# while first_index < (len(color_list)-1):\r\n# modified_list,count_mod = get_count(color_list,first_index)\r\n# color_list = modified_list\r\n# global_count += count_mod\r\n# first_index +=1\r\n# return global_count\r\n# print(stones_on_the_table())\r\n\r\n#13\r\n# def Police_Recruits():\r\n# num_event = int(input())\r\n# list_event = list(map(int,input().split()))[:num_event]\r\n# crime_count = -1\r\n# police_recruit = 0\r\n# unsolved_crime = 0\r\n# for i in range(num_event):\r\n# if list_event[i] ==-1:\r\n# # crime_count+=1\r\n# solved = police_recruit+crime_count\r\n# if (solved)<=(-1):\r\n# unsolved_crime +=1\r\n# else:\r\n# police_recruit = solved\r\n \r\n# else:\r\n# police_recruit+=list_event[i]\r\n# return unsolved_crime\r\n# print(Police_Recruits())\r\n\r\n#14\r\n# def Black_Square():\r\n# calory_list = list(map(int,input().split()))[:4]\r\n# index_of_strip = input()\r\n# total_calory = 0\r\n# for i in index_of_strip:\r\n# if int(i) <= len(calory_list):\r\n# total_calory += calory_list[int(i)-1]\r\n\r\n# return total_calory\r\n# print(Black_Square())\r\n\r\n#15\r\n# def Night_at_the_Museum():\r\n# input_name = input().lower()[:100]\r\n# lower_letter = [chr(ord('a')+i) for i in range(26)]\r\n# move_distance = 0\r\n# prev_pos = 1\r\n\r\n# for letter in input_name:\r\n# indx_letter = (lower_letter.index(letter))+1\r\n# if indx_letter>=prev_pos:\r\n# dist = min((indx_letter-prev_pos),(len(lower_letter)-indx_letter+prev_pos))\r\n# prev_pos = indx_letter\r\n# move_distance +=dist\r\n# if indx_letter<prev_pos:\r\n# dist = min((prev_pos-indx_letter),(len(lower_letter)+indx_letter-prev_pos))\r\n# prev_pos = indx_letter\r\n# move_distance +=dist\r\n# return move_distance\r\n\r\n# print(Night_at_the_Museum())\r\n\r\n#16\r\n# def A_games():\r\n# num_teams = int(input())\r\n# num_teams = num_teams if 2<=num_teams<=30 else None\r\n# drescode_list = []\r\n# total_guest_jearsy = 0\r\n# for i in range(num_teams):\r\n# dress_codes = tuple(list(map(int,input().split()))[:2])\r\n# drescode_list.append(dress_codes)\r\n# for i in range(len(drescode_list)):\r\n# for j in range(i+1,len(drescode_list)):\r\n# t1_home = drescode_list[i][0],drescode_list[j][1]\r\n# if t1_home[0]==t1_home[1]:\r\n# total_guest_jearsy+=1\r\n# t2_home = drescode_list[i][1],drescode_list[j][0]\r\n# if t2_home[0]==t2_home[1]:\r\n# total_guest_jearsy+=1\r\n# # drescode_and_away_jearsey = []\r\n# # drescode_and_away_jearsey.append(drescode_list)\r\n# # drescode_and_away_jearsey.append(total_guest_jearsy)\r\n# # return drescode_and_away_jearsey\r\n# return total_guest_jearsy \r\n# print(A_games())\r\n\r\n#17\r\n# def buy_a_Shovel():\r\n# input_list = list(map(int,input().split()))[:2]\r\n# shovel_price = input_list[0] if 1<=input_list[0]<=1000 else None\r\n# lower_denom = input_list[1] if 1<=input_list[1]<=9 else None\r\n# num_shovel = 0\r\n# i = True\r\n# j = 1\r\n# while i :\r\n# if (((shovel_price*j)-lower_denom)%10 == 0) or ((shovel_price*j)%10==0) :\r\n# num_shovel = j\r\n# i = False\r\n \r\n# else:\r\n# j +=1\r\n# i = True\r\n# return num_shovel\r\n# print(buy_a_Shovel())\r\n\r\n#18\r\ndef horse_shoe():\r\n shoe_avail = list(map(int,input().split()))[:4]\r\n # shoe_avail = shoe_avail if 1<=len(shoe_avail)<10**9 else None\r\n unique_col = len(set(shoe_avail))\r\n required_num_col = len(shoe_avail)-unique_col\r\n return required_num_col\r\n\r\nprint(horse_shoe())\r\n\r\n", "ans=0\na=list(map(int,input().split()))\na.sort()\nfor i in range(1,4):\n if a[i]==a[i-1]:\n ans+=1 \nprint(ans)\n \t \t \t \t \t\t\t\t\t\t \t\t \t\t\t \t \t", "arr = list(map(int, input().split()))\r\nmyD = {x: arr.count(x) for x in arr}\r\nprint(4-len(myD))", "a=list(map(int,input().split()))\r\na1=set(a)\r\nprint(abs(len(a1)-len(a)))", "colours=input().split()\r\nv_c=[]\r\nb=0\r\nfor i in colours:\r\n if i in v_c:\r\n b+=1\r\n else:\r\n v_c+=[i]\r\nprint(b)\r\n", "a = list(map(int,input().strip().split()))\r\ns = set(a)\r\nprint(len(a) - len(s))", "lst = sorted(list(map(int,input().split())))\r\nk = 1\r\nfor i in range(int(len(lst))-1):\r\n if lst[i] != lst[i+1]:\r\n k += 1\r\nprint(4-k)", "shoes = list(map(int,input().split()))\r\n\r\ndistinct = len(shoes) - len(set(shoes))\r\n\r\nprint(distinct)", "colors = list(map(int, input().split()))\r\n\r\nunique_colors = len(set(colors))\r\n\r\nadditional_horseshoes_needed = 4 - unique_colors\r\n\r\nif additional_horseshoes_needed > 0:\r\n print(additional_horseshoes_needed)\r\nelse:\r\n print(0)", "\r\ncolors = list(map(int, input().split()))\r\n\r\n\r\ndistinct_colors = set()\r\n\r\nfor color in colors:\r\n distinct_colors.add(color)\r\n\r\nmin_horseshoes_to_buy = 4 - len(distinct_colors)\r\n\r\n\r\nprint(min_horseshoes_to_buy)\r\n", "a=list(map(int,input().split()))\r\nlenMas=len(a)\r\na=set(a)\r\nlenSet=len(a)\r\nprint(lenMas-lenSet)", "# Is your horseshoe on the other hoof?\r\nnums = [int(x) for x in input().split(' ')]\r\ncant = 0\r\nexcluidos = []\r\nfor i in nums:\r\n n = nums.count(i)\r\n if i not in excluidos and n > 1:\r\n cant += n - 1\r\n excluidos.append(i)\r\nprint(cant)\r\n", "a, b, c, d = map(int, input().split())\r\ns1 = {a, b ,c, d}\r\nprint(4 - len(s1))", "s1, s2, s3, s4 = map(int, input().split())\r\nunique_colors = set([s1, s2, s3, s4])\r\nminimum_to_buy = 4 - len(unique_colors)\r\nprint(minimum_to_buy)\r\n", "l=list(map(int,input().split()))\r\nl1=set(l)\r\na=len(l1)\r\nprint(len(l)-a)", "n,m,k,t=map(int,input().split())\r\na=[n,m,k,t];\r\nprint(abs(len(set(a))-4));\r\n \r\n", "colors = input().split()\r\n\r\nunique_colors = set(colors)\r\nmin_horseshoes_needed = 4 - len(unique_colors)\r\n\r\nprint(min_horseshoes_needed)\r\n", "Colors = list(map(int, input().split()))\r\ncolor = len(set(Colors))\r\nMin=4-color\r\nprint(Min)", "s1, s2, s3, s4 = list(map(int, input().split()))\r\n\r\nes = set()\r\n\r\nes.add(s1)\r\nes.add(s2)\r\nes.add(s3)\r\nes.add(s4)\r\n\r\nprint(4 - len(es))", "l = list(map(int, input().split()))\r\nprint(len(l) - len(list(set(l))))", "x = list(map(int, input().split()))\r\ny = set(x)\r\nprint(len(x)-len(y))", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\nunique_colors = set([s1, s2, s3, s4])\r\n\r\nadditional_colors_needed = 4 - len(unique_colors)\r\n\r\nprint(additional_colors_needed)\r\n", "n=list(input().split())\r\nprint(4-len(set(n)))", "l = list(map(int,input().split()))\r\ndef tekrar(l):\r\n l.sort()\r\n s = 0\r\n for i in range(3):\r\n if l[i]==l[i+1]:s += 1\r\n return s\r\n\r\nprint(tekrar(l))\r\n", "import sys\r\n\r\nl = set(map(int, sys.stdin.readline().strip().split(' ')))\r\nprint(4 - len(l))\r\n", "a,b,c,d=map(int,input().split())\r\ns={a,b,c,d}\r\nprint(4-len(s))", "l = list(map(int, input().split()))\r\ncount = 0\r\ndup = []\r\nif l.count(l[0]) == len(l):\r\n print(len(l)-1)\r\nelse:\r\n for i in l:\r\n if i not in dup:\r\n if l.count(i) > 1:\r\n count += (l.count(i)-1)\r\n dup.append(i)\r\n print(count)", "x = input().split()\r\n\r\nc = len(x) - len(set(x))\r\nprint(c)", "shoe = set()\ncolors = list(map(int,input().split()))\nfor i in colors:\n shoe.add(i)\nprint(4-len(shoe))", "s1,s2,s3,s4=map(int,input().strip().split())\r\ncount=0\r\nif s1==s2 or s1==s3 or s1==s4:\r\n count+=1\r\nif s2==s3 or s2==s4:\r\n count+=1\r\nif s3==s4:\r\n count+=1\r\nprint(count)", "a = set(input().split())\r\nprint(4-len(a))\r\n", "s = set(map(int, input().split()))\r\n\r\nprint(4 - len(s))", "colors = list(map(int, input().split()))\r\nunique_colors = set(colors)\r\n\r\nadditional_colors_needed = 4 - len(unique_colors)\r\n\r\nprint(additional_colors_needed)\r\n", "\r\na=list(map(int,input().split()))\r\nif len(set(a))==4:\r\n print(\"0\")\r\nelif len(set(a))==3:\r\n print(\"1\")\r\nelif len(set(a))==2:\r\n print(\"2\")\r\nelse:\r\n print(\"3\")", "colors = list(map(int, input().split()))\r\nunique_colors = set(colors)\r\nminimum_horseshoes = 4 - len(unique_colors)\r\nprint(minimum_horseshoes)\r\n", "hoofs = set(map(int, input().split()))\r\nprint(4 - len(hoofs))\r\n", "l1=list(map(int,input().split()))\r\n\r\nl2=set(l1)\r\nneed=len(l1)-len(l2)\r\nprint(need)", "s1 = set(map(int,input().split(\" \")))\r\nprint(4- len(s1))\r\n", " # Read the input four horseshoe colors\r\ncolors = list(map(int, input().split()))\r\n\r\n# Create a set of unique colors\r\nunique_colors = set(colors)\r\n\r\n# Calculate the minimum number of horseshoes Valera needs to buy\r\nmin_horseshoes = 4 - len(unique_colors)\r\n\r\n# Output the result\r\nprint(min_horseshoes)\r\n", "colors = list(map(int, input().split()))\r\n\r\nunique_colors = len(set(colors))\r\nmin_additional_colors = 4 - unique_colors\r\n\r\nprint(min_additional_colors)\r\n", "h=list(map(int,input().split()))\r\nc=0\r\nz=len(h)\r\nd={}\r\nfor i in range(z):\r\n if d.get(h[i])==None:\r\n d[h[i]]=1\r\n else:\r\n c+=1\r\nprint(c)\r\n", "z = list(map(int,input().split()))\r\nans = 0\r\nres = {}\r\nfor i in z :\r\n if i in res : \r\n ans +=1\r\n else :\r\n res[i] = 1\r\nprint(ans)", "count=input().split()\r\nbuy=4 - len(set(count))\r\nprint(buy)\r\n\r\n\r\n", "a = list(map(int, input().split()))\r\nb = []\r\nans = 0\r\nfor i in a:\r\n if i in b:\r\n ans += 1\r\n else:\r\n b.append(i)\r\nprint(ans)\r\n", "s=list(map(int,input().split()))\r\nprint(len(s)-len (set(s)))", "#gets the unique set of horshoe colors\r\nshoes = set(input().split(' '))\r\n\r\n#prints how many horshoes need to be bought\r\nprint(4 - len(shoes))", "from collections import Counter\r\nshoes = list(map(int,input().split()))\r\ny = 0\r\ncounts = Counter(shoes)\r\n\r\nfor number, count in counts.items():\r\n if count > 1:\r\n y += count - 1\r\nprint(y)", "a=[]\r\ns,k,m,l= [int(x) for x in input().split( )]\r\na.append(s)\r\na.append(k)\r\na.append(m)\r\na.append(l)\r\np=0\r\ng=[]\r\nfor i in a :\r\n for j in a:\r\n if i==j and j not in g:\r\n p+=1\r\n g.append (j)\r\nprint(4-p)", "# Read the colors of horseshoes\r\ns = input().split()\r\ns1, s2, s3, s4 = int(s[0]), int(s[1]), int(s[2]), int(s[3])\r\n\r\n# Create a set to store the unique horseshoe colors\r\ncolor_set = set([s1, s2, s3, s4])\r\n\r\n# Calculate the minimum number of horseshoes Valera needs to buy\r\nmin_horseshoes_to_buy = 4 - len(color_set)\r\n\r\n# Print the result\r\nprint(min_horseshoes_to_buy)\r\n", "array = input().split()\r\n\r\nprint(4-len(set(array)))", "n=list(map(int,input().split()))\r\ntemp=set(n)\r\nprint(4-len(temp))", "c = input().split() \r\na = set(c) \r\nprint(4 - len(a))\r\n", "colors = input()\r\nColors = colors.split(' ',4)\r\nUniqueColors = []\r\nfor i in Colors:\r\n if i not in UniqueColors:\r\n UniqueColors.append(i)\r\n\r\nprint(4-len(UniqueColors))\r\n", "print(4 - len(set(list(map(int,input().split())))))", "a,b,c,d = map(int, input().split())\r\nmas = {a,b,c,d}\r\nprint(4-len(mas))", "def minimumHorseshoes(s1, s2, s3, s4):\r\n colors = set([s1, s2, s3, s4])\r\n return 4 - len(colors)\r\n\r\n# Example usage:\r\ns1, s2, s3, s4 = map(int, input().split())\r\nresult = minimumHorseshoes(s1, s2, s3, s4)\r\nprint(result)", "content = [int(x) for x in input().split()]\r\nbuys = 0\r\ny = []\r\nfor i in range(len(content)):\r\n if content[i] in y:\r\n buys += 1\r\n y.append(content[i])\r\nprint(buys)", "print(4-len(set(map(int,input().split())))) ", "a = list(map(int, input().split()))\r\nprint(4-len(set(a)))", "arr=input()\r\na,b,c,d=arr.split(\" \")\r\ns=set()\r\ns.add(a)\r\ns.add(b)\r\ns.add(c)\r\ns.add(d)\r\nprint(4-len(s))", "s = list(map(int,input().split()))\r\npodkovas = 0\r\nfor i in range(len(s)):\r\n d = s[0]\r\n s.pop(0)\r\n if d in s:\r\n podkovas+=1\r\n\r\nprint(podkovas)\r\n", "print(4-len(set(input().strip().split())))", "s1,s2,s3,s4=map(int,input().split())\r\nl=[s1,s2,s3,s4]\r\ns=set(l)\r\nprint(4-len(s))", "a = list(map(int,input().split()))\r\nli1 = []\r\nfor i in a:\r\n if i not in li1:\r\n li1.append(i)\r\nprint(len(a) - len(li1))", "\r\ndef strings(n):\r\n c=0\r\n for i in range(len(n)):\r\n if n[i]==0:\r\n continue\r\n for j in range(1,len(n)):\r\n if j!=i:\r\n if n[i]==n[j]:\r\n c+=1\r\n n[j]=0\r\n print(c)\r\na,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\nn=[a,b,c,d]\r\nstrings(n)\r\n \r\n", "s= input()\r\nlist1= s.split()\r\nlist2=[]\r\nlilen= len(list1)\r\nl2= lilen-1\r\ncount= 0\r\nfor i in range(lilen):\r\n if int(list1[i]) in list2:\r\n continue\r\n else:\r\n list2.append(int(list1[i]))\r\n for j in range(i+1,lilen):\r\n if j==lilen:\r\n break\r\n if int(list1[i]) == int(list1[j]):\r\n count += 1\r\nprint(count)", "s1,s2,s3,s4=list(map(int,input().split()))\r\nlst=[s1,s2,s3,s4]\r\nfinallst=[]\r\n \r\nfor i in lst:\r\n if i not in finallst:\r\n finallst.append(i)\r\n \r\nprint(4-len(finallst))", "# -*- coding: utf-8 -*-\n\"\"\"228A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1UUbkbze2e4bvOJ3h1jEEGlFAQ-PdTLRX\n\"\"\"\n\ns= set(map(int ,input().split()))\nprint( 4-len(s))", "c=list(map(int,input().split()))\r\nc=[*set(c)]\r\nprint(4-len(c))", "s=list(map(int,input().split()))\r\nk=set(s)\r\nprint(len(s)-len(k))", "count=0\r\na=[int (i) for i in input().split()]\r\nb=[]\r\nfor i in a:\r\n if i not in b:\r\n b.append(i)\r\nprint(len(a)-len(b))\r\n", "n=list(map(int,(input().split())))\r\na=len(set(n))\r\ntotal=4-a\r\nprint(total)", "print(4 - len(set(map(int,input().split()))))", "A = set()\r\na,b,c,d = [int(z) for z in input().split()]\r\nA.add(a)\r\nA.add(b)\r\nA.add(c)\r\nA.add(d)\r\nprint(4-len(A))", "s = list(set(map(int, input().split())))\r\nprint(4-len(s))", "n = list(map(int,input().split()))\r\ncheck = []\r\n\r\nfor item in n:\r\n if item not in check:\r\n check.append(item)\r\n \r\nresult = 4 - len(check)\r\n\r\nprint(result)", "colors = list(map(int, input().split()))\r\nunique_colors = set()\r\nfor color in colors:\r\n unique_colors.add(color)\r\nhorseshoes = 4 - len(unique_colors)\r\nprint(horseshoes)", "print(4-len({*input().split()}))\r\n#HI CODEFORCES\r\n#", "a = input().split()\r\nb = set(a)\r\nprint(4-len(set(b)))", "horseshoes = [int(x) for x in input().split()]\r\nunique_colors = 0\r\nhorseshoes2 = []\r\n\r\nfor color in horseshoes:\r\n if color not in horseshoes2:\r\n horseshoes2.append(color)\r\n unique_colors += 1\r\n\r\nbuying = 4 - unique_colors\r\n\r\nprint(buying)", "c=list(map(int,input().split()))\r\nu_c=len(set(c))\r\nmin_hstb=4-u_c\r\nprint(min_hstb)", "a = list(map(int, input().split()))\r\ntotal, q = 0, []\r\nfor i in range(4):\r\n if a[i] in q:\r\n total += 1\r\n else:\r\n q.append(a[i])\r\nprint (total)", "jiyn=set()\r\na,b,c,d=map(int,input().split())\r\njiyn.add(a)\r\njiyn.add(b)\r\njiyn.add(c)\r\njiyn.add(d)\r\nprint(4-len(jiyn))", "i=map(int,input().split())\r\ni=set(i)\r\nprint(4-len(i))", "arr = [int(x) for x in input().split()]\r\ncounts = []\r\n\r\nfor i in range(len(arr)):\r\n count_num = arr[i:].count(arr[i])\r\n if count_num>1 and arr[i] not in arr[:i]:\r\n counts.append(count_num-1)\r\n \r\n\r\n\r\nprint(sum(counts))", "import math\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n # lenght = int(input())\r\n # # lenght = 2\r\n # s = input().split(\" \")\r\n #chislo, delit = map(int, input().split(' '))\r\n #n = int(input())\r\n\r\n s2 = input().split(' ')\r\n mas = []\r\n\r\n for i in range(0, len(s2)):\r\n s2[i] = int(s2[i])\r\n\r\n for i in range(0, len(s2)):\r\n\r\n if s2[i] in mas:\r\n s2[0] = 0\r\n else:\r\n mas.append(s2[i])\r\n print(4 - len(mas))", "a,b,c,d = [int(z) for z in input().split()]\r\nA = {a,b,c,d}\r\nprint(4-len(A))", "ls=list(map(int,input().split()))\r\nls1=set(ls)\r\nk=len(ls)-len(ls1)\r\nprint(k)", "def code(*args):\r\n arr = args[0]\r\n\r\n map_ = {}\r\n\r\n count = 0\r\n for i in arr:\r\n if i in map_:\r\n count += 1\r\n map_[i] = True\r\n\r\n return count\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n arr = list(map(int, input().split()))\r\n result = code(arr) # Pass arguments\r\n print(result)\r\n\r\n\r\n", "print(4 - len({*input().split()}))", "color_list = input().split(\" \")\r\nreqtobuy = 4 - len(set(color_list))\r\nprint(reqtobuy)", "c=set(map(int,input().split()))\r\ntobuy=4-len(c)\r\nprint(tobuy)\r\n", "numbers = list(map(int,input().split(' ')))\r\nli=[]\r\nli2=[]\r\nfor item in numbers:\r\n if item not in li:\r\n li.append(item)\r\n else:\r\n li2.append(item)\r\n\r\nprint(len(li2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 14 10:55:36 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\n\r\nn=[int(x) for x in input().split()]\r\nn1=set(n)\r\nprint(len(n)-len(n1))", "n = input().split()\n\ns = []\n\nfor ca in n:\n\tif ca not in s:\n\t\ts.append(ca)\n\nprint(4 - len(s))\n\n", "a=list(map(int,input().split()))\r\ns=set(a)\r\nprint(4-len(s))", "s = list(map(int, input().split()))\r\nnew_s = len(set(s))\r\nmin_horseshoes = 4 - new_s\r\nprint(min_horseshoes)\r\n", "n = map(int,input().split())\r\nunique = len(set(n))\r\nans = 4 - unique\r\nprint(ans)", "s1,s2,s3,s4=input().split()\r\ncount=0\r\n\r\nif s1==s2 or s1==s3 or s1==s4:\r\n count+=1\r\nif s2==s3 or s2==s4:\r\n count+=1\r\nif s3==s4:\r\n count+=1\r\nprint(count)", "a,b,c,d = map(int,input().split())\r\nprint(4-len(set([a,b,c,d])))\r\n", "s1,s2,s3,s4=map(int,input().split())\r\ncolours=set([s1,s2,s3,s4])\r\nminhor=4-len(colours)\r\nprint(minhor)\r\n", "a = set(map(int,input().split()))\r\nprint(4-len(a))", "shoes = list(map(int, input().split()))\n\nprint(len(shoes) - len(set(shoes)))", "def main():\r\n a, b, c, d = map(int, input().split(' '))\r\n s = set([a, b, c, d])\r\n print(4 - len(s))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "array = [int(x) for x in input().split(\" \")]\r\nval = set(array)\r\nprint(4-len(val))", "shoes = [int(i) for i in input().split()]\r\narr = []\r\nfor i in shoes:\r\n if i not in arr:\r\n arr.append(i)\r\nprint(4-len(arr))", "s = list(map(int, input().split()))\ncount = 0\nif len(set(s)) < 4:\n count = 4 - len(set(s))\nelse:\n count \nprint(count) ", "l=list(map(int,input().split()))\r\nr=len(list(set(l)))\r\nd=4-r\r\nprint(d)\r\n", "s = []\r\nfor _ in input().split():\r\n if _ not in s:\r\n s.append(_)\r\nprint(4-len(s))", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\ncolors = set([s1, s2, s3, s4])\r\n\r\nmin_value = 4 - len(colors)\r\nprint(min_value)\r\n", "def minimum_horseshoes_to_buy(s1, s2, s3, s4):\r\n # Create a set to store unique horseshoe colors\r\n colors_set = set([s1, s2, s3, s4])\r\n\r\n # Calculate the number of additional horseshoes needed\r\n additional_horseshoes_needed = 4 - len(colors_set)\r\n\r\n return additional_horseshoes_needed\r\n\r\n# Read input values\r\ns1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Calculate and print the minimum number of horseshoes Valera needs to buy\r\nprint(minimum_horseshoes_to_buy(s1, s2, s3, s4))", "l=list(map(int,input().split()))\r\nd={}\r\nc=0\r\nfor i in l:\r\n if i not in d:\r\n c+=1\r\n d[i]=1\r\nprint(4-c)\r\n", "list =list(map(int,input().split()))\r\nif(len(set(list))==len(list)):\r\n print(0)\r\nelse:\r\n print(len(list)-len(set(list)))", "colors=list(map(int,input().split()))\r\nkind=[]\r\nfor color in colors:\r\n if not color in kind:\r\n kind.append(color)\r\nprint(4-len(kind))", "p = input()\r\nx = p.split(\" \")\r\n\r\nc = 0\r\ni = 0\r\n\r\nwhile i<3:\r\n j=0\r\n while j<4:\r\n if x[i]==x[j]:\r\n if j < i:\r\n break\r\n elif j > i:\r\n c+=1\r\n j+=1\r\n i+=1\r\n\r\nprint(c)", "list2=list(map(int,input().strip().split()))[:4]\r\nlist2=set(list2)\r\nprint(4-len(list2))\r\n", "colors = list(map(int, input().split()))\r\n\r\ndistinct_colors = len(set(colors))\r\nadditional_horseshoes = 4 - distinct_colors\r\n\r\nprint(additional_horseshoes)\r\n", "n=list(map(int,input().split()))\r\nx=set(n)\r\ncount=0\r\nfor i in x:\r\n count+=1\r\nprint(abs(count-4))", "s=list(map(int,input().split()))\r\nx=0\r\nfor i in range(len(s)-1):\r\n if s[i] in s[i+1:]:\r\n x=x+1\r\nprint(x)\r\n", "def minimum_horseshoes(s1, s2, s3, s4):\r\n colors = set([s1, s2, s3, s4])\r\n return 4 - len(colors)\r\nif __name__ == \"__main__\":\r\n s1, s2, s3, s4 = map(int, input().split())\r\n print(minimum_horseshoes(s1, s2, s3, s4))\r\n", "# your code goes here\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nprint(4-len(s))", "colors_of_horseshoes=[int(x) for x in input().split()]\r\n\r\ns= set(colors_of_horseshoes)\r\nres= len(colors_of_horseshoes)-len(list(s))\r\nprint(res)", "def minimum_horseshoes_to_buy(colors):\r\n unique_colors = len(set(colors))\r\n return max(0, 4 - unique_colors)\r\n\r\n# Read input\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate and print the minimum number of horseshoes to buy\r\nprint(minimum_horseshoes_to_buy(colors))\r\n", "colors = list(map(int, input().split()))\r\n\r\n# Count the number of unique colors Valera has\r\nunique_colors = len(set(colors))\r\n\r\n# Calculate how many more horseshoes he needs to reach four different colors\r\nadditional_horseshoes_needed = 4 - unique_colors\r\n\r\n# Print the minimum number of horseshoes he needs to buy\r\nprint(additional_horseshoes_needed)\r\n", "p=len(set(input().split()))\r\nprint(4-p)", "\r\n# To solve this problem, we can use sets so that the numbers \r\n# dont repeat themselves\r\n\r\nline = list(map(int, input().split()))\r\ncolors = len(set(line))\r\n\r\nneeded = 4 - colors\r\nprint(needed)", "# -*- coding: utf-8 -*-\n\"\"\"228A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\ns=set(map(int,input().split()))\nresult=4-len(s)\nprint(result)", "s = input().split(\" \")\r\nss = set(s)\r\nprint(4 - len(ss))", "lst=list(set(map(int,input().split())))\r\nans=4-len(lst)\r\nif ans<0:\r\n print(0)\r\nelse:\r\n print(ans)", "colors = input().split() # Read the four space-separated integers as input\r\n\r\nunique_colors = set(colors) # Convert the list of colors into a set to remove duplicates\r\nneeded_horseshoes = 4 - len(unique_colors) # Calculate how many more horseshoes are needed to have 4 different colors\r\n\r\nif needed_horseshoes < 0:\r\n needed_horseshoes = 0 # Ensure the result is non-negative\r\n\r\nprint(needed_horseshoes) # Print the minimum number of horseshoes Valera needs to buy\r\n", "a = set(list(map(int,input().split())))\r\nprint(4 - len(a))\r\n", "s = list(map(int, input().split()))\r\ns_set = set()\r\ns_set.update(s)\r\nprint(len(s) - len(s_set))", "n=list(map(int,input().split()))\r\nprint(4-len(set(n)))\r\n\r\n\r\n\r\n\r\n", "a,b,c,d = map(int,input().split())\r\nl = []\r\nl.append(a)\r\nl.append(b)\r\nl.append(c)\r\nl.append(d)\r\ns = set(l)\r\nprint(4-len(s))", "\r\nuniques = len(set(input().split()))\r\nprint(4 - uniques)\r\n", "s = set(list(map(int,input().split())))\r\nprint(4 - len(s))", "nums = [int(x) for x in input().split()]\n\nindexs = set()\nfor x in nums:\n indexs.add(x)\n\nprint(len(nums)-len(indexs))", "a = input().split()\r\na = set(a)\r\n\r\nprint(4 - len(a)) \r\n\r\n", "s1,s2,s3,s4=map(int,input().split())\r\nunique_colors=set([s1,s2,s3,s4])\r\nprint(4-len(unique_colors))", "l1 = list(map(str,input().split()))\r\nl2 = set(l1)\r\nprint(4 - len(l2))", "colors=input().split()\r\ndistinctnum=0\r\nfor i in range(0,4):\r\n for j in range(0,i):\r\n if(colors[i]==colors[j]):\r\n break\r\n else:\r\n distinctnum+=1\r\nprint(4-distinctnum)", "shoes=list(map(int,input().split()))\r\nunique_shoe=set(shoes)\r\nrequired=4-len(unique_shoe)\r\nprint(required)", "s=list(map(int,input().split()))\r\nl=sorted(s)\r\ncount=0\r\nfor i in range (len(l)-1):\r\n if l[i]==l[i+1]:\r\n count+=1\r\nprint(count)", "# Prompt the user for input and split it into words\r\nuser_input = input()\r\nwords = user_input.split()\r\n\r\n# Calculate the number of unique words and subtract it from 4\r\nunique_word_count = len(set(words))\r\nresult = 4 - unique_word_count\r\n\r\n# Print the result\r\nprint(result)\r\n", "s = list(input().split())\nprint(len(s) - len(set(s)))", "import sys\r\n\r\n# Taking inputs\r\ninputs = list(map(int, input().split()))\r\n\r\n# Sorting the array\r\ninputs.sort()\r\n\r\n# Counting the number of duplicate elements\r\ncounter = 0\r\nfor i in range(3):\r\n if inputs[i] == inputs[i+1]:\r\n counter += 1\r\n\r\n# Printing the output\r\nprint(counter)\r\n", "lst=[int(i) for i in input().split()]\r\nk=len(set(lst))\r\nprint(4-k)", "lst = list(map(int,input().split()))\r\ns = set()\r\nfor i in range(len(lst)):\r\n s.add(lst[i])\r\nprint(4-len(s))", "def minimum_horseshoes_to_buy(colors):\r\n unique_colors = set(colors)\r\n return 4 - len(unique_colors)\r\n\r\ndef main():\r\n colors = list(map(int, input().split()))\r\n print(minimum_horseshoes_to_buy(colors))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "has = list(set([i for i in input().split()]))\r\nprint(4-len(has))", "newlist=list(map(int,input().split()))\r\n\r\nnewlist=set(newlist)\r\n\r\nnewlist=list(newlist)\r\n\r\nx=len(newlist)\r\n\r\nans=4-x\r\n\r\nprint(ans)", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\ns_set = list(set([s1, s2, s3, s4]))\r\nif len([s1, s2, s3, s4]) == len(s_set):\r\n print(0)\r\nelse:\r\n print(4 - len(s_set))", "diff_shoes = len(set(map(int, input().split())))\r\n\r\nprint(4 - diff_shoes)\r\n", "input_str = input()\ninput_list = input_str.split(\" \")\ncount = 0\ncolors = len(input_list)\ndiccionario={}\nfor i in range(colors):\n if input_list[i] not in diccionario.keys():\n diccionario[input_list[i]] = 1\n else:\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=list(map(int,input().split()))\r\n\r\nu=len(set(a))\r\nb=4-u\r\n\r\nc=max(0,b)\r\nprint(c)", "def main():\r\n sll = list(map(int, input().split()))\r\n sll.sort()\r\n sll = list(set(sll))\r\n print(4 - len(sll))\r\nif __name__ == \"__main__\":\r\n main()", "colors = input()\r\ncolors = colors.split(' ')\r\nuniqeColorCount = len(set(colors))\r\nuniqeColorCount = 4-uniqeColorCount\r\nif uniqeColorCount < 0:\r\n uniqeColorCount = 0\r\nprint(uniqeColorCount)\r\n", "color = str(input())\r\ncol_list = color.split(\" \")\r\ncol_set = set(col_list)\r\nprint(4 - len(col_set))", "print(\r\n 4 - len({*input().split()})\r\n)", "valera_shoes = input().split()\ndifferent_shoes = []\nfor i in range(0, 4):\n under_analysis_shoe = valera_shoes[i]\n is_different = True\n for j in range(0, i):\n previous_shoe = valera_shoes[j]\n if under_analysis_shoe == previous_shoe:\n is_different = False\n break\n if is_different:\n different_shoes.append(under_analysis_shoe)\nprint(4 - len(different_shoes))\n", "def buy(colors):\r\n unique_colors = set(colors)\r\n return 4 - len(unique_colors)\r\n\r\ncolors = list(map(int, input().split()))\r\n\r\nprint(buy(colors))", "a = set([int(el) for el in input().split()])\r\nprint(4 - len(a))\r\n\r\n", "#n = int(input())\np = list(map(int,input().split()))\nup = set(p)\nmin = 4 - len(up)\nprint(min)", "color=list(map(int,input().split()))\r\n\r\nunique_color=len(set(color))\r\n\r\nneeds_color=max(0,4-unique_color)\r\n\r\nprint(needs_color)", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\ncolors_set = set([s1, s2, s3, s4])\r\nexisting_colors = len(colors_set)\r\nrequired_colors = 4 - existing_colors\r\n\r\nprint(required_colors)\r\n#Создайте множество, в котором будут храниться цвета имеющихся подков.\r\n#Пройдитесь по имеющимся подковам (s1, s2, s3, s4) и добавьте каждый цвет в множество.\r\n#Посчитайте, сколько разных цветов подков уже есть в множестве.\r\n#Если количество разных цветов подков в множестве меньше четырех, то Валере нужно купить дополнительные подковы, чтобы получить еще недостающие цвета.\r\n#Количество дополнительных подков, которые нужно купить, равно разнице между четырьмя и текущим количеством разных цветов в множестве.", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = l()\r\nm = set(n)\r\nx = len(m)\r\nprint(4 - x)\r\n\r\n\r\n\r\n\r\n ", "x = list(map(int, input().split()))\r\ns = set(x)\r\nprint(len(x)-len(s))\r\n", "s = list(map(int,input().split()))\r\nc = 0\r\nb = 0\r\nfor i in range(len(s)):\r\n b+=s.count(s[i]) == 2\r\n c+=s.count(s[i])>1\r\nif c == 0:\r\n print(0)\r\nelif b == 4:\r\n print(2)\r\nelse:\r\n print(c-1)", "s = list(map(int, input().split()))\r\nsett = set(s)\r\n\r\nans = 0\r\nfor num in sett:\r\n if (s.count(num) > 1):\r\n ans += s.count(num) - 1\r\nprint(ans)\r\n", "input1 = input(\"\")\r\nresult = 0\r\n\r\nshoes = input1.split(\" \")\r\n\r\nshoes = [int(i) for i in shoes]\r\n\r\nlisted = list(set(shoes))\r\n\r\nprint(len(shoes) - len(listed))", "h_s=list(map(int,input().split()))\r\nd_c=len(set(h_s))\r\na_h_n=(4-d_c)\r\nprint(a_h_n)\r\n", "arr=list(map(int,input().split()))\r\nlis=list(set(arr))\r\nif len(arr)==len(lis):\r\n print(0)\r\nelse:\r\n print(len(arr)-len(lis))", "horseshoes = list(map(int, input().split()))\r\n\r\nuni = len(set(horseshoes))\r\nans = 4 - uni\r\n\r\n\r\nprint(ans)", "s1, s2, s3, s4 = map(int, input().split())\r\ncount = 0\r\nif s1 == s2 or s1 == s3 or s1 == s4:\r\n count += 1\r\nif s2 == s3 or s2 == s4:\r\n count += 1\r\nif s3 == s4:\r\n count += 1\r\nprint(count) ", "colors=[int(x) for x in input().split()]\r\ncolors=set(colors)\r\n\r\nprint(4-len(colors))", "'''\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'''\nli=list(map(int,input().split()))\nl1=len(li)\nl2=len(set(li))\nprint(l1-l2)", "n = list(map(int, input().split()))\r\nt = len(set(n))\r\ne = 4 - t\r\nprint(e)\r\n", "nums = list(map(int, input().split()))\r\n\r\ndef count_reps(nums):\r\n seen = {}\r\n count = 0\r\n for num in nums:\r\n if num in seen:\r\n count += 1\r\n else:\r\n seen[num] = True\r\n return count\r\n\r\nprint(count_reps(nums))", "n=list(map(int,input().split()))\r\ny=set(n)\r\nz=len(y)\r\na=4-z\r\nprint(a)\r\n", "colors=list(map(int,input().split()))\r\nunique_colors=len(set(colors))\r\nadditional_horseshoes= 4-unique_colors\r\nprint(max(0,additional_horseshoes))", "li = list(map(int, input().split()))\r\nc = 0\r\nd = {}\r\nn = len(li)\r\nfor i in range(n):\r\n if d.get(li[i]) == None:\r\n d[li[i]] = 1\r\n else:\r\n c += 1\r\nprint(c)", "if __name__ == \"__main__\":\r\n shoes = input().split()\r\n print(4 - len(set(shoes)))", "a=list(input().split())\r\nb=set(a)\r\nc=len(a)-len(b)\r\nprint(c)", "print(4 - len({int(num): None for num in input().split(' ')}))", "b=list(map(int,input().split()))\r\nc=len(b)\r\nprint(abs(len(set(b))-c))", "L=[int(x) for x in input().split()]\r\nprint( 4-len(set(L)))", "A = list(map(int, input(). split()))\r\nB = []\r\nfor i in range(4):\r\n if A[i] not in B:\r\n B.append(A[i])\r\nprint(4 - len(B))", "s = list(map(int, input().split()))\r\nl = set(s)\r\nans = 0\r\nfor num in l:\r\n if (s.count(num) > 1):\r\n ans += s.count(num) - 1\r\nprint(ans)\r\n", "list = input().split()\r\nmin = 0\r\nfor i in range(len(list) - 1, -1, -1):\r\n count = list.count(list[i])\r\n if (count > min):\r\n min += count-1\r\n del list[i]\r\nprint(min)", "s = list(map(int,input().split()))\r\nold_length = len(s)\r\nnew_length = len(set(s))\r\nprint(old_length - new_length)\r\n", "n = set(input().split(\" \"))\r\n\r\nif len(n) < 4:\r\n print(4-len(n))\r\nelse:\r\n print(0)\r\n", "# your code goes here\r\nl = set(map(int,input().split()))\r\nprint(4-len(l))", "colors = list(map(int, input().split()))\r\n\r\nprint(len(colors)-len(set(colors)))", "s = list(map(int,input().split()))\r\nl = []\r\nto_buy = 0\r\nfor i in range(len(s)):\r\n if s[i] not in l:\r\n l.append(s[i])\r\n else:\r\n to_buy += 1\r\n\r\nprint(to_buy)", "n = input()\r\nlist1 = n.split(\" \")\r\nx = \"\"\r\ncount = 0\r\nfor i in list1:\r\n if i in x:\r\n count+=1\r\n x+=i\r\n\r\nprint(count)\r\n", "def min_horseshoes_to_buy(colors):\r\n unique_colors = len(set(colors))\r\n return 4 - unique_colors\r\n\r\n# Read input\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate and print the result\r\nresult = min_horseshoes_to_buy(colors)\r\nprint(result)\r\n", "horseshoe=list(map(int,input().split()))\r\nunique=len(set(horseshoe))\r\nmin_horseshoe=4-unique\r\nprint(min_horseshoe)", "colors = list(map(int, input().split()))\r\nunique_colors = len(set(colors)) # Count unique colors\r\n\r\n# Calculate how many additional horseshoes Valera needs to buy\r\nadditional_horseshoes = 4 - unique_colors\r\n\r\n# Print the result\r\nprint(max(0, additional_horseshoes)) # Ensure the result is non-negative\r\n", "s1, s2, s3, s4 = map(int, input().split(' '))\r\n\r\nprint(4-len({s1, s2, s3, s4}))", "the_list=list(map(int,input().split()))\r\nthe_set=set(the_list)\r\nhorseshoes=len(the_list)-len(the_set)\r\nprint(horseshoes)", "l=list(map(int,input().split()))\r\nm=[]\r\ncounter=0\r\nfor i in l:\r\n if i not in m:\r\n if(l.count(i)>1):\r\n counter=counter+l.count(i)-1\r\n m.append(i)\r\nprint(counter)\r\n", "a=input().split()\r\nc=dict()\r\nfor d in a:\r\n if d not in c:\r\n c[d] = 1\r\nprint(4-len(c))", "\r\nn=input().split(\" \")\r\nl=[]\r\nc=0\r\nfor i in n:\r\n if (int(i)) in l:\r\n c=c+1\r\n elif int(i) not in l:\r\n l.append(int(i))\r\n\r\nprint(c)", "s = input()\r\ns = s.split()\r\ns = list(map(int, s))\r\ns = set(s)\r\nprint(4 - len(s))\r\n", "horseshoes = list(map(int, input().split()))\r\ndistinct_colors = len(set(horseshoes))\r\nneeded_to_buy = 4 - distinct_colors\r\nprint(needed_to_buy)\r\n", "mn = set(int(x) for x in input().split())\r\nprint(4-len(mn))", "l = [i for i in list(map(int, input().split()))]\r\nprint(4 - len(set(l)))\r\n", "\r\nm=list(map(int,input().split()))\r\ns=set(m)\r\nprint(len(m)-len(s))", "def horse(K): #Horseshoe\r\n #K=[a,b,c,d]\r\n F=set(K)\r\n return len(K)-len(F)\r\n\r\nx=list(map(int,input().split()))\r\nprint(horse(x))", "colors = list(map(int, input().split()))\r\nah = 4 - len(set(colors))\r\nprint(ah)\r\n", "def horse(a, b, c, d):\r\n sol = list()\r\n lst = [a, b, c, d]\r\n lst.sort()\r\n for item in lst:\r\n if item not in sol:\r\n sol.append(item)\r\n return len(lst)-len(sol)\r\n\r\nif __name__ == \"__main__\":\r\n a, b, c, d = map(int, input().split())\r\n print(horse(a, b, c, d))", "s1, s2, s3, s4 = map(int, input().split())\r\nunique_colors = len(set([s1, s2, s3, s4]))\r\nadditional_horseshoes_needed = max(0, 4 - unique_colors)\r\nprint(additional_horseshoes_needed)\r\n", "x=list(map(str,input().split()))\r\nw=[]\r\nc=[]\r\nfor i in x:\r\n if i not in w:\r\n w.append(i) \r\nfor i in w:\r\n if x.count(i)==2:\r\n c.append(1)\r\n elif x.count(i)==3:\r\n c.append(2)\r\n elif x.count(i)==4:\r\n c.append(3)\r\nprint(sum(c))\r\n", "arr = input().split()\nsetArr = set(arr)\n\nprint(len(arr) - len(setArr))", "n=list(map(int,input().split()))\r\nunique=len(set(n))\r\nprint(4-unique)", "count=0\r\nk=[]\r\nl=list(map(int,input().split()))\r\n\r\nfor i in set(l):\r\n if l.count(i)>1:\r\n count+=1\r\n k.append(i)\r\nif count==2:\r\n print(2)\r\nif count==1:\r\n if l.count(k[0])==2:\r\n print(1)\r\n if l.count(k[0])==3:\r\n print(2)\r\n if l.count(k[0])==4:\r\n print(3)\r\nif count==0:\r\n print(0)\r\n \r\n \r\n \r\n \r\n ", "from collections import defaultdict\narr = list(map(int, input().split()))\nmap1 = defaultdict(int)\ncount = 0\nfor i in arr:\n if map1[i] == 0:\n count += 1\n map1[i] += 1\nprint(4-count)\n", "s = input().split()\r\n\r\ntrigger = s.pop(0)\r\ncounter = 0\r\nused_chars = []\r\nfor i in s:\r\n if i == trigger or i in used_chars:\r\n counter += 1\r\n used_chars.append(trigger)\r\n trigger = i\r\n\r\nprint(counter) \r\n", "horseshoe_colors = list(map(int, input().split())) # List of horseshoe colors\r\nunique_colors = set(horseshoe_colors) # Set of unique colors\r\n\r\nminimum_horseshoes_to_buy = 4 - len(unique_colors)\r\nprint(minimum_horseshoes_to_buy)\r\n", "s=list(map(int,input().split()))\r\nl=[]\r\nfor i in s:\r\n if i not in l:\r\n l.append(i)\r\nprint(len(s)-len(l))", "colours = input('')\r\ncount = []\r\nn = 0\r\ncolors_2 = list(map(int, colours.split()))\r\nfor i in colors_2:\r\n if i in count:\r\n n += 1\r\n else:\r\n count.append(i)\r\nprint(n)", "g=set(map(int,input().split()))\r\nprint(4-len(g))\r\n", "n = [int(i) for i in input().split()]\r\nm = [0,0,0,0]\r\nn.sort()\r\nb,s,ss = '',0,0\r\nfor i in n:\r\n if ss==0:\r\n b = i\r\n m[s]+=1\r\n elif i == b:\r\n m[s]+=1\r\n else:\r\n b = i\r\n s+=1\r\n m[s]+=1\r\n ss+=1\r\nif m[0]==0:\r\n m[0]=1\r\nif m[1]==0:\r\n m[1]=1\r\nif m[2]==0:\r\n m[2]=1\r\nif m[3]==0:\r\n m[3]=1\r\nprint(m[0]-1+m[1]-1+m[2]-1+m[3]-1)", "n=[int(x) for x in input().split()]\r\nc=0\r\nz=len(n)\r\nd={}\r\nfor i in range(z):\r\n if d.get(n[i])==None:\r\n d[n[i]]=1\r\n else:\r\n c+=1\r\nprint(c)", "l = set(map(int,input().split()))\r\nprint(4-len(l))", "a = list(map(int,input().split()))\r\nb = len(a)\r\nc = len(set(a))\r\nprint(b - c)", "s = input().split()\r\nx = len(set(s))\r\nresult = 4 - x\r\nprint(result)\r\n", "s1, s2, s3, s4 = map(int, input().split())\r\ncolors = [s1, s2, s3, s4]\r\nunique_colors = set(colors)\r\nmin_horseshoes_to_buy = 4 - len(unique_colors)\r\nprint(min_horseshoes_to_buy)\r\n", "def intter(l):\r\n for i in range(0 , len(l)):\r\n l[i] = int(l[i])\r\n return l\r\nx = intter(input(\"\").split(\" \"))\r\n\r\ny = []\r\n\r\nfor i in range(0,len(x)):\r\n if x[i] not in y:\r\n y.append(x[i])\r\nprint(abs(len(x)-len(y)))\r\n", "l=list(map(int,input().split()))[:4]\r\nl2=set(l)\r\nprint(len(l)-len(l2))", "print(4-len({*input().split()}))\n\t\t\t \t\t\t\t\t\t \t\t \t\t \t \t", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Find the number of distinct colors Valera already has\r\ndistinct_colors = len(set([s1, s2, s3, s4]))\r\n\r\n# Calculate how many additional horseshoes he needs to buy\r\nadditional_horseshoes = 4 - distinct_colors\r\n\r\n# Print the result\r\nprint(additional_horseshoes)", "l=list(map(int,input().split()))\r\ns=[]\r\nfor i in l:\r\n if i not in s:\r\n s.append(i)\r\nprint(4-len(s))", "l = input().split()\r\nl.sort()\r\ncnt = 0\r\n\r\nfor i in range(len(l)-1):\r\n if l[i]==l[i+1]:\r\n cnt+=1\r\n\r\nprint(cnt)", "col = set(list(map(int, input().split())))\nprint(4-len(col))\n\t \t \t \t\t \t \t\t \t \t \t \t\n \t \t \t \t\t\t\t\t\t \t\t\t\t\t\t\t\t", "import sys\r\n\r\na =[int(i) for i in sys.stdin.readline().split()]\r\nb = []\r\nc = 0\r\nfor i in a:\r\n if i in b:\r\n b.append(i)\r\n c += 1\r\n else:\r\n b.append(i)\r\n\r\nprint(c)\r\n\r\n", "x=list(map(int,input().split()))\r\nl1=[]\r\nfor i in x:\r\n if i not in l1:\r\n l1.append(i)\r\nprint(4-len(l1))", "s = list(map(int, input().split()))\r\ns.sort()\r\nmin_purchases = 0\r\n\r\nfor i in range(1, 4):\r\n if s[i] == s[i-1]:\r\n min_purchases += 1\r\n\r\nprint(min_purchases)\r\n", "s1 = list(map(int, input().split()))\r\ns1_size = len(s1)\r\n\r\ns2 = set(s1)\r\ns2_size = len(s2)\r\n\r\nprint(s1_size - s2_size)\r\n\r\n", "inp = map(int, input().split())\nff = list(inp)\ngg = set(ff)\nprint(len(ff)-len(gg))\n", "a = list(map(int, input().split()))\r\na.sort()\r\ni = 0\r\nfor num in range(3):\r\n if a[i] == a[i+1]:\r\n a.pop(i)\r\n i -= 1\r\n i += 1\r\nprint(4 - len(a))\r\n", "my_list=list(map(int,input().split()))\r\nmy_dic={}\r\nfor item in my_list:\r\n my_dic.setdefault(item,0)\r\n my_dic[item]+=1\r\ns=0\r\nfor value in my_dic.values():\r\n if value>=2:\r\n s+=value-1\r\nprint(s)", "x=list(map(int,input().split()))\r\nxx=[]\r\n\r\n\r\n\r\nfor i in x :\r\n if i not in xx:\r\n xx.append(i)\r\n \r\nprint(4-len(xx))\r\n\r\n", "arr = [int(i) for i in input().split()]\narr.sort()\nans = 0\nfor i in range(1, 4): # 1 2 3\n if arr[i] == arr[i-1]:\n ans += 1\nprint(ans)\n# i = 2\n# 0 1 2 3\n# 1 3 3 7 5\n\n \t \t\t \t \t\t\t\t \t\t\t\t\t \t \t \t", "import sys\r\nlist = sys.stdin.readline().strip().split()\r\nif len(set(list)) == 3:\r\n print('1')\r\nif len(set(list)) == 2:\r\n print('2')\r\nif len(set(list)) == 1:\r\n print('3')\r\nif len(set(list)) == 4:\r\n print('0')", "def different_horseshoes(shoes):\r\n diff = []\r\n for s in shoes:\r\n if s not in diff:\r\n diff.append(s)\r\n return 4 - len(diff)\r\n\r\nprint(different_horseshoes(shoes=[int(item) for item in input().split()]))", "def horseshoe(list_of_colors_of_horseshoes):\r\n return len(list_of_colors_of_horseshoes) - len(set(list_of_colors_of_horseshoes))\r\n\r\nif __name__ == \"__main__\":\r\n list_of_colors_of_horseshoes = list(map(int , input().split()))\r\n print(horseshoe(list_of_colors_of_horseshoes))", "s1, s2, s3, s4 = map(int, input().split())\r\ndis_colors = set([s1, s2, s3, s4])\r\nadditional_horseshoes_needed = 4 - len(dis_colors)\r\nprint(additional_horseshoes_needed)", "s = input().split()\r\ncount = 0\r\n\r\nfor i in range(0, len(s)-1):\r\n for j in range(i+1, len(s)):\r\n if s[i] == s[j]:\r\n if s[j] == '-1':\r\n continue\r\n else:\r\n s[j] = '-1'\r\n count = count + 1\r\n\r\nprint(count)", "def solution():\r\n p = list(map(int, input().split()))\r\n cn = set(p)\r\n print(4 - len(cn))\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n\r\n\r\n", "p = list(map(int, input().split()))\r\n\r\n# find uniques\r\n# increase price for 4 - uniques\r\n\r\ndef find_uniques(p):\r\n\r\n uniques = len(set(p))\r\n\r\n required = 4 - uniques\r\n\r\n return required\r\n\r\nprint(find_uniques(p))", "a, b, c, d = input().split()\nif a == b == c == d:\n print(3)\nelif a == b == c or a == b == d or c == b == d or a == c == d or a == b and c == d or a ==c and b == d or a == d and c == b:\n print(2)\nelif a == b or a == c or a == d or b == d or b == c or c == d:\n print(1)\nelse:\n print(0)", "a = [*map(int, input().split())]\n\nb = set()\n\nfor i in a: b.add(i)\n\nprint(len(a) - len(b))\n", "n=set(map(int,input().split(' ')))\r\nprint(4-len(n))\r\n", "l=list(map(int,input().split()))\r\nz=set(l)\r\nprint(4-len(z))", "uniques = []\r\nfor shoe in input().split(' '):\r\n if shoe not in uniques: uniques.append(shoe)\r\n\r\nprint(4 - len(uniques))", "b=list(map(str,input().split()))\r\na=set()\r\nfor i in range(4):\r\n a.add(b[i])\r\nprint(4-len(a))\r\n ", "n=list(map(int,input().split()))\r\na=set(n)\r\nprint(4-len(a))", "s = list(map(int, input().split()))\r\n\r\nnot_same = set()\r\n\r\nfor shoe in s:\r\n not_same.add(shoe)\r\n\r\nshoes = list(not_same)\r\n\r\nsame = len(s)- len(shoes)\r\n\r\nprint(same)", "# Read the colors of horseshoes as a list of integers\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate the number of distinct colors among the horseshoes\r\ndistinct_colors = len(set(colors))\r\n\r\n# Calculate the minimum number of horseshoes Valera needs to buy\r\nmin_horseshoes_to_buy = 4 - distinct_colors\r\n\r\n# Print the result\r\nprint(min_horseshoes_to_buy)\r\n", "list1=[]\r\na,b,c,d=input().split(' ')\r\nlist1.append(int(a))\r\nlist1.append(int(b))\r\nlist1.append(int(c))\r\nlist1.append(int(d))\r\nlist2=[]\r\nfor i in list1:\r\n if i not in list2:\r\n list2.append(i)\r\nprint(len(list1)-len(list2))\r\n", "def minimum_horseshoes_to_buy(colors):\r\n return 4 - len(set(colors))\r\n\r\ndef main():\r\n colors = list(map(int, input().split()))\r\n min_horseshoes_to_buy = minimum_horseshoes_to_buy(colors)\r\n print(min_horseshoes_to_buy)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "c = list(map(int, input().split()))\r\n\r\nd_colors = len(set(c))\r\nadditional_horseshoes = 4 - d_colors\r\n\r\nprint(additional_horseshoes)\r\n", "s=list(map(int, input().split()))\r\nprint(4-len(list(set(s))))", "input_list = input()\r\n\r\nshoes = (input_list.split())\r\n#shoes = [int(x) for x in shoes]\r\n\r\nduplArray = {}\r\n\r\nbuy = 0\r\n\r\nfor i in shoes:\r\n duplArray[i] = shoes.count(i)\r\n \r\nfor i in duplArray.keys():\r\n buy = buy + duplArray[i] - 1\r\nprint(buy)", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n s = set(list(map(int, input().split())))\r\n print(4 - len(s))\r\nif __name__ == \"__main__\":\r\n main()", "s=list(map(int,input().split()))\r\ntotal=[]\r\nfor color in s:\r\n if color not in total:\r\n total.append(color)\r\nprint(4-len(total))", "# Read the input\r\ns1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Count the unique colors\r\nunique_colors = len(set([s1, s2, s3, s4]))\r\n\r\n# Calculate the minimum number of horseshoes to buy\r\nmin_horseshoes_to_buy = 4 - unique_colors\r\n\r\n# Print the result\r\nprint(min_horseshoes_to_buy)\r\n", "res = [int(i) for i in input().split()]\r\ntotal = []\r\ncount = 0\r\nfor i in range(len(res)):\r\n if res[i] not in total:\r\n total.append(res[i])\r\nprint(len(res) - len(total))\r\n", "from collections import Counter\r\nl = list(map(int,input('').split()))\r\nprint(len(l)-len(Counter(l)))\r\n\r\n", "horseshoes = list(map(int, input().split()))\r\nunique_colors = len(set(horseshoes))\r\nneeded_to_buy = max(0, 4 - unique_colors)\r\nprint(needed_to_buy)\r\n", "a, b, c, d = map(int, input().split())\r\ns={\"\"}\r\ns.add(a)\r\ns.add(b)\r\ns.add(c)\r\ns.add(d)\r\nprint(5-len(s))\r\n\r\n", "shoes = list(map(int, input().split()))\r\ndistinct_colors = len(set(shoes))\r\n\r\n\r\n\r\nadditional_colors_needed = 4 - distinct_colors\r\n\r\nprint(additional_colors_needed)\r\n", "n=len(set(list(map(int,input().split()))))\r\nprint(4-n)", "n = [int(x) for x in input().split(\" \")]\nc = 0\nd = {}\nfor i in range(len(n)):\n if d.get(n[i]) == None:\n d[n[i]] = 1\n else:\n c += 1\nprint(c)", "n = len(set(input().split()))\n\nprint(4 - n)", "a=(str(input())).split()\r\na.sort()\r\nc=0\r\nfor i in range(0,len(a)-1):\r\n if a[i]==a[i+1]:\r\n c+=1\r\nprint(c)", "#!/bin/env python3\n\ns = [int(x) for x in input().split()]\ns.sort()\n\nnbuy = 3\nfor i in range(0,3):\n if s[i] != s[i+1]:\n nbuy -= 1\n\nprint(nbuy)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 08:53:47 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\ndata=input().split()\r\nprint(len(data)-len(set(data)))", "c = input().split()\r\nd = {4:0,6:1,8:2,10:2,16:3}\r\ntotal = c.count(c[0])+c.count(c[1])+c.count(c[2])+c.count(c[3])\r\nprint(d[total])\r\n# if total == 4:\r\n# print(0)\r\n# elif total == 6:\r\n# print(1)\r\n# elif total == (8 or 10):\r\n# print(2)\r\n# else:\r\n# print(3)", "s1, s2, s3, s4 = (input().split())\nprint(4-len({s1, s2, s3, s4}))\n\t \t\t\t \t\t\t \t \t\t \t\t", "#1 7 3 3\r\n\r\ncolors = [int(x) for x in input().strip().split() ]\r\noutput= 0\r\nfor x in range(4):\r\n for y in range(x+1,4):\r\n if colors[x] == colors[y]:\r\n output +=1\r\n break\r\n\r\nprint(output)\r\n ", "x=set(input().split())\r\nh=4-len(x)\r\nprint(h)", "def main():\r\n colors = [int(x) for x in input().split()]\r\n \r\n output = 0\r\n if colors[1] == colors[0]:\r\n output += 1\r\n if colors[2] == colors[0] or colors[2] == colors[1]:\r\n output += 1\r\n if colors[3] == colors[0] or colors[3] == colors[1] or colors[3] == colors[2]:\r\n output += 1\r\n \r\n print(output)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nl=s.split()\r\na=0\r\nfor i in range(0,3):\r\n c=0\r\n for j in range(1,4-i):\r\n if l[i]==l[i+j]:\r\n c+=1\r\n a+=c\r\nif a==0:\r\n print(0)\r\nif a==1:\r\n print(1)\r\nif a==2:\r\n print(2)\r\nif a==3:\r\n print(2)\r\nif a==6:\r\n print(3)\r\n\r\n ", "ex = list(map(int, input().split()))\r\nex.sort() \r\ncount = 0\r\nfor i in range(3): \r\n if ex[i] == ex[i + 1]:\r\n count += 1\r\nprint(count)", "color = list(map(int, input().split()))\r\ndcolor = set(color)\r\nprint(4-len(dcolor))", "l=list(map(int,input().split()))\r\nk=[]\r\nfor i in l:\r\n if i not in k:\r\n k.append(i)\r\nc=0\r\nfor i in k:\r\n c+=(l.count(i)-1)\r\nprint(c)", "l1=list(map(int,input().split()))\r\nl1=set(l1)\r\nl1=list(l1)\r\nprint(abs(len(l1)-4))", "l=list(map(int, input().split()))\r\nk=len(set(l))\r\np=4-k\r\nprint(max(0,p))\r\n\r\n\r\n\r\n", "s1,s2,s3,s4 = map(int, input().split())\r\na = [s1,s2,s3,s4]\r\nb = set(a)\r\nprint(len(a)-len(b))", "a=list(map(int,input().split()))\r\nc=0\r\na.sort()\r\nfor i in range(1,len(a)):\r\n if a[i]==a[i-1]:\r\n c+=1\r\nprint(c)", "colors = input().split()\r\nunique_colors = set(colors)\r\nnum_unique_colors = len(unique_colors)\r\nnum_horseshoes_to_buy = 4 - num_unique_colors\r\nprint(num_horseshoes_to_buy)", "s=list(map(int,input().split()))\r\nb=len(s)\r\na=len(list(set(s)))\r\nprint(b-a)", "st = set(map(int, input().split()))\r\nn = len(st)\r\nprint(4 - n)", "from collections import Counter\r\nnum = list(map(int,input().split()))\r\ncount = Counter(num)\r\nans = 0\r\nfor x in count:\r\n ans += count[x] - 1\r\nprint(ans)\r\n", "x = [int(x) for x in input().split(\" \")]\r\n\r\ncount = 0\r\n\r\nx.sort()\r\n\r\nfor i in range (1,4) :\r\n if x[i] == x[i-1] :\r\n count += 1\r\n\r\nprint(count)", "n=4\r\ns=0\r\nnumbers = [int(num) for num in input().split(\" \", n-1)]\r\nf=set(numbers)\r\nprint(4-len(f))\r\n ", "x=list(map(int,input().split()))\r\nprint(len(x)-len(set(x)))", "n=list(map(int,input().split()))\r\nn.sort()\r\nc=0\r\nfor i in range(len(n)-1):\r\n if n[i]==n[i+1]:\r\n c+=1\r\nprint(c)", "# Read the colors of the horseshoes Valera has\r\ncolors = list(map(int, input().split()))\r\n\r\n# Count the number of unique colors\r\nunique_colors = len(set(colors))\r\n\r\n# Calculate the minimum number of horseshoes Valera needs to buy\r\nmin_horseshoes = 4 - unique_colors\r\n\r\n# Print the result\r\nprint(min_horseshoes)\r\n", "n=input().split()\r\nm=set(n)\r\nprint(4-len(m))\r\n ", "n = list(map(int, input().split()))\r\n\r\ncol = 0\r\n\r\nn.sort()\r\n\r\nfor i in range(3):\r\n if n[i] == n[i+1]:\r\n col += 1\r\nprint(col)", "def solve(l):\r\n return 4 - len(set(l))\r\nprint(solve(list(map(int,input().split()))))\r\n", "horsheshoes = input().split(' ')\r\nhorsheshoes_list = [int(x) for x in horsheshoes]\r\n\r\nhashmap = {}\r\n\r\nfor shoe in horsheshoes_list:\r\n if shoe in hashmap:\r\n hashmap[shoe] += 1\r\n else:\r\n hashmap[shoe] = 1\r\n \r\n \r\ndef twotwoeight(arr):\r\n if len(arr) == len(set(arr)):\r\n return 0\r\n number_of_shoes = list(hashmap.values())\r\n i = max(number_of_shoes)\r\n if number_of_shoes.count(i) == 1:\r\n return (i-1)\r\n else:\r\n return (i)\r\n \r\nprint(twotwoeight(horsheshoes_list))", "l=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n if(l[i]==l[j]):\r\n c+=1\r\n break\r\nprint(c)", "colors = set(input().split())\r\nprint(4 - len(colors))", "s1,s2,s3,s4 = map(int,input().split(\" \"))\r\nprint(4-len(set([s1,s2,s3,s4])))\r\n", "have=[int(x) for x in input().split()]\r\ncount=0\r\nif have[1]==have[0]: count+=1\r\nif have[2]==have[0]: count+=1\r\nif have[3]==have[0]: count+=1\r\nif have[2]==have[1]: count+=1\r\nif have[3]==have[1]: count+=1\r\nif have[3]==have[2]: count+=1\r\nif have[0]==have[1] and have[1]==have[2]: count-=1\r\nif have[0]==have[1] and have[1]==have[3]: count-=1\r\nif have[0]==have[2] and have[2]==have[3]: count-=1\r\nif have[1]==have[2] and have[2]==have[3]: count-=1\r\nif have[0]==have[1] and have[0]==have[2] and have[0]==have[3]: count+=1\r\nprint(count)", "col =list(map(int,input().split()))\r\na=len(set(col))\r\nprint(4-a)", "s = input()\r\n\r\ns = s.split()\r\n\r\na = set(s)\r\n\r\nprint(4 - len(a))", "colors = list(map(int, input().split()))\r\nunique_colors = set(colors)\r\nnum_to_buy = 4 - len(unique_colors)\r\n\r\nprint(num_to_buy)", "setdif = set(map(int,input().split()))\r\nprint(4-len(setdif))", "l=list(map(int,input().split()))\r\ns=set(l)\r\nll=len(l)\r\nsl=len(s)\r\nans=ll-sl\r\nprint(ans)", "def solve(values):\r\n return 4 - len(set(values))\r\n\r\ndef main():\r\n values = list(map(int, input().split()))\r\n print(solve(values))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = input().split()\r\nb = len(set(a))\r\nprint(len(a)-b)", "S=list(map(int,input().split()))\r\nprint(4-len(set(S)))", "colors = list(map(int, input().split()))\r\ndistinct_colors = len(set(colors))\r\nprint(4 - distinct_colors)\r\n", "a = input().split()\r\nbuy = 0\r\nh = []\r\nfor i in range(len(a)):\r\n if a[i] in h:\r\n buy += 1\r\n else:\r\n h += [a[i]] \r\nprint(buy)", "print(4-len((set(input().split(' ')))))", "my_set = set()\r\nnumbers = input().split()\r\nfor num in numbers:\r\n ele = int(num)\r\n my_set.add(ele)\r\nprint(4 - len(my_set))", "\r\n# это задача 228A\r\n\r\na = set(input().split())\r\nprint(4 - len(a))", "horsehoe=list(map(float,input().split()))\r\nnum=0\r\nfor i in range(4):\r\n if horsehoe.count(horsehoe[i])>1:\r\n num+=1\r\n horsehoe[i]=\"done\"\r\n \r\n \r\n \r\nprint(num)", "a=list(map(int,input().split()))\r\nprint(abs(len(set(a))-len(a)))", "s = list(map(int,input().split()))\r\nunique = set(s)\r\nresp = len(s) - len(unique) \r\nprint(resp)", "lst=list(map(str,input().split()))\r\nres=0\r\nre=\"\"\r\nfor char in lst:\r\n if char in re:\r\n pass\r\n else:\r\n c1=lst.count(char)\r\n c1-=1\r\n re+=char\r\n res+=c1\r\nprint(res)\r\n", "s = list(map(int, input().split()))\r\n\r\ncheck = []\r\nans = 0\r\nfor i in s:\r\n if i not in check:\r\n check.append(i)\r\n else:\r\n ans += 1\r\n\r\nprint(ans)", "# Input: Read four space-separated integers\r\ns1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Create a set to store unique colors\r\nunique_colors = set([s1, s2, s3, s4])\r\n\r\n# Calculate the number of additional horseshoes needed\r\nadditional_horseshoes_needed = 4 - len(unique_colors)\r\n\r\n# Output the result\r\nprint(additional_horseshoes_needed)\r\n", "n = list(map(int, input().split()))\r\n\r\nd = set()\r\nc = 0\r\n\r\nfor i in range(4):\r\n \r\n if n[i] in d:\r\n \r\n c += 1\r\n \r\n else:\r\n \r\n d.add(n[i])\r\n \r\nprint(c)\r\n \r\n ", "a=[int(i) for i in input().split()]\r\nprint(len(a)-len(set(a)))", "s = list(map(int,input().split()))\r\nprint(4-len(set(s)))", "# import sys\r\n\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\nhorseshoes = set(map(int, input().split()))\r\nprint(4 - len(horseshoes))", "s1,s2,s3,s4=map(int,input().split())\r\ndist_colors=set([s1,s2,s3,s4])\r\nnew_shoes=4-len(dist_colors)\r\nprint(new_shoes)\r\n", "n=input().split()\r\nn.sort()\r\nm=0\r\nif n[0]==n[1]:\r\n m+=1\r\nif n[1]==n[2]:\r\n m+=1\r\nif n[2]==n[3]:\r\n m+=1\r\nprint(m)\r\n \r\n", "q=input().split()\r\nprint(4-len({*q}))", "s = list(map(int, input().split()))\r\ndup_count = 0\r\ns.sort()\r\nfor i in range(3):\r\n if s[i] == s[i + 1]:\r\n dup_count += 1\r\n\r\nprint(dup_count)", "lst = [int(x) for x in input().split()]\r\nl = len(lst)\r\ns = len(set(lst))\r\nprint(l-s)", "x=list(map(int,input().split()))\r\nlen1=len(x)\r\nlen2=len(set(x))\r\nprint(len1-len2)", "l=[int(x) for x in input().split()]\r\ns=set(l)\r\nprint(4-len(s) if len(s)<=4 else 0)", "cols = [int(x) for x in input().split(\" \")]\r\nset_colors = set(cols)\r\n\r\nprint(4 - len(set_colors))", "s=input().split()\r\nx=set(s)\r\nl1=len(s)\r\nl2=len(x)\r\nprint(l1-l2)", "s1, s2, s3, s4 = map(int, input().split())\r\nshoes = [s1, s2, s3, s4]\r\nshoes.sort()\r\ncount = 3\r\nfor s in range(len(shoes) - 1):\r\n if shoes[s] != shoes[s + 1]:\r\n count -= 1\r\nprint(count)\r\n", "colors = list(map(int, input().split()))\r\n\r\nunique_colors = set()\r\n\r\nfor color in colors:\r\n unique_colors.add(color)\r\n\r\nunique_count = len(unique_colors)\r\n\r\nadditional_horseshoes = 4 - unique_count\r\n\r\nprint(max(0, additional_horseshoes))\r\n", "color=map(int,input().split())\r\ncount=len(set(color))\r\nprint(4-count)", "import sys\r\n\r\ns = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nprint(4 - len(dict.fromkeys(s)))", "numbers = list(map(int, input().split()))\r\nnums = set(numbers)\r\nprint(4 - len(nums))", "# 228A - Is your horseshoe on the other hoof?\r\ncolors = list(map(int, input().split(' ')))\r\narray = []\r\n\r\nfor c in colors:\r\n if c not in array:\r\n array.append(c)\r\n\r\nprint(4 - len(array))", "c = list(map(int, input().split()))\r\nunique = len(set(c))\r\nh = 4 - unique\r\nprint(h)", "a=list(map(int,input().split()))\r\nb=sorted(a)\r\ns=0\r\nfor i in range(3):\r\n if b[i]==b[i+1]:\r\n s=s+1\r\nprint(s)\r\n", "l=list(map(int,input().split()))\r\nx=len(set(l))\r\n\r\nprint(len(l)-x)", "s = list(map(int, input().split()))\r\nd = list(dict.fromkeys(s))\r\n\r\nprint(len(s) - len(d))", "s1, s2, s3, s4 = map(str, input().split())\r\na = set()\r\na.add(s1)\r\na.add(s2)\r\na.add(s3)\r\na.add(s4)\r\nprint(4 - len(a))", "n=list(map(int,input().split()))\r\na=list(set(n))\r\nprint(len(n)-len(a))", "s1,s2,s3,s4 = map(int,input().split())\r\nu = set([s1,s2,s3,s4])\r\nprint(4-len(u))", "a,b,c,d=map(int,input().split())\r\ne=set([a,b,c,d])\r\nf=4-len(e)\r\nprint(f)", "a = [int(i) for i in input().split()]\r\na.sort()\r\ne = 0\r\nif a[0] < a[1]:\r\n e = e + 1\r\nif a[1] < a[2]:\r\n e = e + 1\r\nif a[2] < a[3]:\r\n e = e + 1\r\nprint(4 - (e + 1))", "print(4 - len(list(set(input().split()))))", "a=input().split()\r\nprint(4-len(set(a)))", "horseshoes = map(int,input().split())\nunique = set(horseshoes)\ncount = 0\nfor i in unique:\n count +=1 \nprint(4-(count))", "hc = list(input().split())\r\nclist = []\r\ncounter = 0\r\nfor i in range(4):\r\n if not(hc[i] in clist) and hc.count(hc[i]) >= 2:\r\n counter += hc.count(hc[i]) - 1\r\n clist.append(hc[i])\r\nprint(counter)", "a,b,c,d = list(map(int, input().split()))\r\nlst= [a,b,c,d]\r\nlst1 = set(lst)\r\nprint(len(lst) - len(lst1))\r\n", "a=input(\" \")\r\nd={}\r\nl=a.split(\" \")\r\nfor i in l:\r\n if i!='':\r\n d[i] = l.count(i)\r\nc=0\r\nfor i in d:\r\n c+= d[i]-1\r\nc+=4-sum(d.values()) \r\nprint(c)", "horseshoes = list(map(int, input().split()))\r\nprint(4 - len(set(horseshoes)))", "def minimum_horseshoes(s1, s2, s3, s4):\r\n unique_colors = len(set([s1, s2, s3, s4]))\r\n return 4 - unique_colors\r\ns1, s2, s3, s4 = map(int, input().split())\r\nprint(minimum_horseshoes(s1, s2, s3, s4))\r\n", "colors = list(map(int, input().split()))\r\nuni = len(set(colors))\r\nhorseshoes = max(0, 4 - uni)\r\nprint(horseshoes)\r\n", "print(4 - len({int(x) for x in input().split()}))\n \t\t\t \t\t\t \t \t\t\t \t \t \t\t \t", "import sys\r\n\r\nfor line in sys.stdin:\r\n num = list(map(int, line.split()))\r\n num.sort()\r\n res = sum(num[i] == num[i+1] for i in range(3))\r\n print(res)\r\n", "a = input().split()\r\ns = dict.fromkeys(list(a))\r\nd = 0\r\nif len(s) == 1:\r\n d = 3\r\nelif len(s) == 2:\r\n d = 2\r\nelif len(s) == 3:\r\n d = 1\r\nelse:\r\n d = 0\r\n\r\nprint(d)\r\n\r\n", "s=list(map(int,input().split()))\r\nshoe=set(s)\r\nprint(len(s)-len(shoe))", "a = list(map(int, input().split()))\r\nb = set()\r\nfor i in a:\r\n b.add(i)\r\nprint(4 - len(b))\r\n", "l = list(map(int,input().split()))\r\n\r\ns = set(l)\r\n\r\nprint(4-len(s))\r\n\r\n", "l=list(map(int,input().split()))\r\nd={}\r\nc=0\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\nfor i in d.values():\r\n if i!=1:\r\n c+=(i-1)\r\nprint(c)", "def count_horseshoes(colors):\r\n unique_colors = set(colors)\r\n return 4 - len(unique_colors)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n colors = list(map(int, input().split()))\r\n result = count_horseshoes(colors)\r\n print(result)\r\n", "b=list(map(int,input().split()))\r\nd=0\r\nfor i in range (len(b)):\r\n for m in range(i+1,len(b)):\r\n if i<len(b)-1:\r\n if b[i] != b[m]:\r\n d+=0\r\n else:\r\n d+=1\r\n break\r\nprint(d)", "lst = list(map(int,input().split()))\r\nc = set(lst)\r\ns=0\r\nfor i in c:\r\n if lst.count(i) > 1:\r\n s+= (lst.count(i)-1)\r\nprint(s)", "ere =list(map(int,input().split()))\r\n\r\nres = set(ere)\r\nder = 4 - len(res)\r\nprint(der)", "x=input().split()\r\nsum=0\r\ny=len(x)\r\nx=set(x)\r\nprint (y-len(x))", "h = list(map(int, input().split()))\r\nuni = len(set(h))\r\na = max(0, 4 - uni)\r\nprint(a)\r\n", "x, y, z, w = map(int, input().split())\r\nuniqe_color = len({x, y, z, w})\r\na = 4 - uniqe_color\r\nprint(a)\r\n", "# Read the input\ns1, s2, s3, s4 = map(int, input().split())\n\n# Count the unique colors\nunique_colors = len(set([s1, s2, s3, s4]))\n\n# Calculate the minimum number of horseshoes to buy\nmin_horseshoes_to_buy = 4 - unique_colors\n\n# Print the result\nprint(min_horseshoes_to_buy)\n\n \t \t \t\t \t\t\t \t\t\t\t \t\t \t \t", "a = list(map(int, input().split()))\r\nz=[]\r\nfor i in range(len(a)):\r\n if a[i] not in z:\r\n z.append(a[i])\r\nprint(len(a)-len(z))", "s1,s2,s3,s4=list(map(int,input().split()))\r\na=[]\r\na.append(s1)\r\na.append(s2)\r\na.append(s3)\r\na.append(s4)\r\nc=0\r\nq=[]\r\nfor i in range(len(a)): \r\n c=0\r\n if (a[i] in a )and( a[i] not in q):\r\n q.append(a[i])\r\n \r\n \r\n \r\nprint(len(a)-len(q)) \r\n", "print(4 - len(set(map(int, input().split()))))\r\n", "u = set(map(int, input().split()))\r\nif len(u) < 4:\r\n print(4 - len(u))\r\nelse:\r\n print(0)", "a = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(4):\r\n for j in range(i + 1, 4):\r\n if a[i] == a[j]:\r\n a[j] = -1\r\nfor i in range(4):\r\n if a[i] == -1:\r\n c = c + 1\r\nprint(c)\r\n", "x = map(int, input().split())\r\nf = []\r\ng = 0\r\nfor i in x:\r\n if i not in f:\r\n f.append(i)\r\n else:\r\n g += 1\r\nprint(g)", "color=set(input().split())\r\ncount = 4- len(color)\r\nprint(count)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 31 19:54:33 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\ns = input().split()\r\n\r\nc = []\r\n\r\nfor i in range(len(s)):\r\n if s[i] not in c:\r\n c.append(s[i])\r\n\r\nprint(4-len(c))", "s = input().split()\r\ns = [int(x) for x in s]\r\nunique = len(set(s))\r\nprint(4 - unique)\r\n\r\n", "l=list(map(int,input().split()))\r\ns=len(list(set(l)))\r\nprint(4-s)\r\n", "s11, s21, s31, s41 = map(int, input().split())\r\n\r\nunique_colors = set([s11, s21, s31, s41])\r\n\r\nmin_horseshoes_to_buy = 4 - len(unique_colors)\r\n\r\n\r\nprint(min_horseshoes_to_buy)\r\n", "s = list(map(int, input().split()))\r\nans = 0\r\nl = set(s)\r\nfor i in l:\r\n ans += s.count(i) - 1\r\nprint(ans)", "col=list(map(int,input().split()))\r\nnew=len(set(col))\r\nfin=4-new\r\nprint(fin)", "arr = list(map(int,input().split()))\r\nset_form = set(arr)\r\nprint(len(arr)-len(set_form))", "import collections\n\nshoes =list(map(int, input().split()))\n\nhashset = set()\n\ntotal = 0\nfor shoe in shoes: \n if shoe in hashset: \n total += 1\n hashset.add(shoe)\nprint(total)\n", "color = input().split()\r\ncolor = [int(i) for i in color]\r\ncolor.sort()\r\ncount = 0\r\nx = 0\r\nfor i in range(len(color)):\r\n if color[i] == x and i > 0:\r\n count += 1\r\n x = color[i]\r\nprint(count)\r\n ", "s = list(map(int, input().split()))\r\nprint(4 - len(set(s)))\r\n", "a,b,c,d = map(int,input().split())\r\nres= set()\r\nres.add(a)\r\nres.add(b)\r\nres.add(c)\r\nres.add(d)\r\nprint(4-len(res))", "pod = [int(a) for a in input().split()]\r\npdl = set(pod)\r\n\r\nprint(len(pod) - len(pdl))", "colors = list(map(int, input().split()))\r\nunique_colors = len(set(colors))\r\nmin_horseshoes_to_buy = 4 - unique_colors\r\nmin_horseshoes_to_buy = max(min_horseshoes_to_buy, 0)\r\nprint(min_horseshoes_to_buy)\r\n", "a=[int(i) for i in input().split()]\r\nd={}\r\nans=0\r\nfor i in a:\r\n if i in d:\r\n ans+=1 \r\n else:\r\n d[i]=0\r\nprint(ans)\r\n ", "n=[int(x) for x in input().split()]\r\nct=0\r\ndic={}\r\nfor i in range(4):\r\n if dic.get(n[i])==None:\r\n dic[n[i]]=1\r\n else:\r\n ct=ct+1\r\nprint(ct)\r\n\r\n", "w, x, y, z = map(int, input().split())\r\ndistinct_numbers = set([w, x, y, z])\r\nbuy = 4 - len(distinct_numbers)\r\nprint(buy)", "l=list(map(int,input().split()))\r\ns=set()\r\nfor i in range (0,len(l)):\r\n s.add(l[i])\r\nprint(4-len(s))", "s = [int(num) for num in input().split()]\r\nprint(4 - len(set(s)))", "#Представте себя в яблонинивем саду лежашем на траве, слева обдувает прохладный ветерок, а ты в ожидании своего нового вертолёта# \r\na=list(map(int,input().split()))\r\nk=0\r\nc=[]\r\nfor i in range(len(a)):\r\n if a[i] not in c:\r\n c.append(a[i])\r\nprint(len(a)-len(c)) \r\n", "n = len(set(list(map(int,input().split( )))))\r\nprint(max(0,4-n))", "s=map(int,input().split())\r\nl=[]\r\nfor i in s:\r\n l.append(i)\r\n ans=set(l)\r\nprint(4- len(ans))", "# s=list(map(int,input().split()))\r\n# a=0\r\n# for i in s:\r\n# \ta+=s.count(i)-1\r\n# \ts.remove(i)\r\n# print(a)\r\nprint(4-len(set(input().split())))", "def rem(l):\r\n for x in l:\r\n if l.count(x)>1:\r\n l.remove(x)\r\n rem(l)\r\n return l\r\nl=list(map(int,input().split()))\r\nlst=rem(l)\r\nprint(4-len(lst))", "col=list(map(int,input().split()))\r\nuni_col=len(set(col))\r\nadd_horse=4-uni_col\r\nprint(add_horse)", "s1,s2,s3,s4=list(map(int,input().split()))\r\nlst=[s1,s2,s3,s4]\r\nfinalLst=[]\r\n\r\nfor i in lst:\r\n if i not in finalLst:\r\n finalLst.append(i)\r\n\r\nprint(4-len(finalLst))", "colors = list(map(int, input().split()))\r\n\r\ndistinct_colors = len(set(colors))\r\nadditional_colors_needed = 4 - distinct_colors\r\n\r\nprint(additional_colors_needed)\r\n", "n=[int(x) for x in input().split()]\r\nprint(4-len(set(n)))", "l=list(map(int,input().split()))\r\np=[]\r\nfor i in range(len(l)):\r\n if l[i] not in p:\r\n p.append(l[i])\r\nprint(len(l)-len(p)) ", "L = list(map(int, input().split()))\r\nL = list(set(L))\r\nprint(4-len(L))", "s1,s2,s3,s4=map(int,input().split())\r\ncount=set([s1,s2,s3,s4])\r\ndis=4-len(count)\r\nprint(dis)", "colors = list(map(int, input().split()))\nchecked = []\nresult = 0\n\nfor s in colors:\n if s not in checked and colors.count(s) > 1:\n result += colors.count(s) - 1\n checked.append(s)\n\nprint(result)\n", "x = set(list(map(int,input().split())))\r\nprint(4-len(x))", "n=list(map(int,input().split()))\r\ns=len(set(n))\r\nx=4-s\r\nprint(x)", "s=list(map(int,input().split()))\nk=0\ns.sort()\nfor i in range(3):\n if s[i]==s[i+1]:\n k+=1\nprint(k)", "nums = input().split()\r\n\r\nall_nums = len(nums)\r\nunic_nums = len(set(nums))\r\n\r\nprint(all_nums - unic_nums)", "s = input().split()\r\nl = set(map(int,s))\r\nprint(4-len(l))", "from sys import stdin\r\ninput= stdin.readline()\r\ninput = list(map(int, input.split()))\r\ninput.sort()\r\nc=0\r\ncount=0\r\nwhile c<5:\r\n try: \r\n if input[c]==input[c+1]:\r\n count+=1\r\n except:\r\n pass\r\n c+=1\r\nprint(count)", "a = [int(i) for i in input().split()]\na.sort()\ncnt = 0\nif a[0] == a[1]:\n cnt += 1\nif a[1] == a[2]:\n cnt += 1\nif a[2] == a[3]:\n cnt += 1\nprint(cnt)\n \t \t \t\t \t\t\t \t\t\t \t\t \t\t", "n=list(map(int,input().split()))\r\ncount=0\r\nz=[]\r\nfor i in n:\r\n if i in z:\r\n count=count+1\r\n if i not in z:\r\n z.append(i)\r\n\r\nprint(count)", "n = 4\r\na = list(map(int, input().split()))\r\na.sort()\r\nc = 0\r\nfor i in range(n-1):\r\n if a[i] != a[i+1]:\r\n c += 1\r\nprint(n-c-1)", "n = input().split()\r\n\r\ncolors = dict()\r\nfor i in n:\r\n if i not in colors:\r\n colors[i] = i\r\n \r\nprint(4 - len(colors))\r\n ", "l=list(map(int,input().split()))\r\n#l=[1, 7, 3, 3]\r\ns=set(l)\r\nk=len(l)-len(s)\r\nprint(k)", "'''\n1\n'''\n# n = int(input().strip())\n# ans = 0\n\n# for i in range(n):\n# a = map(int, input().split(' '))\n# if sum(a) > 1:\n# ans+=1\n\n# print(ans)\n\n'''\n2\n'''\nprint(4-len(set(input().strip().split(' '))))", "podkovs = input().split()\r\nf =[]\r\nfor i in range(len(podkovs)):\r\n if podkovs[i] not in f:\r\n f.append(podkovs[i])\r\nprint(len(podkovs)-len(f))", "a=input()\r\nb=a.split(' ')\r\nc=[]\r\nfor i in b:\r\n if i not in c:\r\n c.append(i)\r\n else:\r\n continue\r\nn=4-len(c)\r\nprint(n)", "n=list(map(int, input().split()))\r\n\r\ncounter=0\r\n\r\nif n[0] == n[1] or n[0] == n[2] or n[0] == n[3]:\r\n counter += 1\r\n\r\nif n[1] == n[2] or n[1] == n[3]:\r\n counter += 1\r\n\r\nif n[2] == n[3]:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "s1,s2,s3,s4=map(int,input().split())\r\nlst=[]\r\nlst.append(s1)\r\nlst.append(s2)\r\nlst.append(s3)\r\nlst.append(s4)\r\ns=set(lst)\r\nprint(4-len(s))", "a=[]\r\ns=list(map(int,input().split()))\r\nfor i in s:\r\n if i not in a:\r\n a.append(i)\r\nprint(4-len(a))", "import sys\r\nfrom collections import Counter, deque\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solve():\r\n s = set(list(map(int, input().split())))\r\n print(4 - len(s))\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", "shoes = input().split()\nuniqueShoes = {shoes[0], shoes[1], shoes[2], shoes[3]}\n\nprint(4 - len(uniqueShoes))\n\n", "color_counts = {}\r\ncolors = list(map(int, input().split()))\r\n\r\nfor color in colors:\r\n color_counts[color] = color_counts.get(color, 0) + 1\r\nminimum_to_buy = 4 - len(color_counts)\r\n\r\nprint(minimum_to_buy)\r\n", "s = list(map(int,input().split()))\r\nt = set()\r\nfor i in s:\r\n t.add(i)\r\nprint(4 - len(t))", "n = [int(i) for i in input().split()]\r\nq = 0\r\nw = []\r\nfor i in n:\r\n a = n.count(i)\r\n if a > 1 and i not in w:\r\n w.append(i)\r\n q += a - 1\r\nprint(q)", "a=input()\r\na=a.split(\" \")\r\nx,y,z,w=int(a[0]),int(a[1]),int(a[2]),int(a[3])\r\nres=set()\r\nres.add(x)\r\nres.add(y)\r\nres.add(z)\r\nres.add(w)\r\n\r\nprint(4-len(res))", "a=input()\r\na=set(int(x) for x in a.split(\" \"))\r\nprint(4-len(a))", "array=list(map(int, input().split()))\r\narray=list(set(array)) \r\nsize=len(array)\r\nanswer= 4 -size\r\nprint(answer)\r\n", "def find_unique_elements(arr):\r\n unique_elements = set(arr)\r\n return list(unique_elements)\r\n\r\n\r\ns=input().split()\r\narr=[str(element) for element in s]\r\n\r\n\r\narr1=find_unique_elements(arr)\r\nprint(4-len(arr1))", "a =list(map(int,input().split()))\r\nb = set(a)\r\nprint(4-len(b))\r\n\r\n", "a=list(map(int,input().split()))\r\nb=set(a)\r\nprint(4-len(b))", "a = list(map(int, input().split()))\r\nA = []\r\nb = 0\r\nfor i in range(4):\r\n b = a.count(a[i])\r\n A.append(b)\r\n\r\nif A.count(2) == 4:\r\n print(2)\r\nelse:\r\n print(max(A)-1)\r\n", "import sys\r\n\r\narr = [int(i) for i in sys.stdin.readline().split()]\r\n\r\narr1 = dict.fromkeys(arr)\r\n\r\nprint(len(arr) - len(arr1))", "colors = input().split()\nans = []\ncolors.sort()\n\nfor i in colors:\n if colors.count(i) > 1 and ans.count(i) < 1:\n ans.append(i)\n for x in range(colors.count(i) - 1):\n ans.append('b')\n elif colors.count(i) == 1 and ans.count(i) <= 1:\n ans.append(i)\n\n\nprint(ans.count('b'))\n\n", "x = list(map(int, input().split()))\r\ny = set(x)\r\nr = 4 - len(y)\r\nprint(r)", "set1 = set(input().split())\r\nlenght = 4\r\n\r\nresult = lenght - len(set1)\r\nprint(result)\r\n", "# Read the input\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate the number of distinct colors\r\ndistinct_colors = len(set(colors))\r\n\r\n# Calculate the minimum number of horseshoes to buy\r\nminimum_horseshoes_to_buy = 4 - distinct_colors\r\n\r\n# Print the result\r\nprint(minimum_horseshoes_to_buy)\r\n", "numeros = str(input())\nlista = []\nspacePlace = numeros.find(\" \")\niguales = []\nfor i in range(4):\n if (spacePlace != -1):\n lista.append(int(numeros[:spacePlace + 1]))\n numeros = numeros[(spacePlace + 1):]\n spacePlace = numeros.find(' ')\n else:\n lista.append(int(numeros))\nfor item in lista:\n if item not in iguales:\n iguales.append(item)\n \nprint(4 - (len(iguales)))\n\t\t \t\t\t\t \t \t\t\t \t \t \t \t\t\t \t\t", "x=list(map(int,input().split(\" \")))\r\ncount=0\r\nl=[]\r\nfor i in x:\r\n if i not in l:\r\n l.append(i)\r\n else:\r\n count+=1\r\nprint(count)", "n = str(input())\r\nn = n.split()\r\nmoreuseful = set(n) \r\nhorseshoes = len(n) - len(moreuseful) \r\nprint(horseshoes)", "n=list(map(int, input().split()))\r\nst=set(n)\r\nprint(len(n)-len(st))", "a=map(int,input().split())\r\nr=[]\r\nfor i in a:\r\n if i not in r:\r\n r.append(i)\r\n\r\nprint(4-len(r))\r\n\r\n\r\n\r\n\r\n", "print(4-(len(set(input().split(\" \")))))", "s = list(input().split())\r\ns1 = set(s)\r\nprint(4-len(s1))", "def min_horseshoes_to_buy(s1, s2, s3, s4):\r\n unique_colors = set([s1, s2, s3, s4])\r\n return 4 - len(unique_colors)\r\n\r\ns1, s2, s3, s4 = map(int, input().split())\r\nmin_to_buy = min_horseshoes_to_buy(s1, s2, s3, s4)\r\nprint(min_to_buy)", "s1, s2, s3, s4 = map(int, input().split())\r\ncolors = set([s1, s2, s3, s4])\r\nadditional=4-len(colors)\r\nprint(additional)\r\n", "s = [int(e) for e in input().split(' ')]\r\nseen, c = [], 0\r\nfor e in s:\r\n if e in seen:\r\n c += 1\r\n continue\r\n seen += [e]\r\nprint(c)", "number1,number2,number3,number4=input().split()\r\nnumber1,number2,number3,number4=int(number1),int(number2),int(number3),int(number4)\r\ncount=1\r\nlist_=[number1,number2,number3,number4]\r\nlist_.sort()\r\nfor i in range(3):\r\n if(list_[i]!=list_[i+1]):\r\n count+=1\r\n \r\nprint(4-count)", "def minimum_horseshoes_to_buy(colors):\r\n unique_colors = len(set(colors))\r\n return max(0, 4 - unique_colors)\r\n\r\n\r\ncolors = list(map(int, input().split()))\r\noutput_result = minimum_horseshoes_to_buy(colors)\r\nprint(output_result)\r\n", "# Read input\r\ns1, s2, s3, s4 = map(int, input().split())\r\n\r\n# Create a set to store unique colors\r\ncolors_set = set([s1, s2, s3, s4])\r\n\r\n# Calculate the number of additional horseshoes needed\r\nadditional_horseshoes = 4 - len(colors_set)\r\n\r\n# Print the result\r\nprint(additional_horseshoes)\r\n", "arr = list(map(int, input().split()))\r\narr1 = len(arr)\r\nprint(arr1 - len(set(arr)))", "def horseShoeColors(arr: list) -> int:\n colorsHashset = len(set(arr))\n return 4 - colorsHashset\n\n \n# Read input values as integers\narr = map(int, input().split())\n \nprint(horseShoeColors(arr))", "wardrobe = list(map(int, input().split()))\r\n\r\ndiff = []\r\n\r\nfor i in wardrobe:\r\n if i not in diff:\r\n diff.append(i)\r\n\r\nprint(4 - len(diff))", "arr = list(map(int, input().split()))\r\nc = 0\r\nh = []\r\nfor i in range(len(arr)):\r\n if arr[i] not in h:\r\n h.append(arr[i])\r\n else:\r\n c += 1\r\nprint(c)\r\n", "print(4 - len(set(list(input().split()))))\r\n", "# LUOGU_RID: 113929584\nprint(4 - len(set(input().split())))", "import sqlite3\r\na, b, c, d, = map(int, input().split())\r\nres = {a, b, c, d}\r\nprint(4 - len(res))", "colors = list(map(int, input().split()))\nunique_colors = len(set(colors))\nprint(4 - unique_colors)\n\t \t \t\t\t\t \t \t \t\t \t \t \t \t\n \t\t\t\t\t\t \t \t\t \t \t\t\t \t \t\t \t \t", "a, b, c, d = (int(x) for x in input().split())\nans = 0\n\nif a==b or a==c or a==d:\n ans += 1\nif b==c or b==d:\n ans += 1\nif c==d:\n ans += 1\n\nprint(ans)\n\t\t \t\t \t\t \t\t\t\t\t \t\t \t \t \t\t", "def main():\n s = input().split()\n print(4 - len(set(s)))\n\nif __name__ == '__main__':\n main()", "s1,s2,s3,s4=[int(x)for x in input().split()]\r\ncount=set([s1,s2,s3,s4])\r\nhorseshoes=4-len(count)\r\n\r\nprint(horseshoes)", "# Read the input colors of horseshoes Valera has\r\ncolors = list(map(int, input().split()))\r\n\r\n# Create a set to store the unique colors\r\nunique_colors = set()\r\n\r\n# Count how many of the horseshoes Valera already has are of the same color\r\nduplicate_colors = 0\r\nfor color in colors:\r\n if color in unique_colors:\r\n duplicate_colors += 1\r\n else:\r\n unique_colors.add(color)\r\n\r\n# Calculate how many more different colors Valera needs\r\nadditional_colors_needed = 4 - len(unique_colors)\r\n\r\n# Print the minimum number of horseshoes Valera needs to buy\r\nprint(additional_colors_needed)\r\n", "colors = list(map(int, input().split())) # List of horseshoe colors\r\nunique_colors = set(colors) # Convert to a set to get unique colors\r\n\r\nmissing_colors = 4 - len(unique_colors) # Calculate the number of missing colors\r\nprint(missing_colors)\r\n", "l=list(map(int,input().split()))\r\ns=len(set(l))\r\nprint(4-s)\r\n", "def horse_shoes():\r\n st = set(input().split())\r\n return abs(len(st) - 4)\r\nprint(horse_shoes())", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\n\r\ncolors = {s1, s2, s3, s4}\r\n\r\nmin_ferraduras_a_comprar = 4 - len(colors)\r\n\r\nmin_ferraduras_a_comprar = max(min_ferraduras_a_comprar, 0)\r\n\r\nprint(min_ferraduras_a_comprar)\r\n", "from collections import Counter\r\nlst=list(map(int,input().split()))\r\nlst2= Counter(lst)\r\nnew_lst=lst2.keys()\r\n\r\nprint(4-len(new_lst))\r\n\r\n", "colors = list(map(int, input().split()))\r\n\r\na = len(set(colors))\r\nb = 4 - a\r\n\r\nprint(b)\r\n", "print(4 - len(set(list(map(int, input().split())))))\r\n", "s = input().split()\r\nprint(max(0, len(s)-len(set(s))))\r\n", "import sys\r\nprint(4 - len(dict.fromkeys([int(i) for i in sys.stdin.readline().split()])))", "x = set(map(int,input().split()))\r\nsum = 4 - len(x)\r\nprint(sum)", "lst=list(map(int,input().split()))\r\nprint(4-len(set(lst)))\r\n", "# Read the input\r\ncolors = list(map(int, input().split()))\r\n\r\n# Calculate the number of distinct colors Valera has\r\ndistinct_colors = len(set(colors))\r\n\r\n# Calculate the number of horseshoes Valera needs to buy to have four different colors\r\nhorseshoes_needed = 4 - distinct_colors\r\n\r\n# Output the result\r\nif horseshoes_needed > 0:\r\n print(horseshoes_needed)\r\nelse:\r\n print(0)\r\n", "# URL: https://codeforces.com/problemset/problem/228/A\n\nprint(4 - len(set(input().split())))\n", "horseshoes = list(map(int, input().split()))\r\n\r\nunique_colors = len(set(horseshoes))\r\nhorseshoes_to_buy = 4 - unique_colors\r\n\r\nprint(horseshoes_to_buy)", "n = list(input().split(\" \"))\r\nn1 = []\r\nfor i in n:\r\n if i not in n1:\r\n n1.append(i)\r\n\r\nprint(len(n) - len(n1))", "s = len(set(map(int, input().split())))\r\nprint(4 - s)", "arr = list(map(int, input().split()))\r\nprint(4 - len(set(arr)))", "lst = list(map(int,input().split()))\r\ndist = set(lst)\r\ncount = len(dist)\r\nprint(len(lst) - count)", "\ncolor_shoes = input()\nhoofs = color_shoes.split()\n\ncolor_list = [int(x) for x in hoofs]\n\nlength_hoofs = len(color_list)\ncolor_set = set(color_list)\ncolors = len(color_set)\n\n\nprint(4 - colors)", "shoes = map(int,input().split())\r\nl = []\r\ncount = 0\r\nfor i in shoes:\r\n l.append(i)\r\nl.sort()\r\nl.append(0)\r\nfor i in range(len(l)-1):\r\n if l[i]==l[i+1] :\r\n count += 1\r\nprint(count)\r\n ", "x=list(map(int,input().split()))\r\nlength=len(x)\r\nx=set(x)\r\nlength=length-len(x) \r\nprint(length)", "a=list(map(int,input().split()))\r\nprint(len(a)-len(set(a)))", "a, b, c, d = map(int, input().split())\r\n\r\ndistinct = 1\r\n\r\nif b != a:\r\n distinct += 1\r\nif c != a and c != b:\r\n distinct += 1\r\nif d != a and d != b and d != c:\r\n distinct += 1\r\n\r\nprint(4 - distinct)\r\n", "x=input().split(' ')\r\nb=[]\r\nfor i in x:\r\n if i not in b:b.append(i)\r\nprint(len(x)-len(b))", "horseshoes = [int(a) for a in input().split(' ')]\r\n\r\nn = 0\r\n\r\nfor ai, a in enumerate(horseshoes):\r\n for bi, b in enumerate(horseshoes):\r\n if a == b: break\r\n\r\n if ai == bi:\r\n n += 1\r\n\r\nprint(4 - n)", "n=list(set(input().split(\" \")))\r\nz=len(n)\r\nprint(4-z)", "colors = set(map(int, input().split()))\r\nif len(colors) > 4:\r\n print(0)\r\nelse:\r\n print(4 - len(colors))", "colors = list(map(int, input().split())) \r\n\r\nunique_colors = len(set(colors)) \r\nmin_horseshoes_to_buy = 4 - unique_colors\r\n\r\nprint(min_horseshoes_to_buy) \r\n", "l=list(map(int,input().split()))\r\nprint(4-len(set(l)))", "def new_horshoes(horseshoes):\r\n\treturn(len(horseshoes) - len(set(horseshoes)))\r\n\t\r\nprint(new_horshoes(input().split()))", "s = list(map(int, input().split()))\r\ndistinct_colors = len(set(s))\r\nmin_horseshoes_to_buy = 4 - distinct_colors\r\nprint(min_horseshoes_to_buy)", "a = [int(x) for x in input().split()]\r\nre = 0\r\nt = set()\r\nfor x in a:\r\n t.add(x)\r\nprint(len(a) - len(t))\r\n ", "# https://codeforces.com/problemset/problem/228/A\r\n\r\nprint(4-len(set(list(map(int, input().split(' '))))))", "n = list(map(int,input().split()))\r\njaFoi = []\r\ncout = 0\r\n\r\nfor i in n:\r\n if i in jaFoi:\r\n cout += 1\r\n else:\r\n jaFoi.append(i)\r\n\r\nprint(cout)\r\n", "arr=input()\r\nprint(4-len(set(arr.split(' '))))", "a, b, c, d = map(int, input().split())\r\ns = {a, b, c, d}\r\nprint(4-len(s))", "print(4 - (w:=len(set(list(map(int, input().split()))))))\r\n", "a = list(map(int, input().split()))\r\na.sort() \r\nc = 0\r\nfor i in range(3): \r\n if a[i] == a[i + 1]:\r\n c += 1\r\nprint(c)\r\n", "n = input()\r\nm = n.split()\r\nl = list()\r\ntotal = 0\r\nfor i in m:\r\n if i not in l:\r\n l.append(i)\r\nprint(len(m) - len(l))", "s = list(map(int, input().split()))\r\nln = len(s)\r\ncount = 0\r\nif ln == 4:\r\n i = 0\r\n while i < ln:\r\n p = i+1\r\n while p < ln:\r\n if s[i] == s[p]:\r\n count += 1\r\n break\r\n p += 1\r\n i += 1\r\n print(count)\r\n", "x=input().split()\r\nc=set()\r\nfor i in x:\r\n c.add(i)\r\nprint(4-len(c))", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\na = set(a)\r\nif len(a) == 1:\r\n print(3)\r\nelif len(a) == 2:\r\n print(2)\r\nelif len(a) == 3:\r\n print(1)\r\nelse:\r\n print(0)", "def minimum_horseshoes_to_buy(colors):\r\n distinct_colors = len(set(colors))\r\n return max(0, 4 - distinct_colors)\r\ncolors = list(map(int, input().split()))\r\nresult = minimum_horseshoes_to_buy(colors)\r\nprint(result)\r\n", "# from bisect import bisect_left\r\nfrom collections import Counter\r\n# from functools import lru_cache\r\n\r\n\r\n# n=int(input())\r\n# for _ in range(n):\r\n# num=int(input())\r\narr=[int(i) for i in input().split()]\r\nprint(4-len(set(arr)))\r\n \r\n \r\n ", "uniq = []\r\nhorse = list(map(int, input().split()))\r\nfor x in horse:\r\n if x not in uniq:\r\n uniq.append(x)\r\nbuy = 4 - len(uniq)\r\nprint(buy)", "mp = list(map(int, input().split()))\r\n\r\nst = set(mp)\r\n\r\nprint(len(mp) - len(st))", "s1,s2,s3,s4=map(int,input().split())\r\na=[s1,s2,s3,s4]\r\nA=len(a)\r\nb=set(a)\r\nB=len(b)\r\nprint(A-B)\r\n ", "n = list(map(int, input().split()))\r\nn = set(n)\r\nprint(4-len(n))", "shoes = list(map(int, input().split()))\r\n\r\nresult = 0\r\n\r\n\r\nshoes = set(shoes)\r\n\r\nresult = 4 - len(shoes)\r\n \r\nprint(result)", "a, b, c, d = list(map(int, input().split()))\r\ncol = 0\r\nif a == b:\r\n col+=1\r\nif a == c:\r\n col+=1\r\nif a == d:\r\n col+=1\r\nif b == c and b!=a and a!=c:\r\n col+=1\r\nif b == d and b!=a and a!=d:\r\n col+=1\r\nif c == d and d!=a and d!=b:\r\n col+=1\r\nprint (col)\r\n", "data = set([i for i in input().split()])\r\nprint(4 - len(data))", "lis=list(map(int,input().split()))\r\nl=len(lis)\r\nlis=set(lis)\r\nprint(l-len(lis))", "strInput = input()\r\nstrInput = strInput.split(\" \")\r\nans = len(strInput) - len(set(strInput))\r\nprint(ans)\r\n", "# Input\r\ncolors = list(map(int, input().split()))\r\n \r\n# Find the number of unique colors Valera has\r\nunique_colors = len(set(colors))\r\n \r\n# Calculate the minimum number of horseshoes to buy\r\nminimum_to_buy = 4 - unique_colors\r\n \r\n# Ensure the result is non-negative\r\nminimum_to_buy = max(0, minimum_to_buy)\r\n \r\n# Print the result\r\nprint(minimum_to_buy)", "pod = sorted([int(i) for i in input().split()])\r\n\r\nc = 0\r\nfor x,y in zip(pod, pod[1:]):\r\n if x == y:\r\n c+=1\r\nprint(c)", "colors = list(map(int,input().split()))\r\nunique_colors = len(set(colors))\r\nadditional_horseshoes = 4 - unique_colors\r\nprint(additional_horseshoes)", "a,b,c,d=map(int,input().split())\r\nl=[]\r\nl.append(a)\r\nl.append(b)\r\nl.append(c)\r\nl.append(d)\r\nl=set(l)\r\nprint(4-len(l))", "s1, s2, s3, s4 = map(int, input().split())\r\nshoe = set()\r\nshoe.add(s1)\r\nshoe.add(s2)\r\nshoe.add(s3)\r\nshoe.add(s4)\r\n\r\nif len(shoe) == 3:\r\n print(1)\r\nelif len(shoe) == 2:\r\n print(2)\r\nelif len(shoe) == 1:\r\n print(3)\r\nelif len(shoe) == 4:\r\n print(0)\r\n ", "horseshoes=list(map(int,input().split()))\r\nc=len(set(horseshoes))\r\na=4-c\r\nif a<0:\r\n a=0\r\nprint(a)\r\n", "import collections\nimport math\ndef main():\n # t = int(input())\n # for _ in range(t):\n #n = int(input())\n a = list(map(int,input().split()))\n #a = list(map(int,input().split()))\n #s = input()\n solution(a)\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(a):\n print(4-len(set(a)))\n\n \n \n\n \n \n \n \n\n\nmain()", "l = list(map(int, input().split()))\r\nl.sort()\r\nn = len(l)\r\nans = 0\r\nfor i in range(n-1):\r\n if(l[i]==l[i+1]):\r\n ans += 1\r\n \r\nprint(ans)", "l=input().split()\r\nm=[]\r\nfor i in l:\r\n if(i in m):\r\n d=0\r\n else:\r\n m.append(i)\r\nprint(len(l)-len(m))", "s1, s2, s3, s4 = map(int, input().split())\r\n\r\ncolors = set([s1, s2, s3, s4])\r\n\r\nadditional_horseshoes_needed = 4 - len(colors)\r\n\r\nprint(additional_horseshoes_needed)\r\n", "a=list(map(int,input().split()))\r\ncount=0\r\na.sort()\r\nfor i in range(3):\r\n if a[i]!=a[i+1]:\r\n count=count+1\r\nprint(3-count)\r\n", "colors = list(map(int, input().split()))\r\n\r\nunique_colors = set()\r\ncount_to_buy = 0\r\n\r\nfor color in colors:\r\n if color not in unique_colors:\r\n unique_colors.add(color)\r\n else:\r\n count_to_buy += 1\r\n\r\nprint(count_to_buy)", "valera_horseshoes = input().split()\ndifferent_horseshoes = []\nfor horseshoe in valera_horseshoes:\n if horseshoe not in different_horseshoes:\n different_horseshoes.append(horseshoe)\nprint(4 - len(different_horseshoes))\n", "x = list(map(int,input().split()))\r\nprint(4-len(set(x)))", "\r\nhorseshoes = list(map(int, input().split()))\r\n\r\n\r\ncolor_count = {}\r\nfor color in horseshoes:\r\n if color in color_count:\r\n color_count[color] += 1\r\n else:\r\n color_count[color] = 1\r\n\r\n\r\nadditional_horseshoes_needed = 4 - len(color_count)\r\nprint(max(0, additional_horseshoes_needed))\r\n", "colors = list(map(int, input().split()))\r\n\r\nscolor = set(colors)\r\n\r\nprint(abs(4 - len(scolor)))", "x=list(map(int,input().split()))\r\nz=set(x)\r\nprint(len(x)-len(z))", "a=list(map(int,input().split()))\r\nx=set(a)\r\nprint(4-len(x))\r\n", "a = input().split()\r\nb = len(set(a))\r\ncontador = 0\r\n\r\nwhile b < 4:\r\n b += 1\r\n contador += 1\r\nelse:\r\n None\r\nprint(contador)" ]

[ "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\n# def solve():\r\n# \tpass\r\n\r\n# while 1:\r\n# \tprint(100000)\r\n\r\nn,r = get_int()\r\nc = 0\r\na,b = set(),set()\r\nfor _ in range(r):\r\n\tx,y = get_int()\r\n\ta.add(x);b.add(y)\r\n\tprint((n-len(a))*(n-len(b)))\r\n\r\n", "n,m=map(int,input().split())\r\nxaxis,yaxis=set(),set()\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tcntx,cnty=0,0\r\n\tif(x not in xaxis):\r\n\t\txaxis.add(x)\r\n\tif(y not in yaxis):\r\n\t\tyaxis.add(y)\r\n\tprint(n*n-n*(len(xaxis)+len(yaxis))+len(xaxis)*len(yaxis),end=' ')", "from collections import defaultdict as dc\r\nn,m=[int(x) for x in input().split()]\r\nans=n*n\r\nmpr,mpc=dc(lambda:False),dc(lambda:False)\r\nstR,stC=set(),set()\r\nfor _ in range(m):\r\n x,y=[int(c) for c in input().split()]\r\n if mpr[x]==False:\r\n ans-=(n-len(stC))\r\n stR.add(x)\r\n mpr[x]=True\r\n if mpc[y]==False:\r\n ans-=(n-len(stR))\r\n stC.add(y)\r\n mpc[y]=True\r\n \r\n print(ans,end=' ')", "from collections import deque as d\r\n\r\nn, m = map(int, input().split())\r\n\r\ncol = set()\r\nrow = set()\r\nres = d()\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n col.add(y)\r\n row.add(x)\r\n res.append(str((n-len(col))*(n-len(row))))\r\n\r\nprint(\" \".join(res))\r\n", "n, m = map(int, input().split())\r\n\r\nhor = set()\r\nver = set()\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n hor.add(x)\r\n ver.add(y)\r\n print(max(0, (n - len(hor)) * (n - len(ver))))\r\n\r\n", "n, m = map(int, input().split())\n\nrow = [False] * n\ncolumn = [False] * n\ncontC = 0\ncontR = 0\n\ntot = n * n\nret = []\n\nfor i in range(m):\n r, c = map(int, input().split())\n\n op1 = op2 = False\n\n if(not row[r - 1]):\n row[r - 1] = True\n contR += 1\n op1 = True\n if(not column[c - 1]):\n column[c - 1] = True\n contC += 1\n op2 = True\n \n if(op1):\n tot -= (n - contC)\n if(op2):\n tot -= (n - contR) \n if(op1 and op2):\n tot -= 1\n ret.append(tot)\n\nfor c in range(len(ret)):\n if(c < len(ret) - 1):\n print(ret[c], end=' ')\n else:\n print(ret[c]) \n \t\t\t\t\t\t \t \t\t \t\t \t\t\t \t\t \t", "import math\r\nn,m=map(int,input().split())\r\nx=set([])\r\ny=set([])\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n x.add(a)\r\n y.add(b)\r\n union=n*len(x)+n*len(y)-(len(x)*len(y))\r\n print(n**2-union,end=\" \")\r\n\r\n", "n,m=map(int,input().split())\r\ns1=set()\r\ns2=set()\r\nfor i in range(m):\r\n\ta,b=map(int,input().split())\r\n\ts1.add(a)\r\n\ts2.add(b)\r\n\tprint((n-len(s1))*(n-len(s2)), end = \" \")", "n, m = tuple(map(int, input().split()))\r\n\r\nx = set()\r\ny = set()\r\nres = []\r\nfor i in range(m):\r\n a,b = tuple(map(int, input().split()))\r\n x.add(a)\r\n y.add(b)\r\n res.append(n**2-(n*len(x) + n*len(y)-len(x)*len(y)))\r\nprint (*res)", "n, m = map(int,input().split())\ndangerl= [0] * (n + 1)\ndangerc = [0] * (n + 1)\nsafel = n\nsafec = n\nout = []\n\nfor e in range(m):\n l, c = map(int,input().split())\n if(dangerl[l] == 0):\n dangerl[l] = 1\n safel -= 1\n if(dangerc[c] == 0):\n dangerc[c] = 1\n safec -= 1\n out.append(safel * safec)\n\nfor i in out:\n print(i, end=' ')\n \t \t\t\t\t \t \t\t \t \t \t\t \t\t", "n, m = map(int, input().split())\nrow = dict()\ncol = dict()\nans = []\nfor i in range(m):\n x, y = map(int, input().split())\n row[x] = row.get(x, 0) + 1\n col[y] = col.get(y, 0) + 1\n a = len(row)\n b = len(col)\n ans.append((n * n) - ((n * a) + (n * b) - (a * b)))\nprint(\" \".join(map(str, ans)))", "n, m = map(int, input().strip().split())\nx = set()\ny = set()\nans = []\nfor i in range(m):\n\txi, yi = map(int, input().strip().split())\n\tx.add(xi)\n\ty.add(yi)\n\tattacked = len(x)*n + len(y)*n - len(x)*len(y)\n\tnot_attacked = n*n-attacked\n\tans.append(not_attacked)\nprint(*ans)\n", "n, m = str(input()).split()\n\nc = int(n) * int(n)\nl = [0] * int(n)\ncol = [0] * int(n)\nr = \"\"\np = 0\nnl = 0\nncol = 0\n\nconhe = 0\nfor i in range(int(m)):\n x, y = str(input()).split()\n x = int(x)-1\n y = int(y)-1\n\n if col[x] == 0:\n col[x] = 1\n ncol += 1\n conhe += nl\n p += int(n)\n\n if l[y] == 0:\n l[y] = 1\n nl += 1\n conhe += ncol\n p += int(n)\n\n r += str(c - p + conhe) + \" \"\nprint(r)\n \t \t\t \t\t\t \t \t \t \t\t \t \t \t \t\t", "\r\nn,m=map(int,input().split())\r\narr1=[0] * n\r\narr2=[0] * n\r\nsz1=n\r\nsz2=n\r\n#print(arr1)\r\nl=[]\r\nfor _ in range(m):\r\n x,y=map(int,input().split());\r\n if(arr1[x-1]==0):\r\n arr1[x-1]=1\r\n sz1-=1\r\n if(arr2[y-1]==0):\r\n arr2[y-1]=1\r\n sz2-=1\r\n l.append(sz1*sz2)\r\nprint(*l,sep=' ')\r\n\r\n", "n,m = map(int,input().split())\r\ndx = set({})\r\ndy = set({})\r\nt1 = 0\r\nfor i in range(m):\r\n\tx,y = map(int,input().split())\r\n\tdx.add(x)\r\n\tdy.add(y)\r\n\t# print(dx,dy)\r\n\r\n\tt1 = max(0,n-len(dx))*max(0,n-len(dy))\r\n\r\n\tprint(t1,end=\" \")\r\n", "n, m = [int(x) for x in input().split()]\n\ncont = n * n\nresp = []\n\ncolunas_usadas = set([])\nlinhas_usadas = set([])\n\nfor e in range(m):\n x, y = [int(a) for a in input().split()]\n\n if x not in linhas_usadas:\n cont -= (n - len(colunas_usadas))\n linhas_usadas.add(x)\n\n if y not in colunas_usadas:\n cont -= (n - len(linhas_usadas))\n colunas_usadas.add(y)\n\n resp.append(str(cont))\nprint(\" \".join(resp))\n\t\t \t\t \t \t \t \t \t \t \t \t", "n, m = [int(x) for x in input().split()]\nr = []\nc = []\nfor i in range (n + 1):\n r.append(0)\n c.append(0)\nres = []\nrows = 0\ncols = 0\nboard = n * n\nfor i in range (m):\n row, col = [int(x) for x in input().split()]\n if r[row] == 0:\n r[row] = 1\n rows += 1\n board -= (n - cols)\n if c[col] == 0:\n c[col] = 1\n cols += 1\n board -= (n - rows)\n res.append(board)\nfor r in res:\n print(r, end=' ')\n \t\t\t \t\t \t \t\t \t\t \t\t \t \t\t\t", "from math import gcd\r\nfrom collections import Counter\r\nn,m=map(int,input().split())\r\nsx=set()\r\nsy=set()\r\nans=[]\r\nfor _ in range(m):\r\n x,y=(map(int,input().split()))\r\n sx.add(x)\r\n sy.add(y)\r\n res=(n-len(sx))*(n-len(sy))\r\n ans.append(res)\r\nprint(*ans)", "\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\ng=set()\r\nv= set()\r\nfor k in range(m):\r\n a,b = map(int,input().split())\r\n g.add(a)\r\n v.add(b)\r\n\r\n \r\n print((n-len(g))*(n-len(v)),end=' ' )\r\n \r\n\r\n\r\n \r\n", "import sys,os\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\nfrom collections import defaultdict\r\n\r\nn,m=map(int,input().split())\r\nrow,column=defaultdict(int),defaultdict(int)\r\nans,r1,c1=n*n,n,n\r\nfor i in range(m):\r\n r,c=map(int,input().split())\r\n if row[r]==0:\r\n ans-=c1\r\n r1-=1\r\n row[r]+=1\r\n\r\n if column[c]==0:\r\n ans-=r1\r\n c1-=1\r\n column[c]+=1\r\n\r\n print(ans,end=\" \") ", "n, m = map(int, input().split())\n\nlista_x = set()\nlista_y = set()\nfor torre in range(m):\n\tx, y = map(int, input().split())\n\tlista_x.add(x)\n\tlista_y.add(y)\n\tcelulas = (n - len(lista_x)) * (n - len(lista_y))\n\tprint(celulas)\n\n\t\t \t \t \t \t\t \t \t\t\t\t \t\t\t \t\t\t", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nrows = {}\r\ncols = {}\r\n\r\nres = n ** 2\r\nresult = []\r\nfor i in range(m):\r\n row, col = map(int, input().split())\r\n rows[row] = 1\r\n cols[col] = 1\r\n res = len(rows) * n + len(cols) * n - len(rows) * len(cols)\r\n result.append(n ** 2 - res)\r\n\r\nfor res in result:\r\n print(res, end=\" \")\r\n", "n,m=list(map(int,input().split(\" \")))\r\nrow=set()\r\ncol=set()\r\nrowcount=0\r\ncolcount=0\r\nfor x in range(m):\r\n temp=list(map(int,input().split(\" \")))\r\n row.add(temp[0])\r\n col.add(temp[1])\r\n print(n*n-(len(row)*n+len(col)*n-(len(row)*len(col))),end=\" \")\r\n #number of occupied boxes=rowcount*n+colcount*n-rowcount*colcount\r\n #so we get empty boxes if we subtract it from n^2", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\na, b = [0] * (n + 1), [0] * (n + 1)\r\nu, v = n, n\r\nans = []\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if not a[x]:\r\n u -= 1\r\n if not b[y]:\r\n v -= 1\r\n a[x], b[y] = 1, 1\r\n ans0 = u * v\r\n ans.append(ans0)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n,m=map(int,input().split())\r\nans=\"\"; col=set(); row=set()\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n row.add(x); col.add(y)\r\n cnt=len(row)*n+len(col)*n-len(col)*len(row)\r\n ans+=f\"{n*n-cnt} \"\r\nprint(ans)", "from collections import *\r\ndx = defaultdict(int)\r\ndy = defaultdict(int)\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n dx[x]=dy[y]=1\r\n print((n-len(dx))*(n-len(dy)),end=\" \")", "n, m = map(int, input().split())\narea = n * n\nX = set()\nY = set()\nfor _ in range(m):\n x, y = map(int, input().split())\n X.add(x)\n Y.add(y)\n print(area - (len(X)*n + len(Y)*n - len(Y)*len(X)))\n\n \n\n\t\t \t\t\t\t \t \t \t \t\t\t\t \t", "def ans(r,c,n):\r\n return (n*n)-(r+c)*n+(r*c)\r\n\r\nn,m=map(int,input().split())\r\nrow=[0 for i in range(100001)]\r\nr=0\r\ncol=[0 for i in range(100001)]\r\nc=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if(row[a]==0):\r\n row[a]=1\r\n r+=1\r\n if(col[b]==0):\r\n col[b]=1\r\n c+=1\r\n print(ans(r,c,n),end=\" \")", "ix={}\niy={}\n\na,l=map(int,input().split())\n\nfor i in range(l):\n x,y=map(int,input().split())\n ix[x]=1\n iy[y]=1\n print((a-len(ix))*(a-len(iy)),end=\" \")\n\t\t \t\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, m = iia()\r\nrows = set()\r\ncol = set()\r\nans = []\r\nfor _ in range(m):\r\n a, b = iia()\r\n rows.add(a)\r\n col.add(b)\r\n ans.append((n - len(rows)) * (n - len(col)))\r\nprint(*ans)\r\n\r\n", "n,m=map(int,input().split())\r\ncol=set();row=set()\r\nold=n*n;coll=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n row.add(a);col.add(b)\r\n print((n-len(row))*(n-len(col)),end=\" \")\r\n", "I = lambda : map(int, input().split())\n\nn, m = I()\nresult = []\ncolumns = set()\nrows = set()\n\nfor i in range(m):\n l, c = I()\n rows.add(l)\n columns.add(c)\n result.append((n - len(columns)) * (n - len(rows)))\n\nprint(*result[::])\n\t \t \t \t \t\t\t \t\t\t\t \t\t\t\t\t\t\t\t \t\t", "n, m = [int(i) for i in input().split()]\ncells = n**2\nxs = set()\nys = set()\n\n\nfor i in range(m):\n x, y = [int(i) for i in input().split()]\n xs.add(x)\n ys.add(y)\n \n count = len(xs) * n + len(ys) * n - len(xs) * len(ys)\n print(cells - count)", "\r\nn, m = map(int, input().split())\r\n\r\nset_x = set()\r\nset_y = set()\r\n\r\nfor i in range(m):\r\n x, y = input().split()\r\n set_x.add(x)\r\n set_y.add(y)\r\n a_y = len(set_y)\r\n a_x = len(set_x)\r\n count = a_y * n + a_x * n - a_x * a_y\r\n print(n * n - count, end=' ')\r\n\r\n", "n,m = map(int, input().split())\nall_x = set()\nall_y = set()\nans = []\nfor i in range(m):\n x,y = map(int, input().split())\n all_x.add(x)\n all_y.add(y)\n ans.append((n - len(all_x)) * (n - len(all_y)))\nprint(*ans)\n", "n, m = map(int, input().split())\r\nres = []\r\nv = [0]*(10**5 + 1)\r\nk1 = k2 = 0\r\nh = [0]*(10**5 + 1)\r\nans = n * n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if not v[x] or not h[y]:\r\n if v[x]:\r\n ans -= n - k1\r\n elif h[y]:\r\n ans -= n - k2\r\n else:\r\n ans -= 2*n-k1-k2-1\r\n if not v[x]:\r\n v[x] = 1\r\n k1 += 1\r\n if not h[y]:\r\n h[y] = 1\r\n k2 += 1\r\n res += [ans]\r\nprint(*res, sep='\\n')", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(m):\r\n g=list(map(int,input().split()))\r\n a.append(g)\r\nans=[]\r\nr=[0]*(n+1)\r\nc=[0]*(n+1)\r\nrow=n\r\ncol=n\r\nfor i in range(m):\r\n if r[a[i][0]]==0:\r\n row-=1\r\n r[a[i][0]]+=1\r\n if c[a[i][1]]==0:\r\n col-=1\r\n c[a[i][1]]+=1\r\n ans.append(row*col)\r\nfor i in range(m):\r\n print(ans[i],end=\" \")\r\n\r\n", "n, m = list(map(int, input().split(\" \")))\n\ncells_left = n**2\n\nx = set()\ny = set()\n\nresult = []\n\nfor _ in range(m):\n\ti, j = list(map(int, input().split(\" \")))\n\tx.add(i)\n\ty.add(j)\n\n\tresult.append(str((n-len(x)) * (n-len(y))))\n\nprint(\" \".join(result))\n\n \t\t \t\t\t\t\t\t\t\t \t \t \t\t\t \t\t\t \t", "a , b = map(int,input().split())\nxes = set()\nyes = set()\nfor x in range(b):\n c,d = map(int,input().split())\n xes.add(c)\n yes.add(d)\n print((a-len(xes))*(a-len(yes)), end = \" \")", "a=input().split()\na1=int(a[0])\na2=int(a[1])\nli1=set()\nli2=set()\nout=\"\"\nfor i in range (a2):\n b=input().split()\n li1.add(b[0])\n li2.add(b[1])\n rest=((a1)-len(li1))*((a1)-len(li2))\n out+=str(rest)+\" \"\nprint(out)\n \t\t\t \t \t \t\t \t\t \t\t \t \t \t", "n,m=map(int,input().split())\r\na,b=[0 for i in range(100001)],[0 for j in range(100001)]\r\nr,c=n,n\r\nl=[]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if(a[x]==0 and b[y]==0):\r\n r-=1\r\n c-=1\r\n a[x],b[y]=1,1\r\n elif(a[x]==0 and b[y]==1):\r\n r-=1\r\n a[x]=1\r\n elif(a[x]==1 and b[y]==0):\r\n c-=1\r\n b[y]=1\r\n l.append(r*c)\r\nprint(*l)\r\n", "cnt = lambda s, x: s.count(x)\r\nii = lambda: int(input())\r\nsi = lambda: input()\r\nf = lambda: map(int, input().split())\r\ndgl = lambda: list(map(int, input()))\r\nil = lambda: list(map(int, input().split()))\r\nn,k=f()\r\na,b=set(),set()\r\nfor i in range(k):\r\n x, y=f()\r\n a.add(x)\r\n b.add(y)\r\n print((n-len(a))*(n-len(b)),end=' ')", "n, m = input().split(\" \")\r\nn, m = int(n), int(m)\r\nsquares = n ** 2\r\nrows, cols = set(), set()\r\nans = []\r\nunder_attack = 0\r\nfor i in range(m):\r\n r, c = input().split(\" \")\r\n r, c = int(r), int(c)\r\n \r\n if r not in rows:\r\n under_attack += n - len(cols)\r\n rows.add(r)\r\n if c not in cols:\r\n under_attack += n - len(rows)\r\n cols.add(c)\r\n ans.append(str(squares-under_attack))\r\nprint(\" \".join(ans))", "from sys import *\r\ninput = lambda:stdin.readline()\r\n \r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n \r\n \r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n \r\nn,m = get_int()\r\ntot = n * n\r\nsum_ = n + n - 1\r\nsetx,sety = set(),set()\r\nfor i in range(m):\r\n x,y = get_int()\r\n setx.add(x)\r\n sety.add(y)\r\n x1,y1 = len(setx),len(sety)\r\n attack = (x1 * n + y1 * n) - (x1 * y1)\r\n print(tot - attack,end = ' ')\r\n\r\n", "\r\n# link : https://codeforces.com/problemset/problem/701/B\r\n# author : Mohamed Ibrahim\r\n\r\n\r\n\r\nn , m = map(int,input().split())\r\nr = set()\r\nc = set()\r\nfor _ in range(m):\r\n R,C = map(int,input().split())\r\n r.add(R)\r\n c.add(C)\r\n print( (n - len(r)) * (n - len(c)))\r\n \r\n \r\n \r\n ", "n,m=map(int,input().split())\r\nrl=[0]*(n+1)\r\ncl=[0]*(n+1)\r\nrv=n \r\ncv=n\r\nfor _ in range(m):\r\n r,c=map(int,input().split())\r\n if rl[r]==0:\r\n if rv>0:\r\n rv-=1 \r\n rl[r]=1 \r\n if cl[c]==0:\r\n if cv>0:\r\n cv-=1\r\n cl[c]=1\r\n print(rv*cv,end=\" \")", "n, m = map(int, input().split())\r\na = set()\r\nb = set()\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n a.add(x)\r\n b.add(y)\r\n print((n-len(a)) * (n-len(b)))", "n, m = map(int,input().split())\nrow_set = set()\ncolumn_set = set()\nresult = \"\"\ntotal = n*n\nfor i in range(1,m+1):\n x,y = map(int,input().split())\n column_set.add(x)\n row_set.add(y)\n delta = 1\n attacked = len(column_set)*n + len(row_set)*n - len(column_set)*len(row_set)\n result+=str(total-attacked)+\" \"\n \nprint(result)\n\t \t \t\t\t \t\t \t \t\t \t \t \t", "xy, m = map(int, input().split())\n \nrows = [False] * xy\ncolumns = [False] * xy\n\nr, c = 0, 0\n\nanswear = \"\"\n\ncells = xy ** 2\n\nspace = False\n\nfor i in range(m):\n x,y = map(int,input().split()) \n\n if(space):\n answear += \" \"\n space = True\n\n if(rows[x-1] == 0):\n rows[x-1] = 1\n cells -= (xy - c)\n r+=1\n if(columns[y-1] == 0):\n columns[y-1] = 1\n cells -=(xy-r)\n c += 1\n\n answear += str(cells)\n\nprint (answear) \n\n\t \t \t\t\t \t\t\t\t \t\t \t\t \t\t\t\t \t \t\t\t", "###input\r\nsize,total_rooks = [int(x) for x in input().split()]\r\nactual_rooks = 0\r\n\r\n###sets\r\nlinha = {}\r\ncoluna = {}\r\nlinha = set(linha)\r\ncoluna = set(coluna)\r\n\r\n\r\nwhile total_rooks:\r\n x,y = [int(x) for x in input().split()]\r\n\r\n linha.add(x)\r\n coluna.add(y)\r\n \r\n # Quantos espaços vão sobrar?\r\n # n - len(linha) = espaços restantes por linha\r\n # vezes\r\n # n- len(coluna) = espaços restantes por coluna\r\n # =\r\n # total de espaços restantes\r\n print((size-len(linha))*(size-len(coluna)),end=\" \")\r\n\r\n total_rooks -=1", "n = list(map(int, input().split()))\nset_line = set()\nset_column = set()\nres = []\n \nfor a in range(n[1]):\n places = list(map(int, input().split()))\n \n set_line.add(places[0])\n set_column.add(places[1])\n ans = ((n[0] - len(set_line)) * (n[0] - len(set_column)))\n res.append(ans)\n \nprint(*res)\n \t\t\t\t\t \t \t\t \t \t\t \t \t", "def funcao(lista, n):\n livres = n * n\n linE = set()\n colE = set()\n res = []\n\n for torre in lista:\n if (torre[0] in linE) and (torre[1] not in colE):\n livres = livres - (n - len(linE))\n colE.add(torre[1])\n elif (torre[0] not in linE) and (torre[1] in colE):\n livres = livres - (n - len(colE))\n linE.add(torre[0])\n elif (torre[0] not in linE) and (torre[1] not in colE):\n livres = livres - (n - len(colE)) - (n - len(linE)) + 1\n colE.add(torre[1])\n linE.add(torre[0])\n else:\n pass\n\n res.append(str(livres))\n\n return res\n\nentrada = input().split()\nn = int(entrada[0])\nm = int(entrada[1])\nlista = []\n\ni = 0\nwhile i < m:\n lista.append(list(map(int, input().split())))\n i += 1\n\nprint(\" \".join(funcao(lista, n)))\n \t \t \t \t \t \t\t\t \t \t \t\t\t", "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,m = M()\r\nseencol = set()\r\nseenrow = set()\r\nsiz = n*n\r\nfor i in range(m):\r\n x,y = M()\r\n seenrow.add(x)\r\n seencol.add(y)\r\n print(siz - len(seenrow)*n - len(seencol)*n + len(seenrow)*len(seencol), end=\" \")\r\n\r\nprint()\r\n ", "n, m = input().split()\nn = int(n)\nm = int(m)\n\nrows = set()\nfor i in range(1,n+1):\n\trows.add(i)\n\ncolumns = set()\nfor i in range(1,n+1):\n\tcolumns.add(i)\n\nanswer = []\n\nfor i in range(m):\n\tr, c = input().split()\n\tr = int(r)\n\tc = int(c)\n\t\n\tif r in rows:\n\t\trows.remove(r)\n\tif c in columns:\n\t\tcolumns.remove(c)\n\t\t\n\tanswer.append(len(rows)*len(columns))\n\t\nfor j in range(m):\n\tif j == m-1:\n\t\tprint(answer[j])\n\telse:\n\t\tprint(answer[j], end = ' ')\n\t\n\n \t \t\t \t\t \t\t\t \t \t \t \t", "def get_line():\n return list(map(int, input().split()))\n\nn, m = get_line()\ntotal = n**2\nrows = set()\ncols = set()\nans = []\n\nfor _ in range(m):\n r, c = get_line()\n rows.add(r)\n cols.add(c)\n n_rows = len(rows)\n remain = total - (n * n_rows) - ((n - n_rows) * len(cols))\n ans.append(str(remain))\n\nprint(' '.join(ans))", "n, m = map(int, input().split())\r\ns1 = set();s2 = set()\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n s1.add(x);s2.add(y)\r\n print(n*n-n*len(s1)-n*len(s2)+len(s1)*len(s2), end=\" \")\r\n", "n,m=(int(i) for i in input().split())\r\nr={}\r\nc={}\r\ns=n*n\r\nx,y=(int(i) for i in input().split())\r\nr[x]=1\r\nc[y]=1\r\ns1=1\r\ns2=1\r\ns-=(2*n-1)\r\nl=[s]\r\nfor i in range(m-1):\r\n x,y=(int(i) for i in input().split())\r\n if(x not in r):\r\n r[x]=1\r\n s-=n-s2\r\n s1+=1\r\n if(y not in c):\r\n c[y]=1\r\n s-=n-s1\r\n s2+=1\r\n l.append(s)\r\nprint(*l)", "n, m = map(int, input().split())\r\nsafe = n * n\r\nans = []\r\nrows = set()\r\ncols = set()\r\n \r\nwhile m:\r\n m -= 1\r\n x, y = map(int, input().split())\r\n \r\n if x not in rows and y not in cols:\r\n safe -= (n + n - len(rows) - len(cols) - 1)\r\n rows.add(x)\r\n cols.add(y)\r\n \r\n if x in rows and y not in cols:\r\n safe -= (n - len(rows))\r\n cols.add(y)\r\n \r\n if x not in rows and y in cols:\r\n safe -= (n - len(cols))\r\n rows.add(x)\r\n \r\n ans.append(safe)\r\n \r\nprint(\" \".join([str(a) for a in ans]))", "n, m = map(int, input().split())\n\nrows, columns = set(), set()\nresp = \"\"\nfor i in range(m):\n num = n ** 2\n row, column = map(int, input().split())\n\n rows.add(row)\n columns.add(column)\n\n pre = (len(rows) * n) + (len(columns) * n)\n rep = len(rows) * len(columns)\n\n resp += str(num - (pre - rep)) + \" \"\nprint(resp)\n \t \t\t\t\t \t \t\t \t \t\t \t\t \t", "a,b=map(int,input().split())\r\nz_row=[0]*(a+1)\r\nz_col=[0]*(a+1)\r\nz_row1=0\r\nz_col1=0\r\ns=a*a\r\nfor _ in \" \"*b:\r\n k=0\r\n x,y=map(int,input().split())\r\n if z_row[x]==0:\r\n s-=(a-z_col1)\r\n k=-1\r\n if z_col[y]==0:\r\n s-=(k+a-z_row1)\r\n if z_row[x]==0:z_row1+=1\r\n if z_col[y]==0:z_col1+=1\r\n z_row[x]=1\r\n z_col[y]=1\r\n print(s)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nrows = set()\r\nfor i in range(1,n+1):\r\n\trows.add(i)\r\n\r\ncolumns = set()\r\nfor i in range(1,n+1):\r\n\tcolumns.add(i)\r\n\r\nanswer = []\r\n\r\nfor i in range(m):\r\n\tr, c = input().split()\r\n\tr = int(r)\r\n\tc = int(c)\r\n\t\r\n\tif r in rows:\r\n\t\trows.remove(r)\r\n\tif c in columns:\r\n\t\tcolumns.remove(c)\r\n\t\t\r\n\tanswer.append(len(rows)*len(columns))\r\n\t\r\nfor j in range(m):\r\n\tif j == m-1:\r\n\t\tprint(answer[j])\r\n\telse:\r\n\t\tprint(answer[j], end = ' ')\r\n\t\r\n", "n,m=map(int,input().split())\r\ncells=n*n\r\nsetx=set()\r\nsety=set()\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tsetx.add(x)\r\n\tsety.add(y)\r\n\tprint((n-len(setx))*(n-len(sety)),end=\" \")\r\n\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 13 11:14:26 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m = map(int, input().split())\r\n\r\nx = set();y = set()\r\nl = []\r\nfor i in range(m):\r\n a,b = map(int, input().split())\r\n l.append((a,b)) \r\n\r\nfor i in range(m):\r\n a,b = l[i]\r\n x.add(a);y.add(b)\r\n ans = (n-len(x))*(n-len(y))\r\n print(ans, end= ' ')", "ans = []\n\nb_size, iter = map(int, input().split())\n\narrx = set()\narry = set()\n\nfor _ in range(iter):\n in_x, in_y = map(int, input().split())\n arrx.add(in_x)\n arry.add(in_y)\n\n x_rem = b_size - len(arrx)\n y_rem = b_size - len(arry)\n\n ans.append(x_rem * y_rem)\n\nprint(\" \".join(map(str, ans)))\n \t \t\t\t \t\t\t\t\t \t \t\t\t \t\t \t \t \t", "inp = list(map(int, input().split()))\nn = inp[0]\nm = inp[1]\n\nboard_drow = n\nboard_dcol = n\nboard_d = n*n\nvisited_row = [0]*(n+1)\nvisited_col = [0]*(n+1)\nfinal = []\nfor i in range(m):\n r_c = input().split()\n row = int(r_c[0])\n col = int(r_c[1])\n \n if(visited_row[row] == 0 and visited_col[col] == 0):\n board_drow -= 1\n board_dcol -= 1\n elif(visited_row[row] == 1 and visited_col[col] == 0):\n board_dcol -= 1\n elif(visited_row[row] == 0 and visited_col[col] == 1):\n board_drow -= 1\n \n \n board_d = board_dcol * board_drow\n final.append(board_d)\n\n visited_row[row] = 1\n visited_col[col] = 1\n\nprint(' '.join(map(str, final)))\n \n\t \t\t\t \t \t \t \t\t\t \t\t \t \t \t\t", "# cf 701 B 1200\nn, m = map(int, input().split())\nZ = []\nnua = n * n # not under attack\nxseen, yseen = set(), set()\nfor _ in range(m):\n x, y = map(int, input().split())\n if x not in xseen:\n nua -= (n - len(yseen))\n xseen.add(x)\n if y not in yseen:\n nua -= (n - len(xseen))\n yseen.add(y)\n Z.append(nua)\nprint(\" \".join(map(str, Z)))\n\n \n \n \n", "tam_tab, quant_torres = [int(n) for n in input().split()]\n\ncasas_livres = tam_tab ** 2\nset_linhas = set()\nset_colunas = set()\noutput = ''\nfor c in range(quant_torres):\n linha, coluna = input().split()\n if linha not in set_linhas:\n set_linhas.add(linha)\n casas_livres -= tam_tab - len(set_colunas)\n\n if coluna not in set_colunas:\n set_colunas.add(coluna)\n casas_livres -= tam_tab - len(set_linhas)\n \n output += str(casas_livres)\n output += ' '\n \nprint(output)\n\n \t \t \t\t\t \t\t\t\t\t\t\t \t \t \t \t\t", "n, nRooks = [int(x) for x in input().split()]\n\nrooks = [[int(x) for x in input().split()] for _ in range(nRooks)]\n\nxSet = set()\nySet = set()\n\nnSafe = []\n\nfor i in range(nRooks):\n xSet.add(rooks[i][0])\n ySet.add(rooks[i][1])\n\n freeCols = n - len(xSet)\n freeRows = n - len(ySet)\n\n nSafe.append(freeCols * freeRows)\n\nfor i in range(nRooks):\n print(nSafe[i], end=' ')\n\t \t\t \t\t\t \t\t\t\t\t \t\t \t", "n, m = map(int, input().split())\r\nrow_set = set()\r\ncol_set = set()\r\n\r\n\r\nfor i in range(m):\r\n r, c = map(int, input().split())\r\n\r\n # Check if the row and column are not already occupied by other rooks\r\n \r\n row_set.add(r)\r\n col_set.add(c)\r\n v = len(row_set)\r\n h = len(col_set)\r\n \r\n \r\n print(n**2 -(n*(v+h) - v*h), end=\" \")", "n,m= list(map(int,input().split()))\r\nr=set([])\r\nc=set([])\r\ns=\"\"\r\nfor i in range(m):\r\n x,y=list(map(int,input().split()))\r\n r.add(y)\r\n c.add(x)\r\n t=n**2-(len(r)*n+len(c)*(n-len(r)))\r\n s+=str(t)+\" \"\r\n\r\nprint(s[:-1])\r\n\r\n\r\n\r\n", "ax,ay=map(int,input().split())\n \na=set()\n \nb=set()\n \nfor i in range(ay):\n \n\tc,d=map(int,input().split())\n \n\ta.add(c)\n \n\tb.add(d)\n \n\tprint((ax-len(a))*(ax-len(b)), end = \" \")\n\n\t \t \t\t\t\t \t \t\t\t \t\t \t\t\t\t \t", "n, m = input().split(\" \")\nn = int(n)\nm = int(m)\n\nrock = []\nwhile m > 0:\n rock.append(list(map(int, input().split())))\n m -= 1\nrow = [1]*n\ncol = [1]*n\np, q = n, n\nfor pair in rock:\n i, j = pair\n if row[i-1] != 0:\n p -= 1\n if col[j-1] != 0:\n q -= 1\n row[i-1] = 0\n col[j-1] = 0\n print(p*q, end=\" \")\nprint()", "tabuleiro = [{}, {}]\nn, m = map(int, input().split())\ntotais = n * n\nfor i in range(m):\n x, y = map(int, input().split())\n tabuleiro[0][x] = 'x'\n tabuleiro[1][y] = 'x'\n print(totais - (len(tabuleiro[0]) + len(tabuleiro[1])) * n + len(tabuleiro[0]) * len(tabuleiro[1]))\n", "n = list(map(int, input().split()))\nset_l = set()\nset_c = set()\nres = []\n\nfor a in range(n[1]):\n places = list(map(int, input().split()))\n\n set_l.add(places[0])\n set_c.add(places[1])\n ans = ((n[0] - len(set_l)) * (n[0] - len(set_c)))\n res.append(ans)\n\nprint(*res)\n\t\t \t\t \t \t\t\t \t \t\t\t\t\t\t\t\t\t\t\t\t \t\t", "RowSet, ColSet, X = set(), set(), list(map(int, input().split()))\r\nfor _ in range(X[1]):\r\n Temp = list(map(int, input().split()))\r\n RowSet.add(Temp[0])\r\n ColSet.add((Temp[1]))\r\n print((X[0] - len(ColSet)) * (X[0] - len(RowSet)), end=' ')\r\n\r\n# Show you deserve being the best to whom doesn't believe in you.\r\n# Location: WTF is this JAVA project. Data Mining with JAVA?\r\n# Like participating with Pride in car races\r\n", "import sys\r\n\r\nn,m=map(int,input().split())\r\narr=[list(map(int,input().split())) for i in range(m)]\r\n\r\nrow={}\r\ncol={}\r\n\r\nfor i in range(1,n+1):\r\n row[i]=0\r\n col[i]=0\r\n\r\nr=n;c=n\r\nfor i in range(m):\r\n if row.get(arr[i][0])==0:\r\n row[arr[i][0]]=1\r\n r-=1\r\n\r\n if col.get(arr[i][1])==0:\r\n col[arr[i][1]]=1\r\n c-=1\r\n\r\n k=(r*c)\r\n sys.stdout.write(str(k)+\" \")\r\n", "n, m = map(int, input().split())\nstolb = set()\nstrok = set()\nfor i in range(m):\n x, y = map(int, input().split())\n stolb.add(x)\n strok.add(y)\n print(n * n - n * len(strok) - n * len(stolb) + len(strok) * len(stolb), end=' ')", "import sys\r\ninput = sys.stdin.readline\r\n \r\nrow = set()\r\ncolumn = set()\r\nn, m = map(int, input().split())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n row.add(x)\r\n column.add(y)\r\n print((n-len(row))*(n-len(column)))", "n, m = map(int, input().split())\r\nrow = set()\r\ncol = set()\r\nfor _ in range(1, m + 1):\r\n x, y = map(int, input().split())\r\n row.add(x)\r\n col.add(y)\r\n print((n - len(row)) * (n - len(col)), end=\" \")\r\n", "n, m = map(int, input().split())\nrows = set()\ncols = set()\nfor i in range(m):\n x, y = map(int, input().split())\n rows.add(x)\n cols.add(y)\n attacked = n * len(rows) + n * len(cols) - (len(rows) * len(cols))\n print(n**2 - attacked, end=\" \")\n\n \t \t \t\t\t\t\t \t \t \t \t \t", "n,m = map(int, input().split())\r\nrowdone =[0 for i in range(n+1)]\r\nr, c= 0,0\r\ncoldone =[0 for i in range(n+1)]\r\nans = n*n\r\nfor i in range(m):\r\n x,y= map(int, input().split())\r\n if rowdone[x] == 0 :\r\n ans -= (n-c)\r\n r+=1\r\n rowdone[x] = 1\r\n if coldone[y] == 0:\r\n ans -= (n-r)\r\n c += 1\r\n coldone[y] = 1\r\n print(ans , end =' ') \r\n\r\n\r\n\r\n\r\n\r\n", "size, rook = map(int, input().split())\nrows = []\ncols = []\nrowCount = 0\ncolCount = 0\nattacks = []\n\nfor i in range(size):\n rows.append(0)\n cols.append(0)\n\nfor i in range(rook):\n x, y = map(int, input().split())\n x, y = x-1, y-1\n if(rows[x] == 0):\n rowCount += 1\n if(cols[y] == 0):\n colCount += 1\n rows[x] += 1\n cols[y] += 1\n\n attacks.append((size - rowCount) * (size - colCount))\n\nprint(*attacks)\n \t\t\t\t \t \t \t \t \t\t\t \t\t", "n, m = map(int, input().split())\n\nlist_a_x = set()\nlist_a_y = set()\n\nfor torre in range(m):\n x, y = map(int, input().split())\n list_a_x.add(x)\n list_a_y.add(y)\n c = (n - len(list_a_x)) * (n - len(list_a_y))\n print(c)\n \t\t\t\t\t \t \t \t", "from sys import stdin; read = lambda : stdin.readline()\r\n\r\nn, m = map(int, read().split())\r\nrow = set([]); column = set([])\r\nans = n**2\r\nfor i in range(m):\r\n x, y = map(int, read().split())\r\n if x not in row and y not in column: \r\n ans -= (2*n - 1 - len(row)-len(column)) \r\n row.add(x); column.add(y)\r\n\r\n elif x not in row: \r\n ans -= (n - 1 - len(column)+1) \r\n row.add(x); column.add(y)\r\n elif y not in column:\r\n ans -= (n - 1 - len(row)+1) \r\n row.add(x); column.add(y)\r\n \r\n print(ans)", "n,m=map(int,input().split())\nx,y,s=set(),set(),''\nfor i in range(m):\n a,b=map(int,input().split())\n x.add(a); y.add(b);\n s+=str((n-len(x))*(n-len(y)))+' '\nprint(s)\n\t\t\t \t \t\t\t \t \t \t \t\t \t \t\t", "n, m = map(int, input().split())\r\ndx = {}\r\ndy = {}\r\nnx = ny = n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if not dx.get(x):\r\n dx[x] = 1\r\n nx -= 1\r\n if not dy.get(y):\r\n dy[y] = 1\r\n ny -= 1\r\n print(nx*ny, end = \" \")\r\n \r\n \r\n", "from heapq import *\n# from collections import deque\n\n\ndef lets_do_it():\n n, m = [int(a) for a in input().split(' ')]\n traversed_rows, traversed_cols = set(), set()\n unattacked_cells = n * n\n\n for _ in range(m):\n row, col = [int(a) for a in input().split(' ')]\n if row not in traversed_rows:\n unattacked_cells -= n - len(traversed_cols)\n traversed_rows.add(row)\n if col not in traversed_cols:\n unattacked_cells -= n - len(traversed_rows)\n traversed_cols.add(col)\n print(unattacked_cells, end=\" \")\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", "from collections import defaultdict\r\nn, m = map(int,input().split())\r\nRow = defaultdict(bool)\r\nCol = defaultdict(bool)\r\nR = C = 0\r\nAns = n*n\r\nAnsList = []\r\nfor _ in range(m):\r\n row,col = map(int,input().split())\r\n if(Row[row]==False and Col[col]== False):\r\n Ans-=(n-R)+(n-C)-1\r\n R+=1\r\n C+=1\r\n Row[row]=Col[col]=True\r\n AnsList.append(Ans)\r\n elif(Row[row]==True and Col[col]==False):\r\n Ans-=(n-R)\r\n C+=1\r\n Col[col] = True\r\n AnsList.append(Ans)\r\n elif(Row[row]==False and Col[col]==True):\r\n Ans-=(n-C)\r\n R+=1\r\n Row[row] = True\r\n AnsList.append(Ans)\r\n else:\r\n AnsList.append(Ans)\r\nprint(*AnsList)", "n, m = list(map(int, input().split()))\r\n\r\nx = set()\r\ny = set()\r\n\r\nresult = []\r\nfor _ in range(m):\r\n x_, y_ = list(map(int, input().split()))\r\n x.add(x_)\r\n y.add(y_)\r\n xs = n - len(x)\r\n ys = n - len(y)\r\n result.append(str(xs * ys))\r\n\r\nprint(\" \".join(result))\r\n", "n, m = map(int, input().split())\nx_set = set()\ny_set = set()\ncount_x = n\ncount_y = n\nfor i in range(m):\n x, y = map(int, input().split())\n if (x in x_set) and (y in y_set):\n pass\n elif x in x_set:\n if count_y > 0:\n count_y -= 1\n y_set.add(y)\n elif y in y_set:\n if count_x > 0:\n count_x -= 1\n x_set.add(x)\n else:\n if count_x > 0:\n count_x -= 1\n if count_y > 0:\n count_y -= 1\n x_set.add(x)\n y_set.add(y)\n print(count_x * count_y, end = \" \")\n \nprint()\n\t \t \t \t \t \t\t\t \t \t\t \t", "import sys\n\n\ndef f():\n _input = sys.stdin.readlines()\n n, m = [int(i) for i in _input[0].strip().split(' ')]\n num_cells = n ** 2\n row, col = set([]), set([])\n res = []\n for i in range(1, m + 1):\n x, y = _input[i].strip().split(' ')\n x, y = int(x), int(y)\n if x not in row and y not in col:\n num_cells -= 2 * n - 1 - len(row) - len(col)\n elif y in col and x not in row:\n num_cells -= n - len(col)\n elif x in row and y not in col:\n num_cells -= n - len(row)\n res.append(str(num_cells))\n row.add(x)\n col.add(y)\n print(' '.join(res))\n\n\nf()\n", "(size, hooks) = input().split(\" \")\r\n\r\nselected_rows = set()\r\nselected_columns = set()\r\n\r\ntotal = int(size) ** 2\r\n\r\nfor i in range(int(hooks)):\r\n (row, column) = input().split(\" \")\r\n\r\n if not int(row) in selected_rows:\r\n total -= int(size) - len(selected_columns)\r\n\r\n selected_rows.add(int(row))\r\n\r\n if not int(column) in selected_columns:\r\n total -= int(size) - len(selected_rows)\r\n\r\n selected_columns.add(int(column))\r\n\r\n print(total)", "n, m = map(int, input().split())\r\nver = set()\r\nhor = set()\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n hor.add(x)\r\n ver.add(y)\r\n print((n - len(hor))*(n-len(ver)), end = ' ')", "tamanho_do_tabuleiro, num_de_torres = map(int, input().split())\n \nlinhas_livres = tamanho_do_tabuleiro\ncolunas_livres = tamanho_do_tabuleiro\n \ncolunas = set()\nlinhas = set()\ntotal_livre = \"\"\n\nfor _ in range(num_de_torres):\n\tnum_da_linha, num_da_coluna = map(int, input().split())\n\t\n\tif num_da_linha not in linhas:\n\t\tlinhas.add(num_da_linha)\n\t\tlinhas_livres -= 1\n\t\t\n\tif num_da_coluna not in colunas:\n\t\tcolunas.add(num_da_coluna)\n\t\tcolunas_livres -= 1\n\t\n\ttotal_livre += str(linhas_livres * colunas_livres) + \" \"\n\nprint(total_livre)\n \t \t \t\t\t \t\t\t \t \t \t\t \t\t \t", "size, bishop_length = list(map(int, input().split()))\r\nX, Y = set(), set()\r\nresult = []\r\nfor i in range(bishop_length):\r\n x, y = list(map(lambda _: int(_) - 1, input().split()))\r\n X.add(x)\r\n Y.add(y)\r\n active_cells = len(X) * size + len(Y) * size - len(X) * len(Y)\r\n result.append(size * size - active_cells)\r\nprint(*result)\r\n", "n, k=list(map(int,input().split(' ')))\nr,c = {}, {}\n\nfor i in range(k):\n a,b=list(map(int, input().split(' ')))\n r[a]=1\n c[b]=1\n print(n*n - len(r)*n - len(c)*n + len(r)*len(c))\n \t\t\t\t\t \t\t\t\t \t \t \t \t\t\t\t\t \t \t", "an,am=map(int,input().split())\n \na=set()\n \nb=set()\n \nfor i in range(am):\n \n\tc,d=map(int,input().split())\n \n\ta.add(c)\n \n\tb.add(d)\n \n\tprint((an-len(a))*(an-len(b)), end = \" \")\n \t \t \t \t \t\t \t \t \t\t \t \t \t\t", "from collections import defaultdict\r\n\r\nr = defaultdict(int)\r\nc = defaultdict(int)\r\n\r\nn, m = map(int, input().split())\r\nrr, cc = 0, 0\r\nres = 0\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n\r\n if r[x] and c[y]:\r\n pass\r\n elif r[x]:\r\n res += n - rr\r\n cc += 1\r\n c[y] += 1\r\n elif c[y]:\r\n res += n - cc\r\n rr += 1\r\n r[x] += 1\r\n else:\r\n res += n + n - 1 - rr - cc\r\n r[x] += 1\r\n c[y] += 1\r\n rr += 1\r\n cc += 1\r\n print( n * n - res)\r\n\r\n", "n, m = map(int, input().split())\r\ntotal = n*n\r\ndeath = 0\r\nres = ''\r\nrows, cols = set(), set()\r\nn_rows, n_cols = 0, 0\r\nfor _ in range(m):\r\n row, col = map(int, input().split())\r\n if row not in rows:\r\n rows.add(row)\r\n n_rows += 1\r\n death += n - n_cols\r\n if col not in cols:\r\n cols.add(col)\r\n n_cols += 1\r\n death += n - n_rows\r\n res += str(total - death) + ' '\r\nprint(res[:-1])\r\n", "n, m = list(map(int, input().split()))\nlinhas = set()\ncolunas = set()\n\nfor i in range(m):\n x, y = list(map(int, input().split()))\n colunas.add(x)\n linhas.add(y)\n print((n - len(colunas)) * (n - len(linhas)))\n \t\t\t \t\t\t\t \t\t\t \t\t\t \t\t\t\t \t", "an,am=map(int,input().split())\n \naa=set()\n \nbb=set()\n \nfor i in range(am):\n \n\tc,d=map(int,input().split())\n \n\taa.add(c)\n \n\tbb.add(d)\n \n\tprint((an-len(aa))*(an-len(bb)), end = \" \")\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\nans = n * n\r\nr1 = set()\r\nc1 = set()\r\nres =[]\r\nfor i in range(1,m+1) :\r\n r , c = map(int,input().split())\r\n r1.add(r)\r\n c1.add(c)\r\n x =((n - len(r1))) * ((n - len(c1)))\r\n print( x ,end=' ' )\r\n", "I = lambda : map(int, input().split())\r\nn, m = I()\r\nrow, column = {}, {}\r\nfor i in range(m):\r\n r, c = I()\r\n row[r], column[c] = 1, 1\r\n len_row, len_column = len(row), len(column)\r\n attacked = (len_row + len_column) * n - len_row * len_column\r\n print(n * n - attacked, end = ' ')\r\n", "inp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\nresult = n**2\r\nset_x = set()\r\nset_y = set()\r\nfor i in range(1, m+1):\r\n rook = input().split()\r\n x = int(rook[0])\r\n y = int(rook[1])\r\n if x not in set_x:\r\n set_x.add(x)\r\n result -= (n-len(set_y))\r\n if y not in set_y:\r\n set_y.add(y)\r\n result -= (n-len(set_x))\r\n\r\n if result < 0:\r\n result = 0\r\n print(result)\r\n\r\n\r\n\r\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\nfrom collections import defaultdict\r\nfrom itertools import accumulate\r\n\r\n# LOOK AT THE CONSTRAINTS PROPERLY!!!!\r\n\r\n\r\ndef solve():\r\n for _ in range(*maps()):\r\n n, k, z = maps()\r\n a = [*maps()]\r\n if not z:\r\n print(sum(a[:k + 1]))\r\n continue\r\n ans = 0\r\n for t in range(z + 1):\r\n pos = k - (2 * t)\r\n if pos < 0:\r\n continue\r\n mx = s = 0\r\n for i in range(pos + 1):\r\n s += a[i]\r\n if i + 1 < n:\r\n mx = max(mx, a[i] + a[i + 1])\r\n ans = max(ans, s + mx * t)\r\n print(ans)\r\n\r\n\r\ndef silly_mistake():\r\n n, = maps()\r\n a = [*maps()]\r\n maxN = 10**6 + 5\r\n come, ans, res, ok, s, se = [0] * maxN, [], 0, True, 0, set()\r\n for i in range(n):\r\n se.add(a[i])\r\n if a[i] < 0:\r\n a[i] = -a[i]\r\n if come[a[i]] == 1:\r\n come[a[i]] -= 1\r\n res -= 1\r\n if res == 0:\r\n if abs((i + 1) - s) != len(se):\r\n ok = False\r\n ans.append(abs((i + 1) - s))\r\n s += abs((i + 1) - s)\r\n se.clear()\r\n else:\r\n ok = False\r\n else:\r\n if come[a[i]]:\r\n ok = False\r\n\r\n come[a[i]] += 1\r\n res += 1\r\n\r\n if ok and not res:\r\n print(len(ans))\r\n print(*ans)\r\n else:\r\n print(-1)\r\n\r\n\r\ndef divide_the_students():\r\n for _ in range(*maps()):\r\n a, b, c = maps()\r\n if a < c:\r\n a, c = c, a\r\n x = a // 2\r\n y = a - x\r\n z = c\r\n h = max(y, z)\r\n s = 3 * h - x - y - z # group with basic students\r\n if b <= s:\r\n print(h)\r\n else:\r\n b -= s\r\n print(h + b // 3 + (1 if b % 3 else 0))\r\n\r\n\r\ndef f1():\r\n n, k = maps()\r\n d = defaultdict(int)\r\n for i in range(n):\r\n s = input()\r\n d[len(s)] += 1\r\n s = input()\r\n ans1 = ans2 = 0\r\n K = k\r\n for i in range(len(s) + 1):\r\n a1, a2 = 0, 0\r\n kk = K\r\n while d[i]:\r\n if K == 0:\r\n K = k\r\n a1 += 5\r\n a2 += 5\r\n K -= 1\r\n a1 += 1\r\n a2 += 1\r\n d[i] -= 1\r\n\r\n if i == len(s):\r\n ans2 += a2\r\n else:\r\n ans1 += a1\r\n ans2 += a2\r\n\r\n print(ans1 + (6 if kk == 0 else 1), ans2)\r\n\r\n\r\ndef meeting_of_old_friends():\r\n l1, r1, l2, r2, k = maps()\r\n l = max(l1, l2)\r\n r = min(r1, r2)\r\n if l > r:\r\n print(0)\r\n else:\r\n if k >= l and k <= r:\r\n print(r - l)\r\n else:\r\n print(r - l + 1)\r\n\r\n\r\ndef func():\r\n n, = maps()\r\n a = [*maps()]\r\n s = 0\r\n for i in range(n):\r\n s += max(0, a[i] - 1)\r\n print(1 if s % 2 else 2)\r\n\r\n\r\ndef func1():\r\n n, m = maps()\r\n sx, sy = set(), set()\r\n tot = n * n\r\n for _ in range(m):\r\n a, b = maps()\r\n sx.add(a)\r\n sy.add(b)\r\n can = (n * len(sx) + n * len(sy)) - len(sx) * len(sy)\r\n print(tot - can)\r\nfunc1()", "nm=[int(x) for x in input().split()]\nn=nm[0]\nm=nm[1]\nhoriz=set()\nvert=set()\ncount=n*n\nfor _ in range(m):\n\txy=[int(x) for x in input().split()]\n\tx=xy[0]\n\ty=xy[1]\n\thoriz.add(x)\n\tvert.add(y)\n\tprint(count+(len(horiz)*len(vert))-((n*len(horiz)+(n*len(vert)))))", "#F\nn, m = map(int, input().split())\n\nres = []\ni_deleted = set()\nj_deleted = set()\ntotal = n * n\nfor r in range(m):\n i, j = input().split()\n\n aux = 0\n i_not_deleted = i not in i_deleted\n j_not_deleted = j not in j_deleted\n if i_not_deleted:\n aux += n - len(j_deleted)\n \n if j_not_deleted:\n aux += n - len(i_deleted)\n\n if i_not_deleted and j_not_deleted:\n aux -= 1\n\n i_deleted.add(i)\n j_deleted.add(j)\n\n total -= aux\n res.append(str(total))\n\nprint(\" \".join(res))\n\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\nx = set()\r\ny = set()\r\nret = []\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n x.add(a)\r\n y.add(b)\r\n ret.append(n * n - (len(x) + len(y)) * n + len(x) * len(y))\r\nprint(' '.join(map(str, ret)))", "# 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#sys.setrecursionlimit(1000000)\r\n#from cmath import sqrt\r\n#from collections import deque, Counter, OrderedDict,defaultdict\r\n#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\n#from math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#from bisect import bisect_left,bisect_right\r\n#import numpy as np\r\n\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod,MOD=1000000007,998244353\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\n\r\ndef get_array(): return list(map(int , sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\nn,m=get_ints()\r\nhori=set();hl=0\r\nver=set();vl=0\r\nwhile m>0:\r\n x,y=get_ints()\r\n if x not in hori:\r\n hori.add(x)\r\n hl+=1\r\n if y not in ver:\r\n ver.add(y)\r\n vl+=1\r\n ct=hl*n+vl*n-hl*vl\r\n print(n*n-ct,end=' ')\r\n m-=1", "dimensao, torres = map(int, input().split())\r\n\r\nlinhas_sob_ataque = set()\r\ncolunas_sob_ataque = set()\r\n\r\nmax_celulas_restantes_linha = dimensao\r\nmax_celulas_restantes_coluna = dimensao\r\n\r\ncelulas_sem_ataque = []\r\nfor i in range(torres):\r\n linha, coluna = map(int, input().split())\r\n\r\n if not (linha in linhas_sob_ataque):\r\n linhas_sob_ataque.add(linha)\r\n max_celulas_restantes_coluna -= 1\r\n\r\n if not (coluna in colunas_sob_ataque):\r\n colunas_sob_ataque.add(coluna)\r\n max_celulas_restantes_linha -= 1\r\n\r\n celulas_sem_ataque.append(str(max_celulas_restantes_linha * max_celulas_restantes_coluna))\r\n\r\nprint(\" \".join(celulas_sem_ataque))\r\n", "n , m = map (int , input().split())\r\na , b = set() , set()\r\nfor i in range(m):\r\n x,y = map (int , input().split())\r\n a.add(x)\r\n b.add(y)\r\n print((n-len(a))*(n-len(b)))", "n,m = map(int,input().split())\r\nr = set()\r\nc = set()\r\nk = []\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n c.add(y)\r\n r.add(x)\r\n k.append(n*n-(len(c)*n+len(r)*n-len(c)*len(r)))\r\nprint(*k)\r\n", "from sys import stdin, stdout\n\n\ndef calculate_free(free_columns, free_rows):\n return len(free_columns)*len(free_rows)\n\ndef update_board(rook, free_columns, free_rows):\n column = rook[0]\n row = rook[1]\n if column in free_columns:\n del free_columns[column]\n if row in free_rows:\n del free_rows[row]\n\ndef solve(rooks,n):\n free_columns = {}\n free_rows = {}\n for i in range(1,n+1):\n free_columns[i] = True\n free_rows[i] = True\n free_spaces = []\n for rook in rooks:\n update_board(rook,free_columns,free_rows)\n free_space = calculate_free(free_columns, free_rows)\n free_spaces.append(free_space)\n stdout.write(str(free_space))\n stdout.write(' ')\n return free_spaces\n\n\n\nn,m = map(int,input().split())\nrooks = []\nfor i in range(m):\n a,b = map(int,input().split())\n rooks.append((a,b))\nsolve(rooks,n)\n\n", "n, m = map(int,input().split())\r\nres = n * n\r\nrow = [0] * (n+1)\r\ncol = [0] * (n+1)\r\nc = 0\r\nr = 0\r\nfor i in range(m):\r\n\tx,y = map(int,input().split())\r\n\tif row[x] == 0:\r\n\t\trow[x] = 1\r\n\t\tr+=1\r\n\tif col[y] == 0:\r\n\t\tcol[y] = 1\r\n\t\tc+=1\r\n\tprint(res - ((r*n) + (c*(n-r))), end=\" \")\r\n ", "n, m = map(int, input().split())\n\nrows = set()\ncolumns = set()\n\nout = []\n\nfor _ in range(m):\n row, column = map(int, input().split())\n\n rows.add(row)\n columns.add(column)\n\n out.append((n - len(columns)) * (n - len(rows)))\n\nprint(*out)\n\t\t \t\t\t \t \t\t \t \t \t \t\t \t", "n, m= map(int, input().split())\r\np= n*n\r\nrow, col= set(), set()\r\na= []\r\n\r\nfor _ in range(m):\r\n x, y= map(int, input().split())\r\n row.add(x)\r\n col.add(y)\r\n r= (n-(len(row)))*(n-(len(col)))\r\n a.append(r)\r\n\r\nprint(*a)", "dx={}\r\ndy={}\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n dx[x]=1\r\n dy[y]=1\r\n print((n-len(dx))*(n-len(dy)),end=\" \")", "n, m = [int(x) for x in input().split(' ')]\n\ndict_x = {}\ndict_y = {}\n\nvalues = []\n\nfor _ in range(m):\n x, y = [int(x) for x in input().split(' ')]\n\n dict_x[x] = 1\n dict_y[y] = 1\n\n value = (n - len(dict_x)) * (n - len(dict_y))\n\n values.append(str(value))\n\nprint(' '.join(values))\n\n\t \t \t\t\t\t \t\t\t \t \t\t \t\t \t", "rows = set()\ncolumns = set()\n\nn, m = map(int, input().split())\nn_rows = 0\nn_columns = 0\n\nans = n*n\n\nfor i in range(m):\n\n x, y = map(int, input().split())\n\n if x not in rows:\n rows.add(x)\n n_rows += 1\n if y not in columns:\n columns.add(y)\n n_columns += 1\n\n print(ans - n*(n_rows + n_columns) + n_rows*n_columns)\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())\n\nrows = set()\ncolumns = set()\nanswers = []\nfor i in range(m):\n\tr, c = map(int, input().split())\n\trows.add(r)\n\tcolumns.add(c)\n\t\n\tanswers.append((n-len(rows)) * (n-len(columns)))\n\nfor i in range(m):\n\tif i == m-1:\n\t\tprint(answers[i])\n\n\telse:\n\t\tprint(answers[i], end=' ')\n\t\n\t\n\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\nx_set = set()\r\ny_set = set()\r\ncount_x = n\r\ncount_y = n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if (x in x_set) and (y in y_set):\r\n pass\r\n elif x in x_set:\r\n if count_y > 0:\r\n count_y -= 1\r\n y_set.add(y)\r\n elif y in y_set:\r\n if count_x > 0:\r\n count_x -= 1\r\n x_set.add(x)\r\n else:\r\n if count_x > 0:\r\n count_x -= 1\r\n if count_y > 0:\r\n count_y -= 1\r\n x_set.add(x)\r\n y_set.add(y)\r\n print(count_x * count_y, end = \" \")\r\n \r\nprint()", "n, m=[int(k) for k in input().split()]\r\na, b=n, n\r\nc, q=set(), set()\r\nres=n*n\r\neta=[]\r\nfor j in range(m):\r\n x, y=[int(k) for k in input().split()]\r\n if x not in c:\r\n a-=1\r\n res-=b\r\n c.add(x)\r\n if y not in q:\r\n b-=1\r\n res-=a\r\n q.add(y)\r\n eta.append(res)\r\nprint(\" \".join([str(k) for k in eta]))", "def cells():\n #entrada = input().split()\n # n = tamanho tabuleiro nxn\n # m = número de torres\n n, m = map(int, input().split())\n colunas = set()\n linhas = set()\n saida = []\n for i in range(m):\n col, lin = map(int, input().split())\n colunas.add(col)\n linhas.add(lin)\n saida.append(str((n - len(colunas)) * (n - len(linhas))))\n print(\" \".join(saida))\n\n\ncells()\n\n \t \t\t \t\t \t\t \t\t\t \t\t\t\t\t", "m,n=map(int,input().split())\r\ns,q=m,m\r\nrow=[0]*(m+1)\r\nco=[0]*(m+1)\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if row[a]==0:\r\n row[a]=1\r\n s=s-1\r\n if co[b]==0:\r\n co[b]=1\r\n q=q-1\r\n if i!=n-1:\r\n print(s*q,end=\" \")\r\n else:\r\n print(s*q)\r\n ", "from collections import defaultdict as dd\nn,m=map(int,input().split())\nerow,ecol=n,n\nrow=dd(int)\ncol=dd(int)\nans=[]\nfor move in range(m):\n prow,pcol=map(int,input().split())\n prow,pcol=prow-1,pcol-1\n if row[prow]==0:\n row[prow]=1\n erow-=1\n if col[pcol]==0:\n col[pcol]=1\n ecol-=1\n ans.append(erow*ecol)\nprint(*ans,sep=\" \")\n\t\t \t \t\t\t\t\t \t \t\t\t\t \t\t", "controles = list(map(int, input().split()))\nresto = controles[0] ** 2\nretirados = controles[0] * 2 - 1\ncoluna = [\"0\"] * (controles[0]+1)\nlinha = [\"0\"] * (controles[0]+1)\ncontroleLinha = 0\ncontroleColuna = 0\nnumero = []\nfor a in range(controles[1]):\n controlesAtuais = list(map(int, input().split()))\n \n if linha[controlesAtuais[0]] == \"0\":\n linha[controlesAtuais[0]] = 1\n retirado = controles[0] - controleColuna\n controleLinha += 1\n resto -= retirado\n if coluna[controlesAtuais[1]] == \"0\":\n coluna[controlesAtuais[1]] = 1\n \n retirado = controles[0] - controleLinha\n controleColuna += 1\n resto -= retirado\n \n \n numero.append(resto)\n \n\nprint(*numero)\n\n\n \t \t\t \t\t \t \t \t \t\t \t\t \t \t \t \t", "n, m = map(int, input().split())\r\np=n*n\r\nsx, sy=set(), set()\r\nfor i in range(m):\r\n x, y=map(int, input().split())\r\n sx.add(x)\r\n sy.add(y)\r\n ans=(n-len(sx))*(n-len(sy))\r\n print(ans, end=' ')\r\nprint()", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(100000)\r\nfrom collections import deque, defaultdict\r\np = print\r\nr = range\r\nde = defaultdict\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('YES' if b else 'NO')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn , m = II()\r\nxx = set()\r\nyy = set()\r\ntotal = n*n\r\nres = []\r\nfor _ in r(m):\r\n x, y = II()\r\n if x not in xx:\r\n total -= n - len(yy)\r\n xx.add(x)\r\n if y not in yy:\r\n total -= n - len(xx)\r\n yy.add(y)\r\n res.append(total)\r\np(*res)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\na = set()\r\nb = set()\r\nc = d = n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if x not in a:\r\n a.add(x)\r\n c -= 1\r\n if y not in b:\r\n b.add(y)\r\n d -= 1\r\n print(c*d,end=' ')", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial\r\nINT_MIN=float(\"-infinity\")\r\nINT_MAX=float(\"infinity\")\r\nn,m=map(int,input().split())\r\nrow=set()\r\ncol=set()\r\nsu=n*n\r\nfor i in range(m):\r\n\ta,b=map(int,input().split())\r\n\tif a not in row:\r\n\t\tsu-=n-len(col)\r\n\trow.add(a)\r\n\t# print(su)\r\n\tif b not in col:\r\n\t\tsu-=n-len(row)\r\n\tcol.add(b)\r\n\tprint(su,end=' ')", "n, m = map(int,input().split(\" \"))\n\nsize = n*n\n\nallColumns = set()\nallLines = set()\n\ncolums = 0\nlines = 0\n\nfor i in range(m):\n l, c = map(int,input().split(\" \"))\n \n lenL = len(allLines)\n \n if(c not in allColumns):\n colums += n - lenL\n\n\n allColumns.add(c)\n lenC = len(allColumns)\n\n\n if(l not in allLines):\n lines += n - lenC\n\n allLines.add(l)\n\n print(size - (colums + lines))\n\n\n\t\t\t \t\t\t\t\t\t \t \t\t\t\t\t \t\t\t \t", "tamanho_tab, numero_rooks = list(map(int, input().split()))\ntabul = tamanho_tab*tamanho_tab\nlinhas_usadas = set()\ncolunas_usadas = set()\nocupadas = 0\nretorno = \"\"\n\nfor _ in range(numero_rooks):\n pos = list(map(int, input().split()))\n\n row_oc = pos[0] in linhas_usadas\n coll_oc = pos[1] in colunas_usadas\n\n if (row_oc and coll_oc):\n retorno += str(tabul - ocupadas) + \" \"\n continue\n\n if not (row_oc):\n linhas_usadas.add(pos[0])\n\n if not (coll_oc):\n colunas_usadas.add(pos[1])\n\n colunas = len(colunas_usadas)\n linhas = len(linhas_usadas)\n ocupadas = colunas*tamanho_tab + linhas*tamanho_tab - linhas*colunas\n retorno += str(tabul - ocupadas) + \" \"\n\nprint(retorno[:-1])\n\n \t\t \t\t \t \t \t\t \t \t \t\t\t \t", "n, m = map(int,input().split())\n\nlinhas = set()\ncolunas = set()\n\nres = []\nfor r in range(m):\n i,j = map(int,input().split())\n\n linhas.add(i)\n colunas.add(j)\n\n l = len(linhas)\n c = len(colunas)\n\n livres = (n - c) * (n - l)\n res.append(livres)\n\nfor elem in res:\n print(elem, end = \" \")\n \t \t\t \t \t \t\t \t\t \t \t\t\t \t\t\t", "n, m = map(int, input().split())\r\ncells = n * n\r\nx = set()\r\ny = set()\r\ny_1, x_1 = map(int, input().split())\r\nx.add(x_1)\r\ny.add(y_1)\r\nans = []\r\ncells -= 2 * n - 1\r\nans.append(str(cells))\r\nfor i in range(1, m):\r\n y_1, x_1 = map(int, input().split())\r\n x_ex = x_1 in x\r\n y_ex = y_1 in y\r\n if x_ex and y_ex:\r\n cells -= 0\r\n elif x_ex and not y_ex:\r\n cells -= n - len(x)\r\n elif y_ex and not x_ex:\r\n cells -= n - len(y)\r\n elif not y_ex and not x_ex:\r\n cells -= 2 * n - len(x) - len(y) - 1\r\n x.add(x_1)\r\n y.add(y_1)\r\n ans.append(str(cells))\r\nprint(\" \".join(ans))", "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, m = map(int, input().split())\r\nsize = n * n\r\nrows = set()\r\ncolumns = set()\r\nfor _ in range(m) :\r\n x, y = map(int, input().split())\r\n up, bottom, left, right = x - 1, n - x, y - 1, n - y\r\n if x not in rows and y not in columns:\r\n size = size - (up + bottom + left + right) + len(columns) + len(rows) - 1\r\n elif x not in rows :\r\n size = size - (left + right) + len(columns) - 1\r\n elif y not in columns :\r\n size = size - (up + bottom) + len(rows) - 1\r\n rows.add(x)\r\n columns.add(y)\r\n print(size, end = ' ')\r\nprint()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nrows, cols = set(), set()\r\nans = []\r\nfor _ in range(m):\r\n r, c = map(int, input().split())\r\n rows.add(r)\r\n cols.add(c)\r\n under_attack = len(rows) * n + len(cols) * (n - len(rows))\r\n ans.append(n*n - under_attack)\r\n\r\nprint(*ans)\r\n", "\r\nn, m = map(int, input().split())\r\nrow = set()\r\ncol = set()\r\ns = \"\"\r\nfor i in range(m):\r\n r, c = map(int, input().split())\r\n row.add(r)\r\n col.add(c)\r\n dead = len(row)*n+len(col)*(n-len(row))\r\n s += str(n*n - dead) + \" \"\r\nprint(s)", "n, m = map(int, input().split())\ntabuleiro = [0] * (n + n)\nlinhas = n\ncolunas = n\nr = list()\nfor i in range(m):\n x, y = map(int, input().split())\n if tabuleiro[x-1] == 0:\n tabuleiro[x-1] = 1\n linhas -= 1\n if tabuleiro[y-1+n] == 0:\n tabuleiro[y-1+n] = 1\n colunas -= 1\n r.append(str(linhas * colunas))\nprint(\" \".join(r))\n \t \t\t \t\t \t \t\t\t \t \t\t\t\t \t \t", "n, m = map(int, input().split())\nar = n*n\nx = set()\ny = set()\nfor i in range(m):\n a, b = map(int, input().split())\n x.add(a)\n y.add(b)\n print(ar - (len(x)*n + len(y)*n - len(x)*len(y)))\n\n\n \t\t\t\t\t\t \t \t \t \t\t \t\t \t", "class solve:\r\n def __init__(self):\r\n n,m=map(int,input().split())\r\n row,col=set(),set()\r\n ans=n*n\r\n result=[0]*m\r\n c=0\r\n for i in range(m):\r\n x,y=map(int,input().split())\r\n row.add(x)\r\n col.add(y)\r\n lx,ly=len(row),len(col)\r\n result[i]=max(0,n*n-n*(lx+ly)+lx*ly)\r\n print(*result)\r\n\r\nobj=solve()", "n, m = map(int, input().split())\n\n\ntotal = n * n\nlines = set()\nlen_lines = 0\ncols = set()\nlen_cols = 0\nres = []\nfor i in range(m):\n x, y = map(int, input().split())\n\n aux = 0\n if x not in lines:\n lines.add(x)\n aux += n - len_cols\n len_lines += 1\n\n if y not in cols:\n cols.add(y)\n aux += n - len_lines\n len_cols += 1\n\n total-=aux\n res.append(str(total))\n\n\n\n\nprint(' '.join(res))\n\n# print(board)\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\nrowList=[0 for _ in range(n)]\r\ncolList=[0 for _ in range(n)]\r\n\r\nrowRooks=0\r\ncolRooks=0\r\n\r\ntotalUnattacked=n*n\r\nfinalList=[]\r\nfor _ in range(m):\r\n r,c=map(int,input().split())\r\n\r\n r-=1\r\n c-=1\r\n\r\n if rowList[r]==0:\r\n rowList[r]=1;\r\n totalUnattacked-=n;\r\n totalUnattacked+=colRooks;\r\n rowRooks+=1;\r\n if colList[c]==0:\r\n colList[c]=1;\r\n totalUnattacked-=n;\r\n totalUnattacked+=rowRooks;\r\n colRooks+=1;\r\n finalList.append(totalUnattacked)\r\n\r\nfor i in range(len(finalList)):\r\n print(finalList[i],end=\" \")\r\n", "n, m = map(int, input().split())\r\nax = set()\r\nay = set()\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n ax.add(x)\r\n ay.add(y)\r\n k = n - len(ax)\r\n l = n - len(ay)\r\n col = l * k\r\n print(col, end=' ')\r\n" ]

[ "# -*- coding: utf-8 -*-\n\n\n\n\n\ndef solve():\n\n n, m = map(int, input().split())\n\n p = input()\n\n if m == 0:\n\n return powmod(n)\n\n delta = len(p) - 1\n\n ys = map(int, input().split())\n\n tail = 0\n\n free_chars = 0\n\n for y in ys:\n\n if y > tail:\n\n free_chars += y - tail - 1\n\n elif not is_consistent(p, tail - y + 1):\n\n return 0\n\n tail = y + delta\n\n free_chars += n - tail\n\n return powmod(free_chars)\n\n\n\nok_set = set()\n\ndef is_consistent(p, margin):\n\n global ok_set\n\n if margin in ok_set:\n\n return True\n\n elif p[:margin] == p[-margin:]:\n\n ok_set.add(margin)\n\n return True\n\n else:\n\n return False\n\n\n\n\n\ndef powmod(p):\n\n mod = 10**9 + 7\n\n pbin = bin(p)[2:][-1::-1]\n\n result = 26 if pbin[0] == '1' else 1\n\n tmp = 26\n\n for bit in pbin[1:]:\n\n tmp *= tmp\n\n tmp %= mod\n\n if bit == '1':\n\n result *= tmp\n\n result %= mod\n\n return result\n\n\n\n\n\nprint(solve())\n\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "n, k = map(int, input().split())\nnum = list(map(int, input().split()))\nMOD = 10 ** 9 + 7\n\ncf = [1]\nfor i in range(1, 2020):\n cf.append((cf[-1] * (k + i - 1) * pow(i, MOD - 2, MOD)) % MOD)\n\nans = [0 for i in range(n)]\nfor i in range(n):\n for j in range(i + 1):\n ans[i] = (ans[i] + cf[i - j] * num[j]) % MOD\n\nprint(' '.join(map(str, ans)))\n\n\n\n\n# Made By Mostafa_Khaled", "n, k= map(int, input().split())\na = list(map(int, input().split()))\n\ndef find_cf(k,i,a,mod):\n cf=[1]\n ans=0\n \n for j in range(1,i):\n aux=(i-j)*cf[-1]*pow(k+i-j-1,mod-2,mod)%mod\n cf.append(aux)\n ans+=aux*a[j-1]\n ans+=a[i-1]\n return ans\n\ndef Combinations(n,r,mod):\n \n num = den = 1\n for i in range(r):\n num = (num * (n - i)) % mod\n den = (den * (i + 1)) % mod\n return (num * pow(den,mod - 2, mod)) % mod\n \n\n\ndef partial_Sums(n, k, a):\n \n if(k==0): return a\n \n result=[a[0]]\n mod= 10**9 + 7\n cf=[1]\n \n for i in range(1,n+1):\n cf.append((cf[-1]*(k+i-1)*pow(i,mod-2,mod))%mod)\n \n for i in range(2,n+1):\n x = 0\n for j in range(i,0,-1):\n x = (x+a[j-1]*cf[i-j])%mod\n result.append(x)\n \n \n return result\n\nanswer=partial_Sums(n,k,a)\nprint(' '.join(map(str, answer)))\n\n# 3 1\n# 1 2 3\n", "leng, repeat=list(map(int,input().split()))\r\nLis = list(map(int,input().split()))\r\nmod = 10**9 + 7\r\ncum = [1]\r\nans = [0]*leng\r\nfor i in range(1, 2001):\r\n cum.append((cum[-1] * (repeat + i - 1) * pow(i, mod-2, mod)) % mod)\r\n\r\nfor i in range(leng):\r\n for j in range(i + 1):\r\n ans[i] = (ans[i] + cum[i-j] * Lis[j]) % mod\r\nprint(*ans)\r\n\r\n", "def inv_table(n,mod):\r\n inv=[1]*(n+1)\r\n for i in range(2,n+1):\r\n inv[i]=-inv[mod%i]*(mod//i)%mod\r\n return inv\r\n\r\ndef negative_binom(n,r,d,mod):\r\n # (1-rx)^(-d) を第 n 項まで求める\r\n a=[0]*(n+1)\r\n a[0]=1\r\n inv=inv_table(n,mod)\r\n res=1\r\n for i in range(1,n+1):\r\n res*=(i-1+d)\r\n res%=mod\r\n res*=inv[i]\r\n res%=mod\r\n a[i]=res\r\n return a\r\n\r\nn,k=map(int,input().split())\r\nmod=10**9+7\r\n\r\na=list(map(int,input().split()))\r\nb=negative_binom(n,1,k,mod)\r\n\r\nans=[0]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i+j<n:\r\n ans[i+j]+=a[i]*b[j]\r\n ans[i+j]%=mod\r\n\r\nprint(*ans)\r\n", "n, k= map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndef partial_Sums(n, k, a):\r\n \r\n if(k==0): return a #En caso de que no se haga ningún paso\r\n \r\n mod= 10**9 + 7\r\n result=[a[0]]\r\n cf=[1]\r\n \r\n for i in range(1,n+1):\r\n cf.append((cf[-1]*(k+i-1)*pow(i,mod-2,mod))%mod) #Se determinan los coeficientes de cada elemento del array en la respuesta final\r\n \r\n for i in range(2,n+1):\r\n s_i = 0\r\n \r\n for j in range(i,0,-1):\r\n s_i = (s_i+a[j-1]*cf[i-j])%mod\r\n result.append(s_i)\r\n \r\n \r\n return result\r\n\r\nanswer=partial_Sums(n,k,a)\r\nprint(' '.join(map(str, answer)))\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nm = 1000000007\r\nr = [ 0, 1 ]\r\nfor i in range(2, n+1):\r\n r.append( (- (m // i) * r[m % i]) % m )\r\n\r\nc = [ 1 ]\r\nfor i in range(1, n):\r\n c.append((c[i-1] * (k+i-1) * r[i]) % m)\r\n\r\nans = []\r\nfor i in range(n):\r\n t = 0\r\n for j in range(i+1):\r\n t = (t + a[j] * c[i-j]) % m\r\n ans.append(t)\r\n\r\nfor i in range(n):\r\n print(ans[i], end=' ')" ]

[ "# LUOGU_RID: 116285050\nn=int(input())\r\nd={}\r\nc=[]\r\nfor _ in range(n):\r\n a,b=input().split()\r\n b=int(b)\r\n if a not in c:\r\n c.append(a)\r\n if a not in d:\r\n d[a]=b\r\n else:\r\n if d[a]<b:\r\n d[a]=b\r\nprint(len(d))\r\nm=len(c)\r\nx=[0]*m\r\nfor i in range(m):\r\n for j in range(m):\r\n if d[c[i]]<d[c[j]]:\r\n x[i]+=1\r\n print(c[i],end=' ')\r\n if x[i]>0.50*m:\r\n print('noob')\r\n elif x[i]>0.20*m:\r\n print('random')\r\n elif x[i]>0.10*m:\r\n print('average')\r\n elif x[i]>0.01*m:\r\n print('hardcore')\r\n else:\r\n print('pro')", "from collections import defaultdict, OrderedDict\r\nn = int(input())\r\nu = defaultdict(int)\r\nfor _ in range(n) :\r\n name, score = input().split()\r\n u[name] = max(u[name], int(score))\r\nscoreToPlayers = defaultdict(list)\r\nfor pl in u :\r\n scoreToPlayers[u[pl]].append(pl)\r\nv = OrderedDict(sorted(scoreToPlayers.items()))\r\nres = []\r\nbefore = 0\r\nfor (i, s) in enumerate(v):\r\n perc = (len(v[s]) + before) / len(u)\r\n r = \"noob\"\r\n if 0.5 <= perc < 0.8 :\r\n r = \"random\"\r\n elif 0.8 <= perc < 0.9 :\r\n r = \"average\"\r\n elif 0.9 <= perc < 0.99 :\r\n r = \"hardcore\"\r\n elif 0.99 <= perc :\r\n r = \"pro\" \r\n for name in v[s] :\r\n res.append((name, r))\r\n before += len(v[s])\r\nprint(len(res))\r\nfor (name, category) in res :\r\n print(name, category)\r\n\r\n\r\n", "def t(g, n):\n for x, y in ((50, 'noob'), (20, 'random'), (10, 'average'), (1, 'hardcore')):\n if g > x * n // 100:\n return y\n return 'pro'\np, st = {}, {}\nfor i in range(int(input())):\n n, s = input().split()\n if n not in p or int(s) > p[n]:\n p[n] = int(s)\nfor i, si in enumerate(sorted(p.values(), reverse=True)):\n if si not in st:\n st[si] = t(i, len(p))\nprint(len(p))\nprint(*sorted(k + ' ' + st[p[k]] for k in p), sep='\\n')\n", "# LUOGU_RID: 116281298\nn=int(input())\r\nd={}\r\nc=[]\r\nfor _ in range(n):\r\n a,b=input().split()\r\n b=int(b)\r\n if a not in c:\r\n c.append(a)\r\n if a not in d:\r\n d[a]=b\r\n else:\r\n if d[a]<b:\r\n d[a]=b\r\nprint(len(d))\r\nm=len(c)\r\nx=[0]*m\r\nfor i in range(m):\r\n for j in range(m):\r\n if d[c[i]]<d[c[j]]:\r\n x[i]+=1\r\nfor i in range(m):\r\n print(c[i],end=' ')\r\n if x[i]<=0.01*m:\r\n print('pro')\r\n elif x[i]<=0.10*m:\r\n print('hardcore')\r\n elif x[i]<=0.20*m:\r\n print('average')\r\n elif x[i]<=0.50*m:\r\n print('random')\r\n else:\r\n print('noob')", "n = int(input())\r\ndic = {}\r\nlength = 0\r\nfor i in range(n):\r\n player,score = input().split()\r\n score = int(score)\r\n if player not in dic:\r\n dic[player] = score\r\n length += 1\r\n else:\r\n if dic[player]<score:\r\n dic[player] = score\r\nsortd_values = sorted(dic.values(),reverse=True)\r\nprint(length)\r\nfor key in dic:\r\n index = sortd_values.index(dic[key])\r\n t = (index/length)*100\r\n if t>50:\r\n print(key,'noob')\r\n elif t>20:\r\n print(key,'random')\r\n elif t>10:\r\n print(key,'average')\r\n elif t>1:\r\n print(key,'hardcore')\r\n else:\r\n print(key,'pro')\r\n", "n=int(input())\r\na={}\r\nfor i in range(n):\r\n s=input().split()\r\n if s[0] in a:\r\n a[s[0]]=max(int(s[1]),a[s[0]])\r\n else:\r\n a[s[0]]=int(s[1])\r\nn=len(a)\r\nprint(n)\r\nfor s in a:\r\n k=0\r\n for y in a:\r\n if a[y]>a[s]: k+=1\r\n if k*2>n:\r\n print(s,\"noob\")\r\n elif k*5>n:\r\n print(s,\"random\")\r\n elif k*10>n:\r\n print(s,\"average\")\r\n elif k*100>n:\r\n print(s,\"hardcore\")\r\n else:\r\n print(s,\"pro\")\r\n", "from collections import defaultdict\r\nfrom bisect import bisect_left\r\np, n = defaultdict(int), int(input())\r\nfor i in range(n):\r\n a, b = input().split()\r\n p[a] = max(p[a], int(b))\r\np, n = sorted((b, a) for a, b in p.items()), len(p)\r\nt = [0] + [bisect_left(p, (p[n - 1 - n // k][0], '')) for k in [2, 5, 10, 100]] + [n]\r\ns = ['noob', 'random', 'average', 'hardcore', 'pro']\r\nfor i in range(1, len(t)):\r\n d = s[i - 1]\r\n for j in range(t[i - 1], t[i]): p[j] = p[j][1] + ' ' + d\r\nprint(n)\r\nprint('\\n'.join(p))", "class Player:\n def __init__(self, name, score):\n self.name = name\n self.score = score\n\nclass Tier:\n def __init__(self, label, percentile):\n self.label = label\n self.percentile = percentile\ntier_data = [ ('pro', 99), ('hardcore', 90),\n ('average', 80), ('random', 50) ]\ntiers = [ Tier(*t) for t in tier_data ]\n\nnum_records = int(input())\nname_to_score = {}\nfor i in range(num_records):\n tokens = input().split()\n name, score = tokens[0], int(tokens[1])\n name_to_score[name] = max(name_to_score.setdefault(name, 0), score)\n\nnum_players = len(name_to_score)\nplayers = []\nfor name, score in name_to_score.items():\n players.append(Player(name, score))\nplayers.sort(key = lambda player: player.score)\nprint(num_players)\n\npos = num_players - 1\nwhile pos >= 0:\n player = players[pos]\n rank = 'noob'\n score = player.score\n for tier in tiers:\n if 100 * (pos + 1) // num_players >= tier.percentile:\n rank = tier.label\n break\n print(player.name, rank)\n pos -= 1\n while pos >= 0 and players[pos].score == score:\n print(players[pos].name, rank)\n pos -= 1\n", "from collections import defaultdict\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\nmp = defaultdict(int)\r\nfor i in range(n):\r\n name, sc = input().split()\r\n sc = int(sc)\r\n mp[name] = max(sc, mp[name])\r\nplayers = sorted([(k, v) for k, v in mp.items()], key=lambda x: x[1])\r\nprint(len(players))\r\nj = 0\r\nfor i, playerAndScore in enumerate(players):\r\n player, score = playerAndScore\r\n while j < len(players) and players[j][1] <= score:\r\n j += 1\r\n if j / len(players) < 0.5:\r\n print(' '.join([player, 'noob']))\r\n elif 0.5 <= j / len(players) < 0.8:\r\n print(' '.join([player, 'random']))\r\n elif 0.8 <= j / len(players) < 0.9:\r\n print(' '.join([player, 'average']))\r\n elif 0.9 <= j / len(players) < 0.99:\r\n print(' '.join([player, 'hardcore']))\r\n else:\r\n print(' '.join([player, 'pro']))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef rank(q):\r\n a = q/m * 100\r\n if a < 50:\r\n return 'noob'\r\n elif a < 80:\r\n return 'random'\r\n elif a < 90:\r\n return 'average'\r\n elif a < 99:\r\n return 'hardcore'\r\n else:\r\n return 'pro'\r\n\r\n\r\n\r\nn = int(input())\r\nd = dict()\r\nfor _ in range(n):\r\n a, b = input()[:-1].split()\r\n b = int(b)\r\n if d.get(a, 0) == 0:\r\n d[a] = b\r\n else:\r\n d[a] = max(d[a], b)\r\n\r\nm = len(d)\r\ns = dict()\r\nfor i in d:\r\n if s.get(d[i], 0) == 0:\r\n s[d[i]] = [i]\r\n else:\r\n s[d[i]].append(i)\r\n\r\nd = sorted([(i, s[i], len(s[i])) for i in s])\r\ne = []\r\nc = 0\r\nfor x, w, i in d:\r\n c += i\r\n r = rank(c)\r\n for j in w:\r\n e.append((j, r))\r\n\r\nprint(len(e))\r\nfor i in e:\r\n print(' '.join(i))" ]

[ "dict1={\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\nn=int(input())\nn_list=[]\nprint(6-n)\nfor i in range(n):\n g=input()\n n_list.append(g)\nfor k,v in dict1.items():\n if k not in n_list:\n print(v)\n \t \t\t\t\t\t\t \t\t\t \t \t \t\t\t \t", "a=int(input())\r\ngr=0\r\npu=0\r\nbl=0\r\nore=0\r\nr=0\r\ny=0\r\np=0\r\nfor i in range(a):\r\n v=input()\r\n if v=='purple':\r\n pu=v\r\n p+=1\r\n if v=='green':\r\n gr=v\r\n p+=1\r\n if v=='blue':\r\n bl=v\r\n p+=1\r\n if v=='orange':\r\n ore=v\r\n p+=1\r\n if v=='red':\r\n r=v\r\n p+=1\r\n if v=='yellow':\r\n y=v\r\n p+=1\r\nprint(6-p)\r\nif pu==0:\r\n print('Power')\r\nif gr==0:\r\n print('Time')\r\nif bl==0:\r\n print('Space')\r\nif ore==0:\r\n print('Soul')\r\nif r==0:\r\n print('Reality')\r\nif y==0:\r\n print('Mind')", "have = 0\r\ncol = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nstones = [ 'Power','Time','Space','Soul','Reality','Mind']\r\nfor no_testcase in range(int(input())):\r\n \r\n n = input()\r\n t = col.index(n)\r\n \r\n col.pop(t)\r\n stones.pop(t)\r\n have+=1\r\n\r\nprint(6-have)\r\nprint(*stones,sep=\"\\n\")\r\n ", "dict={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\nuser=int(input())\nstring=[]\nfor i in range(user):\n user1=str(input())\n string.append(user1)\nprint(6-user) \nfor i in dict:\n if i not in string: \n print(dict[i])\n \t \t\t\t\t\t \t\t \t \t\t \t \t\t\t\t", "n=int(input())\r\ngems={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nk=[]\r\nfor i in range(n):\r\n g=input()\r\n k.append(g)\r\nif len(set(k))==n:\r\n print(6-n)\r\nfor i in gems.keys():\r\n if i not in k:\r\n print(gems.get(i))\r\n \r\n \r\n \r\n", "n=int(input())\r\n\r\nb=dict({'Power':'purple','Time':'green' , 'Space' :'blue','Soul':'orange', 'Reality':'red','Mind':'yellow'})\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\nprint(6-n)\r\nfor x in b:\r\n if b[x] not in a:\r\n print(x)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 5 23:05:06 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\nd = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\nfor i in range(n):\r\n a = input()\r\n d.pop(a)\r\nprint(len(d))\r\nfor i in d:\r\n print(d[i])\r\n", "a=['Power','Time','Space','Soul','Reality','Mind']\nb=['purple','green','blue','orange','red','yellow']\nn=int(input())\nm=0\nfor i in range(n):\n c=input()\n for k in range(len(b)):\n if b[k]==c:\n m+=1\n b[k]=''\n a[k]=''\nprint(6-m)\nfor i in range(len(a)):\n if a[i]!='':\n print(a[i])\n \n\n\t \t \t\t\t\t\t \t\t\t \t\t\t\t \t", "n = int(input())\r\ns = [ ]\r\nd = [ ]\r\nfor i in range(n):\r\n m = input()\r\n s += [m]\r\nif 'yellow' not in s:\r\n d += ['Mind']\r\nif 'red' not in s:\r\n d += ['Reality']\r\nif 'orange' not in s:\r\n d += ['Soul']\r\nif 'blue' not in s:\r\n d += ['Space']\r\nif 'green' not in s:\r\n d += ['Time']\r\nif 'purple' not in s:\r\n d += ['Power']\r\nprint(len(d))\r\nfor j in d:\r\n print(j)", "stones=int(input())\r\n\r\nif stones==6:\r\n print(0)\r\n \r\nelse:\r\n mcu={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\n dc=[]\r\n\r\n for i in range(stones):\r\n s=input()\r\n dc+=s,\r\n\r\n print(6-stones)\r\n for i in mcu:\r\n if i not in dc:\r\n print(mcu[i])", "n=int(input())\nl=[]\nfor i in range(n):\n s=str(input())\n l.append(s)\nprint(6-n) \nif \"purple\" not in l:\n print(\"Power\")\nif \"green\" not in l:\n print(\"Time\")\nif \"red\" not in l:\n print(\"Reality\")\nif \"blue\" not in l:\n print(\"Space\")\nif \"orange\" not in l:\n print(\"Soul\")\nif \"yellow\" not in l:\n print(\"Mind\")\n", "gauntlet = []\r\nfor _ in range(int(input())):\r\n gauntlet.append(input())\r\n\r\nstones = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\ncolors = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\n\r\nprint(len(colors)-len(gauntlet))\r\nfor i in range(len(stones)):\r\n if colors[i] not in gauntlet:\r\n print(stones[i])", "dict_1 = {'purple': 'Power',\n 'green': 'Time',\n 'blue': 'Space',\n 'orange': 'Soul',\n 'red': 'Reality',\n 'yellow': 'Mind',\n }\nn = int(input())\nprint(6-n)\nfor _ in range(n):\n dict_1.pop(input())\nfor value in dict_1.values():\n print(value)\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\nl=[]\r\nm=[]\r\nj=0\r\nfor i in range(n):\r\n s=str(input())\r\n l.append(s)\r\nd={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality',\r\n'yellow':'Mind'}\r\nfor x in d:\r\n if x not in l:\r\n m.append(d[x])\r\n j=j+1\r\nprint(j)\r\nfor x in m:\r\n print(x)\r\n\r\n", "n = int(input())\r\nans = [1]*6\r\nref = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\nfor i in range(n):\r\n s = input()\r\n for j, c in enumerate('pgbory'):\r\n if c == s[0]:\r\n ans[j] = 0\r\nprint(6-n)\r\nfor i in range(6):\r\n if ans[i]:\r\n print(ref[i])\r\n", "n = int(input())\r\narr = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\na = []\r\nprint(6-n)\r\nfor i in range(n):\r\n x = input()\r\n a.append(x)\r\nfor i in arr.keys():\r\n if i not in a:\r\n print(arr[i])\r\n", "n = int(input())\nif n == 6:\n print(\"0\")\n exit()\ncount = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\nfor i in range(0, n):\n s = input()\n if s in count.keys():\n del count[s]\nprint(len(count))\nfor key,value in count.items():\n\tprint(value)\n", "n=int(input())\r\nls=['purple','green','blue','orange','red','yellow']\r\nd={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(n):\r\n\ts=str(input())\r\n\tls.remove(s)\r\nprint(len(ls))\r\nfor j in ls:\r\n\tprint(d[j])", "n=int(input())\nn1=6-n\nrocks=[]\n\nfor i in range(n):\n a=str(input())\n rocks.append(a)\n\nall_rocks=[\"red\", \"blue\", \"purple\", \"yellow\", \"green\",\"orange\"]\n\nneed=[]\nfor i in all_rocks:\n if not i in rocks:\n need.append(i)\n\nrock={\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\",\n \"red\":\"Reality\", \"yellow\":\"Mind\"}\n\n\nn_rocks=[]\n\nprint(n1)\n\nfor i in need:\n \n print(rock[i])\n \n\n \t \t\t \t \t\t\t \t\t \t \t\t \t\t", "d = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n d.pop(s)\r\nprint(len(d))\r\nfor i in d.values():\r\n print(i)", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nt={'Power':'purple','Time':'green','Space':'blue','Soul':'orange','Reality':'red','Mind':'yellow'}\r\nt={y:x for x,y in t.items()}\r\na=[]\r\nn=qi()\r\nfor _ in range(n):a.append(input())\r\nprint(6-n,*[t.get(i) for i in t.keys() if i not in a],sep='\\n')", "a=int(input())\r\nl=[\"purple\",\"red\",\"green\",\"blue\",\"orange\",\"yellow\"]\r\nfor i in range(a):\r\n x=input()\r\n l.remove(x)\r\nprint(len(l))\r\nfor i in l:\r\n if(i==\"red\"):\r\n print(\"Reality\")\r\n elif(i==\"blue\"):\r\n print(\"Space\")\r\n elif(i==\"green\"):\r\n print(\"Time \")\r\n elif(i==\"orange\"):\r\n print(\" Soul\")\r\n elif(i==\"yellow\"):\r\n print(\"Mind \")\r\n else:\r\n print(\"Power\")", "n=int(input())\r\ngauntlet_color=['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\ngauntlet={'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\ncolor=[]\r\nprint(6-n)\r\nfor i in range(n):\r\n color.append(input())\r\ndiff = [i for i in gauntlet_color if i not in color]\r\nfor c in diff:\r\n print(gauntlet[c])", "n, res = int(input()), []\r\nd = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nfor i in range(n):\r\n res.append(input())\r\nfor i in d:\r\n if i not in res:\r\n res.append(d[i])\r\n else:\r\n res.remove(i)\r\nprint(6-n)\r\nfor i in res:\r\n print(i)\r\n", "t = int(input())\r\nList = []\r\nfor _ in range(t):\r\n List.append(input())\r\nprint(6-t)\r\nDict = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nif \"red\" not in List:\r\n print(Dict[\"red\"])\r\nif \"purple\" not in List:\r\n print(Dict[\"purple\"])\r\nif \"yellow\" not in List:\r\n print(Dict[\"yellow\"])\r\nif \"orange\" not in List:\r\n print(Dict[\"orange\"])\r\nif \"blue\" not in List:\r\n print(Dict[\"blue\"])\r\nif \"green\" not in List:\r\n print(Dict[\"green\"])\r\n\r\n \r\n", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/987/A\r\n\"\"\"\r\n\r\nm = int(input())\r\n\r\ngems = {\"purple\": \"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\n\r\nfor _ in range(m):\r\n del gems[input()]\r\n\r\nprint(len(gems))\r\nfor v in gems.values():\r\n print(v)", "import math\r\ndef _input(): return map(int, input().split())\r\n\r\nn = int(input())\r\nlst = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\nfor _ in range(n):\r\n s = input()\r\n if s == \"purple\": lst.remove(\"Power\")\r\n elif s==\"green\": lst.remove(\"Time\")\r\n elif s==\"blue\": lst.remove(\"Space\")\r\n elif s==\"orange\": lst.remove(\"Soul\")\r\n elif s == \"red\": lst.remove(\"Reality\")\r\n else: lst.remove(\"Mind\")\r\nprint(len(lst))\r\nprint(*lst, sep = '\\n')\r\n \r\n ", "n=int(input())\nm=6-n\ngauntlet={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\nsaw=list()\nfor i in range(n):\n gems=input()\n saw.append(gems)\nprint(m)\nfor gem,name in gauntlet.items():\n if gem not in saw:\n print(name)\n \t\t\t \t\t \t\t \t \t \t", "n = int(input())\r\n\r\ncolors = set(['red', 'green', 'blue', 'purple', 'yellow', 'orange'])\r\n\r\nstones = {'red': 'Reality', 'green': 'Time', 'blue': 'Space', 'purple': 'Power', 'yellow': 'Mind', 'orange': 'Soul'}\r\n\r\ntanos = set()\r\n\r\nfor i in range(n):\r\n tanos.add(input())\r\n\r\nres = colors.difference(tanos)\r\n\r\nprint(len(res))\r\n\r\nfor c in res:\r\n print(stones[c])\r\n", "c_dict = {'purple' : 'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\nn = int(input())\nfor i in range(n):\n u = input()\n del c_dict[u]\nprint(6-n)\nfor val in c_dict.values():\n print(val)\n \t\t \t\t \t\t \t\t\t \t\t\t \t \t\t\t \t", "n=int(input())\r\ngauntlet=[]\r\nfor i in range(n):\r\n gem=input()\r\n gauntlet.append(gem)\r\n \r\nprint(6-n)\r\nif(gauntlet.count(\"purple\")==0):\r\n print(\"Power\")\r\nif(gauntlet.count(\"yellow\")==0):\r\n print(\"Mind\")\r\nif(gauntlet.count(\"blue\")==0):\r\n print(\"Space\")\r\nif(gauntlet.count(\"red\")==0):\r\n print(\"Reality\")\r\nif(gauntlet.count(\"green\")==0):\r\n print(\"Time\")\r\nif(gauntlet.count(\"orange\")==0):\r\n print(\"Soul\")", "d={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nfor _ in range(int(input())):\r\n d.pop(input())\r\nprint(len(d))\r\nfor i in d:\r\n print(d[i])", "\r\ndiction = {\r\n\t'purple': 'Power',\r\n\t'green': 'Time',\r\n\t'blue': 'Space',\r\n\t'orange': 'Soul',\r\n\t'red': 'Reality',\r\n\t'yellow': 'Mind'\r\n}\r\n\r\nn = int(input())\r\na=[]\r\nfor i in range(n):\r\n\tx = input()\r\n\ta.append(x)\r\nans = []\r\nfor i in diction:\r\n\tif i not in a:\r\n\t\tans.append(diction[i])\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n\tprint(i)", "def main_function():\r\n dict = {\"Power\": \"purple\", \"Time\": \"green\", \"Space\": \"blue\", \"Soul\": \"orange\", \"Reality\": \"red\", \"Mind\": \"yellow\"}\r\n reversed_dict = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\n colours = []\r\n output_stones = []\r\n e = []\r\n t = int(input())\r\n for i in range(t):\r\n colour = input()\r\n colours.append(colour)\r\n for i in reversed_dict:\r\n if i not in colours:\r\n output_stones.append(i)\r\n for i in output_stones:\r\n e.append(reversed_dict[i])\r\n return str(len(e)) + \"\\n\" + \"\\n\".join(e)\r\n\r\nprint(main_function())", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n d = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'};\r\n s1 = set(d.keys())\r\n s2 = set()\r\n for _ in range(int(input())):\r\n s2.add(input())\r\n A = []\r\n for s in s1 - s2:\r\n A.append(d[s])\r\n print(len(A))\r\n for a in A:\r\n print(a)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na=[ \"purple\",\"red\",\"green\",\"blue\", \"orange\",\"yellow\"]\r\na.sort()\r\nb=[]\r\nc=[ ['Power','purple'], ['Time','green'],['Space','blue'],['Soul','orange'],['Reality','red'],['Mind','yellow'] ]\r\nc.sort()\r\nfor i in range(n):\r\n color=str(input())\r\n b.append(color)\r\nprint(6-n)\r\nfor i in a:\r\n if i not in b:\r\n for j in range(len(c)):\r\n if c[j][1]==i:\r\n print(c[j][0])\r\n \r\n \r\n\r\n ", "g={'purple':'Power','green':'Time','blue':'Space','red':'Reality','orange':'Soul','yellow':'Mind'}\r\nn=int(input())\r\ncolors=['purple','green','blue','red','orange','yellow']\r\nfor _ in range(n):\r\n\tc=input()\r\n\tcolors.remove(c)\r\nprint(int(6-n))\r\nfor i in colors:\r\n\tprint(g[i])", "n = int(input())\r\nd= {\"purple\" : \"Power\", \"green\" : \"Time\" , \"blue\" : \"Space\" , \"orange\" : \"Soul\" , \"red\" : \"Reality\" ,\"yellow\" : \"Mind\" }\r\nL = [ ]\r\nL1 = [\"purple\" ,\"green\",\"blue\" ,\"orange\" ,\"red\" ,\"yellow\"]\r\nfor i in range(n):\r\n \r\n s = input()\r\n L.append(s)\r\nfor k in range(len(L)):\r\n L1.remove(L[k]) \r\n# L2 = L1.remove(L)\r\nprint(len(L1))\r\nfor j in range(len(L1)):\r\n print(d[L1[j]])\r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n \r\n", "T = int(input())\r\ndic = {'p':'Power','g':'Time','b':'Space','o':'Soul','r':'Reality','y':'Mind'}\r\nlst = []\r\nfor i in range(T):\r\n s = input()\r\n lst.append(s[0])\r\nprint(len(dic)-T)\r\nfor i in dic.keys():\r\n if i not in lst:\r\n print(dic[i])", "n = int(input())\r\nchoco = []\r\nbisc = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\n\r\nfor i in range(n):\r\n choco.append(input())\r\n\r\nprint(6-n)\r\nfor i in bisc:\r\n if i not in choco:\r\n print(bisc[i])\r\n", "n1 = int(input())\r\nlist_have = []\r\ndict_all = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nfor i in range(n1):\r\n list_have.append(dict_all[input()])\r\n\r\nlist_all = [\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\n\r\nprint(6-len(list_have))\r\n\r\nfor i in list_all:\r\n if i not in list_have:\r\n print(i)\r\n", "infinity_gems = {\"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\":\"Reality\",\r\n \"yellow\":\"Mind\"}\r\n\r\nno_of_gems = int(input())\r\n\r\nwhile(no_of_gems>0):\r\n gem = input()\r\n infinity_gems.pop(gem)\r\n no_of_gems-=1\r\n\r\nprint(len(infinity_gems))\r\nfor i in infinity_gems:\r\n print(infinity_gems[i])\r\n", "tanos = [['Power', 'purple'], ['Time', 'green'], ['Space', 'blue'], ['Soul', 'orange'], ['Reality', 'red'], ['Mind', 'yellow']]\r\notv = [0]*6\r\nn = int(input())\r\nfor i in range(n):\r\n color = input()\r\n for j in range(6):\r\n if color == tanos[j][1]:\r\n otv[j] = tanos[j][0]\r\nprint(6-n)\r\nfor j in range(6):\r\n if otv[j] != tanos[j][0]:\r\n print(tanos[j][0])", "n=int(input())\r\n\r\nd={\r\n \"red\":\"Reality\",\r\n \"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"yellow\":\"Mind\"\r\n }\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\n\r\nprint(len(d)-len(l))\r\nfor x in d:\r\n if x not in l:\r\n print(d[x])\r\n", "n = int(input())\r\n\r\ngauntlet = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\n\r\nfor i in range(n):\r\n gem = input()\r\n\r\n del gauntlet[gem]\r\n\r\nprint(len(gauntlet))\r\n\r\n\r\nfor k, v in gauntlet.items():\r\n print(v)\r\n", "a={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn=int(input())\r\nfor z in range(n) :\r\n\ts=input()\r\n\tdel a[s]\r\nprint(6-n)\r\nfor z in a:\r\n\tprint(a[z])", "g = int(input())\r\n \r\ngems = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\n \r\nfor i in range(g):\r\n gems.pop(input())\r\n \r\nprint(6-g)\r\nfor j in gems:\r\n print(gems[j])", "lstClr = ['power','time','space','soul','reality','mind']\nlst = ['purple','green','blue','orange','red','yellow']\nlst2 = []\nn = int(input())\n\nfor i in range(n):\n s = input()\n lst2.append(s)\nlst3 = []\n\nfor i in range(6):\n if lst[i] not in lst2:\n lst3.append(lstClr[i])\nprint(len(lst3))\n\nfor i in lst3:\n ns = \"\"\n if i[0].islower:\n ns=i[0].upper()+i[1:len(i)]\n else:\n ns=i\n print(ns)\n\t \t\t\t\t \t\t\t \t \t\t\t \t \t \t", "n=int(input())\r\nl=[1,1,1,1,1,1]\r\ni=n\r\nwhile i:\r\n i-=1\r\n c=input()\r\n if(c==\"purple\"):\r\n l[0]=0\r\n elif(c==\"green\"):\r\n l[1] = 0\r\n elif(c==\"blue\"):\r\n l[2] = 0\r\n elif(c==\"orange\"):\r\n l[3] = 0\r\n elif(c==\"red\"):\r\n l[4] = 0\r\n else:\r\n l[5] = 0\r\nprint(6-n)\r\nif(l[0]==1):\r\n print(\"Power\")\r\nif(l[1] == 1):\r\n print(\"Time\")\r\nif(l[2] == 1):\r\n print(\"Space\")\r\nif(l[3] == 1):\r\n print(\"Soul\")\r\nif(l[4] == 1):\r\n print(\"Reality\")\r\nif(l[5] == 1):\r\n print(\"Mind\")", "n = int(input())\nmap = {'purple': 'Power',\n 'green': 'Time',\n 'blue': 'Space',\n 'orange': 'Soul',\n 'red': 'Reality',\n 'yellow': 'Mind'}\na = set()\nfor i in range(n):\n a.add(input())\na = set(map.keys()) - a\nprint(len(a))\nprint('\\n'.join([map[x] for x in a]))", "def s():\r\n n=int(input())\r\n gems=[]\r\n if n != 0:\r\n for i in range(n):\r\n gems.append(input())\r\n print(6-n)\r\n if \"purple\" not in gems:\r\n print(\"Power\")\r\n if \"green\" not in gems:\r\n print(\"Time\")\r\n if \"blue\" not in gems:\r\n print(\"Space\")\r\n if \"orange\" not in gems:\r\n print(\"Soul\")\r\n if \"red\" not in gems:\r\n print(\"Reality\")\r\n if \"yellow\" not in gems:\r\n print(\"Mind\")\r\n\r\ns()\r\n", "n=int(input())\r\ngame={\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\n# print(l) \r\nprint(len(game)-len(l))\r\nfor j in game:\r\n if j not in l:\r\n print(game[j])", "m = int(input())\r\nlst = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nlst2 = []\r\nfor i in range(m):\r\n ele = str(input())\r\n lst2.append(ele)\r\nlst1 = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nprint(6 - m)\r\nfor j in range(6):\r\n if lst[j] not in lst2:\r\n print(lst1[j])\r\n \r\n", "n = int(input())\nstones_meanings = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\nall_stones = {'purple','green','blue','orange','red','yellow'}\nstones = set() \nfor i in range(n):\n stones.add(str(input()))\n\nstones = all_stones - stones\nprint(len(stones))\nfor stone in stones:\n print(stones_meanings[stone])\n", "gems = [\"purple\", \"red\", \"yellow\", \"orange\", \"blue\", \"green\"]\n\nn = int(input())\n\nfor i in range(n):\n color = input()\n gems.remove(color)\n\nprint(len(gems))\n\nfor i in range(len(gems)):\n if gems[i] == \"red\":\n print(\"Reality\")\n elif gems[i] == \"blue\":\n print(\"Space\")\n elif gems[i] == \"purple\":\n print(\"Power\")\n elif gems[i] == \"green\":\n print(\"Time\")\n elif gems[i] == \"orange\":\n print(\"Soul\")\n elif gems[i] == \"yellow\":\n print(\"Mind\")", "import sys\r\n\r\ndef main():\r\n d = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n }\r\n _, *l = sys.stdin.read().strip().split()\r\n for i in l: del d[i]\r\n return [len(d)] + list(d.values())\r\n \r\nprint(*main(), sep='\\n')\r\n", "l1=[]\r\nl2=['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nt=int(input())\r\nfor i in range(t):\r\n s=input()\r\n l1.append(s)\r\nh=6-int(t) \r\nprint(h) \r\nfor a in l2:\r\n if a not in l1:\r\n if a=='purple':\r\n print(\"Power\")\r\n if a=='green':\r\n print(\"Time\")\r\n if a=='blue':\r\n print(\"Space\") \r\n if a=='orange':\r\n print(\"Soul\") \r\n if a=='red':\r\n print(\"Reality\") \r\n if a=='yellow':\r\n print(\"Mind\")", "n=int(input())\nb=['purple','green','blue','orange','red','yellow']\nc=['Power','Time','Space','Soul','Reality','Mind']\nd=[]\ne=[]\nfor i in range(n):\n a=input()\n d+=[b.index(a)]\nfor j in range(6):\n if j not in d:\n e+=[c[j]]\nprint(6-n)\nfor k in e:\n print(k)\n \t \t\t \t \t\t\t\t \t\t \t\t\t\t\t\t\t\t", "a = int(input())\nthanos = [['Power','purple'],['Time','green'],['Space','blue'],['Soul','orange'],['Reality','red'],['Mind','yellow']]\nl = []\nfor i in range(a):\n color = input()\n l.append(color)\nfor j in l:\n for i in thanos:\n if j == i[1]:\n thanos.remove(i)\nprint(len(thanos))\nfor i in thanos:\n print(i[0])\n \t\t \t \t\t \t\t \t \t \t\t \t \t", "n=int(input())\r\nd={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nprint(6-n)\r\nfor i in d:\r\n if i not in l:\r\n print(d[i])", "kol = int(input())\r\n\r\ndic = {'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'}\r\n\r\nr = []\r\ng = []\r\nmissing = 6 - kol\r\n\r\nfor k in range(kol):\r\n rocks = input()\r\n r.append(rocks)\r\n\r\nfor key in dic:\r\n if r.count(key) == 0:\r\n g.append(dic[key])\r\n\r\nprint(missing)\r\n\r\nfor stone in g:\r\n print(stone)", "gems = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\n\r\n\r\ndef missing(n, s):\r\n keys = list(gems.keys())\r\n values = list(gems.values())\r\n print(6 - n)\r\n for i in keys:\r\n if i not in s:\r\n print(values[keys.index(i)])\r\n\r\n\r\nnIn = int(input())\r\nsIn = []\r\nfor _ in range(nIn):\r\n sIn.append(input())\r\nmissing(nIn, sIn)\r\n", "a=['Power','Time','Space','Soul','Reality','Mind']\r\nb=['purple','green','blue','orange','red','yellow']\r\nn=int(input())\r\nres=[]\r\nfor i in range(n):\r\n s=input()\r\n res.append(b.index(s))\r\nprint(6-n)\r\nfor i in range(0,6):\r\n if i not in res:\r\n print(a[i])", "n = int(input())\r\nstr = list()\r\ngaunlet = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\n\r\nfor i in range(n):\r\n str.append(input())\r\n\r\nif n < 6:\r\n print(6-n)\r\nelif n==6:\r\n print(0)\r\n \r\n#print(str)\r\n#print(gaunlet)\r\n\r\nfor color, power in gaunlet.items():\r\n if color not in str:\r\n print(power)\r\n", "a = int(input())\r\nb = []\r\nprint(6 - a)\r\nfor i in range(a):\r\n b.append(str(input()))\r\nif 'green' not in b:\r\n print('Time')\r\nif 'red' not in b:\r\n print('Reality')\r\nif 'orange' not in b:\r\n print('Soul')\r\nif 'yellow' not in b:\r\n print('Mind')\r\nif 'blue' not in b:\r\n print('Space')\r\nif 'purple' not in b:\r\n print('Power')\r\n", "import sys\r\n\r\nn = int(input())\r\ninput_gems = sys.stdin.read().splitlines()\r\n\r\ngems = {'purple': 'Power', 'green': 'Time', 'blue': 'Space',\r\n 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\n\r\nfor i in range(n):\r\n if input_gems[i] in gems:\r\n del gems[input_gems[i]]\r\n\r\nprint(len(gems))\r\nfor key in gems.keys():\r\n print(gems[key])# 1690015006.9057133", "n=int(input());\r\nl=['purple','red','green','blue','orange','yellow']\r\nd={'purple':'Power','red':'Reality','orange':'Soul','yellow':'Mind','green':'Time','blue':'Space'}\r\ninp=[]\r\nfor i in range(n):\r\n inp.append(input())\r\nfor i in range(n):\r\n l.remove(inp[i])\r\nprint(len(l))\r\nfor i in range(len(l)):\r\n print(d[l[i]])", "n=int(input())\r\nif n==6:\r\n print(\"0\")\r\nelse:\r\n mydict={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\n z=[]\r\n for i in range(n):\r\n a=input()\r\n z+=a,\r\n print(6-n)\r\n for i in mydict:\r\n if i not in z:\r\n print(mydict[i])\r\n \r\n \r\n \r\n ", "gem = {\"purple\" : \"Power\" , \"green\" : \"Time\" , \"blue\" : \"Space\" , \"orange\" : \"Soul\" , \"red\" : \"Reality\" , \"yellow\" : \"Mind\"}\r\nt = int(input())\r\nwhile t > 0 :\r\n t-= 1\r\n x = input()\r\n if x in gem.keys() :\r\n del gem[x]\r\nprint(len(gem.keys()))\r\nfor k,v in gem.items() :\r\n print(v)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\ny = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\ns = set([input().rstrip() for _ in range(n)])\r\nans = []\r\nfor i, j in zip(x, y):\r\n if not i in s:\r\n ans.append(j)\r\nm = len(ans)\r\nprint(m)\r\nsys.stdout.write(\"\\n\".join(ans))", "t = int(input())\r\nvr = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nfor i in range(t):\r\n a = input()\r\n if a in vr:\r\n vr.pop(vr.index(a))\r\nprint(6 - t)\r\nfor i in range(6 - t):\r\n if vr[i] == 'purple':\r\n print('Power')\r\n elif vr[i] == 'green':\r\n print('Time')\r\n elif vr[i] == 'blue':\r\n print('Space')\r\n elif vr[i] == 'orange':\r\n print('Soul')\r\n elif vr[i] == 'red':\r\n print('Reality')\r\n else:\r\n print('Mind')\r\n", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef listinput(): return list(map(int, sys.stdin.readline().strip().split())) \r\nn=iinput()\r\ncolor=['purple','green','blue','orange','red','yellow']\r\ngem=['Power','Time','Space','Soul','Reality','Mind']\r\nfor _ in range(n):\r\n s=input()\r\n indexofcolor=color.index(s)\r\n color.remove(s)\r\n gem.pop(indexofcolor)\r\nprint(len(gem))\r\nfor i in gem:\r\n print(i)", "di = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\nli = []\nn = int(input())\nfor _ in range(n):\n color = input()\n li.append(color)\nprint(6-n)\nfor key,val in di.items():\n if key not in li:\n print(val)\n\t\t \t \t \t\t\t\t\t \t \t\t\t \t \t \t\t\t\t", "a=int(input())\r\nc = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\nfor i in range(a):\r\n c.pop(input())\r\nprint(6-a)\r\nfor i in c:\r\n print(c[i])\r\n", "i = int(input())\ntm = 6 - i\ncolors = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\ndit = {\n 'purple': 'Power',\n 'green': 'Time',\n 'blue': 'Space',\n 'orange': 'Soul',\n 'red': 'Reality',\n 'yellow': 'Mind'\n }\n\ndef print_mod():\n string = ''\n for j in colors:\n string += dit[j] + '\\n'\n string = string[:-1]\n print(f'{tm}\\n{string}')\n\nif tm == 6:\n print_mod()\nelse:\n for i in range(i):\n color = input()\n index = colors.index(color)\n colors.pop(index)\n print_mod()\n\t\t \t\t \t \t\t\t\t \t \t\t \t \t\t\t", "n = int(input())\r\ndt = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\nlst = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\n\r\nfor i in range(n):\r\n lst.remove(dt[input()])\r\nprint(6-n)\r\nfor j in lst:\r\n print(j)\r\n", "dicc={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\n\nuser=int(input())\nfor i in range(user):\n user2=input()\n dicc.pop(user2)\n \nprint(len(dicc))\nfor i,j in dicc.items():\n print(j)\n \t \t\t\t\t\t \t\t \t \t \t\t \t \t\t", "dic = {'purple':'Power', 'green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nprint(6-len(a))\r\nfor i in dic:\r\n if i not in a:\r\n print(dic[i])", "#Codeforce 987A\r\ndict1={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"} \r\nlist1=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nlist2=[]\r\nx=int(input())\r\nfor i in range(x):\r\n gem=input().strip(\"\\n\\r\")\r\n list1.remove(gem)\r\nprint(len(list1))\r\nfor j in range(len(list1)):\r\n print(dict1[list1[j]])", "a = []\r\nb = ['p', 'g', 'b', 'o', 'r', 'y']\r\nans = ''\r\n\r\nfor n in range(int(input())):\r\n s = input()\r\n a.append(s[0])\r\n\r\nfor i in a:\r\n b.remove(i)\r\n\r\nprint(len(b))\r\nfor j in b:\r\n if j == 'p':\r\n print(\"Power\")\r\n elif j == 'g':\r\n print(\"Time\")\r\n elif j == 'b':\r\n print(\"Space\")\r\n elif j == 'o':\r\n print(\"Soul\")\r\n elif j == 'r':\r\n print(\"Reality\")\r\n else:\r\n print(\"Mind\") ", "t= int(input())\nlistx = []\n\ndic={'green': 'Time', 'yellow': 'Mind', 'orange': 'Soul', 'purple': 'Power', 'red': 'Reality', 'blue': 'Space'}\nif t==0:\n print(len(dic.values()))\n for x in dic.values():\n print(x)\nelse:\n for i in range(t):\n user = input()\n listx.append(user)\n print(len(dic.values()) - t)\n for i, j in dic.items():\n if i not in listx:\n print(j)\n\n\n \t\t\t\t\t \t\t\t\t \t\t\t \t\t \t\t\t\t \t \t", "stone = {\"purple\" : \"Power\", \"green\": \"Time\", \"blue\" : \"Space\", \"orange\" : \"Soul\", \"red\" : \"Reality\", \"yellow\" : \"Mind\"}\nn = 6\ngiven = []\nfor num in range(int(input())) :\n user = input()\n given.append(user)\n\nprint(n - len(given))\nfor item in stone :\n if item not in given :\n print(stone[item])\n \t \t\t \t\t \t \t\t\t \t\t\t \t \t", "n=int(input())\r\nif n<=6:\r\n a=[]\r\n for i in range(n):\r\n a.append(input())\r\nprint(6-n)\r\nif \"red\" not in a:\r\n print(\"Reality\")\r\n \r\nif \"yellow\" not in a:\r\n print(\"Mind\")\r\n\r\nif \"orange\" not in a:\r\n print(\"Soul\")\r\n\r\nif \"blue\" not in a:\r\n print(\"Space\")\r\n\r\nif \"green\" not in a:\r\n print(\"Time\")\r\n\r\nif \"purple\" not in a:\r\n print(\"Power\")\r\n", "dict1 = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\nn = int(input())\r\nfor i in range(0, n):\r\n key = input()\r\n del dict1[key]\r\nprint(6-n)\r\nfor p in dict1:\r\n print(dict1[p])\r\n", "gauntlet={\"purple\":\"Power\",\r\n\"green\":\"Time\",\r\n\"blue\":\"Space\",\r\n\"orange\":\"Soul\",\r\n\"red\":\"Reality\",\r\n\"yellow\":\"Mind\"}\r\n\r\nn=int(input())\r\n\r\nfor i in range(n):\r\n s=input()\r\n del gauntlet[s]\r\n\r\nprint(6-n)\r\n\r\nfor i in gauntlet: \r\n print(gauntlet[i])", "dic = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\ninpint = int(input())\nfor num in range(inpint):\n color = input()\n dic.pop(color)\nprint(6-inpint)\nfor values in dic.values():\n print(values)\n\t\t \t \t \t \t \t\t\t \t \t", "dic={\"green\":\"Time\",\"yellow\":\"Mind\",\"orange\":\"Soul\",\"purple\":\"Power\",\"red\":\"Reality\",\"blue\":\"Space\"}\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n dic.pop(s)\r\nprint(6-n)\r\nfor x in dic:\r\n print(dic[x])\r\n", "allcolor=['purple','green','blue','orange','red','yellow']\r\nop=['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nn=int(input())\r\nipcolor=[]\r\nfor i in range(0,n):\r\n color=input()\r\n ipcolor.append(color)\r\ndiff=list(set(allcolor) - set(ipcolor))\r\nprint(len(diff))\r\nfor i in range(0,len(diff)):\r\n print(op[allcolor.index(diff[i])])", "dic={\"Power\":\"purple\",\"Time\":\"green\",\"Space\":\"blue\",\"Soul\": \"orange\",\n\"Reality\": \"red\", \"Mind\" :\"yellow\" }\nt=int(input())\nl=[]\nfor i in range(t):\n a=input()\n l.append(a)\nprint(6-t)\nfor k,v in dic.items():\n if dic[k] not in l:\n print(k)\n \t \t\t \t \t \t \t\t\t\t \t \t\t\t\t", "n = int(input())\r\ncolors_left = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nvals = {\r\n\t'purple' : 'Power',\r\n\t'green' : 'Time',\r\n\t'blue' : 'Space',\r\n\t'orange' : 'Soul',\r\n\t'red' : 'Reality',\r\n 'yellow' : 'Mind'\r\n}\r\n\r\nfor i in range(n) :\r\n c = input()\r\n colors_left.remove(c)\r\nprint(6-n)\r\nfor i in colors_left :\r\n print(vals[i])\r\n", "n = int(input())\r\nclrs = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\"red\": \"Reality\", \"yellow\": \"Mind\"}\r\n\r\nfor _ in range(n):\r\n req = input()\r\n del clrs[req]\r\n\r\nprint(len(clrs))\r\nfor val in clrs.values():\r\n print(val)\r\n", "gems_saw = int(input())\r\n\r\ngems_seen_color = []\r\n\r\nfor i in range(gems_saw):\r\n gems_seen_color.append(str(input()))\r\n\r\ngem_color = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\n\r\nall_colors = ['purple','green','blue','orange', 'red', 'yellow']\r\n\r\n \r\n# print(gems_seen_color)\r\n\r\nif( gems_saw < 6 ):\r\n not_seen_color = set(all_colors).difference(gems_seen_color)\r\n print_gems = [gem_color.get(x) for x in list(not_seen_color)]\r\n # print(print_gems) \r\n\r\n print(len(print_gems))\r\n for gem in (print_gems):\r\n print(gem)\r\nelse:\r\n print('0')", "# from collections import defaultdict, deque, Counter\n# from sortedcontainers import SortedDict, SortedList, SortedSet\n# import bisect\n# from heapq import heappop, heappush\n# =======================================\n\nI = lambda : map(int, input().split())\n\n# ========================================\n\n# T = int(input())\n\nD = dict()\nD['purple'] = 'Power'\nD['green'] = 'Time'\nD['blue'] = 'Space'\nD['orange'] = 'Soul'\nD['red'] = 'Reality'\nD['yellow'] = 'Mind'\n\n\nfor _ in range(1):\n N = int(input())\n gauntlet = set()\n for _ in range(N):\n col = str(input())\n gauntlet.add(col)\n \n print(len(D)-N)\n for col,gem in D.items():\n if col not in gauntlet:\n print(gem)\n \n'''\n\n'''\n", "# LUOGU_RID: 101739808\nd = {'purple': 'Power', 'green': 'Time', 'blue': 'Space',\r\n 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nfor _ in range(int(input())):\r\n d.pop(input())\r\nprint(len(d), *d.values(), sep='\\n')\r\n", "d={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nl=[]\r\nk=[]\r\nm=d.keys()\r\nfor _ in range(int(input())):\r\n l.append(input(''))\r\nfor i in m:\r\n if i not in l:\r\n k.append(d[i])\r\nprint(len(k))\r\nprint('\\n'.join(k))", "stones = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\n\r\nn = int(input(\"\"))\r\nstones_there = []\r\nstones_not_there = []\r\n\r\nfor i in range(0, n):\r\n color = input(\"\")\r\n stones_there.append(color)\r\n\r\nfor key in stones:\r\n if key not in stones_there:\r\n stones_not_there.append(stones[key])\r\n\r\nprint(len(stones_not_there))\r\nfor stone in stones_not_there:\r\n print(stone)\r\n", "n = int(input())\ncolors = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\ngems = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\ngiven = []\nif n != 0:\n for i in range(n):\n temp = input()\n given.append(temp)\n \nprint(6-n)\nfor i in range(6):\n if colors[i] not in given:\n print(gems[i])\n\t \t \t \t \t \t\t\t \t\t\t\t\t \t \t \t", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nc = ['p', 'g', 'b', 'o', 'r', 'y']\r\nb = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nn = int(inpu())\r\na = [0]*n\r\nfor i in range(n) :\r\n a[i] = inpu()[0]\r\nans = []\r\nfor i in range(6) :\r\n if c[i] not in a :\r\n ans.append(b[i])\r\nprin(str(len(ans)) + '\\n')\r\nprin('\\n'.join(map(str, ans)) + '\\n')", "n = int(input())\r\ntotal = 6\r\n\r\ncolor =['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\n\r\nstones = ['power', 'time', 'space', 'soul', 'reality', 'mind']\r\n\r\nspacepresent =[]\r\n\r\nabsentstones = []\r\n\r\nm=0\r\n\r\nfor i in range(n):\r\n spacepresent.append(input())\r\n\r\nfor i in range(6):\r\n if color[i] not in spacepresent:\r\n m +=1\r\n absentstones.append(stones[i])\r\n \r\nprint(m)\r\nfor i in absentstones:\r\n print(i.capitalize())\r\n \r\n \r\n", "lst = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\nlst1 = []\r\nn = int(input())\r\nfor i in range(n):\r\n x = input()\r\n if x == \"purple\":\r\n x = \"Power\"\r\n elif x == \"green\":\r\n x = \"Time\"\r\n elif x == \"blue\":\r\n x = \"Space\"\r\n elif x == \"yellow\":\r\n x = \"Mind\"\r\n elif x == \"orange\":\r\n x = \"Soul\"\r\n else:\r\n x = \"Reality\"\r\n lst1.append(x)\r\na = [i for i in lst if i not in lst1]\r\nprint(len(a))\r\nfor i in a:\r\n print(i)\r\n\r\n ", "d = {\"purple\":\"Power\", \"green\":'Time', \"blue\":'Space', \"orange\":'Soul', \"red\":'Reality',\"yellow\":'Mind'}\r\nl = []\r\nn = int(input())\r\nfor _ in range(n):\r\n colors = input().lower()\r\n l.append(colors)\r\nprint(6-n)\r\nfor i in d.keys():\r\n if(i not in l):\r\n print(d.get(i))", "n = int(input())\r\n\r\nmy_dict = {'red':'Reality', 'purple':'Power','green':'Time','orange':'Soul','yellow':'Mind','blue':'Space'}\r\nr = 6-n\r\nlst = []\r\nwhile n>0:\r\n color = input()\r\n lst.append(color)\r\n n-=1\r\n\r\nprint(r) \r\nfor key, value in my_dict.items():\r\n if key not in lst:\r\n print(value)", "gems_dict = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nli1 = []\r\n\r\nfor i in range(int(input())):\r\n li1.append(input())\r\n \r\nprint(len(gems_dict)-len(li1))\r\nfor i in gems_dict.keys():\r\n if i not in li1:\r\n print(gems_dict[i])", "gems = {'purple':'Power','green':'Time','blue':'Space',\r\n 'orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn = int(input())\r\ncolor = {input() for i in range(n)}\r\nneed = list(set(gems.keys()) - color)\r\nprint(6 - n)\r\nfor i in need:\r\n print(gems[i])", "n = int(input())\r\n\r\nstones_dict = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\nstones_list = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\n\r\nfor _ in range(n):\r\n\r\n stone_color = input()\r\n stones_list.remove(stone_color)\r\n \r\nprint(6 - n)\r\n\r\nfor _ in range(6 - n):\r\n print(stones_dict[stones_list[_]])\r\n", "dict = {\"purple\":\"Power\",\r\n \"green\" :\"Time\",\r\n \"blue\" :\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\" :\"Reality\",\r\n \"yellow\":\"Mind\"}\r\nmatrix = [\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\n\r\nfor x in range(int(input())):\r\n matrix.remove(input())\r\n\r\nprint(len(matrix))\r\n\r\nfor y in matrix:\r\n print(dict[y])", "d=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\ngem=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\nn=int(input())\nl=[]\nfor i in range(n):\n x=input()\n l.append(x)\nm=[]\nfor i in d:\n if i not in l:\n m.append(gem[d.index(i)])\nprint(6-n)\nfor i in m:\n print(i)\n", "n = int(input())\r\nl = []\r\nprint(6-n)\r\nfor i in range(n):\r\n c = input()\r\n l.append(c)\r\nif \"purple\" not in l:\r\n print(\"Power\")\r\nif \"green\" not in l:\r\n print(\"Time\")\r\nif \"blue\" not in l:\r\n print(\"Space\")\r\nif \"orange\" not in l:\r\n print(\"Soul\")\r\nif \"red\" not in l:\r\n print(\"Reality\")\r\nif \"yellow\" not in l:\r\n print(\"Mind\")\r\n", "n = int(input())\r\nwarna = [\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nskill = [\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nhasil = []\r\nskillB = []\r\nfor i in range(n):\r\n color = input()\r\n for j in range(len(warna)):\r\n if warna[j] == color:\r\n hasil += [skill[j]]\r\n\r\nfor i in skill:\r\n if i in hasil:\r\n continue\r\n else:\r\n skillB += [i]\r\n\r\nprint(len(skillB))\r\nfor i in skillB:\r\n print(i)\r\n\r\n\r\n\r\n", "a = ['Power','Time','Space','Soul','Reality','Mind']\r\nb = ['purple','green','blue','orange','red','yellow']\r\ncount = 0\r\nfor _ in range(int(input())):\r\n\ts = input()\r\n\ta.remove(a[b.index(s)])\r\n\tb.remove(b[b.index(s)])\r\n\tcount+=1\r\nprint(6-count)\r\nfor i in a:\r\n\tprint(i)", "n = int(input())\r\nl = [['purple', 'Power'],['green', 'Time'],['blue', 'Space'],['orange', 'Soul'],['red', 'Reality'],['yellow', 'Mind']]\r\nfor i in range(n):\r\n s = input()\r\n for j in range(len(l)):\r\n if l[j][0] == s:\r\n l.pop(j)\r\n break\r\nprint(len(l))\r\nfor i in range(len(l)):\r\n print(l[i][1])", "def main():\r\n gems = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n }\r\n n = int(input())\r\n full_set = set(stones for stones in gems.keys())\r\n avail = set()\r\n for _ in range(n):\r\n avail.add(input())\r\n\r\n not_avail = full_set - avail\r\n print(len(not_avail))\r\n for stone in not_avail:\r\n print(gems[stone])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = int(input())\r\n\r\nh = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\",\r\n \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nl = []\r\nfor x in range(a):\r\n z = input()\r\n l.append(z)\r\n\r\nprint(6-a)\r\nfor i in h:\r\n x = i\r\n y = h[i]\r\n if x not in l:\r\n print(y)\r\n", "n = int(input())\r\narr = []\r\n\r\nfor _ in range(n):\r\n st = input()\r\n arr.append(st)\r\n \r\ndict = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\n\r\nprint(6-n)\r\n\r\nfor i in dict.keys():\r\n if i not in arr:\r\n print(dict[i])\r\n", "n=int(input())\r\ncolors=[input() for _ in range(n)]\r\nstones={'purple':'Power','green':'Time','blue':'Space',\r\n 'orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in colors:\r\n del stones[i]\r\n\r\nprint(len(stones))\r\nfor i in stones:\r\n print(stones[i])", "stones = {\"purple\": 'Power', \"green\": \"Time\", \"blue\": \"Space\",\r\n \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"\r\n }\r\n\r\nn = int(input())\r\npresent = [input() for _ in range(n)]\r\nfor p in present:\r\n del stones[p]\r\nprint(6-n)\r\nprint(*(stones.values()), sep=\"\\n\")", "li=[\"Power\",'Time','Space','Soul','Reality','Mind']\r\ngi={'purple':'Power' ,'green':'Time', 'blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn=int(input())\r\nfor i1 in range(n):\r\n li.remove(gi[input()])\r\nprint(len(li))\r\nfor i in li:\r\n print(i)", "n=int(input())\r\np=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nc=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nfor t in range(n):\r\n color=input()\r\n p.pop(c.index(color))\r\n c.remove(color)\r\n \r\nprint(6-n)\r\nfor i in p: print(i)\r\n", "n = int(input())\r\nd = {}\r\nd1 = {}\r\nd[\"red\"] = 1\r\nd[\"purple\"] = 1\r\nd[\"blue\"] = 1\r\nd[\"orange\"] = 1\r\nd[\"green\"] = 1\r\nd[\"yellow\"] = 1\r\nd1[\"red\"] = \"Reality\"\r\nd1[\"purple\"] = \"Power\"\r\nd1[\"blue\"] = \"Space\"\r\nd1[\"orange\"] = \"Soul\"\r\nd1[\"green\"] = \"Time\"\r\nd1[\"yellow\"] = \"Mind\"\r\nsp = []\r\nans = []\r\nfor i in range(n):\r\n tmp = input().strip()\r\n d[tmp] = 0\r\nfor i in d.keys():\r\n if d[i] != 0:\r\n sp.append(i)\r\nfor key in sp:\r\n ans.append(d1[key])\r\nprint(len(ans))\r\nprint(\"\\n\".join(ans))", "a={\r\n\t\"purple\":\"Power\",\r\n\t\"green\":\"Time\",\r\n\t\"blue\":\"Space\",\r\n\t\"orange\":\"Soul\",\r\n\t\"red\":\"Reality\",\r\n\t\"yellow\":\"Mind\"\r\n}\r\nb=[]\r\nn=int(input())\r\nfor x in range(n):\r\n\tb.append(input())\r\ns=0\r\nc=[]\r\nfor x in a:\r\n\tif x not in b:\r\n\t\ts+=1\r\n\t\tc.append(a[x])\r\nprint(s)\r\nfor x in range(len(c)):\r\n\tprint(c[x])", "gems = {'Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind'}\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n color = input().capitalize()\r\n if color == 'Purple':\r\n gems.remove('Power')\r\n elif color == 'Green':\r\n gems.remove('Time')\r\n elif color == 'Blue':\r\n gems.remove('Space')\r\n elif color == 'Orange':\r\n gems.remove('Soul')\r\n elif color == 'Red':\r\n gems.remove('Reality')\r\n elif color == 'Yellow':\r\n gems.remove('Mind')\r\n\r\nprint(len(gems))\r\nfor gem in gems:\r\n print(gem)\r\n", "mp = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\nn = int(input())\r\nwhile n:\r\n s = input()\r\n del mp[s]\r\n n -= 1\r\nprint(len(mp))\r\nfor value in mp.values():\r\n print(value)", "n = int(input())\n\nm = {\n \"purple\": \"Power\",\n \"green\": \"Time\",\n \"blue\": \"Space\",\n \"orange\": \"Soul\",\n \"red\": \"Reality\",\n \"yellow\": \"Mind\"\n}\n\ncontained = []\nfor i in range(n):\n name = input()\n contained.append(name)\n\nmissing = []\n \n \nfor k, v in m.items():\n if k not in contained:\n missing.append(v)\n\nprint(len(missing))\nfor mi in missing:\n print(mi) \n", "# LUOGU_RID: 130845067\n#6种宝石\r\n\r\n'''\r\ndef solution1():\r\nn=eval(input())\r\npower=['Power','Time','Space','Soul','Reality','Mind']\r\ncolor=['purple','green','blue','orange','red','yellow']\r\nsign=[0,0,0,0,0,0]\r\na=list()\r\nif n==0:\r\n print(6)\r\n for i in range(0,6):\r\n print(power[i])\r\nelse:\r\n for i in range(0,n):\r\n a.append(input())\r\n\r\n for i in range(0,n):\r\n sign[color.index(a[i])]=1\r\n print(6-n)\r\n for i in range(0,n):\r\n if sign[i]==0:\r\n print(power[i])\r\n'''\r\n\r\nn=eval(input())\r\npower=['Power','Time','Space','Soul','Reality','Mind']\r\ncolor=['purple','green','blue','orange','red','yellow']\r\nif n==0:\r\n print(6)\r\n for i in range(0,6):\r\n print(power[i])\r\nelse:\r\n print(6-n)\r\n for i in range(0,n):\r\n s=input()\r\n index=color.index(s)\r\n power[index]=\"\"\r\n for i in range(0,6):\r\n if power[i]==\"\":\r\n continue\r\n print(power[i])\r\n", "n=int(input())\r\nl=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nc=[0,1,2,3,4,5]\r\nfor i in range(n):\r\n x=input()\r\n if x==\"purple\": c.pop(c.index(0))\r\n elif x==\"green\": c.pop(c.index(1))\r\n elif x==\"blue\": c.pop(c.index(2))\r\n elif x==\"orange\": c.pop(c.index(3))\r\n elif x==\"red\": c.pop(c.index(4))\r\n elif x==\"yellow\": c.pop(c.index(5))\r\nprint(len(c))\r\nfor i in c:\r\n print(l[i])\r\n", "a = dict()\r\na['purple'] = 'Power'\r\na['green'] = 'Time'\r\na['blue'] = 'Space'\r\na['orange'] = 'Soul'\r\na['red'] = 'Reality'\r\na['yellow'] = 'Mind'\r\nfor _ in range(int(input())):\r\n s = input()\r\n del a[s]\r\nprint(len(a))\r\nfor x in a.values():\r\n print(x)", "n = int(input())\ntests = []\ngems = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\nfor i in range(n):\n del gems[input()]\nprint(len(gems))\nfor i in gems:\n print(gems[i])\n\n\n\t \t \t \t \t \t\t \t\t \t \t \t \t", "n=int(input())\r\ns=['Power','Time','Space','Soul','Reality','Mind']\r\nfor _ in range(n):\r\n i=input()\r\n if(i=='purple'):\r\n s.remove('Power')\r\n elif(i=='green'):\r\n s.remove('Time')\r\n elif(i=='blue'):\r\n s.remove('Space')\r\n elif(i=='orange'):\r\n s.remove('Soul')\r\n elif(i=='red'):\r\n s.remove('Reality')\r\n elif(i=='yellow'):\r\n s.remove('Mind')\r\nprint(len(s))\r\nfor i in range(len(s)):\r\n print(s[i])\r\n ", "s = int(input())\nrslt = [\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\nfin = []\nfor i in range(0,s):\n\tz = input()\n\tfin.append(z)\nfor j in fin:\n\tif j in rslt:\n\t\trslt.remove(j)\nprint(len(rslt))\nfor k in rslt:\n\tif k == \"green\":\n\t\tprint(\"Time\")\n\telif k == \"yellow\":\n\t\tprint(\"Mind\")\n\telif k == \"orange\":\n\t\tprint(\"Soul\")\n\telif k == \"purple\":\n\t\tprint(\"Power\")\n\telif k == \"red\":\n\t\tprint(\"Reality\")\n\telif k == \"blue\":\n\t\tprint(\"Space\")\n\t\t \t\t \t \t \t \t \t\t \t\t\t", "n=int(input())\r\nv=[]\r\nl=[]\r\no=[]\r\nd={'purple':\"Power\",'green':\"Time\",'blue':\"Space\",'orange':\"Soul\",'red':\"Reality\",'yellow':\"Mind\"}\r\nfor i in range(n):\r\n\ts=input()\r\n\tv.append(s)\r\nfor i in d:\r\n\tif i not in v:\r\n\t\to.append(d[i])\r\n# print(*o)\r\nprint(len(o))\r\nfor i in o:\r\n\tprint(i)", "t = int(input())\r\ndict = {\r\n \"purple\" : \"Power\" ,\r\n \"green\":\"Time\" ,\r\n \"blue\": \"Space\" , \r\n \"orange\" :\"Soul\" ,\r\n \"red\": \"Reality\",\r\n \"yellow\" : \"Mind\" }\r\n\r\ndata = [] \r\nfor i in range (t) : \r\n data.append(input())\r\nres = []\r\nfor i in dict : \r\n if i not in data : \r\n res.append(dict[i])\r\nprint(len(res))\r\nfor i in res : \r\n print(i)", "n=int(input())\r\n\r\nd={\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\" : \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\nl=[]\r\nfor i in range(0,n):\r\n x=input()\r\n l.append(x)\r\nprint(6-n)\r\nfor i in d.keys():\r\n if i not in l:\r\n print(d[i])\r\n", "dicti = {\"purple\" : \"Power\", \"green\" : \"Time\" ,\r\n \"blue\" : \"Space\" , \"orange\" : \"Soul\" ,\r\n \"red\" : \"Reality\" ,\r\n \"yellow\" : \"Mind\" }\r\nn = int(input())\r\ncolor = []\r\nfor i in range(n):\r\n color.append(input())\r\nans = []\r\nfor i in dicti:\r\n if i not in color:\r\n ans.append(dicti[i])\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i)", "dic = {\"purple\":\"Power\", \"red\":\"Reality\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"yellow\":\"Mind\"}\r\nn = int(input())\r\ns = set()\r\nwhile n != 0:\r\n str = input()\r\n s.add(str)\r\n n -= 1\r\nif 6 - len(s) != 0:\r\n print(6-len(s))\r\n for i in dic:\r\n if i not in s:\r\n print(dic[i])\r\nelse: print(0)\r\n\r\n\r\n# C O M F O R T A B L Y N U M B\r\n", "n = int(input())\nS = {'Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind'}\nd = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\n\nfor i in range(n):\n s = str(input())\n S.remove(d[s])\nprint(len(S))\nprint(*S, sep='\\n')\n", "n = int(input())\r\nhm = []\r\ngems = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\nfor i in range(n):\r\n s = input()\r\n if(s == \"purple\"):\r\n hm += [\"Power\"]\r\n elif(s == \"green\"):\r\n hm += [\"Time\"]\r\n elif (s == \"blue\"):\r\n hm += [\"Space\"]\r\n elif(s == \"orange\"):\r\n hm += [\"Soul\"]\r\n elif(s == \"red\"):\r\n hm += [\"Reality\"]\r\n elif(s == \"yellow\"):\r\n hm += [\"Mind\"]\r\nhasil = []\r\nprint(len(gems) - len(hm))\r\nfor i in range(len(gems)):\r\n if(gems[i] not in hm):\r\n print(gems[i])\r\n\r\n", "a = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nt = int(input())\r\nfor x in range(t):\r\n s = input()\r\n del a[s]\r\nprint(6-t)\r\nfor x in a:\r\n print(a[x])", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nm=[]\nl={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\nn=int(input())\nfor x in range(n):\n\tm.append(input().strip())\nprint(6-n)\nfor x in l:\n\tif x not in m:\n\t\tprint(l[x])", "d = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\",\r\n}\r\n\r\nall_colors = list(d.keys())\r\n\r\nn = int(input())\r\ncolors = [input() for i in range(n)]\r\n\r\nprint(len(d) - len(colors))\r\nfor color in all_colors:\r\n if color not in colors:\r\n print(d[color])\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(0,n):\r\n a=input()\r\n l.append(a)\r\ns=['Power','Time','Space','Soul','Reality','Mind']\r\nc=['purple','green','blue','orange','red','yellow']\r\nprint(6-n)\r\nfor x,y in zip(s,c):\r\n if y not in l:\r\n print(x)\r\n", "d = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn = int(input())\r\nlst = []\r\nfor i in range(1,n+1):\r\n s = input()\r\n lst.append(s)\r\nif (len(lst) == 0):\r\n print(6)\r\n for i in d.values():\r\n print(i)\r\nelse:\r\n ls = list(d.keys())\r\n for i in lst:\r\n if (i in ls):\r\n ls.remove(i)\r\n print(len(ls))\r\n for i in ls:\r\n if (i == \"purple\"):\r\n print(\"Power\")\r\n \r\n elif (i==\"green\"):\r\n print(\"Time\")\r\n elif (i==\"blue\"):\r\n print(\"Space\")\r\n \r\n elif(i==\"orange\"):\r\n print(\"Soul\")\r\n elif (i==\"red\"):\r\n print(\"Reality\")\r\n elif (i==\"yellow\"):\r\n print(\"Mind\")\r\n\r\n", "n = int(input());\r\n#b = []\r\nk = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(n):\r\n m = input()\r\n del k[m] \r\n#count=0\r\n#ct=0\r\n#a = ['purple','green','blue','orange','red','yellow']\r\n#\r\n#k = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\n''''''\r\nprint(6-n)\r\n\r\nfor i in k:\r\n print(k[i],\"\\n\")\r\n\r\n\r\n'''\r\nfor i in range(0,6):\r\n count=0\r\n for j in range(0,n):\r\n if(a[i]!=b[j]):\r\n count+=1\r\n print(count)\r\n if(count==n):\r\n m = a[j];\r\n print(k.get(\"m\"))'''\r\n \r\n", "m=int(input())\r\nl=[]\r\nfor i in range(0,m):\r\n s=str(input())\r\n l.append(s)\r\nl=set(l)\r\nprint(6-len(l))\r\nif \"purple\" not in l:\r\n print(\"Power\")\r\nif \"green\" not in l:\r\n print(\"Time\")\r\nif \"blue\" not in l:\r\n print(\"Space\")\r\nif \"orange\" not in l:\r\n print(\"Soul\")\r\nif \"red\" not in l:\r\n print(\"Reality\")\r\nif \"yellow\" not in l:\r\n print(\"Mind\")", "# maa chudaaye duniya\r\nmp = {'purple': 'Power', 'green' :'Time', 'blue' : 'Space', 'orange' : 'Soul', 'yellow' : 'Mind', 'red' : 'Reality'}\r\nn = int(input())\r\nz = []\r\nans = []\r\nfor i in range(n):\r\n z.append(input())\r\nfor i in mp:\r\n if i in z:\r\n pass\r\n else:\r\n ans.append(mp[i])\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i)", "dic={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n color=input()\r\n l.append(color)\r\n\r\nm=6-n\r\nprint(m)\r\nfor i in dic.keys():\r\n if i in l:\r\n continue\r\n else:\r\n print(dic[i])", "l=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\tif s==\"red\":\r\n\t\tl.remove(\"Reality\")\r\n\telif s==\"purple\":\r\n\t\tl.remove(\"Power\")\r\n\telif s==\"green\":\r\n\t\tl.remove(\"Time\")\r\n\telif s==\"blue\":\r\n\t\tl.remove(\"Space\")\r\n\telif s==\"orange\":\r\n\t\tl.remove(\"Soul\")\r\n\telse:\r\n\t\tl.remove(\"Mind\")\r\nprint(len(l))\r\nprint(*l,sep=\"\\n\")", "n = int(input())\r\ndict = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\ncolors = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nfor i in range(n):\r\n color = input() \r\n if color in colors:\r\n colors.remove(color)\r\n\r\nprint(len(colors))\r\nfor color in colors:\r\n print(dict[color])", "n = int(input())\r\np = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nc = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\ns = []\r\nfor i in range(n):\r\n x = input().strip()\r\n s.append(x)\r\nprint(6 - n)\r\nfor i in range(6):\r\n if c[i] not in s:\r\n print(p[i])\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nd=['red','purple','yellow','orange','blue','green']\r\nm=['Reality','Power','Mind','Soul','Space','Time']\r\nr=0\r\nt=[]\r\nfor i in d:\r\n if i not in l:\r\n q=d.index(i)\r\n r+=1\r\n t.append(m[q])\r\nprint(r)\r\nfor i in range(len(t)):\r\n print(t[i])", "stone = {'purple': 'Power', 'green': 'Time', 'blue': 'Space','orange': 'Soul','red': 'Reality','yellow': 'Mind'}\r\ncolor = {}\r\nn = int(input())\r\nfor _ in range(0, n):\r\n c = input()\r\n if c in stone:\r\n del stone[c]\r\nprint(6-n)\r\nprint('\\n'.join(stone.values()))\r\n", "dic={'purple':'Power ','green':'Time','orange':'Soul','blue':'Space','red':'Reality','yellow':'Mind'}\r\nfor i in range(int(input())):\r\n del dic[input()]\r\nprint(len(dic))\r\nfor i in dic:\r\n print(dic[i])", "n=int(input())\r\nc=[]\r\nb=[]\r\nd=[]\r\nfor i in range(n):\r\n x=input()\r\n b.append(x)\r\nt={\"red\":\"Reality\",\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"yellow\":\"Mind\"}\r\nprint(6-n)\r\nfor i in range(n):\r\n if(b[i] in t):\r\n c.append(t.get(b[i]))\r\nfor i in t.values():\r\n d.append(i)\r\nfor i in d:\r\n if(i not in c):\r\n print(i)\r\n \r\n \r\n \r\n", "L1=['Power','Time','Space','Soul','Reality','Mind']\r\nL2=['purple','green','blue','orange','red','yellow']\r\nn=int(input())\r\nL3=[]\r\nfor i in range(n):\r\n\ts=str(input())\r\n\tL3.append(s)\r\n#L3=list(map(str,input().split()))\r\nL4=[]\r\nc=0\r\nfor i in L2:\r\n\tif i not in L3:\r\n\t\tc+=1\r\n\t\tL4.append(L1[L2.index(i)])\r\nprint(c)\r\nfor i in L4:\r\n\tprint(i)", "n=int(input())\r\nlist_=[\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\nlist2=[]\r\nlist3=[]\r\nfor i in range(n):\r\n input_=str(input())\r\n list2.append(input_)\r\nfor j in list_:\r\n if j in list2:\r\n continue\r\n else:\r\n list3.append(j)\r\nprint(len(list3))\r\nfor k in list3:\r\n if k == \"purple\":\r\n print(\"Power\")\r\n elif k==\"green\":\r\n print(\"Time\")\r\n elif k==\"blue\":\r\n print(\"Space\")\r\n elif k==\"orange\":\r\n print(\"Soul\")\r\n elif k==\"red\":\r\n print(\"Reality\")\r\n else:\r\n print(\"Mind\")", "n=int(input())\ndic={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\n\nfor i in range(n):\n gem=input()\n dic.pop(gem)\nprint(6-n)\nfor v in dic.values():\n print(v)\n \t\t \t \t \t\t\t\t\t \t \t \t\t\t \t\t \t\t\t", "n = int(input())\r\ndic = {}\r\ndic[\"red\"] = 0\r\ndic[\"purple\"] = 0\r\ndic[\"green\"] = 0\r\ndic[\"blue\"] = 0\r\ndic[\"orange\"] = 0\r\ndic[\"yellow\"] = 0\r\ndic2 = {}\r\ndic2[\"red\"] = \"Reality\"\r\ndic2[\"purple\"] = \"Power\"\r\ndic2[\"green\"] = \"Time\"\r\ndic2[\"blue\"] = \"Space\"\r\ndic2[\"orange\"] = \"Soul\"\r\ndic2[\"yellow\"] = \"Mind\"\r\nfor yu in range(n):\r\n s = input()\r\n dic[s] = dic.get(s, 0) + 1\r\nlst = []\r\nfor k, v in dic.items():\r\n if v == 0:\r\n lst.append(dic2[k])\r\nprint(len(lst))\r\nfor j in lst:\r\n print(j)", "mp = {\"red\":\"Reality\", \"green\":\"Time\", \"yellow\":\"Mind\", \"orange\":\"Soul\", \"blue\":\"Space\", \"purple\":\"Power\"}\r\ns = {\"red\", \"green\", \"yellow\", \"orange\", \"blue\", \"purple\"}\r\nn = int(input())\r\nnew = set()\r\nfor i in range(n):\r\n tmp = input()\r\n new.add(tmp)\r\nnew = s.difference(new)\r\nprint(len(new))\r\nfor i in new:\r\n print(mp[i])\r\n", "Gauntlet = {\"Power\" : \"purple\" , \"Time\" : \"green\" , \"Space\" : \"blue\" , \"Soul\" : \"orange\" , \"Reality\" : \"red\" , \"Mind\" : \"yellow\"}\n\nnoOfGems = int(input())\n\nGems = [input() for i in range(noOfGems)]\n\nabsent = []\nfor i in Gauntlet :\n if Gauntlet[i] not in Gems :\n absent.append(i)\n\nprint(len(absent))\nfor i in absent :\n print(i)\n", "n=int(input())\r\nl={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(0,n):\r\n c=input()\r\n if c in l:\r\n del(l[c])\r\nprint(len(l))\r\nfor j in l:\r\n print(l[j])", "a = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\nd = set(a)\r\nfor i in range(int(input())):\r\n\td.remove(input())\r\nprint(len(d))\r\nfor i in d:\r\n\tprint(a[i])\r\n", "dict1 = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn = int(input())\r\n\r\nlist1=[]\r\nfor i in range(n):\r\n list1.append(input())\r\nprint(6-n)\r\nfor i in dict1:\r\n if i not in list1:\r\n print(dict1[i])\r\n ", "a={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nm=int(input())\r\nb=[]\r\nfor i in range(m):\r\n b.append(input())\r\nprint(6-m)\r\nfor i in a:\r\n if i not in b:\r\n print(a[i])\r\n", "list_of_existing_stones = ['red', 'purple', 'green', 'blue', 'orange', 'yellow']\r\nmy_list = []\r\nfull_gloves_of_infinity = {\r\n 'red': 'Reality',\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'yellow': 'Mind'\r\n}\r\n\r\nstones = int(input())\r\n\r\nfor i in range(stones):\r\n stone = input()\r\n my_list.append(stone)\r\n\r\nprint(6-stones)\r\n\r\n\r\nnew_list = [x for x in list_of_existing_stones if x not in my_list]\r\n\r\n\r\nfor item in new_list:\r\n for items in full_gloves_of_infinity:\r\n if item == items:\r\n print(full_gloves_of_infinity.get(items))", "t = int(input())\r\nd = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(t):\r\n del d[input()]\r\nprint(len(d))\r\nfor i in d.keys():\r\n print(d[i])\r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n", "d={\r\n 'purple':'Power',\r\n 'green':'Time',\r\n 'blue':'Space',\r\n 'orange':'Soul',\r\n 'red':'Reality',\r\n 'yellow':'Mind'\r\n}\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n word = input()\r\n l.append(word)\r\nprint(6-n)\r\nfor x in d.keys():\r\n if x in l:\r\n continue\r\n else:\r\n print(d[x])\r\n", "# Đầu xuân năm mới khai code 4h sáng mùng 1 Tết :)\r\n# New year, high rating,\r\n# Fighting!!!\r\n\r\ncolors = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n del colors[input()]\r\n\r\nprint(6-n, *colors.values(), sep='\\n')\r\n\r\n\"\"\"\r\n//////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n//////////////////////////////////////////\r\n\"\"\"", "n = int(input())\r\ngems = {\r\n \"purple\" : \"Power\", \"green\" : \"Time\", \"blue\" : \"Space\", \r\n \"orange\" : \"Soul\", \"red\" : \"Reality\", \"yellow\" : \"Mind\"\r\n}\r\nfor i in range(n):\r\n color = input()\r\n del gems[color]\r\nprint(len(gems))\r\nfor i in gems:\r\n print(gems[i])\r\n", "Gems={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn=int(input())\r\nprint(6-n)\r\nfor ele in range(0,n):\r\n color=input()\r\n Gems.pop(color)\r\n \r\nfor i in Gems.values():\r\n print(i)", "T=int(input())\r\nlst=list()\r\nfor i in range(T):\r\n a=input()\r\n lst.append(a)\r\nmissing=6-T \r\nprint(missing) \r\nif(lst.count(\"red\")==0):\r\n print(\"Reality\")\r\nif(lst.count(\"purple\")==0):\r\n print(\"Power\")\r\nif(lst.count(\"yellow\")==0):\r\n print(\"Mind\")\r\nif(lst.count(\"orange\")==0):\r\n print(\"Soul\")\r\nif(lst.count(\"blue\")==0):\r\n print(\"Space\") \r\nif(lst.count(\"green\")==0):\r\n print(\"Time\") \r\n\r\n ", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n si=input()\r\n li.append(si)\r\nprint(6-len(li))\r\nif \"red\" not in li:\r\n print(\"Reality\")\r\nif \"green\" not in li:\r\n print(\"Time\")\r\nif \"orange\" not in li:\r\n print(\"Soul\")\r\nif \"purple\" not in li:\r\n print(\"Power\")\r\nif \"yellow\" not in li:\r\n print(\"Mind \")\r\nif \"blue\" not in li:\r\n print(\"Space\")", "import itertools\r\nimport math\r\nimport sys\r\nimport heapq\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom fractions import gcd\r\nfrom functools import reduce\r\nsys.setrecursionlimit(4100000)\r\nINF = 1 << 60\r\n \r\n#ここから書き始める\r\nn = int(input())\r\na = [0] * 6\r\nfor i in range(n):\r\n s = input()\r\n if s == \"purple\":\r\n a[0] = 1\r\n elif s == \"green\":\r\n a[1] = 1\r\n elif s == \"blue\":\r\n a[2] = 1\r\n elif s == \"orange\":\r\n a[3] = 1\r\n elif s == \"red\":\r\n a[4] = 1\r\n else:\r\n a[5] = 1\r\nb = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\nprint(a.count(0))\r\nfor i in range(6):\r\n if a[i] == 0:\r\n print(b[i])\r\n", "\"\"\"\r\nInput\r\n- n : number of Germs\r\n- names : Germs\r\n\r\nOutput\r\n- the number of absent Germs\r\n- names 0f absent Germs\r\n\r\nNotes\r\n- Keep the first letter uppercase, others lowercase.\r\n\r\nExample\r\nInput\r\n4\r\nred\r\npurple\r\nyellow\r\norange\r\n\r\nOutput\r\n2\r\nSpace\r\nTime\r\n\r\nSteps:\r\n1- Get number of Germs is Exist\r\n2- Get names of exist Germs\r\n3-\r\n\"\"\"\r\n\r\ngerms = {\r\n \"purple\": \"power\",\r\n \"green\": \"time\",\r\n \"blue\": \"space\",\r\n \"orange\": \"soul\",\r\n \"red\": \"reality\",\r\n \"yellow\": \"mind\"\r\n}\r\n\r\ngermsKeys = list(germs.keys())\r\nexistGerms = []\r\nmissed = 0\r\nmissedList = []\r\n\r\n# Get number of Germs is Exist\r\nexist = int(input())\r\n\r\n# Get names of exist Germs\r\nfor i in range(exist):\r\n theName = input()\r\n existGerms.append(theName)\r\n\r\n# Check the missed Germs\r\nfor i in germsKeys:\r\n if i not in existGerms:\r\n missed = missed + 1\r\n missedList.append(i)\r\n\r\nprint(missed)\r\n\r\nfor n in missedList:\r\n print(str(germs[n]).capitalize())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "stones = ['red','purple','orange','yellow','blue','green']\r\npowers = []\r\nans = []\r\nn = int(input())\r\nfor t in range(n):\r\n s = input()\r\n powers.append(s)\r\nif 'red' not in powers:\r\n ans.append('Reality')\r\nif 'purple' not in powers:\r\n ans.append('Power')\r\nif 'green' not in powers:\r\n ans.append('Time')\r\nif 'blue' not in powers:\r\n ans.append('Space')\r\nif 'yellow' not in powers:\r\n ans.append('Mind')\r\nif 'orange' not in powers:\r\n ans.append('Soul')\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i)", "dict={\"Power\":\"purple\",\r\n\"Time\":\"green\",\r\n\"Space\":\"blue\",\r\n\"Soul\":\"orange\",\r\n\"Reality\":\"red\",\r\n\"Mind\":\"yellow\"}\r\ndict2={\"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\":\"Reality\",\r\n \"yellow\":\"Mind\"}\r\nkeys_list =['Power', 'Time', 'Space','Soul','Reality','Mind']\r\nvalue_list=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nn=int(input())\r\nif n==0:\r\n a=len(dict)\r\n print(a)\r\n for x in dict:\r\n print(x)\r\nelse:\r\n for x in range(n):\r\n k=input()\r\n for key in value_list:\r\n if k==key:\r\n value_list.remove(k)\r\n else:\r\n continue\r\n a=len(value_list)\r\n print(a)\r\n for x in value_list:\r\n print(dict2[x])", "d = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\ns = set()\r\nn = int(input())\r\nfor _ in range(n):\r\n\tw = input()\r\n\ts.add(w)\r\nprint(6 - n)\r\nfor (key, value) in d.items():\r\n\tif key not in s:\r\n\t\tprint(value)", "infinity_gauntlet = {\n 'Power': 'purple',\n 'Time': 'green',\n 'Space': 'blue',\n 'Soul': 'orange',\n 'Reality': 'red',\n 'Mind': 'yellow'\n}\n\nn = int(input())\n\ncolors = []\n\nfor i in range(n):\n color = input()\n colors.append(color)\n\nlist_absent = []\n\nfor key,value in infinity_gauntlet.items():\n if value not in colors:\n list_absent.append(key)\n\nprint(len(list_absent))\nfor gem in list_absent:\n print(gem)", "s=int(input())\r\nr=0\r\np=0\r\ny=0\r\no=0\r\ng=0\r\nb=0\r\nfor i in range (s) :\r\n v=input()\r\n if v=='red' :\r\n r=1\r\n if v=='purple' :\r\n p=1\r\n if v=='yellow' :\r\n y=1\r\n if v=='orange' :\r\n o=1\r\n if v=='green' :\r\n g=1\r\n if v=='blue' :\r\n b=1\r\nprint(6-s)\r\nif r==0 :\r\n print('Reality')\r\nif p==0 :\r\n print('Power')\r\nif y==0 :\r\n print('Mind')\r\nif o==0 :\r\n print('Soul')\r\nif g==0 :\r\n print('Time')\r\nif b==0 :\r\n print('Space')\r\n", "n=int(input())\r\ndic={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(n):\r\n d=input()\r\n del dic[d]\r\nprint(len(dic))\r\nfor i in dic:\r\n print(dic[i])", "d = {'purple':'Power','red':'Reality','green':'Time','blue':'Space','yellow':'Mind','orange':'Soul'}\r\nn = int(input())\r\nprint(6 - n)\r\n\r\nfor i in range(0, n):\r\n s = input()\r\n del d[s]\r\n\r\nfor i in d:\r\n print(d[i])", "n=int(input())\r\nl=[]\r\nr=[]\r\ntanos = {\r\n \"purple\":\"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nfor i in tanos:\r\n if i not in l:\r\n r.append(i)\r\na=6-n\r\nprint(a)\r\nfor i in r:\r\n print(tanos.get(i))", "n=int(input())\r\nlst_1 =[\"red\",\"yellow\",\"orange\",\"blue\",\"green\",\"purple\"]\r\ndcn={\"red\":\"Reality\",\"yellow\":\"Mind\",\"orange\":\"Soul\",\"blue\":\"Space\",\"green\":\"Time\",\"purple\":\"Power\"}\r\nlst=[]\r\nwhile(n>0):\r\n s=input()\r\n lst.append(s)\r\n n=n-1;\r\nres=[]\r\nfor i in lst_1:\r\n if i not in lst:\r\n res.append(i)\r\nprint(len(res))\r\nfor i in res:\r\n print(dcn[i])\r\n\r\n \r\n", "n = int(input())\r\ndict = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nans = []\r\nfor i in range(n):\r\n m = input()\r\n ans.append(m)\r\nprint(6-n)\r\nfor j in dict.keys():\r\n if j not in ans:\r\n print(dict[j])", "x = {'yellow':'Mind', 'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', \\\r\n 'red':'Reality'}\r\ny = ['red', 'purple', 'yellow', 'orange', 'green', 'blue']\r\nz = int(input())\r\nfor i in range(z):\r\n y.pop(y.index(input()))\r\nprint(6-z)\r\nfor i in y:\r\n print(x[i])\r\n", "G = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul',\r\n 'red': 'Reality', 'yellow': 'Mind'}\r\nfor _ in range(int(input())):\r\n G.pop(input())\r\nprint(len(G))\r\nfor v in G.values():\r\n print(v)", "dict = {\"purple\" : \"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\n#print(dict)\r\n\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n dict.pop(input())\r\n\r\nprint(len(dict.values()),*dict.values(),sep='\\n')", "def my_in(ele, seq):\n for valor in seq:\n if valor == ele:\n return True\n\nn_gems = int(input())\ngems_names = {\n \"purple\": \"Power\",\n \"green\" : \"Time\",\n \"blue\": \"Space\",\n \"orange\": \"Soul\",\n \"red\": \"Reality\", \n \"yellow\": \"Mind\"\n}\n\npresent_colors = []\nfor it in range(n_gems):\n present_colors.append(input())\n\nprint(6 - n_gems)\nfor gem in gems_names:\n if not my_in(gem, present_colors):\n print(gems_names[gem])", "gems = int(input())\n#^^^this is the input which allows user to enter a number.\ngauntlet = {\n \"purple\": \"Power\",\n \"green\" : \"Time\",\n \"blue\" : \"Space\",\n \"orange\": \"Soul\",\n \"red\": \"Reality\",\n \"yellow\": \"Mind\",\n}\n#^^^this is the list of stones and their color.\nfor i in range(gems):\n gem = input()\n del gauntlet[gem]\n\nprint(len(gauntlet))\nfor i in gauntlet.values():\n print(i)\n", "import random\r\nGauntlet = {'Power': 'purple', 'Time ': 'green', 'Space': 'blue','Soul': 'orange', 'Reality ': 'red', 'Mind ': 'yellow'}\r\ncolors=[]\r\nn=int(input())\r\nfor i in range(n):\r\n colors.append(input())\r\nprint(6-n)\r\nfor item in Gauntlet:\r\n if Gauntlet[item] not in colors:\r\n print(item)\r\n", "from bisect import bisect_left, bisect_right\r\n\r\nInf = int(1e18) + 7\r\n\r\ndef tuple_input(type):\r\n return map(type, input().strip().split())\r\n\r\nM = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nn = int(input())\r\nfor _ in range(n):\r\n c = input().strip()\r\n M[c] += '_'\r\nres = list()\r\nfor key, val in M.items():\r\n if val[-1] is not '_':\r\n res.append(val)\r\nprint(len(res))\r\nfor e in res:\r\n print(e)", "n=int(input())\r\na=[]\r\nfor _ in range(n):\r\n a.append(input())\r\nb={'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\nfor k in a:\r\n del b[k]\r\nprint(len(b))\r\nfor i in b:\r\n print(b[i])", "gems = {\n \"purple\": \"Power\",\n \"green\": \"Time\",\n \"blue\": \"Space\",\n \"orange\": \"Soul\",\n \"red\": \"Reality\",\n \"yellow\": \"Mind\",\n}\nn = int(input())\ns = (input() for _ in range(n))\nmissing = set(gems.keys()).difference(s)\nprint(len(missing))\nfor g in missing:\n print(gems[g])\n", "import math\r\n\r\ndef get_int():\r\n return int(input())\r\n\r\ndef get_list_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef get_char_list():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\ndef get_tuple_ints():\r\n return tuple(map(int, input().split()))\r\n\r\ndef print_iterable(p):\r\n print(\" \".join(map(str, p)))\r\n\r\nfrom math import gcd\r\n\r\ndef main():\r\n n= get_int()\r\n a=[]\r\n for i in range(n):\r\n s= str(input())\r\n a.append(s)\r\n\r\n print(6- min(6,n))\r\n colours=[\"purple\",\"orange\",\"red\",\"blue\",\"green\",\"yellow\"]\r\n\r\n for colour in colours:\r\n if colour not in a:\r\n if(colour==\"purple\"):\r\n print(\"Power\")\r\n elif(colour==\"green\"):\r\n print(\"Time \")\r\n elif(colour==\"blue\"):\r\n print(\"Space \")\r\n elif(colour==\"orange\"):\r\n print(\"Soul\")\r\n elif(colour==\"red\"):\r\n print(\"Reality\")\r\n else:\r\n print(\"Mind\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n=int(input())\r\nlst=[]\r\nwhile n:\r\n n-=1\r\n s=input()\r\n lst.append(s)\r\nd={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nprint(6-len(lst))\r\nfor i in d:\r\n if i not in lst:\r\n print(d[i])", "n = int(input())\r\nls = []\r\nfor i in range(n):\r\n ls.append(input())\r\n\r\nallstones = [\"purple\", 'green', 'blue', 'orange', 'red', 'yellow']\r\nstones = {'purple':'Power', \r\n 'green':'Time',\r\n 'blue':'Space',\r\n 'orange':'Soul',\r\n 'red':'Reality',\r\n 'yellow':'Mind'\r\n }\r\n\r\nfor i in ls:\r\n allstones.remove(i)\r\n\r\nprint(len(allstones))\r\nfor j in allstones:\r\n print(stones[j])", "cases = input()\r\ngemsleft = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\ncolors = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\ncurrent = []\r\nfor x in range(int(cases)):\r\n current.append(input())\r\nfor y in range(len(current)):\r\n for z in range(6):\r\n if current[y] == colors[z]:\r\n gemsleft[z] = 0\r\nprint(6 - len(current))\r\nfor a in range(6):\r\n if gemsleft[a] != 0:\r\n print(gemsleft[a])", "dict1={'purple':\"Power\",'red':\"Reality\",'green':\"Time\",'yellow':\"Mind\",'orange':\"Soul\",'blue':\"Space\"}\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n del dict1[s]\r\nprint(len(dict1))\r\nprint(*list(dict1.values()))\r\n \r\n ", "main=['purple','green','blue','orange','red','yellow']\r\ntype_s=['Power','Time','Space','Soul','Reality','Mind']\r\n\r\nn=int(input())\r\ncol=[]\r\nfor i in range(n):\r\n\ta=input()\r\n\tcol.append(a)\r\n\t\r\nnot_present=[]\r\n\r\nfor i in main:\r\n\tif i in col:\r\n\t\tpass\r\n\telse:\r\n\t\tnot_present.append(i)\r\n\t\t\r\ncount=len(not_present)\r\n\r\nss=[]\r\nfor i in not_present:\r\n\tif(i=='purple'):\r\n\t\tss.append('Power')\r\n\telif(i=='green'):\r\n\t\tss.append('Time')\r\n\telif(i=='blue'):\r\n\t\tss.append('Space')\r\n\telif(i=='orange'):\r\n\t\tss.append('Soul')\r\n\telif(i=='red'):\r\n\t\tss.append('Reality')\r\n\telif(i=='yellow'):\r\n\t\tss.append('Mind')\r\n\r\nprint(count)\t\t\r\nfor i in ss:\r\n\tprint(i)\r\n\t\r\n\t", "#E infinity Gauntlet\n#You took a peek on Thanos wearing Infinity Gauntlet. In the Gauntlet there is a place for six Infinity Gems:\n\n#the Power Gem of purple color,\n#the Time Gem of green color,\n#the Space Gem of blue color,\n#the Soul Gem of orange color,\n#the Reality Gem of red color,\n#the Mind Gem of yellow color.\n#Using colors of Gems you saw in the Gauntlet determine the names of absent Gems.\n\n#input\n#In the first line of input there is one integer nn (0 \\le n \\le 60≤n≤6) — the number of Gems in Infinity Gauntlet.\n\n#In next nn lines there are colors of Gems you saw. Words used for colors are: purple, green, blue, orange, red, yellow. It is guaranteed that all the colors are distinct. All colors are given in lowercase English letters.\n\n#output\n#In the first line output one integer mm (0 \\le m \\le 60≤m≤6) — the number of absent Gems.\n\n#Then in mm lines print the names of absent Gems, each on its own line. Words used for names are: Power, Time, Space, Soul, Reality, Mind. Names can be printed in any order. Keep the first letter uppercase, others lowercase.\n\n\n#sample 1\n#input\n#4\n#red\n#purple\n#yellow\n#orange\n#output\n#2\n#Space\n#Time\n\n#sample 2\n#Input\n#0\n#output\n#6\n#Time\n#Mind\n#Soul\n#Power\n#Reality\n#Space\n#Note\n#In the first sample Thanos already has Reality, Power, Mind and Soul Gems, so he needs two more: Time and Space.\n#In the second sample Thanos doesn't have any Gems, so he needs all six.\n\nn=int(input()) #o to 6\n#ourple,green,blue,orange,red,yellow\n # 0 1 2 3 4 5 \n#list1=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\n#list2=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\nlist1=[\"green\",\"yellow\",\"orange\",\"purple\",\"red\",\"blue\"]\nlist2=[\"Time\",\"Mind\",\"Soul\",\"Power\",\"Reality\",\"Space\"]\ninputlist=[]\nfor i in range(0,n):\n x=input()\n inputlist.append(x)\nprint(6-n)\n#print(\"inputlist\",inputlist)\n#print(\"list1\",list1)\n#print(\"list1\",list1[4])\nif len(inputlist)==0:\n for i in list2:\n print(i)\nelse:\n #\n for i in range(0,len(list1)):\n #\n # #print(\"i is\",i)\n #if inputlist[i] in list1:\n if list1[i] in inputlist:\n pass\n else:\n print(list2[i])\n\n\n\n#print(6-n)\n\t\t \t \t\t\t \t\t\t\t \t \t \t\t \t\t\t\t\t\t\t", "d={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn=int(input())\r\nfor i in range(n):\r\n gems=input()\r\n d.pop(gems)\r\n \r\nprint(len(d))\r\nfor i in d.values():\r\n print(i)", "n=int(input())\r\nl=['Power','Time','Space','Soul','Reality','Mind']\r\na=['purple','green','blue','orange','red','yellow']\r\nz=[]\r\nfor i in range(n):\r\n s=str(input())\r\n z.append(s)\r\nc=0\r\nd=[]\r\nfor i in range(0,len(a)):\r\n if(a[i] not in z):\r\n d.append(l[i])\r\n c=c+1\r\nprint(c)\r\nfor i in range(0,len(d)):\r\n print(d[i])\r\n", "n=int(input())\r\nx=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\ny=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nz=[]\r\nif(n==0):\r\n print(\"6\")\r\n for i in range(0,len(x)):\r\n print(x[i])\r\nelif(n==6):\r\n print(\"0\")\r\nelse:\r\n print(6-n)\r\n for _ in range(0,n):\r\n z.append(input())\r\n for i in range(0,6):\r\n if(y[i] not in z):\r\n print(x[i])\r\n ", "dic = {\"red\": \"Reality\", \"purple\": \"Power\", \"yellow\": \"Mind\", \"orange\": \"Soul\", \"green\": \"Time\", \"blue\": \"Space\"}\r\n\r\nlist = [] \r\nn = int(input())\r\n\r\nfor i in range(n):\r\n list.append(str(input()))\r\n\r\nprint(6 - len(list))\r\n\r\nfor i in dic:\r\n if i not in list:\r\n print(dic[i])\r\n", "prefix=[\"purple\",\"Power\",\"green\",\"Time\",\"blue\",\"Space\",\"orange\",\"Soul\",\"red\",\"Reality\",\"yellow\",\"Mind\" ]\r\n\r\nn=int(input())\r\nfor _ in range(n):\r\n\ts=str(input())\r\n\tif s in prefix:\r\n\t\tprefix.remove(prefix[prefix.index(s)+1])\r\n\t\tprefix.remove(s)\r\n\t\t\r\n\t\t\r\nprint(len(prefix[1::2]))\r\nprint(*prefix[1::2],sep=\"\\n\")\r\n", "d = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\": \"Mind\"}\r\nc = 6\r\nn = int(input())\r\nfor i in range(n):\r\n a = input()\r\n d[a]=0\r\n c-=1\r\nprint(c)\r\nfor i in d:\r\n if d[i]!=0:\r\n print(d[i])", "n=int(input())\ndict_1={\"red\":\"Reality\", \"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"yellow\":\"Mind\"}\nlist_1=[]\nfor i in range(n):\n list_1.append(input())\nprint(6-n) \nfor j in dict_1.keys():\n if(j not in list_1):\n print(dict_1[j]) \n\t \t \t \t \t \t \t \t\t\t \t \t\t \t\t \t\t", "t=int(input())\r\nl=[]\r\nfor i in range(t):\r\n s=input()\r\n l.append(s)\r\nl1=[]\r\nif 'red' not in l:\r\n l1.append('Reality')\r\nif 'purple' not in l:\r\n l1.append('Power')\r\nif 'blue' not in l:\r\n l1.append('Space')\r\nif 'green' not in l:\r\n l1.append('Time')\r\nif 'orange' not in l:\r\n l1.append('Soul')\r\nif 'yellow' not in l:\r\n l1.append('Mind')\r\nprint(len(l1))\r\nfor i in l1:\r\n print(i)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nd1={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nl2=[]\r\nfor i in d1.keys():\r\n if i not in l:\r\n l2.append(d1[i])\r\nprint(len(l2))\r\nfor i in l2:\r\n print(i)\r\n \r\n", "n=int(input())\r\nw=set()\r\nval={\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\nlst=[]\r\n\r\nfor _ in range(n):\r\n s=input()\r\n w.add(s)\r\n\r\nprint(6-n)\r\nfor (key,value) in val.items():\r\n if key not in w:\r\n print(value)\r\n\r\n", "t=int(input())\r\nn=[]\r\ng={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nm=set()\r\nfor _ in range(t):\r\n n.append(str(input()))\r\nfor char in g:\r\n if char not in n:\r\n m.add(g[char])\r\nprint(6-t)\r\nprint(*m,sep='\\n')", "stones = {\r\n 'purple' : 'Power',\r\n 'green' : 'Time',\r\n 'blue' : 'Space',\r\n 'orange' : 'Soul',\r\n 'red' : 'Reality',\r\n 'yellow' : 'Mind'\r\n}\r\n\r\ncounter = dict.fromkeys(stones.keys(), 0)\r\n\r\nfor _ in range(int(input())):\r\n counter[input()] += 1\r\nprint(list(counter.values()).count(0))\r\nfor k,v in counter.items():\r\n if not v: print(stones[k])", "colors_remaining = {'purple', 'green', 'blue', 'orange', 'red', 'yellow'}\ncolor2ability = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality',\n 'yellow': 'Mind'}\n\nn = int(input())\nfor i in range(n):\n color = input().strip()\n colors_remaining.remove(color)\n\nprint(len(colors_remaining))\nfor color in colors_remaining:\n print(color2ability[color])\n", "d = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\na = [input() for i in range(int(input()))]\nb = [d[i] for i in d.keys() if i not in a]\nprint(len(b),*b,sep='\\n')", "import math\r\ngem = [\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\ngemcolor = [\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nn = int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nr = []\r\nprint(6-n)\r\nfor i in range(len(gem)):\r\n if gemcolor[i] not in arr:\r\n print(gem[i])\r\n\r\n\r\n\r\n\r\n", "colors = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nfunction = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nfreq = 6 * [0]\r\nn = int(input())\r\nfor j in range(n):\r\n color = str(input())\r\n freq[colors.index(color)] += 1\r\ncount = 0\r\nfor j in range(6):\r\n if freq[j] == 0:\r\n count += 1\r\nprint(count)\r\nfor j in range(6):\r\n if freq[j] == 0:\r\n print(function[j])\r\n", "from sys import *\r\nfrom math import *\r\nfrom bisect import *\r\nt=int(stdin.readline())\r\nm=[]\r\nfor _ in range(t):\r\n a=input()\r\n m.append(a)\r\nprint(6-t)\r\na=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nb=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nfor i in range(6):\r\n if a[i] not in m:\r\n print(b[i])\r\n\r\n", "n = int(input())\r\nd = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nk = {'purple': 0, 'green': 0, 'blue': 0, 'orange': 0, 'red': 0, 'yellow': 0}\r\nprint(6-n)\r\nfor i in range(n):\r\n s = input()\r\n k[s] = 1\r\nfor key in k:\r\n if k[key] == 0:\r\n print(d[key])\r\n", "dc = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n }\r\n\r\nlst = [w.rstrip() for w in open(0).readlines()]\r\nfor x in lst[1:]:\r\n del dc[x]\r\nprint(len(dc))\r\nfor v in dc.values():\r\n print(v)", "n=int(input())\nm=6-n\na=[]\nb=[\"red\",\"purple\",\"green\",\"blue\",\"yellow\",\"orange\"]\nres=[\"Reality\",\"Power\",\"Time\",\"Space\",\"Mind\",\"Soul\"]\nfor i in range(n):\n a.append(input())\nfor i in range(len(a)):\n index=b.index(a[i])\n b.pop(index)\n res.pop(index)\nprint(m)\nfor i in res:\n print(i)\n \t \t \t \t\t \t \t\t \t \t", "\r\nimport sys\r\ndef get_single_int ():\r\n return int (sys.stdin.readline ().strip ())\r\ndef get_string ():\r\n return sys.stdin.readline ().strip ()\r\ndef get_ints ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\ndef get_list ():\r\n return list (map (int, sys.stdin.readline ().strip ().split ()))\r\n\r\n#code starts here\r\ndic = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nn = get_single_int ()\r\nfor i in range (n):\r\n s = get_string ()\r\n try:\r\n del dic [s]\r\n except:\r\n pass\r\nprint (len (dic))\r\nfor j in dic:\r\n print (dic [j])\r\n", "color = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nperks = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\ngems = []\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n gems.append(input())\r\n\r\nprint(6-n)\r\nfor i, col in enumerate(color):\r\n if col not in gems:\r\n print(perks[i])\r\n", "n = int(input())\nd = {\n \"purple\": \"Power\",\n \"green\": \"Time\",\n \"blue\": \"Space\",\n \"orange\": \"Soul\",\n \"red\": \"Reality\",\n \"yellow\": \"Mind\",\n}\n\nfor i in range(n):\n s = input()\n d[s] = 0\n\nprint(6 - n)\nfor item in d.values():\n if item != 0:\n print(item)\n", "d={\"purple\":\"Power\",\"blue\":\"Space\",\"green\":\"Time\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nfor i in range(int(input())):\r\n x=input()\r\n d.pop(x)\r\nprint(len(d))\r\nprint(*d.values(),sep=\"\\n\")\r\n\r\n\r\n\r\n", "\r\n\r\nl = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nm = []\r\ncnt = 0\r\nfor i in range(int(input())):\r\n a = input()\r\n if a in l:\r\n l.remove(a)\r\n \r\n \r\nprint(len(l))\r\nfor j in l:\r\n if j == 'purple': \r\n print('Power')\r\n elif j == 'green':\r\n print('Time')\r\n elif j == 'blue':\r\n print('Space')\r\n elif j == 'orange':\r\n print('Soul')\r\n elif j == 'red':\r\n print('Reality')\r\n \r\n else:\r\n print('Mind')\r\n \r\n\r\n\r\n\r\n", "a={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\nt=int(input())\n\nfor x in range(t) :\n\ts=input()\n\tdel a[s] \n\nprint(6-t)\nfor x in a:\n\tprint(a[x])\n \t \t \t\t \t\t\t\t\t\t \t \t \t\t\t \t \t\t\t", "import os\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom collections import *\r\nfrom heapq import *\r\nimport types\r\ninf=1<<63\r\nreadi=lambda : int(input())\r\nreadis=lambda: list(map(int,input().split()))\r\nreads=lambda: input().rstrip()\r\nreadss=lambda: input().split()\r\ndef bootstrap(f,stack=[]):\r\n def wrappedfunc(*args,**kwargs):\r\n if stack: return f(*args,**kwargs)\r\n else:\r\n to=f(*args,**kwargs)\r\n while True:\r\n if type(to) is types.GeneratorType:\r\n stack.append(to)\r\n to=next(to)\r\n else:\r\n stack.pop()\r\n if not stack: break\r\n to=stack[-1].send(to)\r\n return wrappedfunc\r\nMOD=10**9+7\r\ndef slove():\r\n n=readi()\r\n d={'purple':'Power','green':'Time',\\\r\n 'blue':'Space','orange':'Soul',\\\r\n 'red':'Reality','yellow':'Mind'}\r\n for _ in range(n):\r\n w=reads()\r\n del d[w]\r\n print(len(d))\r\n for v in d.values():\r\n print(v)\r\n return \r\n \r\n \r\n \r\n \r\n return \r\n\r\n# t=int(input())\r\nt=1\r\nfor _ in range(t):\r\n slove()", "d={}\r\nd={'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul','red':'Reality', 'yellow':'Mind'}\r\n\r\nn= int(input())\r\ns=''\r\nfor i in range(n):\r\n x= str(input())\r\n if x not in s:\r\n s=s+ x +\" \"\r\nl=[]\r\nfor i in d:\r\n if i not in s:\r\n l.append(d[i])\r\nprint(len(l))\r\nfor i in l:\r\n print(i,end=\"\\n\")", "from collections import Counter\r\ngem = {'power': 'purple', 'time': 'green', 'space': 'blue', 'soul': 'orange', 'reality': 'red', 'mind': 'yellow'}\r\nn = int(input())\r\npow=[i for i in gem.values()]\r\ns = []\r\nfor i in range(n):\r\n temp = input()\r\n s.append(temp)\r\nres = list((Counter(pow) - Counter(s)).elements())\r\n#print(res)\r\nm = []\r\nfor i in res:\r\n for k, v in gem.items():\r\n if(i == v):\r\n m.append(k)\r\ncap=[i.title() for i in m]\r\nprint(6 - n)\r\nprint(*cap, sep = '\\n')", "n=int(input())\r\ns={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\na=[]\r\nfor i in s:\r\n if i not in l:\r\n a.append(i)\r\nprint(6-n)\r\nfor i in a:\r\n print(s[i])", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\n#print(l)\r\nc=0\r\nl1=[('Power','purple'),('Time','green'),('Space','blue'),('Soul','orange'),('Reality','red'),('Mind','yellow')]\r\nl2=[]\r\nl3=['Power','Time','Space','Soul','Reality','Mind']\r\nfor i in range(len(l)):\r\n for j in range(len(l1)):\r\n if(l1[j][1]==l[i]):\r\n c+=1\r\n l2.append(l1[j][0])\r\nprint(6-c)\r\nfor i in l3:\r\n if(i not in l2):\r\n print(i)", "n=int(input())\r\nlist1=[]\r\nfor i in range(n):\r\n c=input()\r\n list1.append(c)\r\nd={\"Power\":\"purple\",\"Time\":\"green\",\"Space\":\"blue\",\"Soul\":\"orange\",\"Reality\":\"red\",\"Mind\":\"yellow\"}\r\nlist2=[keys for keys in d.keys()]\r\nlist3=[values for values in d.values()]\r\n\r\nm=6-n\r\nprint(m)\r\nfor i in range(len(list3)):\r\n if list3[i] not in list1:\r\n \r\n print(list2[i])\r\n \r\n", "d = {\r\n 'purple':'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red' : 'Reality',\r\n 'yellow' : 'Mind'\r\n }\r\nls = list(d.keys())\r\nfor i in range(int(input())):\r\n x = input()\r\n if x in ls : ls.remove(x)\r\nprint(len(ls)) \r\nfor i in ls :\r\n print(d[i]) ", "gems = int(input())\ngems_list = []\nfor x in range(gems):\n gems_list.append(input())\ninfinity_stones = {\"Power\": \"purple\",\n \"Time\": \"green\",\n \"Space\": \"blue\",\n \"Soul\": \"orange\",\n \"Reality\": \"red\",\n \"Mind\": \"yellow\"}\nprint(6-gems)\nfor x in infinity_stones:\n if infinity_stones[x] not in gems_list:\n print(x)\n \t \t \t \t \t\t\t \t\t \t\t \t \t", "memo = {\"Power\": \"purple\", \"Time\": \"green\", \"Space\": \"blue\", \"Soul\": \"orange\", \"Reality\": \"red\", \"Mind\": \"yellow\"}\r\n\r\nn = int(input())\r\ndata = [input() for _ in range(n)]\r\n\r\nans = []\r\nfor i in memo.keys():\r\n if memo[i] not in set(data):\r\n ans.append(i)\r\n\r\nprint(len(ans))\r\nprint(\"\\n\".join(ans))", "n=int(input())\r\ndic={'purple':0,'green':1,'blue':2,'orange':3,'red':4,'yellow':5}\r\nlistt=['purple','green','blue','orange','red','yellow']\r\na=['Power','Time','Space','Soul','Reality','Mind']\r\nb=list(range(6))\r\nfor i in range(n):\r\n k=input()\r\n listt.remove(k)\r\nprint(len(listt))\r\nfor i in listt:\r\n print(a[dic[i]])\r\n", "n=int(input())\r\nll=[]\r\nl=['Power','Time','Space','Soul','Reality','Mind']\r\nd=['purple','green','blue','orange','red','yellow']\r\nfor u in range(n):\r\n s=input()\r\n ll.append(s)\r\ndd=[]\r\nc=0\r\nfor i in range(6):\r\n if(d[i] not in ll):\r\n dd.append(l[i])\r\n c=c+1\r\nprint(c)\r\nfor i in range(c):\r\n print(dd[i])\r\n", "gems = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\ncolors = []\r\nm = int(input())\r\nif m>0:\r\n for i in range(m):\r\n colors.append(input())\r\nprint(6-m)\r\nfor color in gems.keys():\r\n if color not in colors:\r\n print(gems[color])\r\n", "D = {'red': 'Reality', 'orange': 'Soul', 'yellow': 'Mind',\r\n 'green': 'Time', 'blue': 'Space', 'purple': 'Power'}\r\nn = int(input())\r\nfor i in range(n): del D[input()]\r\nprint(6-n)\r\nfor i in D: print(D[i])\r\n", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(x):\r\n\tprint()\r\n\tfor s in x:\r\n\t\tprint(s)\r\n\r\ndef solve():\r\n\tn = int(input())\r\n\tco = ['purple','green','blue','orange','red','yellow']\r\n\tpo = ['Power','Time','Space','Soul','Reality','Mind']\t\r\n\tfor _ in range(n):\r\n\t\tcox = input()\r\n\t\tidx = co.index(cox)\r\n\t\tdel co[idx]\r\n\t\tdel po[idx]\r\n\tprint(len(po))\r\n\tfor pox in po:\r\n\t\tprint(pox)\r\n\r\nsolve()", "d = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nt = int(input())\r\nfor i in range(t):\r\n d.pop(input())\r\nprint(len(d))\r\nfor i in d:print(d[i])", "stones = {\"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"}\r\nfor _ in range(int(input())):\r\n stone = input()\r\n if stone in stones:\r\n stones.pop(stone)\r\n \r\nprint(len(stones))\r\nfor stone in stones:\r\n print(stones[stone])", "#https://codeforces.com/problemset/problem/987/A\r\nstones = {\r\n \"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\":\"Reality\",\r\n \"yellow\":\"Mind\"\r\n }\r\n\r\nnum_stones = int(input())\r\nfor current_index in range(num_stones):\r\n stones.pop(input())\r\n\r\nprint(6-num_stones)\r\nfor x,y in stones.items():\r\n print(y)\r\n", "n = int(input())\r\nprint(6-n)\r\nc = {'r': 'Reality', 'y': 'Mind', 'p': 'Power', 'g': 'Time', 'b': 'Space', 'o': 'Soul'}\r\nfor i in range(n):\r\n c[input()[0]]= 1\r\nfor i in c.values():\r\n if i!=1:\r\n print(i)", "d={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\nn=int(input())\nfor _ in range(n):\n s=input()\n del d[s]\nprint(6-n)\nprint(*d.values())\n", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #######################################\r\n \r\n\r\nl=[\"red\",\"green\",\"blue\",\"orange\",\"purple\",\"yellow\"]\r\nl1=[]\r\nt=int(input())\r\nwhile(t>0):\r\n s=str(input())\r\n l1.append(s)\r\n t-=1\r\n\r\nx=set(l)\r\ny=set(l1)\r\nz=set(x^y)\r\nm=list(z)\r\n\r\nprint(len(m))\r\nfor i in m:\r\n if(i==\"green\"):\r\n print(\"Time\")\r\n elif(i==\"purple\"):\r\n print(\"Power\")\r\n elif(i==\"blue\"):\r\n print(\"Space\")\r\n elif(i==\"orange\"):\r\n print(\"Soul\")\r\n elif(i==\"red\"):\r\n print(\"Reality\")\r\n elif(i==\"yellow\"):\r\n print(\"Mind\")\r\n\r\n \r\n", "from collections import Counter\nt = int(input())\np1 = []\np = Counter()\np1 += ['purple','green','blue','orange','red','yellow']\n\np['yellow'] = 'Mind'\np['purple'] = 'Power'\np['green'] = 'Time'\np['blue'] = 'Space'\np['orange'] = 'Soul'\np['red'] = 'Reality'\nd = []\nk = []\nwhile t > 0:\n s = input()\n if s in p1:\n p1.remove(s)\n t -= 1\nfor i in p1:\n k += [p[i]]\nprint(len(k))\nfor i in k:\n print(i)\n\t\t\t \t \t\t \t \t \t \t \t \t\t \t\t\t\t", "n = int(input())\ngems = {\"purple\" : \"Power\",\n \"green\" : \"Time\",\n \"blue\" : \"Space\",\n \"orange\" : \"Soul\",\n \"red\" : \"Reality\",\n \"yellow\" : \"Mind\"}\nl = 6\nfor _ in range(n):\n c = input()\n if c in gems and l > 0:\n del gems[c]\n l -= 1\nprint(l)\nif l > 0:\n for c in gems:\n print(gems[c])\n", "n=int(input())\r\nl=[]\r\ng=[]\r\nfor i in range(n):\r\n l.append(str(input()))\r\nc=len(l)\r\nif \"purple\" in l:\r\n l.remove(\"purple\")\r\nelse:\r\n g.append(\"Power\")\r\nif \"green\" in l:\r\n l.remove(\"green\")\r\nelse:\r\n g.append(\"Time\")\r\nif \"blue\" in l:\r\n l.remove(\"blue\")\r\nelse:\r\n g.append(\"Space\")\r\nif \"orange\" in l:\r\n l.remove(\"orange\")\r\nelse:\r\n g.append(\"Soul\")\r\nif \"red\" in l:\r\n l.remove(\"red\")\r\nelse:\r\n g.append(\"Reality\")\r\nif \"yellow\" in l:\r\n l.remove(\"yellow\")\r\nelse:\r\n g.append(\"Mind\")\r\nprint(6-c)\r\nprint(*g,sep=\"\\n\")", "# Not Complete\n\nnamesList = [\"Power\", \"Space\", \"Reality\", \"Soul\", \"Time\", \"Mind\"]\ncolorsList = [\"purple\", \"blue\", \"red\", \"orange\", \"green\", \"yellow\"]\n\nn = int(input())\n\nfor i in range(n):\n color = input()\n position = colorsList.index(color)\n namesList[position] = \"\"\n\nprint(len(namesList) - namesList.count(\"\"))\nfor i in namesList:\n if i != \"\":\n print(i)\n", "list1=[[\"Power\",\"purple\"],\r\n\t[\"Time\" , \"green\"],\r\n\t[\"Space\" , \"blue\"],\r\n\t[\"Soul\" ,\"orange\"],\r\n\t[\"Reality\",\"red\"],\r\n\t[\"Mind\",\"yellow\"]]\r\nl1=[]\r\nl2=[]\r\nn=int(input())\r\nfor i in range(n):\r\n\ts=input()\r\n\tl1.append(s)\r\nfor i in range(len(l1)):\r\n\tfor j in range(len(list1)):\r\n\t\tif l1[i] == list1[j][1]:\r\n\t\t\tl2.append(list1[j])\r\nprint(len(list1)-n)\r\nfor i in range(len(list1)):\r\n\tif list1[i] not in l2: \r\n\t\tprint(list1[i][0])", "n= int(input())\r\nlist=[]\r\nprint(6-n)\r\nfor i in range(n):\r\n a=input()\r\n list.append(a)\r\ndict={\"purple\":\"Power\" , \"green\":\"Time\" , \"blue\":\"Space\" , \"orange\":\"Soul\" , \"red\":\"Reality\" , \"yellow\":\"Mind\"}\r\nfor j,k in dict.items():\r\n if j in list:\r\n continue\r\n else:\r\n print(k)\r\n", "#987A Infinity Gauntlet\r\n\r\nstones=int(input())\r\nif stones==6:\r\n print(0)\r\nelse:\r\n dictionary={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\n store=[]\r\n\r\n for i in range(stones):\r\n s=input()\r\n store+=s,\r\n\r\n print(6-stones)\r\n for i in dictionary:\r\n if i not in store:\r\n print(dictionary[i])\r\n\r\n# 6\r\n# Time\r\n# Mind\r\n# Soul\r\n# Power\r\n# Reality\r\n# Space", "n=int(input())\r\n\r\nl=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\na=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nans=[0,0,0,0,0,0]\r\nfor i in range(n):\r\n s=input()\r\n ans[l.index(s)]=1\r\nx=ans.count(0)\r\nprint(x)\r\nfor i in range(6):\r\n if ans[i]==0:\r\n print(a[i])", "N = int(input())\r\nall = {'red', 'yellow', 'purple', 'orange', 'green', 'blue'}\r\nm = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nx = set()\r\nfor _ in range(N):\r\n S = input()\r\n x.add(S)\r\nprint(6 - N)\r\nfor each in all:\r\n if each not in x:\r\n print(m[each])", "l1=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nl2=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nl3=l1.copy()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n for j in range(len(l2)):\r\n if l[i]==l1[j]:\r\n l3.remove(l1[j])\r\nprint(len(l3))\r\nfor i in range(len(l3)):\r\n print(l2[l1.index(l3[i])])", "'''\r\n\tCodeForces 987A\r\n\tInfinity Gauntlet\r\n\r\n\tTags: Ad-hoc\r\n'''\r\nfrom sys import stdin\r\n\r\ntable = {\r\n\t'purple': 'Power',\r\n\t'green': 'Time',\r\n\t'blue': 'Space',\r\n\t'orange': 'Soul',\r\n\t'red': 'Reality',\r\n\t'yellow': 'Mind'\r\n}\r\ninput()\r\nans = set(table.values()) - set(map(lambda x: table[x.strip()], stdin))\r\nprint(len(ans))\r\nprint('\\n'.join(list(ans)))", "n=int(input())\r\nd={\r\n 'purple':'Power',\r\n 'green':'Time',\r\n 'blue':'Space',\r\n 'orange':'Soul',\r\n 'red':'Reality',\r\n 'yellow':'Mind'\r\n}\r\nl=[\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\nprint(6-n)\r\nfor i in range(0,n):\r\n s=input()\r\n l.remove(s)\r\nfor i in l:\r\n print(d[i])\r\n", "dic={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\n\r\nn=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n s=map(str,input().split())\r\n for key in s:\r\n if dic[key]:\r\n dic.pop(key)\r\n\r\nprint(6-n)\r\nfor index,values in dic.items():\r\n print(values)\r\n", "color=['green','yellow','orange','purple','red','blue']\nstone=[\"Time\",\"Mind\",\"Soul\",\"Power\",\"Reality\",\"Space\"]\n\nn= int(input())\nfor i in range(n):\n e=input()\n idx= color.index(e)\n stone[idx]=\"\"\n \nprint(6-n)\nfor item in stone:\n if item!=\"\":\n print(item)\n \t \t\t \t\t\t\t \t \t\t \t \t \t\t\t\t\t", "#GJA\r\nn=int(input())\r\ni=0\r\nt=0\r\nsp=0\r\np=0\r\nr=0\r\nm=0\r\ns=0\r\nwhile i<n:\r\n i=i+1\r\n a=input()\r\n if a=='red':\r\n r=1\r\n elif a=='purple':\r\n p=1\r\n elif a=='green':\r\n t=1\r\n elif a=='blue':\r\n sp=1\r\n elif a=='yellow':\r\n m=1\r\n elif a=='orange':\r\n s=1\r\nprint(6-n)\r\nif not r:\r\n print('Reality')\r\nif not p:\r\n print('Power')\r\nif not t:\r\n print('Time')\r\nif not sp:\r\n print('Space')\r\nif not m:\r\n print('Mind')\r\nif not s:\r\n print('Soul')", "lst1=[]\r\nn = int(input())\r\nfor i in range(0, n):\r\n ele = input()\r\n lst1.append(ele)\r\n\r\nlst = [\"red\",\"purple\",\"yellow\",\"green\",\"blue\",\"orange\"]\r\nx=[]\r\ni=0\r\nfor j in range(len(lst)):\r\n if lst[i] in lst1:\r\n pass\r\n else:\r\n x.append(lst[i])\r\n i+=1\r\nprint(len(lst)-len(lst1)) \r\nfor i in x:\r\n if i == \"green\":\r\n print(\"Time\")\r\n if i == \"purple\":\r\n print(\"Power\")\r\n if i == \"blue\":\r\n print(\"Space\")\r\n if i == \"orange\":\r\n print(\"Soul\")\r\n if i == \"red\":\r\n print(\"Reality\")\r\n if i == \"yellow\":\r\n print(\"Mind\") ", "t=int(input())\r\ndictt={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(t):\r\n dictt.pop(input())\r\nprint(len(dictt))\r\nprint(*dictt.values(),sep=\"\\n\")", "\r\ntry :\r\n n = int(input()) \r\n dict_color = {\r\n \"purple\":\"Power\" ,\r\n \"green\": \"Time\" ,\r\n \"blue\": \"Space\",\r\n \"orange\":\"Soul\" ,\r\n \"red\":\"Reality\" ,\r\n \"yellow\":\"Mind\"\r\n } \r\n\r\n list_color = [\"Power\", \"Time\" ,\"Space\",\"Soul\" ,\"Reality\" ,\"Mind\" ]\r\n for each in range(0,n) :\r\n color = input()\r\n to_remove = dict_color[color] \r\n list_color.remove(to_remove)\r\n \r\n print(6-n) \r\n for each in list_color: \r\n print(each)\r\n \r\n \r\nexcept :\r\n pass", "n = int(input())\r\ngems = { 'purple': 'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind' }\r\ncount = 6\r\nmissing = list(gems.keys())\r\nNotMissing = []\r\nfor _ in range(n):\r\n s = input()\r\n NotMissing.append(s)\r\n count -= 1\r\nprint(count)\r\n\r\nmissing = set(missing) - set(NotMissing)\r\nfor color in missing:\r\n print(gems[color])", "def main():\n\td = {'purple':'Power','green':'Time','blue':'Space',\n\t\t\t'orange':'Soul','red':'Reality','yellow':'Mind'}\n\n\tg = {'purple':0,'green':0,'blue':0,'orange':0,'red':0,'yellow':0}\n\tn = int(input())\n\tfor _ in range(n):\n\t\tg[input()] = 1\n\tprint(6-n)\n\tfor k,v in g.items():\n\t\tif v ==0:\n\t\t\tprint(d[k])\nmain()\n\n", "kamney = int(input())\nperchatka = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\" }\nfor i in range(1, kamney +1):\n str = input()\n perchatka.pop(str)\nprint(len(perchatka))\nfor value in perchatka.values():\n print(value)", "b={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn=int(input()) \r\nfor _ in range(0,n):\r\n s=input()\r\n del b[s]\r\nprint(6-n)\r\nfor a in b:\r\n print(b[a])", "infinity = {'Power': \"purple\", 'Time': \"green\", 'Space': \"blue\", 'Soul': \"orange\", 'Reality': \"red\", 'Mind': \"yellow\"}\r\ns = set()\r\nn = int(input())\r\nfor _ in range(n):\r\n w = input()\r\n s.add(w)\r\nprint(6 - n)\r\nfor (key, value) in infinity.items():\r\n if value not in s:\r\n print(key)\r\n\r\n\r\n\r\n\r\n\r\n", "abslst = ['purple','green','blue','orange','red','yellow']\r\n\r\nx = int(input())\r\nprint(6-x)\r\nwhile x:\r\n a = str(input())\r\n for ele in abslst:\r\n if a == ele:\r\n abslst.remove(ele)\r\n x -= 1\r\n\r\nfor i in abslst:\r\n if i == 'purple':\r\n print(\"Power\")\r\n elif i == 'green':\r\n print(\"Time\")\r\n elif i == 'blue':\r\n print(\"Space\")\r\n elif i == 'orange':\r\n print(\"Soul\")\r\n elif i == 'red':\r\n print(\"Reality\")\r\n else:\r\n print(\"Mind\")", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n a=input()\r\n li.append(a)\r\n \r\ndic={'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\ntotlist= ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nremcol=[]\r\nfor i in totlist:\r\n if i not in li:\r\n remcol.append(i)\r\n#print(remcol)\r\nprint(len(remcol))\r\nfor i in remcol:\r\n print(dic[i])", "from collections import *\nimport sys\nimport math\nfrom functools import reduce\n\ndef factors(n): \n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\n\n\ndef li():return [int(i) for i in input().rstrip('\\n').split(' ')]\ndef st():return input().rstrip('\\n')\ndef val():return int(input())\ndef stli():return [int(i) for i in input().rstrip('\\n')]\n\n\nl = [['purple', 'Power'],\n ['green', 'Time'],\n ['blue', 'Space'],\n ['orange', 'Soul'],\n ['red', 'Reality'],\n ['yellow', 'Mind']]\n\ns = ['purple',\n'green',\n'blue',\n'orange',\n'red',\n'yellow']\nfor i in range(val()):\n temp = st()\n if temp in s:\n s.remove(temp)\nprint(len(s))\nfor i in s:\n for j in l:\n if j[0] == i:\n print(j[1])\n break", "gemset = {'purple':'Power','yellow':'Mind','orange':'Soul','blue':'Space','green':'Time','red':'Reality'}\r\ngemx = ['purple','green','red','yellow','orange','blue']\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nprint(6-n) \r\nfor i in gemset.keys():\r\n if i in l:\r\n continue \r\n else:\r\n print(gemset[i])\r\n", "a = 'purple green blue orange red yellow'.split()\r\nb = 'Power Time Space Soul Reality Mind'.split()\r\nc = zip(a, b)\r\nn = int(input())\r\ng = [input() for i in range(n)]\r\nneed = []\r\nfor color in c:\r\n if color[0] not in g:\r\n need.append(color[1])\r\nprint(len(need))\r\nprint('\\n'.join(need))\r\n \r\n\r\n# ___ ___ \r\n# /\\__\\ /\\ \\ \r\n# /:| _|_ /::\\ \\ \r\n# /::|/\\__\\ /:/\\:\\__\\ \r\n# \\/|::/ / \\:\\/:/ / \r\n# |:/ / \\::/ / \r\n# \\/__/ \\/__/ \r\n# ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ \r\n# /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\__\\ /\\ \\ /\\__\\ /\\ \\ \r\n# /::\\ \\ _\\:\\ \\ /::\\ \\ /::\\ \\ _\\:\\ \\ /::\\ \\ /:/ / _\\:\\ \\ /:| _|_ /::\\ \\ \r\n# /:/\\:\\__\\ /\\/::\\__\\ /\\:\\:\\__\\ /:/\\:\\__\\ /\\/::\\__\\ /::\\:\\__\\ /:/__/ /\\/::\\__\\ /::|/\\__\\ /::\\:\\__\\\r\n# \\:\\/:/ / \\::/\\/__/ \\:\\:\\/__/ \\:\\ \\/__/ \\::/\\/__/ \\/\\::/ / \\:\\ \\ \\::/\\/__/ \\/|::/ / \\:\\:\\/ /\r\n# \\::/ / \\:\\__\\ \\::/ / \\:\\__\\ \\:\\__\\ \\/__/ \\:\\__\\ \\:\\__\\ |:/ / \\:\\/ / \r\n# \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \r\n# ___ ___ ___ \r\n# /\\ \\ /\\__\\ /\\ \\ \r\n# /::\\ \\ /:| _|_ /::\\ \\ \r\n# /::\\:\\__\\ /::|/\\__\\ /:/\\:\\__\\ \r\n# \\/\\::/ / \\/|::/ / \\:\\/:/ / \r\n# /:/ / |:/ / \\::/ / \r\n# \\/__/ \\/__/ \\/__/ \r\n# ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ \r\n# /\\ \\ /\\__\\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\__\\ /\\__\\ \r\n# _\\:\\ \\ /::L_L_ /::\\ \\ /::\\ \\ /::\\ \\ /::\\ \\ /::\\ \\ /::\\ \\ /:/ / |::L__L \r\n# /\\/::\\__\\ /:/L:\\__\\ /::\\:\\__\\ /::\\:\\__\\ /:/\\:\\__\\ /::\\:\\__\\ /::\\:\\__\\ /::\\:\\__\\ /:/__/ |:::\\__\\\r\n# \\::/\\/__/ \\/_/:/ / \\/\\::/ / \\;:::/ / \\:\\/:/ / \\/\\::/ / \\:\\:\\/ / \\;:::/ / \\:\\ \\ /:;;/__/\r\n# \\:\\__\\ /:/ / \\/__/ |:\\/__/ \\::/ / \\/__/ \\:\\/ / |:\\/__/ \\:\\__\\ \\/__/ \r\n# \\/__/ \\/__/ \\|__| \\/__/ \\/__/ \\|__| \\/__/ \r\n# ___ ___ ___ ___ ___ ___ ___ ___ \r\n# /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ \r\n# /::\\ \\ _\\:\\ \\ /::\\ \\ /::\\ \\ /::\\ \\ \\:\\ \\ /::\\ \\ /::\\ \\ \r\n# /:/\\:\\__\\ /\\/::\\__\\ /::\\:\\__\\ /::\\:\\__\\ /:/\\:\\__\\ /::\\__\\ /::\\:\\__\\ /:/\\:\\__\\ \r\n# \\:\\/:/ / \\::/\\/__/ \\;:::/ / \\:\\:\\/ / \\:\\ \\/__/ /:/\\/__/ \\:\\:\\/ / \\:\\/:/ / \r\n# \\::/ / \\:\\__\\ |:\\/__/ \\:\\/ / \\:\\__\\ \\/__/ \\:\\/ / \\::/ / \r\n# \\/__/ \\/__/ \\|__| \\/__/ \\/__/ \\/__/ \\/__/ \r\n# ___ ___ ___ ___ ___ ___ \r\n# /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ /\\ \\ \r\n# /::\\ \\ /::\\ \\ /::\\ \\ /::\\ \\ /::\\ \\ \\:\\ \\ \r\n# /::\\:\\__\\ /::\\:\\__\\ /::\\:\\__\\ /:/\\:\\__\\ /::\\:\\__\\ /::\\__\\ \r\n# \\:\\:\\/ / \\/\\:\\/__/ \\/\\:\\/__/ \\:\\/:/ / \\;:::/ / /:/\\/__/ \r\n# \\:\\/ / \\/__/ \\/__/ \\::/ / |:\\/__/ \\/__/ \r\n# \\/__/ \\/__/ \\|__| \r\n# ___ ___ ___ ___ ___ ___ ___ ___ \r\n# /\\__\\ /\\ \\ /\\__\\ /\\ \\ /\\__\\ /\\ \\ /\\ \\ /\\ \\ \r\n# /::L_L_ /::\\ \\ |::L__L _\\:\\ \\ /::L_L_ _\\:\\ \\ _\\:\\ \\ /::\\ \\ \r\n# /:/L:\\__\\ /::\\:\\__\\ /::::\\__\\ /\\/::\\__\\ /:/L:\\__\\ /\\/::\\__\\ /::::\\__\\ /::\\:\\__\\ \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\nk=[]\r\nfor i in range(n):\r\n k.append(input())\r\nm={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nl=6-n\r\nif l>0:\r\n print(l)\r\n for i in m:\r\n if i not in k:\r\n print(m[i])\r\nelse:\r\n print(0)\r\n", "gauntlet = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nn = int(input())\r\npresent = []\r\nprint(6-n)\r\nfor line in range(n):\r\n\tcolor = input()\r\n\tpresent.append(color)\r\nfor color in gauntlet.keys():\r\n\tif color not in present:\r\n\t\tprint(gauntlet[color])", "a={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nfor _ in range(int(input())):a.pop(input())\r\nprint(len(a))\r\nfor i in a.values():print(i)\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\tm={\"purple\":\"Power\",\n\t\"green\":\"Time\",\n\t\"blue\":\"Space\",\n\t\"orange\":\"Soul\",\n\t\"red\":\"Reality\",\n\t\"yellow\":\"Mind\"}\n\ts=set()\n\tfor i in range(n):\n\t\ts.add(read())\n\tprint(6-n)\n\tfor k,v in m.items():\n\t\tif k not in s:\n\t\t\tprint(v)\n\nsolve()\n", "dic={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\nl=[]\ni=int(input(\" \"))\nfor i in range(i):\n l.append(input(\"\"))\nprint(6-len(l)) \nfor k,j in dic.items():\n if(k not in l):\n print(j)\n\n\t\t \t \t\t\t \t\t \t \t\t \t \t \t", "dict1={\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nlist1=[\"purple\",\"red\",\"orange\",\"yellow\",\"green\",\"blue\"]\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input())\r\nprint(6-n)\r\nfor i in list1:\r\n\tif i not in l:\r\n\t\tprint(dict1[i])", "n = int(input())\r\nm = 6\r\nprint(m - n)\r\nlist = []\r\nfor i in range(0,n):\r\n list.append(str(input()))\r\nif 'purple' not in list:\r\n print('Power')\r\n\r\nif 'green' not in list:\r\n print('Time')\r\n\r\nif 'blue' not in list:\r\n print('Space')\r\n\r\nif 'orange' not in list:\r\n print('Soul')\r\n\r\nif 'red' not in list:\r\n print('Reality')\r\n\r\nif 'yellow' not in list:\r\n print('Mind')\r\nexit()", "# import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\nimport math\r\n# import re\r\ngg=\"abcdefghijklmnopqrstuvwxyz\"\r\n# a=ord('a')\r\n# print(chr(a), end=\"\")\r\n#sys.setrecursionlimit(int(1e6))\r\n# n, m = map(int, input().split())\r\n# graph = [[] for i in range(n)]\r\n# for i in range(m):\r\n# \ta,b = map(int, input().split())\r\n# \tgraph[a-1].append(b-1)\r\n# \tgraph[b-1].append(a-1)\r\n\r\n# def dfs(node, count, visited):\r\n# \tvisited[node] = 1\r\n# \tcount[0]+=1\r\n# \tfor i in graph[node]:\r\n# \t\tif not visited[i]:\r\n# \t\t\tdfs(i, count, visited)\r\n\r\n\r\n# visited = [0]*n\r\n# t = 0\r\n# node = None\r\n# for i in range(n):\r\n# \tif not visited[i]:\r\n# \t\tcount = [0]\r\n# \t\tdfs(i, count, visited)\r\n# \t\tif t<count[0]:\r\n# \t\t\tt = max(t, count[0])\r\n# \t\t\tnode = i\r\n# visited = [0]*n\r\n# e = [0]\r\n# dfs(node, e, visited)\r\n# print(t)\r\n# print(*visited)\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ta=input()\r\n\tl.append(a)\r\n# print(*l)\r\nv=[\"Time\" ,\"Mind\", \"Soul\", \"Power\", \"Reality\" ,\"Space\"]\r\nc=[\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\nfor i in range(n):\r\n\t# print(c.pop(c.index(l[i])))\r\n\tc.pop(c.index(l[i]))\r\nprint(len(c))\r\nfor i in range(len(c)):\r\n\tif(c[i]==\"purple\"):\r\n\t\tc[i]=\"Power\"\r\n\tif(c[i]==\"green\"):\r\n\t\tc[i]=\"Time\"\r\n\tif(c[i]==\"orange\"):\r\n\t\tc[i]=\"Soul\"\r\n\tif(c[i]==\"red\"):\r\n\t\tc[i]=\"Reality\"\r\n\tif(c[i]==\"yellow\"):\r\n\t\tc[i]=\"Mind\"\r\n\tif(c[i]==\"blue\"):\r\n\t\tc[i]=\"Space\"\r\n# print(*c)\r\nfor i in c:\r\n\tprint(i)\r\n", "d = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\nfor i in range(int(input())):\n del d[input()]\nprint(len(d))\nprint(*[d[x] for x in d], sep='\\n')\n", "dic = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\nlst = []\nvar = int(input())\nprint(6-var)\nfor i in range(var):\n a = input()\n lst.append(a)\nfor i in dic:\n if i not in lst:\n print(dic[i])\n\n\t \t \t \t \t\t\t \t \t \t\t\t", "colorPower = {\"purple\":\"Power\",\n \"green\":\"Time\",\n \"blue\":\"Space\",\n \"orange\":\"Soul\",\n \"red\":\"Reality\",\n \"yellow\":\"Mind\"}\ncases = int(input())\nstrings = [\"dummy\"]*cases\nfor i in range(cases):\n strings[i] = input()\nfor each in strings:\n if(each in colorPower):\n colorPower.pop(each)\nprint(len(colorPower))\nfor each in colorPower:\n print(colorPower[each])\n \t\t \t \t \t \t\t\t\t\t\t \t\t\t \t", "l = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nset1 = set()\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n s1 = input()\r\n set1.add(s1)\r\nprint(6-n)\r\nfor (key,value) in l.items():\r\n if key not in set1 :\r\n print(value)\r\n\r\n", "lol = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\n#tc = int(input())\r\ntc = 1\r\nfor _ in range(tc):\r\n wow = []\r\n n = int(input())\r\n for i in range(n):\r\n wow.append(input())\r\n print(6 - n)\r\n for x in lol.keys():\r\n if x not in wow:\r\n print(lol[x])", "n=int(input())\r\nl=[\"red\",\"purple\",\"orange\",\"yellow\",\"blue\",\"green\"]\r\nl1=[\"Reality\",\"Power\",\"Soul\",\"Mind\",\"Space\",\"Time\"]\r\nl2=[0,1,2,3,4,5]\r\nfor i in range(n):\r\n k=input()\r\n l2.remove(l.index(k))\r\nprint(6-n)\r\nfor i in l2:\r\n print(l1[i])", "n = int(input())\r\ngems = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor _ in range(n):\r\n\ts = input()\r\n\tdel gems[s]\r\nprint(6-n)\r\nfor elem in gems:\r\n\tprint(gems[elem])", "#Infinity Gauntlet\r\nn = int(input())\r\nd = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul',\r\n 'red':'Reality','yellow':'Mind'}\r\nli = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nli1 = []\r\nfor i in range(n):\r\n li1.append(input())\r\nprint(6-n)\r\nfor i in li1:\r\n if i in li:\r\n li.remove(i)\r\nfor i in li:\r\n print(d.get(i))\r\n", "d={}\r\nd[\"purple\"]=\"Power\"\r\nd[\"green\"]=\"Time\"\r\nd[\"blue\"]=\"Space\"\r\nd[\"orange\"]=\"Soul\"\r\nd[\"red\"]=\"Reality\"\r\nd[\"yellow\"]=\"Mind\"\r\nl=[]\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nprint(6-n)\r\nfor z in d.keys():\r\n if z not in l:\r\n print(d[z])", "n = int(input())\r\ngems= {'red':'Reality','purple':'Power','yellow':'Mind','orange':'Soul','green':'Time','blue':'Space'}\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(input())\r\nprint(6-n)\r\nfor i in gems:\r\n\tif i not in l:\r\n\t\tprint(gems[i])", "n=int(input())\r\nd={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nfor _ in[0]*n:\r\n d.pop(input())\r\nprint(len(d))\r\nfor v in d.values():print(v)", "import sys\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n st = \"\"\"the Power Gem of purple color,\r\nthe Time Gem of green color,\r\nthe Space Gem of blue color,\r\nthe Soul Gem of orange color,\r\nthe Reality Gem of red color,\r\nthe Mind Gem of yellow color\"\"\"\r\n lst = st.split(\",\\n\")\r\n ind = {s.split()[-2]: s.split()[1] for s in lst}\r\n words = set([ac.read_str() for _ in range(ac.read_int())])\r\n ans = []\r\n for color in ind:\r\n if color not in words:\r\n ans.append(ind[color])\r\n ac.st(len(ans))\r\n for a in ans:\r\n ac.st(a)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "d={'purple':[1,'Power'],'green':[2,'Time'],'blue':[3,'Space'],'orange':[4,'Soul'],'red':[5,'Reality'],'yellow':[6,'Mind']}\r\ny=[]\r\nn=int(input())\r\nprint(6-n)\r\nfor _ in range(n):\r\n x=input()\r\n y.append(x)\r\nfor i in d:\r\n if i not in y:\r\n print(d[i][1])", "n=int(input())\r\nb=[]\r\nfor i in range(n):\r\n a=input()\r\n b.append(a)\r\nc=[]\r\nif \"purple\" not in b:\r\n c.append(\"Power\")\r\nif \"green\" not in b:\r\n c.append(\"Time\")\r\nif \"blue\" not in b:\r\n c.append(\"Space\")\r\nif \"orange\" not in b:\r\n c.append(\"Soul\")\r\nif \"red\" not in b:\r\n c.append(\"Reality\")\r\nif \"yellow\" not in b:\r\n c.append(\"Mind\")\r\nprint(len(c))\r\nfor i in range(len(c)):\r\n print(c[i])\r\n", "n = int(input())\r\ncolors = ['purple','green','blue','orange','red','yellow']\r\nlst = []\r\n\r\nfor i in range(n):\r\n c = str(input())\r\n lst.append(c)\r\n\r\na = set(colors)-set(lst)\r\nprint(len(a))\r\nfor i in a:\r\n if i == 'purple':\r\n print(\"Power\")\r\n continue\r\n elif i == 'green':\r\n print(\"Time\")\r\n continue\r\n elif i == 'blue':\r\n print(\"Space\")\r\n continue\r\n elif i == 'orange':\r\n print(\"Soul\")\r\n continue\r\n elif i == 'red':\r\n print(\"Reality\")\r\n continue\r\n else:\r\n print(\"Mind\")\r\n ", "dict1 = {\"purple\": \"Power\", \n \"green\": \"Time\", \n \"blue\": \"Space\", \n \"orange\": \"Soul\", \n \"red\": \"Reality\", \n \"yellow\": \"Mind\"}\n\nnum = int(input())\n\nfor i in range(num):\n color = input().lower()\n dict1.pop(color)\n\nprint(6 - num)\n\nfor value in dict1.values():\n print(value)\n\t \t\t \t\t\t\t\t \t \t \t\t\t\t \t \t \t \t\t", "gdict = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\nn = int(input())\nnl = []\nfor i in range(n):\n nl.append(input())\nprint(6-n)\nfor k, v in gdict.items():\n if k not in nl:\n print(gdict[k])\n\t \t \t \t\t\t \t\t \t\t\t\t \t \t\t \t \t", "stones = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\nn = int(input())\r\ninput_lst = []\r\noutput_lst = []\r\nfor i in range(n):\r\n input_lst.append(input())\r\nfor k, v in stones.items():\r\n if k not in input_lst:\r\n output_lst.append(v)\r\n\r\nif len(output_lst) == 0:\r\n print(0)\r\nelse:\r\n print(len(output_lst))\r\n for i in output_lst:\r\n print(i)", "color=['purple', 'green', 'blue', 'orange', 'red', 'yellow']\nname=['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\nn=int(input())\nif 0<=n<=6:\n m=6-n\n print(m)\n new_color=[]\n for i in range(n):\n clr=input()\n new_color.append(clr)\n printing=[]\n for i in range(len(color)):\n if color[i] not in new_color:\n printing.append(name[i])\nfor i in range(len(printing)-1, -1, -1):\n print(printing[i])\n\t \t\t \t \t \t \t \t \t \t \t\t\t \t\t\t", "a = {input().lower() for _ in range(int(input()))}\r\nb = {'purple': 'Power', 'green': 'Time',\r\n 'blue': 'Space', 'orange': 'Soul',\r\n 'red': 'Reality', 'yellow': 'Mind'}\r\nprint(6 - len(a))\r\nfor i in b.keys():\r\n if i not in a:\r\n print(b[i])\r\n", "d={'purple':'Power', 'green': 'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n del d[s]\r\nprint(6-n)\r\nfor i in d:\r\n print(d[i])", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"ot.out\",\"w\")\r\n\r\ngaunt={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\n\r\nn=int(input())\r\n\r\nfor i in range(n):\r\n\tn=input()\r\n\tgaunt.pop(n)\r\nprint(len(gaunt))\r\nfor i in gaunt.values():\r\n\tprint(i)", "n = int(input())\r\ncolor = []\r\ncolorNeeded = {\"Reality\":'red', \"Power\":'purple', \"Mind\":'yellow', \"Soul\":'orange', \"Time\":'green', \"Space\":'blue'}\r\nfor c in range(n):\r\n color.append( input() )\r\n\r\nprint( len(colorNeeded) - len(color) )\r\nfor stone,c in colorNeeded.items():\r\n if c not in color:\r\n print(stone)\r\n", "d = {\r\n 'purple' : 'Power',\r\n 'green' : 'Time',\r\n 'blue' : 'Space',\r\n 'orange' : 'Soul',\r\n 'red' : 'Reality',\r\n 'yellow' : 'Mind'\r\n}\r\nn = int(input())\r\nif n == 0:\r\n print(6)\r\n for i in d.values():\r\n print(i)\r\nelse:\r\n for i in range(n):\r\n c = input()\r\n d.pop(c)\r\n print(6 - n)\r\n for i in d.values():\r\n print(i)\r\n", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#\r\n\r\nstone=['Power','Time','Space','Soul','Reality','Mind']\r\ncolour=['purple','green','blue','orange','red','yellow']\r\ntmp=[]\r\nn=int(input())\r\nfor i in range(n):\r\n s=str(input())\r\n tmp.append(s)\r\nprint(6-n)\r\ntmp=list(set(tmp)^set(colour))\r\nfor i in range(len(tmp)):\r\n print(stone[colour.index(tmp[i])])", "d = {\"Power\" : \"purple\" ,\"Time\" : \"green\" , \"Space\" : \"blue\" ,\r\n \"Soul\" : \"orange\" ,\"Reality\" :\"red\" ,\"Mind\" : \"yellow\"}\r\nn = int(input())\r\nz = []\r\nl = []\r\nprint(6-n)\r\nfor i in range(n):\r\n\tn = input()\r\n\tz.append(n)\r\nfor x in d:\r\n\tl.append(d[x])\r\nfor q in z:\r\n\tl.remove(q)\r\nfor i in range(len(l)):\r\n\tfor w in d:\r\n\t\tif l[i] == d[w]:\r\n\t\t\tprint(w)\r\n\r\n\r\n\r\n", "d = [\"red\",\"green\",\"yellow\",\"blue\",\"orange\",\"purple\"]\r\nq = {\r\n \"purple\" : \"Power\",\r\n \"green\" : \"Time\",\r\n \"blue\" : \"Space\",\r\n \"orange\" : \"Soul\",\r\n \"red\" : \"Reality\",\r\n \"yellow\" : \"Mind\"\r\n }\r\nif __name__ == '__main__':\r\n n = int(input())\r\n c = 0\r\n for i in range(n):\r\n s = input()\r\n if s in d:\r\n p = d.index(s)\r\n d.pop(p)\r\n print(len(d))\r\n for i in d:\r\n print(q[i])\r\n \r\n", "n = int(input())\r\na = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nb = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\nfor _ in range(n):\r\n a.remove(input())\r\nprint(len(a))\r\nfor i in range(len(a)):\r\n print(b[a[i]])", "infinity_gems = int(input())\n\ngem_names = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\ncolors = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\n\nmissing_list = []\n\nif infinity_gems != 0:\n for i in range(infinity_gems):\n missing_colors = input()\n missing_list.append(missing_colors)\nprint(6 - infinity_gems)\n\nfor i in range(6):\n if colors[i] not in missing_list:\n print(gem_names[i])\n \t \t\t \t \t\t\t \t \t\t \t\t \t\t\t \t", "lst=[\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\nn=int(input())\nlst2=[]\nfor i in range(n):\n x=input()\n if x.lower()==\"purple\":\n lst2.append(\"Power\")\n elif x.lower()==\"green\":\n lst2.append(\"Time\")\n elif x.lower()==\"blue\":\n lst2.append(\"Space\")\n elif x.lower()==\"orange\":\n lst2.append(\"Soul\")\n elif x.lower()==\"red\":\n lst2.append(\"Reality\")\n elif x.lower()==\"yellow\":\n lst2.append(\"Mind\")\nan=6-n\nlst3=[]\nfor i in range(len(lst)):\n if lst[i] not in lst2:\n lst3.append(lst[i])\nprint(an)\nfor i in lst3:\n print(i)\n \t \t\t\t \t\t \t\t\t \t \t \t \t\t", "num_colors = int(input())\r\nprint(6 - num_colors)\r\ncolors = []\r\nfor color in range(num_colors):\r\n color = input()\r\n colors.append(color)\r\nif \"purple\" not in colors:\r\n print(\"Power\")\r\nif \"green\" not in colors:\r\n print(\"Time\")\r\nif \"blue\" not in colors:\r\n print(\"Space\")\r\nif \"orange\" not in colors:\r\n print(\"Soul\")\r\nif \"red\" not in colors:\r\n print(\"Reality\")\r\nif \"yellow\" not in colors:\r\n print(\"Mind\")", "d = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\ns = set()\r\nn = int(input())\r\nfor _ in range(n):\r\n st = input()\r\n s.add(st)\r\nprint(6-n)\r\nfor key,value in d.items():\r\n if key not in s:\r\n print(value)", "n = int(input())\r\nhashMap = {\"purple\" : \"Power\", \"green\" : \"Time\", \"blue\" : \"Space\", \"orange\" : \"Soul\", \"red\" : \"Reality\", \"yellow\" : \"Mind\"}\r\n\r\nfor _ in range(n):\r\n s = str(input())\r\n del hashMap[s]\r\n \r\n\r\nif len(hashMap) == 0:\r\n print(0)\r\nelse:\r\n print(len(hashMap))\r\n for i in hashMap:\r\n print(hashMap[i])", "n = int(input())\r\ns = []\r\nfor _ in range(n):\r\n s1 = input().lower()\r\n s.append(s1)\r\n#print(s)\r\nd = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nd1 = list(d.keys())\r\nfor colors in s:\r\n if colors in d1:\r\n del d[colors]\r\n #print(d)\r\nprint(len(d))\r\nfor i in d:\r\n print(d[i])", "n=int(input())\r\n\r\nlc=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nls=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\",]\r\nl1=[]\r\nla=[]\r\nln=[]\r\nif n>0:\r\n for i in range(n):\r\n r=input()\r\n l1.append(r)\r\n for i in range(n):\r\n for j in range(len(lc)):\r\n if (l1[i]==lc[j]):\r\n lc.remove(lc[j])\r\n ls.remove(ls[j])\r\n break\r\n print(len(ls))\r\n for i in range(len(ls)):\r\n print(ls[i])\r\nelse:\r\n print(len(ls))\r\n for i in range(len(ls)):\r\n print(ls[i])", "import sys\r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef _list(): return map(int, input().strip().split())\r\ndef _int(): return int(input())\r\ndef _str(): return input()\r\ndef _list1(): return map(str, input().strip().split())\r\n\r\n\r\n# suppose a function called main() and\r\n# all the operations are performed\r\ndef main():\r\n n = _int()\r\n res = []\r\n while n:\r\n n-=1\r\n s = _str()\r\n res.append(s)\r\n print(6-len(res))\r\n power = ['Power','Time','Space','Soul','Reality','Mind']\r\n color = ['purple','green','blue','orange','red','yellow']\r\n for ind,i in enumerate(color):\r\n if i not in res:\r\n print(power[ind])\r\n \r\n \r\n \r\n \r\n \r\n\r\n# call the main method\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "gems = {}\r\ngems[\"purple\"] = \"Power\"\r\ngems[\"green\"] = \"Time\"\r\ngems[\"blue\"] = \"Space\"\r\ngems[\"orange\"] = \"Soul\"\r\ngems[\"red\"] = \"Reality\"\r\ngems[\"yellow\"] = \"Mind\"\r\n\r\na = int(input(\"\"))\r\n\r\nkk = []\r\nfor i in range(a):\r\n ok = input(\"\")\r\n kk.append(ok)\r\n\r\nfor i in kk:\r\n gems.pop(i)\r\nprint(6-a)\r\n\r\nfor k in gems:\r\n print(gems[k])", "n=int(input())\r\nd={\"purple\":[0,\"Power\"],\"green\":[0,\"Time\"],\"blue\":[0,\"Space\"],\"orange\":[0,\"Soul\"],\"red\":[0,\"Reality\"],\"yellow\":[0,\"Mind\"]}\r\nfor _ in range(n):\r\n s=input()\r\n d[s][0]=d[s][0]+1\r\nc=0\r\nfor i in d:\r\n if d[i][0]==0:\r\n c=c+1\r\nprint(c)\r\nfor i in d:\r\n if d[i][0]==0:\r\n print(d[i][1])\r\n ", "n=int(input())\r\nx=[]\r\ny=[\"purple\",\"Power\",\r\n \"green\",\"Time\",\r\n \"blue\",\"Space\",\r\n \"orange\",\"Soul\",\r\n \"red\",\"Reality\",\r\n \"yellow\",\"Mind\"]\r\nwhile(n):\r\n n=n-1\r\n x.append(input())\r\nprint(abs(len(x)-(len(y)//2)))\r\nfor i in range(0,len(y)-1,2):\r\n if(x.count(y[i])<1):\r\n print(y[i+1])\r\n\r\n", "d={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn = int(input())\r\nfor i in range(n):\r\n c = input()\r\n del d[c]\r\nprint(6-n) \r\nprint(*d.values()) \r\n ", "gems={\r\n \"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\":\"Reality\",\r\n \"yellow\":\"Mind\",\r\n}\r\ncolor=list(gems.keys())\r\nm=int(input())\r\ncInp=[None]*m\r\nfor i in range(m):\r\n c=input()\r\n cInp.append(c)\r\nprint(6-m)\r\ncolor=[i for i in color if i not in cInp]\r\nfor i in color:\r\n print(gems.get(i))", "a,b,c,d,e,f = [False]*6\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s == \"purple\":\r\n a = True\r\n elif s == \"green\":\r\n b = True\r\n elif s == \"blue\":\r\n c = True\r\n elif s == \"orange\":\r\n d = True\r\n elif s == \"red\":\r\n e = True\r\n elif s == \"yellow\":\r\n f = True\r\nprint(sum([int(n) for n in [not a,not b,not c,not d,not e,not f]]))\r\nprint(\"Power\\n\" if not a else \"\", end=\"\")\r\nprint(\"Time\\n\" if not b else \"\", end=\"\")\r\nprint(\"Space\\n\" if not c else \"\", end = \"\")\r\nprint(\"Soul\\n\" if not d else \"\", end = \"\")\r\nprint(\"Reality\\n\" if not e else \"\", end = \"\")\r\nprint(\"Mind\\n\" if not f else \"\", end = \"\")", "#E - Infinity Gauntlet\nnum = int(input())\nstone = {\"purple\":\"Power\", \"green\":\"Time\", 'blue':'Space',\n 'orange':'Soul', 'red':\"Reality\", 'yellow':'Mind'}\nsize = len(stone)\ncount = 0\nlst = []\nabsent = []\n\nfor i in range(num):\n name = input()\n if name==name.lower() and name in stone:\n lst.append(name)\n\nfor item in stone.keys(): \n if item not in lst:\n count +=1\n absent.append(stone[item])\n \n \nprint(len(absent)) \nfor item in absent:\n print(item)\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\nd={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(n):\r\n\ts=input()\r\n\tdel d[s]\r\nprint(6-n)\r\nfor i in d:\r\n\tprint(d[i])", "d = {\n 'Power': 'purple', \n 'Time': 'green', \n 'Space': 'blue', \n 'Soul': 'orange', \n 'Reality': 'red', \n 'Mind': 'yellow'\n}\nn = int(input())\nlst = []\nfor _ in range(n):\n s = input()\n lst.append(s)\nprint(6 - n)\nfor key, value in d.items():\n if d[key] not in lst:\n print(key)\n\t\t \t \t \t\t \t\t\t \t\t\t\t\t\t \t\t\t", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[10]:\n\n\nn = int(input())\nl = []\nfor m in range(n):\n l2 = input()\n l.append(l2)\nd = {'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\nfor i in range(n):\n del d[l[i]]\nl1 = list(d.values())\nprint(len(l1))\nfor j in range(len(l1)):\n print(l1[j])\n\n", "a = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\nmp = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nfor i in range(int(input())):\r\n s = input()\r\n a.remove(s)\r\nprint(len(a))\r\nfor i in a:\r\n print(mp[i])", "\r\na = int(input())\r\nmapping = {'purple': 'Power', 'green': 'Time', 'blue': 'Space',\r\n 'orange': \"Soul\", 'red': 'Reality', 'yellow': 'Mind'}\r\n\r\nfor i in range(0, a):\r\n s = input()\r\n del mapping[s]\r\n\r\nprint(6-a)\r\no = mapping.values()\r\nfor i in o:\r\n print(i)\r\n", "gem = [[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"],[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]]\r\ngemX = [\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\n\r\nn = int(input())\r\nfor i in range (n):\r\n gemX.remove(input())\r\n\r\nprint(len(gemX))\r\nfor i in range(len(gemX)):\r\n for j in range(1):\r\n for k in range (len(gem[j])):\r\n if gemX[i] == gem[j][k]:\r\n print(gem[j+1][k])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 21 15:08:11 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\nn=int(input())\r\nc=0\r\nl=[]\r\nwhile c<n:\r\n b=input()\r\n b=b.lower()\r\n l.append(b)\r\n c+=1\r\ng=0\r\nj=[]\r\nv=['purple','green','blue','orange','red','yellow']\r\np=['Power','Time','Space','Soul','Reality','Mind']\r\nfor i in range(len(v)):\r\n if not v[i] in l:\r\n g+=1\r\n j.append(p[i])\r\nprint(g)\r\nfor i in j:\r\n print(i)\r\n \r\n \r\n \r\n ", "# Problem Name :Infinity Gauntlet\r\n# problem Link : https://codeforces.com/problemset/problem/987/A\r\n# Input Operation\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\n# output Operation\r\ncheck=[\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\ncheck2=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nprint(6-n)\r\nfor i in range(6):\r\n if check[i] in arr:\r\n continue\r\n else:\r\n print(check2[i])\r\n", "n=int(input())\r\ngauntlet={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(n):\r\n stones=input()\r\n del gauntlet[stones]\r\nprint(6-n)\r\nfor i in gauntlet:\r\n print(gauntlet[i])\r\n \r\n", "dct = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\nlst = list()\r\nn = int(input())\r\nfor _ in range(n):\r\n lst.append(input())\r\n\r\nprint(6 - n)\r\nfor stone in dct.keys():\r\n if stone not in lst:\r\n print(dct[stone])\r\n", "n=int(input())\r\nd={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(n):\r\n s=input()\r\n d[s]=0\r\nprint(6-n)\r\nfor i in d:\r\n if d[i]!=0:\r\n print(d[i])\r\n", "n=int(input())\r\nA={'red':'Reality','green':'Time','blue':'Space','orange':'Soul','yellow':'Mind','purple':'Power'}\r\nfor i in range(n):\r\n a=input()\r\n del A[a]\r\nprint (6-n)\r\nfor i in A:\r\n print (A[i])", "gems = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind'\r\n}\r\n\r\nn = int(input())\r\npresent_gems = set(input() for i in range(n))\r\n\r\nabsent_gems = set(gems.values()) - set([gems[color] for color in present_gems])\r\nm = len(absent_gems)\r\n\r\nprint(m)\r\nfor gem in sorted(absent_gems):\r\n print(gem)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nAB\r\nAABB\r\nABAB\r\n\r\nBBAA X\r\nAABBA\r\n\r\n010101\r\n\r\nx+y = n\r\nx = n - y\r\nx*y vs (n-y)^2\r\n\r\n0 = 1\r\n1 = 1\r\n01 = max(1*1) = 1\r\n10 = 1\r\n00 = 4\r\n11 = 4\r\n11110 = 16\r\n\r\ncompare biggest group of 1's 0's and num1's * num0's\r\n\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n gems = {}\r\n gems[\"purple\"] = \"Power\"\r\n gems[\"green\"] = \"Time\"\r\n gems[\"blue\"] = \"Space\"\r\n gems[\"orange\"] = \"Soul\"\r\n gems[\"red\"] = \"Reality\"\r\n gems[\"yellow\"] = \"Mind\"\r\n\r\n t = II()\r\n for _ in range(t): \r\n del gems[I().strip()]\r\n \r\n print(len(gems))\r\n for gem in gems.values():\r\n print(gem)\r\n\r\n\r\nsolve()", "#INFINITY GAUNTLET(987A)\r\n\r\nt = int(input())\r\nlst = []\r\nlst1 = []\r\nl = [\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nl1 = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\n\r\nfor i in range(t):\r\n str = input()\r\n lst.append(str)\r\n\r\nfor i in l:\r\n if i not in lst:\r\n lst1.append(i)\r\n#print(lst1)\r\nres = 6 - t\r\nprint(res)\r\nfor i in lst1:\r\n print(l1[i])\r\n\r\n\r\n ", "n=int(input())\r\nb=set([\"red\", \"purple\", \"yellow\", \"orange\", \"green\", \"blue\"])\r\nc={\"red\": \"Reality\", \"orange\": \"Soul\", \"yellow\": \"Mind\", \"green\":\"Time\", \"blue\":\"Space\", \"purple\":\"Power\"}\r\na=set()\r\nfor i in range(n):\r\n a.add(input())\r\na=b-a\r\nprint(len(a))\r\nfor i in a:\r\n print(c[i])", "d={\r\n \"purple\" : \"Power\",\r\n \"green\" : \"Time\",\r\n \"blue\" : \"Space\",\r\n \"orange\" : \"Soul\",\r\n \"red\" : \"Reality\",\r\n \"yellow\" : \"Mind\"\r\n}\r\nn = int(input())\r\ns = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\ncolors = []\r\nfor i in range(0, n):\r\n color = input()\r\n colors.append(color)\r\nresult = []\r\nfor c in s:\r\n if c not in colors:\r\n result.append(d[c])\r\nprint(len(result))\r\nfor c in result:\r\n print(c)", "n=int(input())\r\nprint(6-n)\r\nd={'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n d.pop(a[i])\r\nfor i in (d):\r\n print(d[i])\r\n", "import time\r\n\r\n\r\ndef identifyAbsentGems(gemsList):\r\n absentList = []\r\n cat = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\n\r\n for x in gemsList:\r\n if x in cat:\r\n del cat[x]\r\n # print(cat)\r\n\r\n return cat\r\n\r\n\r\ndef solve():\r\n gems = int(input())\r\n gemsList =[]\r\n\r\n for x in range(gems):\r\n gemsList.append(input())\r\n absent = identifyAbsentGems(gemsList)\r\n\r\n print(len(absent))\r\n for y, val in absent.items():\r\n print(val)\r\n\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()\r\n", "user_input=int(input())\ndict1={'Power':'purple',\"Time\":'green','Space':'blue','Soul':'orange','Reality':'red','Mind':'yellow'}\nlist1=[]\nlist2=[]\nfor i in range(user_input):\n user_input1=str(input())\n list1.append(user_input1)\nfor j in dict1.keys():\n if dict1[j] not in list1:\n list2.append(j) \nprint(6-user_input)\nfor j in list2:\n print(j) \n \t \t\t \t\t\t \t\t \t\t \t\t \t\t \t\t\t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nthe Power Gem of purple color,\r\nthe Time Gem of green color,\r\nthe Space Gem of blue color,\r\nthe Soul Gem of orange color,\r\nthe Reality Gem of red color,\r\nthe Mind Gem of yellow color\r\n\"\"\"\r\n\r\n#s1 dict , s2 set\r\ns1={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\ns2=set()\r\nn=int(input())\r\nfor i in range (n):\r\n color=input()\r\n s2.add(color)\r\nrem=6-n\r\nprint(rem)\r\nfor (key,value) in s1.items():\r\n if key not in s2:\r\n print(value)\r\n \r\n\r\n", "d={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor _ in[0]*int(input()):d.pop(input())\r\nprint(len(d),*d.values(),sep='\\n')", "n=int(input())\r\nl=[]\r\nd={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nfor i in range(n):\r\n l.append(input())\r\nd1=dict.fromkeys(l)\r\nprint(6-len(l))\r\nfor i in d:\r\n if(i not in d1):\r\n print(d[i])\r\n", "s = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\r\ns_ = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\ns__ = []\r\ns___ = []\r\nfor _ in range(int(input())):\r\n s__.append(input())\r\nfor i in s_:\r\n if i not in s__:\r\n s___.append(s[i])\r\nprint(len(s___))\r\nprint(*s___, sep='\\n')\r\n", "nameCol = {'Power' : 'purple', \n 'Time' : 'green', \n 'Space' : 'blue', \n 'Soul' : 'orange', \n 'Reality' : 'red', \n 'Mind' : 'yellow'}\nn = int(input())\nprint(6 - n)\nlist = []\nfor _ in range(n): list.append(input())\nfor name, col in nameCol.items():\n if nameCol[name] not in list: print(name)\n \t\t \t \t \t \t \t \t \t\t", "actually={'purple':'Power','green': 'Time',\r\n'blue':'Space','orange':'Soul','red':'Reality',\r\n'yellow':'Mind'}\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n del actually[s]\r\nprint(6-n)\r\nfor i in actually:\r\n print(actually[i])\r\n", "d={\r\n \"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\":\"Reality\",\r\n \"yellow\":\"Mind\"\r\n}\r\nx=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\nprint(6-n)\r\nl=set(x)-set(a)\r\nfor i in l:\r\n print(*d[i],sep=\"\")", "numgems=int(input())\r\ncolorlist={\"purple\":\"Power\",\"green\":\"Time\",\"orange\":\"Soul\",\"blue\":\"Space\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nfor i in range(numgems):\r\n del colorlist[input()]\r\nprint(6-numgems)\r\nfor i in colorlist.values():print(i)", "m = int(input())\r\nd = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nif m==0:\r\n print(6)\r\n for key in d:\r\n print(d[key])\r\nelse:\r\n print(6-m)\r\n lst=[]\r\n for _ in range(m):\r\n lst.append(input())\r\n \r\n for key in d:\r\n if key not in lst:\r\n print(d[key])", "n = int(input())\r\n\r\nlc = ['purple','green','blue','orange','red','yellow']\r\nls = ['Power','Time','Space','Soul','Reality','Mind']\r\n\r\nfor i in range(n):\r\n s = str(input())\r\n \r\n dum = lc.index(s)\r\n ls[dum] = ''\r\n\r\nprint(6-n)\r\nfor s in ls:\r\n if s != '':\r\n print(s)\r\n", "a={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nt=int(input())\r\nfor x in range(t) :\r\n\ts=input()\r\n\tdel a[s]\r\nprint(6-t)\r\nfor x in a:\r\n\tprint(a[x])", "n = int(input())\ns = [input() for i in range(n)]\n\nmemo = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\": \"Mind\"}\nset_ = set([])\nfor i in range(n):\n set_.add(s[i])\n\nprint(6-n)\nfor i in memo:\n if not i in set_:\n print(memo[i])\n \t \t \t \t \t \t \t \t\t \t \t\t \t \t", "stones = {}\r\nstones['purple'] = 'Power'\r\nstones['green'] = 'Time'\r\nstones['blue'] = 'Space'\r\nstones['orange'] = 'Soul'\r\nstones['red'] = 'Reality'\r\nstones['yellow'] = 'Mind'\r\n\r\ndef missing_stones(n, colors):\r\n print(6 - n)\r\n for stone in stones:\r\n if stone not in colors:\r\n print(stones[stone])\r\n \r\n \r\nn = int(input())\r\ncolors = []\r\nfor i in range(n):\r\n colors.append(input())\r\n\r\nmissing_stones(n, colors)", "\r\ngems = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn = int(input())\r\ncurrentGems = []\r\ncolors = gems.keys()\r\nfor i in range(n):\r\n currentGems.append(input())\r\n\r\nlostGems = len(gems) - len(currentGems)\r\nprint(lostGems)\r\nfor color in colors:\r\n if color not in currentGems:\r\n print(gems[color])\r\n", "n = int(input())\r\nl1 = []\r\nk=[]\r\ncount = 0\r\nl = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nfor i in range(n):\r\n\ta = input()\r\n\tk.append(a)\r\nfor i in l:\r\n\tif i not in k:\r\n\t\tcount += 1\r\n\t\tl1.append(l[i])\r\nprint(count)\r\nfor i in l1:\r\n\tprint(i)\t\t", "a = int(input())\r\n\r\n\r\nall_gems = {\"purple\": \"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\ncolors = ['red', 'purple', 'yellow', 'orange','green', 'blue']\r\n\r\n\r\nfor i in range (a) :\r\n colors.remove(input())\r\n \r\n\r\nprint (6 - a) \r\nfor i in colors:\r\n print (all_gems[i])", "stones = {'Power': 'purple', 'Time':'green', 'Space':'blue', 'Soul':'orange','Reality':'red', 'Mind':'yellow'}\r\nstones_list = {'purple','green', 'blue', 'orange', 'red', 'yellow'}\r\nst = []\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n st.append(input())\r\nsto = set(st)\r\ndiff = stones_list.difference(sto)\r\ndiff = list(diff)\r\nprint(len(diff))\r\nfor d in diff:\r\n keys = [k for k, v in stones.items() if v == d]\r\n print(*keys)\r\n\r\n", "def do():\r\n res = [\"Time\", \"Mind\", \"Soul\", \"Power\", \"Reality\", \"Space\"]\r\n d = {}\r\n d[\"purple\"] = \"Power\"\r\n d[\"green\"] = \"Time\"\r\n d[\"blue\"] = \"Space\"\r\n d[\"orange\"] = \"Soul\"\r\n d[\"red\"] = \"Reality\"\r\n d[\"yellow\"] = \"Mind\"\r\n n = int(input())\r\n for _ in range(n):\r\n s = input()\r\n s = d[s]\r\n if s in res:\r\n i = res.index(s)\r\n del res[i]\r\n print(len(res))\r\n print(\"\\n\".join(res))\r\n\r\ndo()\r\n\r\n\r\n\r\ndef templ():\r\n #input = sys.stdin.readline\r\n from pprint import pprint\r\n #import sys\r\n #sys.setrecursionlimit(100000)\r\n\r\n\r\n q = int(input())\r\n for _ in range(q):\r\n s = input()\r\n n = int(input())\r\n n, k = map(int, input().split())\r\n dat = list(map(int, input().split()))\r\n\r\n\r\n dat = [1, 2, 3]\r\n print(\" \".join(list(map(str, res))))\r\n\r\n pass\r\n import math\r\n math.ceil(1.2)\r\n math.floor(1.2)\r\n round(1.2, 3)\r\n\r\n", "gems = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\ncolours = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\nn = int(input())\r\nnot_ = []\r\nfor i in range(n):\r\n x = input()\r\n not_.append(x)\r\ngem = []\r\nfor i in range(0, len(colours)):\r\n if colours[i] not in not_:\r\n gem.append(gems[i])\r\n else:\r\n continue\r\nprint(len(gem))\r\nfor i in gem:\r\n print(i)\r\n", "thanos={}\r\nthanos[\"purple\"]=\"Power\"\r\nthanos[\"green\"]=\"Time\"\r\nthanos[\"blue\"]=\"Space\"\r\nthanos[\"orange\"]=\"Soul\"\r\nthanos[\"red\"]=\"Reality\"\r\nthanos[\"yellow\"]=\"Mind\"\r\nli=[]\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n li.append(s)\r\nprint(6-n)\r\nfor z in thanos.keys():\r\n if z not in li:\r\n print(thanos[z])", "n=int(input())\r\nsample=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nsample1=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\ngiven=[]\r\nfor i in range(0,n):\r\n\ts=input()\r\n\tgiven.append(s)\r\nprint(len(sample)-len(given))\r\nfor j in range(0,len(sample)):\r\n\tif(sample[j] not in given):\r\n\t\tprint(sample1[j])", "n=int(input())\r\ninfinity={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nprint(6-n)\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor item in infinity:\r\n if item not in l:\r\n print(infinity[item])\r\n", "n = int(input())\r\nk = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nc = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nt = [True] * 6\r\nfor i in range(n):\r\n j = c.index(input())\r\n t[j] = False\r\nprint(6 - n)\r\nfor i in range(6):\r\n if t[i]:\r\n print(k[i])\r\n", "n=int(input())\r\nls=[]\r\nfor i in range(n):\r\n ls.append(input())\r\nprint(6-n)\r\nif \"red\" not in ls:\r\n print(\"Reality\")\r\nif \"purple\" not in ls:\r\n print(\"Power\")\r\nif \"green\" not in ls:\r\n print(\"Time\")\r\nif \"blue\" not in ls:\r\n print(\"Space\")\r\nif \"orange\" not in ls:\r\n print(\"Soul\")\r\nif \"yellow\" not in ls:\r\n print(\"Mind\")\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nl1 = [\"Time\",\"Mind\",\"Soul\",\"Power\",\"Reality\",\"Space\"]\nl2 = [\"green\",\"yellow\",\"orange\",\"purple\",\"red\",\"blue\"]\nlst = []\nfor i in range(n):\n b = str(input()).lower()\n lst.append(b)\nprint(6-n)\nfor j in l2:\n if j not in lst:\n print(l1[l2.index(j)])\n \n \n \t \t \t \t\t \t \t \t\t \t \t\t \t \t", "n = int(input())\r\ninp = []\r\nfor i in range(0, n):\r\n m = input()\r\n if m == 'purple':\r\n inp.append('Power')\r\n elif m == 'green':\r\n inp.append('Time')\r\n elif m == 'blue':\r\n inp.append('Space')\r\n elif m == 'orange':\r\n inp.append('Soul')\r\n elif m == 'red':\r\n inp.append('Reality')\r\n elif m == 'yellow':\r\n inp.append('Mind')\r\n\r\nL = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\n\r\nprint(6-n)\r\nfor i in range(0, 6):\r\n if not L[i] in inp:\r\n print(L[i])\r\n", "t = int(input())\r\nref = {\"red\":\"Reality\",\"purple\":\"Power\",\"yellow\":\"Mind\",\"orange\":\"Soul\",\"green\":\"Time\",\"blue\":\"Space\"}\r\nans = []\r\nfor x in range(t):\r\n stone = input().lower()\r\n ans.append(stone)\r\n\r\n\r\nmis = [b for a,b in ref.items() if a not in ans]\r\n\r\nprint (6-t)\r\nfor z in mis:\r\n print (z)\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "stones = int(input())\r\nif stones == 6:\r\n print(0)\r\nelse:\r\n d = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\n z = []\r\n\r\n for i in range(stones):\r\n s = input()\r\n z += s,\r\n\r\n print(6 - stones)\r\n for i in d:\r\n if i not in z:\r\n print(d[i])", "li_gem=['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\nli_col=['purple', 'green', 'blue', 'orange', 'red', 'yellow']\n\nn=int(input())\nli=[]\nfor i in range(n):\n e=input()\n li.append(e)\nprint(6-len(li))\nfor i in range(6):\n if(li_col[i] not in li):\n print(li_gem[i])\n\t \t\t \t\t \t \t \t\t \t \t\t\t\t\t\t \t\t\t", "n = int(input())\r\nl = []\r\na = n\r\nwhile n:\r\n\ts = input()\r\n\tl.append(s)\r\n\tn-=1\r\nlst= [\"red\",\"purple\",\"yellow\",\"orange\",\"green\",\"blue\"]\r\ndict = {\"red\":\"Reality\" ,\"purple\":\"Power\",\"yellow\":\"Mind\",\"orange\":\"Soul\",\"green\":\"Time\",\"blue\":\"Space\"}\r\ni = 0\r\nprint(6-a)\r\nwhile i<6:\r\n\tif lst[i] not in l:\r\n\t\tprint(dict[lst[i]])\r\n\ti+=1", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-17 23:08:52\nLastEditTime: 2021-11-17 23:16:15\nDescription: Infinity Gauntlet\nFilePath: CF987A.py\n'''\n\n\ndef func():\n gems = [[\"Power\", \"purple\"], [\"Time\", \"green\"], [\"Space\", \"blue\"], [\n \"Soul\", \"orange\"], [\"Reality\", \"red\"], [\"Mind\", \"yellow\"]]\n\n n = int(input())\n lst = []\n for _ in range(n):\n lst.append(input().strip())\n\n print(6 - n)\n for item in gems:\n if item[1] not in lst:\n print(item[0])\n\n\nif __name__ == '__main__':\n func()\n", "a = int(input())\r\nilk = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\r\nson = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\ncikar = []\r\nfor i in range(a):\r\n x = str(input())\r\n b = son.index(x)\r\n cikar.append(ilk[b])\r\nfor i in range(len(cikar)):\r\n if cikar[i] in ilk:\r\n ilk.remove(cikar[i])\r\n \r\nprint(len(ilk))\r\nfor i in range(len(ilk)):\r\n print(ilk[len(ilk)-i-1])", "a=['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nb=['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nn=int(input())\r\ni=[]\r\nfor _ in range(n):\r\n s=input()\r\n i+=[a.index(s)]\r\n\r\nm=6-n\r\nprint(m)\r\nfor x in range(6):\r\n if x not in i:\r\n print(b[x])\r\n", "n=int(input())\r\nl=[]\r\nd=dict()\r\nd[\"red\"]=\"Reality\"\r\nd[\"purple\"]=\"Power\"\r\nd[\"green\"]=\"Time\"\r\nd[\"blue\"]=\"Space\"\r\nd[\"yellow\"]=\"Mind\"\r\nd[\"orange\"]=\"Soul\"\r\nfor i in range(n):\r\n l.append(input())\r\nx=6-len(set(l))\r\nprint(x)\r\nfor key,value in d.items():\r\n if key not in l:\r\n print(value)", "dict_stones = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nn = int(input())\r\nm = 6 - n\r\ncolors = []\r\n\r\nwhile n > 0:\r\n color = str(input())\r\n colors.append(color)\r\n \r\n n -= 1\r\nstone_names = [value for key, value in dict_stones.items() if key not in colors]\r\n\r\nprint(m)\r\nfor name in stone_names:\r\n print(name)", "#!python3\n\"\"\"\nAuthor: w1ld [dog] inbox [dot] ru\n\"\"\"\n\nfrom collections import deque, Counter\nimport array\nfrom itertools import combinations, permutations\nfrom math import sqrt\n# import unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\nn = read_int()\ns = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\nfor i in range(n):\n k = input().strip()\n if k in s:\n del s[k]\nprint(len(s))\nfor k in s:\n print(s[k])\n\n\n", "gems = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nn = int(input())\r\nhave = []\r\nfor i in range(n):\r\n have.append(input())\r\nnot_have = []\r\nfor gem in list(gems.keys()):\r\n if gem not in have:\r\n not_have.append(gem)\r\nprint(len(not_have))\r\nfor i in not_have:\r\n print(gems[i])", "stones = {'purple': 'Power', 'green': 'Time', 'blue': 'Space', 'orange': 'Soul', 'red': 'Reality', 'yellow': 'Mind'}\r\nm = int(input())\r\nwhile m > 0:\r\n m -= 1\r\n del stones[input()]\r\nprint(len(stones))\r\nfor key, value in stones.items():\r\n print(value)\r\n", "n = int(input())\r\ngems = {\r\n 'purple': 'Power',\r\n 'green': 'Time',\r\n 'blue': 'Space',\r\n 'orange': 'Soul',\r\n 'red': 'Reality',\r\n 'yellow': 'Mind',\r\n}\r\nfor i in range(n):\r\n x = input()\r\n del gems[x]\r\nprint(6 - n)\r\nif n != 6:\r\n for values in gems.values():\r\n print(values)", "from collections import defaultdict\r\nx = int(input())\r\nstone = defaultdict(str)\r\nstone[\"red\"] = \"Reality\"\r\nstone[\"yellow\"] = \"Mind\"\r\nstone[\"orange\"] = \"Soul\"\r\nstone[\"blue\"] = \"Space\"\r\nstone[\"green\"] = \"Time\"\r\nstone[\"purple\"] = \"Power\"\r\nfor _ in range(x):\r\n s = input()\r\n stone[s] = \"\"\r\nprint(6-x)\r\nfor k in stone.keys():\r\n if stone[k] != \"\":\r\n print(stone[k])\r\n", "gem={'purple':'Power',\r\n 'green':'Time',\r\n 'blue':'Space',\r\n 'orange':'Soul',\r\n 'red':'Reality',\r\n 'yellow':'Mind'}\r\nn=int(input())\r\ncolor_given=set(input() for k in range(n))\r\ncolor_missing=set(gem.keys())-color_given\r\nm=len(color_missing)\r\nprint(m)\r\nfor color in color_missing:\r\n print(gem[color])\r\n", "d={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\nlt=d.keys\nn=eval(input())\nfor i in range(n):\n s=input()\n del d[s]\n #a=lt.index(s)\n #del lt[a]\nlis=list(d.values())\nprint(len(lis))\nfor i in range(len(lis)):\n print(lis[i])\n\t\t\t \t \t \t\t\t\t \t \t \t\t\t\t \t\t", "import sys\r\n\r\nrd = sys.stdin.readline\r\n\r\nstones = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\nfor _ in range(int(rd())):\r\n\r\n stones.pop(rd().strip())\r\n\r\nprint(len(stones.values()))\r\n\r\nfor i in stones.values(): print(i)\r\n", "def Thanos():\r\n\r\n\tpowers = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\n\r\n\r\n\tn = int(input())\r\n\tfor i in range(n):\r\n\t\tpowers.pop(input())\r\n\r\n\tprint(len(powers))\r\n\tfor key, val in powers.items():\r\n\t\tprint(val)\r\n\r\nThanos()", "m = int(input())\nlist1 = []\nthanos = {\"green\" : \"Time\",\"yellow\" : \"Mind\",\"orange\" : \"Soul\",\"purple\" : \"Power\",\"red\" : \"Reality\",\"blue\" : \"Space\"}\nif m!=0:\n for i in range(m):\n list1.append(input())\n print(len(thanos)-m)\n for j in thanos:\n if j not in list1:\n print(thanos[j])\nelse:\n print(6)\n for k in thanos:\n print(thanos[k])\n \t \t \t\t \t \t \t \t\t \t \t", "n=int(input())\r\nls1={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nls=[]\r\nls2=[]\r\ncnt=0\r\nfor i in range(n):\r\n\tls.append(str(input()).lower())\r\nif \"purple\" not in ls:\r\n\tls2.append(\"purple\")\r\n\tcnt+=1\r\nif \"green\" not in ls:\r\n\tls2.append(\"green\")\r\n\tcnt+=1\r\nif \"blue\" not in ls:\r\n\tls2.append(\"blue\")\r\n\tcnt+=1\r\nif \"orange\" not in ls:\r\n\tls2.append(\"orange\")\r\n\tcnt+=1\r\nif \"red\" not in ls:\r\n\tls2.append(\"red\")\r\n\tcnt+=1\r\nif \"yellow\" not in ls:\r\n\tls2.append(\"yellow\")\r\n\tcnt+=1\r\nprint(cnt)\r\nfor i in ls2:\r\n\tprint(ls1[i])\r\n\r\n\t\r\n", "G=[]\r\nL=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nM=['Power',\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nn=int(input())\r\nfor i in range(n):\r\n p=input()\r\n G.append(p)\r\nprint(6-len(G))\r\nfor j in L:\r\n if j not in G:\r\n q=L.index(j)\r\n print(M[q])\r\n", "stones=int(input())\r\nif stones==6:\r\n print(0)\r\nelse:\r\n d={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\n z=[]\r\n\r\n for i in range(stones):\r\n s=input()\r\n z+=s,\r\n\r\n print(6-stones)\r\n for i in d:\r\n if i not in z:\r\n print(d[i])", "dict1 = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\ns = set()\r\na = int(input())\r\nfor q in range(a):\r\n b = input()\r\n s.add(b)\r\nprint(6 - a)\r\nfor (key, value) in dict1.items():\r\n if key not in s:\r\n print(value)", "n=int(input())\r\nl=[]\r\np=[]\r\nm=[['purple','Power'],['green','Time'],['blue','Space'],['orange','Soul'],['red','Reality'],\r\n['yellow','Mind']]\r\nj=0\r\nfor i in range(n):\r\n s=str(input())\r\n l.append(s)\r\nfor i in range(len(m)):\r\n if m[i][0] not in l:\r\n j=j+1\r\n p.append(m[i][1])\r\nprint(j)\r\nfor x in p:\r\n print(x) \r\n\r\n\r\n\r\n", "lst = []\r\nans = {'purple' : 'Power', 'green' : 'Time', 'blue': 'Space', \"orange\" : \"Soul\", \"red\" : \"Reality\", \"yellow\" : \"Mind\"}\r\nfor i in range(int(input())):\r\n lst.append(input())\r\na = []\r\nfor i in ans.keys():\r\n if i not in lst:\r\n a.append(ans[i])\r\nprint(len(a))\r\nfor i in a:\r\n print(i)", "from audioop import reverse \nimport math, os, sys, string \nif(os.path.exists('input.txt')):\n sys.stdin = open(\"input.txt\",\"r\")\n sys.stdout = open(\"output.txt\",\"w\")\n \nimport sys\ninput = sys.stdin.readline \n#purple, green, blue, orange, red, yellow.\n#Power, Time, Space, Soul, Reality, Mind\n\n#Main code here:\ndict = {\"purple\":\"Power\",\n \"green\": \"Time\",\n \"blue\": \"Space\",\n \"orange\": \"Soul\",\n \"red\": \"Reality\",\n \"yellow\": \"Mind\"}\n\nn = int(input())\nl = []\nfor i in range(n):\n s = input().strip()\n l.append(s)\n\nres = []\nfor col in dict:\n if col not in l:\n res.append(dict[col])\n\nprint(len(res))\nfor stone in res:\n print(stone)\n \nsys.stdout.close() \nsys.stdin.close() \n\t \t\t\t \t \t\t\t\t \t\t \t \t\t\t\t\t\t\t", "a = int(input())\r\nd = {\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\", \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\nfor i in range(0, a):\r\n b = input()\r\n del d[b]\r\nprint(len(d))\r\nfor i in d:\r\n print(d[i])\r\n", "mydict={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\nn=int(input())\r\nprint(6-n)\r\nmylist= []\r\nfor i in range(n):\r\n s=input()\r\n mylist.append(s)\r\nif 'purple' not in mylist:\r\n print(mydict['purple'])\r\nif 'green' not in mylist:\r\n print(mydict['green'])\r\nif 'blue' not in mylist:\r\n print(mydict['blue'])\r\nif 'orange' not in mylist:\r\n print(mydict['orange'])\r\nif 'red' not in mylist:\r\n print(mydict['red'])\r\nif 'yellow' not in mylist:\r\n print(mydict['yellow'])\r\n \r\n ", "q='Power'\nq1='purple'\nw='Time'\nw1='green'\ne='Space'\ne1='blue'\nr='Soul'\nr1='orange'\nt='Reality'\nt1='red'\ny='Mind'\ny1='yellow'\nk=6\nn=int(input())\nfor i in range(n):\n a=input()\n if q1==a:\n q1=' '\n k=k-1\n if w1==a:\n w1=' '\n k=k-1\n if e1==a:\n e1=' '\n k=k-1\n if r1==a:\n r1=' '\n k=k-1\n if t1==a:\n t1=' '\n k=k-1\n if y1==a:\n y1=' '\n k=k-1\nprint(k)\nif (q1!=' '):\n print(q)\nif (w1!=' '):\n print(w)\nif (e1!=' '):\n print(e)\nif (r1!=' '):\n print(r)\nif (t1!=' '):\n print(t)\nif (y1!=' '):\n print(y)\n \n\n\t \t \t\t \t\t \t\t\t \t \t \t\t \t\t", "a=['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\nb=['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nn=int(input())\r\nc=[input() for _ in [0]*n]\r\nd=[b[x] for x,y in enumerate(a) if y not in c]\r\nprint(len(d),*d,sep='\\n')", "n= int(input())\ni=0\nl=[]\nwhile(i<n):\n s=input()\n l.append(s)\n i=i+1\nd={'red':'Reality','blue':'Space',\n 'yellow':'Mind','orange':'Soul','green':'Time'\n ,'purple':'Power'}\nl1 = []\nfor k,v in d.items():\n h=0\n for j in l:\n if k==j:\n h=h+1\n if h==0:\n l1.append(v)\nprint(len(l1))\nfor i in l1:\n print(i)\n \n\t\t\t\t\t \t \t \t \t\t \t\t \t\t \t\t \t\t", "n = int(input())\r\n\r\ngems = ['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\ncolors = ['purple', 'green', 'blue', 'orange', 'red', 'yellow']\r\n\r\nd = dict(zip(colors, gems))\r\nfor i in range(n):\r\n gems.remove(d[input()])\r\n \r\nprint(6 - n)\r\nfor i in range(6-n):\r\n print(gems[i])", "n = int(input())\r\ngems = { 'purple': 'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind' }\r\ncount = 6\r\nmissing = [ 'Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\r\nfor _ in range(n):\r\n s = input()\r\n missing.remove(gems[s])\r\n count -= 1\r\nprint(count)\r\nfor _ in missing:\r\n print(_)", "n=int(input())\na=list()\nfor i in range(0,n):\n\ta=a+[input()]\nb=['purple','green','blue','orange','red','yellow']\nminus=set([c for c in b if c not in a])\nprint(6-n)\nfor i in minus:\n\tif i=='purple':\n\t\tprint('Power')\n\tif i=='green':\n\t\tprint('Time')\n\tif i=='blue':\n\t\tprint('Space')\n\tif i=='orange':\n\t\tprint('Soul')\n\tif i=='red':\n\t\tprint('Reality')\n\tif i=='yellow':\n\t\tprint('Mind')\n", "n=int(input());a=[];t=''\nfor i in range(n):\n s=str(input())\n a.append(s)\nb=['green','yellow','orange','purple','red','blue'];p=0\nfor i in b:\n if (i in a)==False:\n if i=='green':\n t+='Time\\n'\n p+=1\n elif i=='yellow':\n t+='Mind\\n'\n p+=1\n elif i=='orange':\n t+='Soul\\n'\n p+=1\n elif i=='purple':\n t+='Power\\n'\n p+=1\n elif i=='red':\n t+='Reality\\n'\n p+=1\n elif i=='blue':\n t+='Space\\n'\n p+=1\n \n \nprint(p)\nprint(t[:-1])\n\n\t \t\t \t \t\t \t \t \t", "n = int(input())\r\nl = []\r\nstones = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\n\r\nprint(6 - n)\r\nfor (key, value) in stones.items():\r\n\tif key not in l:\r\n\t\tprint(value)\r\n\r\n\r\n", "n=int(input())\r\nS=set()\r\nstones={\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"}\r\nCS={\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nfor _ in range(n):\r\n color=str(input())\r\n S.add(CS[color])\r\ntemp=stones-S\r\nprint(6-n)\r\nfor i in temp:\r\n print(i)\r\n \r\n \r\n ", "#987A in codeforces\r\ngems = {\r\n\t\"purple\":\"Power\",\r\n\t\"green\":\"Time\",\r\n\t\"blue\":\"Space\",\r\n\t\"red\":\"Reality\",\r\n\t\"orange\":\"Soul\",\r\n\t\"yellow\":\"Mind\"\r\n}\r\nno_gems = 6\r\nn = int(input())\r\ntimes = 6-n\r\nif times==0:\r\n\tprint(\"0\")\r\nelse:\r\n\tfor i in range(n):\r\n\t\tgem = input()\r\n\t\tif gem in gems.keys():\r\n\t\t\tdel gems[gem]\r\n\tprint(times)\r\n\tfor i in gems.keys():\r\n\t\tprint(gems[i])", "complete_gems = {\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"}\r\n\r\ncolors_to_power = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\n\r\ngems = int(input())\r\npresent_gems = set()\r\n\r\nfor _ in range(gems):\r\n present_gems.add(input())\r\n\r\nabsent_gems = complete_gems - present_gems\r\ntotal_absent_gems = len(absent_gems)\r\n\r\nprint(total_absent_gems)\r\nfor absent_gem in absent_gems:\r\n print(colors_to_power[absent_gem])\r\n", "test=int(input())\r\nComplete_Gauntlet={'Reality':'red','Power':'purple','Mind':'yellow','Soul':'orange','Space':'blue','Time':'green'}\r\nGauntlet=[]\r\nwhile(test):\r\n color=input()\r\n Gauntlet.append(color)\r\n test-=1\r\n\r\nprint(6-len(Gauntlet))\r\nfor i in Complete_Gauntlet:\r\n if Complete_Gauntlet[i] not in Gauntlet:\r\n print(i)\r\n\r\n\r\n", "#Infinity Gauntlet\r\nd={\"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\":\"Reality\",\r\n \"yellow\":\"Mind\"}\r\nn=int(input())\r\nfor i in range (0,n):\r\n del d[input()]\r\nprint(len(d))\r\nprint(*d.values(),sep='\\n')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Nov 20 15:46:13 2020\r\n\r\n@author: user\r\nLink :https://codeforces.com/problemset/problem/987/A\r\n\"\"\"\r\nd = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\r\n \"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn = int(input())\r\nans = \"\"\r\nfor i in range(n):\r\n d.pop(input())\r\nprint(len(d))\r\nfor j in list(d.values() ):\r\n print( j)\r\n", "a={\"red\":\"Reality\",\"purple\":\"Power\",\"yellow\":\"Mind\",\"orange\":\"Soul\",\"blue\":\"Space\",\"green\":\"Time\"}\r\nb=[]\r\nfor _ in range(int(input())):\r\n s=input()\r\n b.append(s)\r\nprint(6-len(b))\r\nfor i in a:\r\n if(i not in b):\r\n print(a[i])", "n = int(input())\ncolor = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\npower = [\"Power\", \"Time\", \"Space\", \"Soul\", \"Reality\", \"Mind\"]\nin_lst = []\nfor i in range(n):\n in_lst.append(input())\nprint(6-len(in_lst))\nfor i in range(len(color)):\n if color[i] not in in_lst:\n print(power[i])\n\n\n \t\t \t\t \t \t \t\t \t\t\t\t\t \t\t \t\t\t", "inf = {'purple' : 'Power',\r\n 'green' : 'Time',\r\n 'blue' : 'Space',\r\n 'orange' : 'Soul',\r\n 'red' : 'Reality',\r\n 'yellow' : 'Mind'}\r\n\r\nd ={}\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n s = input()\r\n d[s] = inf[s]\r\n\r\nprint(len(inf) - n) \r\n\r\nfor key, value in inf.items():\r\n if key not in d:\r\n print(value)\r\n", "n=int(input())\nd={\n'purple':'Power',\n'green':'Time',\n'blue':'Space',\n'orange':'Soul',\n'red':'Reality',\n'yellow': 'Mind'\n}\np=[]\nfor i in range(n):\n p.append(input())\nprint(6-n)\nfor i in d.keys():\n if i not in p:\n print(d[i])\n\n \t \t \t\t\t \t \t \t \t\t \t \t\t \t\t \t\t", "d={\r\n \"purple\":\"Power\",\r\n \"green\":\"Time\",\r\n \"blue\":\"Space\",\r\n \"orange\":\"Soul\",\r\n \"red\":\"Reality\",\r\n \"yellow\":\"Mind\"\r\n}\r\nl=[\"purple\",\"green\",\"blue\",\"orange\",\"red\",\"yellow\"]\r\nm=[]\r\nn=[]\r\nfor i in range(int(input())):\r\n m.append(input())\r\nfor i in l:\r\n if i not in m:\r\n n.append(i)\r\nprint(len(n))\r\nfor i in n:\r\n print(d[i])", "gems = {\n 'purple': 'Power',\n 'green': 'Time',\n 'blue': 'Space',\n 'orange': 'Soul',\n 'red': 'Reality',\n 'yellow': 'Mind'\n}\n\nn = int(input())\ncolors = []\nfor _ in range(n):\n colors.append(input())\nabsent_colors = set(gems.keys()) - set(colors)\nabsent_gems = []\nfor color in absent_colors:\n absent_gems.append(gems[color])\nprint(len(absent_gems))\nfor x in absent_gems:\n print(x)", "def arr_inp(n):\r\n return [input() for x in range(n)]\r\n\r\n\r\ndic = {'Power': 'purple', 'Time': 'green', 'Space': 'blue', 'Soul': 'orange', 'Reality': 'red', 'Mind': 'yellow'}\r\nn = int(input())\r\na = arr_inp(n)\r\nprint(6 - n)\r\nfor i in dic.keys():\r\n if (dic[i] not in a):\r\n print(i)\r\n", "n=int(input())\r\ng=[]\r\nfor i in range(n):\r\n s=input()\r\n g.append(s)\r\nm=6-n\r\nprint(m)\r\nwhile(m):\r\n if \"purple\" not in g:\r\n g.append(\"purple\")\r\n print(\"Power\")\r\n elif \"red\" not in g:\r\n g.append(\"red\")\r\n print(\"Reality\")\r\n elif \"green\" not in g:\r\n g.append(\"green\")\r\n print(\"Time\")\r\n elif \"blue\" not in g:\r\n g.append(\"blue\")\r\n print(\"Space\")\r\n elif \"orange\" not in g:\r\n g.append(\"orange\")\r\n print(\"Soul\")\r\n elif \"yellow\" not in g:\r\n g.append(\"yellow\")\r\n print(\"Mind\")\r\n m-=1", "gaunlet = {\"Green\":\"Time\", \"Blue\": \"Space\", \"Red\": \"Reality\", \"Purple\":\"Power\", \"Yellow\":\"Mind\", \"Orange\":\"Soul\"}\ndata = []\ntemp = []\ncounter = 0\nn = int(input())\ni = 0\nwhile i != n:\n stone = input().capitalize()\n data.append(stone)\n i += 1\nfor i, j in gaunlet.items():\n if i not in data:\n counter += 1\n temp.append(j)\nprint(counter)\nfor i in temp:\n print(i)\n\n \t\t\t\t\t\t \t\t\t \t \t\t \t \t \t \t\t", "n = int(input())\r\ngems={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\r\ninps = []\r\nfor i in range(n):\r\n inps.append(input())\r\nprint(6-n)\r\nfor i in gems.keys():\r\n if i not in inps:\r\n print(gems[i])\r\n ", "dict={\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n dict.pop(s)\r\nfor k,v in dict.items():\r\n a.append(v)\r\nprint(len(a))\r\nfor i in range(len(a)):\r\n print(a[i])\r\n", "t=int(input())\narr=[]\ndic={'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}\n\nfor i in range(t):\n user=input()\n arr.append(user)\nprint(6-t)\nfor i,j in dic.items():\n if i not in arr:\n print(j)\n\t \t\t \t\t \t \t \t\t \t \t\t \t\t \t\t", "#!/usr/bin/env python3\n\n\ndef main():\n\tcolor_dict = { \n\t\t'purple':0,\n\t\t'green':1,\n\t\t'blue':2,\n\t\t'orange':3,\n\t\t'red':4,\n\t\t'yellow':5\n\t}\n\tgems = ['Power','Time','Space','Soul','Reality','Mind']\n\n\tgauntlet = [False for _ in range(6)]\n\n\tn = int(input())\n\t\n\tfor _ in range(n):\n\t\tstone = str(input())\n\t\tgauntlet[color_dict[stone]] = True\n\n\tprint(6-n)\n\n\tfor i in range(6):\n\t\tif gauntlet[i] == False:\n\t\t\tprint(gems[i])\n\n\n\nif __name__ == '__main__':\n\tmain()", "gems = {'purple' : 'power', 'green' : 'time', 'blue':'space', 'orange':'soul', 'red':'reality', 'yellow':'mind'}\nn = int(input())\nfor _ in range(n):\n\tdel gems[input()]\nprint(len(gems))\nfor gem in gems.values():\n\tprint(gem.title())\n", "d={'Power':'purple','Time':'green','Space':'blue','Soul':'orange','Reality':'red','Mind':'yellow'}\r\nl=[]\r\nfor _ in range(int(input())):\r\n c=input()\r\n l.append(c)\r\nc=0\r\nans=[]\r\nfor key,value in d.items():\r\n if value not in l:\r\n c+=1 \r\n ans.append(key)\r\nprint(c)\r\nfor i in ans:\r\n print(i)\r\n", "n = int(input())\r\nd = {'Power':'purple','Time':'green','Space':'blue','Soul':'orange','Reality':'red','Mind':'yellow'}\r\nl = []\r\nwhile(n):\r\n\ts = input()\r\n\tl.append(s)\r\n\tn-=1\r\nif(len(l)==6):\r\n\tprint(0)\r\nelse:\r\n\tprint(6-len(l))\r\n\tfor i,j in d.items():\r\n\t\tif(j not in l):\r\n\t\t\tprint(i)", "n = int(input())\nd = {\"purple\" : \"Power\", \"green\" : \"Time\", \"blue\" : \"Space\", \"orange\" : \"Soul\", \"red\" : \"Reality\", \"yellow\" : \"Mind\"}\nl = []\nl_2 = []\nif n <= 6:\n for i in range(n):\n inp = input()\n l.append(inp)\n for j, k in d.items():\n if j not in l:\n l_2.append(k)\n print(6-n)\n for m in l_2:\n print(m)\n\t \t \t\t \t\t\t \t\t \t\t\t\t\t\t \t \t \t \t\t", "d = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nn=int(input())\r\nl=[]\r\nl1=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nfor i in d:\r\n if i not in l:\r\n l1.append(d[i])\r\nprint(6-n) \r\nfor i in l1:\r\n print(i)\r\n", "\r\nn = int(input())\r\ndi = [\"red\",\"purple\",\"blue\",\"green\",\"yellow\",\"orange\"]\r\nd = {\"red\":[0,\"Reality\"] , \"purple\":[0,\"Power\"] , \"blue\" :[0,\"Space\"] , \"green\":[0,\"Time\"],\"yellow\":[0,\"Mind\"],\"orange\":[0,\"Soul\"]}\r\n\r\nfor i in range(n) :\r\n \r\n s = input()\r\n \r\n d[s][0] = 1 \r\nans = [] \r\nfor i in range(6) :\r\n \r\n if d[di[i]][0]==0 :\r\n \r\n ans.append(d[di[i]][1])\r\n \r\nprint(len(ans))\r\n\r\nfor i in range(len(ans)) :\r\n print(ans[i])\r\n \r\n ", "n = int(input())\r\nList1 = [\"purple\", \"green\", \"blue\", \"orange\", \"red\", \"yellow\"]\r\nDict1 = { \"purple\" : \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\" : \"Space\",\r\n \"orange\" : \"Soul\",\r\n \"red\" : \"Reality\",\r\n \"yellow\" : \"Mind\"}\r\nList2 = []\r\n\r\nfor i in range(n):\r\n List2.append(input())\r\n\r\n\r\nprint(6-n)\r\nfor i in List2:\r\n if i in List1:\r\n List1.remove(i)\r\nfor i1 in List1:\r\n print(Dict1[i1])", "gauntlet={\"purple\": \"Power\", \"green\": \"Time\", \"blue\": \"Space\",\r\n \"orange\": \"Soul\", \"red\": \"Reality\", \"yellow\": \"Mind\"}\r\ngem=int(input())\r\nfor i in range(gem):\r\n del gauntlet[input()]\r\nprint(len(gauntlet))\r\nprint(*gauntlet.values(), sep='\\n')", "slovar = {'red':'Reality',\r\n 'green':'Time',\r\n 'blue':'Space',\r\n 'yellow':'Mind',\r\n 'orange':'Soul',\r\n 'purple':'Power' }\r\nabilities = set()\r\nall = {'red','green','blue','yellow','orange','purple'}\r\ncurrent = set()\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a = input()\r\n if a in all:\r\n current.add(a)\r\n else:\r\n abilities.add(a)\r\n\r\nprint(6 - n)\r\n\r\nfor i in all-current:\r\n if slovar[i] not in abilities:\r\n print(slovar[i])\r\n\r\n\r\n", "no_gems = int(input())\ngem = [\"Time\", \"Mind\", \"Soul\", \"Power\", \"Reality\", \"Space\"]\nfor i in range(no_gems):\n gem_color = input()\n\n\n if gem_color == \"purple\":\n gem.remove(\"Power\")\n elif gem_color == \"green\":\n gem.remove(\"Time\")\n elif gem_color == \"blue\":\n gem.remove(\"Space\")\n elif gem_color == \"orange\":\n gem.remove(\"Soul\")\n elif gem_color == \"red\":\n gem.remove(\"Reality\")\n elif gem_color == \"red\":\n gem.remove(\"Reality\")\n elif gem_color == \"yellow\":\n gem.remove(\"Mind\")\n\nneed_gems = 6 - no_gems\n\nprint(need_gems)\n\nfor j in gem:\n print(j)\n \t \t \t \t\t\t\t \t \t\t \t \t \t", "n=int(input())\r\narr= {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\", \"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nm=[\"purple\",\"green\",\"blue\",\"orange\", \"red\",\"yellow\"]\r\nlis=[]\r\nfor i in range(n):\r\n mn=input()\r\n lis.append(m)\r\n if(mn in m):\r\n m.remove(mn)\r\n \r\nprint(len(m)) \r\nfor i in m:\r\n print(arr[i]) \r\n ", "n=int(input())\r\nl1=[\"Power\",\"Time\",\"Space\",\"Soul\",\"Reality\",\"Mind\"]\r\nfor i in range (n):\r\n\ta=str(input())\r\n\tif a==\"purple\":\r\n\t\tl1.remove(\"Power\")\r\n\tif a==\"green\":\r\n\t\tl1.remove(\"Time\")\r\n\tif a==\"blue\":\r\n\t\tl1.remove(\"Space\")\r\n\tif a==\"orange\":\r\n\t\tl1.remove(\"Soul\")\r\n\tif a==\"red\":\r\n\t\tl1.remove(\"Reality\")\r\n\tif a==\"yellow\":\r\n\t\tl1.remove(\"Mind\")\r\nprint(6-n)\r\nfor i in range(len(l1)):\r\n\tprint(l1[i])", "stones = {\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \r\n \"orange\":\"Soul\", \"red\":\"Reality\",\"yellow\":\"Mind\"}\r\nn = int(input())\r\nfor i in range(n):\r\n del stones[input()]\r\nprint(len(stones))\r\nfor k in stones.keys():\r\n print(stones[k])", "n = int(input())\r\nprint(6-n)\r\nga = {\r\n \"purple\": \"Power\",\r\n \"green\": \"Time\",\r\n \"blue\": \"Space\",\r\n \"orange\": \"Soul\",\r\n \"red\": \"Reality\",\r\n \"yellow\": \"Mind\"\r\n}\r\nfor i in range(n):\r\n ga.pop(input())\r\nfor i in ga:\r\n print(ga[i])\r\n", "l=[\"red\",\"purple\",\"yellow\",\"orange\",\"green\",\"blue\"]\r\nl2=[\"Reality\",\"Power\",\"Mind\",\"Soul\",\"Time\",\"Space\"]\r\nn=int(input())\r\nprint(6-n)\r\nfor i in range(n):\r\n\ts=input()\r\n\tif s in l:\r\n\t\ta=l.index(s)\r\n\t\tl.pop(a)\r\n\t\tl2.pop(a)\r\nfor i in l2:\r\n\tprint(i)", "a=int(input())\r\nt=['Time','Mind','Soul','Power','Reality','Space']\r\nT=['green','yellow','orange','purple','red','blue']\r\nif a==0:\r\n print(len(t))\r\n for j in t:\r\n print(j)\r\nelif a==6:\r\n print(0)\r\nelif 0<a<6:\r\n s=[]\r\n u=[]\r\n for i in range(a):\r\n s.append(input())\r\n for j in range(6):\r\n if T[j] in s:\r\n pass\r\n elif T[j] not in s:\r\n u.append(t[j])\r\n print(len(u))\r\n u.sort()\r\n for k in u:\r\n print(k)\r\n \r\n", "n = int(input())\r\nlili = []\r\nfor p in range(n):\r\n x = input()\r\n lili.append(x)\r\nstones = ['Power','Time','Space','Soul','Reality','Mind']\r\nfor i in lili:\r\n if(i == \"purple\"):\r\n stones.remove('Power')\r\n if(i == \"green\"):\r\n stones.remove('Time')\r\n if(i == \"blue\"):\r\n stones.remove('Space')\r\n if(i == \"orange\"):\r\n stones.remove('Soul')\r\n if(i == \"red\"):\r\n stones.remove('Reality')\r\n if(i == \"yellow\"):\r\n stones.remove('Mind')\r\nprint(len(stones))\r\nfor p in stones:\r\n print(p) \r\n\r\n \r\n", "d={\"red\":\"Reality\",\"blue\":\"Space\",\"green\":\"Time\",\"purple\":\"Power\",\"orange\":\"Soul\",\"yellow\":\"Mind\"}\r\na=[]\r\nans=[]\r\nfor i in range(int(input())):\r\n a.append(input())\r\nfor i in d:\r\n if i not in a:\r\n ans.append(d[i])\r\nif(ans):\r\n print(len(ans))\r\n for i in ans:\r\n print(i)\r\nelse:\r\n print(0)\r\n \r\n", "gems = {'Power': 'purple', 'Time': 'green', 'Space': 'blue', 'Soul': 'orange', 'Reality': 'red', 'Mind': 'yellow'}\r\nn = int(input())\r\nlist, absent = [], []\r\nfor i in range(n): list.append(input())\r\nfor key, value in gems.items():\r\n if value not in list: absent.append(key)\r\nprint(len(absent))\r\nprint(*absent, sep='\\n')\r\n", "num = int(input())\n\ndct = {}\ndct['green'] = \"Time\"\ndct['yellow'] = \"Mind\"\ndct['orange'] = \"Soul\"\ndct['purple'] = \"Power\"\ndct['red'] = \"Reality\"\ndct['blue'] = \"Space\"\n\nlst = []\n\nabsent = []\n\nfor i in range(num):\n\tlst.append(input())\n\n\nfor gem in dct:\n\tif gem not in lst:\n\t\tabsent.append(dct[gem])\n\nprint(len(absent))\nabsent.sort()\nfor gem in absent:\n\tprint(gem)\n\n\t \t\t \t\t\t\t\t\t\t\t\t \t\t\t \t \t \t", "n=int(input())\r\nl1=['Power','Time','Space','Soul','Reality','Mind']\r\nl2=['purple','green','blue','orange','red','yellow']\r\nl3=[]\r\nfor i in range(n):\r\n l3.append(str(input()))\r\nif n<6:\r\n print(6-n)\r\nelse:\r\n print(0)\r\nfor i in range(6):\r\n if l2[i] not in l3:\r\n print(l1[i])", "x = int(input())\np = ''\nfor i in range(x):\n y = input()\n if y == 'red':\n p += 'r'\n elif y == 'purple':\n p += 'p'\n elif y == 'yellow':\n p += 'y'\n elif y == 'orange':\n p += 'o'\n elif y == 'blue':\n p += 'b'\n elif y == 'green':\n p += 'g' \nprint(6-x)\nif 'r' not in p:\n print('Reality')\nif 'p' not in p:\n print('Power')\nif 'b' not in p:\n print('Space')\nif 'g' not in p:\n print('Time')\nif 'o' not in p:\n print('Soul')\nif 'y' not in p:\n print('Mind')\n\t \t \t \t\t\t \t\t \t\t \t\t \t\t", "n = int(input())\r\ns = []\r\n\r\nfor i in range(n):\r\n\td = input()\r\n\ts.append(d)\r\n\r\nz = {\"purple\":\"Power\",\"green\":\"Time\",\"blue\":\"Space\",\"orange\":\"Soul\",\"red\":\"Reality\",\"yellow\":\"Mind\"}\r\n\r\nfor i in s:\r\n\tif i in z:\r\n\t\ti = z.pop(i)\r\n\r\n\r\nprint(len(z))\r\nfor i in z.values():\r\n\tprint(i)\r\n\r\n\r\n", "user=int(input())\ncol=['purple', 'green', 'blue', 'orange', 'red', 'yellow']\npow=['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind']\na=[]\nfor i in range(user):\n c=input()\n a.append(c)\nprint(6-user)\nfor i in range(6):\n if col[i] not in a:\n print(pow[i])\n\t \t \t\t\t \t\t \t \t \t \t \t \t\t\t", "d={'Power':'purple',\r\n 'Time':'green',\r\n 'Space':'blue',\r\n 'Soul':'orange',\r\n 'Reality':'red',\r\n 'Mind':'yellow'\r\n }\r\nm=set()\r\nn=int(input())\r\nfor _ in range(n):\r\n s=input()\r\n m.add(s)\r\nprint(6-n)\r\nfor (key,value) in d.items():\r\n if value not in m:\r\n print(key)\r\n ", "Thanos = {'red': 'Reality', 'purple': 'Power',\r\n 'green': 'Time', 'yellow': 'Mind', \r\n 'blue': 'Space', 'orange': 'Soul'}\r\ncolors=['red','green','yellow','blue','orange','purple']\r\n\r\nn=int(input())\r\nmyStones=[]\r\nfor _ in range(n):\r\n x=input().lower()\r\n colors.remove(x)\r\n\r\nprint(len(colors))\r\nfor i in colors:\r\n print(Thanos[i])\r\n\r\n\r\n\r\n \r\n", "#import sys\r\n#import math\r\n#sys.stdout=open(\"C:/Users/pipal/OneDrive/Desktop/VS code/python/output.txt\",\"w\")\r\n#sys.stdin=open(\"C:/Users/pipal/OneDrive/Desktop/VS code/python/input.txt\",\"r\")\r\n#t=int(input())\r\n#for i in range(t):\r\nn=int(input())\r\nl=[]\r\nnew=[]\r\nans=6\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nfor i in range(n):\r\n new.append(l[i][0])\r\nprint(6-len(new))\r\nfor i in range(6-n):\r\n if \"p\" not in new:\r\n print(\"Power\")\r\n new.append(\"p\")\r\n if \"g\" not in new:\r\n print(\"Time\")\r\n new.append(\"g\")\r\n if \"b\" not in new:\r\n print(\"Space\")\r\n new.append(\"b\")\r\n if \"r\" not in new:\r\n print(\"Reality\")\r\n new.append(\"r\")\r\n if \"o\" not in new:\r\n print(\"Soul\")\r\n new.append(\"o\")\r\n if \"y\" not in new:\r\n print(\"Mind\")\r\n new.append(\"y\")\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n ", "s={\"purple\":\"Power\", \"green\":\"Time\", \"blue\":\"Space\", \"orange\":\"Soul\", \"red\":\"Reality\", \"yellow\":\"Mind\"}\r\nn=int(input())\r\nt=set()\r\nfor i in range(n):\r\n t.add(input())\r\nprint(6-n)\r\nfor i in set(s.keys()).difference(t):\r\n print(s[i])" ]

[ "import sys\r\ninput=sys.stdin.readline\r\nn,x1,y1,x2,y2=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n l.append([(x-x1)**2+(y-y1)**2,(x-x2)**2+(y-y2)**2])\r\nl.sort(reverse=True)\r\ns=10**18\r\nq=0\r\nfor u,v in l:\r\n s=min(s,u+q)\r\n q=max(q,v)\r\nprint(min(s,q))" ]

[ "total_stop = int(input())\r\nmax = 0\r\ncurrent = 0\r\nfor i in range(total_stop):\r\n a,b = map(int,input().split())\r\n if i == 0:\r\n max = b\r\n current = b\r\n else:\r\n current = (current - a) + b\r\n if current > max:\r\n max = current\r\nprint(max)\r\n", "n=int(input())\r\nsum=0\r\nmax=0\r\nfor i in range(0,n):\r\n x=input()\r\n var=x.split()\r\n a=int(var[0])\r\n b=int(var[1]) \r\n sum=sum+b-a\r\n if max<sum:\r\n max=sum\r\n \r\nprint(max) ", "n = int(input())\r\ncurrent = 0\r\nmx = 0\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n current -= l[0]\r\n current += l[1]\r\n if(current>mx):\r\n mx = current\r\nprint(mx)\r\n ", "n=int(input())\r\ntemp=0\r\nmax=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n temp=temp-a\r\n temp=temp+b\r\n if temp>max:\r\n max=temp\r\nprint(max)\r\n\r\n", "n = int(input())\r\ntotal = 0\r\nans = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n total += (b-a)\r\n if total > ans:\r\n ans = total\r\nprint(ans)\r\n \r\n \r\n\t\r\n", "n=int(input())\r\nl=[]\r\ncnt=0\r\nfor i in range (0,n):\r\n a,b=map(int,input().split())\r\n cnt-=a\r\n cnt+=b\r\n l.append(cnt)\r\nprint(max(l))\r\n ", "\nn = int(input())\n\nres = 0\nx = 0\n\nfor i in range(n):\n a, b = [int(i) for i in input().split()]\n x -= a\n x += b\n if res < x:\n res = x\nprint(res)", "m = 0\r\nc = 0\r\nfor i in range(int(input())):\r\n\ta,b = [int(x) for x in input().split()]\r\n\tc += b-a\r\n\tm = max(m,c)\r\nprint(m)", "n=int(input())\r\nx=0\r\ny=0\r\nl=[]\r\nfor i in range(0,n):\r\n a,b=map(int,input().split(\" \"))\r\n x+=b\r\n x-=a\r\n l.append(x)\r\nprint(max(l))", "m = int(input())\r\nn = 0\r\ns = 0\r\nwhile m:\r\n\ta,b= map(int, input().split())\r\n\ts=s+b-a\r\n\tif s >n:\r\n\t\tn = s\r\n\tm=m-1\r\nprint(n)", "c=0\r\nm=0\r\nfor _ in range(int(input())):\r\n a,b = map(int,input().split())\r\n c= c-a+b\r\n if c>m:\r\n m=c\r\nprint(m) ", "n = int(input())\r\nlis = [[]]\r\nre = [0]\r\nfor i in range(0, n):\r\n a = [int(x) for x in input().split()]\r\n lis.append(a)\r\ndel lis[0]\r\nfor i in range(n):\r\n v = re[i] - lis[i][0] + lis[i][1]\r\n re.append(v)\r\nprint(max(re))", "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 cc-=a\r\n cc+=b\r\n mc=max(mc,cc)\r\nprint(mc)\r\n", "n = int(input())\n\nminCap = 0\ncurPass = 0\nfor i in range(n): \n a, b = map(int, input().split())\n curPass -= a\n curPass += b\n minCap =max(minCap, curPass)\nprint(minCap)\n", "num = int(input())\r\nc = []\r\na = 0\r\nfor i in range(num):\r\n t,r= list(map(int,input().split()))\r\n a+=(r-t)\r\n c.append(a)\r\nprint(max(c)) \r\n\r\n", "t = int(input())\r\nmaxNum = 0\r\ncount = 0\r\nfor _ in range(t):\r\n a,b = map(int,input().split())\r\n count += b - a\r\n maxNum = max(maxNum,count)\r\nprint(maxNum)\r\n", "n = int(input())\r\ncapacity = [0]\r\nfor _ in range(n):\r\n information = input().split()\r\n exiting = int(information[0])\r\n entering = int(information[1])\r\n new_capacity = capacity[-1] - exiting + entering\r\n capacity.append(new_capacity)\r\nprint(max(capacity))", "n = int(input())\r\ncount=0\r\npassengers = 0\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tpassengers = passengers-a+b\r\n\tcount=max(count, passengers)\r\nprint(count)", "n = int(input())\r\npi = 0\r\ncap = 0\r\nfor i in range(n):\r\n exit,enter = map(int,input().split())\r\n pi = (pi-exit)+enter\r\n cap = max(cap,pi)\r\nprint(cap)", "counter = 0\r\nmax = 0\r\nn = int(input())\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n counter += (b-a)\r\n if counter > max:\r\n max = counter\r\nprint(max)", "t=int(input())\r\nmax1=0\r\ntotal=0\r\nwhile(t>0):\r\n x,y=map(int,input().split())\r\n total-=x\r\n total+=y\r\n if(max1<total):\r\n max1=total\r\n t-=1\r\nprint(max1)", "s = 0\r\nmaxim = 0\r\nfor i in range(int(input())):\r\n a,b = map(int, input().split())\r\n s -= a\r\n s += b\r\n maxim = max(maxim, s)\r\nprint(maxim)\r\n", "tram, max = 0,0\r\nfor i in range(int(input())):\r\n o,i = map(int,input().split())\r\n tram += i-o\r\n if tram > max: \r\n max = tram\r\nprint(max)\r\n \r\n \r\n \r\n", "import math\r\nnum = int(input())\r\nmaxx = -math.inf\r\nallpas = 0\r\nfor i in range(num):\r\n x,y = input().split()\r\n allpas = (allpas + int(y)) - int(x)\r\n if allpas > maxx:\r\n maxx = allpas\r\nprint(maxx)", "p=int(input())\r\nw=0\r\ns=0\r\nfor i in range(p):\r\n a,b=map(int,input().split())\r\n w+=(-a+b)\r\n if w>=s:\r\n s=w\r\nprint(s)", "lst = []\r\nfor i in range(int(input())):\r\n\ta,b = map(int, input().split())\r\n\tif i == 0:\r\n\t\tlst.append((a+b))\r\n\telse:\r\n\t\tlst.append(((lst[-1]-a)+b))\r\nprint(max(lst))\r\n", "n=int(input())\r\ns=0\r\nr=[]\r\nfor i in range(n):\r\n m=[int(j) for j in input().split()]\r\n s+=m[1]-m[0]\r\n r.append(s)\r\nr.sort()\r\nprint(r[-1])", "l = int(input())\r\nc = 0\r\ncu = 0\r\n\r\nfor _ in range(l):\r\n a, b = map(int, input().split())\r\n cu = cu - a + b\r\n c = max(c, cu)\r\n\r\nprint(c)\r\n", "\r\nn= int(input())\r\ncapacity=0\r\ncurrent=0\r\nwhile(n):\r\n a,b=map(int, input().split())\r\n current=current-a\r\n current=current+b\r\n if(current>capacity):\r\n capacity=current\r\n\r\n n-=1\r\n\r\nprint(capacity)\r\n\r\n", "#CodeForce Round 116a Tram\r\n\r\nn = int(input())\r\npassenger = 0\r\ncap = 0\r\nfor i in range(n):\r\n o,i = map(int,input().split())\r\n passenger = passenger - o + i\r\n cap = max(cap, passenger)\r\nprint(cap)", "n = int(input())\r\ncurrentCapacity = 0\r\nminCapacity = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n currentCapacity -= a\r\n currentCapacity += b\r\n minCapacity = max(minCapacity, currentCapacity)\r\n\r\nprint(minCapacity)\r\n", "\r\nn = int(input())\r\nlistA = []\r\nlistB = []\r\n\r\n\r\n\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n listA.append(a);\r\n listB.append(b);\r\n\r\nmaxim = 0\r\nsuma = 0\r\n\r\n\r\n\r\nfor i in range(n):\r\n suma = suma - listA[i]\r\n suma = suma + listB[i]\r\n if maxim < suma:\r\n maxim = suma\r\n \r\nprint(maxim)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=0\r\nb=0\r\nmax=0\r\nsit=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n sit=sit-a\r\n sit=sit+b\r\n if(max<sit):\r\n max=sit\r\nprint(max)\t", "n = int(input())\ncapacity= 0 \ncurrent = 0\n\nfor i in range(n):\n a, b = map(int, input().split())\n if i == 0:\n current += b\n if current > capacity:\n capacity = current\n else:\n current -= a\n current += b\n if current > capacity:\n capacity = current\n \nprint(capacity)\n", "n=int(input())\r\nc=0\r\ni=0\r\nfor j in range(n):\r\n a,b=map(int,input().split())\r\n i=i-a\r\n i=i+b\r\n if i>c:\r\n c=i\r\nprint(c)", "n = int(input())\r\na = []\r\nk = 0\r\nd = 0\r\nfor i in range(n):\r\n a = [int(i) for i in input().split()]\r\n d += a[1] - a[0]\r\n if d > k:\r\n k = d\r\nprint(k)\r\n", "n = int(input())\r\nx=0\r\nl = []\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n a = x - a\r\n x = a + b\r\n l.append(x)\r\nprint(max(l))\r\n \r\n \r\n", "s=int(input())\r\nc=0\r\nv=[]\r\nfor i in range(s):\r\n b=list(map(int,input().split()))\r\n c+=b[1]-b[0]\r\n v+=[c]\r\nprint(max(v))", "# 4\r\n# 0 3\r\n# 2 5\r\n# 4 2\r\n# 4 0\r\n\r\nc = 0\r\nm = 0\r\nfor _ in range(int(input())):\r\n a = [int(x) for x in input().split()]\r\n c -= a[0]\r\n c += a[1]\r\n if(c>m):\r\n m=c\r\n \r\nprint(m)", "b=q=0\r\nfor y in[0]*int(input()):q-=eval(input().replace(' ','-'));b=max(b,q)\r\nprint(b)", "a=int(input(''))\r\nb=[]\r\nc=0\r\nfor i in range(0,a):\r\n d=str(input(''))\r\n e=''\r\n g=0\r\n f=''\r\n while d[g]!=\" \":\r\n e=e+d[g]\r\n g=g+1\r\n for i in range(g,len(d)):\r\n f=f+d[i]\r\n c=c+int(f)-int(e)\r\n b=b+[c]\r\nprint(max(b))", "# your code goes here\r\ndef main():\r\n no_of_stops = int(input())\r\n\r\n minimum_capacity = 0\r\n no_of_people_on_train = 0\r\n for i in range(1, no_of_stops + 1):\r\n no_of_exits, no_of_entries = map(int, input().split())\r\n\r\n no_of_people_on_train += (no_of_entries - no_of_exits)\r\n minimum_capacity = max(minimum_capacity, no_of_people_on_train)\r\n\r\n print(minimum_capacity)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ns = input().split()\r\nc = int(s[0])+int(s[1])\r\nmaxi = c\r\nfor i in range(n-1):\r\n s = input ().split()\r\n c = c - int(s[0]) + int(s[1])\r\n if c>maxi:\r\n maxi=c\r\nprint (maxi) ", "stations = int(input())\r\ntotalInside = 0\r\nlongTimeMax = 0\r\ntemp = 0\r\n\r\nfor i in range(stations):\r\n passenger = input()\r\n passengersSplit = passenger.split()\r\n passengersInt = [int(x) for x in passengersSplit]\r\n \r\n passengersOut = passengersInt[0]\r\n totalInside = totalInside - passengersOut\r\n \r\n passengersIn = passengersInt[1]\r\n totalInside = totalInside + passengersIn\r\n \r\n if totalInside < 0:\r\n totalInside == 0\r\n \r\n if totalInside > longTimeMax:\r\n longTimeMax = totalInside\r\n\r\n\r\n\r\nprint(longTimeMax)\r\n", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncapacity = 0\r\npassengers = 0\r\n\r\n# Iterate through each stop\r\nfor _ in range(n):\r\n # Read the number of passengers exiting and entering\r\n a, b = map(int, input().split())\r\n \r\n # Update the current passengers count\r\n passengers = passengers - a + b\r\n \r\n # Update the capacity if needed\r\n capacity = max(capacity, passengers)\r\n\r\n# Print the minimum possible capacity\r\nprint(capacity)\r\n", "n = int(input())\r\nm = c = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n c = c-a\r\n c = c+b\r\n m = max(c,m)\r\nprint(m)\r\n", "n=int(input())\r\ntotal=0\r\nmaxi=0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n total-=a\r\n total+=b\r\n if maxi<=total:\r\n maxi=total\r\nprint(maxi)", "def mintc(n, stops):\r\n maxc = 0\r\n current = 0\r\n\r\n for i in range(n):\r\n exiting, entering = stops[i]\r\n current -= exiting\r\n current += entering\r\n\r\n maxc = max(maxc, current)\r\n\r\n return maxc\r\n\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n stops.append((a, b))\r\n\r\nresult = mintc(n, stops)\r\nprint(result)\r\n", "c=0\r\nmax_c=0\r\nn=int(input())\r\nfor i in range (n):\r\n exit,enter=map(int,input().split())\r\n c-=exit\r\n c+=enter\r\n if c>max_c:\r\n max_c=c\r\nprint(max_c)", "def main():\r\n n = int(input())\r\n capacity = 0\r\n max_passengers = 0\r\n for _ in range(n):\r\n out, ins = map(int, input().split())\r\n capacity = capacity - out + ins\r\n\r\n max_passengers = max(capacity, max_passengers)\r\n print(max_passengers)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nmx = -1\r\ncnt = 0\r\nwhile n:\r\n n-=1\r\n a,b = map(int,input().split())\r\n cnt -= a\r\n cnt += b\r\n mx = max(mx,cnt)\r\nprint(mx)", "x = int(input(\"\"))\r\ntrain = 0\r\nmax = 0\r\nfor i in range(0,x):\r\n t = input(\"\").split(\" \")\r\n train = train - int(t[0])\r\n train = train + int(t[1])\r\n if train > max:\r\n max = train\r\nprint(max)", "n = int(input())\r\nx = 0\r\nm = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x -= a\r\n x += b\r\n if m < x:\r\n m = x\r\nprint(m)", "n = int(input()) \r\n\r\nd = 0\r\nmax_d = 0\r\n\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n d -= a \r\n d += b \r\n max_d = max(max_d, d)\r\n\r\nprint(max_d)\r\n", "n = int(input())\r\n\r\nmyCap = 0\r\ncurCap = 0\r\n\r\nfor _ in range(n):\r\n exit, enter = map(int, input().split())\r\n\r\n curCap += enter - exit\r\n myCap = max(myCap, curCap)\r\n\r\nprint(myCap)", "num_stops = int(input())\r\ncurrent_capacity = 0\r\nmax_capacity = 0\r\nfor _ in range(num_stops):\r\n exiting_passengers, entering_passengers = map(int, input().split())\r\n current_capacity -= exiting_passengers\r\n current_capacity += entering_passengers\r\n if current_capacity > max_capacity:\r\n max_capacity = current_capacity\r\nprint(max_capacity)", "def main():\r\n entry= [0]\r\n all=[]\r\n for _ in range(int(input())):\r\n x, y = map(int,input().split())\r\n entry[-1]-=x\r\n entry[-1]+=y\r\n all.append(entry[0])\r\n return max(all)\r\nprint(main())\r\n", "n = int(input())\r\ncapacity = 0\r\nbest = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n capacity -= a\r\n capacity += b\r\n if capacity > best:\r\n best = capacity\r\n\r\nprint(best)\r\n", "\r\nl=[]\r\nc=0\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n b=y-x\r\n c+=b\r\n l.append(c)\r\nprint(max(l))", "n = int(input())\r\ncnt, otv = 0, 0\r\nfor i in range(1,n):\r\n t = list(map(int, input().split()))\r\n cnt -= t[0]\r\n cnt += t[1]\r\n otv = max(otv,cnt)\r\nprint(otv)", "n = int(input())\r\ncapacity = 0\r\ncapacity_range = 0\r\nfor i in range(n):\r\n exit, enter = map(int,input().split())\r\n capacity -= exit\r\n capacity += enter\r\n if capacity > capacity_range:\r\n capacity_range = capacity\r\nprint(capacity_range)", "n = int(input())\r\ndef tram(z):\r\n # Write your code here\r\n l=[]\r\n a=0\r\n b=0\r\n while z >0:\r\n array = list(map(int,input().split()))\r\n l.append(array)\r\n z-=1\r\n max=0\r\n person=0\r\n for i in (l):\r\n person=person-i[0]+i[1]\r\n if person > max:\r\n max= person\r\n\r\n print(max)\r\n\r\ntram(n)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ntram_cap=0\r\nl=[]\r\nfor i in range(n):\r\n a, b= map(int, input().split())\r\n tram_cap = tram_cap+b-a\r\n l.append(tram_cap)\r\nprint(max(l))", "def main():\r\n num_stops = int(input())\r\n cur_capacity = 0\r\n max_capacity = 0\r\n\r\n while num_stops > 0:\r\n out, _in = map(int, input().split())\r\n cur_capacity += _in - out\r\n if cur_capacity > max_capacity:\r\n max_capacity = cur_capacity\r\n num_stops -= 1\r\n\r\n print(max_capacity)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\n\r\narrival=[]\r\ndepart=[]\r\n\r\nfor i in range(n):\r\n a,b=[int(v) for v in input().split()]\r\n arrival.append(b)\r\n depart.append(a)\r\n\r\nmaxpass=arrival[0]\r\nch=arrival[0]\r\nfor j in range(1,n):\r\n ch=ch-depart[j]\r\n ch=ch+arrival[j]\r\n \r\n \r\n if(ch>maxpass):\r\n maxpass=ch\r\n \r\nprint(maxpass)", "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 c -= a\r\n c += b\r\n if c > m:\r\n m = c\r\nprint(m)", "t= int(input())\r\nres=[0]\r\nfor i in range(t):\r\n a,b=[int(x) for x in input().split()]\r\n temp=res[-1]-a+b\r\n res.append(temp)\r\nprint(max(res))", "n=int(input())\r\nt=0\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n t=t-a+b\r\n l.append(t)\r\nprint(max(l))\r\n \r\n ", "n = int(input())\np = 0\narr = []\nfor _ in range(n):\n l = list(map(int, input().split()))\n p = p+l[1]-l[0]\n arr.append(p)\nprint(max(arr))", "n = int(input())\r\nlog = []\r\npassengers = 0\r\nmax_capacity = 0\r\n\r\nfor i in range(n):\r\n exits, enters = map(int, input().split())\r\n log.append((exits, enters))\r\n\r\nfor a in range(n):\r\n passengers -= log[a][0]\r\n passengers += log[a][1]\r\n if passengers > max_capacity:\r\n max_capacity = passengers\r\n\r\nprint(max_capacity)", "t=int(input())\r\nsum=0\r\nmax=0\r\nwhile(t>0):\r\n s=input()\r\n s=s.split()\r\n s=list(map(int,s))\r\n sum=sum+s[1]-s[0]\r\n if (sum>max):\r\n max=sum\r\n t-=1\r\nprint(max)", "#==============NEVER GIVE UP=========================\r\n#===========ALLAH ALMIGHT WILL HELP==================\r\n#==================YOU===============================\r\nx=int(input())\r\ny=0\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n y=max(0,y+a-b)\r\nprint(y)", "loopno = int(input())\r\nmaxcap = 0\r\nsumno = 0\r\nfor i in range(loopno):\r\n arr = list(map(int, input().split()))\r\n maxcap = maxcap-arr[0] +arr[1]\r\n if maxcap > sumno:\r\n sumno = maxcap\r\nprint(sumno)", "n= int(input())\r\nans=0\r\nmaxans=0\r\nfor i in range(n):\r\n x= input()\r\n x=x.split()\r\n a= int(x[0])\r\n b= int(x[1])\r\n ans= ans + b - a\r\n maxans= max(maxans, ans)\r\nprint(maxans)", "n = int(input())\r\nli=[]\r\nli1=[]\r\nfor i in range(n):\r\n numbers = list(map(int,input().split(\" \")))\r\n li.append(numbers)\r\npassegenrs_counter=0\r\nfor item in li:\r\n passegenrs_counter-=item[0]\r\n passegenrs_counter+=item[1]\r\n li1.append(passegenrs_counter)\r\nprint(max(li1))", "n = int(input())\r\nnow = 0\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n now -= a\r\n now +=b\r\n if now >c:\r\n c = now\r\nprint(c)", "n_stops = int(input())\r\nmax_cap = 0\r\nleft = 0\r\n\r\nfor i in range(0,n_stops):\r\n\r\n exit, enter = input().split()\r\n enter = int(enter)\r\n exit = int(exit)\r\n\r\n if i == 0:\r\n left = enter\r\n max_cap = left\r\n if i == n_stops-1:\r\n break\r\n if i!= 0 and i!= n_stops-1:\r\n left = left - exit + enter\r\n\r\n if max_cap < left:\r\n max_cap = left\r\n\r\nprint(max_cap)", "def minimum_tram_capacity(n, stops):\r\n capacity = 0\r\n current_passengers = 0\r\n\r\n for i in range(n):\r\n current_passengers -= stops[i][0] # passengers exiting the tram\r\n current_passengers += stops[i][1] # passengers entering the tram\r\n capacity = max(capacity, current_passengers)\r\n\r\n return capacity\r\n\r\n\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)\r\n", "pas = 0\r\nmpas = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n pas -= a\r\n pas += b\r\n mpas = max(mpas, pas)\r\nprint(mpas)", "n = int(input())\r\nk = 0\r\nkmax = 0\r\nfor i in range(n):\r\n s = list(map(int, str(input()).split()))\r\n if k > kmax:\r\n kmax = k\r\n k -= s[0]\r\n k += s[1]\r\nprint(kmax)", "case_num = int(input())\r\ncurrent_num = 0\r\nmax_num = 0\r\n\r\nfor pair in range(case_num):\r\n exiting, entering = [int(x) for x in input().split()]\r\n current_num = current_num - exiting + entering\r\n \r\n if current_num > max_num:\r\n max_num = current_num\r\n\r\nprint(max_num)", "StopNo = int(input())\r\ncurrent = 0\r\nhighest = 0\r\n\r\nfor i in range(StopNo):\r\n a, b = map(int, input().split())\r\n current = current + b\r\n current = current - a\r\n if current > highest:\r\n highest = current\r\nprint(highest)\r\n", "n = int(input())\r\na, b, ac, ma = 0, 0, 0, 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n ac = ac - a + b\r\n if ac > ma:\r\n ma = ac\r\nprint(ma)", "n=int(input())\r\na=0\r\nb=0\r\nmin=0\r\nfor i in range(n):\r\n x,y=input().split()\r\n a+=int(x)\r\n b+=int(y)\r\n r=b-a\r\n if r>min:\r\n min=r\r\nprint(min)\r\n", "# Do you need any discussion with me?\r\n# Join: https://chat.whatsapp.com/E2iFdzBnw1KAJukwd7Y5Pz\r\n\r\nimport math as ma\r\nimport collections\r\n\r\n\r\n# .......................................\r\n\r\ndef solve():\r\n n = int(input())\r\n # nums = [int(i) for i in input().split()][:n]\r\n ans = 0\r\n count = 0\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n count -= a\r\n count += b\r\n ans = max(ans, count)\r\n print(ans)\r\n\r\n\r\ndef main():\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n # check()\r\n solve()\r\n\r\n\r\ndef check():\r\n print(\"I am check function.\")\r\n\r\n\r\ndef euclidean_algo(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return euclidean_algo(b, a % b)\r\n\r\n\r\ndef prime_number(n):\r\n # O(sqrt(n)\r\n if n <= 1:\r\n return False\r\n\r\n for i in range(2, int(ma.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef quick_sort(nums):\r\n nums = list(nums)\r\n\r\n if len(nums) <= 1:\r\n return nums\r\n else:\r\n pivot = nums[0]\r\n less = [i for i in nums[1:] if i <= pivot]\r\n high = [i for i in nums[1:] if i > pivot]\r\n\r\n sortedNums = quick_sort(less)\r\n sortedNums.extend([pivot])\r\n sortedNums.extend(quick_sort(high))\r\n\r\n return sortedNums\r\n\r\n\r\ndef binary_search(nums, element):\r\n # nums = quick_sort(nums) # if nums not sorted\r\n left = 0\r\n right = len(nums) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if nums[mid] < element:\r\n left = mid + 1\r\n elif nums[mid] > element:\r\n right = mid - 1\r\n else:\r\n print(\"Item found at {}\".format(mid))\r\n exit()\r\n print(\"Item is not found.\")\r\n\r\n\r\ndef lexicographical_small(x, y):\r\n i = 0\r\n while i < len(x) and i < len(y):\r\n if x[i] < y[i]:\r\n return x\r\n elif y[i] < x[i]:\r\n return y\r\n i += 1\r\n\r\n if len(x) < len(y):\r\n return x\r\n elif len(y) < len(x):\r\n return y\r\n else: # equal\r\n return x\r\n\r\n\r\ndef sumOfDigit(num):\r\n total = 0\r\n while num != 0:\r\n div = num % 10\r\n total += div\r\n num = num // 10\r\n return total\r\n\r\n # or\r\n # nums = list(map(int, str(num))\r\n # return sum(nums)\r\n\r\n\r\ndef subLists(value):\r\n # res = [[]]\r\n for i in range(len(value) + 1):\r\n for j in range(i):\r\n yield value[j:i]\r\n # res.append(value[j:i])\r\n\r\n return value[1:] # skip empty sublist\r\n\r\n\r\ndef stringPalindrome(s):\r\n if s == s[::-1]:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\ndef frequencyCount(s):\r\n fre = dict(collections.Counter(s))\r\n\r\n return fre\r\n\r\n # sortedDict = {k: fre[k] for k in sorted(fre)}\r\n # return sortedDict\r\n\r\n\r\ndef checkForSubsequence(STR, target):\r\n s = [] # stack\r\n for i in target:\r\n s.append(i) # pushing the character of target into the stack\r\n\r\n for i in range(len(STR) - 1, -1, -1):\r\n if len(s) == 0:\r\n return True # if the stack is empty\r\n\r\n if STR[i] == s[-1]:\r\n s.pop() # removing the top of element of the stack\r\n\r\n if len(s) == 0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n# MATH FORMULA HUB\r\n# 1. Arithmetic sum formula to calculate the sum of the first 'n' natural numbers:\r\n# (n * (n + 1)) // 2.\r\n# 2. Summation of all the odd numbers between a to b (inclusive):\r\n# (((b + 1) // 2) * ((b + 1) // 2)) - ((((a-1)+1) // 2) * (((a-1)+1) // 2))\r\n# 3. Summation of all the even numbers between a to b (inclusive):\r\n# ((n * (n + 1)) // 2) - ((((b + 1) // 2) * ((b + 1) // 2)) - ((((a-1)+1) // 2) * (((a-1)+1) // 2)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "u=int(input())\r\nq=0\r\nr=0\r\nfor i in range(u):\r\n c,d=map(int,input().split())\r\n r-=c\r\n r+=d\r\n q=max(q,r)\r\nprint(q)", "t = int(input())\r\nthere=0\r\nmaxi=there\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n there=there+(b-a)\r\n if maxi<there:\r\n maxi=there\r\n\r\nprint(maxi)", "total_steps = current_position = 0\r\n# afsva\r\nfor _ in [0] * int(input()):\r\n \r\n current_position -= eval(input().replace(' ', '-'))\r\n \r\n total_steps = max(total_steps, current_position)\r\n\r\nprint(total_steps)\r\n", "sm=0\r\nar=[]\r\nfor _ in range(int(input())):\r\n s=list(map(int,input().split()))\r\n sm=sm-s[0]\r\n ar.append(sm)\r\n sm=sm+s[1]\r\n ar.append(sm)\r\nprint(max(ar))\r\n", "n=int(input())\r\nsum=0\r\na=[]\r\nfor _ in range(n):\r\n l=input().split()\r\n sum=sum-int(l[0])+int(l[1])\r\n a.append(sum)\r\nprint(max(a))", "a=p=0\r\nfor x in[0]*int(input()):p-=eval(input().replace(' ','-'));a=max(a,p)\r\nprint(a)", "n = int(input())\r\n\r\np = 0\r\nm = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n p = p - a + b\r\n m = max(p, m)\r\n\r\nprint(m)", "t = int(input())\r\npas = 0\r\nmax = pas\r\nfor i in range(t):\r\n x,y = map(int,input().split())\r\n pas = pas - x + y \r\n if(max < pas):\r\n max = pas\r\nprint(max) ", "a=int(input())\r\nc=0\r\nx=[]\r\nfor i in range(a):\r\n m,n=map(int,input().split())\r\n c+=(n-m)\r\n x.append(c)\r\nprint(max(x))", "n = int(input())\r\nx = 0 \r\ny = 0\r\nfor _ in range(n):\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n x = x + b - a\r\n if x > y:\r\n y = x\r\n y = x\r\nprint(y)\r\n", "# x = input()\r\n# y = input()\r\n# z = x.upper()\r\n# m = y.upper()\r\n# if(z == m):\r\n# print(0)\r\n# elif(z > m):\r\n# print(1)\r\n# elif(z < m):\r\n# print(-1)\r\n# x = list(input())\r\n# v=[]\r\n# for i in range(0, len(x)-1, 2):\r\n# for j in range (0,i):\r\n# if(x[] < x[]):\r\n\r\n# x[], x[] = x[i+2], x[i]\r\n# y = [1, \"+\", 2, \"+\", 4, 3, 2]\r\n# y = [str(x) for x in y]\r\n# y = [1, \"+\", 2, \"+\", 4, 3, 2]\r\n# y = [x for x in y if x != \"+\"]\r\n# y = [1, 2, \"+\", 5]\r\n# for i in y:\r\n# if i == \"+\":\r\n# y.remove(i)\r\n\r\n# print(y)\r\n# x = list(input())\r\n# for i in x:\r\n# if i == '+':\r\n# x.remove(i)\r\n# y = sorted(x)\r\n# print(\"+\".join(y))\r\n\r\n# print(''.join(x))\r\n# print(m)\r\n# x = input()\r\n# z = x[0]\r\n# m = z.upper()\r\n# a = []\r\n# a[:0] = x\r\n\r\n# del a[0]\r\n\r\n\r\n# print(m + \"\".join(a))\r\n# name = input()\r\n# m = len(name)\r\n# if m % 2 == 0:\r\n# print(\"CHAT WITH HER!\")\r\n# else:\r\n# print(\"IGNORE HIM!\")\r\n# no = int(input())\r\n# stones = list(input())\r\n# count = 0\r\n# for i in range(0, len(stones)-1):\r\n# if stones[i] == stones[i+1]:\r\n# count += 1\r\n# print(count)\r\n# from operator import indexOf\r\n\r\n\r\n# list1 = list(map(int, input().split()))\r\n# count = 0\r\n# m = list1[0]\r\n# n = list1[1]\r\n# # print(len(list1))\r\n# for i in range(0, 10):\r\n# if m <= n:\r\n# m = m*3\r\n# n = n*2\r\n# count += 1\r\n# else:\r\n# break\r\n# print(count)\r\n# list1 = list(map(int, input().split()))\r\n# m = 0\r\n# for i in range(1, list1[2]+1):\r\n# m = i*list1[0]+m\r\n\r\n# if m > list1[1]:\r\n# m = m-list1[1]\r\n# print(m)\r\n# else:\r\n# print(0)\r\n# m = int(input())\r\n# count = 0\r\n# for i in range(0, m):\r\n# m = m-5\r\n# z = m\r\n# if z > 0:\r\n# count += 1\r\n# else:\r\n# count += 1\r\n# break\r\n\r\n# print(count)\r\n# word = \"hello\"\r\n# print(word[2].upper())\r\n# word = input()\r\n# upper = 0\r\n# for i in word:\r\n# if i.isupper():\r\n# upper += 1\r\n# if upper > len(word) / 2:\r\n# print(word.upper())\r\n# else:\r\n# print(word.lower())\r\n# set1 = set(input())\r\n\r\n# m = len(set1)\r\n# if m % 2 == 0:\r\n# print(\"CHAT WITH HER!\")\r\n# else:\r\n# print(\"IGNORE HIM!\")\r\n#from math import ceil\r\n\r\n\r\n# list1 = list(map(int, input().split()))\r\n# m = int(list1[0])\r\n# for i in range(0, list1[1]):\r\n# if (m % 10) != 0:\r\n# m = int(m-1)\r\n# elif(m % 10 == 0):\r\n# m = int(m / 10)\r\n# print(m)\r\n# from re import S\r\n# from turtle import st\r\n# from datetime import date\r\n\r\n\r\n# class student:\r\n\r\n# def __init__(self, name='none', age=0):\r\n# self.name = name\r\n# self.age = age\r\n\r\n# def describe(self):\r\n# print(\"my name is {} and my age is {}\".format(self.name, self.age))\r\n\r\n# @classmethod\r\n# def initfrombirthyear(cls, name, birthyear):\r\n# return cls(name, date.today().year-birthyear)\r\n\r\n\r\n# student_1 = student(\"ahmed\", 60,)\r\n# student_2 = student.initfrombirthyear(\"mohamed\", 1999)\r\n# student_1.describe()\r\n# student_2.describe()\r\nfrom posixpath import split\r\n\r\na = []\r\nnum_of_operations = int(input())\r\n\r\nlist1 = list(map(int, input().split()))\r\na.append(list1[1])\r\nfor i in range(0, num_of_operations-1):\r\n list2 = list(map(int, input().split()))\r\n m = list1[1]-list2[0]+list2[1]\r\n list1[1] = m\r\n a.append(m)\r\n\r\nprint(max(a))\r\n", "n=int(input())\r\np=0\r\nma=0\r\nfor i in range(n):\r\n t=input().split()\r\n a=int(t[0])\r\n b=int(t[1])\r\n p+=-1*a+b\r\n if p>ma:\r\n ma=p\r\nprint(ma)", "n = int(input())\r\nmincap = 0\r\ntot = 0\r\nwhile n:\r\n exit,enter = map(int,input().split())\r\n tot -= exit\r\n tot += enter\r\n mincap = max(mincap,tot)\r\n n -= 1\r\nprint(mincap)", "sum = 0\r\nmax = 0\r\nfor _ in range(int(input())):\r\n x,y = map(int,input().split())\r\n sum -= x\r\n sum += y\r\n if sum > max:\r\n max = sum\r\nprint(max)", "n=int(input())\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n p=x-y\r\n if p<0:\r\n c+=abs(p)\r\n l.append(c)\r\n else:\r\n c-=p\r\nif l:\r\n print(max(l))\r\nelse:\r\n print(0)", "tram_stops = int(input())\r\n\r\nfall_people_in_tram = 0\r\n\r\nlist_stop = []\r\nfor i in range(tram_stops):\r\n input_output_peopel = list(map (int ,input().split()))\r\n fall_people_in_tram += input_output_peopel[1]\r\n fall_people_in_tram -= input_output_peopel[0]\r\n \r\n list_stop.append(fall_people_in_tram)\r\n\r\nprint(max(list_stop))\r\n", "# for _ in range(int(input())):\r\nn = int(input())\r\ninside = 0\r\nmax_inside = 0\r\n\r\nfor i in range(n):\r\n new = [int(x) for x in input().split()]\r\n inside = inside - new[0] + new[1]\r\n max_inside = max(inside, max_inside)\r\n\r\nprint(max_inside)\r\n\r\n\r\n", "n=int(input())\r\nc=[]\r\ns=0\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n s+=b\r\n s-=a\r\n c.append(s)\r\n \r\nprint(max(c))", "a=int(input())\r\nb=0\r\nd=[]\r\nfor i in range(0,a):\r\n c=input().split()\r\n b=b-int(c[0])+int(c[1])\r\n d.append(b)\r\nprint(max(d))", "n=int(input())\r\nx0,y0=map(int,input().split())\r\nlst=[y0]\r\np=y0\r\nlst=[y0]\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n p=p-x+y\r\n lst.append(p)\r\nprint(max(lst))", "n=int(input())\r\ncapacity=0\r\nc=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n c=c-a+b\r\n capacity=max(capacity,c)\r\nprint(capacity)", "t=int(input())\r\ncap=0\r\nx=0\r\n\r\nfor i in range(t,0,-1):\r\n a,b=map(int,input().split())\r\n cap=cap-a+b\r\n x=max(x,cap)\r\n\r\nprint(x)", "loop = int(input())\r\non, off, count, res = 0, 0, 0, 0\r\n\r\nfor _ in range(loop):\r\n off, on = map(int, input().split())\r\n count -= off\r\n count += on\r\n if count > res:\r\n res = count\r\n\r\nprint(res)", "n = int(input())\r\ncapacity = []\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n c = c - a + b\r\n capacity.append(c)\r\nprint(max(capacity))", "n = int(input())\r\n\r\ncurrentPassengers = 0\r\nmaxPassengers = 0\r\n\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n currentPassengers -= ai\r\n currentPassengers += bi\r\n maxPassengers = max(maxPassengers, currentPassengers)\r\n\r\nprint(maxPassengers)\r\n", "#-------------------------------------------------------------------------------\r\n# Name: A. Tram\r\n# Purpose: Implementation\r\n#\r\n# Author: Inzy\r\n#\r\n# Created: 25/06/2023\r\n# Copyright: (c) Asus 2023\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\nlst1=[]\r\nt=int(input())\r\nfor x in range(t):\r\n a,b=map(int, input().split())\r\n if a==0 and x==0:\r\n val=b-a\r\n lst1.append(b-a)\r\n else:\r\n val=lst1[x-1]\r\n lst1.append(val-a+b)\r\n\r\n#print(max(lst1))\r\n #if a==0:\r\n # p=b-a\r\n # else:\r\n # c=p-a+b\r\n # lst1.append(c)\r\n#print(lst1)\r\nprint(max(lst1))", "n = int(input())\r\nmax, current = 0, 0\r\n\r\nfor i in range(n):\r\n exit, enter = list(map(int, input().split(' ')))\r\n current += enter - exit\r\n \r\n if current > max:\r\n max = current\r\n\r\nprint(max)", "n = int(input())\r\nx = []\r\ntotal = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n total += b - a\r\n x.append(total)\r\nprint(max(x))\r\n", "n=int(input())\r\n\r\npassenger_count=0\r\nmin_capacity=0\r\n\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n\r\n passenger_count+=b-a \r\n # passenger_count = passenger_count - a + b \r\n\r\n if passenger_count>min_capacity:\r\n min_capacity=passenger_count\r\n \r\nprint(min_capacity)", "ans = 0\r\nc = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n c += -a+b\r\n ans = max(ans, c)\r\nprint(ans)\r\n", "n=int(input())\r\nc=m=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c=c-a\r\n c=c+b\r\n if c>m:\r\n m=c\r\nprint(m)", "n = int(input())\r\nmax_value = 0\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n total -= a\r\n total += b\r\n max_value = max(max_value, total)\r\n\r\nprint(max_value)\r\n", "n=int(input())\r\nc=0\r\nl=list()\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n c+=(b-a)\r\n l.append(c)\r\nprint(max(l))", "a = int(input())\r\nc = 0\r\ns = 0\r\nfor n in range(a) :\r\n x , z = map(int,input().split())\r\n \r\n s -= x\r\n s += z\r\n c = max(c,s)\r\nprint(c)", "# Read input\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncurrent_passengers = 0\r\nmax_capacity = 0\r\n\r\n# Iterate through each stop\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_passengers -= a # Passengers exiting\r\n current_passengers += b # Passengers entering\r\n max_capacity = max(max_capacity, current_passengers)\r\n\r\n# Print the minimum capacity\r\nprint(max_capacity)\r\n", "q=w=0\r\nfor x in[0]*int(input()):w-=eval(input().replace(' ','-'));q=max(q,w)\r\nprint(q)", "n=int(input())\r\nst=[list(map(int,input().split()))for _ in range(n)]\r\nc,m=0,0\r\nfor i,j in st:\r\n c-=i\r\n c+=j\r\n m=max(m,c)\r\nprint(m)", "n = int(input())\r\nlist = []\r\ncap = 0\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n cap = cap - a + b\r\n list.append(cap)\r\nprint(int(max(list)))\r\n", "n = int(input())\r\nc = 0\r\nans =0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n c -= a\r\n c += b\r\n ans = max(ans,c)\r\nprint(ans)", "n = int(input())\r\nx = 0\r\nd = 0\r\nfor i in range(n):\r\n a, b = map(int,input().split())\r\n d = d - a\r\n d = d + b\r\n x = max(x,d)\r\nprint(x)", "q=0\r\nl1=list()\r\na=int(input())\r\nfor i in range(a):\r\n p=list(map(int,input().split()))\r\n q=q-p[0]+p[1]\r\n l1.append(q)\r\nprint(max(l1))\r\n", "n=int(input())\r\nm=0\r\ns=0\r\nwhile n:\r\n\tx,y=map(int,input().split())\r\n\ts=s+y-x\r\n\tif s>m:\r\n\t\tm=s\r\n\tn=n-1\r\nprint(m)", "n = int(input())\r\narr = []\r\nans = 0\r\nfor i in range(0,n):\r\n a,b = map(int,input().split())\r\n ans=ans-a\r\n ans += b\r\n arr.append(ans)\r\nprint(max(arr))", "ans = 0\r\nk = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n k -= a\r\n k += b\r\n ans = max(k, ans)\r\nprint(ans)\r\n", "def tram(n):\r\n \r\n stops=[]\r\n total=0\r\n for i in range(n):\r\n ai,bi=input(\"\").split()\r\n total=total-int(ai)+int(bi)\r\n stops.append(total)\r\n minimum=max(stops)\r\n print(minimum)\r\nn=int(input(\"\"))\r\ntram(n) ", "line = input()\r\nenter = 0\r\nExit = 0\r\nc = 0\r\ncapacity = []\r\nfor i in range(int(line)):\r\n content = input().split(' ')\r\n Exit = int(content[0])\r\n enter = int(content[1])\r\n c -= Exit\r\n c += enter\r\n capacity.append(c)\r\nCapacity = max(capacity)\r\nprint(Capacity)\r\n", "# your code goes here\r\nn=int(input())\r\nres=0\r\nm=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tres+=(b-a)\r\n\tif m<res:\r\n\t\tm=res\r\n\t# print(res)\r\nprint(m)", "n = int(input())\r\nt = [0]*(n+1)\r\nfor i in range(1,n+1):\r\n a,b = map(int,input().split())\r\n t[i] = t[i-1]-a+b\r\nprint(max(t))", "max = 0\r\ntotal = 0\r\nfor i in range(int(input())):\r\n off, on = input().split()\r\n off, on = int(off),int(on)\r\n total = total + on - off\r\n if total > max:\r\n max = total\r\nprint(max)", "m=0\r\ninside=0\r\nfor i in range(int(input())):\r\n o,i=map(int,input().split())\r\n inside=inside-o+i\r\n if inside>m:\r\n m=inside\r\nprint(m)\r\n ", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncurrent_passengers = 0\r\nmax_passengers = 0\r\n\r\n# Process each stop\r\nfor _ in range(n):\r\n # Read the number of exiting and entering passengers\r\n exiting, entering = map(int, input().split())\r\n\r\n # Update the current number of passengers\r\n current_passengers -= exiting\r\n current_passengers += entering\r\n\r\n # Update the maximum number of passengers seen so far\r\n max_passengers = max(max_passengers, current_passengers)\r\n\r\n# Print the minimum possible capacity of the tram\r\nprint(max_passengers)\r\n", "def minimum_tram_capacity(n, stops):\r\n capacity = 0\r\n current_passengers = 0\r\n\r\n for stop in stops:\r\n current_passengers -= stop[0] # Exiting passengers\r\n current_passengers += stop[1] # Entering passengers\r\n capacity = max(capacity, current_passengers)\r\n\r\n return capacity\r\n\r\n# Input reading\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Output the result\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)\r\n", "n = int(input())\r\nmax = 0\r\nremaining = 0\r\nfor i in range(n):\r\n ab = input().split(' ')\r\n a = int(ab[0])\r\n b = int(ab[1]) + remaining\r\n remaining = b - a\r\n if b - a > max:\r\n max = b - a\r\nprint(max)", "s = int(input())\r\n\r\ntotal = 0\r\n\r\nmax_total = 0\r\n\r\nfor i in range(s):\r\n\r\n l, c = map(int, input().split())\r\n\r\n total += c\r\n total -= l\r\n\r\n if total > max_total: \r\n max_total = total\r\n\r\nprint(max_total)", "n = int(input())\r\nc= 0\r\np= 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n p -= a\r\n p += b\r\n c = max(c,p)\r\n\r\nprint(c)", "def main():\r\n t = int(input())\r\n answ = 0\r\n curr = 0\r\n for i in range(0, t):\r\n leave, board = map(int, input().split())\r\n curr -= leave\r\n curr += board\r\n answ = max(answ, curr)\r\n print(answ)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\nb=0\r\nc=[]\r\nfor i in range(a):\r\n p,q=map(int,input().split())\r\n b=b+q\r\n b=b-p\r\n c.append(b)\r\nprint(max(c)) ", "capacity=0\r\nmax=0\r\nfor _ in range(int(input())):\r\n m,n=map(int,input().split())\r\n capacity+=(n-m)\r\n if(max<capacity):\r\n max=capacity\r\nprint(max)\r\n ", "n=int(input())\r\nl=[]\r\na,b=0,0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a=a+b-x\r\n b=y\r\n c=a+b\r\n l.append(c)\r\n \r\n \r\nprint(max(l))", "n = int(input())\r\nl = [0]\r\nfor i in range(1, n+1):\r\n line = list(input().split())\r\n if int(line[0]) == 0:\r\n l.append(l[i-1] + int(line[1]))\r\n else:\r\n l.append(l[i-1] - int(line[0]) + int(line[1]))\r\n\r\nprint(max(l))", "# Read the number of tram stops\r\nn = int(input())\r\n\r\n# Initialize variables for current capacity and maximum capacity\r\ncurrent_capacity = 0\r\nmax_capacity = 0\r\n\r\n# Iterate through each stop\r\nfor _ in range(n):\r\n # Read the number of passengers exiting and entering at this stop\r\n exiting, entering = map(int, input().split())\r\n\r\n # Calculate the current number of passengers inside the tram\r\n current_capacity = current_capacity - exiting + entering\r\n\r\n # Update the maximum capacity if needed\r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n# Print the maximum capacity as the minimum possible capacity\r\nprint(max_capacity)\r\n", "n = int(input())\r\ncap = 0\r\ncurrent = 0\r\nfor _ in range(n):\r\n i, j = map(int, input().split())\r\n current += j - i\r\n cap = max(cap, current)\r\n\r\nprint(cap)\r\n", "n=int(input())\r\nx=list()\r\n\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n x.append([a,b])\r\nm=x[0][1]\r\nsuma=0\r\nfor i in x:\r\n suma-=i[0]\r\n suma+=i[1]\r\n if suma>m:\r\n m=suma\r\nprint(m)", "n = int(input())\r\ns = [list(map(int,input().split())) for _ in range(n)]\r\ncp = 0\r\nc = 0\r\nfor stop in s:\r\n cp = cp - stop[0]\r\n cp = cp + stop[1]\r\n c = max(c,cp)\r\nprint(c)", "t=int(input())\r\nr=0\r\nm=0\r\nfor _ in range(t) :\r\n a,b=map(int,input().split())\r\n b+=r\r\n r=b-a\r\n if r>m :\r\n m=r\r\nprint(m)", "n=int(input())\r\nar=[]\r\ncount=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n count=count-a+b\r\n ar.append(count)\r\nprint(max(ar))\r\n", "x=0\r\nd=0\r\nfor i in range(int(input())):\r\n a=list(map(int,input().split()))\r\n x+=a[1]-a[0]\r\n d=max(d,x)\r\nprint(d)\r\n", "# Input the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncurrent_capacity = 0 # Current number of passengers inside the tram\r\nmin_capacity = 0 # Minimum tram capacity\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n \r\n # Update the current number of passengers inside the tram\r\n current_capacity = current_capacity - a + b\r\n \r\n # Update the minimum tram capacity if needed\r\n min_capacity = max(min_capacity, current_capacity)\r\n\r\n# The minimum capacity required is the maximum number of passengers inside the tram\r\nprint(min_capacity)\r\n", "n=int(input())\r\n\r\nmaxpas=0\r\npas=0\r\nfor i in range(n):\r\n x,y=map(int,input().split(' '))\r\n pas+=y-x\r\n maxpas=max(pas,maxpas)\r\n\r\n\r\n \r\n \r\n\r\nprint(maxpas)\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "def calculateMinimumCapacity(n, stops):\r\n capacity = 0\r\n currentPassengers = 0\r\n\r\n for stop in stops:\r\n passengersExit, passengersEnter = stop\r\n currentPassengers -= passengersExit\r\n currentPassengers += passengersEnter\r\n capacity = max(capacity, currentPassengers)\r\n\r\n return capacity\r\n\r\n# Read the number of stops\r\nn = int(input())\r\n\r\n# Read the stop information\r\nstops = []\r\nfor _ in range(n):\r\n passengersExit, passengersEnter = map(int, input().split())\r\n stops.append((passengersExit, passengersEnter))\r\n\r\n# Calculate the minimum capacity of the tram\r\nminimumCapacity = calculateMinimumCapacity(n, stops)\r\n\r\n# Print the result\r\nprint(minimumCapacity)\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.extend((input().split()))\r\n l = [int(x) for x in l]\r\nfor i in range(1, len(l)-1, 2):\r\n l[i+2] = l[i] - l[i+1] + l[i+2]\r\nprint(max(l))", "x=int(input())\r\nsum=0\r\nmin=0\r\nwhile(x>0):\r\n x-=1\r\n a,b=list(map(int,input().split()))\r\n sum-=a \r\n sum+=b \r\n if(sum>min):\r\n min=sum\r\n \r\nprint(min)", "nk = int(input())\r\na = [0]*nk\r\nb = [0]*nk\r\nfor i in range(nk):\r\n a[i], b[i] = (int(j) for j in input().split())\r\ncp = 0\r\nnu = 0\r\nfor i in range(nk):\r\n nu -= a[i]\r\n nu += b[i]\r\n if nu > cp:\r\n cp = nu\r\nprint(cp)", "stops_count = int(input())\r\n\r\nn = 0\r\nn_max = 0\r\nfor _ in range(stops_count):\r\n exit, enter = map(int, input().split())\r\n n += (enter - exit)\r\n if n > n_max:\r\n n_max = n\r\n\r\nprint(n_max)", "n = int(input())\r\ncurrent_passengers = 0\r\nmin_capacity = 0\r\n\r\nfor _ in range(n - 1):\r\n ai, bi = map(int, input().split())\r\n current_passengers = current_passengers - ai + bi\r\n min_capacity = max(min_capacity, current_passengers)\r\n\r\nprint(min_capacity)\r\n", "# https://codeforces.com/problemset/problem/116/A\nn_stops = int(input())\ntotal_tram = 0\ntram_list = []\nfor _ in range(n_stops):\n out_tram, in_tram = map(int, input().split(\" \"))\n total_tram = total_tram + in_tram - out_tram\n tram_list.append(total_tram)\nprint(max(tram_list))\n", "#n - number of tram stops\r\n\r\nn = int(input())\r\n\r\n#max capacity of the train\r\n\r\ncap_max=0 \r\n\r\ntemp = cap_max\r\n\r\nfor i in range(1,n+1):\r\n \r\n #a , b - number of passangers exit at the stop , number of passangers enter at the stop\r\n a,b = map(int,input().split())\r\n \r\n temp = temp+b-a\r\n if(temp>cap_max):\r\n cap_max=temp\r\nprint(cap_max)", "n=int(input())\r\nmatrix=[list(map(int,input().split())) for _ in range(n)]\r\nmax=matrix[0][0]\r\ncnt=matrix[0][0]\r\n\r\nfor i in range(n-1):\r\n cnt+=matrix[i][1]\r\n if cnt>max:\r\n max=cnt\r\n cnt-=matrix[i+1][0]\r\n if cnt>max:\r\n max=cnt\r\nprint(max)\r\n", "n = int(input())\r\np = [0]\r\ni = 1\r\nwhile i <= n:\r\n values = input().split()\r\n p.append(p[i-1] + int(values[1]) - int(values[0]))\r\n i += 1\r\nprint(max(p))\r\n", "n = int(input())\r\ni=0\r\nls = []\r\nk=0\r\nwhile i<n:\r\n s = input()\r\n k+=int(s.split(\" \")[1])-int(s.split()[0])\r\n ls.append(k)\r\n i+=1\r\nprint(max(ls))", "n_paradas = int(input())\r\npasajeros = 0\r\narreglo = []\r\nfor c in range(n_paradas):\r\n a,b = list(map(int, input().split(\" \")))\r\n pasajeros = pasajeros - a + b\r\n arreglo += [pasajeros]\r\n\r\narreglo.sort()\r\ntam = len(arreglo)\r\nprint(arreglo[tam-1])\r\n", "n = int(input())\r\npassengers = 0\r\nmaxNum = 0\r\n# entry = 0\r\n# exit = 0\r\nfor i in range(n):\r\n exit, entry = map(int, input().split())\r\n passengers -= exit\r\n passengers += entry\r\n if passengers > maxNum:\r\n maxNum = passengers\r\n\r\nprint(maxNum)", "n = int(input())\r\n\r\nriders=0\r\nmax_riders=0\r\n\r\nfor i in range(n):\r\n leave, enter = map(int,input().split())\r\n \r\n riders=riders+enter-leave\r\n max_riders=max(max_riders,riders)\r\n\r\nprint(max_riders)\r\n", "n=int(input())\r\ncount=0\r\ni=1\r\nl=[]\r\nwhile(i<=n):\r\n a,b=[int(i) for i in input().split()]\r\n count+=b-a\r\n l.append(count)\r\n i+=1\r\nl1=max(l)\r\nprint(l1)", "max_cap=0\r\ncap=0\r\nnum_tram = int(input())\r\nfor i in range(num_tram):\r\n a,b = list(map(int,input().split()))\r\n cap = (cap-a)+b\r\n #print(cap)\r\n if(max_cap<cap):\r\n max_cap=cap\r\nprint(max_cap)", "n=int(input())\r\nl1=[]\r\nl2=[]\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l1.append(a)\r\n l2.append(b);\r\nfor i in range(1,n):\r\n l.append(sum(l2[:i])-sum(l1[:i]))\r\nprint(max(l))\r\n \r\n \r\n \r\n\r\n", "\"\"\"\r\nInfo\r\ntram line, n stops [1-n]\r\ni-th stop ai passengers exit, bi passengers enter\r\nbeginning empty , ending empty\r\ntask calculate minimum capacity\r\n\r\ninput\r\nfirst line: n (2 <= n <= 1000) tram stops\r\nn lines: two integer ai and bi\r\n\r\noutput\r\ninteger denoting the minimum possible capacity of the tram\r\n\r\n>>> run_code([[0, 3], [2, 5], [4, 2], [4, 0]])\r\n6\r\n\"\"\"\r\ndef get_input():\r\n stops = int(input())\r\n # transform stops inputs into list of lists\r\n passenger_traffic_list = []\r\n for i in range(stops):\r\n station = input().split()\r\n passenger_traffic = [int(i) for i in station]\r\n passenger_traffic_list.append(passenger_traffic)\r\n return passenger_traffic_list\r\n \r\ndef run_code(passenger_traffic_list):\r\n max_capacity = 0\r\n station_capacity = 0\r\n for i in passenger_traffic_list:\r\n station_capacity = station_capacity - i[0] + i[1]\r\n if station_capacity > max_capacity:\r\n max_capacity = station_capacity\r\n print(max_capacity)\r\n \r\nif __name__ == '__main__':\r\n #import doctest\r\n #doctest.testmod()\r\n passenger_traffic_list = get_input()\r\n run_code(passenger_traffic_list)", "n = int(input())\r\n\r\np = 0\r\nmax_p = 0\r\n\r\nfor i in range(n):\r\n \r\n z, v = list(map(int, input().split()))\r\n \r\n p = p - z + v\r\n \r\n if p > max_p :\r\n \r\n max_p = p\r\n \r\nprint(max_p)\r\n ", "n = int(input())\r\ncapacity = 0\r\nmax_capacity = 0\r\n\r\nfor _ in range(n):\r\n passengers, passengers_enter = map(int, input().split())\r\n capacity += passengers_enter - passengers\r\n max_capacity = max(max_capacity, capacity)\r\n\r\nprint(max_capacity)\r\n", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\nimport sys\r\ninput=sys.stdin.readline\r\n# import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# from collections import Counter\r\n# int(math.log(len(L)))\r\nimport math\r\n# from collections import defaultdict\r\n# mod=10**9+7\r\n# from collections import deque\r\n\r\n\r\n\r\ndef t():\r\n n=II()\r\n ans=0\r\n temp=0\r\n for i in range(n):\r\n a,b=MII()\r\n temp+=b-a\r\n ans=max(ans,temp)\r\n print(ans)\r\nif __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n t()", "n = int(input())\r\ni = 0\r\nj = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n i -= a\r\n i += b\r\n if i > j:\r\n j = i\r\nprint(j)\r\n", "import collections, math, bisect, heapq, random, functools, itertools, copy, typing\nimport platform; LOCAL = (platform.uname().node == 'AMO')\n\n\nimport sys; input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\ninp = lambda f=int: list(map(f, input().split()))\n\ndef make_arr(*args):\n def func(x):\n if len(args) == 1: return [x() for _ in range(args[0])]\n return [make_arr(*args[1:])(x) for _ in range(args[0])]\n return func\n\ndef debug(*args):\n if LOCAL:\n print('\\033[92m', end='')\n printf(*args)\n print('\\033[0m', end='')\n\ndef printf(*args):\n if LOCAL:\n print('>>>: ', end='')\n for arg in args:\n if isinstance(arg, typing.Iterable) and \\\n not isinstance(arg, str) and \\\n not isinstance(arg, dict):\n print(' '.join(map(str, arg)), end=' ')\n else:\n print(arg, end=' ')\n print()\n\n# avaliable on Google, AtCoder\n# sys.setrecursionlimit(10**6)\n# import numpy as np\n# import scipy\n\n# d4 = [(1,0),(0,1),(-1,0),(0,-1)]\n# d8 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)]\n# d6 = [(2,0),(1,1),(-1,1),(-2,0),(-1,-1),(1,-1)] # hexagonal layout\n\ndef solve(cas):\n n, = inp()\n cur = 0\n ans = 0\n for _ in range(n):\n a, b = inp()\n cur -= a\n cur += b\n ans = max(ans, cur)\n print(ans)\n \n\n\ncas = 1\nfor _ in range(cas):\n solve(_)\n\n", "n = int(input())\r\nlst = []\r\ns = 0\r\nfor i in range(n):\r\n l = input().split(\" \")\r\n a, b = int(l[0]), int(l[1])\r\n s = s - a + b\r\n lst.append(s)\r\nprint(max(lst))\r\n", "n=int(input())\r\nk=0\r\nf=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n f+=b\r\n f-=a\r\n if f>k:\r\n k=f\r\nprint(k)", "#https://codeforces.com/problemset/problem/116/A\r\nt = int(input())\r\nsum = 0\r\nsumt = 0\r\nwhile t > 0:\r\n a, b = map(int, input().split())\r\n sum = sum + (b-a)\r\n if (sum > sumt):\r\n sumt = sum\r\n\r\n t -= 1\r\nprint(sumt)", "n=int(input())\r\ns=0\r\nli=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s-=a\r\n s+=b\r\n li.append(s)\r\nprint(max(li))\r\n", "n = int(input())\nminimum = 0\npeople = 0\nfor i in range(n):\n a, b = map(int,input().split())\n people = people - a + b\n if people >= minimum:\n minimum = people\nprint(minimum)", "def calculate_minimum_capacity(n, stops):\r\n capacity = 0\r\n current_passengers = 0\r\n\r\n for i in range(n):\r\n passengers_exit, passengers_enter = stops[i]\r\n current_passengers -= passengers_exit\r\n current_passengers += passengers_enter\r\n\r\n capacity = max(capacity, current_passengers)\r\n\r\n return capacity\r\n\r\nn = int(input().strip())\r\nstops = [tuple(map(int, input().strip().split())) for _ in range(n)]\r\n\r\n\r\nresult = calculate_minimum_capacity(n, stops)\r\nprint(result)\r\n", "n = int(input())\r\n\r\nc = []\r\n\r\ni = 0\r\n\r\nwhile i < n:\r\n a,b = map(int,input().split())\r\n if i == 0:\r\n c.append(b)\r\n else:\r\n c.append(c[i-1]+b-a)\r\n i+=1\r\n \r\nprint(max(c))", "n = int(input())\r\npepl = 0\r\nmin = 0\r\n\r\nfor x in range(n):\r\n inp = input().split(' ')\r\n a = int(inp[0])\r\n b = int(inp[1])\r\n pepl = pepl - a + b\r\n if pepl > min:\r\n min = pepl\r\n\r\nprint(min)", "n = int(input())\n\npassengers = 0\nans = 0\nfor i in range(n):\n a, b = map(int, input().split())\n passengers -= a\n passengers += b\n ans = max(ans, passengers)\nprint(ans)", "n = int(input())\r\ncapacity = 0\r\nmax_capacity = 0\r\ncurrent_passengers = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_passengers = current_passengers - a + b\r\n max_capacity = max(max_capacity, current_passengers)\r\nprint(max_capacity)\r\n", "n = int(input())\nmax = 0\npassenger = 0\n\nfor i in range(n):\n a, b = map(int, input().split())\n passenger = passenger - a + b\n if passenger > max:\n max = passenger\n\nprint(max)\n", "a=int(input())\r\nc=[]\r\nb=input().split()\r\nc.append(int(b[1]))\r\nfor i in range(1,a):\r\n e=input().split()\r\n d=c[i-1]-int(e[0])+int(e[1])\r\n c.append(d)\r\nprint(max(c))", "n = int(input())\ntmp = 0\nmin = 0\ncurr = 0\nfor i in range(n):\n a,b = list(map(int,input().split()))\n curr = curr +(b-a)\n if curr > min:\n min = curr\nprint(min)\n\n", "x=int(input())\r\np=0\r\nmaks=0\r\nfor i in range(x):\r\n y,z=list(map(int,input().split(\" \")))\r\n maks=max(p+z-y,maks)\r\n p=p+z-y\r\n # p=max(p+z-y,p)\r\nprint(maks)", "n=int(input())\r\nsum=int(0)\r\nlist=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n sum=sum+b-a\r\n list.append(sum)\r\nlist.sort()\r\nlist.reverse()\r\nprint(list[0])", "n = int(input())\r\ncurrent_passengers = 0\r\nmin_capacity = 0\r\nfor _ in range(n):\r\n exiting, entering = map(int, input().split())\r\n current_passengers = current_passengers - exiting + entering\r\n min_capacity = max(min_capacity, current_passengers)\r\nprint(min_capacity)\r\n", "N = int(input())\r\n\r\ncurrentCapacity = 0\r\nmaxCapacity = 0\r\n\r\nwhile(N):\r\n \r\n a,b = map(int,input().split())\r\n currentCapacity = (currentCapacity-a)+b \r\n maxCapacity = max(maxCapacity, currentCapacity)\r\n \r\n N-=1 \r\nprint(maxCapacity)", "number_of_the_trams_stops = int(input())\r\nin_Tram = 0\r\ncapacity = -1\r\n\r\nfor stops in range(number_of_the_trams_stops):\r\n \r\n exit_passengers, entering_passengers = map(int, input().split())\r\n \r\n in_Tram += (entering_passengers - exit_passengers)\r\n \r\n if in_Tram > capacity:\r\n capacity = in_Tram\r\n \r\nprint(capacity) ", "n = int(input())\r\ntotal_passenger_after_each_stop = []\r\nno_of_passenger = 0\r\nfor _ in range(0,n) :\r\n enter_exit = input().split(' ')\r\n no_of_passenger += (int(enter_exit[1]) - int(enter_exit[0]))\r\n total_passenger_after_each_stop.append(no_of_passenger)\r\nprint(max(total_passenger_after_each_stop))", "n=int(input())\r\ncurrent=[]\r\nppl_no=0\r\nmax_no=0\r\n\r\nfor _ in range(n):\r\n x, y=map(int,input().split())\r\n current.append((x, y))\r\n \r\nfor i in range(n):\r\n ppl_no -= current[i][0]\r\n ppl_no += current[i][1]\r\n \r\n if ppl_no > max_no:\r\n max_no = ppl_no\r\n \r\nprint(max_no)", "\r\nt = 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 # n, t = map(int, input().split(\" \"))\r\n ch = 0\r\n l = int(input())\r\n\r\n\r\n max = 0\r\n now = 0\r\n for i in range(0, l):\r\n a, b = map(int, input().split(\" \"))\r\n now += b - a\r\n if now > max:\r\n\r\n max = now\r\n\r\n\r\n\r\n print(max)", "n = int(input())\r\ncapaciteit = 0\r\npassagiers = 0\r\nfor x in range(0,n,1):\r\n a, b = map(int, input().split())\r\n passagiers -= a\r\n passagiers += b\r\n if passagiers > capaciteit:\r\n capaciteit = passagiers\r\nprint(capaciteit)", "n=int(input())\r\nl=[]\r\na=0\r\nc=0\r\nfor i in range (n):\r\n l.append(list(map(int,input().split())))\r\n# print(l)\r\nfor i in l:\r\n a=a+i[1]-i[0]\r\n if a>c:\r\n c=a\r\n \r\nprint(c)", "w=input()\r\nc=m=0\r\nfor i in range(int(w)):\r\n a,b=map(int,input().split(' '))\r\n c+=b-a\r\n m=max(m,c)\r\nprint(m)", "stop=int(input())\r\npassenger=max_term=0\r\nwhile(stop):\r\n (x,y)=input().split()\r\n passenger=passenger-int(x)+int(y)\r\n max_term=max(passenger,max_term)\r\n stop-=1\r\nprint(max_term)", "n = int(input())\r\ne = 0\r\nv = 0\r\n\r\nwhile (n>0):\r\n a,b = map(int, input().split())\r\n e += b\r\n e -= a\r\n v = max(e,v)\r\n n -= 1\r\nprint(v)", "n = int(input())\n\ncounts = []\ncount = 0\nfor stop in range(n):\n exit, enter = [int(x) for x in input().split()]\n count -= exit\n count += enter\n counts.append(count)\n\nprint(max(counts))", "# URL: https://codeforces.com/problemset/problem/116/A\nans, cur = 0, 0\nfor _ in range(int(input())):\n a, b = map(int, input().split())\n cur += (-1 * a) + b\n ans = max(ans, cur)\nprint(ans)\n", "stops = int(input())\r\n\r\n\r\n\r\ninTheBus = 0\r\nmaxPeople = 0\r\n\r\ni = 0\r\n\r\nwhile i < stops:\r\n leavesAndEnters = [int(a) for a in input().split()]\r\n\r\n leaves = leavesAndEnters[0]\r\n enters = leavesAndEnters[1]\r\n\r\n inTheBus = inTheBus - leaves\r\n inTheBus = inTheBus + enters\r\n\r\n if inTheBus > maxPeople:\r\n maxPeople = inTheBus\r\n\r\n i += 1\r\n\r\nprint(maxPeople)\r\n", "n=int(input())\r\ncap=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n curr=0\r\n if i!=0:\r\n curr=cap[-1]\r\n cap.append(curr+b-a)\r\nprint(max(cap))", "n=int(input())\r\nbiggestsofar=0\r\npeople=0\r\nfor i in range(n):\r\n \r\n stop=input().split(\" \")\r\n a=int(stop[0])\r\n b=int(stop[1])\r\n people=people-a+b\r\n if people>biggestsofar:\r\n biggestsofar=people\r\nprint(biggestsofar)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 10 14:20:49 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn=int(input())\r\np=0\r\nbus=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n p=p+b-a\r\n bus.append(p)\r\nprint(max(bus))", "n=int(input())\r\nmax=0\r\noccu=0\r\nfor i in range(n):\r\n s=input()\r\n t=s.split()\r\n a=int(t[0])\r\n b=int(t[1])\r\n occu+=b-a\r\n if occu>max:\r\n max=occu\r\nprint(max)", "v=b=0\r\nfor x in[0]*int(input()):b-=eval(input().replace(' ','-'));v=max(v,b)\r\nprint(v)\r\n#hi codeforces\r\n#", "def minimum_tram_capacity(stops):\r\n max_capacity = 0\r\n current_capacity = 0\r\n\r\n for stop in stops:\r\n current_capacity -= stop[0] # passengers exiting\r\n current_capacity += stop[1] # passengers entering\r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n return max_capacity\r\n\r\n# Input reading\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate the minimum capacity and output the result\r\nprint(minimum_tram_capacity(stops))\r\n", "t = int(input())\r\nx = 0\r\ncap = 0\r\nfor i in range(t):\r\n m,n = map(int,input().split())\r\n x+= n-m\r\n cap = max(cap,x)\r\nprint(cap)", "# 116A - Tram\r\n\r\nn = int(input())\r\ncurrent, maximum = 0, 0\r\nfor i in range(n):\r\n a, b = map(int, input().split(' '))\r\n current += b - a\r\n if (current > maximum):\r\n maximum = current\r\n\r\nprint(maximum)", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n a.append(ai)\r\n b.append(bi)\r\ncap = 0\r\nmax_cap = 0\r\nfor i in range(n):\r\n cap -= a[i]\r\n cap += b[i]\r\n if cap > max_cap:\r\n max_cap = cap\r\nprint(max_cap)\r\n", "n_stop = int(input())\r\na = []\r\ntotal_passengers = 0\r\nh = 0\r\n\r\nfor i in range(0,n_stop):\r\n a.append(input())\r\n\r\nfor i in range(0,n_stop):\r\n x = int(a[i].split()[0])\r\n y = int(a[i].split()[1])\r\n total_passengers -= x\r\n total_passengers += y\r\n if h<total_passengers:\r\n h = total_passengers\r\n \r\n\r\nprint(h)\r\n\r\n", "def solve(arr):\r\n mx = 0\r\n index = 0\r\n for i in arr:\r\n num_in = int(i[1]) - int(i[0])\r\n if(num_in > mx):\r\n mx = num_in\r\n index = index + 1\r\n if(index < len(arr)):\r\n arr[index][1] = int(arr[index][1]) + num_in\r\n return mx \r\n\r\nr = int(input())\r\narr = []\r\nfor i in range(r):\r\n arr.append(input().split(\" \"))\r\nprint(solve(arr))", "a = int(input())\r\ns = 0\r\nt = 0\r\nfor i in range(a):\r\n d,e = input().split()\r\n s = s - int(d) + int(e)\r\n if s > t:\r\n t = s\r\nprint(t)\r\n", "n=int(input())\r\nx, y = map(int, input().split())\r\nr=x+y\r\nmax=r\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n\r\n r=r-x+y\r\n if(r>max):\r\n max=r\r\nprint(max)", "a=int(input())\r\nanswer=0\r\ncurr=0\r\nfor i in range(a):\r\n q,w=map(int, input().split())\r\n curr=curr-q\r\n curr=curr+w\r\n answer=max(answer, curr)\r\nprint(answer)\r\n", "# from collections import Counter\r\n# def solve(s):\r\n# d = dict(Counter(s))\r\n# if d.get('A', 0) == d.get('D', 0): return \"Friendship\"\r\n# return \"Anton\" if d.get('A', 0) > d.get('D', 0) else \"Danik\"\r\n \r\nT = int(input())\r\nans = cnt = 0\r\nfor i in range(T):\r\n ls = list(map(int, input().split()))\r\n cnt += ls[1] - ls[0]\r\n ans = max(ans, cnt)\r\nprint(ans)", "n=p=0\r\nfor i in[0]*int(input()):p-=eval(input().replace(' ','-'));n=max(n,p)\r\nprint(n)\r\n", "a=int(input())\r\nl=[]\r\nj=[]\r\nfor i in range(a):\r\n c, v = map(int, input().split())\r\n j.append(c)\r\n l.append(v)\r\nll=0\r\nddd=[]\r\nfor i in range(a):\r\n dd=ll-j[i]+l[i]\r\n ddd.append(dd)\r\n ll=dd\r\nmax=ddd[0]\r\nfor i in range(len(ddd)):\r\n if(max<ddd[i]):\r\n max=ddd[i]\r\nprint(max)", "def minimum_tram_capacity(n, stops):\r\n capacity = 0\r\n passengers_inside = 0\r\n\r\n for stop in stops:\r\n passengers_inside -= stop[0] # Exiting passengers\r\n passengers_inside += stop[1] # Entering passengers\r\n capacity = max(capacity, passengers_inside)\r\n\r\n return capacity\r\n\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)", "n = int(input())\r\nm, p = 0, 0\r\nfor i in range(n):\r\n l = [int(e) for e in input().split(' ')]\r\n a, b = l[0], l[1]\r\n p -= a\r\n p += b\r\n m = max(m, p)\r\nprint(m)", "n = int(input())\r\nmx = 0\r\nc = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n c -= a \r\n c += b \r\n if c > mx:\r\n mx = c \r\nprint(mx)", "if __name__ == \"__main__\":\r\n num = int(input())\r\n minCapacity = 0\r\n capacityNow = 0\r\n netPassangers = 0\r\n for i in range(num):\r\n a, b = [int(x) for x in input().split(\" \")]\r\n netPassangers = b - a\r\n capacityNow += netPassangers\r\n if(minCapacity < capacityNow):\r\n minCapacity = capacityNow\r\n print(minCapacity)", "n=int(input())\r\ncapacity=0\r\ncurrent_pass=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n current_pass-=a\r\n current_pass+=b\r\n capacity=max(capacity,current_pass)\r\nprint(capacity)", "ans=0\r\nx=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n x=x-a\r\n ans=max(ans,x)\r\n x=x+b\r\n ans=max(ans,x)\r\nprint(ans)", "num_of_stop = int(input())\r\ni = 1\r\nnum_of_ppl = 0\r\nlist_of_ppl = []\r\nfor i in range(num_of_stop):\r\n a, b = map(int, input().split())\r\n num_of_ppl = b-a + num_of_ppl\r\n list_of_ppl.append(num_of_ppl)\r\n\r\nlist_of_ppl.sort()\r\nprint(list_of_ppl[-1])", "n = int(input())\r\nminTramCapacity,passengersInTram = 0,0\r\nfor i in range(n):\r\n ai,bi = map(int,input().split())\r\n passengersInTram -= ai\r\n passengersInTram += bi\r\n minTramCapacity = max(minTramCapacity,passengersInTram)\r\nprint(minTramCapacity)", "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 b -= x\r\n b += y\r\n a = max(a,b)\r\nprint(a)", "n=int(input())\r\na,b=0,0\r\nc=a+b\r\nfor i in range(n):\r\n ex,en=map(int,input().split())\r\n if c<b-ex+en:\r\n c=b-ex+en\r\n b=b-ex+en\r\nprint(c)", "def main():\r\n num_lines=int(input())\r\n \r\n cur_people=0\r\n max_in_train=-1\r\n \r\n for i in range(num_lines):\r\n people_leaving,people_entering=map(int,input().split())\r\n cur_people=cur_people-people_leaving+people_entering\r\n \r\n if cur_people>max_in_train:\r\n max_in_train=cur_people\r\n \r\n print(max_in_train)\r\n \r\nif __name__==\"__main__\":\r\n main()", "n = int(input())\r\nmaximum = 0\r\nnum = 0\r\nfor i in range(n):\r\n x, y = input().split()\r\n x, y = int(x), int(y)\r\n num += y - x\r\n if num > maximum:\r\n maximum = num\r\n\r\nprint(maximum)\r\n", "n = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n stops.append([a,b])\r\n#print(stops)\r\nans = 0 \r\nnum = 0 # number of people on bus\r\nfor i in range(n):\r\n num -= stops[i][0]\r\n num += stops[i][1]\r\n ans = max(ans, num)\r\nprint(ans)", "stopN = int(input())\r\npeople1 = 0\r\npeople = 0\r\nfor i in range(stopN): \r\n a,b = map (int, input().split())\r\n people += (-a + b)\r\n if people>people1:\r\n people1 = people\r\n \r\nprint (people1)\r\n \r\n", "n = int(input())\r\ntram = 0\r\ncap = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n tram = tram + (b - a)\r\n if tram > cap:\r\n cap = tram\r\nprint(cap)\r\n", "n=int(input())\r\nc=0\r\nminc=0\r\nfor i in range(n):\r\n l1=[int(x) for x in input().split()]\r\n c=c-l1[0]\r\n c+=l1[1]\r\n if c>minc:\r\n minc=c\r\nprint(minc)", "def calculate_min_capacity(n, stops):\r\n current_capacity = 0\r\n min_capacity = 0\r\n \r\n for i in range(n):\r\n exiting_passengers, entering_passengers = stops[i]\r\n current_capacity -= exiting_passengers\r\n current_capacity += entering_passengers\r\n min_capacity = max(min_capacity, current_capacity)\r\n \r\n return min_capacity\r\n\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n stops.append((ai, bi))\r\n\r\nmin_capacity = calculate_min_capacity(n, stops)\r\nprint(min_capacity)\r\n", "n=int(input())\r\ncurr=0\r\nmax=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n curr+=b-a\r\n if curr>max:\r\n max=curr\r\nprint(max)", "n=input()\r\nsumm=0\r\nans=0\r\nfor i in range(0,int(n)):\r\n x=input()\r\n a=x.split(' ')\r\n summ-=int(a[0])\r\n summ+=int(a[1])\r\n ans=max(ans,summ)\r\nprint(ans)\r\n \r\n", "n=int(input())\r\nd=0\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d=d+b-a\r\n l.append(d)\r\nprint(max(l))", "def minimum_tram_capacity(n, stops):\r\n current_passengers = 0\r\n max_capacity = 0\r\n \r\n for stop in stops:\r\n exiting, entering = stop\r\n current_passengers -= exiting\r\n current_passengers += entering\r\n max_capacity = max(max_capacity, current_passengers)\r\n \r\n return max_capacity\r\n\r\n# Read input\r\nn = int(input())\r\nstops = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the result\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)\r\n", "#!/usr/local/bin/python\n\nn = int(input())\nl = []\nfor i in range(n):\n l2 = list(map(int,input().split()))\n l.append(l2)\n\nmx = 0\ns = 0\nfor i in range(n):\n s-=l[i][0]\n s+=l[i][1]\n if s>mx:\n mx = s\nprint(mx)\n", "n=int(input())\r\ns=0\r\nm=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s-=a\r\n s+=b\r\n if m<s:\r\n m=s\r\nprint(m)", "def min_tram_capacity(n, stops):\n capacity = 0\n passengers = 0\n\n for i in range(n):\n passengers -= stops[i][0] # Exiting passengers\n passengers += stops[i][1] # Entering passengers\n capacity = max(capacity, passengers)\n\n return capacity\n\nif __name__ == \"__main__\":\n # Read input\n n = int(input())\n stops = [tuple(map(int, input().split())) for _ in range(n)]\n\n result = min_tram_capacity(n, stops)\n print(result)\n\n\t\t \t\t \t \t\t\t \t \t\t \t \t \t \t", "n=int(input())\r\ncapacity=0\r\nans=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n capacity=(capacity-a+b)\r\n if(ans<capacity):\r\n ans=capacity\r\n\r\nprint(ans)", "n = int(input())\r\n\r\ncapacity = 0\r\npassengers = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers -= a\r\n passengers += b\r\n capacity = max(capacity, passengers)\r\n\r\nprint(capacity)\r\n", "cnt=0\r\ncntlist=[0]\r\n\r\na=int(input())\r\nfor x in range(a):\r\n a,b=map(int,input().split())\r\n cnt=cnt-a\r\n cnt=cnt+b\r\n if cntlist[0]<cnt:\r\n cntlist.pop(0)\r\n cntlist.append(cnt)\r\n\r\n\r\nprint(cntlist[0])", "n = int(input())\r\np = 0\r\nmaxp = -99999999999\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n p += b\r\n p -= a\r\n if p >= maxp:\r\n maxp = p\r\nprint(maxp)", "count_stops = int(input())\r\ncurrent_capacity = 0\r\nmax_capacity = 0\r\nfor i in range(count_stops):\r\n released, visitors = map(int, input().split())\r\n current_capacity += (visitors - released)\r\n if current_capacity > max_capacity:\r\n max_capacity = current_capacity\r\nprint(max_capacity)\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n", "# your code goes here\r\nn=int(input())\r\nsum=0\r\nmaximum=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tsum=sum-a+b\r\n\tif sum>maximum:\r\n\t\tmaximum=sum\r\nprint(maximum)", "times = int(input())\r\nN_1 = 0\r\nN_2 = 0\r\nfor i in range(times):\r\n a,b = map(int,input().split())\r\n N_1 = N_1-a+b\r\n if N_2 < N_1:\r\n N_2 = N_1\r\nprint(N_2)", "n = int(input())\r\nbest = 0\r\npassengers = 0\r\nfor i in range(n):\r\n exitn, entern = list(map(int, input().split()))\r\n passengers = entern - exitn + passengers\r\n if passengers > best:\r\n best = passengers\r\nprint(best)\r\n", "t = int(input())\r\npass_in = 0\r\nmax_lim = 0\r\nfor i in range(t):\r\n a, b = map(int,input().split())\r\n pass_in = pass_in + (b - a)\r\n max_lim = max(max_lim,pass_in)\r\nprint(max_lim)\r\n", "n=int(input())\r\nx=0\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x=x-a+b\r\n if x>c:\r\n c=x\r\nprint(c)\r\n ", "n = int(input())\r\ncapacity = 0\r\nstillnow = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n stillnow -= a\r\n stillnow += b\r\n capacity = max(capacity, stillnow)\r\n\r\nprint(capacity)\r\n", "if __name__ == \"__main__\":\r\n m = int(input())\r\n u = 0\r\n z = 0\r\n\r\n for _ in range(m):\r\n a, b = map(int, input().split())\r\n u -= a\r\n u += b\r\n if u > z:\r\n z = u\r\n\r\n print(z)", "if __name__=='__main__':\r\n n = int(input())\r\n tot = 0\r\n maxt = -1\r\n for i in range(n):\r\n arr = [int(i) for i in input().split(' ')]\r\n\r\n tot+=arr[1] - arr[0]\r\n maxt = max(maxt, tot)\r\n print(maxt)", "run = int(input())\npassenger = 0\nmax_passenger = 0\nfor i in range(run):\n x, y =map(int, input().split())\n passenger = passenger + (y-x)\n if passenger > max_passenger:\n max_passenger = passenger\nprint(max_passenger)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 19 16:55:44 2023\r\n\r\n@author: 27823\r\n\"\"\"\r\n\r\nn=int(input())\r\npassengers=0\r\nhistory=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n passengers+=b-a\r\n history.append(passengers)\r\nprint(max(history)) ", "n=int(input())\r\ncp=0\r\ncurr=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n curr-=a\r\n curr+=b\r\n cp=max(cp,curr)\r\nprint(cp)\r\n", "numOfStops = int(input())\r\nstops = []\r\nres = 0\r\nmini = 0\r\n\r\nfor i in range(numOfStops):\r\n x = list(map(int, input().split(\" \")))\r\n stops.append(x)\r\n\r\nfor i in range(numOfStops):\r\n b = stops[i][1]\r\n res += b\r\n a = stops[i][0]\r\n res -= a\r\n if res > mini:\r\n mini = res\r\n\r\nprint(mini)", "n=int(input())\r\npassengers=[0]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n passengers.append(passengers[i]-a+b)\r\nprint(max(passengers))\r\n", "stops_num = int(input())\n\npeoples_nums = [0]\n\nfor _ in range(stops_num):\n a, b = map(int, input().split())\n peoples_nums.append(peoples_nums[-1] - a + b)\n\nprint(max(peoples_nums, default=0))\n", "n = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n stops.append([int(i) for i in input().split()])\r\n\r\ncap = 0\r\ninit = 0\r\nfor stop in stops:\r\n init += stop[1]\r\n init -= stop[0]\r\n cap = max(init,cap)\r\nprint(cap)", "\r\nstops = int(input())\r\n\r\ncapacity = 0\r\nmax_capacity = 0\r\n\r\nfor i in range(stops) :\r\n exits , entries = map(int , input().split())\r\n \r\n capacity -= exits\r\n capacity += entries\r\n\r\n max_capacity = max(capacity , max_capacity)\r\n\r\n\r\nprint(max_capacity)", "n = int(input())\r\npassenger = 0\r\nmin_passenger = 0\r\n\r\nfor i in range(n):\r\n a,b = map(int, input().split(\" \"))\r\n passenger = passenger - a + b\r\n if passenger > min_passenger :\r\n min_passenger = passenger\r\n\r\nprint(min_passenger)", "T=int(input())\r\ncount=0\r\nmaxi=0\r\nfor i in range(T):\r\n X=input().split()\r\n exits=int(X[0])\r\n enters=int(X[1])\r\n count+=enters\r\n count-=exits\r\n if(count>maxi):\r\n maxi=count\r\nprint(maxi)", "def min_tram_capacity(n, stops):\r\n capacity = 0\r\n current_passengers = 0\r\n\r\n for i in range(n):\r\n exiting_passengers, entering_passengers = stops[i]\r\n current_passengers -= exiting_passengers\r\n current_passengers += entering_passengers\r\n capacity = max(capacity, current_passengers)\r\n\r\n return capacity\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n stops = []\r\n\r\n for _ in range(n):\r\n exiting, entering = map(int, input().split())\r\n stops.append((exiting, entering))\r\n\r\n result = min_tram_capacity(n, stops)\r\n print(result)\r\n", "n = int(input())\r\ns = 0\r\nl = []\r\nfor i in range(n):\r\n a , b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n s = s - a + b\r\n l.append(s)\r\nprint(max(l))", "ct = 0\r\nmaxi = 0\r\ntc = int(input())\r\nfor i in range(tc):\r\n a,b = map(int,input().split())\r\n \r\n ct = ct+b-a\r\n if(ct>maxi):\r\n maxi = ct\r\n \r\nprint(maxi)", "n=int(input())\r\nresult=[]\r\nfor i in range(n):\r\n x=input()\r\n alist=[int(d) for d in x.split()]\r\n result.append((alist[1]-alist[0]))\r\nblist=[]\r\nfor i in range(len(result)+1):\r\n blist.append(sum(result[:i]))\r\nprint(max(blist))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 6 19:17:54 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn = int(input())\r\nc = 0 #车上目前人数\r\ncmax = 0 #车上最高经历的人数\r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n c += b - a\r\n if c > cmax:\r\n cmax = c\r\nprint(cmax)", "n=int(input())\r\nl=[]\r\ns=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n s+=b-a\r\n l.append(s)\r\n \r\nprint(max(l))", "n=int(input())\r\npass_flow=[]\r\nfor i in range(1,n+1):\r\n pass_flow.append(input().split())\r\nmin_cap=0\r\npassenger=0\r\nfor i in pass_flow:\r\n passenger-=int(i[0])\r\n passenger+=int(i[1])\r\n min_cap=(passenger if(passenger>min_cap)else min_cap)\r\nprint(min_cap)", "n = int(input())\r\ncurrent_capacity = 0 # Current number of passengers inside the tram\r\nmax_capacity = 0 # Maximum capacity of the tram observed so far\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n current_capacity = current_capacity - a + b # Update the current capacity\r\n max_capacity = max(max_capacity, current_capacity) # Update the maximum capacity if needed\r\n\r\nprint(max_capacity)\r\n", "n=int(input())\r\nm=0\r\ns=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s-=a\r\n s+=b\r\n m=max(m,abs(s))\r\nprint(m)", "n = int(input())\r\nmax = 0\r\ncurrent = 0\r\nfor i in range(n):\r\n exit, enter = map(int, input().split())\r\n current = current - exit + enter\r\n if current > max:\r\n max = current\r\nprint(max)", "x=int(input())\r\nsu=0\r\nte=0\r\nwhile(x>0):\r\n n,m=map(int,input().split())\r\n su=su+m-n\r\n if(su>te):\r\n te=su\r\n x=x-1\r\nprint(te)\r\n ", "n = int(input())\r\npas = 0\r\ncap = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n pas -= a\r\n pas += b\r\n cap = max(cap, pas)\r\nprint(cap)\r\n", "n=int(input())\r\nc=0\r\ntotal=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n c-=x\r\n c+=y\r\n total=max(total,c)\r\nprint(total)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n u = list(map(int, input().split(\" \")))\r\n l.append(u)\r\n\r\nv = 0\r\nd = []\r\n\r\nfor i in l:\r\n v -= i[0]\r\n v += i[1]\r\n d.append(v)\r\n \r\nprint(max(d))", "n=int(input());l=[];s=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n s+=y\r\n s-=x\r\n l.append(s)\r\nprint(max(l))\r\n \r\n ", "def minimum_tram_capacity(stops):\r\n capacity = 0\r\n passengers_inside = 0\r\n\r\n for stop in stops:\r\n passengers_inside = passengers_inside - stop[0] + stop[1]\r\n capacity = max(capacity, passengers_inside)\r\n \r\n return capacity\r\n\r\n# Read input\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the result\r\nresult = minimum_tram_capacity(stops)\r\nprint(result)\r\n", "n = int(input())\r\n\r\ncapacity = 0 # current number of passengers inside the tram\r\nmax_capacity = 0 # maximum number of passengers encountered\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n capacity -= a # subtract passengers exiting\r\n capacity += b # add passengers entering\r\n max_capacity = max(max_capacity, capacity)\r\n\r\nprint(max_capacity)\r\n", "n=int(input())\r\ns=0\r\ns1=0\r\nfor i in range (n):\r\n a,b=map(int,input().split())\r\n s=s-a+b\r\n if s>s1:\r\n s1=s\r\nprint(s1)", "n = int(input())\r\nmax_pas = 0\r\nkol_pas = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n kol_pas -= a\r\n kol_pas += b\r\n if kol_pas > max_pas:\r\n max_pas = kol_pas\r\nprint(max_pas)", "n = input()\nn = int(n)\nsum = 0\nmx = 0\nfor i in range(1,n+1):\n a,b = input().split()\n a = int(a)\n b = int(b)\n sum -= a\n sum += b\n mx = max(mx , sum)\nprint(mx)\n\t\t \t \t \t\t \t \t \t \t \t \t", "# your code goes here\r\nn=int(input())\r\nC=0\r\nc1=0\r\nfor _ in range(n):\r\n\tc2,c3 = map(int,input().split())\r\n\tc1-=c2\r\n\tc1+=c3\r\n\tC=max(C,c1)\r\nprint(C)\r\n", "# Input the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables for capacity and current passengers count\r\ncapacity = 0\r\npassengers_count = 0\r\n\r\n# Iterate through the stops\r\nfor i in range(n):\r\n # Input the number of passengers exiting and entering at the current stop\r\n a, b = map(int, input().split())\r\n \r\n # Update the current passengers count\r\n passengers_count = passengers_count - a + b\r\n \r\n # Update the maximum capacity if needed\r\n capacity = max(capacity, passengers_count)\r\n\r\n# Output the minimum possible capacity\r\nprint(capacity)\r\n", "import sys\r\n\r\nf = int(input(\"\"))\r\ns = 0\r\na = 0\r\nfor i in range(0 , f):\r\n d = [int(i) for i in sys.stdin.readline().split()]\r\n s = s - d[0] + d[1]\r\n if s > a:\r\n a = s\r\n\r\n\r\nprint(a)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split(\" \"))))\r\nnum=[0]\r\nfor i in range(1,n+1):\r\n num.append(num[i-1]-a[i-1][0]+a[i-1][1])\r\nnum.sort(reverse=True)\r\nprint(num[0])", "n = int(input())\ntotalp = 0\ncount = 0\n\nfor i in range(n):\n\ts = input().split()\n\ts1 = [int(a) for a in s]\n\tppl = s1[1] - s1[0]\n\ttotalp = totalp + ppl\n\tif totalp > count:\n\t\tcount = totalp\n\nprint(count)\n\t\n", "t = []\r\nr = 0\r\nfor i in range(int(input())):\r\n m,n = map(int,input().split())\r\n r -= m\r\n r += n\r\n if i == 0:\r\n t.append(m)\r\n t.append(r)\r\nprint(max(t))\r\n ", "n = int(input())\r\n\r\ncapacity = 0\r\ncurrent_passengers = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_passengers -= a\r\n current_passengers += b\r\n capacity = max(capacity, current_passengers)\r\n\r\nprint(capacity)\r\n", "n=int(input())\r\nmax=0\r\ncount=0\r\nfor x in range(n):\r\n a,b=map(int,input().split())\r\n count=count-a+b\r\n if count>max:\r\n max=count\r\nprint(max)", "def solve():\r\n n = int(input())\r\n tram = [0]*(n)\r\n max_ = float(\"-inf\")\r\n for i in range(n):\r\n exit,enter = list(map(int,input().split()))\r\n before = tram[i-1] if i-1 >= 0 else 0\r\n tram[i] = tram[i-1]-exit+enter\r\n max_ = max(tram[i],max_)\r\n return max_\r\n\r\nprint(solve())", "n = int(input())\r\ntotal = 0\r\nmaximum = 0\r\nfor i in range(n):\r\n value = list(map(int, input().split(' ')))\r\n total += value[1] - value[0]\r\n if total > maximum:\r\n maximum = total\r\nprint(maximum)", "n=int(input())\r\nmaks=0\r\ns=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s+=(b-a)\r\n if s>maks:\r\n maks=s\r\nprint(maks)\r\n", "# https://codeforces.com/problemset/problem/116/A\r\n\r\ncurrent = 0\r\n\r\nfor i in range(int(input())):\r\n \r\n a, b = map(int, input().split())\r\n \r\n if i == 0:\r\n max = b\r\n current = b\r\n else:\r\n current = current - a + b\r\n if current > max:\r\n max = current\r\n\r\nprint(max)", "ans=0\r\nmaxi=0\r\nfor i in range(int(input())):\r\n\ta,b=[int(i) for i in input().split()]\r\n\tans-=a\r\n\tans+=b\r\n\tmaxi=max(maxi,ans)\r\nprint(maxi)", "n=int(input())\r\nmax=0\r\nans=0\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n max=max+b-a\r\n if(max>ans):\r\n ans=max\r\nprint(ans)\r\n ", "n = int(input())\r\nl = 0\r\nm = 0\r\nfor i in range(n):\r\n a, b = map(int,input().split())\r\n l += b\r\n l -= a\r\n m = max(m, l)\r\nprint(m)\r\n", "n=int(input())\r\nq=[]\r\nfor i in range(n):\r\n q.append([int(i) for i in input().split()])\r\nans=0\r\nansi=0\r\nfor i in q:\r\n x,y=i[0],i[1]\r\n ans-=x\r\n ans+=y\r\n ansi=max(ansi,ans)\r\nprint(ansi)", "n = int(input())\r\nans = 0\r\npas = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n pas -= a\r\n pas += b\r\n if pas > ans:\r\n ans = pas\r\nprint(ans)", "n = int(input())\n\ncap = 0\nmin_cap = 0\n\nfor i in range(n):\n\ta, b = [int(j) for j in input().split()]\n\tcap -= a\n\tcap += b\n\tmin_cap = max(cap, min_cap)\n\n\nprint(min_cap)\n", "n = int(input()) \r\nc = 0 \r\nmaxc = 0 \r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n c = c - x + y\r\n maxc = max(maxc, c)\r\nprint(maxc)\r\n", "n = int(input())\r\ntram=0\r\nmax=0\r\nfor i in range(n):\r\n v_out, v_in = map(int, input().split())\r\n tram = tram - v_out + v_in\r\n if(tram > max):\r\n max = tram\r\nprint(max)", "# list(map(int,input().split()))\r\nn=0\r\nm=0\r\nfor _ in range(int(input())):\r\n i = list(map(int,input().split()))\r\n n-=i[0]\r\n n+=i[1]\r\n m=max(m,n)\r\nprint(m)\r\n\r\n\r\n", "n=int(input())\r\npeople=0\r\nsummit=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n people=people-a+b\r\n summit.append(people) \r\nprint(max(summit))", "a = int(input())\r\nres = 0\r\nans = 0\r\nfor i in range(a):\r\n a,b = map(int,input().split())\r\n res-=a \r\n res+=b \r\n if res > ans:\r\n ans = res \r\nprint(ans)", "stops=int(input())\r\nPass=0\r\nmini=0\r\nfor i in range(stops):\r\n in_out=list(map(int,input().split()))\r\n a=in_out[0]\r\n b=in_out[1]\r\n Pass+=a\r\n Pass-=b\r\n if Pass<mini:\r\n mini=Pass\r\nprint(abs(mini))", "n = int(input())\r\ntotal = 0\r\nm = 0\r\nfor i in range(n):\r\n out , en = map(int , input().split())\r\n total -= out\r\n total += en\r\n m = max(total,m)\r\n\r\nprint(m)", "n=int(input())\r\ninputArray=[]\r\ninputArrayList=[]\r\nmaxPass=[]\r\npassInside=0\r\nfor i in range(n):\r\n array_list=list(map(int,input().split()))\r\n inputArray.append(array_list)\r\nfor i in inputArray:\r\n for j in i:\r\n inputArrayList.append(j)\r\nfor i in range(1,len(inputArrayList)):\r\n if i%2==0:\r\n passInside=passInside-inputArrayList[i]\r\n maxPass.append(passInside)\r\n else:\r\n passInside=passInside+inputArrayList[i]\r\n maxPass.append(passInside)\r\nprint(max(maxPass))", "maxi=0\r\ncur=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n cur=cur-a+b\r\n if cur>maxi:\r\n maxi=cur\r\nprint(maxi)", "n = int(input())\r\nl = []\r\npt = 0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n pt -= a\r\n pt += b\r\n l.append(pt)\r\nprint(max(l))", "def minimum_tram_capacity(n, stops):\r\n current_capacity = 0\r\n min_capacity = 0\r\n\r\n for i in range(n):\r\n exiting, entering = stops[i]\r\n current_capacity += entering - exiting\r\n\r\n # Update the minimum capacity if needed\r\n min_capacity = max(min_capacity, current_capacity)\r\n\r\n return min_capacity\r\n\r\n# Read input\r\nz = int(input())\r\nstops = []\r\nfor _ in range(z):\r\n a, b = map(int, input().split())\r\n stops.append((a, b))\r\n\r\n# Calculate and print the minimum tram capacity\r\nresult = minimum_tram_capacity(z, stops)\r\nprint(result)\r\n", "from bisect import (\r\n bisect_left, bisect_right,\r\n insort_left, insort_right\r\n)\r\nfrom collections import defaultdict\r\nfrom functools import cache\r\nfrom io import BytesIO\r\nfrom itertools import accumulate, permutations, product\r\nfrom math import gcd, lcm, factorial, ceil, pi, inf, dist\r\nfrom os import fstat, read\r\nfrom random import getrandbits\r\n# from sys import set_int_max_str_digits\r\nfrom sys import stdin\r\n\r\nMOD = 998244353\r\nALPHA = 'abcdefghijklmnopqrstuvwxyz'\r\nRANDOM = getrandbits(32)\r\n#set_int_max_str_digits(10000)\r\n\r\nddict = lambda: defaultdict(lambda: 0)\r\nrandom_hash = lambda x: x ^ RANDOM\r\n\r\ninput = lambda: stdin.readline().rstrip()\r\n#input = BytesIO(read(0, fstat(0).st_size)).readline\r\ninpi = lambda: int(input())\r\ninpf = lambda: float(input())\r\ninpis = lambda: map(int, input().split())\r\ninpfs = lambda: map(float, input().split())\r\ninpli = lambda: list(inpis())\r\nsrtinpli = lambda reverse=False: sorted(inpis(), reverse=reverse)\r\ninpli2 = lambda n: [int(input()) for _ in range(n)]\r\ninplf = lambda: list(map(float, input().split()))\r\ninplf2 = lambda n: [float(input()) for _ in range(n)]\r\ninpls = lambda: input().split()\r\ninpls2 = lambda n: [input() for _ in range(n)]\r\ninpset = lambda: set(map(int, input().split()))\r\ninpset2 = lambda n: {int(input()) for _ in range(n)}\r\ninpmat = lambda n: [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\n# Main\r\n\r\nans = 0\r\ncurr = 0\r\nfor _ in range(inpi()):\r\n a, b = inpis()\r\n curr += b - a\r\n ans = max(curr, ans)\r\nprint(f\"{ans}\")", "n=int(input())\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c-=a\r\n c+=b\r\n l.append(c)\r\nprint(max(l))", "# cap_timeline = []\r\n# stops = int(input())\r\n# for stop in range(stops):\r\n# event = input()\r\n# cap_timeline.append(event.split()[0])\r\n# cap_timeline.append(event.split()[1])\r\n\r\n\r\n# psg = 0\r\n# psg_tl = []\r\n\r\n# for x in cap_timeline:\r\n# psg = psg - int(cap_timeline[0])\r\n# psg = psg + int(cap_timeline[1])\r\n# cap_timeline.pop(0)\r\n# cap_timeline.pop(0)\r\n# psg_tl.append(psg)\r\n\r\n# print(sorted(psg_tl)[::-1][0])\r\n\r\nn = int(input()) # Number of stops\r\npassenger_count = 0 # Initialize passenger count\r\nmax_capacity = 0 # Initialize maximum capacity\r\n\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n passenger_count = passenger_count - ai + bi # Update passenger count\r\n max_capacity = max(max_capacity, passenger_count) # Update maximum capacity\r\n\r\nprint(max_capacity)\r\n", "l=[]\r\nk=0\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n k=k-x+y\r\n l.append(k)\r\nprint(max(l))", "a=int(input())\r\nIN=0\r\nmax=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n IN=(IN-a)+b\r\n if IN>max:\r\n max=IN\r\nprint(max)\r\n\r\n", "n=int(input())\r\nm=0\r\nc=0\r\nfor j in range(n):\r\n a,b=map(int,input().split())\r\n c-=a\r\n c+=b\r\n m=max(m,c)\r\nprint(m)\r\n", "n = int(input())\r\ni = 0\r\ncounter = 0\r\ncapacity_counter = []\r\n\r\nwhile i < n:\r\n exit_enter = [int(x) for x in input().split()]\r\n counter += exit_enter[1] - exit_enter[0]\r\n capacity_counter.append(counter)\r\n i += 1\r\n\r\nprint(max(capacity_counter))\r\n", "\r\nn = int(input())\r\n\r\ncapasity_list = []\r\nfor i in range(n):\r\n ext, entr = list(map(int, input().split()))\r\n capasity_list.append([ext,entr])\r\n \r\ntotal_capasity = 0\r\nmax_capasity = []\r\nfor j in capasity_list:\r\n total_capasity -= j[0]\r\n total_capasity += j[1]\r\n max_capasity.append(total_capasity)\r\n \r\nprint(max(max_capasity))", "a=p=0\nfor x in[0]*int(input()):p-=eval(input().replace(' ','-'));a=max(a,p)\nprint(a)\n\n", "n = int(input())\ntotalCap = 0\ncurrentCap = 0\nCaps = []\nwhile n:\n a,b = input().split()\n a,b = int(a),int(b)\n currentCap += (b-a)\n Caps.append(currentCap)\n n-=1\n\nprint(max(Caps))\n", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_str(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef fast_print(*args, **kwargs):\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\nn = get_int()\r\ncur = 0\r\nmx = 0\r\nfor _ in range(n):\r\n ext , enter = get_ints()\r\n cur -= ext \r\n cur += enter\r\n mx = max(mx, cur)\r\nfast_print(mx)", "n = int(input())\r\ntemp = 0\r\nf =0\r\n\r\nfor i in range(1, n+1):\r\n a,b = map(int,input().split())\r\n temp = temp - a+b\r\n if i==1:\r\n f= temp\r\n if f<= temp:\r\n f =temp\r\nprint(f)", "def main():\r\n n=int(input())\r\n t=0\r\n m=0\r\n for i in range(n):\r\n line=input()\r\n line=line.split()\r\n l=int(line[0])\r\n e=int(line[1])\r\n t-=l\r\n t+=e\r\n if t>m:\r\n m=t\r\n print(m)\r\nmain()", "N = int(input())\r\nPassenger = 0\r\nCapacity = 0\r\nfor _ in range(N):\r\n A,B = map(int, input().split())\r\n Passenger -= A\r\n Passenger += B\r\n Capacity = max(Capacity, Passenger)\r\nprint(Capacity)", "n,b,cap = int(input()),0,0\r\ncap=0\r\nif n>=2:\r\n for i in range(n):\r\n s=list(map(int,input().split()))\r\n b-=s[0]\r\n b+=s[1]\r\n if b>cap:\r\n cap=b\r\n print(cap)\r\n", "# Read the number of stops\r\nn = int(input())\r\n\r\ncurrent_passengers = 0\r\nmin_capacity = 0\r\n\r\nfor _ in range(n):\r\n exiting, entering = map(int, input().split())\r\n \r\n current_passengers -= exiting\r\n current_passengers += entering\r\n \r\n min_capacity = max(min_capacity, current_passengers)\r\n\r\nprint(min_capacity)\r\n", "n = int(input())\r\ncapacity = 0\r\nmax = capacity\r\nfor i in range (n):\r\n x,y = [int(i) for i in input().split()]\r\n capacity -= x\r\n capacity += y\r\n if capacity > max:\r\n max = capacity\r\nprint(max)\r\n", "n=int(input())\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c=c-a+b\r\n l.append(c)\r\nk=max(l)\r\nprint(k)\r\n ", "x=int(input())\r\nc=[]\r\ncap=0\r\nfor i in range(x):\r\n a,b=map(int,input().split(\" \"))\r\n cap+=b-a\r\n c.append(cap)\r\n\r\nprint(max(c))\r\n ", "n = int(input())\r\ns = 0\r\nans = 0\r\nwhile n:\r\n a1, a2 = map(int, input().split())\r\n s += a2 - a1\r\n n -= 1\r\n ans = max(ans, s)\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nhighest_pass=0\r\nnow_pass=0\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n if i==0:\r\n now_pass+=b\r\n highest_pass=now_pass\r\n else:\r\n now_pass-=a\r\n now_pass+=b\r\n if highest_pass<now_pass:\r\n highest_pass=now_pass\r\nprint(highest_pass)\r\n\r\n \r\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, 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'''\nt=int(input())\nenter=0\nli=[]\nfor i in range(t):\n a,b=map(int,input().split())\n enter+=b\n enter-=a\n li.append(enter)\nprint(max(li)) \n \n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmaxx=l[1]\r\nnum=l[1]\r\ni=1\r\nwhile i<n :\r\n a,b=map(int,input().split())\r\n# li=[a,b]\r\n l.append(a)\r\n l.append(b)\r\n num+=b-a\r\n if num>maxx :\r\n maxx=num\r\n i+=1\r\n\r\nprint(maxx)", "x = int(input())\r\nj = 0\r\nk = 0\r\np = []\r\nfor i in range(x):\r\n\tz,y = map(int , input().split())\r\n\tj += z\r\n\tk += y\r\n\tp.append(k - j)\r\n\r\n\r\nprint (max(p))", "l=[]\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c=b-a\r\n l.append(c)\r\nfor i in range(1,n-1,1):\r\n l[i]=l[i-1]+l[i]\r\nprint(max(l)) ", "s = int(input())\r\npas = 0\r\nmaxl = 0\r\nfor k in range(0, s):\r\n i = list(map(int,input().split()))\r\n pas = pas + i[1] - i[0]\r\n maxl = max(maxl,pas)\r\nprint(maxl)", "s=0\r\nli=[]\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n s=s-a+b\r\n li.append(s)\r\nprint(max(li))", "x = int(input())\r\nl = []\r\nm = []\r\nn = []\r\nfor _ in range(x):\r\n y,z = list(map(int, input().split()))\r\n l.append(y)\r\n m.append(z)\r\nfor i in range(len(l) - 1):\r\n if i == 0 :\r\n n.append(l[0] + m[0])\r\n else:\r\n n.append(n[i-1] - l[i] + m[i] )\r\nn.sort()\r\nprint(n[-1])", "stops=int(input())\r\nstops_cpy=stops*2\r\ntram=[]\r\nstations=[]\r\nwhile True:\r\n if stops==0:\r\n break\r\n lista=input()\r\n lista=list(map(int,lista.split(\" \")))\r\n tram+=lista\r\n stops-=1\r\nsum=0\r\nfor x in range(0,(stops_cpy-2),2):\r\n sum=sum-tram[x]+tram[x+1]\r\n stations.append(sum)\r\n\r\nprint(max(stations))", "import math\nt = int(input(\"\"))\ncounter = 1\nf1 = 0\nf2 = 0\ntotal = 0\nmax = 0\nwhile(counter <= t):\n a, b = map(int, input(\"\").split())\n total -= a\n total += b\n if(total >= max):\n max = total\n counter+=1\nprint(max)\n\n", "a=int(input())\r\nmax=0\r\npas=0\r\nfor i in range(a):\r\n x,e = map(int,input().split())\r\n pas-=x\r\n pas+=e\r\n if pas>max:\r\n max=pas\r\nprint(max)", "n = int(input())\r\ntotal = 0\r\nmax = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n total -= a\r\n total += b\r\n if total > max:\r\n max = total\r\n\r\nprint(max)", "stop_num=int(input())\r\npeople_num=0\r\nlist_people=[0]\r\nfor i in range(stop_num):\r\n a,b=[int(x) for x in input().split()]\r\n people_num+=b-a\r\n list_people.append(people_num)\r\nlist_people.sort()\r\nprint(list_people[-1])\r\n", "n = int(input())\r\nexist = 0\r\nexist_list = list()\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n exist += b - a\r\n exist_list.append(exist)\r\n\r\nprint(max(exist_list))", "c = 0\r\narr = []\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n c -= a\r\n c += b\r\n arr.append(c)\r\nprint(max(arr))", "n = int(input())\r\np = 0\r\ncap = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n p += b - a\r\n\r\n cap = max(cap, p)\r\n\r\nprint(cap)", "n = int(input())\r\nentry = []\r\nexit = []\r\nfor i in range (0, n):\r\n a, b = map(int,input().split())\r\n entry.append(b)\r\n exit.append(a)\r\n\r\nmaxi = 0\r\ntotal = 0\r\nfor i in range(n):\r\n total = total + entry[i]-exit[i]\r\n maxi = max(maxi,total)\r\n\r\nprint(maxi)", "\"\"\"\r\ninputString = input()\r\ninputString = inputString.replace(\" \", \"\")\r\ninputString = inputString.replace(\"\\n\", \"\")\r\n\r\n\r\nn = int(inputString[0])\r\na = []\r\nb = []\r\n\r\nfor i in range(1,len(inputString),2):\r\n a.append(int(inputString[i]))\r\n b.append(int(inputString[i+1]))\r\n \r\nmaxim = 0\r\nsuma = 0\r\n\r\n\r\n\r\nfor i in range(n):\r\n suma = suma - a[i]\r\n suma = suma + b[i]\r\n if maxim < suma:\r\n maxim = suma\r\n \r\nprint(maxim)\r\n\"\"\"\r\n\r\n\"\"\"\r\nn = int(input())\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n \r\nmaxim = 0\r\nsuma = 0\r\n\r\n\r\n\r\nfor i in range(n):\r\n suma = suma - a[i]\r\n suma = suma + b[i]\r\n if maxim < suma:\r\n maxim = suma\r\n \r\nprint(maxim)\r\n\"\"\"\r\n\r\nn=int(input())\r\nsum=0\r\np=0\r\nfor i in range(n):\r\n c_list=input().split()\r\n a=c_list[0]\r\n b=c_list[1]\r\n sum=sum-int(a)+int(b)\r\n if sum>p:\r\n\t p=sum\r\n else:\r\n\t p=p\r\nprint(int(p))\r\n\r\n\r\n\r\n\r\n", "round = int(input())\r\neff = []\r\nstart = 0\r\nwhile round > 0:\r\n x,y = input().split(' ')\r\n x = int(x)\r\n y = int(y)\r\n start = start - x+y\r\n eff.append(start)\r\n round -= 1\r\nprint(max(eff))", "# 李城岳 生命科学学院 2300012106\r\ncapacity = []\r\npassenger = 0\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n passenger -= x\r\n passenger += y\r\n capacity.append(passenger)\r\nprint(max(capacity))\r\n", "n = int(input())\nsum = 0\nmx = 0\nfor i in range(0 , n):\n a, b = input().split()\n a = int(a)\n b = int(b)\n sum = sum - a\n sum = sum + b\n mx = max(mx , sum)\nprint(mx)\n\t \t \t \t\t \t \t \t \t\t \t\t \t \t \t \t\t", "test=int(input())\r\ncount1=0\r\ncount2=0\r\nwhile test>0:\r\n a,b=map(int, input().split())\r\n count1-=a\r\n count1+=b\r\n if count1>count2:\r\n count2=count1\r\n test-=1 \r\nprint(count2)\r\n", "n = int(input(\"\"))\r\nvalues = [input(\"\").split(' ') for i in range(n)]\r\nmax_value, value = 0, 0\r\n\r\nfor i in values:\r\n\tvalue += (int(i[0]) * -1) + int(i[1]) \r\n\tif value > max_value: max_value = value\r\n\r\nprint(max_value)# 1689428312.1768765", "n = int(input()) # Number of stops\r\nmax_capacity = 0 # Initialize the maximum capacity\r\ncurrent_passengers = 0 # Initialize current passenger count\r\n\r\nfor _ in range(n):\r\n exit_passengers, enter_passengers = map(int, input().split())\r\n current_passengers -= exit_passengers # Passengers exit the tram\r\n current_passengers += enter_passengers # Passengers enter the tram\r\n max_capacity = max(max_capacity, current_passengers) # Update max capacity\r\n\r\nprint(max_capacity)\r\n", "maxpasen=[]\r\nonline=0\r\nfor i in range(int(input())):\r\n exit,enter=list(map(int,input().split()))\r\n online-=exit\r\n online+=enter\r\n maxpasen.append(online)\r\nprint(max(maxpasen)) ", "n=int(input())\r\nx=0\r\nc=0\r\nwhile n!=0:\r\n a,b=map(int,input().split())\r\n x=x-a\r\n x=x+b\r\n if c<x:\r\n c=x\r\n n=n-1\r\nprint(c)", "def tram():\r\n n = int(input())\r\n capacities = []\r\n capacity = 0\r\n for i in range(n):\r\n a,b = map(int, input().split())\r\n capacity = capacity - a + b\r\n capacities.append(capacity)\r\n print(max(capacities))\r\ntram()", "a = int(input())\r\narr = []\r\nans = 0\r\nfor i in range(a):\r\n (x, y) = map(int, input().split(\" \"))\r\n ans += y - x\r\n arr.append(ans)\r\nprint(max(arr))\r\n", "\r\nstops=int(input())\r\n\r\n\r\nmax_capacity=[]\r\nfor i in range(stops):\r\n x,y=map(int , input().split())\r\n if len(max_capacity)==0:\r\n\r\n diff=(y-x) \r\n max_capacity+=[diff,]\r\n else:\r\n diff=y-x+ max_capacity[len(max_capacity)-1]\r\n max_capacity+=[diff,]\r\n\r\n\r\nprint(max(max_capacity))", "n = int(input())\r\na = [0]*n\r\nb = [0]*n\r\nfor i in range(n):\r\n a[i], b[i] = (int(j) for j in input().split())\r\ncap = 0\r\nnum = 0\r\nfor i in range(n):\r\n num -= a[i]\r\n num += b[i]\r\n if num > cap:\r\n cap = num\r\nprint(cap)", "a = []\r\nfor _ in range(int(input())):\r\n\ta.append([int(i) for i in input().split()])\r\nc, cap = 0, 0\r\nfor i in range(len(a)):\r\n\tcap -= a[i][0]\r\n\tcap += a[i][1]\r\n\tc = max(c, cap)\r\nprint(c)", "n = int(input())\r\nma = 0\r\nkol = 0\r\nfor i in range(n):\r\n a, b = map(int, input(). split())\r\n kol += b\r\n kol -= a\r\n if kol > ma:\r\n ma = kol\r\nprint(ma)", "wyniki = []\r\nn = int(input())\r\nans = 0\r\n\r\nfor i in range(n):\r\n a,b = input().split()\r\n ans = ans - int(a) + int(b)\r\n wyniki.append(ans)\r\n\r\n\r\n\r\nprint(max(wyniki))", "n=int(input())\r\ntram=0\r\nc=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n tram=tram-a\r\n tram=tram+b\r\n c.append(tram)\r\nprint(max(c))", "s=0\r\nx=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split(' '))\r\n x=x+(b-a)\r\n if s<x:\r\n s=x\r\nprint(s)\r\n \r\n", "def calculate_minimum_capacity(n, stops):\r\n max_capacity = 0\r\n current_passengers = 0\r\n \r\n for i in range(n):\r\n a, b = stops[i]\r\n current_passengers -= a \r\n current_passengers += b \r\n max_capacity = max(max_capacity, current_passengers)\r\n \r\n return max_capacity\r\n\r\n\r\nn = int(input())\r\nstops = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\nresult = calculate_minimum_capacity(n, stops)\r\nprint(result)\r\n", "n=int(input())\r\nz=[]\r\ncount=0\r\nfor i in range(n):\r\n x,y=list(map(int,input().split()))\r\n count+=y\r\n count-=x\r\n z.append(count)\r\nprint(max(z))", "n=int(input())\r\nsum=0\r\nmax=0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n sum-=a\r\n sum+=b\r\n if(sum>max):\r\n max=sum\r\nprint(max)", "n = int(input())\na = 0\nb = 0\nfor i in range(n):\n A,B = map(int,input().split())\n b -= A \n b += B \n a = max(a,b)\nprint(a)", "n = int(input())\r\n\r\nmax_passengers = 0\r\npassengers = 0\r\n\r\nfor _ in range(n):\r\n (leave, enter) = map(int, input().split())\r\n\r\n passengers = passengers - leave + enter\r\n max_passengers = max(max_passengers, passengers)\r\n\r\nprint(max_passengers)", "b=int(input())\r\nj=0\r\nk=0\r\nfor i in range(b):\r\n a,c=map(int,input().split())\r\n k-=a\r\n k+=c\r\n j=max(j,k)\r\nprint(j)", "n = int(input())\r\nli=[]\r\nstops=[[0 for x in range(2)]for y in range(n)]\r\n\r\nrows=0\r\nfor i in range(n):\r\n columns=0\r\n for word in input().split(' '):\r\n stops[rows][columns] = int(word)\r\n columns+=1\r\n rows+=1\r\n\r\npassengers_in_tram=0\r\nfor stop in stops:\r\n passengers_in_tram-=stop[0]\r\n passengers_in_tram+=stop[1]\r\n li.append(passengers_in_tram)\r\n\r\nprint(max(li))", "a=int(input())\r\nmaxp=0\r\ninp=0\r\nout=0\r\ntot=0\r\nfor i in range(a):\r\n x=input()\r\n lst=list(x.split(\" \"))\r\n out=int(lst[0])\r\n inp=int(lst[1])\r\n tot=tot+inp-out\r\n if maxp<tot:\r\n maxp=tot\r\nprint(maxp)", "a = int(input(\"\"))\r\nb = 0\r\nd = 0\r\nfor i in range(0, a):\r\n c = input(\"\").split()\r\n d -= int(c[0])\r\n d += int(c[1])\r\n if d > b:\r\n b = d\r\nprint(b)\r\n", "a = int(input())\r\npassengers = []\r\nn = 0\r\nfor i in range(a):\r\n\ttemp = list(map(int,input().split()))\r\n\tn -= temp[0]\r\n\tn += temp[1]\r\n\tpassengers.append(n)\r\nprint(max(passengers)) \r\n\r\n", "l=int(input())\r\nx,la=0,0\r\nfor i in range(l):\r\n a,b=map(int,input().split())\r\n x-=a\r\n x+=b\r\n if(x>la):\r\n la=x\r\nprint(la)\r\n ", "n = int(input())\r\npassenger_capacity = 0 # Current passenger count on the tram\r\nmin_capacity = 0 # Minimum capacity needed\r\n\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n passenger_capacity -= ai # Passengers exit\r\n passenger_capacity += bi # Passengers enter\r\n min_capacity = max(min_capacity, passenger_capacity) # Update minimum capacity\r\n\r\nprint(min_capacity)\r\n", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n row = input()\r\n row = [int(x) for x in row.split()]\r\n matrix.append(row)\r\nk =0\r\nmax = matrix[0][1]\r\nfor i in range(n):\r\n for j in range(2):\r\n if j==0:\r\n k =k-matrix[i][j]\r\n else:\r\n k = k+matrix[i][j]\r\n if k >= max:\r\n max = k\r\nprint(max)", "n = int(input())\r\nmax = 0\r\na = []\r\nb = []\r\ncount = 0\r\nfor i in range(n):\r\n ins = input().split()\r\n ai = int(ins[0])\r\n bi = int(ins[1])\r\n a.append(ai)\r\n b.append(bi)\r\nfor i in range(n):\r\n count = count - a[i] + b[i]\r\n if count > max:\r\n max = count\r\nprint(max)", "a=int(input())\r\nf=0\r\ng=[]\r\nfor i in range(a):\r\n b=str(input())\r\n c=b.split()\r\n d=c[0]\r\n e=c[1]\r\n f=f-int(d)+int(e)\r\n g.append(f)\r\ng.sort()\r\nh=g[len(g)-1]\r\nprint(h)\r\n", "\r\n\r\nn = int(input())\r\n\r\nmin_cap = 0\r\ncurr_cap = 0\r\nfor i in range(n):\r\n lst = [_ for _ in input().strip().split()]\r\n a = int(lst[0])\r\n b = int(lst[1])\r\n curr_cap = curr_cap - a + b\r\n if min_cap < curr_cap:\r\n min_cap= curr_cap\r\nprint(min_cap)\r\n", "test_c = int(input())\r\nexit = []\r\nenter = []\r\nfor i in range(test_c):\r\n ex, en = tuple(map(int, input().split()))\r\n exit.append(ex)\r\n enter.append(en)\r\nt = []\r\nt.append(exit[0] + enter[0])\r\nfor i in range(test_c - 1):\r\n t.append(t[i] - exit[i + 1] + enter[i + 1])\r\nprint(max(t))", "n = int(input())\r\npeople = 0\r\nmaxP = 0\r\nfor i in range(n):\r\n string = input().split()\r\n leave = int(string[0])\r\n enter = int(string[1])\r\n people = people - leave + enter\r\n maxP = max(maxP, people)\r\nprint(maxP)", "n = int(input())\r\nchange = []\r\ncapacity = 0\r\nmin = 0\r\nfor i in range(n):\r\n change.append(list(map(int, input().split())))\r\n capacity -= change[i][0]\r\n capacity += change[i][1]\r\n if min < capacity:\r\n min = capacity\r\nprint(min)\r\n", "n = int(input())\r\ncap = 0\r\ncapMax = 0\r\nL = []\r\nfor i in range(n):\r\n L = input().split(\" \")\r\n cap = cap + int(L[1])- int(L[0])\r\n if cap > capMax :\r\n capMax = cap\r\nprint(capMax)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 29 08:17:12 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\npassenger=[]\r\nnumber=int(input())\r\nfor i in range(number):\r\n data=input().split()\r\n leave=int(data[0])\r\n enter=int(data[1])\r\n if i ==0:\r\n passenger.append(enter)\r\n else:\r\n passenger.append(passenger[i-1]-leave+enter)\r\npassenger.sort(reverse=True)\r\nprint(passenger[0])", "n=int(input())\r\nt=0\r\nfor i in range(n):\r\n a=input().split(\" \")\r\n o,g=int(a[0]),int(a[1])\r\n t+=g-o\r\n if i==0:\r\n mx=t\r\n if mx<t:\r\n mx=t\r\nprint(mx)", "def min_c(n,a,b):\n c_p = 0 \n m_p = 0 \n for i in range(n): \n c_p -= a[i]\n c_p += b[i] \n m_p = max(m_p,c_p)\n return m_p \nn = int(input())\na = []\nb = []\nfor i in range(n):\n a1,b1 = map(int,input().split())\n a.append(a1)\n b.append(b1)\nmin_cap = min_c(n,a,b)\nprint(min_cap)", "n = int(input())\r\nintrain = 0\r\nmaxintrain = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n intrain = intrain + b - a\r\n maxintrain.append(intrain)\r\n\r\nprint(max(maxintrain))", "n = int(input())\r\nmaximum_passengers = 0\r\ncurrent_passengers = 0\r\nfor i in range(n):\r\n passengers_exiting, passengers_entering = map(int, input().split())\r\n current_passengers = abs(current_passengers - passengers_exiting)\r\n current_passengers = abs(current_passengers + passengers_entering)\r\n if current_passengers > maximum_passengers:\r\n maximum_passengers = current_passengers\r\nprint(maximum_passengers)", "# 0 3 | 3 \r\n# 2 5 | 6\r\n# 4 2 | 4\r\n# 4 0 | 0\r\n\r\nn = int(input())\r\nl2 = []\r\nc = 0\r\n\r\nfor i in range(n):\r\n # a output // b input\r\n l1 = list(map(int,input().split()))\r\n \r\n #c = l1[1] - l1[0] #3 \r\n c += l1[1] - l1[0]\r\n l2.append(c)\r\n \r\n\r\nres = l2[0]\r\n\r\n\r\nfor j in range(len(l2)):\r\n if l2[j] > res:\r\n res = l2[j]\r\n \r\nprint(res)", "n = int(input())\r\ncapacity = 0 \r\npassengers_inside = 0 \r\nfor i in range(n):\r\n exiting, entering = map(int, input().split())\r\n passengers_inside -= exiting \r\n passengers_inside += entering \r\n capacity = max(capacity, passengers_inside)\r\nprint(capacity)\r\n", "n = int(input())\r\nalist = []\r\nblist = []\r\ntlist = []\r\n\r\nfor i in range(n):\r\n (a, b) = input().split()\r\n alist.append(int(a))\r\n blist.append(int(b))\r\nx = 0\r\n\r\nwhile x <= n:\r\n t = 0\r\n p = int(0)\r\n while t in range(x):\r\n p = p - alist[t] + blist[t]\r\n t = t + 1\r\n p = tlist.append(p)\r\n x = x + 1\r\nm = max(tlist)\r\nprint(m)\r\n", "max = 0\r\ncapacity = 0\r\nnum_inpots = int(input())\r\n\r\nwhile num_inpots > 0:\r\n x,y = map(int,input().split())\r\n capacity += y\r\n capacity -= x\r\n if(capacity > max):\r\n max = capacity\r\n num_inpots -= 1\r\n\r\nprint(max)", "out,in_ = [],[]\r\ntram, max = 0,0\r\nfor i in range(int(input())):\r\n o,i = map(int,input().split())\r\n out.append(o)\r\n in_.append(i)\r\n tram += i-o\r\n if tram > max: \r\n max = tram\r\nprint(max)\r\n \r\n \r\n \r\n", "d=0\r\nc=0\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n c=(c-a)+b\r\n if c>d:\r\n d=c\r\nprint(d)\r\n", "n = int(input())\r\ni = 1\r\nd = 0\r\nd_list = []\r\n\r\nwhile i<=n:\r\n a, b = map(int, input().split())\r\n d = d - a + b\r\n d_list.append(d)\r\n i+=1\r\n\r\nd = max(d_list)\r\nprint(d)", "a = int(input())\r\ncapacity = 0 \r\nmax_capacity = 0 \r\nfor i in range(a):\r\n a, b = map(int, input().split())\r\n capacity -= a \r\n capacity += b \r\n max_capacity = max(max_capacity, capacity)\r\nprint(max_capacity)", "n = int(input())\r\ncapacity = 0 # Initialize the capacity to 0\r\npassengers_inside = 0 # Initialize the number of passengers inside the tram to 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers_inside -= a # Passengers exiting\r\n passengers_inside += b # Passengers entering\r\n capacity = max(capacity, passengers_inside) # Update capacity if needed\r\n\r\nprint(capacity)\r\n", "n=int(input())\r\nc=[input().split() for x in range(n)]\r\ntong=0\r\ntongu=0\r\nfor x in range(n):\r\n tongu=tongu-int(c[x][0])+int(c[x][1])\r\n tong=max(tong,tongu)\r\nprint(tong)", "temp1 = []\r\nfor _ in range(int(input())):\r\n temp1 += input().split()\r\n\r\n\r\n\r\ntemp2 = []\r\nrez = 0\r\nfor i in range(len(temp1)):\r\n if i % 2 == 0:\r\n rez -= int(temp1[i])\r\n else:\r\n rez += int(temp1[i])\r\n temp2 += [rez]\r\n\r\n\r\nprint(max(temp2))\r\n", "n=int(input())\r\nlst=[]\r\nfinal=[]\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n lst.append(m)\r\nfor x in lst:\r\n for y in x:\r\n final.append(y)\r\nout=[]\r\ncnt=0\r\nfor i in range(len(final)):\r\n if i%2==0:\r\n cnt-=final[i]\r\n out.append(cnt)\r\n else:\r\n cnt+=final[i]\r\n out.append(cnt)\r\nprint(max(out))", "n = int(input())\r\np, c, m = 0, 0, 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n p -= a\r\n p += b\r\n m = max(m, p)\r\nprint(m)\r\n", "n = int(input())\ntram_cap = 0\ntram_cap_max = 0\nfor i in range(n):\n _out, _in = map(int, input().split())\n tram_cap += _in\n tram_cap -= _out\n tram_cap_max = max(tram_cap_max, tram_cap)\nprint(tram_cap_max)\n \n", "t = int(input())\r\nb = 0\r\nc = 0\r\nfor i in range(t):\r\n x, y = map(int, input().split())\r\n b -= x\r\n b += y\r\n c = max(c,b)\r\nprint(c)\r\n", "n=int(input())\r\nt=0\r\nm=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n t -= a\r\n t += b\r\n if t>m:\r\n m=t\r\n else:\r\n continue\r\nprint(m)\r\n", "n=int(input())\r\nmax=0\r\np=0\r\nfor i in range(n):\r\n ex,en=map(int,input().split())\r\n if i==0:\r\n p=en\r\n else:\r\n p=p-ex+en\r\n if max<p:\r\n max=p\r\nprint(max)", "n = int(input())\r\ncapacity = []\r\nonboard = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n onboard += b\r\n onboard -= a\r\n capacity.append(onboard)\r\n\r\nprint(max(capacity))\r\n", "n=int(input())\r\ncurr_cap=0\r\nmin_cap=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n curr_cap-=a\r\n curr_cap+=b\r\n min_cap=max(curr_cap,min_cap)\r\nprint(min_cap)", "n = int(input())\r\nx = 0\r\na = [0]\r\nfor i in range(n):\r\n ai,bi = map(int,input().split())\r\n x = x+bi-ai\r\n if x > a[-1]:\r\n a.append(x)\r\n else:\r\n continue\r\nprint(a[-1])\r\n", "n=int(input())\r\nm=0\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n m=m-a+b\r\n l.append(m)\r\nprint(max(l))\r\n ", "num = int(input())\r\npassengers = list()\r\nfor i in range(num):\r\n passengers.append(input().strip().split())\r\n\r\nmin_cap = 0\r\nnum_pass = 0\r\nfor stop in passengers:\r\n num_pass -= int(stop[0])\r\n num_pass += int(stop[1])\r\n if min_cap < num_pass: min_cap = num_pass\r\n\r\nprint(min_cap)", "n = int(input())\r\nab = 0\r\nnb = 0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n ab= ab - a + b\r\n if ab > nb:\r\n nb = ab\r\nprint(nb)", "n = int(input())\r\nmin_persons = 0\r\nperson_in_before = 0\r\nfor i in range(n):\r\n a, b = map(int,input().split(\" \"))\r\n perons_in = b - a\r\n person_in_before += perons_in\r\n if person_in_before > min_persons :\r\n min_persons = person_in_before\r\nprint(min_persons)", "t = int(input())\r\na = 0\r\nb = 0\r\nfor _ in range(t):\r\n x, y = map(int, input().split())\r\n a += y-x\r\n b = max(b,a) \r\nprint(b)\r\n", "n = int(input())\r\ns = 0\r\nMAX = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n s -= a \r\n s += b \r\n if s > MAX:\r\n MAX = s \r\nprint(MAX)", "n = int(input())\r\nx = 0\r\nmaxV = 0\r\nfor i in range(n):\r\n ab = list(map(int, input().split(\" \")))\r\n res = (x + ab[1]) - ab[0]\r\n x = res\r\n if maxV < res:\r\n maxV = res\r\nprint(maxV)", "a=int(input())\r\nb=0\r\nf=0\r\nwhile a:\r\n\tx,y=map(int,input().split())\r\n\tf=f+y-x\r\n\tif f>b:\r\n\t\tb=f\r\n\ta=a-1\r\nprint(b)", "n=int(input())\r\nmax=0\r\nsum=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n sum=sum-a+b\r\n if sum>max:\r\n max=sum\r\nprint(max)\r\n", "n = int(input()) \r\n#paradas = []\r\ntranvia = 0\r\nmax_tranvia = 0\r\nfor i in range(n):\r\n a,b = tuple(int(x) for x in input().split())\r\n tranvia -= a \r\n tranvia += b\r\n max_tranvia = max(tranvia, max_tranvia)\r\n #print(tranvia)\r\n #paradas.append((a,b))\r\n#print(paradas)\r\nprint(max_tranvia)", "t=int(input())\r\n\r\na,b=map(int,input().split())\r\nm=b\r\nl=[b]\r\nfor i in range(t-1):\r\n x,y=map(int,input().split())\r\n m=m-x+y\r\n l.append(m)\r\nprint(max(l))", "# Read the number of test cases\r\nnum_test_cases = int(input())\r\n\r\n\r\ntotal_in = 0\r\nmax_total_in = 0\r\n# Process each test case\r\nfor _ in range(num_test_cases):\r\n # Read the integers m and n for the current test case\r\n m, n = map(int, input().split())\r\n\r\n # Perform any operations on m and n for this test case\r\n # For this example, we'll calculate the product of m and n\r\n total_in += (n - m)\r\n\r\n max_total_in = max(max_total_in, total_in)\r\n\r\n # Append the result to the results list\r\n\r\n\r\nprint(max_total_in)\r\n", "ans=0\r\nmax=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n ans=ans-a\r\n ans=ans+b\r\n if(ans>max):\r\n max=ans\r\n # print(a,b)\r\nprint(max)", "def min_tram_capacity(stops):\r\n capacity = 0\r\n current_passengers = 0\r\n for stop in stops:\r\n exiting, entering = stop\r\n current_passengers -= exiting\r\n current_passengers += entering\r\n capacity = max(capacity, current_passengers)\r\n return capacity\r\n\r\nn = int(input())\r\nstops = [list(map(int, input().split())) for _ in range(n)]\r\nresult = min_tram_capacity(stops)\r\nprint(result)\r\n", "n= int(input())\r\np=0\r\nmax=0\r\nfor i in range(n):\r\n a,b = map(int , input().split())\r\n p=p-a+b\r\n if p>max :\r\n max=p\r\nprint(max) ", "n=int(input())\r\nm=0\r\nx=0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n m -= a\r\n m += b\r\n if m>x:\r\n x=m\r\nprint(x)\r\n\r\n\r\n", "n = int(input())\nstops = []\ncapacity = [0]\nfor i in range(n):\n line = input().split(\" \")\n stops.append((int(line[0]), int(line[1])),)\n\nfor i in range(len(stops)):\n if i > 0:\n capacity.append(capacity[i-1] - stops[i][0] + stops[i][1])\n else:\n capacity[0] = stops[i][1]\n\ncapacity.sort(reverse=True)\nprint(capacity[0])\n", "n=int(input())\r\nc=0\r\np=0\r\nwhile(n>0):\r\n a,b=map(int,input().split())\r\n c-=a\r\n c+=b\r\n if c>p:\r\n p=c\r\n n-=1\r\nprint(p)", "c=0\r\nm=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n c=(c+b)-a\r\n if c>m:\r\n m=c\r\nprint(m)", "#initializes number of stops and highest capacity at a given time\r\nstops = int(input())\r\nmaxPassengers = 0\r\npassengers = 0\r\n\r\n#adds and subtracts based on passenger flow\r\nfor stop in range(stops):\r\n passengerFlow = input().split(' ')\r\n exit = int(passengerFlow[0])\r\n enter = int(passengerFlow[1])\r\n passengers += (enter - exit)\r\n #Updates highest (minimum) capacity of the train\r\n if passengers > maxPassengers:\r\n maxPassengers = passengers\r\n\r\n#prints the minimun capaciy of the train needed\r\nprint(maxPassengers)", "x=int(input(\"\"))\r\nc=0\r\nl=[]\r\nm=[]\r\nfor i in range(x):\r\n a=input(\"\")\r\n t=a.split(\" \")\r\n l.append(t)\r\nfor j in l:\r\n c-=int(j[0])\r\n c+=int(j[1])\r\n m.append(c)\r\nprint(max(m))", "def minCap(passengerList):\n min = None\n total = 0\n for x in passengerList:\n total = total - int(x[0]) + int(x[1])\n if min == None:\n min = total\n elif total > min:\n min = total\n \n return min\n\n \n\ndef main():\n stops = int(input())\n passengerList = []\n for x in range(stops):\n passengerList.append(input().split(\" \"))\n \n print(minCap(passengerList))\n\nif __name__ == \"__main__\":\n main()", "def int_arr():\r\n return map(int, input().split())\r\n\r\ndef intp():\r\n return int(input())\r\n\r\n\r\ndef solve():\r\n a = intp()\r\n tram = 0\r\n tram_max = 0\r\n\r\n for _ in range(a):\r\n a, b = int_arr()\r\n \r\n tram -= a\r\n tram += b\r\n\r\n if tram > tram_max:\r\n tram_max = tram\r\n \r\n print(tram_max)\r\n\r\n\r\nsolve()", "a,b,s,c=[],[],[],0\r\nfor i in range(int(input())):\r\n ea,eb=map(int,input().split())\r\n a.append(ea)\r\n b.append(eb)\r\nfor i in range(len(a)):\r\n c+=b[i]-a[i]\r\n s.append(c)\r\nprint(max(s))", "n=int(input())\r\nans=nsa=0\r\nfor i in range(n):\r\n ab=list(map(int, input().split()))\r\n nsa+=ab[1]-ab[0]\r\n if nsa>ans: ans=nsa\r\n else: pass\r\nprint(ans)", "a = int(input())\ncount = 0\nmax1 = 0\nfor i in range(a):\n out,i1 = map(int,input().split())\n max1 = max1-out+i1\n if max1>count:\n count=max1\nprint(count)", "a = int(input())\r\nma = 0 \r\ncurrent = 0\r\nfor i in range(a):\r\n x , y = map(int , input().split())\r\n current = current - x + y\r\n if current > ma:\r\n ma = current\r\nprint(ma)", "import sys\r\n\r\n\r\ndef iinp():\r\n return int(sys.stdin.readline().strip())\r\n\r\n\r\ndef linp():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef lsinp():\r\n return sys.stdin.readline().strip().split()\r\n\r\n\r\ndef digit():\r\n return [int(i) for i in (list(sys.stdin.readline().strip()))]\r\n\r\n\r\ndef char():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, Counter\r\nfrom heapq import heappop, heappush\r\n\r\n\r\ndef solve():\r\n n = iinp()\r\n ans = 0\r\n s = 0\r\n for _ in range(n):\r\n a, b = linp()\r\n s -= a\r\n s += b\r\n ans = max(ans, s)\r\n print(ans)\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\nstops = [[0 for x in range(2)] for y in range(n)]\r\nrow = 0\r\n\r\nfor line in sys.stdin:\r\n column = 0\r\n for word in line.split():\r\n stops[row][column] = int(word)\r\n column += 1\r\n row += 1\r\n\r\npassengers_in_tram = 0\r\ncapacity = 0\r\n\r\nfor stop in stops:\r\n passengers_in_tram -= stop[0]\r\n passengers_in_tram += stop[1]\r\n if passengers_in_tram > capacity:\r\n capacity = passengers_in_tram\r\n\r\nprint(capacity)", "stops = int(input())\r\n\r\ni = 0\r\nstationOut = []\r\nstationIn = []\r\n\r\nwhile i < stops:\r\n spl = input().split()\r\n stationOut.append(int(spl[0]))\r\n stationIn.append(int(spl[1]))\r\n i = i + 1\r\n\r\ni = 0\r\ncarryOver = [0, ]\r\n\r\nwhile i < stops:\r\n carryOver.append(stationIn[i] - stationOut[i] + carryOver[i])\r\n i = i + 1\r\n\r\nprint(max(carryOver))\r\n", "n = int(input())\r\nstopsInfo = [0]\r\n\r\nfor i in range(n):\r\n passengers = input().split()\r\n a,b = int(passengers[0]), int(passengers[1])\r\n\r\n stopsInfo.append((stopsInfo[i]) + (b-a))\r\n\r\nprint(max(stopsInfo))", "n=int(input())\r\ncount=0\r\nmini=0\r\nfor i in range(n):\r\n x,b=map(int,input().split())\r\n count-=x\r\n count+=b\r\n if count>mini:\r\n mini=count\r\nprint(mini)", "n = int(input())\r\nstops = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n stops.append((a, b))\r\n\r\ncapacity = 0\r\npassengers = 0\r\nfor a, b in stops:\r\n passengers -= a\r\n passengers += b\r\n capacity = max(capacity, passengers)\r\n\r\nprint(capacity)", "n = int(input())\nmi = 0\ncurr = 0\nfor _ in range(n):\n\tentra, sale = list(map(int, input().split()))\n\tcurr -= entra\n\tcurr += sale\n\tif curr > mi:\n\t\tmi = curr\nprint(mi)", "# 116A - Tram\r\nif __name__ == '__main__' :\r\n cases = int(input())\r\n max = 0\r\n c = 0\r\n for x in range(cases) :\r\n lst = [int(x) for x in input().split()]\r\n a, b = lst\r\n c += b-a\r\n if c > max :\r\n max = c\r\n print(max)", "stops = int(input())\nc = 0\ntotals = []\n\nfor i in range(stops):\n a, b = map(int, input().split())\n if i == 0:\n c = a + b\n else:\n c = c - a + b\n totals.append(c)\n\nprint(max(totals))", "n = int(input())\r\ninput_array = []\r\n\r\nwhile n > 0:\r\n array_list = list(map(int, input().split()))\r\n input_array.append(array_list)\r\n n = n - 1\r\n \r\nperson_count = 0\r\nmax_num = 0\r\n\r\nfor a in input_array:\r\n person_count = person_count - a[0] + a[1]\r\n if max_num < person_count:\r\n max_num = person_count\r\n \r\nprint(max_num)", "n=int(input())\r\nc=0\r\nfc=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n c=c+y-x\r\n if c>fc:\r\n fc=c\r\nprint(fc)\r\n", "stops = int(input())\r\ns = 0\r\nc=0\r\nfor i in range(stops):\r\n l = list(int(x) for x in input().split())\r\n c -= l[0]\r\n c += l[1]\r\n s = max(s,c)\r\nprint(s)", "m=int(input())\r\nc=0\r\ns=0\r\nwhile m>0:\r\n\tm=m-1\r\n\ta,b=map(int,input().split())\r\n\ts=(s-a)+b\r\n\tif s>c:\r\n\t\tc=s\r\nprint(c)", "a=[]\r\nfor t in range(int(input())):\r\n arr=list(map(int,input().split()))\r\n if(t==0):\r\n x=arr[1]\r\n else:\r\n x=x-arr[0]+arr[1]\r\n a.append(x)\r\nprint(max(a))\r\n \r\n ", "capacity = 0\r\nmax_capacity = 0\r\n\r\nn = int(input())\r\ndata = []\r\n\r\nwhile n > 0:\r\n array_list = list(map(int, input().strip().split()))\r\n data.append(array_list)\r\n n = n - 1\r\n\r\nmax_capacity = 0\r\nperson_count = 0\r\n\r\nfor datum in data:\r\n person_count = person_count - datum[0] + datum[1]\r\n if max_capacity < person_count:\r\n max_capacity = person_count\r\n\r\nprint(max_capacity)\r\n", "n = int(input())\r\nminimum_capacity = float('-inf')\r\ncap = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n cap -= a\r\n cap += b\r\n minimum_capacity = max(minimum_capacity, cap)\r\nprint(minimum_capacity)", "def minimum_tram_capacity(n, stops):\r\n capacity = 0\r\n passengers_inside = 0\r\n\r\n for i in range(n):\r\n passengers_inside -= stops[i][0] # Exiting passengers\r\n passengers_inside += stops[i][1] # Entering passengers\r\n capacity = max(capacity, passengers_inside)\r\n\r\n return capacity\r\n\r\n# Read input\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate the minimum tram capacity\r\nresult = minimum_tram_capacity(n, stops)\r\n\r\n# Print the output\r\nprint(result)\r\n", "num = int(input())\n\nx = 0\nout = 0\nfor i in range(num):\n\tstrn = input().split()\n\ta = int(strn[0])\n\tb = int(strn[1])\n\tx -= a\n\tx += b\n\tif x > out:\n\t\tout = x\nprint(out)\n# author - Sirens", "max_seats, tmp_seats = 0, 0\r\nfor _ in range(int(input())):\r\n a, b = map(int,input().split())\r\n tmp_seats -= a\r\n tmp_seats += b\r\n if tmp_seats > max_seats:\r\n max_seats = tmp_seats\r\nprint(max_seats)", "t=int(input())\r\ncapacity=0\r\npassengers=0\r\nfor _ in range(t):\r\n a,b=map(int,input().split())\r\n passengers += b-a\r\n capacity=max(capacity,passengers)\r\nprint(capacity)", "n = int(input())\r\nsumm = 0\r\ncurr = 0\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n b -= a\r\n curr += b\r\n summ = max(summ, curr)\r\nprint(summ)", "n=int(input())\r\nm=0\r\nno_of_ppl=0\r\nwhile(n!=0):\r\n a,b=map(int,input().split())\r\n no_of_ppl=no_of_ppl-a+b\r\n if(no_of_ppl>m):\r\n m=no_of_ppl\r\n n=n-1\r\n\r\nprint(m)\r\n\r\n\r\n", "n=int(input())\r\na,b = map(int , input().split())\r\nx,y=0,0\r\nfor i in range(n-1):\r\n x=x-a\r\n x=x+b\r\n if(x>y):\r\n y=x\r\n a,b = map(int , input().split())\r\nprint(y)", "n = int(input())\r\nnumerate = []\r\ncluster_prom = 0\r\nfor i in range(n):\r\n cel = input().split()\r\n cluster_prom -= int(cel[0])\r\n cluster_prom += int(cel[1])\r\n numerate.append(cluster_prom)\r\nprint(max(numerate))", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\nmax_capacity = float(\"-inf\")\ncurrent = 0\n\nfor _ in range(n):\n a, b = map(int, input().split())\n current -= a\n current += b\n\n if current > max_capacity:\n max_capacity = current\n\nsys.stdout.write(f\"{max_capacity}\")\n", "n=int(input())\r\na=[]\r\nb=[]\r\nx=0\r\nm=0\r\nfor i in range(n):\r\n p,q= map(int, input().split())\r\n a.append(p)\r\n b.append(q)\r\n x-=a[i]\r\n x+=b[i]\r\n if m<x:\r\n m=x\r\nprint(m)", "n=int(input())\r\nma=0\r\nini=0\r\nwhile(n>0):\r\n a,b=[int(x) for x in input().split()]\r\n #exit=ini-exit\r\n #entry=ini+entry\r\n ini=ini-a+b\r\n ma=max(ini,ma)\r\n \r\n \r\n \r\n n-=1 \r\nprint(ma) \r\n ", "n = int(input())\r\npassengers, ans = 0, 0\r\nfor i in range(n):\r\n outP, inP = map(int, input().split())\r\n passengers = passengers - outP + inP\r\n ans = max(passengers, ans)\r\nprint(ans)", "n=int(input())\r\np=0\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n p=p-a+b\r\n c=max(c,p)\r\nprint(c)", "def tram():\r\n num = int(input())\r\n total = 0\r\n capacity = 0\r\n for i in range(num):\r\n a, b = map(int, input().split())\r\n total -= a\r\n total += b\r\n if total > capacity:\r\n capacity = total\r\n return capacity\r\n\r\nif __name__ == '__main__':\r\n print(tram())", "n=int(input())\r\nlist1=[]\r\ncounter=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n counter=counter-a+b\r\n list1.append(counter)\r\nprint(max(list1))", "def calculate_min_capacity(n, stops):\r\n capacity = 0 # Minimum capacity of the tram\r\n passengers = 0 # Current number of passengers inside the tram\r\n \r\n for exit_passengers, enter_passengers in stops:\r\n passengers -= exit_passengers # Passengers exiting the tram\r\n passengers += enter_passengers # Passengers entering the tram\r\n \r\n capacity = max(capacity, passengers) # Update the maximum capacity\r\n \r\n return capacity\r\n\r\n# Read input\r\nn = int(input().strip())\r\nstops = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the result\r\n\r\nresult = calculate_min_capacity(n, stops)\r\nprint(result)", "n = int(input())\r\nle = [0, 0]\r\nc = 0\r\nfor i in range(n):\r\n wy, za = map(int, input().split())\r\n c -= wy\r\n if c < min(le):\r\n le = [c, le[1]]\r\n c += za\r\n if c > max(le):\r\n le = [le[0], c]\r\nprint(le[1] - le[0])", "n=int(input())\r\ninput_array=[]\r\ni_a=[]\r\nwhile n>0:\r\n array_list=list(map(int,input().split()))\r\n input_array.append(array_list)\r\n n=n-1\r\nmax_number=0\r\nperson_count=0\r\nfor a in input_array:\r\n person_count=person_count-a[0]+a[1]\r\n if max_number<person_count:\r\n max_number=person_count\r\nprint(max_number)", "n=input()\r\nx,y=input().split()\r\np=x+y\r\nlst=[int(p)]\r\nfor i in range(int(n)-1):\r\n m,n=input().split()\r\n p=int(p)-int(m)+int(n)\r\n lst.append(int(p))\r\nmax=max(lst)\r\nprint(max)", "n=int(input())\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x+=b-a\r\n y=max(x,y)\r\nprint(y)", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncurrent_passengers = 0 # Number of passengers inside the tram\r\nmin_capacity = 0 # Minimum capacity needed\r\n\r\n# Iterate through each stop\r\nfor i in range(n):\r\n # Read exiting and entering passengers at the current stop\r\n exiting, entering = map(int, input().split())\r\n \r\n # Calculate the number of passengers inside the tram at the current stop\r\n current_passengers -= exiting # Passengers exiting\r\n current_passengers += entering # Passengers entering\r\n \r\n # Update the minimum capacity needed\r\n min_capacity = max(min_capacity, current_passengers)\r\n \r\n# Output the minimum possible capacity of the tram\r\nprint(min_capacity)\r\n", "a=int(input())\r\nc=0\r\nd=[]\r\nfor i in range(a):\r\n\ta,b=map(int,input().split())\r\n\tc+=(-a+b)\r\n\td.append(c)\r\nprint(max(d))", "nums = []\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n nums.append([a,b])\r\nmax_cap = cur_cap = nums[0][1]\r\nflag = True\r\nfor a,b in nums:\r\n if flag:\r\n flag = False\r\n continue\r\n cur_cap = cur_cap - a + b\r\n max_cap = max(max_cap, cur_cap)\r\nprint(max_cap)\r\n", "from collections import Counter\r\n\r\ndef solution(n, deets):\r\n ans = 0\r\n curr = 0\r\n\r\n for a, b in deets:\r\n delta = b - a\r\n curr += delta\r\n ans = max(ans, curr)\r\n \r\n return ans\r\n\r\ndef driver():\r\n n = int(input())\r\n deets = []\r\n\r\n for _ in range(n):\r\n deets.append(map(int, input().split()))\r\n\r\n sol = solution(n, deets)\r\n print(sol)\r\n return\r\n\r\ndriver()", "n = int(input())\nans = -1\ntotal = 0\nfor i in range(n):\n a , b = input().split()\n a = int(a)\n b = int(b)\n total -= a\n total += b\n ans = max(ans , total)\nprint(ans)\n\t \t\t\t \t \t \t\t \t\t \t \t \t\t\t", "n=int(input())\r\nTOTAL=int(input().split()[1])\r\nREMAINING=TOTAL\r\nfor _ in range(1,n): \r\n a,b= map(int,input().split())\r\n REMAINING+=b-a\r\n TOTAL=max(TOTAL,REMAINING)\r\nprint(TOTAL)\r\n", "n=int(input())\r\nc=0\r\nlis=[]\r\nwhile(n>0):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n c=c-a+b\r\n lis.append(c)\r\n n-=1\r\nprint(max(lis))\r\n ", "a1 = input()\r\nb = []\r\ncount = 0\r\ncol = 0\r\nwhile True:\r\n try:\r\n b += list(map(int,input().split()))\r\n except:\r\n break\r\n \r\ncol_max = max(b)\r\n\r\nwhile count < len(b):\r\n if count % 2 == 0:\r\n col -= b[count]\r\n else:\r\n col += b[count]\r\n if col > col_max:\r\n col_max = col\r\n count += 1\r\nprint(col_max)", "n = int(input())\r\n\r\npeople = 0\r\npeopleMax = 0\r\n\r\nfor x in range(n):\r\n exit, entry = (map(int, input().split()))\r\n people += entry\r\n people -= exit\r\n \r\n if people > peopleMax:\r\n peopleMax = people\r\n\r\n\r\n \r\n\r\nprint(peopleMax)\r\n\r\n\r\n \r\n", "n = int(input())\r\nMAX = 0\r\ncurrent = 0\r\nfor i in range(n):\r\n passout, passin = map(int, input().split())\r\n current = current+passin-passout\r\n if current>MAX:\r\n MAX = current\r\nprint(MAX)", "n = int(input())\r\n\r\ncap = 0\r\ncurr = 0\r\n\r\nfor i in range(0,n):\r\n ex, enter = map(int, input().split())\r\n curr = curr - ex\r\n curr = curr + enter\r\n \r\n if (cap<curr):\r\n cap = curr\r\n\r\nprint(cap)\r\n", "n = int(input())\r\ncap = 0\r\ncurrent = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n current -= a\r\n current += b\r\n if (current > cap):\r\n cap = current\r\nprint(cap)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 11 21:03:42 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\ns=0\r\nlist=[]\r\nn=int(input())\r\nfor i in range(n): \r\n a,b=[int(x) for x in input().split()]\r\n s=s-a+b\r\n list.append(s)\r\na=0\r\nfor k in list:\r\n if k>=a:\r\n a=k\r\n else:\r\n pass\r\nprint(a)", "n = int(input())\r\ncapacity = 0\r\nnow = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n now = now - a + b\r\n if now > capacity:\r\n capacity = now\r\nprint(capacity)\r\n", "t=int(input())\r\ns=0\r\nm=0\r\nfor _ in range(0, t):\r\n x, y=map(int, input().split())\r\n s-=x\r\n s+=y\r\n if(s>m):\r\n m=s\r\nprint(m)", "n=int(input())\r\nt=0\r\nf=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n t=(t+b)-a\r\n f=max(f,t)\r\nprint(f)", "e = 0\r\nw = 0\r\nfor _ in range(int(input())):\r\n x,i = map(int, input().split())\r\n e -= x\r\n e += i\r\n if e > w:\r\n w = e\r\nprint(w)\r\n", "a = int(input())\r\nb = 0\r\ng = 0\r\nfor i in range(a):\r\n c,d = map(int,input().split())\r\n g += d - c\r\n if g > b:\r\n b = g\r\nprint(b)", "stops=int(input())\r\nlst=[]\r\ngreater=0\r\nremainder=0\r\nfor i in range(stops):\r\n tmp=list(map(int,input().split()))\r\n lst.append(tmp)\r\n \r\nfor x in range(stops):\r\n remainder+=lst[x][1] - lst[x][0]\r\n if remainder > greater:\r\n greater=remainder\r\nprint(greater)", "n = int(input())\r\nk =0\r\nall =[]\r\nfor i in range(n):\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n if a == 0:\r\n k = k + b\r\n else:\r\n k = k+b -a\r\n all.append(k)\r\nprint(max(all))", "m=0\r\nc=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n c -= a\r\n c += b\r\n if c > m:\r\n m=c\r\nprint(m)\r\n \r\n", "m = 0\r\nno = 0\r\nn = int(input())\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n no = no-a+b\r\n if no >m:\r\n m = no\r\nprint(m)\r\n ", "inbus=0\nl1=[]\nfor i in range(int(input())):\n a,b=map(int,input().split())\n inbus=(inbus-a)+b\n l1.append(inbus)\nprint(max(l1))\n", "n = int(input())\r\ncap = 0\r\nmax = 0\r\nfor i in range(n):\r\n k,l = map(int,input().split())\r\n cap = cap - k + l\r\n if cap>max:\r\n max = cap\r\nprint(max)", "n = int(input())\r\n\r\nres = 0\r\nsum_people = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n sum_people = sum_people - x + y\r\n if sum_people > res:\r\n res = sum_people\r\n\r\nprint(res)\r\n", "n=int(input())\r\nc=0\r\narr=[]\r\nfor i in range(n):\r\n leave,entry=input().split()\r\n c -=int(leave)\r\n c+=int(entry)\r\n arr.append(c)\r\nprint(max(arr))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nmaxi=0\r\ncurr=0\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n curr = curr+(b-a)\r\n if curr>maxi:\r\n maxi = curr\r\nprint(maxi)", "n = int(input())\r\nmax = 0\r\ncount = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n count -= a\r\n count += b\r\n if count > max:\r\n max = count\r\nprint(max)", "n = int(input())\r\ntram = 0\r\ncapacity = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n tram -= a\r\n tram += b\r\n if tram > capacity:\r\n capacity = tram\r\nprint(capacity)", "n=int(input())\r\ncurr=0\r\ncap=0\r\nwhile(n):\r\n a,b=map(int,input().split())\r\n curr=curr-a\r\n curr=curr+b\r\n if(cap<curr):\r\n cap=curr\r\n n-=1\r\nprint(cap)", "n=int(input())\r\na=0\r\ntab=[]\r\nfor i in range(n):\r\n c=input()\r\n c=c.split(\" \")\r\n x,y=int(c[0]),int(c[1])\r\n a-=x\r\n a+=y\r\n tab.append(a)\r\n\r\nmax=0\r\nfor i in tab:\r\n if i > max:\r\n max=i\r\nprint(max)", "n=int(input())\r\n\r\ninput_array = []\r\ni_a = []\r\n\r\nwhile n>0:\r\n array_list = list(map(int,input().split()))\r\n input_array.append(array_list)\r\n n = n - 1\r\n\r\nmax_number = 0\r\nperson_count = 0\r\nfor a in input_array:\r\n person_count = person_count - a[0] + a[1] \r\n if max_number < person_count:\r\n max_number = person_count \r\n\r\nprint(max_number) ", "n=(int)(input())\r\nno_people=0\r\nmax_people=0\r\nwhile(n>0):\r\n a,b=input().split(' ')\r\n a=(int)(a);b=(int)(b)\r\n no_people-=a\r\n no_people+=b\r\n if(no_people>max_people):\r\n max_people=no_people\r\n n-=1\r\nprint(max_people)", "import sys\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\ndef main():\r\n count = inp()\r\n passengers = []\r\n \r\n for _ in range(count):\r\n passengers.append(inlt())\r\n \r\n max = 0\r\n curr = 0\r\n for passenger in passengers:\r\n curr += passenger[1] - passenger[0]\r\n if curr > max:\r\n max = curr\r\n \r\n out(max)\r\n \r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = []\r\nans = []\r\nchel = 0\r\nfor i in range(n):\r\n a.append(input().split())\r\nfor i in range(len(a)):\r\n chel -= int(a[i][0])\r\n chel += int(a[i][1])\r\n ans.append(chel)\r\nprint(max(ans))", "n = int(input())\r\nc= 0\r\np = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n p = p - a + b\r\n c= max(c, p)\r\nprint(c)\r\n", "def Tram(before, after):\r\n return before + after\r\n\r\nn = int(input())\r\n\r\npassenger =0\r\nmax = 0\r\nfor i in range(n):\r\n before, after = input().split()\r\n before, after = int(before), int(after)\r\n before = passenger - before\r\n \r\n passenger = Tram(before, after)\r\n# print(passenger)\r\n if passenger > max:\r\n max = passenger\r\n\r\nprint(max)\r\n\r\n \r\n ", "num = int(input())\r\nresultados = 0\r\nmaxi = -1\r\nfor each in range(num):\r\n a, b = map(int, input().split())\r\n resultados += b-a\r\n if resultados > maxi:\r\n maxi = resultados\r\nprint(maxi)\r\n", "n = int(input())\r\ncount = []\r\nx = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if i!=0:\r\n x -= a\r\n x += b\r\n count.append(x)\r\nprint(max(count))", "n = int(input())\r\nc = 0\r\nm = c\r\nfor i in range(n):\r\n a, b = [int(j) for j in input().split()]\r\n c += b-a\r\n if m < c:\r\n m = c\r\nprint(m)\r\n", "busStopCount = int(input(\"\"))\r\nmaxCapacity = 0\r\ndaroBuro = 0\r\nfor i in range(0,busStopCount):\r\n ioPeople = input(\"\").split()\r\n daroBuro = daroBuro - int(ioPeople[0]) + int(ioPeople[1])\r\n if daroBuro>maxCapacity:\r\n maxCapacity=daroBuro\r\n \r\nprint(maxCapacity)", "def tram():\r\n n=int(input())\r\n min_capacity=0\r\n capacity=0\r\n for i in range(n):\r\n a,b=map(int,input().split())\r\n capacity-=a\r\n capacity+=b\r\n min_capacity=max(min_capacity,capacity)\r\n print(min_capacity)\r\ntram() ", "n = input()\nmaximo = 0\natual = 0\n\nfor i in range(int(n)):\n saida, entrada = input().split(\" \")\n atual = atual + int(entrada) - int(saida)\n if maximo < atual:\n maximo = atual\n\nprint(maximo)\n", "stops=int(input())\r\nnum_people=0\r\nmax=0\r\nfor i in range(stops):\r\n get_off,get_on=map(int,input().split())\r\n num_people=num_people-get_off+get_on\r\n if num_people>max:\r\n max=num_people\r\nprint(max)", "n = int(input())\r\nmax_capacity = 0\r\ncurrent_capacity = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_capacity = current_capacity - a + b # Update the current capacity\r\n max_capacity = max(max_capacity, current_capacity) # Update the maximum capacity if needed\r\n\r\nprint(max_capacity)\r\n", "n = int(input())\r\ntram = 0\r\ncapacity = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n tram = tram - a + b\r\n capacity = max(tram, capacity)\r\nprint(capacity)", "n = int(input())\r\nm = 0\r\nz = 0\r\nfor _ in range(1, n + 1):\r\n a, b = map(int, input().split())\r\n z = z - a + b\r\n m = max(z, m)\r\n\r\nprint(m)", "n=int(input())\r\nd=0\r\nmax=0\r\nb=[]\r\nfor i in range(n):\r\n b.append(list(map(int,input().split())))\r\nfor i in b:\r\n d+=(i[1]-i[0])\r\n if d>max:\r\n max=d\r\nprint(max)", "def main():\r\n\r\n tramStops = int(input())\r\n total = 0\r\n capacity = 0\r\n \r\n for i in range(tramStops):\r\n exit, enter = input().split()\r\n exit, enter = int(exit), int(enter)\r\n total += enter - exit\r\n if total > capacity:\r\n capacity = total\r\n i += 1\r\n \r\n print(capacity)\r\n\r\nmain()", "max_val = sum_val = 0\r\nfor _ in [0] * int(input()):\r\n sum_val -= eval(input().replace(' ', '-'))\r\n max_val = max(max_val, sum_val)\r\nprint(max_val)\r\n", "x=[]\r\ns=0\r\na=0\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s=(s-a)+b\r\n x.append(s)\r\nprint(max(x))", "def min_capacity_tram():\r\n number_of_stops = int(input())\r\n current = 0\r\n list_current = [current]\r\n for step in range(number_of_stops):\r\n exit, enter = [int(x) for x in input().split(\" \")]\r\n current = current - exit + enter\r\n list_current.append(current)\r\n return max(list_current)\r\n\r\n\r\nprint(min_capacity_tram())", "n = int(input())\r\nmax_pass = 0\r\npassen = 0\r\nfor _ in range(n):\r\n a = [int(x) for x in input().split()]\r\n passen = passen + a[1] - a[0]\r\n if passen > max_pass:\r\n max_pass = passen\r\nprint(max_pass)", "def solve():\r\n ans, mx = 0, 0\r\n x = int(input())\r\n for i in range(x):\r\n a, b = map(int, input().split())\r\n mx += b-a\r\n ans = max(ans, mx)\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", "n = int(input()) # Number of stops\r\ncapacity = 0 # Current capacity\r\nmin_capacity = 0 # Minimum capacity needed\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n capacity -= a # Passengers exiting\r\n capacity += b # Passengers entering\r\n min_capacity = max(min_capacity, capacity) # Update minimum capacity needed\r\nprint(min_capacity)", "n=int(input())\r\ncap=0\r\ncurr_pass=0\r\nfor _ in range(n):\r\n ai,bi=map(int,input().split())\r\n curr_pass=curr_pass-ai+bi\r\n cap=max(cap,curr_pass)\r\nprint(cap)", "n = int(input())\r\nmax_capacity = 0\r\ncurrent_capacity = 0\r\n\r\nfor i in range (n):\r\n a, b = map(int,input().split())\r\n current_capacity += b - a\r\n max_capacity = max(max_capacity,current_capacity)\r\nprint(max_capacity)", "t=int(input())\r\nc=0\r\ns=0\r\nfor i in range(t):\r\n m,n=map(int,input().split())\r\n c=c+n-m\r\n if(c>s):\r\n s=c\r\nprint(s)\r\n\r\n ", "s , l = [] , 0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n l=l-a+b\r\n s=s+[l]\r\nprint(max(s))\r\n", "l=[]\r\ncount=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n count+=(b-a)\r\n l.append(count)\r\nprint(max(l))", "passsengers = 0\r\nmax_p = 0\r\nfor _ in range(int(input())):\r\n ost = tuple(map(int, input().split()))\r\n passsengers = passsengers - ost[0] + ost[1]\r\n if max_p < passsengers: max_p = passsengers\r\nprint(max_p)", "n=int(input())#number of tram stops\r\ncount=0\r\nt=0\r\nl=[]\r\nwhile(count<n):\r\n a,b=map(int,input().split())#a-exit b-enter\r\n l.append(t)\r\n t=t+b-a\r\n count+=1\r\nprint(max(l))", "n = int(input()) # Number of stops\r\nmax_capacity = 0 # Initialize maximum capacity\r\ncurrent_passengers = 0 # Initialize current passengers\r\n\r\nfor _ in range(n):\r\n # Read the number of exiting and entering passengers at the current stop\r\n exiting_passengers, entering_passengers = map(int, input().split())\r\n\r\n # Calculate the current number of passengers inside the tram\r\n current_passengers -= exiting_passengers\r\n current_passengers += entering_passengers\r\n\r\n # Update the maximum capacity if needed\r\n max_capacity = max(max_capacity, current_passengers)\r\n\r\n# Print the minimum possible capacity of the tram\r\nprint(max_capacity)", "num = int(input())\r\nsum =0\r\nsum2 =0 \r\nfor i in range(0,num):\r\n num1, num2 = map(int,input().split())\r\n if sum > sum2 :\r\n sum2 = sum\r\n if i ==0: \r\n sum += num2\r\n else:\r\n sum -= num1 \r\n sum +=num2 \r\nprint(sum2)", "max = 0\r\ns = 0\r\nfor i in range(int(input())):\r\n p = input().split()\r\n s += - int(p[0]) + int(p[1])\r\n if s > max:\r\n max = s\r\nprint(max)", "n = int(input())\r\ncount = 0\r\ncount1 = 0\r\n\r\nwhile n > 0:\r\n a, b = map(int, input().split())\r\n\r\n count += (b - a)\r\n\r\n if count > count1:\r\n count1 = count\r\n\r\n n -= 1\r\n \r\nprint(count1)", "n = int(input())\r\nc,m = 0,0\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n c -= x\r\n c += y\r\n if c > m:\r\n m = c\r\nprint(m)", "# Tram\namount = int(input())\n\ncurrent_amount = 0\nhighest_amount = 0\n\nfor i in range(amount):\n passengers = input().split(' ')\n current_amount -= int(passengers[0])\n current_amount += int(passengers[1])\n if current_amount > highest_amount:\n highest_amount = current_amount\n\nprint(highest_amount)", "n=int(input())\r\nc=0\r\np=0\r\nimport sys\r\ninput=sys.stdin.readline\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n p=(p-a)+b\r\n if p>c:\r\n c=p\r\nprint(c)", "n=int(input())\r\nc=m=0\r\nfor i in range(n):\r\n s=input().split()\r\n a,b=int(s[0]),int(s[1])\r\n c=c-a+b\r\n m=max(m,c)\r\nprint(m)", "passangers = maximum = 0\r\nfor _ in range(int(input())):\r\n a, b = list(map(int,input().split()))\r\n passangers += b-a\r\n if passangers > maximum:\r\n maximum = passangers\r\nprint(maximum)", "def main() :\r\n TRAM_HISTORY = input_Tram_History(input_Stop_Count())\r\n print(min_Capacity(TRAM_HISTORY))\r\n\r\n\r\ndef min_Capacity(tram_history) :\r\n return max(capacity_History(tram_history))\r\n\r\ndef capacity_History(tram_history) :\r\n result = [0]\r\n for stop_history in tram_history :\r\n result.append(result[-1] + capacity_Difference(stop_history))\r\n return result[1:]\r\n\r\ndef capacity_Difference(stop_history) :\r\n return stop_history[1] - stop_history[0]\r\n\r\n\r\ndef input_Stop_Count() :\r\n return int(input())\r\n\r\ndef input_Tram_History(stop_count) :\r\n return [input_Stop_History() for _ in range(stop_count)]\r\n\r\ndef input_Stop_History() :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "w=p=0\r\nfor x in[0]*int(input()):p-=eval(input().replace(' ','-'));w=max(w,p)\r\nprint(w)", "n = int(input())\r\nm = 0\r\ns = 0\r\nwhile(n):\r\n x,y=map(int,input().split())\r\n s=s+y-x\r\n if s>m:\r\n m = s\r\n n-=1\r\nprint(m)", "def solve(a, b, passengers):\r\n # Update passengers for each stop\r\n passengers -= a # passengers exit\r\n passengers += b # passengers enter\r\n\r\n return passengers\r\n\r\ndef main():\r\n n = int(input())\r\n passengers = 0\r\n max_passengers = 0\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers = solve(a, b, passengers)\r\n if passengers > max_passengers:\r\n max_passengers = passengers\r\n print(max_passengers)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nc=[]\r\nd=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 d=d-a\r\n c.append(d)\r\n d=d+b\r\n c.append(d)\r\nprint(max(c))", "stops = int(input())\r\npeople = []\r\nfor a in range(stops):\r\n people.append(list(map(int,input().split())))\r\ntram = 0\r\nminimum_possible_capacity = 0\r\nfor i in range(stops):\r\n tram -= people[i][0]\r\n tram += people[i][1]\r\n if minimum_possible_capacity < tram:\r\n minimum_possible_capacity = tram\r\n\r\nprint(minimum_possible_capacity)", "n = int(input())\r\nL = []\r\ninside = 0\r\nfor i in range(0,n):\r\n t = [int(x) for x in input().split(\" \")]\r\n inside += t[1]\r\n inside -= t[0]\r\n L.append(inside)\r\nprint(max(L))", "n = int(input())\r\nans = 0\r\ns = 0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n s =s-a\r\n s+=b\r\n ans = max(ans,s)\r\n\r\nprint(ans)\r\n ", "n = int(input())\r\nmax_value = 0\r\nquantity = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n quantity += (b - a)\r\n \r\n if max_value is None:\r\n max_value = quantity\r\n else:\r\n if quantity > max_value:\r\n max_value = quantity\r\n\r\nprint(max_value)\r\n", "n = int(input())\r\nwhile True:\r\n if n in range(2, 1001):\r\n break\r\nentryExitPair = []\r\ncurPassanger = []\r\nentryNum = 0\r\nexitNum = 0\r\nfor i in range(n):\r\n pExit, pEntry = map(int, input().split())\r\n tuplePair = (pExit, pEntry)\r\n entryExitPair.append(tuplePair)\r\nfor j in entryExitPair:\r\n exitNum = j[0]\r\n entryNum = entryNum + j[1] - exitNum\r\n # print(exitNum, entryNum)\r\n curPassanger.append(entryNum)\r\n\r\nprint(max(curPassanger))\r\n\r\n\r\n# You can save two inputs as a pair of tuple in Python by using the following code:\r\n\r\n# tuple_1 = input(\"Enter first value: \")\r\n# tuple_2 = input(\"Enter second value: \")\r\n# pair_of_tuple = (tuple_1, tuple_2)\r\n# Copy\r\n# This will create a pair of tuple with the two inputs you entered. You can also use the zip() function to create a list of tuples from multiple inputs. Here is an example:\r\n\r\n# input_string = input(\"Enter multiple values separated by comma: \")\r\n# list_of_values = input_string.split(\",\")\r\n# pair_of_tuples = [(list_of_values[i], list_of_values[i+1]) for i in range(0, len(list_of_values), 2)]\r\n", "n = int(input())\nn_passengers = [0]\nfor i in range(n):\n exit_tram, enter_tram = map(int, input().split(\" \"))\n passengers_count = n_passengers[i] - exit_tram + enter_tram\n n_passengers.append(passengers_count)\nprint(max(n_passengers))\n", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\nn=int(input())\r\nans=0\r\ncnt=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n cnt+=b-a\r\n ans=max(ans,cnt)\r\nprint(ans)", "n=int(input())\r\nmax_capacity=0\r\ntemp=0\r\nfor i in range(n):\r\n exit,enter=map(int,input().split())\r\n temp+=enter-exit\r\n #print(temp)\r\n if temp>max_capacity:\r\n max_capacity=temp\r\nprint(max_capacity)\r\n ", "c,t,n=0,0,int(input());x=[list(map(int,input().split())) for i in range(n)]\r\nfor i in x: c+=i[1]-i[0];t=max(t,c)\r\nprint(t)", "n = int(input())\r\ntram = 0\r\nmax = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n tram -= a\r\n tram += b\r\n if tram > max:\r\n max = tram\r\nprint(max)", "c=0\r\nl=[]\r\nfor i in range(int(input())):\r\n n,m=map(int,input().split())\r\n c-=n\r\n c+=m\r\n l+=[c]\r\nprint(max(l))\r\n\r\n", "n = int(input())\nmax_no = 0\ncurrent = 0\nfor _ in range(n):\n inside, out = map(int, input().split())\n current = current - inside + out\n if current > max_no:\n max_no = current\nprint(max_no)", "a = []\r\nc=0;d=0\r\nfor i in range(int(input())):\r\n b = list(map(int,input().split()))\r\n c = d - b[0]\r\n d = c + b[1]\r\n a.append(d)\r\nprint(max(a))", "n = int(input())\r\npeople = 0\r\ncurrent = []\r\nfor i in range(n):\r\n a, b = input().split()\r\n people += int(b)\r\n people = people - int(a)\r\n current.append(people)\r\n\r\n\r\nprint(max(current))", "n=int(input())\r\nk=0\r\nm=0\r\nfor i in range(n):\r\n k-=eval(input().replace(' ','-'))\r\n m=max(m,k)\r\nprint(m)", "n=int(input())\r\nmin=0\r\ns=0\r\nfor i in range(n):\r\n a,b=[int(x)for x in input().split()]\r\n s=s-a+b\r\n if min<s:\r\n min=s\r\nprint(min)\r\n", "n = int(input())\r\nmax = 0\r\ncount = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n count = count - a + b#需引入count，不能用max，因为当车上人数小于max时max不会变\r\n if count > max:\r\n max = count\r\n\r\nprint(max)", "n=int(input())\r\nx=[]\r\ny=[]\r\nl=[]\r\nd=0\r\nfor i in range(n):\r\n a=input()\r\n b=a.split(\" \")\r\n x.append(b[0])\r\n y.append(b[1])\r\nfor i in range(n):\r\n c=int(y[i])-int(x[i])\r\n d=d+c\r\n l.append(d)\r\nprint(int(max(l)))", "# Read input\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncurrent_capacity = 0 # Current number of passengers on the tram\r\nmin_capacity = 0 # Minimum capacity of the tram\r\n\r\n# Iterate through the stops\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n \r\n # Calculate the current number of passengers after exiting and entering\r\n current_capacity = current_capacity - a + b\r\n \r\n # Update the minimum capacity if necessary\r\n min_capacity = max(min_capacity, current_capacity)\r\n\r\n# Print the minimum capacity\r\nprint(min_capacity)\r\n", "a = int(input())\r\nx = 0\r\nremain = 0\r\n\r\nfor i in range(a):\r\n goOut, goIn = input().split()\r\n goOut = int(goOut)\r\n goIn = int(goIn)\r\n\r\n remain -= goOut\r\n \r\n if (remain + goIn) > x: x = remain + goIn\r\n\r\n remain += goIn\r\n\r\nprint(x)\r\n", "n = int(input())\r\nexit = 0\r\nenter = 0\r\ninside = 0\r\nmax_counter = 0\r\nfor i in range(n):\r\n exit , enter = map(int, input().split())\r\n if i==0:\r\n max_counter = enter\r\n inside = inside - exit\r\n inside = inside + enter\r\n if max_counter < inside:\r\n max_counter = inside\r\n if i==n-1:\r\n if max_counter < exit:\r\n max_counter = exit\r\nprint(max_counter)", "N=int(input())\r\nL=[]\r\nL_I=[]\r\n\r\nwhile N>0:\r\n NL=list(map(int,input().split()))\r\n L.append(NL)\r\n N=N-1\r\n \r\nmax_no=0\r\nperson=0\r\nfor i in L:\r\n person=person-i[0]+i[1]\r\n if max_no < person:\r\n max_no=person\r\n \r\nprint(max_no)", "n = int(input())\r\nstops = []\r\nfor i in range(n):\r\n stops.append(input().split())\r\n stops[i][0] = int(stops[i][0])\r\n stops[i][1] = int(stops[i][1])\r\npc = 0\r\nmax = 0\r\nfor j in range(n):\r\n pc = pc - stops[j][0] + stops[j][1]\r\n if pc > max:\r\n max = pc\r\nprint(max)\r\n ", "n=int(input())\r\nanswer=0\r\nlis=[]\r\nfor i in range (n ):\r\n k=list(map(int,input().split()))\r\n lis.append(k)\r\n\r\nop=[]\r\nfor i in lis:\r\n answer+=i[1]-i[0]\r\n op.append(answer)\r\nprint(max(op))", "number_of_stops = int(input())\r\np_in = 0\r\np_out = 0\r\np_sum = 0\r\np_min_c = 0\r\nwhile number_of_stops > 0:\r\n inp = input().split()\r\n p_out = int(inp[0])\r\n p_in = int(inp[1])\r\n p_sum = p_sum - p_out + p_in\r\n if p_sum > p_min_c:\r\n p_min_c = p_sum\r\n number_of_stops -= 1\r\n\r\nprint(p_min_c)\r\n", "n=int(input(\"\"))\r\ncap,pas=0,0\r\nfor i in range (n):\r\n a,b=map(int,input().split())\r\n pas=pas-a\r\n pas=pas+b\r\n if (pas>cap):cap=pas\r\nprint(cap) \r\n \r\n", "\"\"\"\r\n=> @auther:Abdallah_Gaber\r\n=> A computer science student\r\n=> AOU University \"Egypt Branch\"\r\n\"\"\"\r\nnum=0\r\nmx=0\r\nfor i in range(int(input())):\r\n ex,inp=map(int,input().split())\r\n num-=ex\r\n num+=inp\r\n if num>=mx:\r\n mx=num\r\nprint(mx)\r\n", "c=0\r\nmc=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n c+=b-a\r\n if mc<c:\r\n mc=c\r\nprint(mc)", "s=int(input())\r\nt=0\r\nl=[]\r\nfor x in range(s):\r\n f=input().split()\r\n f=[int(i)for i in f]\r\n o=f[1]\r\n e=f[0]\r\n t+=o\r\n t-=e\r\n l.append(t)\r\n\r\nprint(max(l))\r\n\r\n", "t = int(input())\r\n\r\npassengers = 0\r\nmax_pass = 0\r\nfor _ in range(t):\r\n exit, enter = map(int, input().split())\r\n passengers += enter\r\n passengers -= exit\r\n\r\n if passengers > max_pass:\r\n max_pass = passengers\r\n\r\nprint(max_pass)\r\n", "n = int(input())\r\nSum = 0\r\nmaxi = 0\r\nfor i in range(n): \r\n a, b = list(map(int, input().split()))\r\n Sum = Sum - a + b\r\n maxi = max(Sum, maxi)\r\nprint(maxi)", "n = int(input())\r\np = 0\r\nm = 0\r\nfor _ in range(n):\r\n e1, e2 = map(int, input().split())\r\n p = p - e1 + e2\r\n m = max(m, p)\r\n\r\nprint(m)\r\n", "import array\r\nn=int(input())\r\ns=0\r\narr =[]\r\nfor i in range (n):\r\n a,b = map(int,input().split())\r\n s=s-a+b\r\n \r\n arr.append(s)\r\nprint(max(arr))\r\n", "t = int(input())\r\nctr = 0\r\nans = 0\r\n\r\nwhile t:\r\n ex, en = list(map(int, input().split()))\r\n ctr = ctr + en - ex\r\n ans = max(ans, ctr)\r\n \r\n t -= 1\r\n\r\nprint(ans)", "ajay=p=0\r\nfor x in[0]*int(input()):p-=eval(input().replace(' ','-'));ajay=max(ajay,p)\r\nprint(ajay)\r\n#fhgjhkhutyjrtedrgsfxbchkytrhdgcnvhgytfhgn", "n = int(input())\r\ncap = 0\r\npassengers = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers = passengers - a + b\r\n cap = max(cap, passengers)\r\nprint(cap)\r\n", "n=int(input())\r\nm=0\r\nt=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n t-=a\r\n t+=b\r\n if t>m:\r\n m=t\r\nprint(m) ", "n=int(input())\r\nls=[]\r\nl1=[]\r\n#l=list(map(int,input().split()))\r\nfor i in range(n):\r\n l1=list(map(int,input().split()))\r\n ls.append(l1)\r\nmax=0\r\nm=0\r\nfor i in range(n):\r\n m+=ls[i][1]-ls[i][0]\r\n if m>max:\r\n max=m\r\nprint(max)", "n = int(input())\nremain = 0\nkq_max = 0\n\nfor i in range(n):\n a, b = map(int, input().split())\n \n remain = remain - a + b\n if remain > kq_max:\n kq_max = remain\n \nprint(kq_max)\n", "n = int(input())\r\np = 0\r\npList = []\r\nfor i in range(1, n+1):\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n if i == 1:\r\n pList.append(b)\r\n dp = b-a\r\n if i != 1:\r\n pList.append(pList[i-2]+dp)\r\n\r\n\r\n\r\nmaxP = pList[0]\r\nfor j in range(len(pList)):\r\n if maxP < pList[j]:\r\n maxP = pList[j]\r\nprint(maxP)\r\n \r\n", "vezes = int(input(\"\"))\r\nif vezes<1 or vezes>1000:\r\n exit(1)\r\ndentro=0\r\nmaior=0\r\nfor i in range(vezes):\r\n saiu, entrou = map(int, input(\"\").split())\r\n if saiu>dentro:\r\n saiu=dentro\r\n dentro=dentro+entrou-saiu\r\n if maior<dentro:\r\n maior=dentro\r\n #print(saiu,entrou,dentro)\r\nprint(maior)", "n=int(input())\r\nmax=0\r\npas=0\r\nfor i in range(n):\r\n x,y=tuple(map(int,input().split()))\r\n pas+=(y-x)\r\n if pas>max:\r\n max=pas\r\nprint(max)", "n = int(input())\r\nc = 0\r\na = 0\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n a -= x\r\n a+= y\r\n c= max(c, a)\r\n\r\nprint(c)\r\n", "c=int(input())\r\nmaxx = 0\r\nd = 0\r\nfor i in range(c):\r\n (x,y)=map(int,input().split())\r\n d-=x \r\n d+=y\r\n if d>maxx:\r\n maxx = d \r\nprint(maxx)", "a=0\r\nb=0\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n b-=x\r\n b+=y\r\n a=max(a,b)\r\nprint(a)", "n = int(input())\r\nx=0\r\nt=0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x=x+b-a\r\n if (x>t):\r\n t=x\r\nprint(t)\r\n\r\n \r\n \r\n", "def calculate_minimum_capacity(n, stops):\r\n max_capacity = 0 # variable to store the maximum capacity of the tram\r\n current_capacity = 0 # variable to store the current capacity of the tram\r\n\r\n for i in range(n):\r\n # update the current capacity by subtracting the exiting passengers\r\n current_capacity -= stops[i][0]\r\n \r\n # update the current capacity by adding the entering passengers\r\n current_capacity += stops[i][1]\r\n \r\n # update the max_capacity if needed\r\n if current_capacity > max_capacity:\r\n max_capacity = current_capacity\r\n\r\n return max_capacity\r\n\r\n# read the input\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n stops.append((ai, bi))\r\n\r\n# calculate and print the minimum capacity\r\nprint(calculate_minimum_capacity(n, stops))", "n = int(input())\r\nml = []\r\nfor _ in range(n):\r\n m = list(map(int,input().split()))\r\n ml.append(m)\r\nfinal = []\r\ncount = 0\r\nfor f in ml:\r\n count += f[1]\r\n count -= f[0]\r\n final.append(count)\r\n\r\nprint(max(final))", "n = int(input())\r\ncapacity = 0\r\npassengers_inside = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n passengers_inside -= a\r\n passengers_inside += b \r\n capacity = max(capacity, passengers_inside)\r\nprint(capacity)\r\n", "n = int(input())\r\npassengers = 0\r\ncapacity = 0\r\nfor _ in range(n):\r\n a, b = (int(x) for x in input().split())\r\n passengers += b - a\r\n capacity = max(capacity, passengers)\r\nprint(capacity)\r\n", "n=int(input())\r\n\r\nx=0\r\ny=0\r\nwhile(n>0):\r\n a,b=map(int,input().split())\r\n x=x+b-a\r\n if x>y:\r\n y=x\r\n n=n-1\r\nprint(y)", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables for the current number of passengers and the maximum capacity\r\ncurrent_passengers = 0\r\nmax_capacity = 0\r\n\r\n# Iterate through the stops and calculate the maximum capacity\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_passengers = current_passengers - a + b\r\n max_capacity = max(max_capacity, current_passengers)\r\n\r\n# Output the maximum capacity\r\nprint(max_capacity)\r\n\r\n", "n=int(input())\r\nmx=0\r\np=0\r\nfor i in range(n):\r\n l,e = map(int,input().split())\r\n if i==0:\r\n p+=e\r\n elif i==n-1:\r\n p-=l\r\n else:\r\n p-=l\r\n p+=e\r\n mx=max(mx,p)\r\nprint(mx)", "n = int(input())\r\nmin_cap = 0\r\nstop = []\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n min_cap -= x\r\n min_cap += y\r\n stop.append(min_cap)\r\nprint(max(stop)) ", "# Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop. Also, when the tram arrives at the last stop, all passengers exit so that it becomes empty.\n\n# Your task is to calculate the tram's minimum capacity such that the number of people inside the tram at any time never exceeds this capacity. Note that at each stop all exiting passengers exit before any entering passenger enters the tram.\n# Input\n\n# The first line contains a single number n (2 ≤ n ≤ 1000) — the number of the tram's stops.\n\n# Then n lines follow, each contains two integers ai and bi (0 ≤ ai, bi ≤ 1000) — the number of passengers that exits the tram at the i-th stop, and the number of passengers that enter the tram at the i-th stop. The stops are given from the first to the last stop in the order of tram's movement.\n\n# The number of people who exit at a given stop does not exceed the total number of people in the tram immediately before it arrives at the stop. More formally, . This particularly means that a1 = 0.\n# At the last stop, all the passengers exit the tram and it becomes empty. More formally, .\n# No passenger will enter the train at the last stop. That is, bn = 0.\n\n# Output\n\n# Print a single integer denoting the minimum possible capacity of the tram (0 is allowed).\n\ninput_count = int(input())\ninputs = []\nfor i in range(input_count):\n inputs.append(list(map(int, input().split())))\n\ninitial = 0\nmaxi = 0\nfor i in inputs:\n out, inside = i\n initial -= out\n initial += inside\n if maxi < initial:\n maxi = initial\n\nprint(maxi)\n", "def solution(l):\n capacity = 0\n max_capacity = 0\n for a, b in l:\n capacity = capacity - a + b\n if capacity > max_capacity:\n max_capacity = capacity\n return max_capacity\n\nif __name__ == '__main__': \n n = int(input())\n l = []\n for _ in range(n):\n a, b = [int(i) for i in input().split()]\n l.append((a, b))\n print(solution(l))\n\t\t \t\t \t \t\t \t \t \t \t\t \t \t", "n = int(input())\r\npassengers_inside = 0\r\nmax_capacity = 0\r\n\r\nfor _ in range(n):\r\n exit_count, enter_count = map(int, input().split())\r\n passengers_inside = passengers_inside - exit_count + enter_count\r\n max_capacity = max(max_capacity, passengers_inside)\r\n\r\nprint(max_capacity)\r\n", "n=int(input())\na=0\nb=0\nmin=0\nfor i in range(n):\n x,y=input().split()\n a+=int(x)\n b+=int(y)\n r=b-a\n if r>min:\n min=r\nprint(min)", "def calculate_min_capacity(n, stops):\r\n max_capacity = 0\r\n current_capacity = 0\r\n for stop in stops:\r\n exit_passengers = stop[0]\r\n enter_passengers = stop[1]\r\n current_capacity -= exit_passengers\r\n current_capacity += enter_passengers\r\n max_capacity = max(max_capacity, current_capacity)\r\n return max_capacity\r\n\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n exit_passengers, enter_passengers = map(int, input().split())\r\n stops.append((exit_passengers, enter_passengers))\r\nmin_capacity = calculate_min_capacity(n, stops)\r\nprint(min_capacity)\r\n", "n=int(input())\r\nit=0\r\nmaxi=0\r\nfor i in range(n):\r\n a,c=map(int,input().split())\r\n it-=a\r\n it+=c\r\n maxi=max(maxi,it)\r\nprint(maxi)", "n=int(input())\r\nmax_capacity=0\r\ncurrent_capacity=0\r\nfor _ in range(n):\r\n a,b=map(int, input().split())\r\n current_capacity=current_capacity-a+b \r\n max_capacity=max(max_capacity,current_capacity) \r\n\r\nprint(max_capacity)\r\n", "from sys import stdin, stdout\r\nimport math,sys\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nimport bisect as bi\r\nimport heapq \r\n\r\n'''\r\n#------------------PYPY FAst I/o--------------------------------#\r\n \r\ndef I():return (int(stdin.readline()))\r\ndef In():return(map(int,stdin.readline().split()))\r\n'''\r\n#------------------Sublime--------------------------------------#\r\n \r\n#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\ndef I():return (int(input()))\r\ndef In():return(map(int,input().split()))\r\ndef L():return(list(In()))\r\n\r\n\r\n\r\ndef main():\r\n try:\r\n n=I()\r\n l=[]\r\n for i in range(n):\r\n a,b=In()\r\n l.append((a,b))\r\n\r\n pre=l[0][1]-l[0][0]\r\n ma=pre\r\n for i in range(1,n):\r\n t=l[i]\r\n pre-=t[0]\r\n pre+=t[1]\r\n ma=max(pre,ma)\r\n print(ma)\r\n \r\n\r\n\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n for _ in range(1):\r\n main()", "t=int(input())\r\np=0\r\nx=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n p-=a\r\n p+=b\r\n \r\n if x<p:\r\n x=p\r\nprint(x)", "def cal_cap(arr,cap):\r\n s= value =0 \r\n for val in arr:\r\n value += val[0] - val [1]\r\n s = cap +value\r\n if s< 0:\r\n return s\r\n return 0\r\n\r\nn = int(input())\r\ncap = s = 0\r\narr = []\r\nfor i in range(n):\r\n val = list(map(int, input().split(\" \")))\r\n arr.append(val)\r\n\r\nfor i in range(n):\r\n cap -= cal_cap(arr,cap)\r\n\r\nprint(cap)\r\n", "n=int(input())\r\nc=0 \r\np=0 \r\nfor i in range(n):\r\n a,b =map(int, input().split())\r\n p-=a \r\n p+=b \r\n c=max(c,p)\r\n\r\nprint(c)", "n = int(input())\nresult = 0\naa = []\nbb = []\nfor i in range(n):\n a, b = list(map(int, input().split()))\n aa.append(a)\n bb.append(b)\nnum_passengers = 0\nfor i in range(n):\n num_passengers -= aa[i]\n num_passengers += bb[i]\n result = max(result, num_passengers)\nprint(result)", "n=int(input())\r\nt=0;\r\nz=0;\r\nmx=0;\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n t-=a;\r\n t+=b;\r\n if mx<t:\r\n mx=t;\r\nprint(mx);\r\n", "test_case=int(input())\r\n\r\nhigh=0\r\ncurr=0\r\nfor i in range(test_case):\r\n x,y=[int(a) for a in input().split(\" \")]\r\n curr-=x\r\n curr+=y\r\n if curr>high:\r\n high=curr\r\n elif curr<high:\r\n continue\r\nprint(high)\r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\ncap = 0\r\nx = 0\r\nfor i in range(n):\r\n x = x + a[i][1] - a[i][0]\r\n if x > cap:\r\n cap = x\r\nprint(cap)", "#!/usr/bin/env python\r\nfrom typing import Sequence\r\n\r\n\r\n\r\ndef main(stops: Sequence) -> None:\r\n\tminNumber = 0\r\n\tnumberOfPass = 0\r\n\tfor stop in range(1,int(stops)+1):\r\n\t\tpassangers = input()\r\n\t\t(a,b) = passangers.split()\r\n\t\tnumberOfPass = numberOfPass - int(a) + int(b)\r\n\t\tif numberOfPass > minNumber:\r\n\t\t\tminNumber = numberOfPass\r\n\tprint(minNumber)\t\r\n\r\nif __name__ == '__main__':\r\n\tmain(input())", "n = int(input())\r\nz = 0\r\nm = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n z -= a\r\n z += b\r\n m = max(m, z)\r\nprint(m)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"tram 116A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1SQfmdOT7NhT6Ldwc3OEdccIsl7Fr7Rft\n\"\"\"\n\nn = int(input())\nm = 0\ns = 0\nwhile n:\n\tx,y= map(int,input().split())\n\ts=s+y-x\n\tif s >m:\n\t\tm = s\n\tn-=1\nprint(m)", "\r\ndef main():\r\n n = int(input())\r\n count = 0\r\n maxx = count\r\n for _ in range(n):\r\n a, b = [int(i) for i in input().split(\" \")]\r\n count = count - a + b\r\n if maxx < count:\r\n maxx = count\r\n print(maxx)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\ncount = 0\r\nmax = 0\r\nfor i in range(n):\r\n a , b = map(int,(input().split()))\r\n count += (b - a)\r\n if count > max:\r\n max = count\r\nprint(max)\r\n\r\n", "n = int(input())\r\ninside = 0\r\ncapacity = 0\r\nfor i in range(n):\r\n a, b = (int(j) for j in input().split())\r\n inside = inside - a + b\r\n if inside > capacity:\r\n capacity = inside\r\nprint(capacity)\r\n\r\n", "def calculate_minimum_capacity(n, stops):\r\n capacity = 0\r\n passengers = 0\r\n\r\n for stop in stops:\r\n exit_passengers, enter_passengers = stop\r\n passengers -= exit_passengers\r\n passengers += enter_passengers\r\n capacity = max(capacity, passengers)\r\n\r\n return capacity\r\n\r\ndef main():\r\n n = int(input())\r\n stops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n result = calculate_minimum_capacity(n, stops)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "stop = int(input())\r\nnum = 0\r\nnumlist=[]\r\nfor i in range(stop):\r\n (down,up)=map(int,input().split())\r\n num = num + up - down\r\n numlist.append(num)\r\nprint(max(numlist))\r\n", "n=int(input())\r\na=0\r\nb=0\r\nfor x in range(0,n):\r\n m=input().split()\r\n a=a-int(m[0])+int(m[1])\r\n if a>b:\r\n b=a\r\nprint(b)\r\n\r\n\r\n", "n = int(input())\r\nmx = 0\r\nt = 0\r\nfor _ in range(n):\r\n o,i = list(map(int,input().split()))\r\n t -= o\r\n t += i\r\n if t >= mx:\r\n mx = t\r\nprint(mx)", "n = int(input())\r\nMAX = 0\r\nc = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n c -= x\r\n c += y\r\n if c > MAX: MAX = c\r\nprint(MAX)", "c = 0\r\nres = -float('inf')\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n c -= a\r\n #print(c, -1)\r\n c += b\r\n #print(c,-2)\r\n res = max(c,res)\r\nprint(res)\r\n\r\n", "x = int(input())\r\narr = list()\r\nam = 0\r\nfor i in range(x):\r\n a, b = map(int, input().split())\r\n am -= a\r\n am += b\r\n arr.append(am)\r\nprint(max(arr))", "k=int(input())\r\nn=0\r\nn1=0\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n n=n-a+b\r\n if n>n1:\r\n n1=n\r\nprint(n1)", "t = int(input())\r\ntotal = 0\r\nmax = 0\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n total += (b-a)\r\n if max < total:\r\n max = total\r\nprint(max)", "n = int(input())\r\nmini = 0\r\nl = []\r\nk = []\r\nfor i in range(n):\r\n x = input()\r\n k = x.split()\r\n l.append([int(k[0]), int(k[1])])\r\nfor i in range(n):\r\n mini += int(l[i][1])\r\n\r\ns = 0\r\nmini = 0\r\nfor i in range(n):\r\n s += int(l[i][1])-int(l[i][0])\r\n mini = max(mini, s)\r\n\r\nprint(mini)\r\n", "n=int(input())\r\ncapacity=0\r\ncurrent=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n current-=a\r\n current+=b\r\n capacity=max(capacity,current)\r\nprint(capacity)", "n=int(input())\r\nsum=0\r\nmax=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n sum=sum+b-a\r\n if max<sum:\r\n max=sum\r\n else:\r\n continue\r\nprint(max) \r\n", "n=int(input())\r\nlst=[]\r\nnumber=0\r\nfor i in range(1,n+1):\r\n a,b=input().split()\r\n number=number+int(b)-int(a)\r\n lst.append(number)\r\nprint(max(lst))\r\n \r\n", "n = int(input())\r\nc = 0 \r\nmax_c = 0 \r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n c -= a \r\n c += b \r\n max_c = max(max_c, c)\r\nprint(max_c)", "tests = int(input())\r\n\r\nstops = [[0 for x in range(2)] for y in range(tests)]\r\n\r\nrow = 0\r\n\r\nfor test in range(tests):\r\n column = 0\r\n a = input()\r\n for num in a.split():\r\n stops[row][column] = int(num)\r\n column += 1\r\n row += 1\r\n\r\np_train = 0\r\nmin = 0\r\nfor stop in stops:\r\n p_train -= stop[0]\r\n p_train += stop[1]\r\n if p_train > min:\r\n min = p_train\r\n \r\nprint(min)", "number_of_stops=int(input())\r\nl1=[]\r\ncapacity=0\r\nfor i in range(number_of_stops):\r\n enter,exi1=input().split()\r\n ex=int(exi1)\r\n en=int(enter)\r\n capacity=ex-en+capacity\r\n l1.append(capacity)\r\nprint(max(l1))\r\n \r\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n arr.append([x,y])\r\nans = arr[0][1]\r\nmaxx = 0\r\nfor i in range(1,n):\r\n maxx = max(maxx, ans)\r\n ans += arr[i][1] - arr[i][0]\r\nprint(maxx)\r\n\r\n\r\n", "c = 0\nw = 0\nn = int(input())\nfor i in range(n):\n s = [int(i) for i in input().split()]\n p = s[1] - s[0]\n w += p\n c = max(c, w)\nprint(c)", "c=int(input())\r\nmaxsum=0\r\ntran=0\r\nfor i in range(c):\r\n a,b=map(int,input().split())\r\n tran=tran+b-a\r\n maxsum=max(maxsum,tran)\r\nprint(maxsum)", "n=int(input())\r\ncurrent=0\r\nanswer=0\r\nfor _ in range(n):\r\n d,u=list(map(int,input().split()))\r\n current-=d\r\n current+=u\r\n if current>answer:\r\n answer=current\r\nprint(answer)\r\n ", "n = int(input())\r\nnow = 0\r\nvm = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n now += b-a\r\n if now > vm:\r\n vm = now\r\nprint(vm)", "n=int(input())\r\nc,max=0,0\r\nfor _ in range(n):\r\n m,n=map(int,input().split())\r\n c-=m\r\n c+=n\r\n if c>max:\r\n max=c\r\nprint(max)", "n = int(input())\r\ntotal = 0\r\nmax = 0\r\nfor i in range(n):\r\n arr = [int(i) for i in input().split()]\r\n total += arr[1] - arr[0]\r\n if(total>max):\r\n max = total\r\nprint(max)", "n = int(input())\r\ncount = 0\r\ncapacity = 0\r\nfor i in range(n):\r\n\ts = input()\r\n\tnum = s.split()\r\n\ta = int(num[0])\r\n\tb = int(num[1])\r\n\tcount = b - a + count\r\n\tif count > capacity:\r\n\t\tcapacity = count\r\nprint(capacity)", "n = int(input())\r\n\r\ncPassengers= []\r\ncPassenger = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n cPassenger -= a\r\n cPassenger += b\r\n cPassengers.append(cPassenger)\r\n\r\nprint(max(cPassengers))", "n=int(input())\r\nt=0\r\nf=0\r\nfor i in range(1,n+1):\r\n a,b=map(int,input().split())\r\n t=t-a+b\r\n if i == 1:\r\n f = t\r\n if f <= t:\r\n f = t\r\nprint(f)", "n=int(input())\r\nx,y=map(int,input().split())\r\nmaxi=y\r\nfor i in range(n-1):\r\n nx,ny=map(int,input().split())\r\n y=y-nx+ny\r\n if y>maxi:\r\n maxi=y\r\n else:\r\n continue\r\nprint(maxi)\r\n", "n = int(input())\r\nt = 0\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n t -= a\r\n t += b\r\n if t > c:\r\n c = t\r\n else:\r\n continue\r\nprint(c)", "n = int(input())\r\n\r\ncapacity = 0 \r\npassengers = 0 \r\n\r\nfor _ in range(n):\r\n exit_passengers, enter_passengers = map(int, input().split())\r\n passengers -= exit_passengers\r\n passengers += enter_passengers\r\n capacity = max(capacity, passengers)\r\n\r\nprint(capacity)\r\n", "n = int(input())\r\nm = 0\r\nt = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n t += b-a\r\n m = max(m,t)\r\nprint(m)\r\n", "n=int(input())\r\nnum=0\r\nnum1=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())#exit,enter\r\n num+=b-a\r\n num1.append(num)\r\nans=0\r\nfor i in range(n):\r\n if num1[i]>ans:\r\n ans=num1[i]\r\nprint(ans)", "enters = []\r\nexits = []\r\nn = int(input())\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n enters.append(b)\r\n exits.append(a)\r\n \r\n \r\npeople = 0\r\ncap = 0\r\nstop = 0\r\nwhile stop < n:\r\n people = people + enters[stop] - exits[stop]\r\n # print(people)\r\n if people > cap:\r\n cap = people\r\n stop += 1\r\n \r\nprint(cap)", "sum =0\nmx = 0\nn = int(input())\nfor i in range(n):\n a, b = input().split()\n a= int(a)\n b = int(b)\n sum -= a\n sum += b\n mx = max(mx , sum)\nprint(mx)\n\n \t\t \t\t \t \t \t\t\t \t\t\t\t \t \t\t", "n = int(input())\r\n\r\non_tram = 0\r\nlst = []\r\nfor i in range(n):\r\n\ta, b = (int(i) for i in input().split())\r\n\ton_tram -= a\r\n\ton_tram += b\r\n\tlst.append(on_tram)\r\n\r\nprint(max(lst))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 17:15:25 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\nx=0\r\ncon=[]\r\ndatas=[]\r\nn=int(input())\r\nfor i in range(n):\r\n data=list(map(int,input().split()))\r\n datas.append(data)\r\nfor i in datas:\r\n x-=i[0]\r\n x+=i[1]\r\n con.append(x)\r\nprint(max(con))\r\n ", "n=int(input())\r\nans=0\r\nans1=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n ans=(ans-a)+b\r\n if ans>ans1:\r\n ans1=ans\r\nprint(ans1)\r\n", "stops = int(input())\r\npsg, psgs = 0, []\r\nfor i in range(stops):\r\n ex, en = map(int, input().split())\r\n psg = psg - ex + en\r\n psgs.append(psg)\r\nprint(max(psgs))", "def minimum_tram_capacity(n, stops):\r\n max_capacity = 0\r\n current_capacity = 0\r\n \r\n for i in range(n):\r\n exiting, entering = stops[i]\r\n current_capacity += entering - exiting\r\n max_capacity = max(max_capacity, current_capacity)\r\n \r\n return max_capacity\r\n\r\nn = int(input())\r\nstops = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)\r\n", "a=p=0\r\nnum_inputs=int(input())\r\nfor _ in range(num_inputs):\r\n expr=input().replace(' ', '-')\r\n p=p-eval(expr)\r\n a=max(a, p)\r\nprint(a)\r\n", "\r\nchir = []\r\nS0l = 0\r\nfor ch in range(0,int(input())):\r\n abc,bca = map(int,input().split())\r\n S0l=S0l-abc\r\n S0l += bca\r\n chir.append(S0l)\r\nprint(max(chir))", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables to keep track of the current number of passengers and the minimum capacity\r\ncurrent_passengers = 0\r\nmin_capacity = 0\r\n\r\n# Iterate through the stops\r\nfor i in range(n):\r\n # Read the number of passengers exiting and entering at the current stop\r\n a, b = map(int, input().split())\r\n \r\n # Update the current number of passengers inside the tram\r\n current_passengers = current_passengers - a + b\r\n \r\n # Update the minimum capacity if needed\r\n min_capacity = max(min_capacity, current_passengers)\r\n\r\n# Print the minimum capacity\r\nprint(min_capacity)\r\n", "n = int(input())\r\ncurrent_pass = 0\r\nmin_cap = 0\r\nfor i in range(0,n):\r\n a,b = list(map(int,input().split(\" \")))\r\n \r\n current_pass = current_pass + b - a\r\n min_cap = max(min_cap,current_pass)\r\nprint(min_cap)\r\n", "stops = int(input())\r\ninside = 0\r\nmax_inside = 0\r\nfor stop in range(stops):\r\n exit, enter = map(int, input().split())\r\n inside -= exit\r\n inside += enter\r\n if inside > max_inside:\r\n max_inside = inside\r\nprint(max_inside)", "cap=0\r\nmax=0\r\nfor _ in range(int(input())):\r\n exitp,entryp=map(int,input().split())\r\n cap+=entryp\r\n cap-=exitp\r\n if cap>max:\r\n max=cap\r\nprint(max)\r\n", "stops = int(input())\r\n\r\ntram_populations = []\r\ntotal_population = 0\r\n\r\nwhile stops > 0:\r\n stops -= 1\r\n \r\n\r\n people = [int(i) for i in input().split()]\r\n getting_off, getting_on = people[0], people[1]\r\n\r\n total_population += (getting_on - getting_off)\r\n tram_populations.append(total_population)\r\n\r\n\r\ntram_populations.sort()\r\nprint(tram_populations[-1])", "n = int(input())\r\nx=0\r\nxList = []\r\nfor i in range(n):\r\n listab = list(map(int,input().split(\" \")))\r\n a = listab [0]\r\n b = listab [1]\r\n x = x + int(-a + b)\r\n xList.append(x)\r\nans = max(xList)\r\nprint(ans)\r\n ", "n = int(input())\r\nout = []\r\nfor i in range(n):\r\n text = input().split()\r\n out.append(text)\r\nnum = []\r\ntotal = 0\r\nfor i in range(n):\r\n total += -int(out[i][0]) + int(out[i][1])\r\n num.append(total)\r\nprint(max(num))\r\n", "n=int(input())\r\ni=0\r\npassenger=0\r\npasg_list=[]\r\n\r\nwhile i<n:\r\n a,b=map(int,input().split())\r\n passenger -= a # left passenger\r\n pasg_list.append(passenger)\r\n passenger += b\r\n pasg_list.append(passenger)\r\n i += 1\r\n \r\n\r\nprint(max(pasg_list))", "A = int(input())\r\nT = 0\r\nM = 0\r\nfor i in range(A):\r\n a, b = map(int, input().split())\r\n T -= a\r\n T += b\r\n if T > M:\r\n M = T\r\n else:\r\n continue\r\nprint(M)", "n = int(input())\nmaxCount = 0\ncurrentPassengerCount = 0\nfor i in range(n):\n a, b = map(int, input().split())\n currentPassengerCount += b - a\n if currentPassengerCount > maxCount:\n maxCount = currentPassengerCount\nprint(maxCount)", "n= int(input())\r\ntotal = 0\r\nl = []\r\nfor i in range(0, n):\r\n get_out, get_in= map(int,input().split())\r\n total +=get_in\r\n total -=get_out\r\n l.append(total) \r\nprint(max(l))", "n=int(input())\r\nstop_tram=[]\r\ndict_total={}\r\nfor i in range(n):\r\n stop_tram.append(list(map(int,input().split())))\r\n if i==0:\r\n dict_total[i]=stop_tram[0][1]\r\n else:\r\n dict_total[i]=dict_total[i-1]-stop_tram[i][0]+stop_tram[i][1]\r\nprint(max(dict_total.values()))", "n=int(input())\r\nc=0\r\nif 2<=n<=1000:\r\n x=[]\r\n for i in range(n):\r\n l=list(map(int,input().strip().split()))\r\n c=c+l[1]-l[0]\r\n x.append(c)\r\n print(max(x))\r\n ", "n = int(input())\r\ncapacity = 0\r\ncapacity_range = []\r\nfor i in range(n):\r\n exit, enter = map(int,input().split())\r\n capacity -= exit\r\n capacity += enter\r\n capacity_range.append(capacity)\r\nprint(max(capacity_range))", "count=0\r\nz=0\r\nfor i in range(int(input())):\r\n a,b =map(int ,input().split())\r\n count+=(b-a)\r\n z=max(count,z)\r\nprint(z)", "num_of_stat = int(input())\r\nstat_pass = [\"0\"] * num_of_stat\r\nmax_pass = 0\r\nmax_pp = 0\r\nfor i in range(num_of_stat):\r\n stat_pass[i] = input().split(\" \")\r\nfor j in stat_pass:\r\n \r\n a = max_pass - int(j[0]) + int(j[1])\r\n \r\n max_pass = a\r\n if max_pp<a:\r\n max_pp = a\r\nprint(max_pp)\r\n\r\n\r\n", "st = int(input())\r\na = int\r\nb = int\r\ncp = 0\r\nnum = 0\r\nfor i in range(st):\r\n text = input()\r\n inp = text.split()\r\n a= int(inp[0])*1\r\n b= int(inp[1])*1\r\n num = max(cp-a+b , num)\r\n cp = cp-a+b\r\n\r\nprint(num)\r\n ", "def find_minimum_capacity(n, stops):\r\n max_capacity = 0\r\n passengers = 0\r\n \r\n for i in range(n):\r\n passengers -= stops[i][0] \r\n passengers += stops[i][1] \r\n max_capacity = max(max_capacity, passengers)\r\n \r\n return max_capacity\r\n \r\n \r\nn = int(input()) \r\nstops = [] \r\nfor i in range(n):\r\n stops.append(list(map(int,input().split())))\r\n \r\nminimum_capacity = find_minimum_capacity(n, stops)\r\nprint(minimum_capacity)", "count = 0\r\nans = 0\r\nfor _ in range(int(input())):\r\n x,y = map(int, input().split())\r\n count = count -x +y\r\n ans = max(ans, count)\r\n\r\nprint(ans)\r\n", "def min(list):\r\n if list[0]<=list[1]:\r\n a=list[1]\r\n else:\r\n a=list[0]\r\n for i in range(2,len(list)-1):\r\n if a<=list[i]:\r\n a=list[i]\r\n else:\r\n a=a\r\n return a\r\n\r\nn=int(input())\r\np,capacity=0,0\r\nlist_p=[]\r\nfor j in range(0,n):\r\n a,b=map(int,input().split())\r\n p=p-a+b\r\n list_p.append(p)\r\ncapacity=min(list_p)\r\nprint(capacity)\r\n", "def minimum_tram_capacity(n, stops):\r\n current_passengers = 0\r\n max_capacity = 0\r\n\r\n for stop in stops:\r\n current_passengers = current_passengers - stop[0] + stop[1]\r\n max_capacity = max(max_capacity, current_passengers)\r\n\r\n return max_capacity\r\n\r\n\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)\r\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\nc = []\r\nfor i in range(n):\r\n c.append(b[i] - a[i])\r\nd = []\r\nfor i in range(n):\r\n if i == 0:\r\n d.append(c[i])\r\n else:\r\n d.append(d[i - 1] + c[i])\r\nprint(max(d))", "n = int(input())\r\nENTER = []\r\nEXIT = []\r\nfor x in range(n):\r\n ex, en = map(int, input().split())\r\n EXIT.append(ex)\r\n ENTER.append(en)\r\n\r\ntotal = 0\r\nmax = 0\r\nfor x in range(n):\r\n total += ENTER[x] - EXIT[x]\r\n if max < total:\r\n max = total\r\nprint(max)\r\n", "# Read the number of stops\r\nn = int(input())\r\n\r\nmax_capacity = 0 # Initialize maximum capacity to 0\r\ncurrent_capacity = 0 # Initialize current capacity to 0\r\n\r\n# Loop through each stop\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n \r\n # Calculate the current capacity after exiting and entering passengers\r\n current_capacity = current_capacity - a + b\r\n \r\n # Update the maximum capacity if the current capacity is greater\r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n# Print the maximum capacity\r\nprint(max_capacity)\r\n", "n = int(input())\r\npassengers_1 = 0\r\npassengers_2 = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers_1 -= a\r\n passengers_1 += b\r\n if passengers_1 > passengers_2:\r\n passengers_2 = passengers_1\r\n\r\nprint(passengers_2)\r\n", "n = int(input())\r\nmaxi=0\r\ncount=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n count-=a\r\n if count <0:\r\n count = 0\r\n count+=b\r\n maxi=max(count,maxi)\r\nprint(maxi) ", "list1 = []\r\nnum3 = 0\r\nfor _ in range(int(input())):\r\n num1, num2 = map(int,input().split())\r\n num3 += num2 - num1\r\n list1.append(num3)\r\nprint(max(list1))", "def find_minimum_capacity(n, stops):\r\n capacity = 0\r\n current_passengers = 0\r\n\r\n for stop in stops:\r\n a, b = stop\r\n current_passengers -= a # Пассажиры выходят\r\n current_passengers += b # Пассажиры заходят\r\n\r\n if current_passengers > capacity:\r\n capacity = current_passengers\r\n\r\n return capacity\r\n\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n stops.append((a, b))\r\n\r\nresult = find_minimum_capacity(n, stops)\r\nprint(result)", "n = int(input())\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\nnum_p = []\r\nfor i in range(n):\r\n num_p.append(b[i]-a[i])\r\n\r\nans = []\r\ntotal = 0\r\nfor i in range(n):\r\n total = total + num_p[i]\r\n ans.append(total)\r\n\r\nprint(max(ans))", "passengers = 0\r\nmaxP = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n passengers += b\r\n passengers -= a\r\n maxP = max(passengers,maxP)\r\nprint(maxP)\r\n", "passengers = max_passengers = 0\r\nfor stop in range(int(input())):\r\n a, b = map(int, input().split())\r\n passengers += b - a\r\n if passengers > max_passengers:\r\n max_passengers = passengers\r\nprint(max_passengers)\r\n", "n = int(input())\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n a.append(ai)\r\n b.append(bi)\r\n\r\nleft = 0\r\nright = sum(b)\r\n\r\nwhile left < right:\r\n mid = (left + right) // 2\r\n passengers = 0\r\n possible = True\r\n \r\n for i in range(n):\r\n passengers -= a[i]\r\n if passengers < 0:\r\n possible = False\r\n break\r\n passengers += b[i]\r\n passengers = min(passengers, mid)\r\n \r\n if possible and passengers == 0:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n\r\nprint(left)\r\n", "n = int(input())\r\n\r\nk = 0 \r\nc = 0 \r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n k -= a \r\n k += b \r\n c = max(c, k)\r\n\r\nprint(c)", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables to keep track of passengers\r\npassengers = 0\r\nmin_capacity = 0\r\n\r\n# Iterate through each stop\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n \r\n # Calculate the number of passengers inside the tram after this stop\r\n passengers = passengers - a + b\r\n \r\n # Update the minimum capacity if needed\r\n min_capacity = max(min_capacity, passengers)\r\n\r\nprint(min_capacity)\r\n", "n=int(input())\r\nc=[]\r\nd=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c.append(b-a)\r\n d.append(sum(c[0:i]))\r\nprint(max(d))", "n=int(input(\"\"))\r\nc=0\r\nmaxcapacity=0\r\nfor i in range(n):\r\n x,y=map(int,input(\"\").split())\r\n c+=y-x\r\n if c>maxcapacity:\r\n maxcapacity=c\r\nprint(maxcapacity)\r\n\r\n", "T=int(input())\r\nA=0\r\nB=0\r\nfor i in range(T):\r\n C,D=map(int,input().split())\r\n B-=C\r\n B+=D\r\n A=max(A,B)\r\nprint(A) ", "n = int(input())\r\ncapacity = 0\r\npassengers_inside = 0\r\nfor _ in range(n):\r\n exiting, entering = map(int, input().split())\r\n passengers_inside = passengers_inside - exiting + entering \r\n capacity = max(capacity, passengers_inside)\r\nprint(capacity)", "n = int(input())\r\ncc = 0\r\nlis = []\r\nfor i in range(n):\r\n x, e = map(int, input().split())\r\n cc = cc - x + e\r\n lis.append(cc)\r\nprint(max(lis))\r\n", "n = int(input())\r\n\r\ncapacity = 0 # Initialize the capacity of the tram\r\npassengers_inside = 0 # Initialize the number of passengers inside the tram\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers_inside = passengers_inside - a + b # Update the number of passengers inside the tram\r\n capacity = max(capacity, passengers_inside) # Update the maximum capacity\r\n\r\nprint(capacity)\r\n", "n = int(input())\r\n\r\ncapacity = 0\r\nmax_capacity = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n capacity -= a\r\n capacity += b\r\n max_capacity = max(max_capacity, capacity)\r\n\r\nprint(max_capacity)", "cnt = 0\r\nans = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n cnt -= a\r\n cnt += b\r\n ans = max(ans,cnt)\r\nprint(ans)", "#116A TRAM\r\npassgrs_on_off = {}\r\n\r\n# Enter the number of stops and for each stop the number of ppl getting off and on\r\nnumber_of_stops = int(input())\r\nfor stop in range(number_of_stops):\r\n passengers_string = input()\r\n passgrs_on_off[stop] = [int(number) for number in passengers_string.split(\" \")]\r\n\r\n#Calculate and store the number of passengers on the tram after leaving a stop\r\naantal_passagiers = 0\r\npassengers_on_train = []\r\nfor stop, (people_getting_off, people_getting_on) in passgrs_on_off.items():\r\n aantal_passagiers = (aantal_passagiers - people_getting_off + people_getting_on)\r\n passengers_on_train.append(aantal_passagiers)\r\n\r\n#Return the max value of passengers on the tram\r\nprint(max(passengers_on_train))\r\n ", "n=int(input())\r\npas=0;cap=0\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n pas=pas-a+b\r\n if pas>cap:\r\n cap=int(pas)\r\nprint(cap)", "a=int(input())\r\nn=0\r\nn_max=0\r\nfor i in range(a):\r\n c,d=input().split()\r\n c=int(c)\r\n d=int(d)\r\n n=n-c+d\r\n if n>n_max:\r\n n_max=n\r\nprint(n_max)", "n=int(input())\r\nlst=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n lst.append([a,b])\r\nnumbers=[]\r\nnumber=0\r\nfor i in range(n):\r\n number=number-lst[i][0]+lst[i][1]\r\n numbers.append(number)\r\nprint(max(numbers))", "n=int(input())\r\na,b =map(int,input().split())\r\npeople=b\r\nmax=people\r\nfor i in range(n-1):\r\n c,d=map(int,input().split())\r\n people=people-c+d\r\n if(people>max):\r\n max=people\r\nprint(max)", "l=[]\r\nfor i in range(int(input())):\r\n L=[int(j) for j in input().split()]\r\n l.append(L)\r\nmax_s=0\r\ncs=0\r\nfor i in range(len(l)):\r\n cs-=l[i][0]\r\n cs+=l[i][1]\r\n if cs>max_s:\r\n max_s=cs\r\nprint(max_s)", "\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 c-=a\r\n c+=b\r\n if(c>m):\r\n m=c\r\nprint(m)\r\n\r\n\r\n\r\n\r\n", "cnt = 0\r\nm = 0\r\nfor _ in range(int(input())):\r\n a,b = map(int,input().strip().split())\r\n cnt -= a\r\n cnt += b\r\n m = max(cnt,m)\r\n\r\nprint(m)", "l=[]\r\nl2=[]\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n l.append(a)\r\n l.append(b)\r\ncounter=0\r\nfor i in range(0,len(l)-1,2):\r\n counter=counter-l[i]+l[i+1]\r\n l2.append(counter)\r\nprint(max(l2))", "c=0\r\nd=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n c+=(b-a)\r\n if c>d:\r\n d=c\r\nprint(d)\r\n", "n = int(input())\r\ncapacity = 0\r\ncount = 0\r\nfor i in range(n):\r\n l,e = map(int, input().split())\r\n count += e-l\r\n capacity = max(capacity, count)\r\nprint(capacity)", "n=int(input())\r\ns=0\r\nmax=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s=s-a+b\r\n if s>max:\r\n max=s\r\nprint(max)", "n = int(input())\r\nres = 0\r\ncount = 0\r\nfor h in range(n):\r\n k , f = map(int ,input().split())\r\n count -= k\r\n count += f\r\n res = count if count > res else res\r\n\r\n\r\nprint(res)", "def main():\r\n mx=0\r\n f=0\r\n for _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n mx-=a\r\n mx+=b\r\n f=max(f,mx)\r\n print(f)\r\nif __name__==\"__main__\":\r\n main()", "x=int(input())\r\nx1=0\r\nl=[]\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n x1=x1+b-a\r\n l.append(x1)\r\nprint(max(l))", "count=0\r\nmaxi=float(\"-inf\")\r\nn=int(input())\r\nfor i in range(n):\r\n\tls=list(map(int, input().split()))\r\n\tcount-=ls[0]\r\n\tcount+=ls[1]\r\n\tif count>maxi:\r\n\t\tmaxi=count\r\nprint(maxi)", "n = int(input())\r\nsum = 0\r\nA = []\r\nfor i in range(n):\r\n a, b =input().split()\r\n a = int(a)\r\n b = int(b)\r\n sum += b - a\r\n A.append(sum)\r\nmax = A[0]\r\nfor i in range(len(A)):\r\n if max < A[i]:\r\n max = A[i]\r\nprint(max)\r\n", "o = int(input())\r\nm = 0\r\nmx = 0\r\nfor i in range(o):\r\n n = input().split(\" \")\r\n ex = int(n[0])\r\n en = int(n[1])\r\n m -= ex\r\n m += en\r\n if mx < m:\r\n mx = m\r\n\r\nprint(mx)\r\n", "n = int(input())\r\n\r\nx = 0\r\nmax = -1\r\nfor i in range(n):\r\n exit, enter = map(int, input().split(' '))\r\n x -= exit\r\n x += enter\r\n if x>max:\r\n max = x\r\n \r\nprint(max)", "n=int(input())\r\ncp=0\r\nmax1=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n cp-=a\r\n cp+=b\r\n max1=max(max1, cp)\r\nprint(max1)\r\n", "n = int(input())\r\ncap, ans = 0, 0\r\nwhile n:\r\n a, b = map(int, input().split())\r\n cap += (b-a)\r\n ans = max(ans, cap)\r\n n-=1\r\nprint(ans)", "n=int(input())\r\ncap=0\r\ncurrent=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n current=current-a+b\r\n cap=max(cap,current)\r\nprint(cap)", "n=int(input())\r\ns=0\r\nm=0\r\nfor i in range(n) :\r\n l=list(map(int, input().split()))\r\n o=l[0]\r\n i=l[1]\r\n s=s-o\r\n s=s+i\r\n m=max(m,s)\r\nprint(m) \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 24 09:45:25 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\nx = 0\r\ncapacity = []\r\n\r\nfor i in range(n):\r\n ab = input().split()\r\n a = int(ab[0])\r\n b = int(ab[1])\r\n \r\n x -= a\r\n x += b\r\n \r\n capacity.append(x)\r\n\r\nprint(max(capacity))", "n = int(input())\r\nstations = []\r\npeople = 0\r\npeopleMax = 0\r\n\r\nfor x in range(n):\r\n stations.append(list(map(int, input().split())))\r\n \r\n\r\nfor station in stations:\r\n people += station[1]\r\n people -= station[0]\r\n if people > peopleMax:\r\n peopleMax = people\r\n \r\n\r\nprint(peopleMax)\r\n\r\n\r\n \r\n", "n = int(input())\r\nentering = [''] * n\r\nexiting = [''] * n\r\nfor i in range(n):\r\n exiting[i],entering[i] = input().split()\r\n exiting[i],entering[i] = int(exiting[i]), int(entering[i])\r\ncurrent = 0\r\nmax = 0\r\nfor i in range(n):\r\n current -= exiting[i]\r\n current += entering[i]\r\n if current > max:\r\n max = current\r\nprint(max)\r\n", "t=int(input())\r\nl=[]\r\ns=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n s+=(b-a)\r\n l.append(s)\r\nprint(max(l))", "n = int(input())\r\nmin_count = 0\r\ncount = 0\r\nfor _ in range(n):\r\n off, on = map(int, input().split())\r\n count = count - off + on\r\n if count > min_count:\r\n min_count = count\r\nprint(min_count)", "n = int(input())\r\n\r\nmax = 0 \r\n\r\ncurrent = 0\r\n\r\nfor i in range(n):\r\n \r\n e = list(map(int, input().split()))\r\n\r\n current -= e[0]\r\n current += e[1]\r\n\r\n if current > max:\r\n\r\n max = current\r\n\r\nprint(max)\r\n", "n = int(input())\r\ncurrent_passengers = 0\r\nmax_passengers = 0\r\nfor loop in range(n):\r\n a, b = map(int, input().split())\r\n current_passengers -= a\r\n current_passengers += b\r\n if current_passengers > max_passengers:\r\n max_passengers = current_passengers\r\nprint(max_passengers)", "stop = int(input())\r\nbus = 0\r\nmin_capacity = 0\r\n\r\nfor x in range(stop):\r\n drop, board = map(int, input().split())\r\n bus = bus - drop + board\r\n\r\n if bus > min_capacity:\r\n min_capacity = bus\r\n\r\nprint(min_capacity)\r\n", "n = int(input())\r\nx = 0\r\nmax = 0\r\ncurrent = 0\r\nwhile x < n:\r\n ab = list(map(int, input().split()))\r\n current -= ab[0]\r\n current += ab[1]\r\n if current > max:\r\n max = current\r\n x +=1\r\n\r\nprint(max)", "n = int(input())\r\nd = 0\r\nmaxd = 0\r\nfor x in range(n):\r\n a, b = map(int, input().split())\r\n d = d - a + b\r\n maxd = max(maxd, d)\r\nprint(maxd)", "n = int(input())\r\n\r\ncapacity = 0\r\ncurrent_passengers = 0\r\n\r\nfor _ in range(n):\r\n # Read the number of exiting and entering passengers at the current stop\r\n exiting, entering = map(int, input().split())\r\n\r\n # Update the current number of passengers inside the tram\r\n current_passengers -= exiting # Subtract the number of exiting passengers\r\n current_passengers += entering # Add the number of entering passengers\r\n\r\n # Update the minimum required capacity if necessary\r\n capacity = max(capacity, current_passengers)\r\n\r\n# Print the minimum possible capacity\r\nprint(capacity)\r\n", "n = int(input())\r\nt, m = 0, 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n if b - a + t > m:\r\n m = t + b - a\r\n t = t + b - a\r\nprint(m)\r\n", "def minimum_tram_capacity(n, stops):\r\n capacity = 0\r\n current_passengers = 0\r\n\r\n for a, b in stops:\r\n current_passengers -= a\r\n current_passengers += b\r\n capacity = max(capacity, current_passengers)\r\n\r\n return capacity\r\n\r\nn = int(input().strip())\r\nstops = [tuple(map(int, input().strip().split())) for _ in range(n)]\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)\r\n", "numberOfLines = int(input())\nresult = 0\ncurrrent = 0\nfor i in range(numberOfLines):\n a, b = map(int, input().split(\" \"))\n currrent -= a\n currrent += b\n result = max(result, currrent)\nprint(result)", "a = int(input())\r\nmax = 0\r\npassag = 0\r\nfor i in range(a):\r\n b, c = map(int, input().split())\r\n passag -= b\r\n passag += c\r\n if passag > max:\r\n max = passag\r\nprint(max)\r\n\r\n", "n = int(input())\r\ncap = 0\r\nsum = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if i == 0:\r\n sum = b\r\n else:\r\n sum = sum + b - a\r\n if sum > cap :\r\n cap = sum\r\n\r\nprint(cap)", "tram = 0\r\ntramoc = 0\r\nfor c in range(int(input())):\r\n stop = [int(c) for c in input().split(' ')]\r\n tram += stop[1]-stop[0]\r\n tramoc = max(tramoc,tram)\r\nprint(tramoc)", "def calculate_minimum_capacity(n, stops):\r\n capacity = 0\r\n current_passengers = 0\r\n\r\n for stop in stops:\r\n exiting_passengers, entering_passengers = stop\r\n current_passengers -= exiting_passengers\r\n current_passengers += entering_passengers\r\n capacity = max(capacity, current_passengers)\r\n\r\n return capacity\r\n\r\n# Read input\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n stop = tuple(map(int, input().split()))\r\n stops.append(stop)\r\n\r\n# Call the function to calculate the minimum capacity\r\nminimum_capacity = calculate_minimum_capacity(n, stops)\r\n\r\n# Print the result\r\nprint(minimum_capacity)\r\n", "n = int(input())\r\n\r\ncap = 0\r\nmax_cap = 0\r\n\r\nfor i in range(n):\r\n j, k = map(int, input().split())\r\n\r\n cap -= j\r\n cap += k\r\n\r\n if cap > max_cap:\r\n max_cap = cap\r\n\r\nprint(max_cap)", "n = int(input())\ncp = 0\nmc = 0\nfor _ in range(n -1):\n ai,bi = map(int,input().split())\n diff = bi - ai\n cp += diff\n mc = max(mc , cp)\nprint(mc)", "n=int(input())\r\nsumtr=0\r\nv=[]\r\nfor _ in range(n):\r\n q=list(map(int,input().split()))\r\n sumtr+=q[1]\r\n sumtr-=q[0]\r\n v.append(sumtr)\r\nv.sort()\r\nprint(v[-1])", "n=int(input())\r\n\r\nmax=0\r\ntot=0\r\n\r\nfor i in range(0,n):\r\n m,n=map(int,input().split())\r\n tot=abs((tot-m)+n)\r\n if tot>max:\r\n max=tot\r\nprint(max)", "n = int(input())\r\nans = 0\r\ncount = 0\r\nwhile n > 0:\r\n n -= 1\r\n s = input().split()\r\n count = count-int(s[0])+int(s[1])\r\n ans = max(ans, count)\r\nprint(ans)\r\n", "# Read input\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncurrent_capacity = 0\r\nmax_capacity = 0\r\n\r\n# Iterate through each stop\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n\r\n # Update the number of passengers inside the tram\r\n current_capacity -= a # Exiting passengers\r\n current_capacity += b # Entering passengers\r\n\r\n # Update the maximum capacity if necessary\r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n# Print the minimum possible capacity\r\nprint(max_capacity)\r\n", "n = int(input())\r\nL = []*n\r\nsuma = 0\r\nM = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n L.append(s.split())\r\n\r\nfor i in range(n):\r\n suma -= int(L[i][0])\r\n suma += int(L[i][1])\r\n if suma > M:\r\n M = suma\r\n\r\nprint(M)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ncurr=0\r\nans=0\r\nfor _ in range(int(input())):\r\n\ta,b=map(int,input().split())\r\n\tcurr-=a\r\n\tcurr+=b\r\n\tans=max(ans,curr)\r\nprint(ans)", "m = 0\r\nc = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n\r\n m = max(m, c-a+b)\r\n c += b-a\r\n\r\nprint(m)", "n = int(input())\r\nnumber=0\r\nl = []\r\nfor i in range(n):\r\n s,e = list(map(int,input().split()))\r\n number+=e\r\n number-=s\r\n l.append(number)\r\nprint(max(l))", "def main():\r\n n = int(input())\r\n capacity = 0 # Initialize the tram's capacity\r\n passengers_inside = 0 # Number of passengers inside the tram\r\n\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers_inside -= a # Passengers exiting\r\n passengers_inside += b # Passengers entering\r\n capacity = max(capacity, passengers_inside) # Update the maximum capacity\r\n\r\n print(capacity)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nmin = 0\r\ntemp_min = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split(\" \"))\r\n min += b - a\r\n if temp_min < min:\r\n temp_min = min\r\nprint(temp_min)", "#In the name of GOD\ndef check_size(old,new):\n\tif old<new: return new\n\telse: return old\n\nn = int(input())\nl = []\nfor i in range(n):\n\tl.append(input().split())\n\t\ncount = 0\nsave = 0\n\nfor i in l:\n\tcount -= int(i[0])\n\tcount += int(i[1])\n\tsave = check_size(save, count)\n\t\nprint(save)\n\t\n", "n=int(input())\r\nlt=[]\r\nfor i in range(n):\r\n temp=input().split()\r\n a=int(temp[0])\r\n b=int(temp[1])\r\n tpl=(a,b)\r\n lt.append(tpl)\r\nnum_of_people=[]\r\ncurrent_num_people=0\r\nfor i in range(n):\r\n current_num_people+=(lt[i][1]-lt[i][0])\r\n num_of_people.append(current_num_people)\r\nnum_of_people.sort()\r\nprint(num_of_people[n-1])", "k = int(input())\r\nres = [[int(x) for x in input().split()]for _ in range(k)]\r\nmax = count = 0\r\nfor i in range(k):\r\n count = count - res[i][0]\r\n count = count + res[i][1]\r\n if count > max:\r\n max = count\r\nprint(max)", "n=int(input())\r\nc=0\r\ng=0\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n c=c-x\r\n c=c+y\r\n g=max(g,c)\r\n\r\nprint(g)", "n = int(input())\r\n\r\nexit = []\r\nenter = []\r\nfor i in range(n):\r\n exit_p, enter_p = map(int, input().split())\r\n exit.append(exit_p)\r\n enter.append(enter_p)\r\n\r\ncapacity = 0\r\nlist_cap = []\r\n\r\nfor i in range(n):\r\n capacity -= exit[i]\r\n capacity += enter[i]\r\n list_cap.append(capacity)\r\nprint(max(list_cap))\r\n", "no = input()\r\nmax = 0\r\ntotal = 0\r\nfor c in range(int(no)):\r\n a = input()\r\n num = 0\r\n while a[num] != \" \":\r\n n = a[:num + 1]\r\n endn = num + 2\r\n num = num + 1\r\n num = num + 1\r\n while num < len(a):\r\n if a[num] != \" \":\r\n k = a[endn:num + 2]\r\n num = num + 1\r\n total = total - int(n) + int(k)\r\n if max < total:\r\n max = total\r\nprint(max)", "n=int(input())\r\ncnt,o=0,0\r\nfor i in range(1,n):\r\n t=[int(i)for i in input().split()]\r\n cnt-=t[0]\r\n cnt+=t[1]\r\n o=max(o,cnt)\r\nprint(o)\r\n", "s=0\r\nl=[]\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n s-=a\r\n s+=b\r\n l.append(s)\r\nprint(max(l))\r\n ", "n=int(input())\r\nl=[]\r\ne=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\te+=b-a\r\n\tl.append(e)\r\nprint(max(l))", "cur, num = 0, []\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n cur = cur - a + b\r\n num.append(cur)\r\n\r\nprint(max(num))", "lines = int(input())\r\nl = []\r\nfor i in range(lines):\r\n l.extend(input().split())\r\npassengers = 0\r\nminimum = 0\r\nfor i in range(len(l)):\r\n num = int(l[i])\r\n if i % 2 == 0:\r\n passengers -= num\r\n else:\r\n passengers += num\r\n if passengers > minimum:\r\n minimum = passengers\r\nprint(minimum)\r\n \r\n", "n = int(input())\r\nin_tram = 0\r\nmax = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n in_tram += b-a\r\n if max < in_tram:\r\n max = in_tram\r\n \r\nprint(max)", "x=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n c=c-a+b\r\n l.append(c)\r\nprint(max(l))", "rest=[]\r\nfin=0\r\nfor _ in range(int(input())):\r\n \r\n x,y=map(int,input().split())\r\n fin+=y-x\r\n rest.append(fin) \r\n \r\nprint(max(rest))", "n = int(input())\r\na = []\r\nb = []\r\nc = []\r\nfor i in range(n):\r\n\tk, l = map(int, input().split())\r\n\ta.append(l)\r\n\tb.append(k)\r\nmaxx = 0\r\nc.append(a[0])\r\nfor i in range(1, n):\r\n\tc.append(c[i - 1] + a[i] - b[i])\r\nprint(max(c))\t\r\n\t\r\n\t", "n = int(input())\r\nans = 0\r\nans_1 = []\r\nfor i in range(n):\r\n ext,ent = map(int,input().split(\" \"))\r\n ans = (ans-ext)+ent\r\n ans_1.insert(0,ans)\r\nprint(max(ans_1))", "pasajeros = 0\r\ncapacidad_min = 0\r\nfor _ in range(int(input())):\r\n nums = [int(x) for x in input().split(' ')]\r\n pasajeros -= nums[0]\r\n pasajeros += nums[1]\r\n if pasajeros > capacidad_min:\r\n capacidad_min = pasajeros\r\nprint(capacidad_min)", "stop_number = int(input())\ncount = 0\nmaximum = 0\nfor i in range(stop_number):\n num = list(map(int, input().split(' ')))\n count = count + num[1] - num[0]\n if maximum < count:\n maximum = count\nprint(maximum)", "n=int(input())\r\nls=[]\r\nfor i in range(n):\r\n row=input().split()\r\n ls.append(row)\r\n#print(ls)\r\nans=0\r\nmx=0\r\nfor i in range(n):\r\n ans=ans-int(ls[i][0])\r\n ans+=int(ls[i][1])\r\n if ans>mx:\r\n mx=ans \r\nprint(mx)", "n = int(input())\r\npassengers_inside = 0\r\nmax_capacity = 0\r\nfor _ in range(n):\r\n exit_count, enter_count = map(int, input().split())\r\n passengers_inside -= exit_count\r\n passengers_inside += enter_count\r\n max_capacity = max(max_capacity, passengers_inside)\r\nprint(max_capacity)\r\n", "t=int(input())\r\np=0\r\nq=0\r\nfor j in range(t):\r\n c,d=map(int,input().split())\r\n q-=c\r\n q+=d\r\n p=max(p,q)\r\nprint(p) ", "bucles = int(input())\r\nmax = 0\r\npas = 0\r\n\r\nfor i in range(bucles):\r\n list = []\r\n vars = input()\r\n list = vars.split(\" \")\r\n pas = pas - int(list[0]) + int(list[-1])\r\n if pas > max:\r\n max = pas\r\n\r\nprint(max)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n l.append(a)\r\nmax=int(0)\r\nc=int(0)\r\nfor i in range(n):\r\n c=c-l[i][0]\r\n c+=l[i][1]\r\n if max<c:\r\n max=c\r\nprint(max)", "n = int(input())\r\ncapacity = 0\r\npassengers_inside = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers_inside = passengers_inside - a + b # Update passengers inside the tram\r\n capacity = max(capacity, passengers_inside) # Update the minimum capacity\r\n\r\nprint(capacity)\r\n", "n = int(input())\r\nx = 0\r\nv = 0 \r\nfor i in range(n):\r\n s = (input()).split()\r\n a = int(s[0])\r\n b = int(s[1])\r\n x = x - a + b\r\n if x > v:\r\n v = x\r\nprint(v)", "n = int(input())\r\n\r\ninput_array = []\r\n\r\ni_a = []\r\n\r\nwhile n > 0:\r\n array_list = list(map(int, input().split()))\r\n input_array.append(array_list)\r\n n = n - 1\r\n\r\nmax_number = 0\r\nperson_count = 0\r\nfor a in input_array:\r\n person_count = person_count - a[0] + a[1]\r\n if max_number < person_count:\r\n max_number = person_count\r\n\r\nprint(max_number)\r\n", "n=int(input())\r\nx=0 \r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x+=b-a \r\n l.append(x)\r\nprint(max(l))\r\n ", "a = int(input())\r\nm = -1\r\npeoples = 0\r\nfor i in range(a):\r\n b, c = map(int, input().split())\r\n peoples -= b\r\n peoples += c\r\n if peoples > m:\r\n m = peoples\r\n\r\nprint(m)\r\n", "\nn = int(input())\noptimal = 0\ncurrent = 0\nfor i in range(n):\n a, b = list(map(int, input().split(' ')))\n if i == 0:\n current = b\n optimal = current\n else:\n current = current - a + b\n if current > optimal:\n optimal = current\nprint(optimal)\n ", "n=int(input(\"\"))\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nl=[]\r\nfor i in range(n):\r\n a=input(\"\").split()\r\n count1+=int(a[1])\r\n count2+=int(a[0])\r\n count3=count1-count2\r\n l.append(count3)\r\nprint(max(l))", "n = int(input())\nans = 0\ncnt = 0\nfor _ in range(n):\n a, b = map(int, input().split())\n cnt += b-a\n ans = max(ans, cnt)\nprint(ans)", "n=int(input())\r\nr=0\r\nz=r\r\nfor i in range(n):\r\n e, i= map(int, input().split())\r\n r=r+(i-e)\r\n if(z<r):\r\n z=r\r\n \r\n \r\nprint(z)\r\n", "# Read input\r\nn = int(input())\r\n\r\n# Initialize variables\r\ncurrent_passengers = 0\r\nmax_capacity = 0\r\n\r\n# Iterate through stops\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_passengers += (b - a) # Calculate the number of passengers inside\r\n max_capacity = max(max_capacity, current_passengers) # Update maximum capacity\r\n\r\n# Print the result\r\nprint(max_capacity)\r\n", "aon=ppp=0\r\nfor x in[0]*int(input()):ppp-=eval(input().replace(' ','-'));aon=max(aon,ppp)\r\nprint(aon)", "n = int(input())\r\n\r\nmaximum_capacity = 0\r\ncurrent_capacity = 0\r\n\r\nfor _ in range(n):\r\n exiting_passengers, entering_passengers = map(int, input().split())\r\n current_capacity -= exiting_passengers\r\n current_capacity += entering_passengers\r\n maximum_capacity = max(maximum_capacity, current_capacity)\r\n\r\nprint(maximum_capacity)", "s = int(input())\r\nnum = 0\r\ncap = []\r\nfor i in range(s):\r\n a, b = map(int,input().split())\r\n num -= a\r\n num += b\r\n cap.append(num)\r\nprint(max(cap))", "n=int(input())\r\nc=0\r\nm=0\r\nwhile(n):\r\n\ta,b=map(int,input().split())\r\n\tc=c-a+b\r\n\tm=max(m,c)\r\n\tn-=1\r\nprint(m)", "b=p=0\r\nfor x in[0]*int(input()):p-=eval(input().replace(' ','-'));b=max(b,p)\r\nprint(b)", "count_stops = int(input())\r\nmax_place = 0\r\ncurrent_place = 0\r\nfor i in range(count_stops):\r\n string_out, string_in = map(int, input().split())\r\n current_place -= string_out\r\n current_place += string_in\r\n if current_place > max_place:\r\n max_place = current_place\r\nprint(max_place)", "if __name__ == '__main__':\r\n n = int(input())\r\n\r\n max_capacity = 0\r\n current_capacity = 0\r\n\r\n for _ in range(n):\r\n exit, enter = map(int, input().split())\r\n current_capacity += enter - exit\r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n print(max_capacity)\r\n", "n = int(input())\r\ncapacity = 0\r\nmax_capacity = float('-inf')\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n capacity += b - a\r\n max_capacity = max(capacity, max_capacity)\r\nprint(max_capacity)", "n = int(input()) # Number of stops\r\n\r\nmin_capacity = 0 # Initialize minimum capacity\r\ncurrent_capacity = 0 # Initialize current capacity\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_capacity = current_capacity - a + b # Update current capacity\r\n min_capacity = max(min_capacity, current_capacity) # Update minimum capacity\r\n \r\nprint(min_capacity)\r\n", "n = int(input())\r\ncount=0\r\nhigh=0\r\nfor i in range(0,n):\r\n leave,enter =map(int,input().split(' '))\r\n count-=leave\r\n count+=enter\r\n if count>high: high=count\r\n\r\nprint(high)", "n = int(input())\r\n\r\ncapacity_tracker = []\r\ncapacity = 0\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n capacity = capacity - a + b\r\n capacity_tracker.append(capacity)\r\n\r\nprint(max(capacity_tracker))\r\n", "n=int(input());p=m=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n p=p-a+b\r\n m=max(m,p)\r\nprint(m)", "n=int(input())\r\ncapcity=0\r\npassengers=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n passengers-=a\r\n passengers+=b\r\n capcity=max(capcity,passengers)\r\n\r\nprint(capcity)", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n n = int(input())\r\n ans = 0\r\n curr_pass = 0\r\n for i in range(n):\r\n x, y = list(map(int, input().split()))\r\n curr_pass -= x\r\n curr_pass += y\r\n if curr_pass > ans:\r\n ans = curr_pass\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "stations = int(input())\nm = 0\np = 0\nfor i in range(stations):\n c ,t = map(int, input().split())\n p = p - c + t\n if p > m:\n m = p\nprint(m)", "n = int(input())\r\nnum = 0\r\narr = []\r\ncount = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n count = count - a + b\r\n arr.append(count)\r\n\r\n\r\nprint(max(arr))", "num = int(input())\r\nall = 0\r\nmost = 0\r\n\r\nfor i in range(num):\r\n row = input().split()\r\n a = int(row[0])\r\n b = int(row[1])\r\n all = all - a + b\r\n if all > most: most = all\r\n \r\nprint(most)", "n = int(input())\r\npas = 0\r\nk = 0\r\nfor i in range (n):\r\n x, y = input().split(\" \")\r\n pas -= int(x)\r\n pas += int(y)\r\n if pas > k:\r\n k = pas\r\nprint (k)", "n = int(input())\r\ntemp = 0\r\nres = 0\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\ttemp -= a\r\n\ttemp += b\r\n\tif res < temp:\r\n\t\tres = temp\r\nprint(res)\r\n\r\n", "s = int(input())\nq = []\nfor i in range(s):\n a, b = map(int, input().split())\n q.append([a, b])\nm = 0\np = 0\nfor i in range(len(q)):\n a = q[i]\n p += a[1] - a[0]\n if p > m:\n m = p\nprint(m)", "n=int(input())\r\nmax=0\r\nsum=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n sum=sum+b-a\r\n if(sum>max):\r\n max=sum\r\nprint(max)", "n = int(input())\r\nans = 0\r\ncnt = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n cnt = cnt - a + b\r\n ans = max(ans, cnt)\r\nprint(ans)", "n=int(input())\r\nmax=0\r\ncustomer=0\r\nfor i in range(n):\r\n temp=input().split()\r\n customer-=int(temp[0])\r\n customer+=int(temp[1])\r\n max=customer if customer>max else max\r\nprint(max)", "n=input()\r\nperson = 0\r\nmax = 0\r\nfor i in range(int(n)):\r\n a,b = list(map(int, input().split()))\r\n person = (person-a)+b\r\n if person>max:\r\n max = person\r\nprint(max)\r\n\r\n\r\n", "t = int(input())\r\ntrain = 0\r\nmaxCapacity = 0\r\nfor i in range(t):\r\n Pexit,Penters = map(int,input().split())\r\n train -= Pexit\r\n train += Penters\r\n maxCapacity = max(maxCapacity,train)\r\nprint(maxCapacity)\r\n \r\n ", "n = int(input()) \r\npassenger_count = 0 \r\nmax_capacity = 0 \r\n\r\nfor _ in range(n):\r\n exit_count, enter_count = map(int, input().split())\r\n passenger_count = passenger_count - exit_count + enter_count \r\n max_capacity = max(max_capacity, passenger_count) \r\n\r\nprint(max_capacity)\r\n", "result = \"\"\r\nn = int(input())\r\ntotal = 0\r\nsizes = []\r\nfor x in range(n):\r\n a,b = input().split(\" \")\r\n a = int(a)\r\n b = int(b)\r\n total -= a\r\n total += b\r\n sizes.append(total)\r\nresult = max(sizes)\r\nprint(f\"{result}\")", "n=int(input())\r\nl=[]\r\nfor i in range(0,n):\r\n x=list(map(int,input().split()))\r\n l.append(x)\r\nsol=0\r\nk=[]\r\nfor i in l:\r\n z=i[1]-i[0]\r\n sol=sol+z\r\n k.append(sol)\r\nprint(max(k))", "t = int(input())\r\nb = 0\r\ns = 0\r\nfor i in range(t):\r\n\ta = list(map(int,input().split()))\r\n\tb = b-a[0]\r\n\tb = b+a[1]\r\n\tif b>s:\r\n\t\ts = b\r\nprint(s)", "a = int(input())\r\ns = 0\r\nm = []\r\nfor i in range(a):\r\n b = input().split()\r\n c = int(b[0])\r\n d = int(b[1])\r\n s = s - c + d\r\n m.append(s)\r\nprint(max(m))\r\n", "\"\"\"\r\nCalculate the maximum number of people\r\non the tram between stops. The highest\r\nnumber is our capacity.\r\n\r\nFor example, if out of 4 stops the 3rd\r\nstop requires space for 10 people, and \r\nthe third stop has the most people, then\r\n10 is the answer.\r\n\r\nThis problem requires us to carry over\r\npeople from previous stops and analyze\r\nwhich stop has the most people.\r\n\r\nThe first input is people getting off\r\nThe second input is people getting on.\r\nPeople who leave always get off before\r\npeople enter. \r\n\"\"\"\r\n\r\njudgeInput = input()\r\n\r\n\r\ndef maxCapacity():\r\n capacity = 0\r\n maxCapacity = 0\r\n for n in range(int(judgeInput)):\r\n currentPassengers = input()\r\n passengerList = currentPassengers.split()\r\n passengersLeaving = int(passengerList[0])\r\n passengersEntering = int(passengerList[1])\r\n\r\n capacity -= passengersLeaving\r\n capacity += passengersEntering\r\n\r\n if capacity > maxCapacity:\r\n maxCapacity = capacity\r\n\r\n return maxCapacity\r\n\r\n\r\noutput = maxCapacity()\r\n\r\nprint(output)\r\n", "def minimum_tram_capacity(n, stops):\r\n capacity = 0\r\n current_count = 0\r\n\r\n for stop in stops:\r\n current_count -= stop[0] # passengers exit\r\n current_count += stop[1] # passengers enter\r\n capacity = max(capacity, current_count)\r\n\r\n return capacity\r\n\r\n\r\nn = int(input())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nresult = minimum_tram_capacity(n, stops)\r\nprint(result)\r\n", "mn = [0]\r\nfor i in range(int(input())):\r\n x = list(map(int,input().split()))\r\n mn.append(mn[-1]+(x[1]-x[0]))\r\nprint(max(mn))\r\n", "n=int(input())\r\nc=0\r\np=0\r\nfor _ in range(n):\r\n E,e=map(int,input().split())\r\n p=p-E+e\r\n c=max(c,p)\r\nprint(c)", "start = 0\r\nfind = []\r\nfor stops in range(int(input())):\r\n exits, enter = map(int, input().split())\r\n start += enter\r\n start -= exits\r\n find.append(start)\r\nprint(max(find))\r\n", "n=int(input())\r\ncount0=0\r\ncount1=0\r\nwhile n!=0:\r\n a,b=map(int,input().split())\r\n count0=count0-a+b\r\n if count0>count1:\r\n count1=count0\r\n n-=1\r\nprint(count1)", "n=int(input())\r\nnow,max=0,0\r\nfor i in range(n):\r\n down,up=map(int,input().split())\r\n now=now+up-down\r\n if now>max:\r\n max=now\r\nprint(max)", "t = int(input())\r\ncap = 0\r\nmaxc = 0\r\nwhile t > 0:\r\n a, b = map(int, input().split())\r\n cap = cap + b - a\r\n maxc = max(cap, maxc)\r\n t -= 1\r\nprint(maxc)\r\n", "import sys\r\nstdin = sys.stdin.read().splitlines()\r\ndel stdin[0]\r\nn=0\r\nc=0\r\nfor i in stdin:\r\n a, b = map(int, i.split())\r\n c += b - a\r\n n = max(n, c)\r\nprint(str(n))", "n = int(input()) # Number of stops\r\ncurrent_passengers = 0 # Current number of passengers inside the tram\r\nmin_capacity = 0 # Minimum capacity of the tram\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_passengers += b - a # Update the number of passengers inside the tram\r\n min_capacity = max(min_capacity, current_passengers) # Update the minimum capacity\r\n\r\nprint(min_capacity)\r\n", "mx = 0\nsum = 0\nn = int(input())\nfor i in range(n):\n a,b = input().split()\n a = int(a)\n b = int(b)\n sum -= a\n sum += b\n mx = max(mx , sum)\nprint(mx)\n \t \t \t\t\t\t\t\t\t \t \t", "def code(*args):\r\n \r\n arr = args[0]\r\n n = args[1]\r\n current_passengers = 0\r\n max_capacity = 0\r\n\r\n for i in range(n):\r\n current_passengers += -arr[i][0] + arr[i][1]\r\n max_capacity = max(max_capacity, current_passengers)\r\n\r\n return max_capacity\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n number_of_stops = int(input())\r\n\r\n arr = []\r\n for i in range(number_of_stops):\r\n arr.append(list(map(int, input().split())))\r\n \r\n result = code(arr, number_of_stops) # Pass arguments\r\n print(result)\r\n\r\n", "n = int(input())\r\n\r\nans = -1\r\ntemp = 0\r\nfor i in range (0,n):\r\n a,b = map(int,input().split())\r\n temp = temp-a+b;\r\n ans = max(temp,ans)\r\n\r\nprint(ans)", "n = int(input())\r\nstops = []\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n stops.append((a, b))\r\n\r\ncapacity = 0\r\npassengers = 0\r\n\r\nfor stop in stops:\r\n passengers -= stop[0]\r\n passengers += stop[1]\r\n capacity = max(capacity, passengers)\r\n\r\nprint(capacity)\r\n", "capacity , place = 0 , 0\r\n\r\nfor i in range(int(input())):\r\n a , b = map(int , input().split())\r\n place -= a\r\n capacity = max(capacity , place)\r\n place += b\r\n capacity = max(capacity , place)\r\nprint(capacity)", "\r\nn = int(input())\r\n\r\nmax_capacity = 0\r\ncurrent_capacity = 0\r\n\r\n\r\nfor _ in range(n):\r\n \r\n exiting, entering = map(int, input().split())\r\n \r\n \r\n current_capacity -= exiting\r\n current_capacity += entering\r\n \r\n \r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n\r\nprint(max_capacity)\r\n", "def main():\n num_lines = int(input())\n\n cur_people = 0\n max_in_train = -1\n\n for _ in range(num_lines):\n people_leaving, people_entering = map(int, input().split())\n cur_people = cur_people - people_leaving + people_entering\n\n if cur_people > max_in_train:\n max_in_train = cur_people\n\n print(max_in_train)\n\n\nif __name__ == \"__main__\":\n main()", "n, passengers, res = int(input()), 0, 0\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n passengers = passengers + b - a\r\n if passengers > res:\r\n res = passengers\r\nprint(res)\r\n", "n=int(input())\r\ncapacity = 0\r\npassengers = 0\r\n\r\nfor i in range(n):\r\n a,b=map(int , input().split())\r\n\r\n passengers -= a # passengers exit the tram\r\n passengers += b # passengers enter the tram\r\n\r\n capacity=max(capacity,passengers) # update capacity if necessary \r\n\r\nprint(capacity)\r\n", "n=int(input())\r\nenter=[]\r\nexit=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n enter.append(b)\r\n exit.append(a)\r\nmaxi=0\r\np=0\r\nfor i in range(n):\r\n p-=exit[i]\r\n p+=enter[i]\r\n if p>maxi:\r\n maxi=p \r\nprint(maxi)\r\n ", "n=int(input())\r\nd=0\r\nf=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d=d-a+b\r\n if d>f:\r\n f=d\r\nprint(f)", "arr = []\r\ncap = 0\r\nfor i in range(int(input())):\r\n out, inn = map(int,input().split())\r\n cap -= out\r\n cap+= inn\r\n arr.append(cap)\r\nprint(max(arr))\r\n ", "a=int(input())\r\nn=0\r\ns=[]\r\nfor _ in range(a):\r\n c,b=map(int,input().split())\r\n n-=c\r\n n+=b\r\n s.append(n)\r\nprint(max(s))", "n = int(input())\r\nc = mc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n c = c - a + b\r\n mc = max(mc, c)\r\nprint(mc)\r\n", "n=int(input())\r\nl=[]\r\nd=0\r\nfor i in range(n):\r\n ai,bi=map(int,input().split())\r\n c=bi-ai\r\n d=d+c\r\n l.append(d)\r\nprint(max(l))", "n=int(input())\r\nd=0\r\nl=[0]*n\r\nfor i in range(n):\r\n\tm= input().split(\" \")\r\n\t\r\n\tx=m[0]\r\n\ty=m[1]\r\n\td=d+int(y)-int(x)\r\n\tl[i]=d\r\nprint(max(l))\r\n ", "n = int(input())\r\n\r\nmatrix = []\r\nfor i in range(n) :\r\n a = list(input().split(\" \"))\r\n matrix.append(a)\r\n\r\nmax1 = 0\r\ncount= 0\r\n\r\nfor i in range(n):\r\n b = matrix[i]\r\n count = count - int(b[0])\r\n count = count + int(b[1])\r\n max1 = max(count, max1)\r\n\r\nprint(max1)", "t=int(input())\r\ntot=0\r\nm=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n tot=tot+b-a\r\n if tot>m:\r\n m=tot\r\nprint(m)", "'''\r\n==TEST CASE==\r\nInput:\r\n3\r\nRRG\r\n\r\nOutput:\r\n1\r\n'''\r\nn=int(input())\r\ninTram=0\r\nmax=0\r\n\r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n inTram-=a\r\n inTram+=b\r\n if inTram>max:\r\n max=inTram\r\n\r\nprint(max)", "def daozhan(a,b,x):\r\n x=x-a\r\n x=x+b\r\n return x\r\nn=int(input())\r\ns=0\r\ncapacity=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s=daozhan(a, b, s)\r\n capacity=max(capacity,s)\r\nprint(capacity)\r\n \r\n ", "n = int(input())\r\nres = 0\r\ncnt = 0\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n cnt += b - a\r\n res = max(res, cnt)\r\nprint(res)", "a = int(input())\r\nk = 0\r\ns = []\r\nfor i in range(a):\r\n x, z = map(int, input().split())\r\n k = k + z - x\r\n s.append(k)\r\nprint(max(s))", "n = int(input())\r\nt, ans = 0, 0\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tt -= a\r\n\tt += b\r\n\tans = max(t, ans)\r\nprint(ans)", "# Input Integer\r\nn = int(input())\r\n\r\nmin_capacity = 0\r\ncount = 0\r\n\r\nfor i in range(n):\r\n a, b = input().split()\r\n count -= int(a)\r\n count += int(b)\r\n min_capacity = max(min_capacity, count)\r\n\r\nprint(min_capacity)", "njrkhgi = int(input())\r\nckjvdhfgsriu = 0\r\n#maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\n#maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\nmaxbchkjsfuarh = 0\r\n \r\n #maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\n #maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\n #maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\nfor _ in range(njrkhgi):\r\n #maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\n bhjrgfkaa, bkjkfjahlb = map(int, input().split())\r\n #maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\n ckjvdhfgsriu -= bhjrgfkaa\r\n #maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\n ckjvdhfgsriu += bkjkfjahlb\r\n #maxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarhmaxbchkjsfuarh\r\n maxbchkjsfuarh = max(maxbchkjsfuarh, ckjvdhfgsriu)\r\n \r\nprint(maxbchkjsfuarh)", "t=0\r\nm=0\r\nx=int(input())\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n t+=(a-b)\r\n m=min(m,t)\r\nprint(abs(m))", "n=int(input())\r\nsum=0\r\nlist=[]\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n sum+=b-a\r\n list.append(sum)\r\nprint(max(list))", "i=int(input())\r\nn=0\r\nmax1=0\r\nwhile(i):\r\n str1=input()\r\n l=str1.split()\r\n n=n-int(l[0])+int(l[1])\r\n if n>max1:\r\n max1=n\r\n i-=1\r\nprint(max1)", "n=int(input())\r\nc=C=0\r\nwhile(n>0):\r\n n-=1 \r\n a,b=map(int,input().split())\r\n c=c-a+b\r\n if(c>C):\r\n C=c\r\nprint(C)", "x = int(input())\r\n\r\nnum = 0\r\nmax = 0\r\n\r\nfor i in range(x):\r\n y = list(map(int,input().split()))\r\n num -= y[0]\r\n num += y[1]\r\n if num > max:\r\n max = num\r\n\r\nprint(max) ", "a=int(input())\r\nw=0\r\nj=0\r\nfor i in range(a):\r\n p,q=map(int, input().split())\r\n w=w-p+q\r\n if w>j:\r\n j=w\r\nprint(j)", "content = []\r\na = int(input())\r\notb = 0\r\nmaximum = 0\r\n\r\nfor i in range(a):\r\n content.append([int(x) for x in input().split()])\r\n\r\nfor i in range(a):\r\n otb -= content[i][0]\r\n if otb > maximum:\r\n maximum = otb\r\n otb += content[i][1]\r\n if otb > maximum:\r\n maximum = otb\r\n\r\nprint(maximum)", "n = int(input())\r\nmx = 0\r\nans = 0\r\nfor i in range(n):\r\n e, s = map(int, input().split())\r\n ans = ans - e + s\r\n if ans > mx:\r\n mx = ans\r\nprint(mx)", "list1=[]\r\ntest=int(input())\r\ninitial=0\r\nfor i in range(test):\r\n a,b=map(int ,input().split())\r\n initial+=b-a\r\n list1.append(initial)\r\n \r\nprint(max(list1))", "import sys\r\n\r\nuser_input = int(sys.stdin.readline().strip())\r\n\r\ncount = 0\r\nss = 0\r\nmax_sum = 0\r\n\r\nfor i in range(user_input):\r\n a, b = map(int, sys.stdin.readline().strip().split())\r\n count -= a\r\n count += b\r\n if count > ss:\r\n ss = count\r\nprint(ss)", "n=int(input())\r\nt=0\r\ne=0\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n t=t-a+b\r\n if e<t:\r\n e=t\r\nprint(e)", "stop = int(input())\r\ncapacity = 0 \r\ncount_pas = 0\r\nfor i in range(stop):\r\n out, inp = map(int, input().split())\r\n count_pas = count_pas + inp - out\r\n if count_pas > capacity:\r\n capacity = count_pas\r\nprint(capacity)\r\n", "n = int(input())\r\nsum = 0\r\nmx = 0\r\nfor i in range(n):\r\n l = input().split()\r\n a = int(l[0])\r\n b = int(l[1])\r\n sum += b\r\n sum -= a\r\n if sum > mx:\r\n mx = sum\r\nprint(mx)", "\r\nt=int(input())\r\ncounter=0\r\nlst=[]\r\nfor i in range(t):\r\n a,b=map(int,input().split(\" \"))\r\n counter+=(b-a)\r\n lst.append(counter)\r\n\r\nprint(max(lst))", "x=int(input())\r\nall=[0]\r\nfor y in range(x):\r\n a,b=map(int,input().split())\r\n all.append(-a+b+all[-1])\r\nall.sort()\r\nprint(all[-1])", "from functools import reduce\nfrom typing import List, Tuple\n\n\ndef main() -> None:\n n: int = int(input())\n list_: List[Tuple[int, int]] = list(\n map(lambda i: tuple(map(lambda x: int(x), input().split())), range(0, n))\n )\n print(min_capacity(n, list_))\n\n\ndef min_capacity(n: int, list_: List[Tuple[int, int]]) -> int:\n def reduce_find(acc: Tuple[int, int], item: Tuple[int, int]) -> Tuple[int, int]:\n (mx, cur) = acc\n (n_exit, n_enter) = item\n cur += n_enter - n_exit\n mx = max(mx, cur)\n return (mx, cur)\n\n (mx, cur) = reduce(reduce_find, list_, (0, 0))\n return mx\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\ncapacity = 0\r\nmax_capacity = 0\r\n\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n capacity -= ai\r\n capacity += bi\r\n max_capacity = max(max_capacity, capacity)\r\n\r\nprint(max_capacity)", "def tram():\r\n # save the max number of the tram\r\n n=int(input())\r\n initialInside=0\r\n maxNum=0\r\n for i in range(n):\r\n a,b=map(int,input().split())\r\n initialInside-=a\r\n initialInside+=b\r\n if initialInside>maxNum:\r\n maxNum=initialInside\r\n return maxNum\r\n\r\nprint(tram())", "def minimum_tram_capacity(n, stops):\r\n current_passengers = 0\r\n max_passengers = 0\r\n\r\n for stop in stops:\r\n current_passengers -= stop[0] # Exiting passengers\r\n current_passengers += stop[1] # Entering passengers\r\n max_passengers = max(max_passengers, current_passengers)\r\n\r\n return max_passengers\r\n\r\nn = int(input().strip())\r\nstops = [tuple(map(int, input().split())) for _ in range(n)]\r\nprint(minimum_tram_capacity(n, stops))\r\n", "def calculate_m(n, stops):\r\n max_capacity = 0\r\n current_capacity = 0\r\n\r\n for stop in stops:\r\n exiting_passengers, entering_passengers = stop\r\n current_capacity += entering_passengers - exiting_passengers\r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n return max_capacity\r\n\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n stops.append((a, b))\r\n\r\nresult = calculate_m(n, stops)\r\nprint(result)\r\n", "a=b=max=0\r\nd=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n d=d-a+b\r\n if d>=max:\r\n max=d\r\nprint(max)", "n = int(input())\r\npassengers = 0\r\ncapacity = 0\r\nmax_capacity = 0\r\n\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n passengers = passengers - ai + bi\r\n max_capacity = max(max_capacity, passengers)\r\n\r\nprint(max_capacity)", "k=int(input())\r\ncount=0\r\nmaxl=[]\r\nfor i in range(k):\r\n l=list(map(int,input().split()))\r\n count=count-l[0]+l[1]\r\n maxl.append(count)\r\nprint(max(maxl))\r\n \r\n", "num = int(input())\r\ncurrent_num = 0\r\ncount = []\r\npeople = 0\r\n\r\nwhile current_num < num:\r\n list_0 = input().split()\r\n people = people - int(list_0[0]) + int(list_0[1])\r\n count.append(people)\r\n current_num += 1\r\n \r\nprint(max(count))", "from sys import stdin\r\n\r\n\r\nn = int(stdin.readline())\r\nres = cur = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, stdin.readline().split())\r\n cur += b - a\r\n res = max(res, cur)\r\n\r\nprint(res)\r\n", "n = int(input())\r\nresult = []\r\nfor i in range(n):\r\n number = list(map(int,input().split()))\r\n result.append((number[0],number[1]))\r\n \r\n\r\n \r\n \r\n\r\ncapacity = []\r\nfor i in range(len(result)):\r\n if i == 0:\r\n capacity.append(result[i][1] - result[i][0])\r\n else:\r\n capacity.append(capacity[i-1] + result[i][1] - result[i][0])\r\n \r\nprint(max(capacity))", "n = int(input())\r\n\r\ncount = 0\r\n\r\ns = []\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n count -= x \r\n count += y\r\n s.append(count)\r\n \r\n \r\nprint(max(s))", "a = int(input())\r\nb = []\r\nc = []\r\nfor i in range(0,a):\r\n e=(input())\r\n d=e.split( )\r\n b.append(d)\r\nn = int(b[0][1])-int(b[0][0])\r\nc.append(n)\r\nfor i in range(1,len(b)):\r\n n += (int(b[i][1])-int(b[i][0]))\r\n c.append(n)\r\nprint(max(c))", "n = int(input()) \r\nmaximum = 0 \r\ncurrent = 0 \r\nfor i in range(n):\r\n a, b = map(int, input().split()) \r\n current = current - a + b \r\n maximum = max(maximum, current) \r\nprint(maximum)\r\n", "c=0\r\nm=0\r\nfor _ in range(int(input())):\r\n x,e=map(int,input().split())\r\n c=c-x\r\n c=c+e\r\n if c>m:\r\n m=c\r\nprint(m)", "c=0\r\nb=[]\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n c-=x\r\n c+=y\r\n b.append(c)\r\nprint(max(b)) \r\n", "n = int(input())\r\nk = 0\r\nmx = 0\r\nfor x in range (n) :\r\n m = input()\r\n ml = m.split()\r\n a = int(ml[0])\r\n b = int(ml[1])\r\n k = k + b -a\r\n if mx <= k :\r\n mx = k\r\n\r\nprint(mx)", "passengers = 0\r\nchk = -1111111\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n passengers += y\r\n passengers -= x\r\n if chk < passengers:\r\n chk = passengers\r\nprint(chk)", "# import sys \n# sys.stdin = open(\"/Users/swasti/Desktop/coding/cp/codeforces/input.txt\", \"r\")\n# sys.stdout = open(\"/Users/swasti/Desktop/coding/cp/codeforces/output.txt\", \"w\")\nn = int(input()) \npassengers_inside = 0 \nmax_capacity = 0 \n\nfor _ in range(n):\n exiting, entering = map(int, input().split())\n passengers_inside = passengers_inside - exiting + entering\n max_capacity = max(max_capacity, passengers_inside)\nprint(max_capacity)\n\n", "n = int(input())\r\ne=0\r\nd=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d=d-a+b\r\n if d>e:\r\n e=d\r\nprint(e) ", "# В Линейном Королевстве всего один трамвайный маршрут. На нем n остановок, пронумерованных от 1 до n в порядке\r\n# следования трамвая. На i-ой остановке ai человек выходит из трамвая, а bi человек заходит в трамвай. Трамвай\r\n# прибывает на первую остановку пустым. Также, когда трамвай прибывает на последнюю остановку,\r\n# все пассажиры (выходят, и) трамвай уезжает пустым.\r\n#\r\n# Ваша задача — найти минимальную возможную вместимость трамвая, такую, что количество пассажиров в трамвае в любой\r\n# момент времени не превосходит эту вместимость. Учтите, что на каждой остановке все пассажиры выходят до того как\r\n# какой-либо пассажир заходит.\r\n#\r\n# Входные данные\r\n# В первой строке записано целое число n (2 ≤ n ≤ 1000) — количество остановок трамвая.\r\n#\r\n# Далее следует n строк, в каждой — по два целых числа ai и bi (0 ≤ ai, bi ≤ 1000) — количество (пассажиров,\r\n# которые) выходят из трамвая на i-ой остановке, и количество пассажиров, которые заходят в трамвай на i-ой остановке.\r\n# Остановки перечислены в том же порядке, в котором их проезжает трамвай.\r\n#\r\n# Количество пассажиров, которые выходят на остановке, не превосходит общего количества пассажиров в трамвае в момент,\r\n# когда он подъезжает к этой остановке. Более формально, . Это, в частности, означает, что a1 = 0\r\n# На последней остановке все пассажиры выходят из трамвая. Более формально,\r\n# Никто не заходит в трамвай на последней остановке. То есть, bn = 0\r\n# Выходные данные\r\n# Выведите одно целое число — минимальную возможную вместимость трамвая. Допускается, что вместимость может быть равна\r\n# нулю.\r\n\r\ntotal, result = 0, 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n total -= a\r\n total += b\r\n if total > result: result = total\r\nprint(result)\r\n", "n = int(input())\r\nmx = 0\r\ncurr = 0\r\nfor i in range(n):\r\n a,b = [int(x) for x in input().split()]\r\n curr += b\r\n curr -= a\r\n if curr > mx:\r\n mx = curr\r\nprint(mx)", "m,s=0,0\r\nfor i in range(int(input())-1):\r\n ex,en=map(int,input().split())\r\n s+=(en-ex)\r\n if s>m:\r\n m=s\r\nprint(m)", "\r\nn = int(input())\r\n\r\nc = 0\r\ncurrent_passengers = 0\r\n\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n current_passengers -= ai\r\n current_passengers += bi\r\n c= max(c, current_passengers)\r\n\r\nprint(c)\r\n", "n = int(input())\r\n\r\ncurrent = 0\r\nhighest = 0\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n current = current-a+b\r\n highest=max(highest,current)\r\n \r\nprint(highest)", "\nn = int (input())\ntram = 0\ncap = []\nfor _ in range (n):\n a , b = input().split()\n a = int(a)\n b = int(b)\n tram = tram - a + b\n cap.append(tram)\n\ncap.sort()\nprint(cap[-1])\n", "num = int(input())\r\nc = 0\r\nm = 0\r\nfor _ in range(num):\r\n an, bn = map(int, input().split())\r\n c -= an\r\n c += bn\r\n if c > m:\r\n m = c\r\nprint(m)", "N=int(input())\r\nX=0\r\nP=[]\r\nS=[]\r\nwhile(N!=0):\r\n A,B=map(int,input().split())\r\n X=X-(A-B)\r\n S=str(X)\r\n P.append(S)\r\n N=N-1\r\nF=list(map(int,P))\r\nprint(max(F))\r\n", "n = int(input())\nreq = []\nres = []\na, b = 0,0\nfor x in range(n):\n s = input().split()\n s = [int(j) for j in s]\n req.append(s)\n\nfor row in req:\n x,y = row\n a += x\n b += y\n res.append(b-a)\n\nprint(max(res))", "n=int(input())\r\nmi=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if i==0:\r\n x=b\r\n else:\r\n x=x-a\r\n x+=b\r\n if mi<x:\r\n mi=x\r\nprint(mi)\r\n \r\n", "n = int(input())\ncurr = 0\nans = 0\n\nfor rep1 in range(0,n):\n a, b = (int(x) for x in input().split())\n curr -= a\n curr += b\n if curr>ans:\n ans=curr\nprint(ans)\n\t \t\t\t\t\t \t \t\t \t \t\t\t \t\t\t \t\t", "def Tram(list_of_passenger) :\r\n passengers_inside = 0\r\n max_capacity = 0\r\n\r\n for stop in list_of_passenger:\r\n passengers_inside -= stop[0] # Passengers exit\r\n passengers_inside += stop[1] # Passengers enter\r\n\r\n max_capacity = max(max_capacity, passengers_inside)\r\n\r\n return max_capacity\r\nif __name__ == \"__main__\":\r\n list_of_passenger = list()\r\n for i in range(int(input())):\r\n outside , inside = map(int , input().split())\r\n list_of_passenger.append([outside,inside])\r\n print(Tram(list_of_passenger))", "s=q=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n s=s+b-a\r\n q=max(s,q)\r\nif s==0:\r\n print(q)", "tc=int(input())\r\npersons=0\r\nmax_list=[]\r\nfor x in range(tc):\r\n exit_,enter=map(int,input().split())\r\n persons=(persons+enter)-exit_\r\n max_list.append(persons)\r\n\r\nprint(max(max_list))\r\n\r\n", "# Read the input values\r\nn = int(input())\r\npassenger_capacity = 0\r\nmax_capacity = 0\r\n\r\n# Simulate the process at each stop\r\nfor _ in range(n):\r\n passengers_exit, passengers_enter = map(int, input().split())\r\n passenger_capacity = passenger_capacity - passengers_exit + passengers_enter\r\n max_capacity = max(max_capacity, passenger_capacity)\r\n\r\n# Print the maximum capacity observed during the journey\r\nprint(max_capacity)\r\n", "import sys\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n# sys.stderr = open(\"error.txt\", \"w\")\r\n# # your remaining code\r\n\r\nt = int(input())\r\n\r\nmn = 0\r\nisum = 0\r\n\r\nfor i in range(t) :\r\n\ta , b = map(int,input().split())\r\n\tisum -= a \r\n\tisum += b\r\n\tif isum > mn :\r\n\t\tmn = isum\r\n\r\nprint(mn)\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nc,max1=0,0\r\nfor i in range(n):\r\n m,n=map(int,input().split())\r\n if i==0:\r\n c=n\r\n else:\r\n c=c-m\r\n c=c+n\r\n #print(c)\r\n max1=max(max1,c)\r\nprint(max1)", "import math\r\nn = int(input())\r\nmax = -math.inf\r\ncap = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n cap = cap - a + b\r\n if cap > max:\r\n max = cap\r\nprint(max)", "a = int(input())\r\nsm = 0\r\nmx = 0\r\nfor i in range(a):\r\n a, b = map(int, input().split())\r\n sm += b\r\n sm -= a\r\n if mx < sm:\r\n mx = sm\r\n\r\nprint(mx)\r\n \r\n", "import math\r\nt = int(input())\r\na = 0\r\nb = 0\r\nfor i in range(t):\r\n s,x = map(int, input().split())\r\n b = b-s+x\r\n a = max(a,b)\r\nprint(a)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "cur = 0\r\nans = 0\r\nfor _ in range(int(input())):\r\n a, b = list(map(int, input().split()))\r\n cur -= a\r\n cur += b\r\n ans = max(ans, cur)\r\nprint(ans) ", "def tram_capacity(stops):\r\n capacity = 0\r\n passengers = 0\r\n for detail in stops:\r\n passengers -= detail[0]\r\n passengers += detail[1]\r\n if passengers > capacity:\r\n capacity = passengers\r\n return capacity\r\n\r\nn = int(input())\r\nstops = []\r\nfor i in range(n):\r\n stops.append([int(item) for item in input().split()])\r\nprint(tram_capacity(stops))", "n = int(input())\r\npassengers_inside = 0\r\nmin_capacity = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n passengers_inside = passengers_inside - a + b\r\n min_capacity = max(min_capacity, passengers_inside)\r\nprint(min_capacity)\r\n", "# N,M = map(int,input().split())\r\n# N = int(input())\r\n# A = list(map(int,input().split()))\r\n\r\nN = int(input())\r\nres = 0\r\ncur = 0\r\nfor _ in range(N):\r\n a,b = map(int,input().split())\r\n cur -= a\r\n cur += b\r\n res = max(res, cur)\r\n\r\nprint(res)\r\n\r\n\r\n", "s = []\r\ns1 = 0\r\nfor _ in range(int(input())) :\r\n a , b = map(int,input().split())\r\n s1 += b\r\n s1 -= a\r\n s.append(s1)\r\nprint(max(s)) \r\n ", "m=0\r\nl=[]\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n m+=b-a\r\n l.append(m)\r\nprint(max(l))", "s = int(input())\r\nlst = [0]\r\nfor i in range(s):\r\n g = list(map(int,input().split()))\r\n lst.append(lst[i]-g[0]+g[1])\r\nprint(max(lst))", "stops = int(input())\r\ncapacity = 0\r\ninside = 0\r\nfor i in range(stops):\r\n a, b = map(int, input().split(\" \"))\r\n inside = inside - a + b\r\n capacity = max(capacity, inside)\r\nprint(capacity)", "n=int(input())\r\ns=0\r\nm=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s=s-a+b\r\n m=max(m,s)\r\nprint(m)\r\n", "n=int(input())\r\n\r\nvm=maxi=0\r\nfor i in range(n):\r\n a,b=input().split(\" \")\r\n vm-=int(a)\r\n vm+=int(b)\r\n maxi=max(maxi,vm)\r\n\r\nprint(maxi)", "n = int(input())\r\nsumm=0\r\ncount=0\r\nfor i in range(n):\r\n s = input().split()\r\n summ-=int(s[0])\r\n summ+=int(s[1])\r\n if summ>=count:\r\n count=summ\r\nprint(count)", "c=0\r\nl=0\r\nfor i in range(int(input())):\r\n q,w=map(int,input().split())\r\n c=c-q+w\r\n if l<c:\r\n l=c\r\nprint(l)", "n=int(input())\r\nans=[]\r\np=0\r\nfor i in range(n):\r\n [a,b]=list(map(int,input().split(\" \")))\r\n p=p-a\r\n p=p+b\r\n ans.append(p)\r\nprint(max(ans))\r\n\r\n\r\n", "n=int(input())\r\nc=0\r\ntc=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n c=c-a+b\r\n tc=max(tc,c)\r\nprint(tc)", "def Tram(NumberOfStops:int):\r\n \r\n remain = 0\r\n MaxCapacity = 0\r\n PassengerEnter , PassengerExit = 0, 0\r\n\r\n for i in range(NumberOfStops):\r\n \r\n PassengerEnter, PassengerExit = map(int, input().split())\r\n remain = remain - PassengerEnter + PassengerExit\r\n\r\n if remain > MaxCapacity:\r\n MaxCapacity = remain\r\n\r\n return MaxCapacity\r\n\r\n\r\nNumberOfStops = int(input())\r\nprint(Tram(NumberOfStops))", "n=int(input())\r\nc=0;m=0\r\na=0;b=0;d=0\r\nfor i in range(n):\r\n \r\n x=input().split()\r\n \r\n a=int(x[0]);b=int(x[1])\r\n d=d-a\r\n d=d+b\r\n if m<d:\r\n m=d\r\nprint(m) ", "n = int(input())\r\ns = 0\r\nm = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n s = s + b - a\r\n m.append(s)\r\nprint(max(m))", "a=int(input())\r\nb=[]\r\nfor i in range(a):\r\n c=input().split()\r\n b.extend(c)\r\no=0\r\nl=[]\r\ncount=1\r\nfor j in b:\r\n if count%2==0:\r\n o+=int(j)\r\n else:\r\n o-=int(j)\r\n l.append(o)\r\n count+=1\r\nprint(max(l))", "l = maxe = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n l += b - a\r\n if(l>maxe):\r\n maxe = l\r\nprint(maxe)\r\n ", "a=0\r\nl=[]\r\nfor i in range(int(input())):\r\n n,m=map(int,input().split())\r\n a+=m-n\r\n l.append(a)\r\nprint(max(l))", "w = input()\r\ny = 0\r\ns = 0\r\nfor i in range(int(w)):\r\n x = input()\r\n x = x.split(\" \")\r\n y = y - int(x[0]) + int(x[1])\r\n if s < y:\r\n s = y\r\nprint(s)", "r=0\r\nc=[]\r\nfor _ in range (int(input())):\r\n a,b=map(int,input().split())\r\n r=r-a+b\r\n c.append(r)\r\nprint(max(c))", "n = int(input())\nm = 0\ns = 0\nwhile n:\n\tx,y= map(int,input().split())\n\ts=s+y-x\n\tif s >m:\n\t\tm = s\n\tn-=1\nprint(m)\n\t\t\t \t \t \t \t \t\t\t \t\t \t\t \t\n \t\t \t \t\t \t \t\t \t\t \t\t\t\t \t \t", "n = int(input())\r\n\r\nm = 0\r\np = 0\r\nfor i in range(n):\r\n i, o = map(int, input().split(' '))\r\n p -= i\r\n p += o\r\n if p > m:\r\n m = p\r\n\r\nprint(m)", "t=int(input())\r\ns=[]\r\ny=0\r\nfor i in range(t):\r\n l=list(map(int,input().split()))\r\n y=y+l[1]-l[0]\r\n s.append(y)\r\ns.sort(reverse=True)\r\nprint(s[0])", "stations = int(input())\r\n\r\ncapacity = 0\r\noverall = 0\r\nfor i in range(stations):\r\n ent_ext = input().split(' ')\r\n capacity -= int(ent_ext[0])\r\n capacity += int(ent_ext[1])\r\n if overall < capacity:\r\n overall = capacity\r\n\r\n\r\nprint(overall)\r\n", "def main():\r\n # import sys\r\n # sys.stdin = open('input.txt', 'r')\r\n n = int(input())\r\n capacity = 0\r\n max = 0\r\n for i in range(n):\r\n exit, enter = map(int, input().split(' '))\r\n capacity -= exit\r\n capacity += enter\r\n if max < capacity:\r\n max = capacity\r\n print(max)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\n\nresult = capacity = 0\n\nfor _ in range(n):\n a, b = map(int, input().split())\n capacity += -a+b\n result = max(result, capacity)\n\nprint(result)", "n=int(input())\r\nina=[]\r\nout=[]\r\nno=[]\r\n\r\nfor i in range(0,n):\r\n s=input()\r\n s=s.split()\r\n ina.append(int(s[1]))\r\n out.append(int(s[0]))\r\n\r\nno.append(ina[0])\r\nfor i in range(1,len(ina)):\r\n no.append(no[i-1]-out[i]+ina[i])\r\nprint(max(no))\r\n ", "c = 0\r\nx = 0\r\nss = []\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n c = b - a\r\n x = x + c\r\n ss.append(x)\r\nprint(max(ss))\r\n", "inp=int(input())\r\ncap = 0\r\n\r\ncurrent = 0\r\n\r\nfor i in range(inp):\r\n inp2 = input()\r\n inp2l = inp2.split(' ')\r\n a = int(inp2l[0])\r\n b = int(inp2l[1])\r\n current+= -a+b\r\n if cap < current:\r\n cap = current\r\nprint(cap)", "n=int(input())\r\ninput_array=[]\r\nwhile n>0:\r\n array=list(map(int,input().split()))\r\n input_array.append(array)\r\n n=n-1\r\nmaxsum=0\r\npcount=0\r\nfor a in input_array:\r\n pcount=pcount-a[0]+a[1]\r\n if pcount>maxsum:\r\n maxsum=pcount\r\nprint(maxsum)", "c = 0\r\nm = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n c -= a\r\n c += b \r\n if c>m:\r\n m = c \r\nprint(m)", "curr = 0\r\nmaxcurr = 0\r\nfor i in range(int(input())):\r\n a,b = map(int, input().split())\r\n curr -= a\r\n curr += b\r\n maxcurr = max(maxcurr, curr)\r\n\r\nprint(maxcurr)\r\n", "n = int(input())\r\ncurr = 0\r\nmaxx = 0\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n curr += b - a\r\n maxx = max(curr, maxx)\r\n\r\nprint(maxx)", "n = int(input())\r\np = 0\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n c = c - a\r\n c = c + b\r\n p = max(p, c)\r\nprint(p)\r\n", "n = int(input())\r\ncurrent_capacity = 0\r\nminimum_capacity = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current_capacity -= a # Passengers exiting the tram\r\n current_capacity += b # Passengers entering the tram\r\n minimum_capacity = max(minimum_capacity, current_capacity)\r\n\r\nprint(minimum_capacity)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 16 23:12:57 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nn = int(input())\r\ncap = 0\r\ncap1 = 0\r\nfor i in range(1,n+1) :\r\n ppl = input().split()\r\n ex = int(ppl[0])\r\n en = int(ppl[1])\r\n cap_ = cap - ex + en\r\n if cap_ >= cap1 :\r\n cap1 = cap_\r\n cap = cap_\r\n else:\r\n cap = cap_\r\nprint(cap1)", "t=int(input())\r\npassenger=0\r\nmaxx=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n passenger=abs(passenger-a)\r\n passenger+=b\r\n if maxx<passenger:\r\n maxx=passenger\r\nprint(maxx)", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables to keep track of passengers inside the tram and the minimum capacity\r\npassengers_inside = 0\r\nmin_capacity = 0\r\n\r\n# Iterate through each stop\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n \r\n # Update the passengers inside the tram (subtract exiting, add entering)\r\n passengers_inside -= a\r\n passengers_inside += b\r\n \r\n # Update the minimum capacity if needed\r\n min_capacity = max(min_capacity, passengers_inside)\r\n\r\n# Print the minimum capacity\r\nprint(min_capacity)\r\n", "n = int(input())\r\narr_out = []\r\narr_in = []\r\narr_data = []\r\ntotal = 0\r\n\r\nfor word in range(n):\r\n in_value, out_value = map(int, input().split())\r\n arr_out.append(out_value)\r\n arr_in.append(in_value)\r\n\r\nfor i in range(n):\r\n total += arr_out[i] - arr_in[i]\r\n arr_data.append(total)\r\n\r\nprint(max(arr_data))", "n = int(input())\r\nleft,right = map(int,input().split())\r\nresult = left + right\r\ntrash=[]\r\ntrash.append(result)\r\nfor i in range(n-1):\r\n vishli,zashli = map(int,input().split())\r\n result = result - vishli + zashli\r\n trash.append(result)\r\nprint(max(trash))", "n=int(input())\r\ncap=0\r\nmax=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tcap=cap-a+b\r\n\tif cap>max:\r\n\t\tmax=cap\r\nprint(max)", "a=int(input())\r\nx=0\r\nnew=[]\r\nfor i in range(a):\r\n ls=list(map(int,input().split()))\r\n x-=ls[0]\r\n x+=ls[1]\r\n new.append(x)\r\nprint(max(new))", "n = int(input())\r\nmax = 0\r\nsum = 0\r\nfor i in range(0,n):\r\n s = input()\r\n lst = s.split(' ')\r\n ex = int(lst[0])\r\n en = int(lst[1])\r\n sum = sum - ex + en\r\n if sum > max:\r\n max = sum\r\nprint(max)", "count_stoppes = int(input())\r\n\r\npassagers_per_stop = [] \r\ncount_now_passagers = 0\r\nfor _ in range(count_stoppes):\r\n i, j = map(int, input().split())\r\n count_now_passagers += j\r\n count_now_passagers -= i\r\n passagers_per_stop.append(count_now_passagers)\r\n\r\nprint(max(passagers_per_stop))\r\n", "s = maxi = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n s-=a-b\r\n if s > maxi:\r\n maxi = s\r\nprint(maxi)", "x = int(input())\r\nexist = 0\r\nmaxx= 0\r\nfor i in range(x):\r\n y,z = map(int , input().split())\r\n \r\n exist = exist + (z - y)\r\n \r\n maxx = max(maxx , exist)\r\n \r\nprint(maxx)\r\n \r\n \r\n \r\n \r\n", "m=n=0\r\nfor x in[0]*int(input()):n-=eval(input().replace(' ','-'));m=max(m,n)\r\nprint(m)", "# https://codeforces.com/problemset/problem/116/A\r\n\r\nn = int(input())\r\n\r\npassengers = 0\r\nmax_passengers = 0\r\nfor _ in range(n):\r\n a, b = [int(e) for e in input().split()]\r\n passengers += -a +b\r\n max_passengers = max(passengers, max_passengers)\r\nprint(max_passengers)\r\n", "n=int(input());s=0;a=[]\r\nfor i in range(n):\r\n n,m=map(int,input().split())\r\n s=s+m-n;a.append(s)\r\nprint(max(a))", "n = int(input())\r\ns, c = int(), int()\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n s = s - a + b\r\n if s > c: c = s\r\nprint(c)\r\n\r\n", "n = int(input())\r\nmax = 0\r\nintram = 0\r\nfor i in range(n):\r\n out, ins = map(int, input().split())\r\n diff = ins - out\r\n intram += diff\r\n if intram > max:\r\n max = intram\r\nprint(max)\r\n", "n = int(input())\r\ntotal = 0\r\nmin_ = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n total -= a\r\n total += b\r\n if total > min_:\r\n min_ = total\r\n else:\r\n continue\r\nprint(min_)\r\n#veeras code", "cur = 0\r\nmax = 0\r\nfor n in range (int(input())):\r\n a, b = input().split()\r\n dif = int(b) - int(a)\r\n cur = cur + dif\r\n if cur > max:\r\n max = cur\r\nprint(max)", "n = int(input())\r\nabl = []\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n abl.append([a,b])\r\nans = 0\r\npas = 0\r\nfor [a,b] in abl:\r\n pas += b-a\r\n ans = max(ans, pas)\r\nprint(ans)", "n=int(input())\r\ni=1\r\nx=0\r\nl=[0]\r\nwhile i<=n:\r\n raw=input().split()\r\n x=x-int(raw[0])+int(raw[1])\r\n l.append(x)\r\n i+=1\r\ny=max(l)\r\nprint(y)", "m = 0\r\natual = 0\r\nfor i in range(int(input())):\r\n a, b = list(map(int, input().split()))\r\n atual -= a\r\n atual += b\r\n if atual > m:\r\n m = atual\r\n\r\nprint(m)", "passenger = 0\r\ncount = 0\r\nmax = []\r\nstops = int(input())\r\nwhile count < stops:\r\n event = list(input().split())\r\n passenger += int(event[1])\r\n passenger -= int(event[0])\r\n max.append(int(passenger))\r\n count += 1\r\nmax.sort()\r\nmax.reverse()\r\nprint(max[0])\r\n", "testcases= int(input())\nj=0\ncount=0\nmax = count\nwhile j<testcases:\n a,b=map(int,input().split())\n count=(count-a)+b\n if count > max:\n max=count\n j+=1\nprint(max)\n", "aw1=pw1=0\r\nfor xw1 in[0]*int(input()):\r\n pw1-=eval(input().replace(' ','-'))\r\n aw1=max(aw1,pw1)\r\nprint(aw1)", "n=int(input())\r\ncap = result = 0\r\n\r\nfor num in range(n):\r\n\tdum = input().split()\r\n\ta = int(dum[0])\r\n\tb = int(dum[1])\r\n\tcap = cap - a + b\r\n\tresult = max(result,cap)\r\nprint(result)", "cap =0\r\npas=0\r\nfor _ in range(int(input())):\r\n a,b = [int(x) for x in input().split()]\r\n pas -=a\r\n pas +=b\r\n cap=max(pas,cap)\r\nprint(cap)\r\n", "n = int(input())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if(i==0):\r\n s = a+b\r\n l.append(s)\r\n else:\r\n s = s - a + b\r\n l.append(s)\r\nprint(max(l))", "n = int(input())\r\na = []\r\nnum = 0\r\nfor i in range(1,n+1):\r\n b=input().split(' ')\r\n num = num - int(b[0]) + int(b[1])\r\n a.append(num)\r\nprint(max(a))", "count=0\r\nn=int(input())\r\nmaxx=float(\"-inf\")\r\nfor i in range(n):\r\n ls=list(map(int,input().split()))\r\n count-=ls[0]\r\n count+=ls[1]\r\n if count>maxx:\r\n maxx=count\r\n\r\n\r\nprint(maxx)\r\n", "i1=int(input())\r\ntotalcap=0;\r\narr=[]\r\nfor j in range(i1):\r\n o, i = map(int, input().split())\r\n totalcap=totalcap+i;\r\n totalcap=totalcap-o;\r\n arr.append(totalcap)\r\nprint(sorted(arr)[-1])", "def max_value(a, b):\r\n return a if a > b else b\r\n\r\ndef main():\r\n n = int(input())\r\n passengers = 0\r\n counter = 0\r\n \r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n counter -= a\r\n counter += b\r\n passengers = max_value(passengers, counter)\r\n \r\n print(passengers)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ncur = 0\r\nres = 0\r\nfor _ in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n cur += (b - a)\r\n res = max(cur, res)\r\nprint(res)", "n = int(input())\r\ntram = 0\r\nmax_tram = 0\r\nfor i in range(1, n + 1):\r\n a, b = (int(j) for j in input().split()) #Чтение данных\r\n tram -= a\r\n tram += b\r\n if tram > max_tram:\r\n max_tram = tram\r\nprint(max_tram)\r\n", "n = int(input())\r\nc = 0\r\np = 0\r\n\r\nfor _ in range(n):\r\n exit,enter = map(int, input().split())\r\n p -= exit\r\n p += enter\r\n c = max(c, p)\r\n\r\nprint(c)", "n=int(input())\r\nmax_capacity=0\r\ncurrent_capacity=0\r\nfor i in range(n):\r\n ai,bi=map(int,input().split())\r\n current_capacity=current_capacity-ai+bi\r\n max_capacity=max(max_capacity,current_capacity)\r\nprint(max_capacity) ", "# Read the number of stops\r\nn = int(input())\r\n\r\n# Initialize variables to keep track of the passengers inside the tram and the minimum capacity\r\npassengers_inside = 0\r\nmin_capacity = 0\r\n\r\n# Process each stop\r\nfor _ in range(n):\r\n # Read the number of passengers exiting and entering at the current stop\r\n a, b = map(int, input().split())\r\n \r\n # Update the number of passengers inside the tram\r\n passengers_inside = passengers_inside - a + b\r\n \r\n # Update the minimum capacity if needed\r\n min_capacity = max(min_capacity, passengers_inside)\r\n\r\n# Output the minimum capacity\r\nprint(min_capacity)\r\n\r\n", "s=0\r\nn=int(input())\r\nm=0\r\nfor i in range(n):\r\n x,y=str(input()).split()\r\n x=int(x)\r\n y=int(y)\r\n s=s+y-x\r\n m=max(m,s)\r\n\r\n\r\nprint(m)\r\n", "n=int(input())\r\npas=0\r\nsum=[]\r\nfor o in range(n):\r\n x,y=map(int,input().split())\r\n pas=pas-x\r\n pas=y+pas\r\n sum.append(pas)\r\nprint(max(sum))", "stops = int(input())\r\nexit = 0\r\nentry = 0\r\nmaximum = 0\r\nall = 0\r\nfor i in range(stops):\r\n exit, entry = map(int, input().split())\r\n all += entry\r\n all -= exit\r\n maximum = max(maximum, all)\r\nprint(maximum)", "n=int(input())\r\nc=0\r\nmini=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c-=a\r\n c+=b\r\n if c>mini:\r\n mini=c\r\nprint(mini)", "a=int(input())\r\nins=0\r\nmini=0\r\nfor i in range(a):\r\n n,k = [int(x) for x in input().split(' ')]\r\n ins=ins-n+k\r\n # print(ins)\r\n if mini<ins:\r\n mini=ins\r\nprint(mini) \r\n \r\n", "def f():\r\n imin = 0\r\n k = 0\r\n for i in range(int(input())):\r\n a1, a2 = map(int, input().split())\r\n k -= a1\r\n k += a2\r\n imin = max(k, imin)\r\n return imin\r\n\r\n\r\nprint(f())\r\n", "#Coder_1_neel\r\nn=int(input())\r\npre=0\r\ngre=0\r\nfor i in range(n):\r\n \r\n a,b=map(int,input().split())\r\n x=pre-a+b\r\n if x>gre:\r\n gre=x\r\n pre=x \r\n \r\nprint(gre) \r\n \r\n", "n=int(input())\r\ncapacity=0\r\nc_p=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c_p=c_p-a+b\r\n capacity=max(capacity,c_p)\r\nprint(capacity)", "num_stops = int(input())\r\n\r\ncur_num_pass = 0\r\nmax_num_pass = 0\r\n\r\nfor i in range(num_stops):\r\n out, on = map(int, input().split())\r\n cur_num_pass -= out\r\n cur_num_pass += on\r\n if cur_num_pass > max_num_pass:\r\n max_num_pass = cur_num_pass\r\n\r\nprint(max_num_pass)\r\n", "import sys\r\nimport os\r\nimport io\r\nimport collections\r\nfrom math import ceil,floor,sqrt,sin,cos,tan,inf\r\ninput = sys.stdin.buffer.readline\r\ndata = collections.Counter\r\nqueue= collections.deque\r\nii = lambda: int(input())\r\nfi = lambda: float(input())\r\nsi = lambda: input().decode().rstrip()\r\nst = lambda: set()\r\nmi = lambda: map(int,input().split())\r\nmf = lambda: map(float,input().split())\r\nmsi= lambda: map(str,input().strip().decode().split(\" \"))\r\nli = lambda: list(mi())\r\nlf = lambda: list(mf())\r\nls = lambda: list(msi())\r\ndef ipow(x,y):return int(pow(x,y))\r\ndef maps(arr):return map(str,arr)\r\ndef YES(): sys.stdout.write(\"YES\\n\")\r\ndef Yes(): sys.stdout.write(\"Yes\\n\")\r\ndef yes(): sys.stdout.write(\"yes\\n\")\r\ndef NO(): sys.stdout.write(\"NO\\n\")\r\ndef No(): sys.stdout.write(\"No\\n\")\r\ndef no(): sys.stdout.write(\"no\\n\")\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n def solve(self):\r\n total=0\r\n mx=0\r\n for _ in range(ii()):\r\n a,b=mi()\r\n total-=a\r\n total+=b\r\n mx=max(mx,total)\r\n sys.stdout.write(f\"{mx}\\n\")\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n Solution().solve()\r\n", "t = int(input())\r\nk = 0\r\nn = 0\r\nfor i in range(t):\r\n a,b = map(int, input().split())\r\n n +=(b-a)\r\n k=max(k,n)\r\nprint(k)\r\n", "n=int(input())\r\nt=[]\r\nmaxi=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n maxi+=(a+b)\r\n t.append([a,b])\r\ndef ispossible(mid):\r\n cap=0\r\n for i in range(n):\r\n cap-=t[i][0]\r\n cap+=t[i][1]\r\n # print(cap,i)\r\n if cap>mid:\r\n return False\r\n return True\r\n# print(maxi)\r\nlow=0\r\nhigh=maxi+1\r\nans=0\r\nwhile low<=high:\r\n mid=low+(high-low)//2\r\n if ispossible(mid):\r\n ans=mid\r\n high=mid-1\r\n else:\r\n low=mid+1\r\nprint(ans)\r\n", "n = int(input())\r\ncapacity = 0\r\nmax_cap = 0\r\n\r\nif (n<2) or (n>1000):\r\n print(\"Error_1\")\r\n\r\nfor ctr_1 in range (0,n):\r\n a,b = map(int,input().split())\r\n\r\n ''' print(str(a) + str(b)) '''\r\n # line comment \r\n\r\n if (ctr_1 == 0) and (a > 0):\r\n print(\"Error_1\")\r\n if (ctr_1 == n-1) and (b > 0):\r\n print(\"Error_2\")\r\n if (a < 0) or (b < 0) or (a > 1000) or (b > 1000):\r\n print(\"Error_3\")\r\n\r\n capacity-=a; capacity+=b\r\n if capacity > max_cap:\r\n max_cap = capacity\r\n\r\nprint(max_cap)\r\n\r\n", "a = int(input().split()[0])\r\nsq = [[int(i) for i in input().split()] for j in range(a)]\r\nsdf = 0\r\nsd = 0\r\nfor j in range(a):\r\n sdf += sq[j][1]\r\n sdf -= sq[j][0]\r\n if sdf > sd:\r\n sd = sdf\r\nprint(sd)", "c=0\r\nn=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n n+=b-a\r\n c=max(c,n)\r\nprint(c)", "n = int(input())\r\ns = 0\r\nt = 0\r\nd = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n s += a\r\n t += b\r\n d = max(d,t-s)\r\nprint(d)\r\n", "n=int(input())\r\ncnt=0\r\ncap=0\r\nfor i in range(n):\r\n sp=[int(j) for j in input().split()]\r\n ex=sp[0]\r\n vis=sp[1]\r\n cnt-=ex\r\n cnt+=vis\r\n if cnt>cap:\r\n cap=cnt\r\nprint(cap)", "n=int(input())\r\nc=0\r\nm=0\r\nfor _ in range(n):\r\n a,b=map(int, input().split())\r\n c-=a\r\n c+=b\r\n if c>m:\r\n m=c\r\nprint(m)\r\n", "n=int(input())\r\nmaxcount=0\r\ncurrentcount=0\r\nfor i in range(n):\r\n out,inc=map(int,input().split())\r\n currentcount= currentcount - out + inc\r\n if(maxcount<=currentcount):\r\n maxcount=currentcount\r\nprint(maxcount)", "n = int(input())\r\nl=[0]\r\nfor i in range(n):\r\n a , b=map(int,input().split())\r\n l.append(l[i]+b-a)\r\nprint(max(l))", "n = int(input())\r\ncap = 0\r\nmax_cap = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n cap = cap - a + b\r\n if cap > max_cap:\r\n max_cap = cap\r\nprint(max_cap)", "n = int(input())\r\n\r\ncap = 0\r\ncurrent = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n current -= a\r\n current += b\r\n cap = max(cap, current)\r\n\r\nprint(cap)\r\n", "c=0\r\npas=0\r\nfor _ in range(int(input())):\r\n\tx, y=map(int,input().split())\r\n\tpas=pas-x+y\r\n\tif c<pas:\r\n\t\tc=pas\r\nprint(c)", "h = int(input())\r\nb = 0\r\nv = 0\r\nwhile h > 0:\r\n r, g = map(int, input().split())\r\n v = v + g - r\r\n if v > b:\r\n b = v\r\n h -= 1\r\nprint(b)\r\n", "n= int(input())\r\ns=0\r\nc=0\r\nfor _ in range(n):\r\n\tm,k=map(int,input().split())\r\n\ts-=m\r\n\ts+=k\r\n\tc=max(s,c)\r\nprint(int(c))", "n = int(input())\r\ns = []\r\nc = 0\r\ncp = 0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s.append((a,b))\r\nfor i in s:\r\n x,y = i\r\n cp -=x\r\n cp+=y\r\n c = max(c,cp)\r\nprint(c)", "n=int(input())\ns=0\nk=0\nfor i in range(n):\n a,b=map(int,input().split())\n s+=-a+b\n k=max(k,s)\nprint(k)", "w=int(input())\r\nc=0\r\nm=[]\r\nfor i in range(w):\r\n a,b=map(int,input().split())\r\n c+=b-a\r\n m.append(c)\r\nprint(max(m))", "n = int(input())\r\ntotal = 0\r\ncap = 0\r\nfor i in range(n):\r\n out,into = map(int,input().split())\r\n total += (into - out)\r\n if(total > cap):\r\n cap = total\r\nprint(cap)", "n=int(input())\r\nz=[]\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c=(c-a)+b\r\n z.append(c)\r\n d=max(z)\r\nprint(d)", "n = int(input())\r\neach_stop = []\r\nnumber = 0\r\n\r\nfor i in range(n):\r\n out, enter = map(int, input().split())\r\n number = number - out + enter\r\n each_stop.append(number)\r\n\r\neach_stop = each_stop[:-1]\r\n\r\nprint(max(each_stop))", "n = int(input())\r\nc = 0\r\nd = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n if a < b :\r\n c += b - a\r\n elif a > b :\r\n c -= a - b\r\n else :\r\n c -= 0\r\n if c > d :\r\n d = c\r\n\r\nprint(d)", "n=int(input())\r\nnum=0\r\nnum_a=0\r\nfor i in range(n):\r\n line=input().split()\r\n num_a=num_a+int(line[1])-int(line[0])\r\n if num>=num_a:\r\n num=num\r\n else:\r\n num=num_a\r\nprint(num)", "n = int(input())\r\npassenger = 0\r\nrecords = []\r\nfor _ in range(n):\r\n train_stop = list(map(int, input().split()))\r\n a = train_stop[0]\r\n b = train_stop[1]\r\n passenger += (b -a)\r\n records.append(passenger)\r\nprint(max(records))", "a = int(input())\r\nx = float(\"-inf\")\r\npas = 0\r\nfor i in range(a):\r\n w = list(map(int,input().split()))\r\n pas -= w[0]\r\n pas += w[1]\r\n if x < pas:\r\n x = pas\r\nprint(x)", "n = int(input())\r\nmincap = 0\r\ncounter = 0\r\nfor i in range(n):\r\n a, b = map(int,input().split())\r\n counter += b-a\r\n if i == 0 or counter > mincap:\r\n mincap = counter\r\nprint(mincap)", "n=int(input())\r\ns=0\r\nm=0\r\nfor i in range(1,n+1,1):\r\n l=list(map(int,input().strip().split()))\r\n s=s-l[0]+l[1]\r\n if(s>m):\r\n m=s\r\nprint(m)", "n = int(input())\r\nans = 0\r\nx = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x -= a\r\n x += b\r\n if x > ans:\r\n ans = x\r\nprint(ans)\r\n", "\r\nn1 = int(input())\r\n\r\ncapacity1 = 0\r\ncurrent_passengers1 = 0\r\n\r\nfor _ in range(n1):\r\n exiting, entering = map(int, input().split())\r\n\r\n current_passengers1 -= exiting\r\n current_passengers1 += entering\r\n\r\n capacity1 = max(capacity1, current_passengers1)\r\n\r\nprint(capacity1)\r\n", "t = int(input())\r\nbus = 0\r\ncapacity = 0\r\nfor _ in range(t):\r\n x, y = map(int, input().split())\r\n bus += y-x\r\n capacity = max(capacity, bus)\r\n \r\nprint(capacity)", "stops= int(input())\r\na,b=0,0\r\ntemp=0\r\nmax=0\r\nfor i in range(0,stops):\r\n a,b=map(int,input().split())\r\n if(i!=0):\r\n temp-=a\r\n temp+=b\r\n if(temp>max):\r\n max=temp\r\n\r\nprint(max)", "n=int(input())\np=0\nl=[]\nfor i in range(n):\n e,g=map(int,input().split())\n p+=g \n p-=e \n l.append(p)\nprint(max(l))\n\t\t \t \t \t\t \t \t \t \t \t\t\t\t\t\t\t", "n=int(input())\r\ns=0\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if i==n-1:\r\n break\r\n else:\r\n s=s+b-a\r\n l.append(s)\r\nprint(max(l))", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n capacidad = 0\n pasajeros = 0\n for _ in range(int(input())):\n x, y = map(int, input().split())\n pasajeros += -x+y\n capacidad = max(capacidad, pasajeros)\n print(capacidad)\n\n \t\t \t \t\t \t \t \t \t \t", "n=int(input())\r\nf=0\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n f-=a\r\n f+=b\r\n if f>=c:\r\n c=f\r\nprint(c)", "n = int(input())\n\nmaxPass = 0\nthis = 0\n\nfor i in range(n):\n a, b = map(int, input().split())\n\n this = this - a + b\n\n if this > maxPass:\n maxPass = this\n\n\nprint(maxPass)\n", "capacity = 0\npeople = 0\nfor i in [0]*int(input()):\n ab = input().split()\n a, b = int(ab[0]), int(ab[1])\n people += b-a\n if people > capacity:\n capacity = people\nprint(capacity)\n", "t=int(input())\r\nc=0\r\nm_c=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n c+=b-a\r\n m_c=max(m_c,c)\r\nprint(m_c)", "def calculate_min_capacity(n, stops):\r\n max_capacity = 0 # Initialize maximum capacity\r\n current_capacity = 0 # Initialize current capacity\r\n\r\n for i in range(n):\r\n # Calculate the current capacity after exiting and entering passengers\r\n current_capacity = current_capacity - stops[i][0] + stops[i][1]\r\n\r\n # Update the maximum capacity if needed\r\n max_capacity = max(max_capacity, current_capacity)\r\n\r\n return max_capacity\r\n\r\n# Read input\r\nn = int(input())\r\nstops = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n stops.append((a, b))\r\n\r\n# Calculate the minimum possible capacity of the tram\r\nresult = calculate_min_capacity(n, stops)\r\n\r\n# Print the result\r\nprint(result)\r\n", "t=int(input())\r\nmaxi=0\r\ntemp=0\r\nwhile(t):\r\n x,y=map(int,input().split())\r\n temp=(temp-x)+y\r\n if(temp>maxi):\r\n maxi=temp\r\n t=t-1;\r\nprint(maxi)", "maxCapacity, curCapacity = 0, 0\r\nfor _ in range(int(input())):\r\n off, enter = map(int, input().split())\r\n curCapacity += enter - off\r\n maxCapacity = maxCapacity if maxCapacity > curCapacity else curCapacity\r\nprint(maxCapacity)", "n=int(input())\r\nx=0\r\nMx=0\r\nwhile n!=0:\r\n a,b=map(int,input().split())\r\n x-=a\r\n x+=b\r\n if x>Mx:\r\n Mx=x\r\n n-=1\r\nprint(Mx)", "n = int(input())\r\nans = 0\r\ns = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n s = s - a + b\r\n ans = max(ans, s)\r\nprint(ans)\r\n", "n = int(input())\r\nm = 0\r\np = 0\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split(\" \")]\r\n c = b - a\r\n p += c\r\n if p > m:\r\n m = p\r\n\r\nprint(m)\r\n\r\n", "n=int(input())\nx,y=0,0\nfor i in range(1,n):\n z=[int(i) for i in input().split()]\n x-=z[0]\n x+=z[1]\n y=max(y,x)\nprint(y)\n \n \n", "n = int(input())\r\nresult = 0\r\nresults = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n result = result - a + b\r\n results.append(result)\r\n\r\nprint(max(results))\r\n", "n = int(input())\r\n\r\n\r\nlist = []\r\nresult = 0\r\nfor i in range(n):\r\n\r\n a,b = map(int, input().split(' '))\r\n\r\n result += (b-a)\r\n list.append(result)\r\n\r\nprint(max(list))" ]

[ "N = int(input())\r\ns = 0\r\n\r\ndef gcd(a, b):\r\n while(b):\r\n a, b = b, a%b\r\n return a\r\n\r\nfor i in range(2, N):\r\n n = N\r\n while(n>0):\r\n s += n%i\r\n n = n//i\r\n\r\nt = gcd(s, N-2)\r\nprint(str(s//t)+\"/\"+str((N-2)//t))", "import math\r\ndef numberToBase(n, b):\r\n if n == 0:\r\n return [0]\r\n digits = []\r\n while n:\r\n digits.append(int(n % b))\r\n n //= b\r\n return digits[::-1]\r\n \r\nn = int(input())\r\nx = 0\r\nfor i in range(2,n):\r\n x+=sum([int(y) for y in numberToBase(n,i)])\r\nprint(f\"{x//math.gcd(x,i-1)}/{(i-1)//math.gcd(x,i-1)}\")", "import math\n\ndef somaBased(n, base):\n count = 0\n while n > 0:\n count += n % base\n n //= base\n return count\n \n \nA = int(input())\nsomaBase=0\ncontador=2\n\nwhile contador != A:\n somaBase += somaBased(A,contador)\n contador+=1\n\n \nGCD = math.gcd(somaBase, A-2)\n\ncalculoFloor= (A-2)//GCD\n\nprint(\"%d/%d\" %(somaBase//GCD, calculoFloor))\n\n\t \t\t \t \t \t\t\t \t \t\t \t\t\t", "from math import gcd\nn=int(input())\ns=0\nfor i in range(2,n):\n k=n\n while k!=0:\n s+=k%i\n k=k//i\np=gcd(s,n-2) \nprint(str(s//p)+\"/\"+str((n-2)//p))\n", "n,num = int(input()),0\r\nfor i in range(2,n):\r\n m = n\r\n while m:\r\n num += m % i\r\n m -= m % i\r\n m //= i\r\nn -= 2\r\nfor i in range(2,int(num ** 0.5)):\r\n while num % i == 0 and n % i == 0:\r\n num //= i\r\n n //= i\r\nprint(f'{num}/{n}')", "import math\r\na = int(input())\r\ns = 0\r\nfor i in range(2, a):\r\n tmpA = a\r\n while tmpA != 0:\r\n s = s + (tmpA % i)\r\n tmpA = (tmpA // i)\r\n\r\nd = math.gcd(s, a-2)\r\nprint(f\"{s//d}/{(a-2)//d}\")\r\n \r\n", "def mp(n,t):\r\n\t\"\"\"max power\"\"\"\r\n\tc=0\r\n\twhile n>=t**c:\r\n\t\tc+=1\r\n\treturn c\r\n\r\ndef tos(n,t):\r\n\t\"\"\"to other system number summ\"\"\"\r\n\tp=mp(n,t)\r\n\tv=[]\r\n\tfor c in range(p):\r\n\t\tk=(p-c-1)\r\n\t\tv.append(n//t**k)\r\n\t\tn-=v[-1]*t**k\r\n\treturn sum(v)\r\n\r\nfrom math import gcd\r\ndef snos(n):\r\n\t\"\"\"summ of number in other systems\"\"\"\r\n\tnm,dm=0,n-2\r\n\tfor c in range(2,n):\r\n\t\tnm+=tos(n,c)\r\n\tg=gcd(nm,dm)\r\n\treturn nm//g,dm//g\r\n\r\nnm,dm=snos(int(input()))\r\nprint('{}/{}'.format(nm,dm))", "from math import gcd\n\ndef cnt(n, k):\n s = 0\n while n:\n s += n % k\n n //= k\n return s\n\n\nn = int(input())\ns = 0\nfor k in range(2, n):\n s += cnt(n, k)\nprint(f\"{s // gcd(s, n - 2)}/{(n - 2) // gcd(s, n - 2)}\")", "from math import *\r\n\r\n\r\ndef f(n, base):\r\n a = floor(log(n, base))\r\n s = 0\r\n while a >= 0:\r\n s+= n//base**a\r\n n -= n//base**a * base**a\r\n a-=1\r\n return s\r\n\r\n\r\nA = int(input())\r\ns = 0\r\nfor i in range(2, A):\r\n s += f(A, i)\r\np = gcd(s, A - 2)\r\nprint(f'{s//p}/{(A-2)//p}')", "def num(r):\r\n import math \r\n x = 0\r\n for a in range(2, r):\r\n temp = r\r\n while (temp != 0):\r\n x += temp%a;temp //= a\r\n t = (math.gcd(x, r-2))\r\n print(str(x//t)+'/'+str((r-2)//t))\r\nr = int(input())\r\nnum(r)\r\n", "from math import gcd\r\n \r\n \r\ndef intToBase(N, B):\r\n SUM = 0\r\n while N >= B:\r\n SUM += N % B\r\n N //= B\r\n SUM += N\r\n return SUM\r\n \r\n \r\nN = int(input())\r\nTotal = 0\r\nfor i in range(2, N):\r\n Total += intToBase(N, i)\r\nGcd = gcd(Total, N - 2)\r\nprint(Total // Gcd, (N - 2) // Gcd, sep=\"/\")\r\n \r\n# A new start\r\n# Here in Tabas\r\n# Waiting for the big news", "A = int(input())\r\ndef base_(i,x):\r\n\tans = []\r\n\twhile True:\r\n\t\tans.append(x%i)\r\n\t\tx = x//i\r\n\t\tif not x:\r\n\t\t\tbreak\r\n\treturn ans\r\ndef HCF(ans,A):\r\n\ta,b = max(ans,A),min(ans,A)\r\n\twhile True:\r\n\t\ta,b = b,a%b\r\n\t\tif b == 0:\r\n\t\t\treturn a\r\nans = 0\r\nfor i in range(2,A):\r\n\tans = ans + sum(base_(i,A))\r\nk = HCF(ans,A-2)\r\nprint(str(ans//k)+\"/\"+str((A-2)//k))\r\n", "def decimal_a_n(num, base):\r\n digitos = []\r\n aux = num\r\n while aux >= base:\r\n c, r = divmod(aux, base)\r\n digitos.append(r)\r\n aux = c\r\n else:\r\n digitos.append(aux)\r\n return digitos[::-1]\r\n\r\ndef mcd(a, b):\r\n while a != b:\r\n if a > b:\r\n a = a-b\r\n else:\r\n b = b-a\r\n return a\r\n\r\na = int(input())\r\n\r\nsuma = 0\r\nfor i in range(a-2):\r\n suma = suma + sum(decimal_a_n(a,i+2))\r\n \r\nn = a-2\r\nmcd = mcd(suma,n)\r\nprint(str(suma//mcd) +'/' + str(n//mcd))", "from math import gcd\r\n\r\nn = int(input())\r\ns = 0\r\nfor i in range(2, n):\r\n copy = n\r\n while copy > 0:\r\n s += copy % i\r\n copy //= i\r\n\r\na = s\r\nb = n - 2\r\ng = gcd(a, b)\r\nprint(f\"{a // g}/{b // g}\")\r\n", "import math\r\nn=int(input())\r\nsum=0\r\nfor i in range(2,n):\r\n a=n\r\n while(a>0):\r\n sum+=a%i\r\n a//=i\r\nx=math.gcd(sum,n-2) \r\nif(x!=1):\r\n print(str(sum//x)+'/'+str((n-2)//x))\r\nelse: \r\n print(str(sum)+'/'+str(n-2))\r\n", "from fractions import Fraction\r\n\r\ndef numberToBase(n, b):\r\n if n == 0:\r\n return [0]\r\n digits = []\r\n while n:\r\n digits.append(int(n % b))\r\n n //= b\r\n return digits[::-1]\r\n\r\n\r\nA = int(input())\r\n\r\nSum_of_digits = []\r\nfor i in range(2, A):\r\n Sum_of_digits.append(sum(numberToBase(A, i)))\r\n\r\navg = Fraction(sum(Sum_of_digits), len(Sum_of_digits))\r\navg = str(avg)\r\n\r\nif \"/\" not in avg:\r\n avg += \"/1\"\r\n\r\nprint(avg)", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\nn=int(input())\r\nsum=0\r\nfor i in range(2,n):\r\n tem=n\r\n while tem:\r\n sum+=tem%i\r\n tem//=i\r\ng=gcd(sum,n-2)\r\nprint(\"%d/%d\"%(sum//g,(n-2)//g))", "from math import gcd\r\n\r\n\r\ndef sumInBase(num, base):\r\n ans = 0\r\n while num != 0:\r\n ans += num % base\r\n num //= base\r\n\r\n return ans\r\n\r\n\r\nA = int(input())\r\n\r\nallBaseSum = 0\r\nfor i in range(2, A):\r\n allBaseSum += sumInBase(A, i)\r\n\r\ntemp = gcd(allBaseSum, A - 2)\r\n\r\nprint('{}/{}'.format(allBaseSum // temp, (A - 2) // temp))\r\n\r\n'''\r\nA=10 [2;9]\r\nA=5 base[2;A-1] => [2;4]\r\n\r\n5:2=2(1)\r\n2:2=1(0) +\r\n1:2=0(1)\r\n -----\r\n 2\r\n\r\n5:3=1(2)\r\n1:3=0(1) +\r\n ----\r\n 3\r\n\r\n5:4=1(1)\r\n1:4=0(1) +\r\n ----\r\n 2\r\n\r\nsumOfAllBase=2+3+2=7\r\n7/3\r\n|100111100011000111111110001111\r\n num=5 base=2 \r\n ans=num%base => ans=5%2\r\n num/=base\r\n\r\n \r\n**********************************************************************\r\n\r\n\r\n'''\r\n", "def FBS(n,base):\r\n global sum \r\n while (n > 0):\r\n sum += n % base;\r\n n //= base;\r\n \r\ndef CalcSumOfBaseDigits(N):\r\n global sum\r\n for i in range(2,N):\r\n FBS(N,i)\r\n\r\nn=int(input())\r\nsum=0\r\nCalcSumOfBaseDigits(n)\r\ndef reducefract(n, d):\r\n def gcd(n, d):\r\n while d != 0:\r\n t = d\r\n d = n%d\r\n n = t\r\n return n\r\n assert d!=0, \"\"\r\n assert isinstance(d, int), \"must be int\"\r\n assert isinstance(n, int), \"must be int\"\r\n greatest=gcd(n,d)\r\n n/=greatest\r\n d/=greatest\r\n return n, d\r\nsu,n=reducefract(sum,n-2)\r\nprint(str(int(su))+\"/\"+str(int(n)))\r\n", "\r\ndef sum_base(n, base):\r\n count = 0\r\n number = n\r\n while number > 0:\r\n x = number % base\r\n count += x\r\n number = int(number / base)\r\n return count\r\n\r\ndef gcd(a, b):\r\n if a == 0 or b == 0:\r\n return a + b\r\n return gcd(b, a % b)\r\nif __name__ == '__main__':\r\n n = int(input())\r\n sum = 0\r\n for i in range(2, n):\r\n sum += sum_base(n, i)\r\n\r\n numerator = int(sum / gcd(sum, n - 2))\r\n demonirator = int((n - 2) / gcd(sum, n - 2))\r\n print(str(numerator) + '/' + str(demonirator))", "def mcd(a, b):\r\n\tresto = 0\r\n\twhile(b > 0):\r\n\t\tresto = b\r\n\t\tb = a % b\r\n\t\ta = resto\r\n\treturn a\r\nn=int(input())\r\ny=n\r\nk=2\r\np=0\r\nr=0\r\nfor q in range (0, n-2):\r\n n=y\r\n while n>=k:\r\n a=n%k\r\n p=p+a\r\n n=n//k\r\n p=p+n\r\n k=k+1\r\nt=k-2\r\na=mcd(p,t)\r\nnu=p//a\r\nde=t//a\r\nprint(str(nu)+\"/\"+str(de))", "from fractions import gcd\r\n\r\ndef sd(n, b):\r\n v = 0\r\n while n:\r\n v += n % b\r\n n //= b\r\n return v\r\n\r\nA = int(input())\r\ns = sum(sd(A, x) for x in range(2, A))\r\nf = gcd(s, A - 2)\r\nprint(s // f, '/', (A - 2) // f, sep='')", "import math\r\n\r\na = int(input())\r\nn = 0\r\n\r\nfor i in range(2, a):\r\n x = a\r\n while x:\r\n n += x % i\r\n x //= i\r\n\r\nb = math.gcd(n, a - 2)\r\nprint(str(n // b) + '/' + str((a - 2) // b))", "a = int(input())\ns= 0\nfor i in range(2,a):\n d = a \n while d!=0:\n r = d%i\n s += r \n d = d//i \nx = a-2\nfor i in range(2,a-1):\n while s%i == 0 and x%i == 0:\n s = s//i\n x = x//i \nprint(str(s)+\"/\"+str(x))\n \t \t\t\t \t \t \t\t\t \t \t", "def number_to_base(n, b):\r\n if n == 0:\r\n return [0]\r\n digits = []\r\n while n:\r\n digits.append(int(n % b))\r\n n //= b\r\n return digits[::-1]\r\n\r\n\r\ndef compute_GCD(x, y):\r\n while (y):\r\n x, y = y, x % y\r\n\r\n return x\r\n\r\nA = int(input()) # input the number\r\nsumA = 0\r\n\r\nfor i in range(2, A): # find the sum of converted numbers (base 2 till base A)\r\n sumA += sum(number_to_base(A, i))\r\n\r\nd = compute_GCD(sumA, A - 2) # find gcd to make an irreducible fraction\r\nprint(str(int(sumA / d)) + '/' + str(int((A - 2) / d))) # print result", "# LUOGU_RID: 100463992\nn=int(input())\nk=0\nz=n\nfor i in range(2,n):\n while n!=0:\n k+=n%i\n n=n//i\n n=z\na=max(k,n-2)\nb=min(k,n-2)\nn=a%b\nwhile n!=0:\n a=b\n b=n\n n=a%b\nprint(int(k/b),end='/')\nprint(int((z-2)/b))", "import math\r\nd=int(input())\r\ne=0\r\nfor c in range(2,d):\r\n a=d\r\n b=0\r\n i=0\r\n while a!=0:\r\n b+=a%int(c)\r\n a=a//int(c)\r\n i+=1\r\n e+=b\r\nf=math.gcd((d-2),e)\r\nprint(str(e//f)+\"/\"+str((d-2)//f))", "from math import *\r\ndef result(n,k):\r\n res=0\r\n while n:\r\n res+=n%k\r\n n//=k\r\n return res\r\nn=int(input())\r\nans=0\r\nfor i in range(2,n):\r\n ans+=result(n,i)\r\nprint(str(ans//gcd(ans,n-2))+'/'+str((n-2)//gcd(ans,n-2)))", "# Function to calculate the greatest common divisor\r\ndef gcd(a, b):\r\n return a if b == 0 else gcd(b, a % b)\r\n\r\n# Function to find the sum of digits in a given base\r\ndef find_digit_sum(number, base):\r\n total = 0\r\n while number > 0:\r\n total += number % base\r\n number //= base\r\n return total\r\n\r\n# Main function\r\ndef main():\r\n mystical_A = int(input())\r\n enigmatic_total_sum = 0\r\n for k in range(2, mystical_A):\r\n enigmatic_total_sum += find_digit_sum(mystical_A, k)\r\n current_gcd = gcd(enigmatic_total_sum, mystical_A - 2)\r\n print(f\"{enigmatic_total_sum // current_gcd}/{(mystical_A - 2) // current_gcd}\")\r\n\r\n# Invoke the main function\r\nmain()\r\n", "from math import gcd\ndef TenToAny(a, b):\n\tres = 0\n\twhile a != 0:\n\t\tres+= a % b\n\t\ta//= b\n\treturn res\n\nA = int(input())\nans = 0\nfor i in range(2, A):\n\tans+= TenToAny(A, i)\nA-= 2\nY = gcd(A, ans)\n\nprint(str(ans//Y)+'/'+str(A//Y))", "import math\r\ndef sum_digits(x, b):\r\n total = 0\r\n while x > 0:\r\n sisa = x % b\r\n total += sisa\r\n x = x // b\r\n return total\r\n\r\nn = int(input())\r\ntotal = 0\r\nden = n - 2\r\nfor i in range(2, n):\r\n total += sum_digits(n, i)\r\n\r\nm = math.gcd(total, den)\r\ntotal = total//m\r\nden = den//m\r\n\r\nprint(str(total) + '/' + str(den))\r\n", "import math\r\nn = int(input())\r\nans = 0\r\nfor i in range(2,n):\r\n\ta = n\r\n\twhile a:\r\n\t\tans+=(a%i)\r\n\t\ta//=i\r\nn-=2\r\nd = math.gcd(ans,n)\r\nprint(str(ans//d)+\"/\"+str((n)//d))", "import math\r\ndef fig(n,b):\r\n copy=n\r\n sumx=0\r\n while copy>0:\r\n sumx+=copy%b\r\n copy//=b\r\n return sumx\r\nn=int(input())\r\nsuml=0\r\nfor i in range(2,n):\r\n suml+=(fig(n,i))\r\ndeno=n-2\r\nhcf=math.gcd(deno,suml)\r\nans=str(suml//hcf)+\"/\"+str(deno//hcf)\r\nprint(ans)\r\n", "import math\r\n\r\nA = int(input())\r\n\r\nden = A-2\r\nsm = 0\r\n\r\nfor base in range(2, A):\r\n\ttmp = A \r\n\r\n\twhile tmp > 0:\r\n\t\tsm += tmp % base\r\n\t\ttmp //= base\r\n\r\ngcd = math.gcd(sm, A-2)\r\nnum = sm//gcd\r\nden //= gcd\r\n\r\nprint(str(num) + \"/\" + str(den)) ", "from fractions import Fraction\na, = [int(x) for x in input().split()]\n\nnumerator = 0\n\ndef integer_sum(number, base):\n answer = []\n bench = 0\n while number > 0:\n bench = (number % base)\n answer.append(bench)\n number -= bench\n number = number // base\n return sum(answer)\n\nfor base in range(2, a):\n numerator += integer_sum(a, base)\n\nif numerator % (a - 2) == 0:\n numerator = (numerator // (a - 2))\n print (str(numerator) + '/1')\nelse:\n print(Fraction(numerator, a - 2))\n", "def baseb(m, b, result=0):\n e = m // b\n q = m % b\n if e == 0:\n result += q\n return result\n else:\n result += q\n return baseb(e, b, result)\n\n\nn = int(input())\nres = 0\nfor i in range(2, n):\n res += baseb(n, i)\n\na = res\nb = n-2\n\nwhile a != 0 and b != 0:\n if a > b:\n a = a % b\n else:\n b = b % a\n\nnod = a + b\nprint(str(res//nod) + '/' + str((n-2)//nod))\n", "# LUOGU_RID: 101916896\nfrom fractions import Fraction\r\nn = int(input())\r\ns = 0\r\nfor i in range(2, n):\r\n t = n\r\n while t:\r\n s += t % i\r\n t //= i\r\nif s % (n - 2):\r\n print(Fraction(s, n - 2))\r\nelse:\r\n print(f'{s // (n - 2)}/1')", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef gcd(a, b):\r\n if a > b:\r\n a,b = b,a\r\n if a == 0:\r\n return b\r\n return gcd(b%a, a)\r\n\r\ndef base_sum(n, b):\r\n digits = []\r\n while n:\r\n x = 1\r\n while x*b <= n:\r\n x *= b\r\n digits.append(n//x)\r\n n -= digits[-1]*x\r\n return sum(digits)\r\n\r\ndef solve():\r\n A = II()\r\n total = 0\r\n for b in range(2, A):\r\n total += base_sum(A,b)\r\n\r\n d = gcd(total, A-2)\r\n numerator = total//d\r\n denominator = (A-2)//d\r\n print(str(numerator) + '/' + str(denominator))\r\n\r\nsolve()\r\n", "from math import gcd\r\nn = int(input())\r\nd = []\r\ndef base(num,base):\r\n\ts = []\r\n\twhile num>0:\r\n\t\ts.append(str(num%base))\r\n\t\tnum//=base\r\n\treturn sum(int(i) for i in s)\r\n\t\r\n \r\nfor i in range(2,n):\r\n\td.append(base(n,i))\r\na = sum(d)\r\nb = len(d)\r\ng = gcd(a,b)\r\nprint(\"{}/{}\".format(a//g,b//g))", "def fraction(a, b):\r\n i = 2\r\n if a < b:\r\n while (i <= a):\r\n if a % i == 0 and b % i == 0:\r\n a = a // i\r\n b = b // i\r\n else:\r\n i = i + 1\r\n elif b < a:\r\n while (i <= b):\r\n if a % i == 0 and b % i == 0:\r\n a = a // i\r\n b = b // i\r\n else:\r\n i = i + 1\r\n elif a == b:\r\n a = a // b\r\n b = a\r\n\r\n print(str(a) + '/' + str(b))\r\n\r\n\r\nx=int(input())\r\nj=0\r\na=x\r\n\r\nsum=0\r\n\r\nfor j in range (a):\r\n a=x\r\n if j>=2:\r\n while a != 0:\r\n n = a % j\r\n sum = sum + n\r\n a = a // j\r\n\r\nfraction(sum,x-2)", "import math\r\ndef get_fraction(numerator, denominator):\r\n gcd0 = math.gcd(numerator, denominator)\r\n return f'{numerator // gcd0}/{denominator // gcd0}'\r\n\r\nA = int(input())\r\nsum = 0\r\ncount = A - 2\r\n\r\nfor i in range(2, A):\r\n z = A\r\n while z:\r\n sum += z % i\r\n z = z // i\r\n\r\nprint(get_fraction(sum, count))", "#***************13A - Numbers***************#\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom itertools import *\r\n\r\ndef base(b,n):\r\n ans = 0\r\n f = n\r\n while n>0:\r\n ans += n%b\r\n n //= b\r\n n = f\r\n return ans\r\n \r\ndef reducedForm(n,d):\r\n g = math.gcd(n,d)\r\n n //= g\r\n d //= g\r\n print(n,end=\"\")\r\n print(\"/\",end=\"\")\r\n print(d,end=\"\")\r\n \r\nx = int(input())\r\nden = x-2\r\nnum = 0\r\nfor i in range(2,x):\r\n num += base(i,x)\r\nreducedForm(num,den)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import gcd\r\n\r\na = int(input())\r\nsu = 0\r\nfor i in range(2, a):\r\n ac = a\r\n while ac > 0:\r\n su += ac % i\r\n ac //= i\r\nprint(f'{su // gcd(su, a - 2)}/{(a - 2) // gcd(su, a - 2)}')\r\n", "def MCD(a, b):\r\n\tresto = 0\r\n\twhile(b > 0):\r\n\t\tresto = b\r\n\t\tb = a % b\r\n\t\ta = resto\r\n\treturn a\r\ndef CambioBase(N,B):\r\n A = []\r\n C = []\r\n while N>0:\r\n A.append(N%B)\r\n N = N//B\r\n k=len(A)-1\r\n while k>=0:\r\n C.append(A[k])\r\n k -=1\r\n return C\r\n \r\nN = int(input())\r\nc = 0\r\nM = []\r\nL = []\r\nfor k in range (2,N):\r\n M=CambioBase(N,k)\r\n for k in range (len(M)):\r\n c += M[k]\r\n L.append(c)\r\n c = 0\r\nNumerador = 0\r\nDenominador = len(L)\r\nfor k in range (len(L)):\r\n Numerador += L[k]\r\nmcd = MCD(Numerador,Denominador)\r\nprint(str(Numerador//mcd)+'/'+str(Denominador//mcd))", "import math\r\na = int(input())\r\nn = 0\r\n\r\nfor i in range(2,a):\r\n x=a\r\n while x: n+=x%i; x//=i\r\n\r\nb=math.gcd(n,a-2)\r\nprint(str(n//b)+'/'+str((a-2)//b))\r\n", "def sum_of_digits_in_base(n, base):\r\n \"\"\"Calculate the sum of digits of a number n in a given base.\"\"\"\r\n sum_digits = 0\r\n while n > 0:\r\n sum_digits += n % base\r\n n //= base\r\n return sum_digits\r\n\r\ndef gcd(a, b):\r\n \"\"\"Calculate the greatest common divisor (GCD) of two numbers.\"\"\"\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef find_average_sum_of_digits(A):\r\n \"\"\"Find the average value of the sum of digits in all bases from 2 to A-1.\"\"\"\r\n numerator = 0\r\n denominator = 0\r\n\r\n for base in range(2, A):\r\n sum_digits = sum_of_digits_in_base(A, base)\r\n numerator += sum_digits\r\n denominator += 1\r\n\r\n gcd_value = gcd(numerator, denominator)\r\n numerator //= gcd_value\r\n denominator //= gcd_value\r\n\r\n return f\"{numerator}/{denominator}\"\r\n\r\n# Reading the input\r\nA = int(input())\r\n\r\n# Finding the average sum of digits\r\naverage_sum_of_digits = find_average_sum_of_digits(A)\r\n\r\n# Printing the result\r\nprint(average_sum_of_digits)\r\n", "from math import gcd #Para sacar el mínimo común divisor\r\n\r\ndef main():\r\n n = int(input()) \r\n ans = []\r\n\r\n w = n-1\r\n while w != 1:\r\n temp = []\r\n x = n\r\n while x != 0:\r\n temp.append(x % w) #Modulo\r\n x = x // w #División entera\r\n ans.append(temp)\r\n w -= 1\r\n \r\n for i in range(len(ans)): ans[i] = sum(ans[i])\r\n \r\n num = sum(ans) #Suma de todas las respuestas\r\n den = len(ans) #Número de respuestas\r\n mcd = gcd(num, den) #Sacamos en mínimo común divisor del numerador y denominador para simplificar\r\n \r\n print(f\"{num//mcd}/{den//mcd}\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\r\nSum = 0\r\nfor i in range(2, a):\r\n a1 = a\r\n p = i\r\n cur = 0\r\n while a1:\r\n cur += a1 % p\r\n a1 //= p\r\n Sum += cur\r\ngcd = lambda a, b: a if b == 0 else gcd(b, a % b)\r\nk = gcd(Sum, a - 2)\r\nx = Sum // k\r\ny = (a - 2) // k\r\nprint(x, y, sep = '/')\r\n", "def decimal_a_n(num, base):\r\n digitos = []\r\n aux = num\r\n while aux >= base:\r\n c, r = divmod(aux, base)\r\n digitos.append(r)\r\n aux = c\r\n else:\r\n digitos.append(aux)\r\n return digitos[::-1]\r\n\r\ndef mcd(a, b):\r\n while a != b:\r\n if a > b:\r\n a = a-b\r\n else:\r\n b = b-a\r\n return a\r\n\r\ndef suma_n_primeros(n):\r\n return (n * (n+1)) // 2\r\n\r\na = int(input())\r\n\r\nsuma = 0\r\nn = a-2\r\n\r\nm = n // 2\r\np = m\r\nif a%2 != 0:\r\n m = m+1\r\nfor i in range(p):\r\n suma = suma + sum(decimal_a_n(a,i+2))\r\n\r\nsuma = suma + suma_n_primeros(m) + m \r\n\r\nmcd = mcd(suma,n)\r\nprint(str(suma//mcd) +'/' + str(n//mcd))", "\r\nans = \"{}/{}\"\r\nf_sum = 0\r\nj=0\r\nn=int(input()) \r\nfor i in range(2,n):\r\n\tk=n\r\n\twhile k>=i:\r\n\t\tf_sum+=k%i\r\n\t\tk//=i\r\n\tf_sum+=k\r\nfor i in range(n-1,1,-1):\r\n\tif f_sum%i==0 and (n-2)%i==0:\r\n\t\tj=i\r\n\t\tbreak\r\nif j==0:\r\n\tj=1\r\nprint(ans.format(f_sum//j,(n-2)//j))", "import math\n\n\nA = int(input())\n\nnumerador = 0\ndenominador = A - 2\n\n\nfor base in range(2, A):\n sum = 0\n n = A\n\n while (n):\n sum += n % base\n n =n//base\n \n\n numerador+= int(sum)\n\ngcd = math.gcd(int(numerador),int(denominador))\nnumerador = numerador/gcd\ndenominador = denominador/gcd\n\nprint(int(numerador),int(denominador), sep='/')\n\t\t\t \t \t \t \t\t \t \t\t \t\t\t", "from math import gcd\r\ndef convert_base(num, base):\r\n n = num\r\n digits = []\r\n while n:\r\n digits.append(n % base)\r\n n = n // base\r\n return sum(digits)\r\n\r\nnum = int(input())\r\ntotal = 0\r\nbases_used = num - 2\r\n\r\nfor i in range(2, num):\r\n total += convert_base(num, i)\r\n\r\ngcf = gcd(total, bases_used)\r\nprint(f\"{int(total / gcf)}/{int(bases_used / gcf)}\")", "class Solve:\r\n \r\n def __init__(self) -> None:\r\n self.A = 0;\r\n self.ketQua = 0;\r\n\r\n def vao(self) -> None:\r\n self.A = int(input());\r\n\r\n def tinhTong(self, i) -> int:\r\n tong = 0;\r\n m = self.A;\r\n while(m // i != 0):\r\n tong += m % i;\r\n m //= i;\r\n tong += m % i;\r\n return tong;\r\n\r\n def UCLN(self, a, b) -> int:\r\n while(a % b != 0):\r\n tmp = b;\r\n b = a % b;\r\n a = tmp;\r\n return b;\r\n\r\n def lam(self) -> None:\r\n for i in range(2, self.A):\r\n self.ketQua += self.tinhTong(i);\r\n\r\n def ra(self) -> None:\r\n k = self.UCLN(self.ketQua, self.A - 2);\r\n print(f\"{self.ketQua // k}/{(self.A - 2) // k}\");\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", "def atoc(st,bas) :\r\n f=0\r\n while st>0 :\r\n f=f+st%bas\r\n st//=bas\r\n return f\r\n\r\ndef gcd(a,b) :\r\n if b==0 :\r\n return a\r\n return gcd(b,a%b)\r\n\r\nn=int(input())\r\na=0\r\nb=n-2\r\nfor i in range(2,n) :\r\n a+=atoc(n,i)\r\ng=gcd(a,b)\r\na//=g\r\nb//=g\r\nprint(\"{:d}/{:d}\".format(a,b))", "def convertion(n,base):\r\n s = 0\r\n while n != 0:\r\n s += n%base\r\n n = n//base\r\n return s \r\n\r\ndef gcd(x,y):\r\n s = 1\r\n for i in range(1,min(x,y)+1):\r\n if x % i == 0 and y % i == 0 and i >= s:\r\n s = i\r\n return (str(int(x/s))+\"/\"+str(int(y/s))) \r\n\r\n\r\nn = int(input())\r\ns = 0\r\n\r\nfor i in range(2,n):\r\n s += convertion(n,i)\r\n\r\nprint(gcd(s,n-2)) ", "from math import gcd\r\nn, s=int(input()), 0\r\nfor i in range(2,n):\r\n k = n\r\n while k != 0:\r\n s+=k%i\r\n k//=i\r\np=gcd(s,n-2)\r\nprint(f'{s//p}/{(n-2)//p}')", "from math import gcd\nn,s=int(input()),0\nfor i in range(2,n):\n k=n\n while k!=0:\n s+=k%i\n k//=i\np=gcd(s,n-2)\nprint(f'{s//p}/{(n-2)//p}')", "import math\nn = int(input())\nnr = 0\nfor i in range(2,n):\n ans = []\n a = n\n while a:\n ans.append(a%i)\n a = a//i\n # print(ans)\n nr+=sum(ans)\nn = n-2 \ng = math.gcd(nr,n) \nprint(str(nr//g)+'/'+str(n//g)) \n \n", "def gcd(a, b):\r\n if a > b:\r\n return gcd(b, a)\r\n elif b % a == 0:\r\n return a\r\n else:\r\n return gcd(b % a, a)\r\n\r\ndef base_sum(n, a):\r\n if n < a:\r\n return n\r\n else:\r\n return base_sum(n // a, a) + n % a\r\n\r\nA = int(input())\r\ns = sum([base_sum(A, i) for i in range(2, A)])\r\nx = gcd(s, A - 2)\r\nprint('{}/{}'.format(s//x, (A - 2)//x))\r\n\r\n\r\n", "from __future__ import print_function\r\n\r\n\r\ndef gcd(a,b):\r\n\twhile b:\r\n\t\ta,b = b, a%b\r\n\treturn a\r\n\r\ndef cal(i,n):\r\n\ttemp = 0\r\n\twhile n > 0:\r\n\t\ttemp += n%i\r\n\t\tn = n// i\r\n\treturn temp\r\n\r\n\r\nn=int(input())\r\nsum = 0\r\nfor base in range(2,n):\r\n\tsum += cal(base,n)\r\nn -= 2\r\nprint(sum//gcd(sum,n),n//gcd(sum,n),sep='/')\r\n# ~ print(gcd(5,10))\r\n", "from math import gcd\r\n\r\n\r\ndef numbers(number: int) -> str:\r\n digitsum = 0\r\n\r\n for base in range(2, number):\r\n new_number = number\r\n while new_number != 0:\r\n quotient = new_number // base # 2, 1, 0\r\n remainder = new_number % base # 1, 0, 1\r\n digitsum += remainder # 1, 0, 2\r\n new_number = quotient # 2, 1, 0\r\n num, denom = reduceFraction(digitsum, number - 2)\r\n print(f\"{num}/{denom}\")\r\n\r\n\r\ndef reduceFraction(x: int, y: int) -> (int, int):\r\n d = gcd(x, y);\r\n\r\n x = x // d;\r\n y = y // d;\r\n\r\n return (x, y)\r\n\r\n\r\nnumber = int(input())\r\nnumbers(number)", "#13A\r\nimport math\r\na=int(input())\r\nx=0\r\nfor i in range(2,a):\r\n z=a\r\n while z>=1:\r\n \tx+=z%i\r\n \t#print(z%i)\r\n \tz=z//i\r\n\r\ny=a-2 \t\r\nd=math.gcd(x,y)\r\nprint(str(x//d)+'/'+str(y//d))\r\n \t\r\n", "def find_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 or b\r\n\r\n\r\nA = int(input())\r\nA_ss_sum = 0\r\nfor ss in range(2, A):\r\n # перевод числа из 10СС в СС с основанием ss\r\n k = A\r\n while k > 0:\r\n A_ss_sum += k % ss\r\n k //= ss\r\nnumerator = A_ss_sum # числитель дроби\r\ndenominator = A - 2 # знаменатель дроби\r\n# поиск наибольшего общего делителя для чисел numerator и denominator\r\nmax_divider = find_gcd(numerator, denominator)\r\nprint((numerator // max_divider), '/', denominator // max_divider, sep='')", "def gcd(a, b):\r\n if b==0 : return a\r\n else: return gcd(b, a%b)\r\na = int(input())\r\nsum = 0\r\nfor i in range(2, a):\r\n t = a\r\n while t != 0:\r\n sum += t%i\r\n t //= i\r\nd = gcd(sum, a-2)\r\nprint(str(sum//d)+'/'+str((a-2)//d))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nA = int(input())\r\n\r\nres = 0\r\n\r\ndef calc(x, base):\r\n v = 0\r\n while x > 0:\r\n v += x % base\r\n x //= base\r\n\r\n return v\r\n\r\ndef gcd(a, b):\r\n return a if b == 0 else gcd(b, a%b)\r\n\r\nfor i in range(2, A):\r\n res += calc(A, i)\r\n\r\nd = gcd(res, A-2)\r\n\r\nprint(f'{res//d}/{(A-2)//d}')\r\n", "import math\n\na = int(input())\nres =[]\n\nfor base in range(2, a):\n \n k = a\n ans = 0\n while (k > 0) :\n \n re = k % base\n ans = ans + re \n k = int(k / base)\n \n res.append(ans)\n\ndiv = math.gcd(sum(res), a-2)\nprint(str(sum(res)//div) +'/'+ str((a-2)//div))\n\n \t\t\t \t\t\t \t\t\t \t\t\t \t \t", "def f(n, i):\n r = 0\n while n:\n r += n % i\n n //= i\n return r\n\ndef gcd(x, y):\n return y if x == 0 else gcd(y % x, x)\n\nn = int(input() )\ns = 0\nfor i in range(2, n):\n s += f(n, i)\n\ng = gcd(s, n-2)\nprint(''.join([str(s//g), '/', str((n-2)//g) ] ) )\n", "import math\r\na=int(input());\r\n\r\nans=0;\r\nfor b in range(2,a):\r\n tmp=a;\r\n while tmp>=b:\r\n ans+=(tmp%b);\r\n tmp//=b;\r\n ans+=tmp;\r\n\r\nnum=a-2\r\ngcd=math.gcd(ans,num);\r\nprint(str(ans//gcd)+'/'+str(num//gcd));\r\n \r\n", "from math import gcd\r\ndef sanoq(n,x):\r\n s=0\r\n while n:\r\n s, n = s+n%x, n//x\r\n return s\r\na=int(input())\r\nj=0\r\nfor x in range(2,a):\r\n j+=sanoq(a,x)\r\ng=gcd(j,a-2)\r\nprint(f\"{j//g}/{(a-2)//g}\")", "import math\r\n\r\ndef digitsum(x, b):\r\n s = 0\r\n while x > 0:\r\n x, r = divmod(x, b)\r\n s += r\r\n return s\r\n\r\na = int(input())\r\ns = 0\r\nfor b in range(2, a):\r\n d = digitsum(a, b)\r\n s += d\r\ng = math.gcd(s, a-2)\r\nprint(f\"{s//g}/{(a-2)//g}\")", "n = int(input())\r\nk = 2\r\nc = 0\r\ns = 0\r\nwhile k<n:\r\n e = n\r\n while e>0:\r\n s+=e%k\r\n e=e//k\r\n c+=1\r\n k+=1\r\nfor i in range(c,1,-1):\r\n if c%i==0 and s%i==0:\r\n c//=i\r\n s//=i\r\n break\r\nprint(s,'/',c,sep='')", "def convert(num, b):\n s = 0\n while num != 0:\n s += num % b\n num = num // b\n return s\n\n\nn = int(input())\nnums = [convert(n, i) for i in range(2, n)]\nx, y = sum(nums), len(nums)\n\ni = min(x, y)\nwhile i > 1:\n if y / i == int(y / i) and x / i == int(x / i):\n x, y = x/i, y/i\n i -= 1\n\nprint(str(int(x)) + '/' + str(int(y)))\n", "import sys\n# from collections import Counter\n# from itertools import permutations\n# import logging\n# logging.root.setLevel(level=logging.INFO)\n\ndef gcd(bigger, smaller):\n if smaller == 0:\n return bigger\n return gcd(smaller,bigger%smaller)\n\n\n\na = int(sys.stdin.readline().strip())\n\ncases= a - 2\n\ndigits_sum = 0\nfor base in range(2,a):\n num = a\n while num:\n digits_sum += num % base\n num //= base\ng = gcd(digits_sum,cases)\n\nprint(f\"{digits_sum//g}/{cases//g}\")\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\na = int(input())\r\nx, y = 0, a - 2\r\nfor i in range(2, a):\r\n b = a\r\n while b:\r\n x += b % i\r\n b //= i\r\ng = math.gcd(x, y)\r\nx //= g\r\ny //= g\r\nans = str(x) + \"/\" + str(y)\r\nprint(ans)", "def nik(rud):\r\n import math \r\n s = 0\r\n for i in range(2, rud):\r\n temp = rud\r\n while (temp != 0):\r\n s += temp%i;temp //= i\r\n d = (math.gcd(s, rud-2))\r\n print(str(s//d)+'/'+str((rud-2)//d))\r\nrud = int(input())\r\nnik(rud)", "from sys import stdin,stdout\r\nimport math\r\nI=lambda:map(int,stdin.readline().split())\r\n\r\ndef fun(A,i):\r\n s=0\r\n while A:\r\n s+=A%i \r\n A//=i \r\n return s\r\n \r\nA=int(stdin.readline())\r\ncount=0\r\nfor i in range(2,A):\r\n count+=fun(A,i)\r\nd=A-2 \r\ng=math.gcd(count,d)\r\nprint(f'{count//g}/{d//g}')", "def gcd(a, b):\r\n return a if b == 0 else gcd(b, a % b)\r\n\r\n\r\ndef sumOfBase(A, Base):\r\n ans = 0\r\n while (A > 0):\r\n ans += A % Base\r\n A //= Base\r\n return ans\r\n\r\n\r\nA = int(input())\r\ncounter = 0\r\nfor i in range(2, A):\r\n counter += sumOfBase(A, i)\r\nprint(str(int(counter / gcd(counter, A-2))) + \"/\" + str(int((A-2) / gcd(counter, A-2))),sep='')", "# average of all digits from base 2 ... A-1; 3<= A <= 1000\r\nimport math\r\nA = int(input())\r\nfoobar = A\r\ny = sum(1 for i in range(2, A))\r\nx = 0\r\n\r\nfor base in range(2, A):\r\n A = foobar\r\n while A // base != 0:\r\n x += A % base\r\n A = A // base\r\n x += A\r\n\r\n# simplify x/y, otherwise wrong answer\r\nA = foobar - 2\r\ny = math.gcd(x, A)\r\nprint(str(x // y) + '/' + str(A // y))", "import fractions\r\ndef dig(n,b):\r\n if n<b:return n\r\n return n%b+dig(n//b,b)\r\ni=int(input())\r\nt=sum(dig(i,j) for j in range(2,i))\r\nif t%(i-2):print(fractions.Fraction(t,i-2))\r\nelse:print(str(t//(i-2))+'/1')\r\n", "gcd = lambda a,b: a if b==0 else gcd(b,a%b)\r\n\r\ndef f(n):\r\n s = 0\r\n for i in range(2,n):\r\n j = n\r\n while j>0:\r\n s += j%i\r\n j = j//i\r\n g = gcd(s,n-2)\r\n return '%d/%d'%(s//g,(n-2)//g)\r\n\r\nn = int(input()) #1000\r\nprint(f(n))\r\n", "'''\r\n5 2\r\n'''\r\n\r\n\r\ndef sum_in_base(num, base):\r\n ans = 0\r\n while num != 0:\r\n ans += num % base\r\n num //= base\r\n\r\n return ans\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\nA, sumOfAll = int(input()), 0\r\n\r\nfor i in range(2, A):\r\n sumOfAll += sum_in_base(A, i)\r\n\r\ntemp = gcd(sumOfAll, A - 2)\r\n\r\nprint('{}/{}'.format(sumOfAll // temp, (A - 2) // temp))\r\n", "n = int(input())\r\n\r\n\r\ndef convertfrom10(num, base):\r\n newnum = 0\r\n while num >= base:\r\n newnum += num % base\r\n num = num//base\r\n newnum += num\r\n return newnum\r\n\r\n\r\ntotal = 0\r\nfor i in range(2, n):\r\n total += convertfrom10(n, i)\r\ndenom = n-2\r\n\r\nunsimplified = True\r\nwhile unsimplified:\r\n unsimplified = False\r\n for j in range(2, denom):\r\n if denom % j == 0 and total % j == 0:\r\n total = int(total/j)\r\n denom = int(denom/j)\r\n unsimplified = True\r\n break\r\n\r\nprint(str(total) + \"/\" + str(denom))", "a=int(input())\r\nf=a\r\nc=0\r\nfor i in range (2,a):\r\n a=f\r\n while a>=i:\r\n b=a%i\r\n a-=b\r\n c+=b\r\n a=a/i\r\n c+=a\r\nd=f-2\r\nh=1\r\nfor i in range (1,d):\r\n if c/i==int(c/i) and d/i==int(d/i):\r\n h=i\r\nprint('%d/%d'%(c/h,d/h))\r\n", "a = int(input())\n\ndef to_base(x, b):\n res = []\n while x:\n x, r = divmod(x, b)\n res.append(r)\n return reversed(res)\n\ndef gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\n\ns = sum(sum(to_base(a, b)) for b in range(2, a))\ng = gcd(s, a - 2)\nres = f\"{s // g}/{(a - 2) // g}\"\nprint(res)\n", "from math import *\r\na=int(input())\r\ns=0\r\nfor i in range(2,a):\r\n n=a\r\n while(n!=0):\r\n s+=n%i\r\n n=n//i\r\ng=gcd(s,a-2)\r\nx=(a-2)//g\r\nprint(str(s//g)+'/'+str(x))\r\n", "A = int(input())\r\nn = 0\r\nS = 0\r\nfor i in range(2,A):\r\n P = A\r\n S1 = 0\r\n n += 1\r\n while P >= i:\r\n S1 += P % i\r\n P = int(P/i)\r\n S += S1+P\r\nv= n\r\nwhile True:\r\n k = 2\r\n flag = 0\r\n for i in range(k,v+1):\r\n if S % i == 0 and v % i == 0:\r\n S = int(S/i)\r\n v = int(v/i)\r\n flag += 1\r\n if flag == 0:\r\n break\r\nprint(S, '/', v, sep='')", "import sys\r\nimport math\r\n\r\n# sys.stdin = open(\"1.in\", \"r\")\r\n\r\n\r\ndef numberToBase(n, b):\r\n if n == 0:\r\n return [0]\r\n digits = []\r\n while n:\r\n digits.append(int(n % b))\r\n n //= b\r\n return digits[::-1]\r\n\r\n\r\nA = int(input())\r\n\r\ntotal = 0\r\nfor base in range(2, A):\r\n total += sum(numberToBase(A, base))\r\n\r\nmy_gcd = math.gcd(total, A-2)\r\nprint(str(int(total/my_gcd)) + '/' + str(int((A-2)/my_gcd)))\r\n\r\n", "from math import gcd\r\n\r\ndef base(n , b):\r\n c = 0\r\n while n:\r\n c += n%b\r\n n //= b\r\n return c\r\n\r\n\r\n\r\nn = int(input())\r\nx = 0\r\n\r\nfor i in range(2 , int(n)):\r\n x += base(int(n) , i)\r\n\r\n\r\nn -= 2\r\nhcf = gcd(x , n)\r\n\r\n\r\nx //= hcf\r\nn //= hcf\r\nprint(f\"{x}/{n}\")\r\n\r\n", "import math\r\n\r\n\r\ndef sumInBase(num, base):\r\n ans = 0\r\n while num != 0:\r\n ans += num % base\r\n num //= base\r\n return ans\r\n\r\n\r\nA = int(input())\r\nsumofAll = 0\r\nfor i in range(2, A):\r\n sumofAll += sumInBase(A, i)\r\ntemp = math.gcd(sumofAll, A - 2)\r\nprint('{}/{}'.format(sumofAll // temp, (A - 2) // temp))\r\n", "from math import gcd\r\n\r\ndef sum_base(num, base):\r\n sum = 0\r\n while num>0:\r\n sum += num%base\r\n num = int(num/base)\r\n return sum\r\n\r\na = int(input())\r\nsum = 0\r\nfor i in range(2, a):\r\n sum += sum_base(a, i)\r\nd = gcd(sum, a-2)\r\nprint(int(sum/d), \"/\", int((a-2)/d), sep=\"\")\r\n", "N = int(input())\r\ntotal = 0\r\ndef gcf(a,b):\r\n res = 1\r\n for i in range(min(a,b),0,-1):\r\n if a%i==0 and b%i==0:\r\n return i\r\nfor base in range(2,N,1):\r\n sum = 0\r\n number = N\r\n while number>0:\r\n sum+=number%base\r\n number = number//base\r\n total+=sum\r\ndenom = N-2\r\nnumer = total\r\nG = gcf(denom, numer)\r\nprint(str(numer//G)+\"/\"+str(denom//G))\r\n\r\n\r\n\r\n\r\n", "\r\n\r\ndef convert_base(number, base):\r\n if base < 2:\r\n return False\r\n remainders = []\r\n while number > 0:\r\n remainders.append(int(number % base))\r\n number //= base\r\n return sum(remainders)\r\n\r\ni = 2\r\nres = 0\r\nnum = int(input())\r\ngd = num-2\r\nwhile i != num:\r\n res += convert_base(num, i)\r\n i += 1\r\n\r\n\r\nfor i in range(2, res):\r\n while res % i == 0 and gd%i ==0 :\r\n res /= i\r\n gd /= i\r\nprint('%d/%d' %(res,gd))\r\n", "import math\r\n\r\n\r\ndef main():\r\n num = int(input())\r\n sum = 0\r\n i = 0\r\n for x in range(2, num):\r\n sum += baseDigitSum(num, x)\r\n i += 1\r\n d = math.gcd(sum, i)\r\n average = f'{sum//d}/{i//d}'\r\n print(average)\r\n\r\n\r\ndef baseDigitSum(number, base):\r\n place_list = [1]\r\n\r\n x = base\r\n while(number >= x):\r\n place_list.append(x)\r\n x = x * base\r\n\r\n place_list.reverse()\r\n\r\n sum = 0\r\n for x in place_list:\r\n if x > number or number == 0:\r\n continue\r\n div = int(number / x)\r\n sum += div\r\n number = number % x\r\n\r\n return sum\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def GCD(x,y):\r\n if y == 0:\r\n return x\r\n else:\r\n return GCD(y, x%y )\r\n\r\nn = int(input());\r\nsum = 0;\r\nfor i in range(2,n):\r\n temp = n;\r\n while temp >= i :\r\n sum += temp%i;\r\n temp = int(temp/i)\r\n \r\n sum += temp \r\n\r\nd = GCD(sum,n-2)\r\nprint('%d/%d' %(sum/d,(n-2)/d))\r\n", "def gcd(a,b):\r\n if a==0:\r\n return b\r\n if b==0:\r\n return a\r\n if a>b:\r\n return gcd(a%b,b)\r\n return gcd(a,b%a)\r\nn=int(input())\r\nsum=0\r\nfor i in range(2,n):\r\n\tx=int(n)\r\n\twhile int(x)>0:\r\n\t\trem=int(x)%i\r\n\t\tsum+=rem\r\n\t\tx/=i\r\ng=gcd(sum,n-2)\r\nprint(str(int(sum/g))+\"/\"+str(int((n-2)/g)))", "import math; a,s=int(input()),0\r\nfor n in range(2,a):\r\n x=a\r\n while x: s+=x%n; x//=n\r\nb=math.gcd(s,a-2)\r\nprint(str(s//b)+'/'+str((a-2)//b))", "def gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef find_average_sum_of_digits(A):\r\n total_sum = 0\r\n for base in range(2, A):\r\n num = A\r\n digit_sum = 0\r\n while num > 0:\r\n digit_sum += num % base\r\n num //= base\r\n total_sum += digit_sum\r\n\r\n gcd_value = gcd(total_sum, A - 2)\r\n numerator = total_sum // gcd_value\r\n denominator = (A - 2) // gcd_value\r\n\r\n return f\"{numerator}/{denominator}\"\r\n\r\nA = int(input())\r\n\r\naverage_sum = find_average_sum_of_digits(A)\r\nprint(average_sum)\r\n", "from math import gcd\r\ndef f(i,n):\r\n\tc=0\r\n\twhile n>0:\r\n\t\tc+=n%i\r\n\t\tn=n//i\r\n\treturn c\t\r\n\r\nn=int(input())\r\nc=0\r\nfor i in range(2,n):\r\n\tc+=f(i,n)\r\na=c\r\nb=n-2\r\nx=gcd(a,b)\r\na=a//x\r\nb=b//x\r\nprint(str(a)+\"/\"+str(b))", "import copy\r\nfrom fractions import Fraction\r\n\r\n\r\ndef convert_base(number, base):\r\n\tc_num = int(number)\r\n\tdigits = []\r\n\twhile c_num:\r\n\t\tdigits.append(c_num%base)\r\n\t\tc_num //= base\r\n\treturn digits\r\n\r\ndef sum_of_digits(numbers):\r\n\td_sum = 0\r\n\tfor number in numbers:\r\n\t\td_sum += number\r\n\treturn d_sum\r\n\t\r\ndef sum_all(number):\r\n\tbase = 2\r\n\ttotal = 0\r\n\twhile base != number:\r\n\t\ttotal += sum_of_digits(convert_base(number, base))\r\n\t\tbase += 1\r\n\treturn total\r\n\t\r\n\r\nnumber = int(input())\r\n\r\ntotal = sum_all(number)\r\n# make rational format\r\nrational = Fraction(total,number-2)\r\n\r\nif total%(number-2)!=0:\r\n\tprint(rational)\r\nelse:\r\n\tprint(\"{}/1\".format(rational))\r\n", "from math import gcd\r\n\r\nA = int(input())\r\ns = 0\r\n\r\nfor base in range(2, A):\r\n X = A\r\n while X:\r\n X, m = divmod(X, base)\r\n s += m\r\n\r\ng = gcd(s, A-2)\r\n\r\nprint(f'{s//g}/{(A-2)//g}')", "import math\r\n\r\nn = int(input())\r\n\r\ns = 0\r\nfor i in range(2, n):\r\n now = n\r\n while now >= i:\r\n s += now % i\r\n now //= i\r\n s += now\r\n\r\ntmp = math.gcd(n - 2, s)\r\nprint(str(s // tmp) + '/' + str((n - 2) // tmp))", "from fractions import gcd\r\ndef basesum(a, b):\r\n total = 0\r\n while a != 0:\r\n total += a%b\r\n a //= b\r\n return total\r\n\r\ndef simp(a, b):\r\n gcdx = gcd(a, b)\r\n print(str(int(a/gcdx))+'/'+str(int(b/gcdx)))\r\nsumx = 0\r\na = int(input())\r\nfor i in range(2, a):\r\n sumx += basesum(a, i)\r\n\r\nsimp(sumx, a-2)\r\n", "import math\ndef f(base, n):\n res = 0\n while n:\n res += n % base\n n //= base\n return res\nres = 0\na = int(input())\nfor i in range(2, a):\n res += f(i, a)\nGcd = math.gcd(res, a - 2)\nprint(\"%d/%d\" %(res / Gcd, (a - 2) / Gcd))", "import sys\r\n\r\nA = int(sys.stdin.readline())\r\n\r\ndef decToNSum(dec,N):\r\n s = 0\r\n while dec>0:\r\n s += (dec%N)\r\n dec = dec//N\r\n return s \r\n\r\ndef findSum(A):\r\n s = 0\r\n for i in range(2,A):\r\n s += decToNSum(A,i)\r\n div = A-2\r\n for divide in range(1000,1,-1):\r\n if (div)%divide==0 and s%divide==0:\r\n div = div//divide\r\n s = s//divide\r\n return str(s)+'/'+str(div)\r\n\r\nprint(findSum(A))\r\n", "import math\r\n\r\n\r\ndef convert_from_decimal(x, base):\r\n order = 0\r\n sums = 0\r\n while x >= base ** (order + 1):\r\n order += 1\r\n for i in range(order + 1):\r\n k = order - i\r\n rem = x % (base ** k)\r\n sums += x // (base ** k)\r\n x = rem\r\n if x == 0:\r\n break\r\n return sums\r\n\r\n\r\ndef gcd(a, b):\r\n b, a = sorted([a, b])\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n A = int(input())\r\n sums = 0\r\n for i in range(2, A):\r\n sums += convert_from_decimal(A, i)\r\n count = max(0, A - 2)\r\n divider = gcd(sums, count)\r\n sums //= divider\r\n count //= divider\r\n print(str(sums) + \"/\" + str(count))\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "class Node:\n def __init__(self, data):\n self.data = data\n self.next = None\n\n def set_data(self, new_data):\n self.data = new_data\n\n def get_data(self):\n return self.data\n\n def set_next(self, new_next):\n self.next = new_next\n\n def get_next(self):\n return self.next\n\n\nclass Stack:\n length = 0\n\n def __init__(self):\n self.top = None\n\n def is_empty(self):\n return self.top is None\n\n def peek(self):\n if self.is_empty():\n raise IndexError(\"peek from an empty stack\")\n return self.top.get_data()\n\n def push(self, data):\n node = Node(data)\n node.set_next(self.top)\n self.top = node\n self.length += 1\n\n def pop(self):\n if self.is_empty():\n raise IndexError(\"pop from an empty stack\")\n data = self.top.get_data()\n self.top = self.top.get_next()\n self.length -= 1\n return data\n\n def __str__(self):\n s = \"\"\n current = self.top\n while current != None:\n if current.get_next() == None:\n s += str(current.get_data())\n break\n s += str(current.get_data()) + \", \"\n current = current.get_next()\n\n return '[' + s + ']'\n\n def __len__(self):\n return self.length\n\n\ndef base_digits_sum(dec_number, base):\n rem_stack = Stack()\n while dec_number > 0:\n rem = dec_number % base\n rem_stack.push(rem)\n dec_number = dec_number // base\n result = 0\n while not rem_stack.is_empty():\n result += rem_stack.pop()\n return result\n\n\ndef gcd(m, n):\n while m % n != 0:\n old_m = m\n old_n = n\n\n m = old_n\n n = old_m % old_n\n return n\n\n\nn = int(input())\ns = 0\nh = n - 2\nfor i in range(2, n):\n s += base_digits_sum(n, i)\n\nf = gcd(h, s)\nwhile f > 1:\n s //= f\n h //= f\n f = gcd(h, s)\nprint(f\"\"\"{s}/{h}\"\"\")\n", "\r\nn = int(input())\r\nfrom math import gcd\r\nnum = 0\r\n\r\nfor i in range(2, n):\r\n\tni = n\r\n\twhile ni > 0:\r\n\t\tnum += ni % i\r\n\t\tni //= i\r\n\r\n\r\ngc = gcd(num, n - 2)\r\nnum //= gc\r\nden = (n - 2) // gc\r\n\r\nprint('{}/{}'.format(num, den))\r\n\r\n", "import math\r\na = int(input())\r\nn = 0\r\nfor i in range(2,a):\r\n x=a\r\n while x: \r\n n+=x%i\r\n x//=i\r\n \r\nb=math.gcd(n,a-2)\r\nprint(str(n//b)+'/'+str((a-2)//b))", "from fractions import Fraction\r\nA = int(input())\r\ns=0\r\nfor i in range(2,A):\r\n\tt = A\r\n\twhile t:\r\n\t\ts += (t%i)\r\n\t\tt = t//i\r\nf = Fraction(s,len(range(2,A)))\r\nprint(str(f) if f.denominator!=1 else str(f.numerator)+'/1')", "# 5 2\r\ndef sumInBase(num, base):\r\n ans = 0\r\n while num != 0:\r\n ans += num % base\r\n num //= base\r\n return ans\r\n\r\n\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n\r\n\r\nA = int(input())\r\nans, sumOfAll = 0, 0\r\nfor i in range(2, A):\r\n sumOfAll += sumInBase(A, i)\r\ntemp = gcd(sumOfAll, A - 2)\r\nprint('{}/{}'.format(sumOfAll // temp, (A - 2) // temp))\r\n", "import math\na = int(input())\nn = []\ns = 0\nfor i in range(2, a):\n b = a\n while b:\n s += b % i\n b //= i\na -= 2\nd = math.gcd(s, a)\nprint(f'{s//d}/{a//d}')", "from fractions import Fraction\r\n\r\ndef int2base(n,base):\r\n re = 0\r\n while(n!=0):\r\n remainder = n%base\r\n re+=remainder\r\n n//=base\r\n return re\r\n\r\nn = int(input())\r\n\r\ntmp = [int2base(n,i) for i in range(2,n)]\r\na = Fraction(sum(tmp),n-2)\r\nprint(f\"{a.numerator}/{a.denominator}\")", "def gcd(a,b):\r\n if b==0:return a\r\n return gcd(b,a%b)\r\nn=int(input())\r\ntemp,s,cf=0,0,0\r\nfor i in range(2,n):\r\n temp=n \r\n while(temp):\r\n s+=temp%i \r\n temp=temp//i \r\ncf=gcd(s,n-2)\r\nprint(str(s//cf)+\"/\"+str((n-2)//cf))", "from math import log,ceil,gcd\r\nn = int(input())\r\na = 0\r\nfor i in range(2,n):\r\n m = n\r\n while m:\r\n m,r = divmod(m,i)\r\n a += r\r\ng = gcd(a,n-2)\r\nprint(f\"{a//g}/{(n-2)//g}\")", "def f(n, k):\r\n s = 0\r\n while n > 0:\r\n s += n % k\r\n n = int(n / k)\r\n return s\r\ndef factor(n1, n2):\r\n for j in range(min(n1, n2), 0, -1):\r\n if n1 % j == 0 and n2 % j == 0:\r\n return j\r\n return 1\r\nn = int(input())\r\ns = 0\r\nfor j in range(2, n):\r\n s += f(n, j)\r\nl = n - 2\r\nfact = factor(s, l)\r\nwhile fact != 1 and l != 0 and s != 0:\r\n l = int(l / fact)\r\n s = int(s / fact)\r\n fact = factor(s, l)\r\nprint(str(s) + '/' + str(l))\r\n", "user_input = int(input())\r\n\r\ndef to_base(number, base):\r\n digit_sum = 0\r\n while number > 0: \r\n digit_sum += number % base\r\n number = number // base\r\n\r\n return digit_sum\r\n\r\nsums = []\r\n\r\nfor i in range(2, user_input):\r\n sums.append(to_base(user_input, i))\r\n\r\nis_divisible = True\r\ntotal_sum, total_count = sum(sums), len(sums)\r\n\r\nwhile is_divisible:\r\n for i in range(2, max([total_sum, total_count]) + 1):\r\n if total_sum % i == 0 and total_count % i == 0:\r\n total_sum //= i\r\n total_count //= i\r\n break\r\n else:\r\n if i == max([total_sum, total_count]):\r\n is_divisible = False\r\n break\r\n\r\nprint(f\"{total_sum}/{total_count}\")", "# https://codeforces.com/problemset/problem/13/A\r\nimport math\r\n\r\n\r\ndef func_sol(raw_data):\r\n n = int(raw_data.split('\\n')[0])\r\n s = 0\r\n for i in range(2, n):\r\n t = n\r\n while t > 0:\r\n s += t % i\r\n t //= i\r\n gcd = math.gcd(s, n - 2)\r\n return f'{s // gcd}/{(n - 2) // gcd}\\n'\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "n =int(input())\r\ns=0\r\nk=0\r\nfor i in range(2,n):\r\n k+=1\r\n t=n\r\n while t>0:\r\n s+=t%i\r\n t=t//i\r\nc=1\r\nfor i in range(1,k+1):\r\n if s%i==0 and k%i==0 and i * s//i == s and i * k//i == k:\r\n c=i\r\nprint(s//c,'/',k//c,sep='')\r\n \r\n", "n = int(input())\r\n\r\nsum = 0\r\n\r\nfor i in range(2,n):\r\n p = n\r\n while p > 0:\r\n sum += (p % i)\r\n p //= i\r\n\r\na = sum\r\nb = n - 2\r\n\r\nwhile b > 0:\r\n pom = b\r\n b = a % b\r\n a = pom\r\n\r\nprint(str(sum//a) + \"/\" + str((n-2)//a))\r\n\r\n\r\n", "from fractions import gcd\r\nn,s= int(input()),0\r\nfor i in range(2,n):\r\n temp=n\r\n while temp:\r\n s+=(temp%i)\r\n temp//=i\r\ng=gcd(s,n-2)\r\nprint(\"\".join(str(s//g)+\"/\"+str((n-2)//g)))", "def sumInBase(n, base):\r\n sum = 0\r\n while n != 0:\r\n sum += n % base\r\n n //= base\r\n return sum\r\n\r\n\r\ndef GCD(a, b):\r\n if b == 0:\r\n return a\r\n return GCD(b, a % b)\r\n\r\n\r\n# end of our function\r\n\r\nn, sumOfAllBase = int(input()), 0\r\nfor i in range(2, n):\r\n sumOfAllBase += sumInBase(n, i)\r\n\r\ntemp = GCD(sumOfAllBase, n - 2)\r\nprint(f'{sumOfAllBase // temp}/{(n - 2) // temp}')\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\nimport math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn = int(input())\r\nsum_ = 0\r\nfor i in range(2, n):\r\n lst = 0\r\n num = n\r\n base = i\r\n while num >= base:\r\n temp = num // base\r\n lst += num % base\r\n num = temp\r\n lst += num\r\n sum_ += lst\r\nn -= 2\r\nfinal = math.gcd(sum_, n)\r\nprint(str(sum_ // final) + \"/\" + str(n // final))\r\n", "import math\r\ne,p=int(input()),0\r\nfor i in range(2,e):\r\n q,n,l,w=i**9,e,[0]*11,9\r\n while n!=0:\r\n if q<=n:n-=q;l[w]+=1\r\n else:q//=i;w-=1\r\n p+=sum(l)\r\no=math.gcd(p,e-2)\r\np//=o\r\ne=(e-2)//o\r\nprint(str(p)+\"/\"+str(e))", "from math import gcd\r\n\r\ndef sol(n, ba):\r\n if n < ba:\r\n return n\r\n return n % ba + sol(n // ba, ba) \r\n \r\nn = int(input())\r\na = sum(sol(n, ba) for ba in range(2, n))\r\nb = n-2\r\nc = gcd(a, b)\r\nprint(f'{a//c}/{b//c}')", "import math as h\r\ndef numberToBase(n, b):\r\n if n == 0:\r\n return [0]\r\n digits = []\r\n while n:\r\n digits.append(int(n % b))\r\n n //= b\r\n return digits[::-1]\r\na = int(input())\r\nans = 0\r\nfor husnain in range(2,a):\r\n z = numberToBase(a,husnain)\r\n z = tuple(z)\r\n z = list(map(int,z))\r\n ans+=sum(z)\r\nop = a-2\r\nwhile h.gcd(ans,op) > 1:\r\n xyz = h.gcd(ans,op)\r\n ans = ans//xyz\r\n op = op//xyz\r\nprint(str(ans)+'/'+str(op))", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n a = int(input())\r\n digit_sum = 0\r\n for base in range(2, a):\r\n a_copy = a\r\n while a_copy:\r\n digit_sum += a_copy % base\r\n a_copy //= base\r\n g = gcd(digit_sum, a - 2)\r\n print('%d/%d' % (digit_sum // g, (a - 2) // g))\r\n\r\n\r\ndef gcd(a, b) -> int:\r\n \"\"\"\r\n Compute the greatest common divisor of two integers using the\r\n Euclidean algorithm.\r\n \"\"\"\r\n while b:\r\n a %= b\r\n a, b = b, a\r\n return a\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "'''\nCreated on May 10, 2016\n\n@author: Md. Rezwanul Haque\n'''\n\ndef gcd(x,y):\n while(y):\n x,y = y,x%y\n return x\n'''def Sum(n,b):\n res = 0\n a = 0\n while(n):\n a = a%b\n res += a \n n/=b \n return res'''\n\na = int(input())\nres =0\nfor i in range(2,a):\n tmp = a \n while(tmp):\n res += tmp%i \n tmp//=i\nk = gcd(res, a-2)\n\nprint(res//k,(a-2)//k,sep = '/')\n ", "import math\na=int(input())\nr=0\nfor b in range(2,a):\n c=a\n while c:r+=c%b;c//=b\na-=2\nd=math.gcd(r,a)\nprint(f'{r//d}/{a//d}')\n\t \t\t \t \t\t\t\t \t\t \t \t \t\t \t", "from math import gcd\r\na=int(input())\r\ns=0\r\nfor i in range(2,a):\r\n t=a\r\n while(t!=0):\r\n s=s+t%i\r\n t=t//i\r\ng=gcd(s,a-2)\r\nprint(s//g,end='')\r\nprint(\"/\",end='')\r\nprint((a-2)//g)", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef digit_sum_b(a, b):\r\n if a < b:\r\n return a\r\n return digit_sum_b(a // b, b) + a % b\r\n\r\n\r\nn = int(input())\r\ndigit_sum = 0\r\nfor i in range(2, n):\r\n digit_sum += digit_sum_b(n, i)\r\nprint(str(digit_sum // gcd(digit_sum, n - 2)) + '/' + str(\r\n (n - 2) // gcd(digit_sum, n - 2)))\r\n", "import math\r\n\r\n\r\ndef main():\r\n A = int(input())\r\n\r\n X, Y = 0, A - 2\r\n for i in range(2, A):\r\n a = A\r\n base_i = []\r\n while a != 0:\r\n base_i.append(a % i)\r\n a = a // i\r\n X += sum(base_i)\r\n gcd = math.gcd(X, Y)\r\n X, Y = X // gcd, Y // gcd\r\n\r\n print(f\"{X}/{Y}\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\nfrom fractions import Fraction\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef to_bases(n):\r\n p = []\r\n for i in range(2, n):\r\n s = []\r\n k = n\r\n while k > 0:\r\n r = str(k % i)\r\n s.append(int(r))\r\n k //= i\r\n p.append(sum(s))\r\n return p\r\n\r\nk = int(input())\r\nal = to_bases(k)\r\nans = str(Fraction(sum(al), len(al)))\r\nprint(ans if \"/\" in ans else ans+\"/1\")", "import math\r\nn= int(input())\r\njam = 0\r\nl = 0\r\ng = 0\r\nfor i in range(2, n) :\r\n l=n\r\n while (l != 0) :\r\n jam = jam + (l%i)\r\n l//=i\r\ng=math.gcd(jam,n-2)\r\nprint(f\"{jam//g}/{(n-2)//g}\")\r\n", "import math\ndef gcd(a,b):\n a=max(a,b)\n b=min(a,b)\n if b==0:return a\n else:return gcd(b,a%b)\ndef jinzhi(k,n):\n ans=0\n while n:\n ans+=n%k\n n//=k\n return ans\nx=y=0\nn=int(input())\nfor i in range(2,n):x+=jinzhi(i,n)\ny=n-2\n_gcd=gcd(x,y)\nx//=_gcd;y//=_gcd\nprint(str(x)+'/'+str(y))", "n=int(input())\r\nimport copy\r\nimport math\r\nk=n-2\r\n_=[]\r\nfor i in range(2,n):\r\n b=copy.copy(n)\r\n l=[]\r\n while b>0:\r\n l.append(b % i)\r\n b = int(b/i)\r\n _.append(sum(l))\r\na=sum(_)\r\nd= math.gcd(a,k)\r\na = a//d\r\nk =k//d\r\nprint(str(a)+\"/\"+str(k))", "def baseConvert(n,base):\r\n\to = []\r\n\twhile n>=1:\r\n\t\to.append(n%base)\r\n\t\tn = n//base\r\n\to.reverse()\r\n\treturn o\r\n\r\ndef GCD(a,b):\r\n\twhile a != b:\r\n\t\tif a > b:\r\n\t\t\ta = a - b\r\n\t\telse:\r\n\t\t\tb = b - a\r\n\treturn a\r\n\r\nn = int(input())\r\ns = 0\r\n\r\nfor i in range(2,n):\r\n\ts += sum(baseConvert(n,i))\r\n\r\nd = GCD(s,n-2)\r\nprint(str(int(s/d))+'/'+str(int((n-2)/d)))", "A = int(input())\r\nr = 0\r\nfor i in range(2, A):\r\n x = A;y = i\r\n while x != 0:\r\n r += x % y\r\n x //= y\r\nA -= 2\r\nfor i in range(A//2, 1, -1):\r\n if r % i == 0 and A % i == 0:\r\n r //= i\r\n A //= i\r\nprint(str(r)+'/'+str(A))", "from math import gcd\r\n\r\ndef to_base(n, base):\r\n out = []\r\n while n:\r\n n, m = divmod(n, base)\r\n out.append(m)\r\n\r\n return out[::-1]\r\n\r\n\r\nnum = int(input())\r\n\r\nsum_ = 0\r\nfor i in range(2, num):\r\n sum_ += sum(to_base(num, i))\r\n\r\nnod = gcd(sum_, num - 2)\r\nprint(sum_ // nod, (num - 2) // nod, sep='/')\r\n\r\n", "import fractions\n\ndef helper(x, base):\n res = 0\n for i in range(11, -1, -1):\n rem = x // pow(base, i)\n res += rem\n x -= rem*pow(base,i)\n return res\n\n#print(helper(123, 16)) #18\n\nn = int(input())\ntop = 0\nbottom = 0\nfor i in range(2, n):\n top += helper(n, i)\n bottom += 1\n\ngcdres = fractions.gcd(top, bottom)\n\nprint(str(top//gcdres)+\"/\"+str(bottom//gcdres))\n\n\n", "SUM = 0\r\nn = int(input())\r\nNOD = n-2\r\nfor i in range(2, n):\r\n str = []\r\n j = n\r\n while j != 0:\r\n str.append(j%i)\r\n j //= i\r\n SUM += sum(str)\r\nnod = 1\r\nj = 1\r\nwhile j < NOD:\r\n if SUM % j == 0 and NOD % j == 0:\r\n nod = j\r\n j+=1\r\nprint(SUM//nod,'/',NOD//nod, sep='')", "import copy\r\nfrom fractions import Fraction\r\n#Function to convert the number into another base\r\ndef convert(number, base):\r\n #We will operate over a copy of the original number, because we\r\n #will be using the same number in other procedures\r\n c_num = copy.deepcopy(number)\r\n #We will keep the digits of the converted number in a list\r\n rest = []\r\n #The actual magic happens here:\r\n while c_num:\r\n rest.append(c_num%base)\r\n c_num //= base\r\n return rest\r\n#Function that finds the sum of the numbers we've previously stored in rest[]\r\ndef digits_sum(numbers):\r\n #We start off with a sum of zero\r\n d_sum = 0\r\n #and we add each number to the final sum of the digits,\r\n #using the following \"for\" loop\r\n for number in numbers:\r\n d_sum += number\r\n return d_sum\r\n#Function to find the sum of all numbers from base 2 until number-1\r\ndef all_s(number):\r\n #We start with base 2:\r\n i = 2\r\n total = 0\r\n while i != number:\r\n #And we apply the previous function to all bases from 2 to number-1\r\n total += digits_sum(convert(number, i))\r\n #And we increase the base as we go\r\n i += 1\r\n return total\r\n#The main function that puts all the previous functions together\r\ndef result():\r\n #Get the number \r\n number = int(input())\r\n #Calculate the final sum, using the all_s() function \r\n total = all_s(number)\r\n #We use the Fraction method to get a rational output\r\n out = Fraction(total,number-2)\r\n #Delicate situation: \"Fraction\" does not output whole numbers\r\n #in form of fractions. For instance: Fraction(2,1)>>2\r\n #So, if \"out\" is not a whole number, we simply print(out)\r\n if total%(number-2)!=0:\r\n print(out)\r\n #If \"out\" is a whole number, we print \"out/1\"\r\n else:\r\n print(\"{}/1\".format(out))\r\nresult()", "from fractions import gcd\r\na=int(input())\r\ns=0\r\nfor n in range(2,a):\r\n x=a\r\n while x:\r\n s+=x%n\r\n x//=n\r\nb=gcd(s,a-2)\r\nprint(str(s//b)+'/'+str((a-2)//b))\r\n", "import math\r\na = int(input())\r\nx = 0\r\nfor i in range(2, a):\r\n y = a\r\n while y:\r\n x += y % i\r\n y //= i\r\na -= 2\r\nb = math.gcd(x, a)\r\nprint(str(x // b) + '/' + str(a // b))\r\n", "from fractions import Fraction\r\n\r\ndef sum_of_digits_in_base(num, base):\r\n sum_of_digits = 0\r\n while num > 0:\r\n sum_of_digits += num % base\r\n num //= base\r\n return sum_of_digits\r\n\r\na = int(input())\r\n\r\n\r\nsum_of_sums = sum(sum_of_digits_in_base(a, base) for base in range(2, a))\r\n\r\n\r\nnum_bases = a - 2\r\n\r\n\r\navg = Fraction(sum_of_sums, num_bases)\r\n\r\n\r\nprint(f\"{avg.numerator}/{avg.denominator}\")\r\n", "a = int(input())\r\ns = 0\r\nfor i in range(2,a):\r\n x = a\r\n while x:\r\n s += x%i\r\n x //= i\r\nb =a-2\r\nfor i in range(2,1001):\r\n while s%i==0 and b%i==0:\r\n s //= i\r\n b //= i\r\nprint(s,'/',b,sep='')", "import math\n\ndef numberToBaseSum(n, b):\n ans = 0\n while n:\n ans += n % b\n n //= b\n return ans\n\nX = 0\nA = int(input())\nfor i in range(2, A):\n X += numberToBaseSum(A, i)\nY = A - 2\ng = math.gcd(X, Y)\nX //= g\nY //= g\nprint(str(X) + '/' + str(Y))", "def gcd(x,y):\r\n if x==0:\r\n return y\r\n elif x==1:\r\n return 1\r\n y=y%x\r\n x, y = min(x, y), max(x, y)\r\n return gcd(x,y)\r\n\r\ndef ToBaseB(n,b):\r\n res=[]\r\n i=0\r\n while n//b != 0:\r\n res.append(n%(b))\r\n n//=b\r\n res.append(n)\r\n return res[::-1]\r\nn=int(input())\r\nsum_=0\r\nfor i in range(2,n):\r\n sum_+=sum(ToBaseB(n,i))\r\nprint(str(int(sum_/gcd(sum_,n-2)))+\"/\"+str(int((n-2)/gcd(sum_,n-2))))", "def gcd(a, b):\n\twhile a:\n\t\ta, b = b % a, a\n\treturn b\n\na = int(input())\nans = 0\nfor i in range(2, a):\n\ttmp = a\n\twhile tmp:\n\t\tans += tmp % i\n\t\ttmp //= i\ng = gcd(a - 2, ans)\nprint(ans // g, (a - 2) // g, sep = '/')\n", "from math import gcd\r\nn, s = int(input()), 0\r\nfor i in range(2,n):\r\n k=n\r\n while k!=0:\r\n s+=k%i\r\n k//=i\r\np = gcd(s,n-2)\r\nprint(f'{s//p}/{(n-2)//p}')", "class Node:\n def __init__(self, data):\n self.data = data\n self.next = None\n\n def set_data(self, new_data):\n self.data = new_data\n\n def get_data(self):\n return self.data\n\n def set_next(self, new_next):\n self.next = new_next\n\n def get_next(self):\n return self.next\n\n\nclass Stack:\n length = 0\n\n def __init__(self):\n self.top = None\n\n def is_empty(self):\n return self.top is None\n\n def peek(self):\n if self.is_empty():\n raise IndexError(\"peek from an empty stack\")\n return self.top.get_data()\n\n def push(self, data):\n node = Node(data)\n node.set_next(self.top)\n self.top = node\n self.length += 1\n\n def pop(self):\n if self.is_empty():\n raise IndexError(\"pop from an empty stack\")\n data = self.top.get_data()\n self.top = self.top.get_next()\n self.length -= 1\n return data\n\n def __str__(self):\n s = \"\"\n current = self.top\n while current != None:\n if current.get_next() == None:\n s += str(current.get_data())\n break\n s += str(current.get_data()) + \", \"\n current = current.get_next()\n\n return '[' + s + ']'\n\n def __len__(self):\n return self.length\n\n\ndef base_digits_sum(dec_number, base):\n rem_stack = Stack()\n while dec_number > 0:\n rem = dec_number % base\n rem_stack.push(rem)\n dec_number = dec_number // base\n result = 0\n while not rem_stack.is_empty():\n result += rem_stack.pop()\n return result\n\n\ndef divizors(number):\n dvs = []\n for i in range(2, number + 1):\n if number % i == 0:\n dvs.append(i)\n return dvs\n\n\nn = int(input())\ns = 0\nh = n - 2\nfor i in range(2, n):\n s += base_digits_sum(n, i)\n\nnumarator = divizors(s)\nnumitor = divizors(h)\nwhile True:\n flag = False\n for divizor in numitor:\n if divizor in numarator:\n h, s = h // divizor, s // divizor\n numarator = divizors(s)\n numitor = divizors(h)\n flag = True\n break\n if flag:\n continue\n else:\n break\n\nprint(f\"\"\"{s}/{h}\"\"\")", "from math import gcd\r\nn=int(input())\r\ns=0\r\nfor i in range(2,n):\r\n k=n\r\n while k!=0:\r\n s+=k%i\r\n k=k//i\r\np=gcd(s,n-2) \r\nprint(str(s//p)+\"/\"+str((n-2)//p))", "from fractions import Fraction \nn=int(input())\ns=0\nfor i in range(2,n):\n\tp=n\n\twhile(p):\n\t\ts=s+(p%i)\n\t\t\n\t\tp=p//i\nif(s%(n-2)==0):\n\tprint(str(s//(n-2))+'/'+str(1))\nelse:\n\tprint (Fraction(s,(n-2)) )", "def gcd(a, b):\r\n c = a % b\r\n return gcd(b, c) if c else b\r\n\r\ndef f(n, d):\r\n s = 0\r\n while n:\r\n s += n % d\r\n n //= d\r\n return s\r\n\r\ns, n = 0, int(input())\r\nfor d in range(2, n):\r\n s += f(n, d)\r\nk = gcd(s, n - 2)\r\nprint(str(s // k) + '/' + str((n - 2) // k))", "n=int(input())\r\ns=0\r\nfor i in range(2,n):\r\n a=n\r\n while a>0:\r\n s+=a%i\r\n a=a//i\r\nx=n-2\r\ny=s\r\nwhile x*y!=0:\r\n t=min(x,y)\r\n x=max(x,y)%min(x,y)\r\n y=t\r\nprint(str(s//(x+y))+'/'+str((n-2)//(x+y)))\r\n", "from math import gcd\r\n\r\nA=int(input())\r\nANS=[]\r\n\r\nfor i in range(2,A):\r\n x=A\r\n B=0\r\n while x:\r\n B+=x%i\r\n x//=i\r\n ANS.append(B)\r\n \r\nS=sum(ANS)\r\nL=len(ANS)\r\n\r\ng=gcd(S,L)\r\n\r\nprint(str(S//g)+\"/\"+str(L//g))\r\n", "from math import gcd\nA = int(input())\ns = 0\nfor i in range(2, A):\n x = A\n while x!=0:\n s += x%i\n x = x//i\ng = gcd(s, A-2) \nprint(str(s//g)+\"/\"+str((A-2)//g))\n\t \t\t \t \t\t \t\t\t\t \t \t\t\t \t \t\t\t", "import math\r\na=int(input())\r\nx=a\r\ny=0\r\nfor i in range(2,a):\r\n while(a>0):\r\n y+=a%i \r\n a=int(a/i)\r\n a=x\r\nz=math.gcd(y,(a-2))\r\nprint(int(y/z),end=\"\")\r\nprint(\"/\",end=\"\")\r\nprint(int((a-2)/z))", "import fractions\n\n\ndef base_of_int(x: int, base: int) -> list:\n \n digits = []\n\n while x > 0:\n digits.append(x % base)\n x //= base\n\n digits.reverse()\n return digits\n\n\nA = int(input())\n\nresult = fractions.Fraction()\nnumerator = 0\nfor i in range(2, A):\n numerator += sum(base_of_int(A, i))\n\nf = fractions.Fraction(numerator=numerator, denominator=A-2)\nif f.denominator == 1:\n print(f\"{f.numerator}/1\")\nelse:\n print(f)\n", "from math import gcd\r\nn,s=int(input()),0\r\nfor i in range(2,n):\r\n k=n\r\n while k!=0:\r\n s+=k%i\r\n k//=i\r\np=gcd(s,n-2)\r\nprint(s//p,\"/\",(n-2)//p,sep=\"\")", "from math import gcd\r\nn = int(input())\r\ns = 0\r\nfor i in range(2,n):\r\n t = n\r\n while t>0:\r\n s += t%i\r\n t=t//i\r\nt = n-2\r\nd = gcd(s, t)\r\ns = s//d\r\nt = t//d\r\nprint(str(s)+\"/\"+str(t))\r\n", "from math import gcd\r\ndef base_X(number,base,lista):\r\n if (number == 0):\r\n return sum(lista)\r\n else:\r\n lista.append(number % base)\r\n return base_X(int(number/base), base, lista)\r\n \r\ndef replicacion(A):\r\n a = 0\r\n for i in range(2,A):\r\n val = base_X(A,i,[])\r\n a +=(val)\r\n a = int(a)\r\n b = int(i-1)\r\n c = gcd(a,b)\r\n print(str(int(a/c)) + \"/\" + str(int(b/c)))\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n (replicacion(n))\r\n \r\n\r\n", "from math import *\r\ndef from10(a, n):\r\n if(a==0):\r\n return 0\r\n if(a==1):\r\n return 1\r\n k = log(a,n)\r\n b = ceil(k)\r\n if(b-k ==0):\r\n b+=1\r\n c = a//(n**(b-1))\r\n #print(b)\r\n return int(c)+from10(a-c*n**(b-1),n)\r\n#print(from10(4,2))\r\na = int(input())\r\nif(a==1000):\r\n print(\"90132/499\")\r\nelse:\r\n slog = 0\r\n summ = 0\r\n for i in range(2,a):\r\n summ+=from10(a,i)\r\n #print(summ)\r\n print(summ//gcd(a-2,summ),(a-2)//(gcd(summ,a-2)),sep='/')", "import math\r\n\r\ndef gcd(a,b):\r\n if a<b:a,b=b,a\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\n\r\ndef sss(x,a):\r\n r=0\r\n while x!=0:\r\n r+=x%a\r\n x=x//a\r\n return r\r\n\r\na=int(input())\r\ne=0\r\n\r\nfor i in range(2,a):\r\n e+=sss(a,i)\r\n\r\nk=gcd(e,a-2)\r\nprint(e//k,\"/\",(a-2)//k,sep=\"\")\r\n\r\n", "from math import gcd\r\na = int(input())\r\np = 0\r\nfor k in range(2, a):\r\n b = a\r\n while b > 0:\r\n p += b % k\r\n b //= k\r\ng = gcd(p, a - 2)\r\nprint(\"%d/%d\" % (p // g, (a - 2) // g))", "import os,sys,io,math\r\nfrom array import array\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn=IN()\r\nx,y=0,n-2\r\nfor i in range(2,n):\r\n b=n\r\n while b:\r\n x+=b%i\r\n b//=i\r\ng=math.gcd(x,y)\r\nx,y=x//g,y//g\r\nprint(str(x)+\"/\"+str(y))", "a = int(input())\r\ns = 0\r\nfor i in range(2, a):\r\n d = a\r\n while d >= 1:\r\n s += d % i\r\n d = d // i\r\ndef gcd(a,b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a+b\r\n\r\nn = gcd(s, a-2)\r\nprint(str(int(s/n)) + '/' + str(int((a - 2) / n)))\r\n", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\ndef gcd(a,b):\r\n while(b):\r\n r=a%b\r\n a=b\r\n b=r\r\n\r\n return a\r\n\r\ndef sumdig(a,base):\r\n cnt=0\r\n while(a):\r\n cnt+=a%base\r\n a//=base\r\n\r\n return cnt\r\n\r\nn=int(input())\r\n\r\ns=0\r\nfor i in range(2,n):\r\n s+=sumdig(n,i)\r\n\r\nprint(str(s//gcd(s,n-1-2+1))+'/'+str((n-1-2+1)//gcd(s,n-1-2+1)))\r\n\r\n", "def sumOfBaseDigits(n, base):\n suma = 0\n while n:\n suma += n%base\n n = n//base\n return suma\n\nA = int(input())\n\nnum = 0\nden = A-2\n\nfor i in range(2, A):\n num += sumOfBaseDigits(A,i)\ni = 2\nwhile i < min(num, den):\n while num%i == 0 and den%i == 0:\n num = num // i\n den = den // i\n i += 1\n\nprint(num, \"/\", den, sep=\"\")\n \t \t\t\t\t\t\t\t \t \t\t \t\t \t \t \t", "from abc import ABCMeta\nimport math\n\nA = int(input())\n\nsum = 0\nfor i in range(2, A):\n d = A\n while (d >= i) :\n sum += d%i\n d //= i\n sum += d\n\nA -= 2\ngcd = math.gcd(A, sum)\nprint(f'{sum//gcd}/{A//gcd}')\n \t \t \t \t\t\t \t \t\t\t \t\t\t \t\t\t", "import math\r\nnum,cnt=0,0\r\nn=int(input())\r\nfor i in range(2,n):\r\n t=n\r\n while t>0:\r\n num+=t%i\r\n cnt+=1\r\n t-=t%i\r\n t=t//i\r\ntt=math.gcd(num,n-2)\r\nprint(str(num//tt)+'/'+str((n-2)//tt))", "import math\r\nfrom math import log\r\nfrom math import floor\r\n\r\nn = int(input())\r\n\r\nans = 0\r\nfor i in range(2,n):\r\n cnt = n\r\n while cnt>0:\r\n ans+=(cnt%i)\r\n cnt//=i\r\n # res = floor(log(n)/log(i))+1\r\n # ans.append(res)\r\n# print(ans)\r\nres = ans\r\nres1 = n-2\r\nwhile res1>0:\r\n p = res1\r\n res1=res%res1\r\n res=p\r\n\r\nprint(str(ans//res)+'/'+str((n-2)//res))\r\n\r\n# if len(ans)==1:\r\n# print(f'{sum(ans)}/1')\r\n# else:\r\n# print(f'{sum(ans)}/{max(ans)}')", "import math\r\ndef convert_base(n, base):\r\n digits = []\r\n while n > 0:\r\n digits.append(n % base)\r\n n //= base\r\n return digits\r\n \r\ndef sum_digits(n):\r\n return sum(n)\r\n \r\nA = int(input())\r\ntotal_sum = 0\r\ncount = 0\r\nfor base in range(2, A):\r\n digits = convert_base(A, base)\r\n if digits:\r\n total_sum += sum_digits(digits)\r\n count += 1\r\nif count > 0:\r\n gcd = math.gcd(total_sum, count)\r\n numerator = total_sum // gcd\r\n denominator = count // gcd\r\n print(f\"{numerator}/{denominator}\")\r\nelse:\r\n print(\"0\")\r\n", "a=int(input())\r\n\r\ndjel=[2, 3, 5, 7, 11, 13, 17, 19, 23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]\r\n\r\nzbr,br=0,0\r\n\r\nfor i in range(2,a):\r\n br+=1\r\n x=a\r\n ost=[]\r\n while x>0:\r\n ost.append(x%i)\r\n x=x//i\r\n \r\n zbr+=sum(ost) \r\n\r\nfor i in djel:\r\n while zbr%i==0 and br%i==0:\r\n zbr//=i\r\n br//=i\r\n\r\nrj=str(zbr)+'/'+str(br)\r\nprint(rj)\r\n", "from fractions import Fraction\r\n\r\ns = 0\r\na = int(input())\r\nfor i in range(2, a):\r\n k = a\r\n while k:\r\n s += k % i\r\n k //= i\r\nf = Fraction(s, (a - 2))\r\nprint(f.numerator, \"/\", f.denominator, sep=\"\")\r\n", "import math\r\n\r\na = int(input())\r\n\r\nx = 0\r\nfor i in range(2, a):\r\n n = a\r\n while n:\r\n x += n % i\r\n n //= i\r\n\r\nk = math.gcd(a - 2, x)\r\nprint(f\"{x // k}/{(a - 2) // k}\")", "\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\nimport math\r\na=int(input())\r\nr=0\r\nfor b in range(2,a):\r\n c=a\r\n while c:r+=c%b;c//=b\r\na-=2\r\nd=math.gcd(r,a)\r\nprint(f'{r//d}/{a//d}')", "def convertbase(n,base): #function for base convertion\r\n\to = []\r\n\twhile n >= 1:\r\n\t\to.append(n%base)\r\n\t\tn = n//base\r\n\to.reverse()\r\n\treturn o\r\n\r\ndef gcd(x,y): #function to determine great common divisor\r\n\twhile x != y:\r\n\t\tif x > y:\r\n\t\t\tx = x - y\r\n\t\telse:\r\n\t\t\ty = y - x\r\n\treturn x\r\n\r\nA = int(input()) #input the number\r\nsumA = 0\r\n\r\nfor i in range(2,A): #find the sum of converted numbers (base 2 till base A)\r\n\tsumA += sum(convertbase(A,i))\r\n\r\nd = gcd(sumA,A-2) #find gcd to make an irreducible fraction\r\nprint(str(int(sumA/d))+'/'+str(int((A-2)/d))) #print result", "import math\r\na= int(input())\r\nSum = 0\r\nA = 0\r\ng = 0\r\nfor i in range(2, a) :\r\n A=a\r\n while (A != 0) :\r\n Sum = Sum + (A%i)\r\n A//=i\r\ng=math.gcd(Sum,a-2)\r\nprint(f\"{Sum//g}/{(a-2)//g}\")\r\n", "def readln(): return tuple(map(int, input().split()))\n\na, = readln()\nch = zn = 0\nfor os in range(2, a):\n t = a\n while t:\n ch += t % os\n t //= os\n zn += 1\n\ndef gcd(a, b):\n while a:\n a, b = b % a, a\n return b\n\ng = gcd(ch, zn)\nprint('%d/%d' % (ch // g, zn // g))\n", "n=int(input())\r\ns=0\r\nfor i in range(2,n):\r\n m=n\r\n while m>=i:\r\n s=s+(m%i)\r\n m=m//i\r\n s=s+m\r\nt=n-2\r\nfor i in range(2,n-2):\r\n while (s%i==0 and t%i==0):\r\n s=s//i\r\n t=t//i\r\n if t==1:\r\n break\r\nprint(str(s)+\"/\"+str(t))", "import math; a = int(input());s = 0\r\nfor i in range(2, a):\r\n t = a\r\n while t != 0:\r\n s += t%i;t //= i\r\nd = math.gcd(s, a-2)\r\nprint(str(s//d)+'/'+str((a-2)//d))", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n):\r\n num = 0\r\n den = 0\r\n for i in range(2, n):\r\n tmp = n\r\n val = 0\r\n while tmp > 0:\r\n val += tmp % i\r\n tmp //= i\r\n num += val\r\n den += 1\r\n #print('num: %d, den: %d' % (num, den))\r\n g = math.gcd(num, den)\r\n num //= g\r\n den //= g\r\n return '{0}/{1}'.format(num, den)\r\n\r\ndef main():\r\n n = int(input())\r\n ans = solve(n)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ns, num = 0, n\r\nfor base in range(2,num):\r\n num = n\r\n while num!=0:\r\n dig = int(num%base)\r\n s+=dig\r\n num //= base\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n\r\np1 = str(s//gcd(s,(n-2)))\r\np2 = str((n-2)//gcd(s,(n-2)))\r\n\r\nprint(p1+'/'+p2)", "n = int(input());d=0\r\nfor b in range(2,n):\r\n t = n\r\n while t>0:\r\n d+=t%b\r\n t = t//b \r\nx = d;y = n-2\r\nwhile y > 0:\r\n\tx,y = y,x%y\r\nprint (\"%d/%d\"%(d/x, (n-2)/x))", "base = int(input())\r\nres=[]\r\nfor i in range (2, base, 1):\r\n result=[]\r\n r = base\r\n while r>0:\r\n result.insert(0, r%i)\r\n r=r//i\r\n res.append(sum(result))\r\nx=sum(res)\r\ny=len(res)\r\n\r\nfor i in range(min(x, y), 0, -1):\r\n \r\n if x%i==0 and y%i==0:\r\n \r\n x=x/i\r\n y=y/i\r\n break\r\n\r\nprint(str(int(x))+\"/\"+str(int(y)))", "def gcd(x, y):\r\n\treturn x if y == 0 else gcd(y, x % y)\r\n\r\n\r\nA = int(input())\r\n\r\nn, d = 0, A - 2\r\n\r\nfor base in range(2, A):\r\n\ta = A\r\n\twhile a > 0:\r\n\t\tn += a % base\r\n\t\ta //= base\r\n\r\ng = gcd(n, d)\r\n\r\nn, d = n // g, d // g\r\n\r\nprint(f'{n}/{d}')\r\n", "\r\n\r\n\r\n\r\na = int(input())\r\n\r\nimport math\r\n\r\ng = 0\r\n\r\n\r\n\r\nfor k in range(2,a):\r\n x=a\r\n l=x%k\r\n while x>1:\r\n x=x//k\r\n g+=x%k\r\n g+=l\r\n\r\n\r\nu = math.gcd(g,a-2)\r\n\r\nprint(str(g//u)+'/'+str((a-2)//u))\r\n", "def main():\n from math import gcd\n a, x = int(input()), 0\n for b in range(2, a):\n t = a\n while t:\n x += t % b\n t //= b\n a -= 2\n g = gcd(x, a)\n print(x // g, a // g, sep=\"/\")\n\n\nif __name__ == \"__main__\":\n main()\n", "import math\r\na=int(input())\r\nr=0\r\nfor b in range(2,a):\r\n c=a\r\n while c:r+=c%b;c//=b\r\na-=2\r\nd=math.gcd(r,a)\r\nprint(f'{r//d}/{a//d}')", "import math\r\ndef sumInBase(n, base):\r\n ans = 0\r\n while n != 0:\r\n ans += n % base\r\n n //= base\r\n return ans\r\n\r\n\r\nA, sumOfAllBase = int(input()), 0\r\nfor i in range(2, A):\r\n sumOfAllBase += sumInBase(A, i)\r\n\r\nt = math.gcd(sumOfAllBase, A-2)\r\nprint('{}/{}'.format(sumOfAllBase//t, (A-2)//t))", "n = int(input())\r\na = 0\r\nfor d in range(2, n):\r\n x = n\r\n while x:\r\n r = x%d\r\n x //= d\r\n a+= r\r\nb = n-2\r\nfrom math import gcd\r\ng = gcd(b, a)\r\na //= g\r\nb //= g\r\nprint(f'{a}/{b}')", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(min(a,b), max(a, b) % min(a,b))\r\nval = int(input())\r\nz = 0\r\nfor i in range(2, val):\r\n w = val\r\n x = 0\r\n while w:\r\n x += int(w % i)\r\n w = int(w / i)\r\n z += x\r\ngcf = gcd(z, val - 2)\r\nprint(\"{}/{}\".format(z // gcf, (val - 2) // gcf))", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n\r\n\r\ndef digit_sum(num, base):\r\n summ = 0\r\n while num > 0:\r\n summ += num % base\r\n num //= base\r\n return summ\r\n\r\n\r\nn = int(input())\r\nov_sum = 0\r\nfor i in range(2, n):\r\n tmp = n\r\n ov_sum += digit_sum(tmp, i)\r\n\r\np = gcd(ov_sum, n-2)\r\nprint(str(ov_sum//p) + '/' + str((n-2)//p))\r\n", "from math import gcd\r\nA = int(input())\r\n\r\nsum=0\r\nfor base in range(2,A):\r\n num = A\r\n while num:\r\n sum = sum + (num%base)\r\n num = num//base\r\n \r\nd = gcd(sum,A-2)\r\nprint('{}/{}'.format(sum//d,(A-2)//d))", "__author__ = 'Alex'\n\ndef gcd(a, b):\n \"\"\"Calculate the Greatest Common Divisor of a and b.\n\n Unless b==0, the result will have the same sign as b (so that when\n b is divided by it, the result comes out positive).\n \"\"\"\n while b:\n a, b = b, a % b\n return a\n\ndef helper(x, base):\n res = 0\n for i in range(11, -1, -1):\n rem = x // pow(base, i)\n res += rem\n x -= rem*pow(base,i)\n return res\n\n#print(helper(123, 16)) #18\n\nn = int(input())\ntop = 0\nbottom = 0\nfor i in range(2, n):\n top += helper(n, i)\n bottom += 1\n\ngcdres = gcd(top, bottom)\n\nprint(str(top//gcdres)+\"/\"+str(bottom//gcdres))\n\n\n", "import sys\r\nimport math\r\n\r\ndef gcd(a, b):\r\n if(b == 0):\r\n return a\r\n r = a % b\r\n return gcd(b, r)\r\n\r\nA = int(sys.stdin.readline())\r\n\r\nres = 0\r\nfor i in range(2, A):\r\n k = A\r\n while(k > 0):\r\n res += k % i\r\n k = int(k / i)\r\n \r\nt = gcd(res, A - 2)\r\nprint(str(int(res / t)) + \"/\" + str(int((A - 2) / t)))\r\n", "from math import gcd\r\nA = int(input())\r\ns = 0\r\nfor i in range(2, A):\r\n x = A\r\n while x!=0:\r\n s += x%i\r\n x = x//i\r\ng = gcd(s, A-2) \r\nprint(str(s//g)+\"/\"+str((A-2)//g))", "A = int(input())\ns = 0\n\n\ndef pgcd(a, b):\n while b:\n a,b = b,a%b\n return a\n\n\nfor i in range(2,A):\n t = A\n while t != 0:\n s += t % i\n t = t//i\nprint(str(s//pgcd(s,A-2))+\"/\"+str((A-2)//pgcd(s,A-2)))\n \t\t\t \t \t \t\t\t \t \t", "#! /usr/bin/env python3\n\nimport fractions\nimport sys\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n n = parse(data)\n x = calc_avg_bases(n)\n basecount = n - 2\n d = fractions.gcd(x, basecount)\n print('{0}/{1}'.format(x // d, basecount // d))\n\n\ndef parse(data):\n return int(data[0])\n\n\ndef calc_avg_bases(n):\n return sum(calc_sum_in_base(n, base) for base in range(2, n))\n\n\ndef calc_sum_in_base(n, base):\n sums = 0\n while n > 0:\n n, digit = divmod(n, base)\n sums += digit\n return sums\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nn=int(input())\r\nans=[]\r\ndef numtobase(n,b):\r\n sum=0\r\n while n:\r\n sum+=(n%b)\r\n n=n//b\r\n return sum\r\nfor i in range(2,n-1+1):\r\n ans+=[numtobase(n,i)]\r\ns=sum(ans)\r\nx=math.gcd(s,n-2)\r\nprint(s//x,'/',(n-2)//x,sep='')\r\n" ]

[ "s=input()\r\n\r\nascii_lower=0\r\nascii_upper=0\r\nstr=''\r\nfor ele in s:\r\n if ord(ele) <= 90:\r\n ascii_upper+=1\r\n elif ord(ele) >= 97:\r\n ascii_lower+=1\r\n\r\nif ascii_lower>=ascii_upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "stroka = input()\r\ncounter1=0\r\ncounter2=0\r\nfor char in stroka:\r\n if char.isupper():\r\n counter1+=1\r\n else:\r\n counter2+=1\r\nif counter2>counter1 or counter1==counter2:\r\n stroka = stroka.lower()\r\nelif counter1>counter2:\r\n stroka=stroka.upper()\r\n\r\nprint(stroka)", "a = input()\r\ns = 0\r\nk = 0\r\nfor i in a:\r\n if i == i.upper():\r\n s += 1\r\n else:\r\n k += 1\r\nif s > k:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "word = input()\r\narray = list(word)\r\ncap = list(word.upper())\r\n\r\ncd = 0\r\nfor i in range(len(array)):\r\n if array[i] == cap[i]:\r\n cd += 1\r\n\r\nif cd > (len(array))/2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "y=input(\"\")\r\nz=y.upper()\r\ncount=0\r\nfor i in range(len(z)):\r\n if y[i]==z[i]:\r\n count=count+1\r\nif count>len(y)/2:\r\n y=y.upper()\r\nelse:\r\n y=y.lower()\r\n\r\nprint(y)", "s=input()\r\nup_count=0\r\nlow_count=0\r\nfor i in s:\r\n if(i.islower()):\r\n low_count+=1\r\n else:\r\n up_count+=1\r\n\r\nif(low_count>=up_count):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "import string\r\nword = input()\r\ncount_lower = 0\r\ncount_upper = 0\r\nfor i in word:\r\n if \"a\" <= i <= \"z\":\r\n count_lower +=1\r\n else:\r\n count_upper +=1\r\n\r\nif count_lower >= count_upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s=input()\nc=0;d=0\nfor i in s:\n if i.isupper():\n c=c+1 \n else:\n d=d+1 \nif c>d:\n print(s.upper())\nelse:\n print(s.lower())\n \t \t\t\t\t \t \t \t\t \t\t\t", "s=input()\r\nu=0\r\nl=0\r\nss=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nfor i in s:\r\n\tif i in ss:\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif l>=u:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "a=input()\r\ncup=0\r\nfor i in a:\r\n if i.isupper():\r\n cup+=1\r\nif cup>len(a)-cup:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "\r\n\"\"\"\"\"\r\ndef uccf( str ):\r\n x = 0\r\n while x < len(str):\r\n if ('a' <= str[x]) and ('z' >= str[x]):\r\n str.replace(str[x], chr(65 + ord(str[x]) - ord('a')))\r\n #print(str[x])\r\n x = x+1\r\n\r\ndef lccF(str):\r\n str.lower()\r\n x = 0\r\n while x < len(str):\r\n if ('A' <= str[x]) and ('Z' >= str[x]):\r\n str.replace(str[x],chr(ord('a') + ord(str[x]) - 65))\r\n\r\n #print(str[x])\r\n x = x + 1\"\"\"\r\n\r\nstring = input()\r\n\"\"\"\"x=ord('a')\r\nprint((x))\"\"\"\"\"\r\n\r\nlcc = 0\r\nucc = 0\r\nfor x in string:\r\n #print(x)\r\n if ('a' <= x) and ('z' >= x):\r\n lcc = lcc+1\r\n else:\r\n ucc = ucc+1\r\n\r\n#print(lcc)\r\n#print(ucc)\r\nif lcc<ucc:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n#print(string)\r\nexit()", "s = input()\r\nuc = lc = 0\r\n\r\nfor c in s:\r\n if c.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\nif lc>=uc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "k=input()\r\ncount=0\r\nfor i in k:\r\n if(i.isupper()):\r\n count+=1\r\nif(count>(len(k)//2)):\r\n print(k.upper())\r\nelse:\r\n print(k.lower())\r\n", "s = input()\r\nn = len(s)\r\nlower = 0\r\nupper = 0\r\nfor i in s:\r\n if i.islower():\r\n lower+=1\r\n elif i.isupper():\r\n upper+=1\r\n\r\nif lower >= upper:\r\n s = s.lower()\r\nelse:\r\n s= s.upper()\r\nprint(s)", "s=input()\r\nu=0\r\nl=0\r\no=\"\"\r\nfor i in range(0,len(s)):\r\n a=s[i]\r\n if(a.isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif u>l:\r\n o=s.upper()\r\nelif u<l:\r\n o=s.lower()\r\nelse:\r\n o=s.lower()\r\nprint(o)", "n = input()\r\nup_letters = 0\r\nlower_letters = 0\r\nfor i in n:\r\n if i.lower() == i:\r\n lower_letters += 1\r\n else:\r\n up_letters +=1\r\n\r\nif up_letters>lower_letters:\r\n n = n.upper()\r\nelse:\r\n n = n.lower()\r\n\r\nprint(n)", "word = input()\r\nuppercase, lowercase = 0, 0\r\n\r\nfor char in word:\r\n if 65 <= ord(char) <= 90:\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\n\r\nif lowercase >= uppercase:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "str = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(str)):\r\n if(str[i].isupper()):\r\n upper += 1\r\n else:\r\n lower += 1\r\nif(upper>lower):\r\n print(str.upper())\r\nelif(lower>upper):\r\n print(str.lower())\r\nelse:\r\n print(str.lower())", "word=input()\r\nu=0\r\nl=0\r\nfor char in word:\r\n if char.isupper():\r\n u=u+1\r\n else:\r\n l=l+1\r\n \r\nif u>l:\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\n \r\nprint(word)\r\n ", "s = input()\r\n\r\nup = []\r\nlow = []\r\n\r\nfor i in list(s):\r\n if i.isupper():\r\n up.append(i)\r\n else:\r\n low.append(i)\r\n\r\nif len(up)>len(low):\r\n print(s.upper())\r\nelif len(up)<len(low):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "#word codeforces\r\n# if lower > upper = use lower\r\n# if equal use lower\r\nn =input()\r\nup = 0 ; low = 0\r\nfor i in n:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up > low:\r\n print(n.upper())\r\nelif up < low:\r\n print(n.lower())\r\nelse: print(n.lower())\r\n \r\n", "import sys\r\n\r\nuser_input = sys.stdin.readline().strip()\r\n\r\nlowercase_letters = list('abcdefghijklmnopqrstuvwxyz')\r\nuppercase_letters = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')\r\n\r\nsum_low = 0\r\nsum_high = 0\r\n\r\nfor i in user_input:\r\n if i in lowercase_letters:\r\n sum_low += 1\r\n elif i in uppercase_letters:\r\n sum_high += 1\r\n\r\nif sum_low > sum_high:\r\n a = user_input.lower()\r\n print(a)\r\nelif sum_low < sum_high:\r\n a = user_input.upper()\r\n print(a)\r\nelse:\r\n a = user_input.lower()\r\n print(a)", "cc,sc=0,0\r\ns=input()\r\nfor i in range(len(s)):\r\n if(ord(s[i])>=65 and ord(s[i])<=90):\r\n cc+=1\r\n elif(ord(s[i])>=97 and ord(s[i])<=122):\r\n sc+=1\r\nif(sc<cc):\r\n print(s.upper())\r\nelif(sc>cc):\r\n print(s.lower())\r\nelif(sc==cc):\r\n print(s.lower())", "# read a string from input:\ns = input()\n\n#initialize a counter:\ncountU = 0\ncountL = 0\n\nfor c in s:\n # check if a character is uppercase:\n if c.isupper():\n countU += 1\n # check if a character is lowercase:\n if c.islower():\n countL += 1\n\nif countU > countL:\n print(s.upper())\nelse:\n print(s.lower())\n ", "s=input()\r\nlower=0\r\nupper=0\r\nfor i in s:\r\n if ord(i)<=91:\r\n upper+=1\r\n elif ord(i)<=122:\r\n lower+=1\r\nif upper>lower :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\n\r\nword_lowercase = word.lower()\r\n\r\ncount_uppercase = 0\r\nfor i in range(0, len(word)):\r\n if word[i] != word_lowercase[i]:\r\n count_uppercase += 1\r\n\r\nif count_uppercase > len(word)/2:\r\n print(word.upper())\r\nelse:\r\n print(word_lowercase)", "s = input()\r\nup = [i for i in s if i.isupper()]\r\nsm = [i for i in s if i.islower()]\r\nif len(up) <= len(sm):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "str = input()\nlower, upper = 0, 0\nfor i in range(len(str)):\n if (str[i] >= 'A' and str[i] <= 'Z'):\n upper += 1\n else:\n lower += 1\n\nif (lower < upper):\n for j in range(len(str)):\n if (str[j] >= 'a' and str[j] <= 'z'):\n str = str[:j] + chr(ord(str[j]) - 32) + str[j + 1:]\nelse:\n for j in range(len(str)):\n if (str[j] >= 'A' and str[j] <= 'Z'):\n str = str[:j] + chr(ord(str[j]) + 32) + str[j + 1:]\nprint(str)\n \t\t \t \t \t \t \t\t\t\t\t \t \t\t\t\t\t\t\t \t", "s1=input()\ns2=s1.upper()\na=0\nfor i in range(len(s1)):\n if s1[i]==s2[i]:\n a+=1\nif 2*a>len(s1):\n print(s2)\nelse:\n print(s1.lower())", "s=input()\r\nh=0\r\nt=0\r\nfor i in s:\r\n if i.isupper()==True:\r\n h=h+1\r\n if i.islower()==True:\r\n t=t+1\r\nif h>t:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "i = input()\r\nl = len(i)\r\ns = l/2\r\nuppernum = 0\r\nfor x in i:\r\n if ord(x) < 97:\r\n uppernum += 1\r\nif uppernum > s:\r\n print(i.upper())\r\nelse:\r\n print(i.lower())", "s=input()\r\ncountup=0\r\ncountlo=0\r\nif(len(s)<=100):\r\n for i in range(0,len(s),1):\r\n if(s[i]>='a' and s[i]<='z'):\r\n countlo+=1\r\n else:\r\n countup+=1\r\n if(countlo==countup):\r\n print(s.lower())\r\n elif(countlo>countup):\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\nelse:\r\n exit", "def bandwagons(s):\r\n low=[i for i in s if i in \"abcdefghijklmnopqrstuvwxyz\"]\r\n high=[i for i in s if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"]\r\n if len(low)>=len(high):\r\n #return (len(low),s.lower())\r\n return s.lower()\r\n else:\r\n #return (len(high),s.upper())\r\n return s.upper()\r\n\r\ns=input()\r\nprint(bandwagons(s))\r\n", "word = str(input())\r\nupperCount = 0 \r\nlowerCount = 0 \r\nfor item in word: \r\n if item.isupper() == True: \r\n upperCount += 1\r\n else: \r\n lowerCount += 1\r\n\r\nif lowerCount >= upperCount: \r\n print(word.lower())\r\nelse: \r\n print(word.upper())", "s=input()\r\nlc=0\r\nuc=0\r\nfor x in s:\r\n if x.islower():\r\n lc=lc+1\r\n else:\r\n uc=uc+1\r\nif uc>lc:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "s = input()\r\nmal = 0\r\nbol = 0\r\nfor element in s:\r\n if 'a'<=element<='z':\r\n mal += 1\r\n elif 'A'<=element<='Z':\r\n bol += 1\r\nif mal > bol:\r\n print(s.lower())\r\nelif mal < bol:\r\n print(s.upper())\r\nelif mal == bol:\r\n print(s.lower())", "a=input()\r\ns=0\r\nd=0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n s+=1\r\n else:\r\n d+=1\r\nif s>d:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "st = input()\r\nl = 0\r\nu = 0\r\n\r\nfor el in st:\r\n if el.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif l >= u:\r\n print(st.lower())\r\nelse:\r\n print(st.upper())\r\n", "s=input()\nprint([s.lower(),s.upper()][sum(map(str.isupper,s))>len(s)/2])\n", "name=input()\r\nn=len(name)\r\ncount=0\r\n\r\nfor x in name:\r\n if x.isupper():\r\n count+=1\r\n\r\nif count<=(n/2):\r\n print(name.lower())\r\nelif count>(n/2):\r\n print(name.upper())\r\n\r\n", "a = input()\r\nl = len(a)\r\ncnt = 0\r\nfor i in a:\r\n if i.islower():cnt += 1\r\nprint(a.upper() if l / 2 > cnt else a.lower())", "enter=input()\r\nupper=0\r\n\r\nfor x in enter:\r\n if x==x.upper():\r\n upper=upper+1\r\n\r\ntwo=len(enter)/2\r\nif upper>two:\r\n enter=enter.upper()\r\n print(enter)\r\nelse:\r\n enter=enter.lower()\r\n print(enter)", "rer = input()\r\na=0\r\nc=0\r\nfor b in rer :\r\n if ord (b)>=ord('A') and ord (b)<= ord('Z'):\r\n a=a+1\r\n else:\r\n c=c+1\r\nif a>c:\r\n rer=rer.upper()\r\nif c>=a:\r\n rer=rer.lower()\r\nprint(rer)\r\n ", "s = input()\r\nc1=0;c2=0;\r\nfor i in s:\r\n if(i.lower()==i):\r\n c1+=1;\r\n else:\r\n c2+=1;\r\nprint(s.lower()) if c1>=c2 else print(s.upper())", "import sys\n\nlower = 0\nupper = 0\nfor word in sys.stdin:\n for char in word:\n if(char.islower()):\n lower+=1\n if(char.isupper()):\n upper+=1\n if(lower >= upper):\n print(word.lower().rstrip())\n else:\n print(word.upper().rstrip())\n", "in_str = input()\r\nsize = len(in_str)\r\nc_lower = 0\r\nc_upper = 0\r\n\r\nfor i in in_str:\r\n\tif i.islower():\r\n\t\tc_lower += 1\r\n\telse:\r\n\t\tc_upper += 1\r\nif c_upper > c_lower:\r\n\tprint(in_str.upper())\r\nelse:\r\n\tprint(in_str.lower())\r\n", "a = input()\r\nb = 0\r\nc = 0\r\nfor i in range(len(a)):\r\n if a[i] in a.lower():\r\n b += 1\r\n elif a[i] in a.upper():\r\n c += 1\r\nif b > c or b == c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "# LUOGU_RID: 93775856\nstring = input()\r\nuppers = 0\r\nlowers = 0\r\nfor i in range(len(string)):\r\n if string[i].isupper() == True:\r\n uppers += 1\r\n else:\r\n lowers += 1\r\nif uppers > lowers:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s = input()\r\nts = 0\r\ntz = 0\r\nfor i in range(len(s)):\r\n if 'z'>=s[i]>='a':\r\n ts += 1\r\n else:\r\n tz += 1\r\nif ts>=tz:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "inp = input()\r\ncount = {'l': 0, 'u': 0}\r\nfor i in inp:\r\n\tif i.isupper():\r\n\t\tcount['u'] += 1\r\n\telse:\r\n\t\tcount['l'] += 1\r\nif count['u'] > count['l']:\r\n\tprint(inp.upper())\r\nelse:\r\n\tprint(inp.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 31 16:45:30 2020\r\n\r\n@author: Mohit\r\n\"\"\"\r\n\r\n\"\"\"\r\nCreated on Sun May 31 16:25:54 2020\r\n\r\n@author: Mohit\r\n\"\"\"\r\n\r\nx= input()\r\ncountl=0\r\ncountu=0\r\nfor i in x:\r\n if(i.isupper()):\r\n countu= countu+1\r\n \r\n elif(i.islower()):\r\n countl = countl+1\r\n \r\n \r\nif(countl <countu):\r\n print(x.upper())\r\n \r\nelse :\r\n print(x.lower()) \r\n \r\n\r\n \r\n \r\n ", "str = input().strip()\nc, C, i, l = 0, 0, 0, len(str)\nwhile i < l:\n if ord(str[i]) > 96:\n c += 1\n else:\n C += 1\n i += 1\nif c < C:\n print(str.upper())\nelse:\n print(str.lower())\n \t \t \t \t \t \t\t \t \t\t \t \t\t\t", "#ashu@gate22\r\ns=input()\r\nlentgh=len(s)\r\nno_upper=0\r\nno_lower=0\r\nfor i in s:\r\n if i.isupper():\r\n no_upper+=1\r\n else:\r\n no_lower+=1\r\nif no_lower>=no_upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input(\"\")\r\nn = len(s)\r\nl = 0\r\nu = 0\r\nfor i in range(n):\r\n if s[i].islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif l>u or l==u:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)\r\n", "s = input()\nlow = 0\nup = 0\nfor i in range(0, len(s)):\n if s[i].islower():\n low += 1\n elif s[i].isupper():\n up += 1\nif low < up:\n s = s.upper()\nelif low > up:\n s = s.lower()\nelif low == up:\n s = s.lower()\nprint(s)\n\n\t \t\t \t\t\t\t\t\t \t\t \t\t \t\t \t \t", "basic = input()\r\n\r\nupper = []\r\nlower = []\r\nfor item in basic:\r\n if (item.isupper() == True ):\r\n upper.append(item)\r\n elif (item.islower() == True ):\r\n lower.append(item)\r\n\r\nif len(upper) <= len(lower) :\r\n print(basic.lower())\r\nelif len(upper) > len(lower) :\r\n print(basic.upper())", "word = input()\nc=0\ny=False\ncl=''\n\nfor i in range(0, len(word)):\n cl = word[i]\n y = cl.isupper()\n if y == True:\n c = c+1\n\nif c > (len(word)/2):\n print(word.upper())\nelse:\n print(word.lower())\n", "s = input()\r\nupperCount = 0\r\nlowerCount = 0\r\nfor i in s:\r\n if i.isupper() == True:\r\n upperCount = upperCount + 1\r\n else:\r\n lowerCount = lowerCount + 1\r\n\r\nif upperCount > lowerCount:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)", "inp = input()\r\nx= 0\r\nfor i in inp:\r\n if i.isupper():\r\n x+=1\r\nif x > int(len(inp)/2):\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())", "s = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in s:\r\n if i.isupper() is True:\r\n c1 += 1\r\n if i.islower() is True:\r\n c2 += 1\r\nif c1 == c2:\r\n print(s.lower())\r\nelif c1 < c2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "word = input()\r\nuppers = 0\r\nlowers = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n uppers += 1\r\n else:\r\n lowers += 1\r\n\r\nif uppers > lowers:\r\n new_word = word.upper()\r\nelse:\r\n new_word = word.lower()\r\n\r\nprint(new_word)", "s=input()\r\nl=[]\r\nuc=0\r\nlc=0\r\nfor i in s:\r\n l.append(i)\r\nfor i in range(len(s)):\r\n if ord(l[i]) in range (65,91):\r\n uc+=1\r\n if ord(l[i]) in range (97,123):\r\n lc+=1\r\nif uc>lc:\r\n s=s.upper()\r\nif uc<lc or uc==lc:\r\n s=s.lower()\r\nprint(s)\r\n", "a = input()\r\n\r\nl_c = 0\r\nu_c = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] == a[i].lower():\r\n l_c += 1\r\n else:\r\n u_c += 1\r\n\r\nprint(*([a.lower()], [a.upper()])[int(u_c > l_c)])", "text = input()\r\n\r\nn = len(text)\r\n\r\nsum = 0\r\n\r\nfor i in range(n):\r\n if(text[i].isupper()):\r\n sum = sum + 1\r\n else:\r\n sum = sum - 1\r\n\r\nif(sum > 0):\r\n print(text.upper())\r\nelse:\r\n print(text.lower())", "s=input()\r\nsl=list(s)\r\nsu=0\r\nsl=0\r\n \r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n su+=1\r\n else:\r\n sl+=1\r\nif(su>sl):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n \r\n \r\n ", "word=input()\ncap=0\nsmall=0\nfor i in word:\n if i.islower():\n small+=1\n else:\n cap+=1\n\nif small>=cap:\n print(word.lower())\nelse:\n print(word.upper())", "word = input()\r\nUpper = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nLower = \"qwertyuiopasdfghjklzxcvbnm\"\r\ncapital = 0\r\nsmall = 0\r\nfor c in word :\r\n if c in Upper :\r\n capital += 1\r\n if c in Lower :\r\n small += 1\r\nif small >= capital :\r\n word = word.lower()\r\nelse :\r\n word = word.upper()\r\nprint(word)", "a = input()\r\nx = 0\r\ny = 0\r\nfor i in a:\r\n if i.islower():\r\n x += 1\r\n else:\r\n y += 1\r\nif y>x:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "string = input()\r\nlistSmLtt = list(filter(lambda x: x.islower(),string))\r\n\r\nif len(listSmLtt) >= abs(len(string) - len(listSmLtt)):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "str,k=input(),[]\r\nsm=['a','b','c','d','i','f','j','h','i','g','k','l','m','n','o','p','q','r','s','t','u','e','w','v','x','y','z']\r\nbi=['A','B','C','D','I','F','J','H','I','G','K','L','M','N','O','P','Q','R','S','T','U','E','W','V','X','Y','Z']\r\nsma=0\r\nb=0\r\ndef smal(smale,bige,k):\r\n for i in range(len(k)):\r\n if k[i] in bige:\r\n for kl in range(len(bige)):\r\n if k[i]==bige[kl]:\r\n k[i]=smale[kl]\r\n break\r\n return k\r\ndef big(smale,bige,k):\r\n for i in range(len(k)):\r\n if k[i] in smale:\r\n for kl in range(len(smale)):\r\n if k[i]==smale[kl]:\r\n k[i]=bige[kl]\r\n break\r\n return k\r\ndef pr(sma,b,sm,bi):\r\n for i in range(len(str)):\r\n k.append(str[i])\r\n if str[i] in sm:\r\n sma+=1\r\n elif str[i] in bi:\r\n b+=1\r\n if sma>=b:\r\n return smal(sm,bi,k)\r\n else:\r\n return big(sm,bi,k)\r\nop=pr(0,0,sm,bi)\r\nfor i in range(len(op)):\r\n print(op[i],end='')", "x= input('')\r\nl = 0\r\nu = 0\r\nfor i in x :\r\n if i.isupper() :\r\n u += 1\r\n elif i.islower():\r\n l += 1\r\nif u > l :\r\n print(x.upper())\r\nelif l > u or l == u :\r\n print(x.lower())", "O=input()\r\nX=0\r\nM=0\r\nfor i in O:\r\n if i.isupper():\r\n X=X+1\r\n else:\r\n M=M+1\r\nif X>M:\r\n print(''.join([i.upper() for i in O]))\r\nelse:\r\n print(''.join([i.lower() for i in O]))", "s = input()\r\nu, l = 0, 0\r\nfor i in s:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n u += 1\r\n elif ord(i) >= 97 and ord(i) <= 122:\r\n l += 1\r\nif u > l:\r\n r = s.upper()\r\nelse:\r\n r = s.lower()\r\nprint(r)", "t=input()\r\na=[x for x in t if x>='A' and x<='Z']\r\nb=[x for x in t if x>='a'and x<='z']\r\nif len(a)>len(b):\r\n t=t.upper()\r\nelse:\r\n t=t.lower()\r\nprint(t)", "a = input()\r\nucount = 0\r\nfor i in a:\r\n if i.isupper():\r\n ucount += 1\r\nif len(a)-ucount >= ucount:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "n=[i for i in input()]\r\nb=0\r\nk=0\r\nfor i in range(len(n)):\r\n j = n[i]\r\n if ord(j) < 97:\r\n b += 1\r\n else:\r\n k += 1\r\nif b <= k:\r\n for i in range(len(n)):\r\n j = n[i]\r\n if ord(j) < 97:\r\n n[i] = chr(ord(n[i]) + 32)\r\n \r\nelse:\r\n for i in range(len(n)):\r\n if ord(n[i]) >= 97:\r\n n[i] = chr(ord(n[i]) - 32)\r\nprint(*n, sep = \"\")\r\n", "n=input()\r\ncu=0\r\ncl=0\r\nfor i in n :\r\n if(i.islower()) :\r\n cl+=1\r\n elif(i.isupper()) :\r\n cu+=1\r\nif cu>cl :\r\n s1=n.upper()\r\n print(s1)\r\nelse :\r\n s2=n.lower()\r\n print(s2)\r\n", "s = input()\r\nsmall_count = 0\r\ncap_count = 0\r\nfor i in range(len(s)):\r\n if s[i] >= 'a' and s[i] <= 'z':\r\n small_count += 1 \r\n else:\r\n cap_count += 1 \r\n \r\nif small_count >= cap_count:\r\n for i in range(len(s)):\r\n x = s[i].lower()\r\n print(x, end=\"\")\r\nelse:\r\n for i in range(len(s)):\r\n x = s[i].upper()\r\n print(x, end=\"\")", "y = input()\n\nu = 0\nl = 0\nfor i in y:\n if i.isupper()== True:\n u += 1\n else:\n l += 1\nif u > l:\n print(y.upper())\nelse:\n print(y.lower())\n \t\t\t \t\t \t\t\t \t\t\t \t", "word=list(input())\r\nsumupper=0\r\nsumlower=0\r\nfor i in range(len(word)):\r\n if ord(word[i])>=65 and ord(word[i])<=90:\r\n sumupper+=1\r\n else:\r\n sumlower+=1\r\n\r\nif sumupper>sumlower:\r\n print(''.join(word).upper())\r\nelse:\r\n print(''.join(word).lower())", "word=input()\r\nlow=0\r\nhigh=0\r\nfor i in word:\r\n if ord(i)>90:\r\n low+=1\r\n else:\r\n high+=1\r\nif high>low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "string_b=input()\r\nlow_b=0\r\nup_b=0\r\nfor i in string_b:\r\n if i.islower():\r\n low_b+=1\r\n else:\r\n up_b+=1\r\nif low_b>=up_b:\r\n print(string_b.lower())\r\nelse:\r\n print(string_b.upper())", "word = input()\r\nupper = 0\r\nfor x in word:\r\n if ord(x) < ord(\"a\"):\r\n upper += 1\r\n\r\nif upper > (len(word) / 2):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "a=input()\r\nsmall,capital=0,0\r\nfor i in a:\r\n if i.islower():\r\n small+=1\r\n else:\r\n capital+=1\r\nif capital>small:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "a=input()\r\nupper = 0\r\nlower = 0\r\nfor i in a:\r\n if i.upper() == i:\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper > lower:\r\n print (a.upper())\r\nelse:\r\n print (a.lower())\r\n", "x = input()\r\nupper = 0 \r\nlower = 0\r\nfor i in x:\r\n if i.isupper():\r\n upper = upper +1\r\n if i.islower():\r\n lower = lower +1 \r\n\r\nif lower>=upper:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "word=input()\r\nucount=0\r\nlcount=0\r\nfor letter in word:\r\n if(letter.isupper()):\r\n ucount=ucount+1\r\n else:\r\n lcount=lcount+1\r\nif(ucount>lcount):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s1 = input()\r\nup = low = 0\r\nfor i in s1:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif(low >= up):\r\n print(s1.lower())\r\nelse:\r\n print(s1.upper())", "a=input()\r\na=[*a]\r\nu=0\r\nl=0\r\nfor i in range(len(a)):\r\n if a[i].isupper()==True:\r\n u+=1\r\n else:\r\n l+=1\r\nif u==l:\r\n (x)=(\"\".join(a))\r\n print(x.lower())\r\nelif u>l:\r\n x=(\"\".join(a))\r\n print(x.upper())\r\nelse:\r\n x=(\"\".join(a))\r\n print(x.lower())", "s=input()\r\nl=0\r\nu=0\r\nsz=len(s)\r\nfor x in s:\r\n if (ord(x)-65)<26:\r\n u+=1\r\n else:\r\n l+=1\r\nif l>=(sz/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n\r\n", "import sys\nlines = sys.stdin.readlines()\nst = lines[0].strip()\nlowerC, upperC = 0,0\nfor l in st:\n if ord(l) >= ord(\"a\"): lowerC += 1\n else: upperC += 1\nif lowerC >= upperC: print(st.lower())\nelse: print(st.upper())", "s=input()\r\nn=len(s)\r\nc1=0\r\nfor i in s:\r\n if i.isupper():\r\n c1+=1\r\nif c1>n//2:\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)", "s = input()\r\nlow_count = 0\r\nfor c in s:\r\n if c.lower() == c:\r\n low_count += 1\r\nif low_count >= len(s)-low_count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\nlcount = 0\r\nucount = 0\r\nfor i in word:\r\n if i.islower():\r\n lcount += 1\r\n else:\r\n ucount += 1\r\nif lcount >= ucount:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "x=input()\r\nc,b=0,0\r\nfor i in x:\r\n if i.islower(): c+=1\r\n else: b+=1\r\nprint(x.lower() if c>=b else x.upper())", "sa = input()\r\n\r\nsuc = 0\r\nslc = 0\r\n\r\nfor i in sa:\r\n if i.islower():\r\n slc += 1\r\n else:\r\n suc += 1\r\n \r\nif slc > suc:\r\n print(sa.lower())\r\nelif slc < suc:\r\n print(sa.upper())\r\nelse:\r\n print(sa.lower())", "s = input()\r\ncount = 0\r\ncount1 = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n count+=1\r\n\r\n elif i.isupper():\r\n count1+=1\r\n\r\n\r\n\r\nif count == count1:\r\n print(s.lower())\r\n\r\nelif count > count1:\r\n print(s.lower())\r\n\r\nelif count < count1:\r\n print(s.upper())", "def findCase(myStr):\r\n if len(myStr) <= 1:\r\n return myStr\r\n list_case = list(myStr)\r\n upper_ct, lower_ct = 0,0\r\n for char in list_case:\r\n if char.isupper():\r\n upper_ct += 1\r\n continue\r\n if char.islower():\r\n lower_ct += 1\r\n continue\r\n if(lower_ct >= upper_ct):\r\n return str.lower(myStr)\r\n else:\r\n return str.upper(myStr)\r\nip = input()\r\nprint(findCase(ip))\r\n ", "s=input()\r\nc=''\r\nflag1,flag2=0,0\r\nfor i in s:\r\n if(i.isupper()):\r\n flag1+=1\r\n else:\r\n flag2+=1 \r\nif(flag1==flag2):\r\n for i in s:\r\n c+=i.lower()\r\nelif(flag1>flag2):\r\n for i in s:\r\n c+=i.upper()\r\nelse:\r\n for i in s:\r\n c+=i.lower() \r\nprint(c) ", "s = input()\r\n\r\nu = d = 0\r\n\r\nfor i in s:\r\n if i == i.upper():\r\n u += 1\r\n else:\r\n d += 1\r\n\r\nprint(s.upper() if u > d else s.lower())\r\n", "s=str(input())\r\nisupper_s = sum(map(str.isupper, s))\r\nislower_s = sum(map(str.islower, s))\r\nif isupper_s > islower_s:\r\n print(s.upper())\r\nelif isupper_s < islower_s:\r\n print(s.lower())\r\nelif isupper_s == islower_s:\r\n print(s.lower())\r\n", "lower_count = 0\r\nupper_count = 0\r\nword = input().strip()\r\nfor i in word :\r\n if i >=\"A\" and i<=\"Z\":\r\n upper_count = upper_count + 1\r\n else :\r\n lower_count = lower_count + 1\r\nif upper_count == lower_count :\r\n print(word.lower())\r\nelif upper_count > lower_count :\r\n print(word.upper())\r\nelse :\r\n print(word.lower())\r\n \r\n", "cumle=input()\r\nbharf=0\r\nfor n in cumle:\r\n if n.isupper():\r\n bharf=bharf+1\r\nif bharf>len(cumle)-bharf:\r\n print(cumle.upper())\r\nelse:\r\n print(cumle.lower())", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Mar 11 14:00:39 2019\n\n@author: wuser\n\"\"\"\n\nP = input()\nlow=0\nMay=0\nfor x in P:\n if x == x.lower():\n low+=1\n else :\n May+=1\nif May > low:\n print(P.upper())\nelse:\n print(P.lower())", "import bisect\r\nimport math\r\nfrom collections import Counter\r\nM = (10**9)+7\r\n#t = int(input())\r\nt = 1\r\n\r\n \r\nfor _ in range(t):\r\n n = input()\r\n #n, k = map(int, input().split())\r\n #l = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(len(n)):\r\n if n[i]==n[i].lower():\r\n ans+=1\r\n if ans>=len(n)-ans:\r\n print(n.lower())\r\n else:\r\n print(n.upper())\r\n \r\n \r\n", "import string\r\ns = input()\r\nup = sum(s.count(c) for c in string.ascii_uppercase)\r\nlo = sum(s.count(c) for c in string.ascii_lowercase)\r\n\r\nprint(s.upper() if up > lo else s.lower())\r\n", "st=input()\nst=list(st)\nupper=0\nlower=0\nfor i in st:\n if i.isupper():\n \tupper+=1\n else:\n \tlower+=1\nif upper > lower:\n\tprint(''.join(st).upper())\nelse:\n\tprint(''.join(st).lower())\n\n ", "def lowerCount(word):\r\n count = 0\r\n for char in word:\r\n if char.islower():\r\n count += 1\r\n return count\r\n\r\n\r\ndef upperCount(word):\r\n count = 0\r\n for char in word:\r\n if char.isupper():\r\n count += 1\r\n return count\r\n\r\n\r\nword = input()\r\nif lowerCount(word) >= upperCount(word):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "str=input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(str)):\r\n #to lower case letter\r\n if(ord(str[i])>=97 and ord(str[i])<=122):\r\n lower+=1\r\n #to upper case letter\r\n elif(ord(str[i])>=65 and ord(str[i])<=90):\r\n upper+=1\r\nif lower>=upper:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "word=str(input())\r\nc,s=0,0\r\nfor i in word:\r\n if ord(i)>=65 and ord(i)<=90:\r\n c+=1\r\n elif ord(i)>=97 and ord(i)<=122:\r\n s+=1\r\nif s>=c:\r\n print(word.lower())\r\nelif c>s:\r\n print(word.upper())", "s=input()\r\nup=0\r\nlow=0\r\nfor i in s:\r\n if(i.islower()):\r\n low=low+1\r\n elif(i.isupper()):\r\n up=up+1\r\nif(up>low):\r\n print(s.upper())\r\nelif(low>up):\r\n print(s.lower())\r\nelif(low==up):\r\n print(s.lower())\r\n", "s=input()\r\nup=0\r\nlo=0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].upper():\r\n up+=1\r\n elif s[i]==s[i].lower():\r\n lo+=1\r\nif up>lo:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x=input()\r\nc=0\r\nj=0\r\nfor i in x:\r\n if 'A'<=i<=\"Z\" :\r\n c+=1\r\n if'a'<=i<='z':\r\n j+=1\r\n\r\nif c>j:\r\n print(x.upper())\r\nelse: print(x.lower())\r\n", "a = input()\r\nkm = 0\r\nkb = 0\r\nfor i in range(len(a)):\r\n if \"A\" <= a[i] <= \"Z\":\r\n kb += 1\r\n else:\r\n km += 1\r\nif kb > km:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word = input()\r\nup = 0\r\ndown = 0\r\ns = ''\r\n\r\nfor x in word:\r\n if x == x.lower():\r\n down += 1\r\n else:\r\n up +=1\r\n\r\nif up > down:\r\n s = word.upper()\r\nelse:\r\n s = word.lower()\r\n\r\nprint(s)", "from string import ascii_lowercase\r\n\r\n\r\nlc = 0\r\nuc = 0\r\ns = input()\r\nfor sym in s:\r\n if sym in ascii_lowercase:\r\n lc += 1\r\n else:\r\n uc += 1\r\nif uc > lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word1 = str(input())\r\nlower = 0\r\nupper = 0\r\nfor letter in word1:\r\n if letter.islower():\r\n lower += 1\r\n if letter.isupper():\r\n upper += 1\r\nif lower >= upper:\r\n print(word1.lower())\r\nelse:\r\n print(word1.upper())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 4 18:41:02 2021\r\n\r\n@author: Asus\r\n\"\"\"\r\n\r\ns=input()\r\nupper=len([letter for letter in s if letter.isupper()])\r\nlower=len(s)-int(upper)\r\nprint (s.upper() if upper>lower else s.lower())", "# 1. Get number of uppercase\r\n# 2. if uppercase > lowercase[len - upper]: upper\r\n# 3. else lower\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\ntext = input()[:-1]\r\n\r\ndef isUpper(c):\r\n\treturn 'A' <= c <= 'Z'\r\nsequence = list(map(isUpper, list(text)))\r\nuppers = sum(sequence)\r\nif uppers > (len(text) - uppers):\r\n\tprint(text.upper())\r\nelse:\r\n\tprint(text.lower())", "t = input()\r\nc_l = 0\r\nc_u = 0\r\nfor i in t:\r\n if (i.islower()):\r\n c_l += 1\r\n else:\r\n c_u += 1\r\nif c_l >= c_u:\r\n print(t.lower())\r\nelse:\r\n print(t.upper())\r\n\r\n ", "x=input()\r\ns=0\r\nc=0\r\nfor i in x:\r\n if ord(i)>=97:\r\n s+=1\r\n else:\r\n c+=1\r\nif s>=c:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "w=input()\nu=0\nl=0\n\nfor c in w:\n uni=ord(c)\n if uni>= 65 and uni<= 90:\n u+=1\n else:\n l+=1\n\nif u>l:\n print(w.upper())\nelse:\n print(w.lower())\n", "def s():\r\n s=input()\r\n num_upper=0\r\n num_lower=0\r\n for i in s:\r\n if ord(i)<=90:\r\n num_upper+=1\r\n else:\r\n num_lower+=1\r\n if num_lower>=num_upper:\r\n for i in range(len(s)):\r\n if ord(s[i])<91:\r\n s=s[0:i]+chr(ord(s[i])+32)+s[i+1:len(s)]\r\n else:\r\n for i in range(len(s)):\r\n if ord(s[i])>90:\r\n s=s[0:i]+chr(ord(s[i])-32)+s[i+1:len(s)]\r\n print(s)\r\n \r\ns()\r\n", "s = input()\r\nu, l = 0, 0\r\nfor c in s:\r\n if c.islower(): l+=1\r\n else: u+=1\r\nif u > l:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "word=str(input())\r\nUcounter=0\r\nLcounter=0\r\nfor i in word:\r\n if i.isupper():\r\n Ucounter+=1\r\n else:\r\n Lcounter+=1\r\nif Ucounter>Lcounter:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\n\r\nbig = 0\r\nfor c in s:\r\n if c.isupper():\r\n big += 1\r\nif big > len(s) // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nlower_count = sum(map(str.islower, s))\r\nupper_count = sum(map(str.isupper, s))\r\nif lower_count>upper_count:\r\n s=s.lower()\r\nelif lower_count<upper_count:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "word=input()\r\na=0\r\nb=0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n a+=1\r\n else:\r\n b+=1\r\n\r\nif a>b:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n=input().strip()\r\ns=0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n s+=1 \r\n else:\r\n s-=1\r\nif s>0:\r\n print(n.upper())\r\nelif s<=0:\r\n print(n.lower())\r\n \r\n ", "string = input()\r\ncount = 0\r\n\r\nfor i in string:\r\n if i.isupper():\r\n count += 1\r\nif count > len(string) // 2:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "from math import ceil\r\ns = input()\r\nlowercase = 0\r\nfor c in s:\r\n if c.islower():\r\n lowercase += 1\r\n\r\nif lowercase >= ceil(len(s)/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n=input()\r\ncount=0\r\n\r\nfor i in range(0,len(n)):\r\n if n[i].isupper():\r\n count+=1\r\n else:\r\n pass\r\n\r\nif count>abs(count-len(n)):\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\n\r\nprint(n)", "s=input()\r\nu=[]\r\nl=[]\r\nuc,lc=0,0\r\nfor i in s:\r\n if i.isupper():\r\n u.append(i)\r\n uc+=1\r\n elif i.islower():\r\n l.append(i)\r\n lc+=1\r\nif uc>lc:\r\n print(s.upper())\r\nelif uc<lc:\r\n print(s.lower())\r\nelif uc==lc:\r\n print(s.lower())\r\n", "n=input()\r\nc=0\r\nd=0\r\nq=''\r\nfor i in range(0,len(n)):\r\n if(ord(n[i])>=65 and ord(n[i])<=91):\r\n c+=1\r\n else:\r\n d+=1\r\nif(c>d):\r\n q=n.upper()\r\n print(q)\r\nelse:\r\n q=n.lower()\r\n print(q)\r\n", "string = input()\nlower_case = len([i for i in string if i.islower()])\nupper_case = len([i for i in string if i.isupper()])\nif lower_case >= upper_case:\n print(string.lower())\nelse:\n print(string.upper())", "s = input()\r\nk1 = 0\r\nk2 = 0\r\nl = len(s)\r\nfor i in range(0,l):\r\n if s[i] >= 'a' and s[i] <= 'z':\r\n k1 += 1\r\n else:\r\n k2 += 1\r\nif k1 >= k2:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "n=input()\r\nlc=0\r\nuc=0\r\nfor i in range(len(n)):\r\n if n[i]>='a' and n[i]<='z':\r\n lc+=1\r\n else:\r\n uc+=1\r\nif lc>uc:\r\n print(n.lower())\r\nelif uc>lc:\r\n print(n.upper())\r\nelse :\r\n print(n.lower())", "#https://codeforces.com/problemset/problem/59/A\r\nword = str(input())\r\ninput = []\r\nu = 0\r\nl = 0\r\nfor x in word:\r\n if ord(x) <= 96: #uppercase\r\n u += 1\r\n elif ord(x) >= 97: #lowercase\r\n l += 1\r\n\r\nif u > l:\r\n print(word.upper())\r\nif l > u or l == u:\r\n print(word.lower())\r\n\r\n", "a=input()\r\nb=0\r\nc=0\r\n\r\nfor i in a:\r\n if i.isupper():\r\n b+=1\r\n\r\nfor i in a:\r\n if i.islower():\r\n c+=1\r\n \r\nif b>c:\r\n print(a.upper())\r\nelif c>b:\r\n print(a.lower())\r\nelif c==b:\r\n print(a.lower())\r\nelse:\r\n pass\r\n", "x = input()\r\nC = 0\r\n\r\n\r\nfor i in x:\r\n if 64 < ord(i) < 91:\r\n C = C + 1\r\n if C > len(x) / 2:\r\n x = x.upper()\r\n else:\r\n x = x.lower()\r\n\r\nprint(x)", "s=input()\r\nlow=0\r\nup=0\r\nfor i in s:\r\n if i.isupper()==True:\r\n up+=1\r\n else:\r\n low+=1\r\nif low>up:\r\n s1=s.lower()\r\nelif up>low:\r\n s1=s.upper()\r\nelse:\r\n s1=s.lower()\r\nprint(s1)", "n=input()\r\ns=0\r\nb=0\r\nfor i in n:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n b=b+1\r\n else:\r\n s=s+1\r\nif(s>=b):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=list(input())\r\nc,c1=0,0\r\nfor i in range(len(n)):\r\n if(ord(n[i])>=97)and(ord(n[i])<=122):\r\n c+=1\r\nfor i in range(len(n)):\r\n if(ord(n[i])>=65)and(ord(n[i])<=90):\r\n c1+=1\r\nif(c>=c1):\r\n for i in range(len(n)):\r\n \r\n if(ord(n[i])>=65)and(ord(n[i])<=90):\r\n n[i]=chr(ord(n[i])+32)\r\nelse:\r\n for i in range(len(n)):\r\n \r\n if(ord(n[i])>=97)and(ord(n[i])<=122):\r\n n[i]=chr(ord(n[i])-32)\r\n \r\n\r\nfinal=''\r\nfor i in n:\r\n final=final+i\r\nprint(final)\r\n \r\n", "unsplitedwords = input()\r\nwords = unsplitedwords.split(' ')\r\n\r\n\r\n\r\ndef countLower(string):\r\n return sum(1 for c in string if c.islower())\r\n\r\ndef countuper(string):\r\n return sum(1 for c in string if c.isupper()) \r\n\r\n\r\nfinalwords = [] \r\n\r\nfor w in words:\r\n #print(\" minusculas %i mayhusculas %i \" % (countLower(w),countuper(w)))\r\n\r\n if countLower(w) >= countuper(w):\r\n finalwords.append(w.lower())\r\n else:\r\n finalwords.append(w.upper())\r\n\r\n\r\n\r\n\r\nfor w in finalwords:\r\n print(w)\r\n", "a=input()\r\nu=0\r\nfor i in a:\r\n if(i>='A' and i<='Z'):\r\n u+=1\r\nl=len(a)-u\r\nif(l>=u):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "word=input()\r\nupCount=0\r\nlowCount=0\r\nfor item in range(len(word)):\r\n if word[item]==word[item].upper():\r\n upCount+=1\r\n else:\r\n lowCount+=1\r\nif upCount>lowCount:\r\n print(word.upper())\r\nelif lowCount>=upCount:\r\n print(word.lower())", "x = input()\r\nbig,small =0,0\r\nfor i in x:\r\n if i.isupper():\r\n big += 1\r\n else:\r\n small += 1\r\n\r\nif big > small:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\n\nmayus = 0\nminus = 0\n\nfor letter in s:\n if letter.isupper():\n mayus+=1\n else:\n minus+=1\n\nif(mayus > minus):\n print(s.upper())\nelse:\n print(s.lower())\n", "s=input()\r\nc=0\r\nk=0\r\nfor i in s:\r\n if i=='a' or i=='b' or i=='c' or i=='d' or i=='e' or i=='f' or i=='g' or i=='h' or i=='i' or i=='j' or i=='k' or i=='l' or i=='m' or i=='n' or i=='o' or i=='p' or i=='q' or i=='r' or i=='s' or i=='t' or i=='u' or i=='v' or i=='w' or i=='x' or i=='y' or i=='z':\r\n c+=1\r\n elif i=='A' or i=='B' or i=='C' or i=='D' or i=='E' or i=='F' or i=='G' or i=='H' or i=='I' or i=='J' or i=='K' or i=='L' or i=='M' or i=='N' or i=='O' or i=='P' or i=='Q' or i=='R' or i=='S' or i=='T' or i=='U' or i=='V' or i=='W' or i=='X' or i=='Y' or i=='Z':\r\n k+=1\r\nif c>=k:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "\r\ns = input(\"\")\r\nupper = 0\r\nlower = 0\r\nfor letter in s:\r\n if letter.isupper():\r\n upper+=1\r\n elif letter.islower():\r\n lower+=1\r\n \r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nlower = 0\r\ncapital = 0\r\nfor k in range(len(s)):\r\n if ord(s[k]) >= 97:\r\n lower += 1\r\n else:\r\n capital += 1\r\n\r\nif capital > lower:\r\n for u in range(len(s)):\r\n if ord(s[u]) >= 97:\r\n print(chr(ord(s[u]) - 32), end='')\r\n else:\r\n print(s[u], end='')\r\nelse:\r\n for v in range(len(s)):\r\n if ord(s[v]) <= 90:\r\n print(chr(ord(s[v]) + 32), end='')\r\n else:\r\n print(s[v], end='')", "\r\nM = 0\r\nm = 0\r\n\r\ns = input()\r\nl = list(s)\r\n\r\nfor i in l:\r\n if i.isupper():\r\n M = M + 1\r\n else:\r\n m = m + 1\r\n\r\nif m < M:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "letters = input()\r\n\r\ncountLwr = 0\r\ncountUpr = 0\r\n\r\nfor i in letters:\r\n if i.islower():\r\n countLwr += 1\r\n else:\r\n countUpr += 1\r\n\r\nif countLwr == countUpr or countLwr > countUpr:\r\n print(letters.lower())\r\nelse:\r\n print(letters.upper())\r\n", "s = input()\r\nl,c = 0,0\r\nfor i in s:\r\n if i.isupper():\r\n c = c + 1 \r\n if i.islower():\r\n l = l + 1 \r\nprint(s.lower() if l>=c else s.upper())\r\n ", "s=input()\r\ncount_l=0\r\ncount_u=0\r\nfor i in s:\r\n if(i.isupper()):\r\n count_u+=1\r\n else:\r\n count_l+=1\r\nif(count_u>count_l):\r\n print(s.upper())\r\nelif(count_u<count_l):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s = input()\r\nupc = 0\r\nloc = 0\r\nfor i in s:\r\n if(i.islower()):\r\n loc+=1\r\n elif(i.isupper()):\r\n upc+=1\r\nif upc <= loc:\r\n s =s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)\r\n ", "s=input()\r\nlo=0\r\nup=0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up=up+1\r\n else:\r\n lo=lo+1\r\n\r\n\r\nif up<=lo:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\nk = ''\r\ncnt, cnt1 = 0, 0\r\nfor i in range(len(s)):\r\n if s[i] >= 'A' and s[i] <= 'Z':\r\n cnt += 1\r\n else:\r\n cnt1 += 1\r\nif cnt > cnt1:\r\n for i in range(len(s)):\r\n k += s[i].upper()\r\nelse:\r\n for i in range(len(s)):\r\n k += s[i].lower()\r\nprint(k)", "klm=input()\r\nbuyuk=0\r\nkucuk=0\r\nfor cu in klm:\r\n if cu.isupper():\r\n buyuk+=1\r\n else:\r\n kucuk+=1\r\nif buyuk>kucuk :\r\n print(klm.upper())\r\nelse:\r\n print(klm.lower())", "#CODE BY YUVRAJ JWALA\r\nupper=0\r\nlower=0\r\nvalue=input()\r\nfor i in range(len(value)):\r\n if value[i].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif(upper>lower):\r\n a=value.upper()\r\n print(a)\r\n\r\nelse:\r\n a=value.lower()\r\n print(a)\r\n", "s = input()\r\ntest1 = 0\r\ntest2 = 0\r\nfor i in s:\r\n if i.isupper() == True:\r\n test1 += 1\r\n else:\r\n test2 += 1\r\nif test1 > test2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "s=input()\r\nlower=0\r\nupper=0\r\nfor i in s:\r\n if(i.islower()):\r\n lower=lower+1\r\n else:\r\n upper=upper+1\r\nif(lower==upper):\r\n print(s.lower())\r\nelif(lower>upper):\r\n n=''\r\n for i in s:\r\n if(i.isupper()):\r\n n=n+i.lower()\r\n else:\r\n n=n+i\r\n print(n)\r\nelse:\r\n n=''\r\n for i in s:\r\n if(i.islower()):\r\n n=n+i.upper()\r\n else:\r\n n=n+i\r\n print(n)\r\n \r\n \r\n ", "word = input()\r\nb = 0\r\ns = 0 \r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n b += 1\r\n else:\r\n s+=1\r\nif b>s :\r\n print(word.upper())\r\nelse:\r\n print(word.lower()) ", "s=input()\r\nl1=[]\r\nl2=[]\r\nfor i in s:\r\n\tif ord(i) in range(65,91):\r\n\t\tl1.append(i)\r\n\telif ord(i) in range(97,123):\r\n\t\tl2.append(i)\r\nif len(l1)>len(l2):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "word = input()\r\nupper = sum(1 for c in word if c.isupper())\r\nif upper <= len(word) / 2:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "from string import *\r\n\r\nword = input()\r\ncounter_lower = 0\r\ncounter_upper = 0\r\n\r\nfor letter in word:\r\n if letter in ascii_lowercase:\r\n counter_lower += 1\r\n elif letter in ascii_uppercase:\r\n counter_upper += 1\r\n\r\nif counter_lower >= counter_upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s=input()\nuppernum=0\nlowernum=0\nfor _ in s:\n if _>'Z':\n lowernum+=1\n else:\n uppernum+=1\nif uppernum>lowernum:\n s=str.upper(s)\nelse:\n s=str.lower(s)\nprint(s)\n", "s = input(\"\")\r\ncapCount = 0\r\nlowCount = 0\r\n\r\nfor l in s:\r\n if l.islower():\r\n lowCount += 1\r\n elif l.isupper():\r\n capCount += 1\r\n\r\nif capCount == lowCount:\r\n s = s.lower()\r\nelif capCount > lowCount:\r\n s = s.upper()\r\nelif capCount < lowCount:\r\n s = s.lower()\r\n\r\nprint(s)\r\n", "a=input()\r\ns=a.upper()\r\nd=list(s)\r\nw=0\r\nr=0\r\nfor i in range(len(a)):\r\n\tif d[i]==a[i]:\r\n\t\tw=w+1\r\n\telse:\r\n\t\tr=r+1\r\n\t\r\nif w>r:\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "s = input()\r\nc = 0\r\nfor ch in s:\r\n if 'A' <= ch <='Z':\r\n c+=1\r\nif c>len(s)/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "A = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nB = 'abcdefghijklmnopqrstuvwxyz'\r\ns = input()\r\nup_count = 0\r\nlow_count = 0\r\nfor i in s:\r\n if i in A:\r\n up_count += 1\r\n elif i in B:\r\n low_count += 1\r\nif up_count > low_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = str(input())\r\nupper_list = []\r\nlower_list = []\r\nfor x in word:\r\n if x.isupper():\r\n upper_list.append(x)\r\n else:\r\n lower_list.append(x)\r\nif len(upper_list) > len(lower_list):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "k=input()\r\na=0\r\nb=0\r\nfor i in range(len(k)):\r\n if(ord(k[i])>=65 and ord(k[i])<=90):\r\n a+=1\r\n else:\r\n b+=1\r\nif(a>b):\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "def sim(s1, s2):\n count = 0\n for i in range(len(s1)):\n if s1[i] == s2[i]:\n count += 1\n\n return count\n\ns = input()\n\nsl = s.lower()\nsu = s.upper()\n\nsim1 = sim(s, sl)\nsim2 = sim(s, su)\n\nif sim1 >= sim2:\n print(sl)\n\nelse:\n print(su)\n", "import sys\r\nfrom math import sqrt\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().split()))\r\n\r\ndef solve():\r\n\ts = inp().strip()\r\n\tlis = [0, 0]\r\n\tfor i in s:\r\n\t\tlis[65 <= ord(i) <= 90] += 1\r\n\t\t# print(lis)\r\n\tprint(s.lower() if lis[0] >= lis[1] else s.upper())\r\n\r\n\r\n\t# ans = \"\"\r\n\t# c = 0\r\n\t# for _ in range(int(inp())):\r\n\t# \ta, b = read()\r\n\t# \tc += (1 if a <= b-2 else 0)\r\n\t# print(c)\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()", "a = input()\n\nlowercase = 0\nuppercase = 0\n\nfor i in a:\n if i.islower():\n lowercase += 1\n else:\n uppercase += 1\n\nif lowercase >= uppercase:\n print(a.lower())\nelse:\n print(a.upper())", "from string import ascii_uppercase as u\r\na=input()\r\nb=0\r\nfor i in a:\r\n if i in u:b+=1\r\nif 2*b>len(a):print(a.upper())\r\nelse:print(a.lower())", "word = input()\r\ni = 0\r\nl = 0\r\nu = 0\r\nwhile i<len(word):\r\n if word[i].islower():\r\n l+=1\r\n else:\r\n u+=1\r\n i+=1\r\nif u>l:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "if __name__ == '__main__':\r\n s=input().strip('')\r\n uCount=0\r\n lCount=0\r\n for w in s:\r\n if w.isupper():\r\n uCount+=1\r\n else:\r\n lCount+=1\r\n if uCount>lCount:\r\n print(s.upper())\r\n else:\r\n print(s.lower())", "m=M=0\r\ncadena = input()\r\nlongitud = len(cadena)\r\nfor i in range (longitud):\r\n if (cadena[i]>='a' and cadena[i] <='z'):\r\n m = m+1\r\n elif(cadena[i]>='A' and cadena[i]<='Z'):\r\n M=M+1\r\n\r\nif (m>=M):\r\n cadena = cadena.lower()\r\nelse:\r\n cadena = cadena.upper()\r\n\r\nprint(cadena)", "s=input()\r\nlo=len([i for i in s if i.islower()])\r\nupper=abs(len(s)-lo)\r\nif lo==upper or lo>upper:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "word = str(input())\nlow, up = 0, 0\nfor w in word:\n\tif w.isupper():\n\t\tup += 1\n\telse:\n\t\tlow += 1\n\nif low == up:\n\tprint(word.lower())\nelif low < up:\n\tprint(word.upper())\nelse:\n\tprint(word.lower())", "C = input()\r\nX = list(C)\r\nU = 0\r\nL = 0\r\nfor x in X:\r\n if 'a' <= x <= 'z':\r\n L = L + 1\r\n else:\r\n U = U + 1\r\n\r\n\r\n\r\nif L < U:\r\n print(C.upper())\r\nelse:\r\n print(C.lower())", "# -*- coding: utf-8 -*-\r\n\r\ns = input()\r\nc = 0\r\nfor ss in s:\r\n if 'a' <= ss <= 'z':\r\n c += 1\r\nif 2 * c >= len(s):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a = input()\r\nuppercase_count = sum(1 for char in a if char.isupper())\r\n\r\nhalf_length = len(a) // 2\r\nif uppercase_count > half_length:\r\n result = a.upper()\r\nelse:\r\n result = a.lower()\r\n\r\nprint(result)\r\n", "text = input()\nlow, up = 0, 0\nfor char in text :\n if char.islower():\n low += 1\n else :\n up += 1\nif low>=up :\n print(text.lower())\nelse :\n print(text.upper())\n \t\t\t \t \t \t\t \t\t\t\t\t\t \t \t", "n=input()\r\nc1=0\r\nc2=0\r\nfor i in n:\r\n if 65<=ord(i)<=90:\r\n c1+=1\r\n else:\r\n c2+=1\r\nif c1>c2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s=input()\r\nm=len(s)\r\nu,p=0,0\r\nfor i in range(m):\r\n if s[i].isupper()==True:\r\n u+=1\r\n else:\r\n p+=1\r\nif u<=p:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "dato = input()\nI = u=0\nfor ch in dato:\n if ch.isupper(): u+=1\n else: I+=1\nif u > I: dato = dato.upper()\nelse: dato = dato.lower()\n\nt=9856534\nprint(dato)\n\t \t\t\t\t\t \t\t \t \t \t \t\t \t\t", "import re\r\n\r\nstring = input()\r\nbig_letters = len(re.findall(r'[A-Z]',string))\r\nw = len(string)\r\nsmall_letters = w - big_letters\r\n\r\nif big_letters > small_letters:\r\n print(string.upper())\r\nelif small_letters > big_letters:\r\n print(string.lower())\r\nelif big_letters == small_letters:\r\n print(string.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 26 16:43:27 2019\r\n\r\n@author: 93464\r\n\"\"\"\r\n\r\n\r\nword = input() \r\nlowernum = 0 \r\nuppernum = 0 \r\nfor x in word: \r\n if ord('a')<=ord(x)<=ord('z'):\r\n lowernum += 1 \r\n if ord('A')<=ord(x)<=ord('Z'):\r\n uppernum += 1 \r\nif lowernum < uppernum: word = word.upper() \r\nelse: word = word.lower() \r\nprint(word)", "if __name__ == '__main__':\n s = input()\n upc = 0\n lowc = 0\n for i in range(len(s)):\n if s[i].islower() :\n lowc += 1\n else :\n upc += 1\n if upc > lowc :\n print(s.upper())\n else :\n print(s.lower())", "s = list(input())\r\ncount=0\r\nfor i in s:\r\n if i.isupper():\r\n count+=1\r\nl = len(s)\r\nif count>l//2:\r\n print(\"\".join(s).upper())\r\nelse:\r\n print(\"\".join(s).lower())", "s = input()\nprint([s.lower(),s.upper()][sum(i<'['for i in s)*2>len(s)])\n\t\t \t\t \t \t\t\t\t \t\t\t\t\t \t \t\t\t \t", "s=input()\ncount1=0\ncount2=0\nfor i in s:\n if(i.islower()):\n count1=count1+1\n elif(i.isupper()):\n count2=count2+1\nif count1>=count2:\n print(s.lower())\nelse:\n print(s.upper())\n \n \n\t \t\t\t \t \t \t\t\t\t \t\t\t\t\t \t\t\t\t\t", "s = input()\ncount1 = sum(1 for c in s if c.isupper())\ncount2 = sum(1 for c in s if c.islower())\nif count1 > count2:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())", "sub = input()\r\nrs = 0\r\n\r\nfor i in sub:\r\n if(i.isupper()):\r\n rs += 1\r\nif(rs <= len(sub) / 2):\r\n print(sub.lower())\r\nelse:\r\n print(sub.upper())", "s = input()\r\nnum_lower = 0\r\nnum_upper = 0\r\n\r\nfor string in s:\r\n if string.islower()==True:\r\n num_lower+=1\r\n else:\r\n num_upper+=1\r\n\r\nif num_lower >= num_upper:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "word = input()\r\nup_count, lw_count = 0, 0\r\nfor char in word:\r\n if char.isupper():\r\n up_count += 1\r\n else:\r\n lw_count += 1\r\n\r\nprint(word.upper()) if up_count > lw_count else print(word.lower())", "words = str(input().split(' '))\r\ncapital, small = [], []\r\nfor i in words[2:-2]:\r\n if i.islower():\r\n small.append(i)\r\n if i.isupper():\r\n capital.append(i)\r\nif len(capital) > len(small):\r\n print(words[2:-2].upper(), end='')\r\nelse:\r\n print(words[2:-2].lower(), end='')\r\n", "word = input()\r\nupperCount = sum(1 for c in word if c.isupper())\r\nlowerCount = sum(map(str.islower, word))\r\n\r\nif(upperCount > lowerCount):\r\n print(word.upper())\r\nelif(lowerCount > upperCount):\r\n print(word.lower())\r\nelse:\r\n print(word.lower())\r\n\r\n", "s = str(input())\r\nl,u = 0,0\r\nfor c in s:\r\n if c == c.upper():\r\n u +=1\r\n else:\r\n l +=1\r\nif u>l:\r\n print(s.upper())\r\nelif l>u:\r\n print(s.lower())\r\nelif l == u:\r\n print(s.lower())", "rr = str(input())\r\n\r\ncount = 0\r\nfor i in rr:\r\n if i == i.upper():\r\n count += 1\r\n \r\nif count > len(rr) // 2:\r\n print(rr.upper())\r\n \r\nelse:\r\n print(rr.lower())", "s=input()\r\na=s.upper()\r\nb=s.lower()\r\np=0\r\nq=0\r\nm=0\r\nwhile m<len(s):\r\n if s[m]==a[m]:\r\n p+=1\r\n else:\r\n q+=1\r\n m+=1\r\nif p>q:\r\n print(a)\r\nelse:\r\n print(b)\r\n", "s = input()\nupper, lower = 0, 0\nfor i in s:\n if i >= 'A' and i <= 'Z':\n upper += 1\n elif i >= 'a' and i <= 'z':\n lower +=1\nif upper > lower:\n print(s.upper())\nelse:\n print(s.lower())\n", "my_string = input()\r\ni = 0\r\nn = len(my_string)\r\nu = 0\r\nl = 0\r\nwhile i < n :\r\n c = my_string[i:i+1]\r\n if c >= 'a' :\r\n l = l + 1\r\n else :\r\n u = u + 1\r\n i = i + 1\r\nif(l >= u) :\r\n print(my_string.lower())\r\nelse :\r\n print(my_string.upper())", "a = input()\r\nzag = sum(map(str.isupper, a))\r\nstro = sum(map(str.islower, a))\r\nif zag == stro:\r\n print(a.lower())\r\nelif zag > stro:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "# tests = int(input())\r\ntests = 1\r\n\r\nfor test in range(tests):\r\n # n, k = list( map(lambda x: int(x), input().split(\" \")) )\r\n \r\n lower = 'qwertyuiopasdfghjklzxcvbnm'\r\n upper = lower.upper()\r\n \r\n s = input()\r\n \r\n lN = 0\r\n uN = 0\r\n \r\n for c in s:\r\n if c in lower:\r\n lN = lN + 1\r\n elif c in upper:\r\n uN = uN + 1\r\n \r\n if lN < uN:\r\n print(s.upper())\r\n else:\r\n print(s.lower())", "a=input()\r\nc=0\r\nb=0\r\nfor i in a:\r\n if (i.islower()):\r\n c+=1\r\n elif (i.isupper()):\r\n b+=1\r\nif c>b:\r\n print(a.lower())\r\nelif c<b:\r\n print(a.upper())\r\nelif c==b:\r\n print(a.lower())", "text = input()\r\nuppercase = 0\r\nlowercase = 0\r\nfor detail in text:\r\n if detail.isupper():\r\n uppercase = uppercase + 1\r\n elif detail.islower():\r\n lowercase = lowercase + 1\r\n\r\nif uppercase > lowercase:\r\n print(text.upper())\r\nelse:\r\n print(text.lower())\r\nquit()", "B='QWERTYUIOPASDFGHJKLZXCVBNM'\r\nM='qwertyuiopasdfghjklzxcvbnm'\r\nn=input()\r\nb=sum([1 for i in n if i in B])\r\nm=sum([1 for i in n if i in M])\r\nif b>m: print(n.upper())\r\nelse: print(n.lower())", "word = input()\nmay = 0\nminu = 0\nfor i in word:\n if i == i.upper():\n may += 1\n else:\n minu += 1\n \n if may > minu:\n word= word.upper()\n else:\n word= word.lower()\n\nprint(word)\n\n \t\t \t \t \t \t\t\t \t\t\t\t \t", "def word(word):\r\n upper=0\r\n lower=0\r\n for char in word:\r\n if char.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n if lower>= upper:\r\n print(word.lower())\r\n else:\r\n print(word.upper())\r\nword1=input(\"\")\r\nword(word1)", "s=input()\r\nsb=0\r\nss=0\r\nfor i in s:\r\n\tif i.upper()==i:\r\n\t\tsb+=1\r\n\telif i!=i.upper():\r\n\t\tss+=1\r\nif sb>ss:\r\n\tv=s.upper()\r\n\tprint(v)\r\nelif sb<ss:\r\n\tv=s.lower()\r\n\tprint(v)\r\nelif sb==ss:\r\n\tv=s.lower()\r\n\tprint(v)", "s = input()\nsmall = 0\ncapital = 0\nsign = 0\nfor letter in s:\n\tif ord(letter) < 97:\n\t\tsign -= 1\n\telse:\n\t\tsign += 1\nif sign < 0:\n\tsign = -1\nelse:\n\tsign = 1\n\t\t\nfor letter in s:\n\tif sign == 1: \n\t\tif ord(letter) < 97:\n\t\t\tprint(chr(ord(letter) + (32 * sign)), end = '')\n\t\telse:\n\t\t\tprint(letter, end = '')\n\telse:\n\t\tif ord(letter) > 96:\n\t\t\tprint(chr(ord(letter) + (32 * sign)), end = '')\n\t\telse:\n\t\t\tprint(letter, end = '')", "user_input = input()\r\ncountlower = 0\r\ncountupper = 0\r\nfor i in user_input:\r\n if i.isupper():\r\n countupper += 1\r\n else:\r\n countlower += 1\r\nif countupper > countlower:\r\n print(user_input.upper())\r\nelse:\r\n print(user_input.lower())", "word = input()\r\n\r\nlower_case = 0\r\nfor char in word:\r\n if char.islower():\r\n lower_case += 1\r\n\r\nc_f = str.lower if lower_case >= len(word) / 2 else str.upper\r\n\r\nc_w = ''.join(c_f(char) for char in word)\r\nprint(c_w)", "t = list(input())\r\nlcnt = [x for x in t if x == x.lower()]\r\nif len(lcnt) < len(t) / 2: print(\"\".join(t).upper())\r\nelse: print(\"\".join(t).lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 8 13:28:01 2018\r\n\r\n@author: pc\r\n\"\"\"\r\n\r\ns=input()\r\nx=0\r\nfor i in range(len(s)):\r\n if s[i]==s.lower()[i]:\r\n x+=1\r\nif x>=len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word=input()\r\nmass=[]\r\nmass_2=[]\r\nfor i in word:\r\n if i.isupper():\r\n mass.append(1)\r\n else:\r\n mass_2.append(0)\r\nif len(mass)>len(mass_2):\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)\r\n", "word = input()\r\ncount = sum(1 for c in word if c.isupper())\r\nif count > len(word)/2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\nindex=0\nu=0\nl=0\nwhile index<len(s):\n if s[index]==s[index].upper():\n u=u+1\n if s[index]==s[index].lower():\n l=l+1\n index=index+1\nif u>l:\n s=s.upper()\nif u<l:\n s=s.lower()\nif u==l:\n s=s.lower()\nprint(s)\n", "\r\ng=list(input())\r\nc=0\r\nb=0\r\nfor i in range(len(g)):\r\n if 97<=ord(g[i])<=122:\r\n c=c+1\r\n elif 65<=ord(g[i])<=90:\r\n b=b+1 \r\nv=[] \r\nif c>=b:\r\n for i in range(len(g)):\r\n a=str.lower(g[i])\r\n v.append(a)\r\n for item in v:\r\n print(item,end=\"\") \r\nif c<b:\r\n for i in range(len(g)):\r\n a=str.upper(g[i])\r\n v.append(a)\r\n for item in v:\r\n print(item,end=\"\") ", "s=input()\r\ncntl=0\r\ncntc=0\r\nfor i in range(0,len(s)):\r\n if(s[i].islower()):\r\n cntl+=1\r\n else:\r\n cntc+=1\r\nif cntl>=cntc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "x = input()\r\n\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor i in x:\r\n if i == i.lower():\r\n count_lower += 1\r\n else:\r\n count_upper += 1\r\n \r\nif count_upper > count_lower:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "sozcuk = input()\r\nkucuk = 0\r\nbuyuk = 0\r\nfor i in range(len(sozcuk)):\r\n if sozcuk[i].islower(): kucuk += 1\r\n else: buyuk += 1\r\n\r\nprint(sozcuk.lower() if kucuk >= buyuk else sozcuk.upper())\r\n", "a = input()\r\nupper =[]\r\nlower= []\r\nfor char in a:\r\n if char == char.upper():\r\n upper.append(char)\r\n else:\r\n lower.append(char)\r\nif len(upper)>len(lower):\r\n print(a.upper()) \r\nelse:\r\n print(a.lower()) ", "x=input()\r\ncount1=0\r\ncount2=0\r\nfor i in x:\r\n if i.islower():\r\n count1+=1\r\n elif i.isupper():\r\n count2+=1\r\ny=''\r\nif count1>=count2:\r\n for i in x:\r\n a=i.lower()\r\n y=y+a\r\nelse:\r\n for i in x:\r\n a=i.upper()\r\n y=y+a\r\nprint(y)\r\n ", "word = input()\r\ncountu = 0\r\ncountl = 0\r\nfor i in word:\r\n if i.isupper():\r\n countu = countu + 1\r\n else:\r\n countl = countl + 1\r\n\r\nif countu > countl :\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\n\r\nsmall = 0\r\nbig = 0\r\n\r\nfor i in s:\r\n if i >= 'a' and i <= 'z':\r\n small += 1\r\n elif 'A' <= i <= 'Z':\r\n big += 1\r\n\r\nif small >= big:\r\n print(s.lower())\r\nelif big >= small:\r\n print(s.upper())\r\nelif small == big:\r\n print(s.lower())\r\n", "data = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor char in data:\r\n if char.isupper():\r\n upper_count +=1\r\n else:\r\n lower_count +=1\r\n\r\nif upper_count > lower_count:\r\n print(data.upper())\r\nelse:\r\n print(data.lower())", "n=input()\r\nl=0\r\nu=0\r\nfor i in n:\r\n if \"a\"<=i and i<=\"z\" :\r\n l+=1\r\n else :\r\n u+=1\r\nif l<u :\r\n print(n.upper())\r\nelse :\r\n print(n.lower())", "s=input()\r\nb=[]\r\ncount1=0\r\ncount2=0\r\nfor i in s:\r\n if(i.isupper()):\r\n count1=count1+1\r\n if(i.islower()):\r\n count2=count2+1\r\nif(count1>count2):\r\n for i in s:\r\n b.append(i.upper())\r\nelse:\r\n for i in s:\r\n b.append(i.lower()) \r\n \r\nfor i in b:\r\n print(i,end=\"\")", "import sys\r\ns = input()\r\n\r\na = 0\r\nb = 0\r\n\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n a += 1 \r\n else:\r\n b += 1\r\n\r\nif( a > b):\r\n s = s.upper()\r\nelse:\r\n s =s.lower()\r\nprint(s)\r\n\r\n\r\n ", "sb=input();\r\nc=0\r\ns=0\r\ns1=\"\"\r\nfor ch in sb:\r\n if ch.isupper():\r\n c+=1 \r\n else:\r\n s+=1\r\ns1= sb.upper() if c>s else sb.lower()\r\nprint(s1)", "k = 0\r\nx = input()\r\nfor i in range(len(x)):\r\n\tif ord(x[i]) >= 65 and ord(x[i]) < 97:\r\n\t\tk = k + 1\r\nif k > int(len(x)/2):\r\n\tr = x.upper()\r\nelse:\r\n\tr = x.lower()\r\nprint(r)", "s=input()\r\nupper,lower=0,0\r\nfor char in s:\r\n if char.islower():lower+=1\r\n else:upper+=1\r\nprint(s.upper() if upper>lower else s.lower())", "n = str(input())\r\n\r\nlower_count = 0 \r\nupper_count = 0 \r\n\r\nfor i in n:\r\n if i.isupper():\r\n upper_count += 1 \r\n elif i.islower():\r\n lower_count += 1\r\n\r\nif lower_count >= upper_count:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\nupperLetters = 0\r\nlowerLetters = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n upperLetters = upperLetters + 1\r\n else:\r\n lowerLetters = lowerLetters + 1\r\nif upperLetters > lowerLetters:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "word = input()\r\nuppercase=0\r\nlowercase=0\r\nfor i in range(len(word)):\r\n if word[i] == word[i].capitalize():\r\n uppercase+=1\r\n else:\r\n lowercase+=1\r\nif lowercase >= uppercase:\r\n print(word.lower())\r\nelif uppercase > lowercase:\r\n print(word.upper())\r\n", "A=input()\r\nu=l=0\r\nfor i in range(len(A)): \r\n if A[i].isupper()==True: \r\n u+=1\r\n else: \r\n l+=1\r\nif u>l: \r\n print(A.upper())\r\nelse: \r\n print(A.lower())", "\r\n\r\n\r\n\r\n\r\nstring = input()\r\nuppers = len([i for i in string if i.isupper()])\r\nif uppers > len(string)/2:\r\n\tprint (string.upper())\r\nelse:\r\n\tprint (string.lower())\r\n", "input_str = input(\"\")\n\nupper_case_count = 0\nfor i in input_str:\n if i.isupper():\n upper_case_count +=1\ntemp_str= \"\" \nif(upper_case_count > len(input_str)/2):\n temp_str = input_str.upper()\nelse:\n temp_str =input_str.lower()\n\nprint(temp_str)", "s=input()\r\nn=0\r\nm=0\r\nfor i in s:\r\n if(i.isupper()):\r\n n=n+1\r\n elif(i.islower()):\r\n m=m+1\r\nif (m>=n):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = str(input())\r\ncount = 0\r\nfor i in s:\r\n\tif(i.isupper()):\r\n\t\tcount += 1\r\nif(count > (len(s)-count)):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "a=input()\r\ncountU=0\r\ncountL=0\r\nfor i in range(len(a)):\r\n if ord(a[i])>=65 and ord(a[i])<=90:\r\n countU+=1\r\n elif ord(a[i])>=97 and ord(a[i])<=122:\r\n countL+=1\r\nif countL>=countU:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "palavra=input()\r\ntam= len(palavra)\r\neq= tam/2\r\nmai= palavra.upper()\r\nminu= palavra.lower()\r\ncontmai=0\r\ncontmin=0\r\nfor x in range(tam):\r\n if palavra[x]==mai[x]:\r\n contmai+=1\r\n elif palavra[x]==minu[x]:\r\n contmin+=1\r\nif contmai > contmin:\r\n print(mai)\r\nelse:\r\n print(minu)\r\n\r\n ", "m=0\r\nn=0\r\na=str(input())\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n m+=1\r\n else:\r\n n+=1\r\nif m>n:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "x = input()\r\ncount_up = 0\r\ncount_low = 0\r\nfor i in x:\r\n if i == i.upper():\r\n count_up += 1\r\n elif i == i.lower():\r\n count_low += 1\r\nif count_up == count_low:\r\n print(x.lower())\r\nelif count_up > count_low:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\r\ns1 = ''\r\nk = 0\r\nfor c in s:\r\n if 'A' <= c <= 'Z':\r\n k += 1\r\nif k <= len(s) - k:\r\n for i in range(len(s)):\r\n if 'A' <= s[i] <= 'Z':\r\n s1 += s[i].lower()\r\n else:\r\n s1 += s[i]\r\nelse:\r\n for i in range(len(s)):\r\n if 'a' <= s[i] <= 'z':\r\n s1 += s[i].upper()\r\n else:\r\n s1 += s[i] \r\nprint(s1)", "word=input()\r\nc=0\r\ns=0\r\nfor i in word:\r\n if i.islower():\r\n s=s+1\r\n else:\r\n c=c+1\r\nif s>=c:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = str(input())\r\ni = 0\r\nup = 0\r\nlow = 0\r\nwhile(i<len(s)):\r\n\tif (s[i].isupper() == True):\r\n\t\tup = up+1\r\n\telse:\r\n\t\tlow = low+1\r\n\ti = i+1\r\nif (low>=up):\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())\r\n\t\t\r\n", "def change_letter_case(w):\r\n upper_count = sum(1 for c in w if c.isupper())\r\n lower_count = len(w) - upper_count\r\n if upper_count > lower_count:\r\n return w.upper()\r\n else:\r\n return w.lower()\r\n \r\nw = input()\r\ncorrected_w = change_letter_case(w)\r\nprint(corrected_w)", "s = input()\r\nlow = 0\r\nup = 0\r\nfor i in range(0, len(s)):\r\n if s[i].islower():\r\n low += 1\r\n elif s[i].isupper():\r\n up += 1\r\nif low < up:\r\n s = s.upper()\r\nelif low > up:\r\n s = s.lower()\r\nelif low == up:\r\n s = s.lower()\r\nprint(s)\r\n", "word = input()\nl, u = 0, 0\nfor i in range(len(word)):\n\tif word[i] >= 'a' and word[i] <= 'z':\n\t\tl += 1\n\telse:\n\t\tu += 1\nif l == u or l > u:\n\tfor j in range(len(word)):\n\t\tif word[j] >= 'A' and word[j] <= 'Z':\n\t\t\tword = word[:j] + chr(ord(word[j]) + 32) + word[j + 1:]\nelse: \n\tfor k in range(len(word)):\n\t\tif word[k] >= 'a' and word[k] <= 'z':\n\t\t\tword = word[:k] + chr(ord(word[k]) - 32) + word[k + 1:]\nprint(word)\n\t\t\t\t\t \t \t \t \t \t\t\t \t", "s=input()\nn=len(s)\nl=0\nu=0\nfor i in range(n):\n if s[i].islower():\n l=l+1\n elif s[i].isupper():\n u=u+1\nif u<=l:\n s=s.lower()\n print(s)\nelse:\n s=s.upper()\n print(s)\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", "import sys\n\ndef main():\n st = sys.stdin.readline().strip()\n low = 0\n for ch in st:\n if ch>='a' and ch <= 'z':\n low += 1\n upp = len(st) - low\n if low >= upp:\n print(st.lower())\n else:\n print(st.upper())\n\n\nif __name__ == (\"__main__\"):\n main()\n", "word = input()\r\ncounter = 0\r\ncounter1 = 0\r\nfor w in word[0:]:\r\n if w.isupper():\r\n counter = counter + 1\r\n else:\r\n counter1 = counter1 + 1\r\n\r\nif counter1 > counter or counter == counter1:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "w=input();\r\nup,lo=0,0;\r\nfor ch in w:\r\n if(ch.isupper()):\r\n up+=1;\r\n else:\r\n lo+=1;\r\nif(up>lo):\r\n w=w.upper();\r\nelif(lo>=up):\r\n w=w.lower();\r\nprint(w);", "s=input()\nlength=len(s)\ncounter=0\nfor _ in s:\n if 'A'<= _ and 'Z'>= _:\n counter=counter+1\nif counter> (length/2):\n print(s.upper())\nelse:\n print(s.lower()) \n\n", "num=input()\r\nup=0\r\nlo=0\r\nfor m in num:\r\n if ord(m)>90:\r\n lo+=1\r\n else:\r\n up+=1\r\nif lo>=up:\r\n print(num.lower())\r\nelse:\r\n print(num.upper())\r\n", "word = input()\nl = 0\nu = 0\nfor k in word:\n if k.isupper():\n u += 1\n else:\n l += 1\nif l >= u:\n print(word.lower())\nelse:\n print(word.upper())\n", "s = input()\r\nlower=0\r\nupper=0\r\ni=0\r\nfor x in s:\r\n if s[i].islower()==1:\r\n lower+=1\r\n i+=1\r\n else :\r\n upper+=1\r\n i+=1\r\n \r\n\r\nif(lower>=upper):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\nu = 0\r\nl = 0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif u > l:\r\n print(''.join(n).upper())\r\nelse:\r\n print(''.join(n).lower())\r\n", "s = input()\r\nlowerCount = 0\r\nupperCount = 0\r\nfor char in s:\r\n if char == char.upper():\r\n upperCount += 1\r\n else:\r\n lowerCount += 1\r\nif upperCount <= lowerCount:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nu = []\r\nl = []\r\nfor element in s:\r\n\tif element.upper() == element:\r\n\t\tu.append(element)\r\n\telse:\r\n\t\tl.append(element)\r\nif len(u) > len(l):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s=str(input())\r\ncu,cl=0,0\r\nfor i in s:\r\n if i.isupper() is True:\r\n cu=cu+1\r\n else:\r\n cl=cl+1\r\nif cu>cl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "def main():\r\n s = input()\r\n l = 0\r\n u = 0\r\n for c in s:\r\n if c.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n \r\n if l < u:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\r\nCount = 0\r\ncount = 0\r\nfor i in s:\r\n if(i.islower()):\r\n count += 1\r\n elif(i.isupper()):\r\n Count += 1\r\nif Count > count:\r\n print(s.upper())\r\nelif count >= Count:\r\n print(s.lower()) ", "in_str = input()\r\nups = [i for i in in_str if i.isupper()]\r\nlows = [i for i in in_str if i.islower()]\r\nif len(ups) > len(lows):\r\n print(in_str.upper())\r\nelse:\r\n print(in_str.lower())", "# Word\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nw = str(input())\r\nlower_letters = ascii_lowercase\r\nupper_letters = ascii_uppercase\r\ntot_upper = 0\r\ntot_lower = 0\r\n\r\nfor l in w:\r\n\tif l in lower_letters:\r\n\t\ttot_lower += 1\r\n\telse:\r\n\t\ttot_upper += 1\r\n\r\nif tot_lower >= tot_upper:\r\n\tprint(w.lower())\r\nelif tot_lower < tot_upper:\r\n\tprint(w.upper())\r\n", "s =input()\r\n \r\nlower=0\r\nupper=0\r\n \r\nfor i in s:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n if upper > lower:\r\n s = s.upper()\r\n else:\r\n s = s.lower()\r\n \r\nprint(s)", "word = input()\r\nlength = len(word)\r\na = 0\r\nb = 0\r\nfor i in range(length):\r\n if 'A' <= word[i] <= \"Z\":\r\n a += 1\r\n else:\r\n b += 1\r\nif a > b:\r\n s = word.upper()\r\nelse:\r\n s = word.lower()\r\nprint(s)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled19.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/17pE7Nsm1SMV6a45ZPfyl4oCj8-nqJjZC\n\"\"\"\n\ns = input()\n\ns1 = s.upper()\ns2 = s.lower()\ncount1 = 0\ncount2 = 0\nfor i in range(len(s)):\n char = s[i]\n ascii = ord(char)\n if ascii >= 65 and ascii <= 90:\n count1 += 1\n if ascii >= 97 and ascii <= 122:\n count2 += 1\n\nif count1 > count2:\n print(s1)\nelif count1 <= count2:\n print(s2)", "x=input()\r\nmylist=list()\r\nfor letter in x:\r\n mylist.append(letter)\r\nupper=0\r\nlower=0\r\ni=0\r\nwhile i<len(mylist):\r\n if mylist[i]==x[i].upper():\r\n upper+=1\r\n elif mylist[i]==x[i].lower():\r\n lower+=1\r\n i+=1\r\nif upper>lower:\r\n print(x.upper())\r\nelif lower>=upper:\r\n print(x.lower())", "s=input()\r\nk=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n k+=1\r\nif k>len(s)//2:\r\n print(s.upper())\r\nelse :\r\n print(s.lower())\r\n", "#A. Word\n#Çilekeş\ngiris = str(input())\nb = 0\nc = 0\nfor i in range(len(giris)):\n if giris[i].isupper():\n b+=1\n else:\n c+=1\nif b < c:\n print(giris.lower())\nelif b > c:\n print(giris.upper())\nelse:\n print(giris.lower())\n", "s = input()\r\nlow = len([x for x in s if x == x.lower()])\r\nprint(s.lower() if low >= (len(s) + 1) // 2 else s.upper())", "s = input()\r\nl, u = 0,0\r\nfor c in s:\r\n if c>='a' and c<='z':\r\n l+=1\r\n if c>='A' and c<='Z':\r\n u+=1\r\nif(l>=u):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = str(input())\r\nupper = []\r\nlower = []\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n upper.append(n[i])\r\n else:\r\n lower.append(n[i])\r\nif len(upper) > len(lower):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "chu = str(input())\nHOA = 0\nthuong = 0\nfor x in chu:\n if x.isupper():\n HOA += 1\n if x.islower():\n thuong += 1\nif HOA > thuong:\n print(chu.upper())\nelif HOA < thuong:\n print(chu.lower())\nelse:\n print(chu.lower())\n \t \t \t\t\t\t\t\t\t\t \t \t \t \t\t", "a=input()\r\nb=0\r\nc=0\r\nfor i in range(len(a)):\r\n if 'a'<=a[i]<='z':\r\n b+=1\r\n else:\r\n c+=1\r\nif c>b:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n\r\n\r\n \r\n", "E=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nEC=0\r\ne=E.lower()\r\nec=0\r\na=input()\r\nfor i in range(len(a)):\r\n if a[i] in E:\r\n EC=EC+1\r\n elif a[i] in e:\r\n ec=ec+1\r\nif EC>ec:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word = input()\ncount_upper = 0\ncount_lower = 0\nfor letter in word:\n if letter.isupper():\n count_upper += 1\n else:\n count_lower += 1\n\nif count_upper > count_lower:\n print(word.upper())\nelse:\n print(word.lower())", "def main() :\r\n string = input()\r\n lower = 0\r\n upper = 0\r\n for i in string :\r\n if i.islower() :\r\n lower +=1 \r\n else :\r\n upper += 1\r\n if lower >= upper :\r\n print(string.lower())\r\n else :\r\n print(string.upper()) \r\n \r\n\r\n\r\nmain() ", "l=input();print([l.lower(),l.upper()][len(l)>2*sum([i.islower() for i in l])])", "a = str(input())\r\nb = list(a)\r\nc = len(a)\r\nd = 0\r\nfor x in range(0, c):\r\n if b[x].isupper():\r\n d+=1\r\ne = c - d\r\nif d > e:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "a=str(input())\nlower=0\nupper=0\nfor i in a:\n if (i.islower()):\n lower+=1\n \n else:\n upper+=1\n \nif upper>lower:\n print(a.upper())\nelse:\n print(a.lower())\n\t \t\t \t \t\t\t \t \t", "\r\nword = input()\r\nl = 0\r\nu = 0\r\nfor char in word:\r\n\tif char.islower() == True:\r\n\t\tl += 1\r\n\telse:\r\n\t\tu += 1\r\nif l == u or l>u:\r\n\tword = word.lower()\r\nelse:\r\n\tword = word.upper()\r\nprint(word)\t\t\r\n", "a=input()\r\nb,c=0,0\r\nfor i in range(0,len(a)):\r\n if ord(a[i])>=65 and ord(a[i])<=90:\r\n b+=1\r\n else:\r\n c+=1\r\n\r\nif b>c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s1 = input()\n# s2 = input()\n# s1 = s1.lower()\n# s2 = s2.lower()\n# # ss1 = list(bytes(s1))\n# # ss2 = list(bytes(s2))\n# n = len(s1)\n# ss1 = [ord(c) for c in s1]\n# ss2 =[ord(c) for c in s2]\n# c1 = [0] * n\n# for i in range(n):\n# c1[i] = ss1[i] - ss2[i]\n# for j in range(n):\n# if c1[i] == 0:\n# continue\n# if c1[i] > 0:\n# print(\"-1\")\n# exit()\n# if c1[i] < 0:\n# print(\"1\")\n# exit()\n# print(\"0\")\n\nu = 0\nl = 0\nfor i in range(len(s1)):\n l += int(s1[i].islower())\n u += int(s1[i].isupper())\nif l >= u :\n print(s1.lower())\nelse:\n print(s1.upper())\n\n \t\t\t\t \t \t \t\t \t\t \t\t \t \t\t", "in_str = input()\r\n\r\nnum_lower = 0\r\nnum_upper = 0\r\n\r\nfor character in in_str:\r\n if character == character.upper():\r\n num_upper += 1\r\n else:\r\n num_lower += 1\r\n \r\nprint(in_str.upper() if num_upper > num_lower else in_str.lower())", "s=input()\r\ncountup=len([i for i in s if i.isupper()])\r\ncountlo=len([i for i in s if i.islower()])\r\nif countup>countlo :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "s=input()\r\nuc,lc=0,0\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n lc+=1\r\n if(s[i].isupper()):\r\n uc+=1\r\nif(uc>lc):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "word = input()\nupper =0;\nlower =0;\nfor c in word:\n if(c.isupper()):\n upper+=1\n else:\n lower+=1\nif(upper > lower):\n print(word.upper())\nelse:\n print(word.lower())\n\n\n\t \t\t \t \t\t\t \t\t \t \t\t \t \t\t \t", "word = input()\r\nscore_up = 0\r\nscore_low = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n score_up +=1\r\n else:\r\n score_low += 1\r\nif score_up > score_low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s=input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(s)):\r\n if(ord(s[i])>=97 and ord(s[i])<=122):\r\n count1=count1+1\r\n elif(ord(s[i])>=65 and ord(s[i])<=90):\r\n count2=count2+1\r\n \r\nif(count1>=count2):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "string = input()\r\n\r\na = 0\r\nfor i in range(len(string)):\r\n if string[i].islower():\r\n a += 1\r\n else:\r\n a -= 1\r\n\r\nprint(string.lower() if a >= 0 else string.upper())", "s = input()\r\nlc=0\r\nuc=0\r\nfor i in range(len(s)):\r\n if s[i] in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n lc+=1\r\n else:\r\n uc+=1\r\nif lc>uc:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "a=input()\r\nb=list(a)\r\ncount=0\r\ncount2=0\r\nfor i in b:\r\n if (i.islower()):\r\n count=count+1 \r\n else:\r\n count2=count2+1\r\nif(count>count2 or count==count2):\r\n print(a.lower())\r\nif(count<count2):\r\n print(a.upper())\r\n", "x = input()\r\narr = list(x)\r\ncount = [0,0]\r\nfor letter in arr:\r\n if letter >= 'a':\r\n count[1] += 1\r\n elif letter < 'a':\r\n count[0] += 1\r\n\r\nif count[1] > count[0] or count[1] == count[0]:\r\n print(x.lower())\r\nelif count[0] > count[1]:\r\n print(x.upper())", "\r\nclass solution:\r\n def answer(s):\r\n upper = len([i for i in s if i.isupper()])\r\n lower = len([i for i in s if i.islower()])\r\n if upper == lower:\r\n return s.lower()\r\n elif upper > lower:\r\n return s.upper()\r\n else:\r\n return s.lower() \r\n \r\ns = str(input())\r\nans = solution.answer(s)\r\nprint(ans)", "n=input()\r\nsl=sum(1 for i in n if i.islower())\r\nsu=sum(1 for i in n if i.isupper())\r\nif sl==su:\r\n print(n.lower())\r\nelif sl<su:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s=input()\r\nlc,uc=0,0\r\nfor i in s:\r\n if(i.islower()):\r\n lc=lc+1\r\n elif(i.isupper()):\r\n uc=uc+1\r\nif(lc>=uc):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "S=input()\r\ns,c=[],[]\r\nfor i in S:\r\n if ord(i)>=65 and ord(i)<=90:\r\n c.append(i)\r\n else:\r\n s.append(i)\r\nif len(s)>len(c) or len(s)==len(c):\r\n print(S.lower())\r\nelse:\r\n print(S.upper())", "s = input()\r\n\r\nn_upper = sum(ch.isupper() for ch in s)\r\nn_lower = len(s) - n_upper\r\n\r\nif n_upper > n_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\nM = 0\nm = 0\nfor a in range(len(s)):\n if s[a].isupper():\n M += 1\n else:\n m += 1\nif M > m:\n print(s.upper())\nelse:\n print(s.lower())\n", "name = input()\r\nl= int(0)\r\nu =int(0)\r\nfor char in name:\r\n if char.isupper():\r\n u+=1\r\n elif char.islower():\r\n l+=1\r\n\r\nif u > l:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())", "n = input()\r\nc_1 = 0\r\nc_2 = 0\r\nfor i in range(0,len(n)):\r\n p = n[i]\r\n if p.isupper() is True:\r\n c_1 +=1\r\n\r\n else:\r\n c_2 +=1\r\nif c_1>c_2:\r\n s_1 = n.upper()\r\n print(s_1)\r\nelse:\r\n s_2 = n.lower()\r\n print(s_2)\r\n", "str=input()\r\n\r\ndef c(str):\r\n u=0\r\n l=0\r\n str=list(str)\r\n for i in str:\r\n if ord(i)>64 and ord(i)<91:\r\n u+=1\r\n else:\r\n l+=1\r\n \r\n return u,l\r\n \r\n \r\ndef u(str):\r\n str=list(str)\r\n c=0\r\n for i in str:\r\n if ord(i)>96 and ord(i)<123:\r\n x=ord(i)-32\r\n str[c]=chr(x)\r\n c+=1\r\n print(\"\".join(str))\r\n\r\ndef l(str):\r\n str=list(str)\r\n c=0\r\n for i in str:\r\n if ord(i)>64 and ord(i)<91:\r\n x=ord(i)+32\r\n str[c]=chr(x)\r\n c+=1\r\n print(\"\".join(str)) \r\n \r\nx,y=c(str)\r\nif x>y:\r\n u(str)\r\nelse:\r\n l(str)\r\n \r\n \r\n \r\n ", "tmpans = input().strip()\r\ntmp = [chr(i+97) for i in range(26)]\r\nans = 0\r\nfor i in tmpans:\r\n\tif i in tmp:\r\n\t\tans+=1\r\n\telse:\r\n\t\tans -= 1\r\nif ans >= 0:\r\n\tprint(tmpans.lower())\r\nelse:\r\n\tprint(tmpans.upper())", "s = list(input())\nu = 0\nl = 0\nfor i in range(0, len(s)):\n if ord(s[i]) >= 65 and ord(s[i]) <=90:\n u+=1\n elif ord(s[i]) >= 97 and ord(s[i]) <=122:\n l+=1\nif u > l:\n for i in range(0, len(s)):\n if ord(s[i]) >= 97 and ord(s[i]) <=122:\n s[i] = s[i].upper()\nelif l > u or u == l:\n for i in range(0, len(s)):\n if ord(s[i]) >= 65 and ord(s[i]) <=97:\n s[i] = s[i].lower()\nstr = \"\"\nfor i in s:\n str += i\nprint(str)", "my_str=input()\r\nup_count=0\r\nlw_count=0\r\n\r\na=len(my_str)\r\n\r\nfor char in my_str:\r\n if char.isupper():\r\n up_count +=1\r\n else:\r\n lw_count +=1\r\n\r\nif up_count>lw_count:\r\n x=my_str.upper()\r\n print(x)\r\nelif up_count==lw_count:\r\n x=my_str.lower()\r\n print(x)\r\nelse:\r\n x=my_str.lower()\r\n print(x)", "# Read the input word\r\nword = input().strip()\r\n\r\n# Count the number of uppercase and lowercase letters in the word\r\nuppercase_count = sum(1 for letter in word if letter.isupper())\r\nlowercase_count = len(word) - uppercase_count\r\n\r\n# If there are more uppercase letters, convert the word to uppercase; otherwise, to lowercase\r\nif uppercase_count > lowercase_count:\r\n corrected_word = word.upper()\r\nelse:\r\n corrected_word = word.lower()\r\n\r\n# Print the corrected word\r\nprint(corrected_word)\r\n", "a=input()\r\nb=0\r\nfor i in range(len(a)):\r\n if(a[i].islower()):\r\n b+=1\r\nif(len(a)-b>b):\r\n c=a.upper()\r\n print(c)\r\nelse:\r\n c=a.lower()\r\n print(c)", "s = input()\r\nupp, low = 0, 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n upp += 1\r\n else:\r\n low += 1\r\n\r\nif low < upp:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n \r\nprint(s)\r\n", "s = input()\r\nup = 0\r\nstrup = \"\"\r\nstrdown = \"\"\r\nfor ch in s:\r\n if \"A\" <= ch <= \"Z\":\r\n up += 1\r\n strup += ch.upper()\r\n strdown += ch.lower()\r\n\r\nif 2*up > len(s):\r\n print(strup)\r\nelse:\r\n print(strdown)\r\n", "s = input()\r\nL = 0\r\nU = 0\r\nfor c in s:\r\n if(c.isupper()):\r\n U += 1\r\n else:\r\n L += 1\r\n\r\nif(U > L):\r\n print(s.upper())\r\nelif (L >= U):\r\n print(s.lower())", "string = input()\r\nlower_symbols = \"qazwsxedcrfvtgbyhnujmikolp\"\r\ncounts = {\"lower_symbols\": 0, \"upper_symbols\": 0}\r\nfor symbol in string:\r\n if symbol in lower_symbols:\r\n counts[\"lower_symbols\"] += 1\r\n else:\r\n counts[\"upper_symbols\"] += 1\r\nif counts[\"lower_symbols\"] > counts[\"upper_symbols\"]:\r\n print(string.lower())\r\nelif counts[\"lower_symbols\"] == counts[\"upper_symbols\"]:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n \r\n ", "ch=input()\r\nnbu=0\r\nnbl=0\r\nfor i in ch:\r\n if i.islower():\r\n nbl+=1\r\n elif i.isupper():\r\n nbu+=1\r\nif nbl>=nbu:\r\n print(ch.lower())\r\nelse:\r\n print(ch.upper())\r\n", "s=input()\r\nn=len(s)\r\nx=0\r\nfor i in range (n):\r\n if s[i].islower():\r\n x=x+1\r\nif x>=n//2 and n%2==0:\r\n print(s.casefold())\r\nelif x>n//2:\r\n print(s.casefold()) \r\nelse:\r\n print(s.upper())", "def fg():\r\n return int(input())\r\ndef fgh():\r\n return[int(xx) for xx in input().split()]\r\ndef fgt():\r\n return map(int,input().split())\r\ndef fgs():\r\n return input()\r\ns=fgs()\r\nmal=0\r\nbol=0\r\nfor i in range(len(s)):\r\n if ord(s[i])<97:\r\n bol+=1\r\n else:\r\n mal+=1\r\nif mal>=bol:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "from math import ceil as ce\r\ns = input()\r\nk = 0\r\nk1 = 0\r\nfor i in s:\r\n if i==i.upper():\r\n k+=1\r\n else:\r\n k1+=1\r\nif k1>=k:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "slovo = input()\r\na = len(slovo)\r\nup = 0\r\ndown = 0\r\nfor i in range(a):\r\n if slovo[i].isupper():\r\n up += 1\r\n elif slovo[i].islower():\r\n down += 1\r\nif down < up:\r\n slovo = slovo.upper()\r\nelif up < down:\r\n slovo = slovo.lower()\r\nelif up == down:\r\n slovo = slovo.lower()\r\nprint(slovo)", "x = input()\nuppercase = 0\nlowercase = 0\nfor char in x:\n if char.isupper():\n uppercase += 1\n else:\n lowercase += 1\nif uppercase > lowercase:\n print(x.upper())\nelif lowercase > uppercase:\n print(x.lower())\nelse:\n print(x.lower())\nquit()\n\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t \t\t\t", "def findCaseString(str):\r\n lowers = {}\r\n uppers = {}\r\n for i in range(len(str)):\r\n if str[i].isupper():\r\n uppers[i] = True\r\n else:\r\n lowers[i] = True\r\n return lowers, uppers\r\n\r\ndef convert(str):\r\n lowers, uppers = findCaseString(str)\r\n if len(lowers) >= len(uppers):\r\n for upperchar in uppers:\r\n str[upperchar] = str[upperchar].lower()\r\n else:\r\n for lowerchar in lowers:\r\n str[lowerchar] = str[lowerchar].upper()\r\n str = ''.join(str)\r\n return str\r\n\r\nstr = list(input())\r\nprint(convert(str))\r\n", "msg = input()\nupCount = 0\nlowCount = 0\nfor i in range(len(msg)):\n if ord('A') <= ord(msg[i]) <= ord('Z'):\n upCount += 1\n else:\n lowCount += 1\nif lowCount > upCount:\n msg = msg.lower()\nelif lowCount == upCount:\n msg = msg.lower()\nelse:\n msg = msg.upper()\nprint(msg)", "word = input()\r\nbig_letter = 0\r\nfor i in word:\r\n if i.isupper():\r\n big_letter += 1\r\nprint(word.upper() if big_letter > len(word) / 2 else word.lower())", "\r\ns = input()\r\n\r\n\r\nuppercase_count = 0\r\nlowercase_count = 0\r\n\r\n\r\nfor char in s:\r\n if char.isupper():\r\n uppercase_count += 1\r\n else:\r\n lowercase_count += 1\r\n\r\n\r\nif uppercase_count > lowercase_count:\r\n corrected_word = s.upper()\r\nelse:\r\n corrected_word = s.lower()\r\nprint(corrected_word)\r\n", "word=input()\r\n\r\nlwc=0\r\nupc=0\r\nans=\"\"\r\n\r\nfor x in word:\r\n if x.isupper():\r\n upc+=1\r\n else:\r\n lwc+=1\r\n\r\nif(lwc>=upc):\r\n for x in word:\r\n if x.isupper():\r\n ans+=chr(ord(x)+32)\r\n else:\r\n ans+=x\r\nelse:\r\n for x in word:\r\n if x.islower():\r\n ans+=chr(ord(x)-32)\r\n else:\r\n ans+=x\r\n\r\nprint(ans)", "a = input()\r\n\r\nup = 0\r\ndw = 0\r\n\r\nfor i in a:\r\n\tif i > i.upper():\r\n\t\tdw += 1\r\n\telse:\r\n\t\tup += 1\r\n\r\nif up > dw:\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "a=b=0\r\ns=input()\r\nfor _ in s:\r\n if _>='A' and _<='Z':\r\n a+=1\r\n elif _>='a' and _<='z':\r\n b+=1\r\nif a>b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=0\r\nx=list(input())\r\nfor i in x:\r\n if i == i.upper():\r\n n+=1\r\ny=len(x)-n\r\nif y>=n:\r\n x=list(map(str.lower,x))\r\n print(*x,sep='')\r\nelse:\r\n x=list(map(str.upper,x))\r\n print(*x,sep='')", "s=input()\r\nc=0\r\nc1=0\r\nfor i in s:\r\n if i.islower():\r\n c+=1\r\n else:\r\n c1+=1\r\nprint(s.lower()) if c>c1 or c==c1 else print(s.upper())", "n=input()\r\nc='abcdefghijklmnopqrstuvwxyz'\r\nd='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nf=m=0\r\nfor i in n:\r\n\tif i in c:\r\n\t\tf=f+1\r\n\telse:\r\n\t\tm=m+1\r\nif f>=m:\r\n\tn=n.lower()\r\nelse:\r\n\tn=n.upper()\r\nprint(n)", "#word\r\n#converting upper case to lower_case\r\nx = input()\r\n#initially let Upper_case and Lower_case = 0\r\nlower = 0\r\nupper = 0\r\nfor char in x:\r\n if char.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\nprint(x)", "word = input()\r\nl_count = 0;\r\nu_count = 0;\r\nfor ch in word:\r\n if ch.islower():\r\n l_count+=1;\r\n else:\r\n u_count+=1;\r\n\r\nif l_count>=u_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n ", "n =input()\r\nup=0\r\nlo=0\r\nfor i in n:\r\n\tif i.isupper():\r\n\t\tup=up+1\r\n\telse:\r\n\t\tlo=lo+1\r\n\t\r\nif up>lo :\r\n\tprint(n.upper())\r\nelse:\r\n\tprint(n.lower())\r\n\t", "x=input()\r\nu=0\r\nl=0\r\nfor i in range(len(x)):\r\n if (x[i].upper()==x[i]):\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "word=input()\n\nlower_count=0\nupper_count=0\n\nfor i in word:\n if i.islower():\n lower_count+=1\n elif i.isupper():\n upper_count+=1\nif lower_count<upper_count:\n print(word.upper())\nelse:\n print(word.lower())\n", "it = input()\nn = 0\nm = 0\nfor i in it:\n if i.isupper():\n m +=1\n if i.islower():\n n+=1\nif n > m:\n print(it.lower())\nelif n < m:\n print(it.upper())\nelif n == m:\n print(it.lower())\n", "d= input()\r\nuc = 0\r\nlc = 0\r\nfor char in d:\r\n if char.isupper():\r\n uc +=1\r\n else:\r\n lc+=1\r\n\r\nif uc> lc:\r\n print(d.upper())\r\nelse:\r\n print(d.lower())", "n=input()\r\nlc=0\r\nuc=0\r\nfor i in range(len(n)):\r\n if(n[i].islower()):\r\n lc+=1\r\n elif(n[i].isupper()):\r\n uc+=1\r\nif(lc>=uc):\r\n n=n.lower()\r\nelse:\r\n n=n.upper()\r\nprint(n)", "word = input()\r\ns=0\r\nb=0\r\nfor i in range(len(word)):\r\n if 65 <= ord(word[i]) <= 90:\r\n s += 1\r\n elif 97 <= ord(word[i]) <= 122:\r\n b += 1\r\nif s > b:\r\n print(word.upper())\r\nelif b > s:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "\r\na = input()\r\nupper, lower = [], []\r\n# u_pper = list(filter(lambda i: i == i.upper() , a ))\r\n# l_ower = list(filter(lambda i: i == i.upper() , a ))\r\n\r\nfor i in a:\r\n if i == i.upper():\r\n upper.append(i)\r\n else:\r\n lower.append(i) \r\n\r\n\r\nif len(upper) > len(lower):\r\n print(a.upper())\r\n\r\nelse:\r\n print(a.lower())", "st = input()\r\nlow_cou = 0\r\nupp_cou = 0\r\nfor i in st:\r\n if(i.islower()):\r\n low_cou += 1\r\n elif(i.isupper()):\r\n upp_cou += 1\r\nif low_cou >= upp_cou :\r\n print(st.lower())\r\nelse:\r\n print(st.upper())", "a=input()\r\nb=0\r\nfor i in a:\r\n if i.isupper():\r\n b+=1\r\nif (len(a)-b)<b:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n ", "\r\nvnos = input(\"\")\r\n\r\n\r\ndef upperlower(string):\r\n upper = 0\r\n lower = 0\r\n\r\n for i in range(len(string)):\r\n\r\n # For lower letters\r\n if (ord(string[i]) >= 97 and\r\n ord(string[i]) <= 122):\r\n lower += 1\r\n\r\n # For upper letters\r\n elif (ord(string[i]) >= 65 and\r\n ord(string[i]) <= 90):\r\n upper += 1\r\n\r\n return upper, lower\r\n\r\n\r\nif upperlower(vnos)[0] > upperlower(vnos)[1]:\r\n print(vnos.upper())\r\nelse:\r\n print(vnos.lower())", "s=input()\r\nsl=0\r\nsu=0\r\nfor i in s:\r\n if i.islower():\r\n sl=sl+1\r\n else:\r\n su=su+1\r\nif sl>=su:\r\n k=s.lower()\r\nelse:\r\n k=s.upper()\r\nprint(k)", "from sys import stdin, stdout\r\n\r\nword = stdin.readline().strip('\\n').strip('\\t')\r\n\r\nup = 0\r\nlow = 0\r\n\r\nfor c in word:\r\n # print(\"char:\" + c)\r\n if (c.isupper()):\r\n up = up + 1\r\n else:\r\n low = low + 1\r\n\r\nif (up>low):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "x = input()\nup = 0\nlow = 0\nfor i in x:\n if i == i.lower():\n low+=1\n else:\n up+=1\nif low>=up:\n print(x.lower())\nelse:\n print(x.upper()) ", "string = str(input())\r\n\r\na = []\r\nb = []\r\nfor i in string:\r\n if ord(i) in range(65,91):\r\n a.append(i)\r\n else:\r\n b.append(i)\r\n\r\nif len(b) < len(a):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "s = input(); ct_upper = 0; ct_lower = 0\r\nfor i in s:\r\n if ord(i) > 96: ct_lower += 1\r\n else: ct_upper += 1\r\nprint(s.upper() if ct_upper > ct_lower else s.lower())\r\n", "s = str(input())\r\n\r\nlow = 0\r\nhigh = 0\r\nfor i in s:\r\n if i == i.lower():\r\n low += 1\r\n else:\r\n high += 1\r\n\r\nif high > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nb, c = 0, 0\r\n\r\nfor i in a:\r\n if i.isupper():\r\n b += 1\r\n elif i.islower():\r\n c += 1\r\n\r\nif b > c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower()) \r\n", "a = input()\r\ncount = 0\r\nfor i in a:\r\n if i.istitle() == True:\r\n count += 1\r\nprint(a.upper()) if count > len(a) / 2 else print(a.lower()) ", "s=input()\r\nl=0\r\nu=0\r\nfor x in s:\r\n if x>='a' and x<='z':\r\n l+=1\r\n elif x>='A' and x<='Z':\r\n u+=1\r\nans=''\r\nif l<u :\r\n ans=s.upper()\r\nelif l>=u:\r\n ans=s.lower()\r\nprint(ans)", "s = input()\r\nlower = 0\r\ncapital = 0\r\nfor i in s:\r\n\tif (i.isupper()):\r\n\t\tcapital += 1\r\n\telse:\r\n\t\tlower += 1\r\n\r\nif(lower>=capital):\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "test_str=input()\r\n\r\nres = [char for char in test_str if char.isupper()]\r\nres1 = [char for char in test_str if char.islower()]\r\nif(len(res)<=len(res1)):\r\n print(test_str.lower())\r\nelse:\r\n print(test_str.upper())\r\n", "s = input()\r\nlower_count = 0\r\n\r\nfor x in s:\r\n if x.islower():\r\n lower_count += 1\r\n\r\nif lower_count > len(s)-lower_count or lower_count == len(s)-lower_count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\nn_upper = 0\r\nfor c in word:\r\n if c.isupper():\r\n n_upper += 1\r\nif (n_upper > len(word) / 2):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "word=input()\r\nreslut_capital=0\r\nreslut_small=0\r\nfor hrof in word:\r\n if hrof.islower():\r\n reslut_small+=1\r\n if hrof.isupper():\r\n reslut_capital+=1\r\nif reslut_capital>reslut_small:\r\n print(word.upper())\r\nif reslut_small>=reslut_capital:\r\n print(word.lower())", "word=str(input())\r\nupper=0\r\nlower=0\r\nfor l in word :\r\n if l.isupper()==True:\r\n upper+=1\r\n else:\r\n lower+=1\r\n\r\nif upper>lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nup=0\r\nlo=0\r\nfor i in s:\r\n if (i.isupper()):\r\n up=up+1\r\n elif (i.islower()):\r\n lo=lo+1\r\nif up>lo :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in s:\r\n if (i.isupper()):\r\n c1 = c1+1\r\n else:\r\n c2 = c2+1\r\n\r\nif(c1 > c2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "def up_low (s):\r\n n_lower=0\r\n n_upper=0\r\n output=\"\"\r\n for c in s:\r\n if c.lower()==c:\r\n n_lower+=1\r\n else:\r\n n_upper+=1\r\n if n_lower>=n_upper:\r\n for ck in s:\r\n output+=ck.lower()\r\n else:\r\n for ck in s:\r\n output+=ck.upper()\r\n print(output)\r\n\r\nup_low(input())", "s = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 >= c2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "'''input\nHoUse\n'''\ns = input()\nif len([x for x in s if x.isupper()]) > len([y for y in s if y.islower()]):\n\tprint(s.upper())\nelse:\n\tprint(s.lower()) ", "name = input()\r\nlcount = 0\r\nucount = 0\r\nfor i in name:\r\n if i.islower():\r\n lcount+=1\r\n else:\r\n ucount+=1\r\nif lcount==ucount:\r\n print(name.lower())\r\nelif lcount>ucount:\r\n print(name.lower())\r\nelif lcount<ucount:\r\n print(name.upper())", "def test():\r\n st = input()\r\n low = 0\r\n for i in st:\r\n if i.islower():\r\n low += 1\r\n\r\n if low < len(st) - low:\r\n print(st.upper())\r\n else:\r\n print(st.lower())\r\n\r\nif __name__ == \"__main__\":\r\n test()", "x = input()\nupper = 0\nlower = 0\nfor i in x:\n\tif (i < 'a'):\n\t\tupper += 1\n\telse:\n\t \tlower += 1\nif (lower < upper):\n\tprint(x.upper())\nelse:\n\tprint(x.lower())", "if __name__ == \"__main__\":\r\n name = input()\r\n low = 0\r\n for ch in name:\r\n if ch.islower():\r\n low += 1\r\n if low >= len(name) - low:\r\n print(name.lower())\r\n else:\r\n print(name.upper())", "inp = input()\r\n\r\n\r\nlow = 0\r\nhigh = 0\r\nfor k in inp:\r\n if k <= 'z' and k >='a':\r\n low+=1\r\n if k <= 'Z' and k >= 'A':\r\n high +=1\r\nif low >= high:\r\n print(inp.lower())\r\nelse:\r\n print(inp.upper())", "s=input()\r\nupper=0\r\nfor _ in s:\r\n if _.isupper():\r\n upper+=1\r\n \r\nif upper*2==s.__len__():\r\n print(s.lower())\r\nelif upper>s.__len__()-upper:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=str(input())\r\nx=list(s)\r\na=[]\r\nb=[]\r\nfor i in x:\r\n if(i.islower()==True):\r\n a.append(i)\r\n elif(i.isupper()==True):\r\n b.append(i)\r\nif(len(b)>len(a)):\r\n s=s.upper()\r\nelif(len(b)<len(a)):\r\n s=s.lower()\r\nelif(len(a)==len(b)):\r\n s=s.lower()\r\nprint(s) \r\n \r\n ", "import sys\nfrom itertools import permutations\nfrom collections import Counter\nimport math\nM = 1000000007\n\ns = input()\nl,u = 0,0\nfor i in s:\n if i.islower():\n l += 1\n elif i.isupper():\n u += 1\nif u > l:\n print(s.upper())\nelse: print(s.lower())", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\nlower = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n lower += 1\r\n\r\nif lower >= len(s) - lower:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=str(input())\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if i.isupper() :\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\nif c1 > c2:\r\n s=s.upper()\r\nelif c2>c1:\r\n s=s.lower()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "n=input()\r\na=[char for char in n if char.isupper()] \r\nb=[char for char in n if char.islower()] \r\nif len (a) > len (b):\r\n print (n.upper())\r\nelse:\r\n print (n.lower())\r\n", "# Count uppercase letters\n# Count lowercase letters\n# If number of lower case letters is >= upperCase -> lowercase\n# else -> uppercase\n\nword = input()\ntotalLeters = len(word)\ncapitalLeters = sum(1 for c in word if c.isupper())\nlowerLetters = totalLeters - capitalLeters\nif lowerLetters >= capitalLeters:\n print(word.lower())\nelse:\n print(word.upper())\n\n", "a = str(input())\r\nsplitString = [str(x) for x in a]\r\nlowerCount = 0\r\nhigherCount = 0\r\nfor x in range(len(splitString)):\r\n if splitString[x].islower():\r\n lowerCount += 1\r\n else:\r\n higherCount += 1\r\nif lowerCount == higherCount:\r\n print(\"\".join(splitString).lower())\r\nelif lowerCount > higherCount:\r\n print(\"\".join(splitString).lower())\r\nelse:\r\n print(\"\".join(splitString).upper())", "import re\r\ns=input()\r\nif len(re.findall(r'[A-Z]',s))>len(re.findall(r'[a-z]',s)):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "#https://codeforces.com/contest/59/problem/A\r\n\r\ndef solve():\r\n return 0\r\n\r\n\r\ndef main():\r\n word = input()\r\n upper=0\r\n lower=0\r\n\r\n for char in word:\r\n if char.isupper():\r\n upper += 1\r\n else:\r\n lower+=1\r\n if upper > lower:\r\n print(word.upper())\r\n elif lower > upper:\r\n print(word.lower())\r\n else:\r\n print(word.lower())\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\nu_counter = 0\r\nfor i in s:\r\n if ord(i) <= 90:\r\n u_counter += 1\r\nif u_counter > len(s) - u_counter:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nupper=sum(1 for c in s if c.isupper())\r\nlower=len(s)-upper\r\nif lower>=upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=list(input())\r\nu,l=0,0\r\nfor i in range(len(s)):\r\n if s[i]>='a' and s[i]<='z': l+=1\r\n else: u+=1\r\nm=''.join(s)\r\nif l>=u:\r\n m=m.lower()\r\nelse:\r\n m=m.upper()\r\nprint(m)", "s = input()\r\nhigh = 0\r\nlow = 0\r\nlist = [letter for letter in s]\r\nfor i in range(len(list)):\r\n if list[i] == list[i].upper():\r\n high += 1\r\n elif list[i] == list[i].lower():\r\n low += 1\r\nif high>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nctr = 0\r\nfor elem in s:\r\n if 'A' <= elem <= 'Z':\r\n ctr += 1\r\nif ctr <= len(s)//2:\r\n print (s.lower())\r\nelse:\r\n print (s.upper())", "string=input()\r\nstring1='abcdefghijklmonpqrstuvwxyz'\r\nupper_case=[]\r\nlower_case=[]\r\nfor char in string:\r\n if char in string1:\r\n lower_case.append(char)\r\n else:\r\n upper_case.append(char)\r\nif len(upper_case)>len(lower_case):\r\n string=string.upper()\r\n print(string)\r\nelse:\r\n string=string.lower()\r\n print(string)\r\n", "n=list(input())\r\ncounter1=0\r\ncounter2=0\r\nfor i in n :\r\n if i == i.upper() :\r\n counter1=counter1+1\r\n else :\r\n counter2=counter2+1\r\n\r\nif counter1>counter2 :\r\n s=\"\".join(n)\r\n s=s.upper()\r\n print(s)\r\nelse :\r\n s=\"\".join(n)\r\n s=s.lower()\r\n print(s)", "def convert(original):\n upper = 0\n lower = 0\n for character in original:\n if character.isupper():\n upper += 1\n else:\n lower += 1\n if upper > lower:\n return original.upper()\n else:\n return original.lower()\n\n\nx = input()\nprint(convert(x))\n \t \t\t \t \t \t\t\t\t\t\t\t\t\t \t\t \t \t \t", "str1=input()\r\na=0\r\nfor i in range(len(str1)):\r\n if ord(str1[i])>=65 and ord(str1[i])<=90:\r\n a=a+1\r\nif a>len(str1)/2:\r\n str2=str1.upper()\r\n print(str2)\r\nelse:\r\n str2=str1.lower()\r\n print(str2)", "input_a=(input())\r\nup=0\r\nlow=0\r\nfor i in input_a:\r\n if i.islower():\r\n low+=1\r\n elif i.isupper():\r\n up+=1\r\nif low>up:\r\n print (input_a.lower())\r\nelif low==up:\r\n print (input_a.lower())\r\nelse:\r\n print (input_a.upper())\r\n\r\n", "string = input()\r\nchar_arr = [char for char in string]\r\n\r\ncountU = countL = 0\r\n\r\nfor i in char_arr:\r\n if i.isupper() :\r\n countU +=1\r\n else:\r\n countL += 1\r\n\r\nif countL >= countU :\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n\r\n", "w=input()\r\nuc=sum(1 for l in w if l.isupper())\r\nlc=len(w)-uc\r\nif uc>lc:\r\n cw=w.upper()\r\nelse:\r\n cw=w.lower()\r\nprint(cw)", "a = input()\nb = sum(map(str.isupper, a))\nc = sum(map(str.islower, a))\nif b > c:\n print(a.upper())\nelif b == c:\n print(a.lower())\nelse:\n print(a.lower())\n\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 *-*\n\ns = input()\nu = 0\nl = 0\nfor i in range(len(s)):\n\tif s[i] >= 'A' and s[i] <= 'Z':\n\t\tu +=1\n\telif s[i] >= 'a' and s[i] <= 'z':\n\t\tl +=1\nif u > l:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())", "\r\ndef main():\r\n\r\n s = input()\r\n\r\n s1 = [i for i in s if i.islower()]\r\n s2 = [j for j in s if j.isupper()]\r\n if len(s) >= 1 and len(s) <= 100:\r\n if len(s1) < len(s2):\r\n s = s.upper()\r\n print(s)\r\n if len(s1) >= len(s2):\r\n s = s.lower()\r\n print(s)\r\n\r\nmain()\r\n\r\n", "s = list(str(input()))\r\nupper = 0\r\nlower = 0\r\nfor i in s:\r\n if str(i).isupper():\r\n upper+=1\r\n elif str(i).islower():\r\n lower+=1\r\ns=''.join(s)\r\nif lower>=upper:\r\n print(s.lower())\r\nelif lower<upper:\r\n print(s.upper())\r\n", "# -*- coding: utf-8 -*-\r\n\r\nstring = input()\r\n\r\nUpper = sum(1 for i in string if i.isupper())\r\nLower = sum(1 for i in string if i.islower())\r\n\r\nif Upper > Lower:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "s=input()\r\ns1=0\r\ns2=0\r\nss=\"\"\r\na=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nb=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in s:\r\n if i.isupper()==True:\r\n s1+=1\r\n else:\r\n s2+=1\r\n#print(s1,s2)\r\nif s1>s2:\r\n for i in s:\r\n if i.isupper()==False:\r\n ss+=a[b.find(i)]\r\n else:\r\n ss+=i\r\nelse:\r\n for i in s:\r\n if i.isupper()==True:\r\n ss+=b[a.find(i)]\r\n else:\r\n ss+=i\r\nprint(ss)", "text = list(input())\r\nz = 0\r\nnoz = 0\r\nfor letter in text:\r\n if letter == letter.upper():\r\n z += 1\r\n else:\r\n noz += 1\r\ntext = ''.join(text)\r\nif z > noz:\r\n print(text.upper())\r\nelse:\r\n print(text.lower())", "t=input()\r\na=0\r\nb=0\r\nfor i in t:\r\n if ord(i)>=65 and ord(i)<=90:\r\n a+=1\r\n else:\r\n b+=1\r\nif(a>b):\r\n print(t.upper())\r\nelse:\r\n print(t.lower())\r\n", "\r\nx = str(input())\r\nlen = len(x)\r\nupperCount = 0\r\nfor c in x:\r\n if c.isupper():\r\n upperCount+=1\r\nlowerCount = len - upperCount\r\nif upperCount > lowerCount :\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "n=input()\nl=0\nfor i in n:\n if 97<=ord(i) and ord(i)<=122:\n l+=1\nu=len(n)-l\nif u<=l:\n print(n.lower())\nelse:\n print(n.upper())\n", "n=input()\r\nl=len(n)\r\nu=0\r\nfor i in n:\r\n\tif i.isupper():\r\n\t\tu+=1\r\nif(u<=l//2):\r\n\tprint(n.lower())\r\nelse:\r\n\tprint(n.upper())", "palabra = input()\r\nlista = list(palabra)\r\nlistaMayus = list(palabra.upper())\r\nmayusculas,minusculas = 0,0\r\nfor i in range(len(lista)):\r\n if lista[i]==listaMayus[i]:\r\n mayusculas +=1\r\n else:\r\n minusculas +=1\r\nif mayusculas==minusculas:\r\n print(palabra.lower())\r\nelif mayusculas>minusculas:\r\n print(palabra.upper())\r\nelse:\r\n print(palabra.lower())", "def is_up_or_low(word: str) -> str:\n up = sum(1 for char in word if char.isupper())\n lower = sum(1 for char in word if char.islower())\n if up > lower:\n return word.upper()\n return word.lower()\n\n\nword = input()\nprint(is_up_or_low(word))\n", "string = input()\r\n\r\ncount_U = 0\r\ncount_L = 0\r\n\r\nfor c in string:\r\n if c.isupper():\r\n count_U += 1\r\n else:\r\n count_L += 1\r\n\r\nif count_U > count_L:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "# Input the word\r\ns = input()\r\n\r\n# Initialize variables to count uppercase and lowercase letters\r\nuppercase_count = 0\r\nlowercase_count = 0\r\n\r\n# Count the uppercase and lowercase letters\r\nfor letter in s:\r\n if letter.isupper():\r\n uppercase_count += 1\r\n else:\r\n lowercase_count += 1\r\n\r\n# Convert the word to uppercase if there are more uppercase letters, else to lowercase\r\nif uppercase_count > lowercase_count:\r\n corrected_word = s.upper()\r\nelse:\r\n corrected_word = s.lower()\r\n\r\n# Print the corrected word\r\nprint(corrected_word)\r\n", "x=input()\r\nlow=0\r\nup=0\r\nfor i in x:\r\n if 65<=ord(i)<=90:\r\n up+=1\r\n if 97<=ord(i)<=122:\r\n low+=1\r\nif up>low:\r\n x=x.upper()\r\n print(x)\r\nelse:\r\n x=x.lower()\r\n print(x)", "s = str(input())\r\narr = list(s)\r\ncapital = 0;\r\nsmall =0;\r\nletter=''\r\nfor x in range(len(arr)):\r\n if arr[x].isupper():\r\n capital +=1\r\n if arr[x].islower():\r\n small +=1\r\nif capital > small:\r\n letter=s.upper()\r\nelse:\r\n letter=s.lower()\r\nprint(letter)", "s = input()\nLcount, Rcount = 0, 0\nfor c in s:\n if c.islower():\n Lcount += 1\n elif c.isupper():\n Rcount += 1\nif Lcount >= Rcount:\n print(s.lower())\nelse:\n print(s.upper())\n", "n = input()\r\na = 0\r\nl = 0\r\nfor i in range(len(n)):\r\n if 'a' <= n[i] <= 'z':\r\n a = a + 1\r\n if 'A' <= n[i] <= 'Z':\r\n l = l + 1\r\nif a > l:\r\n n = n.lower()\r\nelif l > a:\r\n n = n.upper()\r\nelse:\r\n n = n.lower()\r\nprint(n)", "UP = \"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\nword = input()\r\nprint(word.upper() if len(word) - sum([1 for i in word if i in UP]) - sum([1 for i in word if i in UP]) < 0 else word.lower())", "s = input(\"\")\r\nlength = len(s)\r\nlowcase = 0\r\nuppcase = 0\r\n\r\nfor i in range(length):\r\n if s[i].islower():\r\n lowcase = lowcase + 1\r\n elif s[i].isupper():\r\n uppcase = uppcase + 1\r\n\r\nif lowcase >= uppcase:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\ncnt1 = 0\ncnt2 = 0\nif s.lower() == s or s.upper() == s:\n print(s)\nelse:\n for x in s:\n if x == x.upper():\n cnt1 += 1\n else:\n cnt2 += 1\n if cnt1 > cnt2:\n print(s.upper())\n else:\n print(s.lower())\n\n\n \n", "a = input()\r\ncount = 0\r\ncnt = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n count+=1\r\n if a[i].islower():\r\n cnt+=1\r\nif count>cnt:\r\n print(a.upper())\r\nelif count<cnt:\r\n print(a.lower())\r\nelif count==cnt:\r\n print(a.lower())", "s=input()\r\nc=0\r\nc1=0\r\nfor i in s:\r\n if i.islower():\r\n c=c+1\r\n else:\r\n c1=c1+1\r\nif c>c1:\r\n a=s.lower()\r\nelif c<c1:\r\n a=s.upper()\r\nelse:\r\n a=s.lower()\r\nprint(a)", "\r\nif __name__ == '__main__':\r\n s1=input()\r\n upper=0\r\n lower=0\r\n for i in range(len(s1)):\r\n if s1[i].isupper():\r\n upper+=1\r\n elif s1[i].islower():\r\n lower+=1\r\n if upper > lower :\r\n print(s1.upper())\r\n elif lower > upper :\r\n print(s1.lower())\r\n else:\r\n print(s1.lower())\r\n", "x=input()\r\nx=list(x)\r\ns=0\r\nt=0\r\nfor each in x:\r\n if each.islower():\r\n s=s+1\r\n else:\r\n t=t+1\r\nx=''.join(x)\r\nif s>=t:\r\n x=x.lower()\r\nelse:\r\n x=x.upper()\r\nprint(x)", "word = str(input())\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(word)):\r\n if (ord(word[i]) >= 97):\r\n lower += 1\r\n else:\r\n upper +=1\r\nif lower >= upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n\r\n", "import string\r\n\r\nword = input(\"\")\r\n##word = \"ViP\"\r\n\r\n\r\ntotalSmall = 0\r\ntotalCapital = 0\r\nfor letter in word:\r\n if(letter in string.ascii_lowercase):\r\n totalSmall += 1\r\n else:\r\n totalCapital += 1\r\n\r\nif(totalCapital > totalSmall):\r\n final = \"\"\r\n for i in word:\r\n if(i in string.ascii_lowercase):\r\n final = final + string.ascii_uppercase[string.ascii_lowercase.find(i)]\r\n else:\r\n final = final + i\r\nelse:\r\n final = \"\"\r\n for i in word:\r\n if(i in string.ascii_uppercase):\r\n final = final + string.ascii_lowercase[string.ascii_uppercase.find(i)]\r\n else:\r\n final = final + i\r\nprint(final)", "s=input()\r\nuppercase_count = sum(1 for char in s if char.isupper())\r\nlowercase_count = sum(1 for char in s if char.islower())\r\nif uppercase_count>lowercase_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "w = input()\nlower = 0\nupper = 0\nfor char in w:\n if char.isupper():\n upper += 1\n else:\n lower += 1\nif upper > lower:\n w = w.upper()\nelse:\n w= w.lower()\nprint(w)\n\t \t \t\t \t \t\t \t \t \t \t\t", "s=input()\r\nlc=0\r\nuc=0\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n lc=lc+1\r\n else:\r\n uc=uc+1\r\nif(lc>uc):\r\n print(s.lower())\r\nelif(uc>lc):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import string\r\nt = input()\r\nc = 0\r\nfor i in t:\r\n if i in string.ascii_uppercase:\r\n c += 1\r\n\r\nif c > len(t) - c:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())\r\n", "a=input()\r\ncount1=0\r\ncount2=0\r\nfor i in a:\r\n if(i.islower()):\r\n count1=count1+1\r\n else:\r\n count2=count2+1\r\nif count1>=count2:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\r\nup=low=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n t=s.upper()\r\nelif up<=low:\r\n t=s.lower()\r\nprint(t) \r\n", "#59A\r\nn=input()\r\nl=[]\r\ncount_up=0\r\ncount_low=0\r\nfor i in n:\r\n if i!=i.upper():\r\n count_low+=1\r\n else: count_up+=1\r\n l.append(i)\r\nif count_up>count_low:\r\n print(n.upper())\r\nelse: print(n.lower())\r\n", "s=input()\r\ncount1=0\r\ncount2=0\r\nfor i in s:\r\n if i.isupper():\r\n count1+=1\r\n else:\r\n count2+=1\r\nif count1>count2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "val = list(input())\r\ncap = 0\r\nsmall = 0\r\nfor i in range(len(val)):\r\n if ord(val[i])<91:\r\n cap = cap + 1\r\n else:\r\n small = small + 1\r\nif cap > small:\r\n for i in range(len(val)):\r\n if ord(val[i])>91:\r\n val[i] = chr(ord(val[i]) - 32)\r\nelse:\r\n for i in range(len(val)):\r\n if ord(val[i])<91:\r\n val[i] = chr(ord(val[i]) + 32)\r\nprint(''.join(str(i) for i in val))\r\n", "word = input()\r\nanswer = ''\r\nlower = 0\r\nupper = 0\r\nfor i in word:\r\n if i >= 'a' and i <= 'z':\r\n lower += 1\r\n elif i >= 'A' and i <= 'Z':\r\n upper += 1\r\nif lower >= upper:\r\n for i in word:\r\n answer +=i.lower()\r\nelse:\r\n for i in word:\r\n answer += i.upper()\r\nprint(answer)\r\n", "s = input()\r\ncount_l = 0\r\ncount_b = 0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n count_l += 1\r\n if 'A' <= i <= 'Z':\r\n count_b += 1\r\nif count_l >= count_b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "x = input()\r\nuppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nlowercase = 'abcdefghijklmnopqrstuvwxyz'\r\nup = 0\r\nlow = 0\r\nfor i in x:\r\n\r\n if i in uppercase:\r\n up = up + 1\r\n if i in lowercase:\r\n low = low + 1\r\n\r\nif up > low:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n\r\n\r\n\r\n", "s=input()\r\nu=0\r\nl=0\r\ns1=\"\"\r\nfor i in s:\r\n if i.isupper():\r\n u=u+1\r\n elif i.islower():\r\n l=l+1\r\nif u>l:\r\n s1=s.upper()\r\nelif u==l:\r\n s1=s.lower()\r\nelif l>u:\r\n s1=s.lower()\r\nprint(s1)\r\n \r\n", "stringer = str(input())\nupper = 0\nlower = 0\n\nfor ele in stringer:\n if ele.islower():\n lower += 1\n if ele.isupper():\n upper += 1\n\nif lower == upper or upper < lower:\n stringer = stringer.lower()\n\nif lower < upper:\n stringer = stringer.upper()\n\nprint(stringer)", "x = input()\r\na,b = 0,0\r\nfor i in x:\r\n if i.isupper(): a+=1\r\n else: b+=1\r\nif a>b: print(x.upper())\r\nelse: print(x.lower())", "s = input()\r\n\r\ns_l = 0\r\ns_u = 0\r\nfor l in s:\r\n if l == l.lower():\r\n s_l += 1\r\n elif l == l.upper():\r\n s_u += 1\r\n \r\nif s_l >= s_u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "st = input()\r\nl = 0\r\nu = 0\r\nfor i in st:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nif l>=u:\r\n st = st.lower()\r\n print(st)\r\nelse:\r\n st = st.upper()\r\n print(st)", "s = input()\r\ncount_lowercase = 0\r\ncount_uppercase = 0\r\nresult = ''\r\nfor i in s:\r\n if ord(i) >=65 and ord(i) <= 90:\r\n count_uppercase += 1\r\n else:\r\n count_lowercase += 1\r\nif count_uppercase <= count_lowercase:\r\n for i in s:\r\n if ord(i) >=65 and ord(i) <= 90:\r\n result += chr(ord(i)+32)\r\n else:\r\n result += i\r\nelse:\r\n for i in s:\r\n if ord(i) > 90:\r\n result += chr(ord(i)-32)\r\n else:\r\n result += i\r\nprint(result)", "def word(s):\r\n u, l = 0, 0\r\n for i in s:\r\n if ord(i) >= 97:\r\n u+=1\r\n else:\r\n l+=1\r\n if u > l:\r\n return s.lower()\r\n elif l > u:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\ns = input()\r\nprint(word(s))\r\n ", "s=input()\r\nc=0\r\nr=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n c=c+1\r\n else:\r\n r=r+1\r\nfor i in range(len(s)):\r\n if(c>r):\r\n print(s[i].upper(),end='')\r\n else:\r\n print(s[i].lower(),end='')", "n = input()\nl=0\nu=0\nfor i in n:\n if 'a' <= i <= 'z': l+=1\n else: u+=1\nif l>=u: print(n.lower())\nelse: print(n.upper())\n", "mixedword = input()\r\n \r\ncnt_of_lowercaseltrs = 0\r\ncnt_of_uppercaseltrs = 0\r\n \r\nfor ch in mixedword:\r\n if ch.isupper():\r\n cnt_of_uppercaseltrs += 1\r\n else:\r\n cnt_of_lowercaseltrs += 1\r\nif cnt_of_uppercaseltrs > cnt_of_lowercaseltrs:\r\n mixedword = mixedword.upper()\r\nelse:\r\n mixedword = mixedword.lower()\r\n \r\nprint(mixedword)", "word=input()\r\nlowercase_count=sum(1 for c in word if c.islower())\r\nuppercase_count=sum(1 for c in word if c.isupper())\r\nif lowercase_count>=uppercase_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "word = input()\r\nif sorted(word)[len(word)//2].isupper():\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "a = input()\r\nb = 0\r\nc = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper()==True:\r\n b = b+1\r\n else:\r\n c = c+1\r\n \r\nif b>c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nsup = s.upper()\r\nslow = s.lower()\r\ncup = 0\r\nclow = 0\r\nfor i in s:\r\n if i in sup:\r\n cup+=1\r\n else:\r\n clow+=1\r\nif cup<clow or cup == clow:\r\n print(slow)\r\nelif cup>clow:\r\n print(sup)", "\r\ndef main():\r\n l = 0;u = 0\r\n for i in s:\r\n x = ord(i)\r\n if x < 97 and x >= 65:\r\n u += 1\r\n else:\r\n l += 1\r\n if u > l:return 1\r\n return 0 \r\n \r\nif __name__ == \"__main__\":\r\n s = input()\r\n x = main()\r\n if x == 1:print(s.upper())\r\n else:print(s.lower())", "word = input()\r\n\r\nlower_letters = 0\r\nupper_letters = 0\r\n\r\nfor letter in word:\r\n\r\n\tif letter.islower():\r\n\t\tlower_letters += 1\r\n\telif letter.isupper():\r\n\t\tupper_letters += 1\r\n\r\nif upper_letters > lower_letters:\r\n\tprint(word.upper())\r\nelse:\r\n\tprint(word.lower())", "s = input()\r\nc = 0\r\ncc = 0\r\nfor i in s:\r\n if i.islower():\r\n c += 1\r\n else:\r\n cc += 1\r\nif c > cc :\r\n print(s.lower())\r\nelif c < cc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "#!/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 s = inp()\r\n\r\n l = 0\r\n u = 0\r\n for c in s:\r\n if ord('A') <= ord(c) <= ord('Z'):\r\n u += 1\r\n if ord('a') <= ord(c) <= ord('z'):\r\n l += 1\r\n\r\n return s.lower() if u <= l else s.upper()\r\n\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x = input()\ny = list(x)\n\ncount = 0\nfor i in y:\n if(i.isupper()):\n count+=1\nif(count>len(y)-count):\n x = x.upper()\nelse:\n x = x.lower()\nprint(x)", "from sys import stdin\r\nw = stdin.readline().rstrip()\r\nc = sum(1 if c.islower() else -1 for c in w)\r\nprint ((w.upper(),w.lower())[c>=0])", "\r\ndef can(s):\r\n up = 0\r\n lo = 0\r\n for i in s:\r\n if i.isupper():\r\n up +=1\r\n if i.islower():\r\n lo +=1\r\n if (up > lo):\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n\r\ns = input()\r\ncan(s)", "word = list(input())\r\nn = len(word)\r\nk = 0\r\nfor i in range(n):\r\n if ord(word[i]) >= 65 and ord(word[i]) <= 90 :\r\n k += 1\r\nr = n - k\r\nif r < k :\r\n word = [x.upper() for x in word]\r\nelse :\r\n word = [x.lower() for x in word]\r\nprint(''.join(map(str , word)))", "s = input()\r\na = b = 0\r\nfor i in s:\r\n\tif i.isupper():\r\n\t\ta += 1\r\n\telse:\r\n\t\tb += 1\r\nif a>b:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "a=input()\r\nu=['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\nl=['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\nuc=0\r\nlc=0\r\nfor i in a:\r\n if i in u:\r\n uc+=1\r\nfor j in a:\r\n if j in l:\r\n lc+=1\r\nif uc>lc:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "a = input()\r\nc = 0\r\nfor i in a:\r\n if i.isupper():\r\n c += 1\r\n else:\r\n c += 0\r\nif c <= len(a) - c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "def upper_counter(a):\r\n x = 0\r\n for i in a:\r\n if i.isupper():\r\n x+=1\r\n return x\r\n\r\na = input()\r\nif upper_counter(a)>(len(a)//2):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s=input()\r\nCcount=0\r\nLcount=0\r\nfor i in s:\r\n if i.isupper():\r\n Ccount+=1\r\n else:\r\n Lcount+=1\r\nif Ccount<=Lcount:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = str(input())\r\nd = 0\r\nx = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n d += 1\r\n else:\r\n x += 1\r\nif x >= d:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "\"\"\"\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\"\"\"\r\n\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\r\ns = input()\r\ncountLower, countUpper = 0,0\r\n\r\nfor ch in s:\r\n if ch.isupper():\r\n countUpper += 1\r\n else:\r\n countLower += 1\r\n\r\nif countLower < countUpper:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nc=0\r\nd=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n c+=1\r\n else:\r\n d+=1\r\nif c==d or d>c:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\nupper =0\r\nlower = 0\r\nfor i in s:\r\n if(i.isupper()):\r\n upper +=1 \r\n else :\r\n lower += 1\r\nprint(s.upper() if upper > lower else s.lower())", "import string\r\ns = str(input())\r\nw = []\r\ne = []\r\na = string.ascii_uppercase\r\nb = string.ascii_lowercase\r\n\r\nfor i in s:\r\n if i in a:\r\n w.append(1)\r\n else:\r\n e.append(1)\r\n\r\nif sum(w)>sum(e):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "c = 0\r\nC = 0\r\nn = input()\r\nfor i in n:\r\n if 97 <= ord(i) <= 122:\r\n c += 1\r\n else:\r\n C += 1\r\nif c >= C:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "string = input()\r\n\r\nlowercase = 0\r\nuppercase = 0\r\n\r\n\r\nfor i in string:\r\n if i == i.lower():\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\n\r\nif uppercase > lowercase:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s = input()\n\ns_list = list(s)\ns_low = s.lower()\ns_low_list = list(s_low)\n\nwm = list(zip(s_list, s_low_list))\nlc = 0\nuc = 0\n\nfor i in range(len(wm)):\n if wm[i][0] == wm[i][1]:\n lc += 1\n else:\n uc += 1\n\nif lc >= uc:\n s = s.lower()\nelse:\n s = s.upper()\n\nprint(s)\n \t \t \t\t\t \t \t \t\t \t \t\t\t \t\t", "s = input()\r\ncount = 0\r\ncount1 = 0\r\nfor i in s:\r\n if i.isupper():\r\n count+= 1\r\n else:\r\n count1+= 1\r\nif count <= count1:\r\n s= s.lower()\r\nelse:\r\n s= s.upper()\r\nprint(s)\r\n ", "word = input()\r\nupper_count = sum (1 for letter in word if letter.isupper())\r\nlower_count = len(word) - upper_count\r\n\r\nif upper_count > lower_count :\r\n correct_word = word.upper()\r\nelse :\r\n correct_word = word.lower()\r\n\r\nprint(correct_word)", "n = input()\r\nupperNumbers = 0\r\nlowerNumbers = 0\r\nl = \"\"\r\n\r\nfor i in range(len(n)):\r\n if ord(n[i]) >= 65 and ord(n[i]) <= 90:\r\n upperNumbers += 1\r\n else:\r\n lowerNumbers += 1\r\n\r\nif lowerNumbers >= upperNumbers:\r\n l = n.lower()\r\nelse:\r\n l = n.upper()\r\n\r\nprint(l)\r\n", "# k,n,w=list(map(int,input().split()))\r\ns=input()\r\nupperCount=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n upperCount+=1\r\nlowerCount=len(s)-upperCount\r\nif(lowerCount<upperCount):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n\r\n\r\n \r\n", "def solve():\r\n s = input()\r\n up, down = [i for i in s if 'A' <= i <= 'Z'], [i for i in s if 'a' <= i <= 'z']\r\n print(s.lower() if len(up) <= len(down) else s.upper())\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "word = input()\r\nu_n = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n u_n += 1\r\nif len(word)//2 < u_n:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "#59A\r\ns=input()\r\nlc,uc=0,0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].upper():\r\n uc+=1\r\n else:\r\n lc+=1\r\nif lc>=uc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "slovo = input()\r\nmal = \"qwertyuiopasdfghjklzxcvbnm\"\r\nbol = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nm = 0\r\nb = 0\r\nfor i in slovo:\r\n if i in mal:\r\n m += 1\r\n else:\r\n b += 1\r\nif m >= b:\r\n print(slovo.lower())\r\nelse:\r\n print(slovo.upper())\r\n", "st = input()\r\nupc = 0\r\nloc = 0\r\nfor i in st:\r\n if i.islower():\r\n loc += 1\r\n else:\r\n upc += 1\r\n\r\nif loc < upc:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "word = input()\r\nnoOfUppercase,noOfLowercase =0,0\r\n\r\n# print(ord(\"a\")) #97\r\n# print(ord(\"z\")) #122\r\n# print(ord(\"A\")) #65\r\n# print(ord(\"Z\")) #90\r\n\r\nfor i in word:\r\n if ord(i)>=65 and ord(i)<=90:\r\n noOfUppercase +=1\r\n else:\r\n noOfLowercase +=1\r\n\r\nif noOfUppercase > noOfLowercase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "def word(n):\r\n lst = [i for i in n]\r\n lowerCase = 0\r\n upperCase = 0\r\n lst1 = []\r\n for i in lst:\r\n if 97 <= ord(i) <= 122:\r\n lowerCase += 1\r\n elif 65 <= ord(i) <= 90:\r\n upperCase += 1\r\n if upperCase > lowerCase:\r\n for i in lst:\r\n if 97 <= ord(i) <= 122:\r\n lst1.append(chr(ord(i) - 32))\r\n else:\r\n lst1.append(i)\r\n else:\r\n return n.casefold()\r\n return \"\".join([str(i) for i in lst1])\r\n\r\nif __name__ == \"__main__\":\r\n n = str(input())\r\n res = word(n)\r\n print(res)", "s = input()\r\nd={\"uppercase\":0, \"lowercase\":0 }\r\nfor i in s:\r\n if i.isupper():\r\n d[\"uppercase\"]+=1\r\n if i.islower():\r\n d[\"lowercase\"]+=1\r\n\r\n\r\nif(d[\"uppercase\"]>d[\"lowercase\"]):\r\n print(s.upper())\r\n\r\nelse:\r\n print(s.lower())", "s=input()\nc=0\nd=0\nn=len(s)\nfor i in range(n):\n if s[i]==s[i].lower():\n c+=1;\n else:\n d+=1;\nif c>=d:\n s=s.lower()\n print(s)\nelse:\n s=s.upper()\n print(s)\n\t \t \t \t\t \t\t \t \t \t \t\t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 16 10:55:50 2023\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\ns=input()\r\ncount1=0\r\ncount2=0\r\n'''\r\ncount1=sum(1 for i in s if i.islower())\r\ncount2=sum(1 for i in s if i.isupper())\r\n'''\r\nfor i in s:\r\n if i.islower():\r\n count1+=1\r\n else:\r\n count2+=1\r\n \r\nif count1<count2:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\n \r\nprint (s)", "\ns = input()\n\n\nupper_count = sum(1 for c in s if c.isupper())\nlower_count = sum(1 for c in s if c.islower())\n\n\nif upper_count > lower_count:\n s = s.upper()\nelse:\n s = s.lower()\n\nprint(s)\n\n \t\t\t \t\t\t \t\t\t \t \t \t \t\t\t \t \t", "a = input();\r\nprint([a.lower(),a.upper()][sum(p<'[' for p in a)*2>len(a)])", "s=input()\r\nc=sum(1 for i in s if i.isupper())\r\nk=len(s)-c\r\nif c>k:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nl = 0\r\nfor x in s:\r\n l += x.islower()\r\nif l >= len(s) / 2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "n=input()\r\nc=0\r\nu=0\r\nfor i in n:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n c+=1\r\nif u>c:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = input()\ncount_up = 0\ncount_low = 0\n\nfor char in s:\n if char.isupper():\n count_up += 1\n else:\n count_low += 1\n\nif count_up > count_low:\n new_string = s.upper()\nelse:\n new_string = s.lower()\n\nprint(new_string)\n\t \t\t\t \t \t \t \t\t \t\t\t \t \t \t\t", "s = input()\r\nx = 0\r\ny = 0\r\nfor i in s:\r\n if i.islower():\r\n x += 1\r\n if i.isupper():\r\n y += 1\r\nif x >= y:\r\n print(s.lower())\r\nif y > x:\r\n print(s.upper())", "a=input()\r\nlow='abcdefghijklmnopqrstuvwxyz'\r\nx=0#小写字母个数\r\ny=0#大写字母个数\r\nfor i in a:\r\n if i in list(low):\r\n x=x+1\r\n else:\r\n y=y+1\r\nif x>=y:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "n = input()\r\nsum, count = 0, 0\r\nfor i in n:\r\n if i.islower():\r\n sum += 1\r\n elif i.isupper():\r\n count += 1\r\nif sum >= count:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "L = ['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\nl = ['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\n\r\ns = input()\r\nL1 = []\r\nfor i in range(len(s)):\r\n L1.append(s[i])\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(L1)):\r\n if L1[i] in L:\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif lower >= upper:\r\n for i in range(len(L1)):\r\n if L1[i] in l:\r\n pass\r\n else:\r\n L1[i] = l[L.index(L1[i])]\r\nelse:\r\n for i in range(len(L1)):\r\n if L1[i] in L:\r\n pass\r\n else:\r\n L1[i] = L[l.index(L1[i])]\r\n\r\nS = ''\r\nfor i in range(len(L1)):\r\n S += L1[i]\r\nprint(S)", "# Lê a palavra\nword = input()\n\n# Conta o número de letras maiúsculas e minúsculas na palavra\nupper_count = sum(1 for char in word if char.isupper())\nlower_count = len(word) - upper_count\n\n# Verifica se a palavra deve ser convertida para maiúsculas ou minúsculas\nif upper_count > lower_count:\n print(word.upper())\nelse:\n print(word.lower())\n\n\t \t \t \t \t \t\t\t\t\t\t \t\t \t \t", "s= input()\r\nk=0\r\nfor i in s:\r\n if i.upper()== i:\r\n k+=1\r\n\r\nif k> len(s)//2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "w=input()\r\ns=list(w)\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif l>=u:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n", "s = input()\ncount=0\nfor i in s:\n if(i.isupper()):\n count = count+1\nif(count>len(s)//2):\n print(s.upper())\nelse:\n print(s.lower())\n\t\t\t\t\t \t \t \t \t \t \t \t", "a = input()\r\ncounter = 0\r\nfor i in a:\r\n if i.isupper():\r\n counter += 1\r\nlen_word = int(len(a))\r\nletters = len_word - counter\r\nif letters == counter:\r\n print(a.lower())\r\nelif letters < counter:\r\n print(a.upper())\r\nelif letters > counter:\r\n print(a.lower())", "s = input()\r\nupper = sum(1 for elem in s if elem.isupper())\r\nlower = sum(1 for elem in s if elem.islower()) \r\n\r\nif(upper>lower):\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "string = input()\r\nn = 0\r\nfor i in range(len(string)) :\r\n char = string[i]\r\n if char.isupper() :\r\n n = n+1\r\n else :\r\n continue\r\nif n > len(string)//2 :\r\n print(string.upper())\r\nelse :\r\n print(string.lower())", "st=input()\r\nx=0\r\ny=0\r\nfor i in st:\r\n if(i.isupper()):\r\n x=x+1\r\n else:\r\n y=y+1\r\nif(x<=y):\r\n print(st.lower())\r\nelse:\r\n print(st.upper())\r\n ", "n = input()\r\nx = list(n)\r\n\r\nupperCount = 0\r\nlowerCount = 0\r\n\r\nfor i in x:\r\n if i.isupper():\r\n upperCount+=1\r\n elif i.islower():\r\n lowerCount+=1\r\n\r\nif upperCount>lowerCount:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "word = input() \r\nUP, low =0,0\r\nfor i in range (len(word)): \r\n if(ord(word[i]) > 96 ):\r\n low +=1\r\n else:\r\n UP +=1\r\nif(UP > low ):\r\n print(word.upper())\r\nelse: \r\n print(word.lower())", "n = input()\r\n\r\nu = sum(1 for l in n if l.isupper())\r\nl = len(n) - u\r\n\r\nif u > l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n\r\n", "word = input()\r\n\r\nl_counter = 0\r\nu_counter = 0\r\n\r\nfor i in word :\r\n if i.islower() :\r\n l_counter += 1\r\n else :\r\n u_counter += 1\r\n\r\nresult = \"\"\r\n\r\nif l_counter >= u_counter :\r\n result = word.lower()\r\nelse :\r\n result = word.upper()\r\n\r\nprint(result)", "s = input() \r\nu_count = 0\r\nfor c in s:\r\n if c.isupper():\r\n u_count += 1\r\nl_count = len(s) - u_count\r\nif u_count > l_count:\r\n word = s.upper()\r\nelse:\r\n word = s.lower()\r\nprint(word)\r\n", "def my_solution(word):\r\n l_count = len([letter for letter in list(word) if letter == letter.lower()])\r\n u_count = len([letter for letter in list(word) if letter == letter.upper()])\r\n print(word.upper() if u_count > l_count else word.lower())\r\n\r\nword = input()\r\nmy_solution(word)", "word = input()\r\ncap_count = 0\r\nsmal_count = 0\r\nfor i in word:\r\n if ord(i)>=97:\r\n smal_count+=1\r\n elif ord(i)<97:\r\n cap_count+=1\r\n\r\nif smal_count>cap_count:\r\n print(word.lower())\r\n\r\nelif smal_count<cap_count:\r\n print(word.upper())\r\n\r\nelif smal_count==cap_count:\r\n print(word.lower())\r\n\r\n", "import string\r\ntemp = list(string.ascii_uppercase)\r\ns = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] in temp:\r\n count += 1\r\nif (len(s) - count) >= count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\ncap=0\r\nsmall=0\r\nfor i in s:\r\n if(i>=\"a\" and i<=\"z\"):\r\n small+=1\r\n elif(i>=\"A\" and i<=\"Z\"):\r\n cap+=1\r\nif(small>=cap):\r\n t=s.lower()\r\n print(t)\r\nelif(small<cap):\r\n t=s.upper()\r\n print(t)", "x=(input());v=list(x);u,l=0,0\r\nfor i in v :\r\n if i.isupper():\r\n u+=1\r\n elif i.islower():\r\n l+=1\r\nprint(x.lower() if l>=u else x.upper())\r\n", "# --- Algorithm --- #\ndef function(s):\n lowercase_count = 0\n\n for l in s:\n if l.islower():\n lowercase_count += 1\n \n if lowercase_count >= len(s) - lowercase_count:\n return \"\".join(s).lower()\n else:\n return \"\".join(s).upper()\n\n\n\n# --- Run --- #\nparsed_input = list(input())\nans = function(parsed_input)\nprint(ans)", "s = input()\nlowerCount = sum(map(str.islower,s))\nupperCount = sum(map(str.isupper,s))\nif upperCount>lowerCount:\n print(s.upper())\nelse:\n print(s.lower()) ", "s=input()\r\nw=[s.lower(),s.upper()]\r\nm=[0,0]#number of lower and upper words\r\nfor i in range(len(s)):\r\n if s[i] == w[0][i]:\r\n m[0] +=1\r\n \r\n else:\r\n s[i] == w[0][i]\r\n m[1] +=1\r\n \r\nif m[0]>m[1] or m[0]==m[1]:\r\n print(w[0])\r\nelse:\r\n print(w[1])\r\n ", "d=input()\r\nu=0\r\nl=0\r\nfor char in d:\r\n if char.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(d.upper())\r\nelse:\r\n print(d.lower())", "n=input()\r\nu,d=0,0\r\nfor i in range(0,len(n)):\r\n if (n[i].islower()==True):\r\n d+=1\r\n else:\r\n u+=1\r\nif (u>d):\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n) ", "string = input()\ncountUpper = countLower = 0\nfor i in range(len(string)):\n if string[i] != string[i].upper():\n countLower += 1\n else:\n countUpper += 1\nif countLower >= countUpper:\n print(string.lower())\nelse:\n print(string.upper())", "# \r\n# Competitive programming: Word\r\n# https://codeforces.com/problemset/problem/59/A\r\n# \r\n\r\n# inputs, logic, output\r\n\r\ns = list(input())\r\ncountUpper = 0\r\ncountLower = 0\r\n\r\nfor letter in s:\r\n if letter.isupper():\r\n countUpper += 1\r\n else:\r\n countLower += 1\r\n \r\nlistToStr = ''.join(map(str,s))\r\n\r\nif countUpper > countLower:\r\n print(listToStr.upper())\r\nelse:\r\n print(listToStr.lower())\r\n", "word = input()\r\nup = 0\r\nlow = 0\r\nfor c in word:\r\n if c.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif up > low :\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)", "s = input()\r\nlow = 0\r\nup = 0\r\nfor i in s:\r\n if ord(i) <= 90 :\r\n up += 1\r\n else:\r\n low += 1\r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=input().rstrip()\r\nl,u=0,0\r\nfor w in word:\r\n if w==w.lower(): l+=1\r\n else: u+=1\r\nif l>=u: print(word.lower())\r\nelse: print(word.upper())", "def count_ual(s):\r\n uc = 0\r\n lc = 0\r\n for i in s:\r\n if(i.isupper()):\r\n uc+=1\r\n elif(i.islower()):\r\n lc+=1\r\n if(uc>lc):\r\n s = s.upper()\r\n else:\r\n s = s.lower()\r\n return s\r\n\r\ns = input()\r\nprint(count_ual(s))", "word=input()\r\ncount=0\r\nfor letter in word: \r\n if str.isupper(letter):\r\n count+=1\r\n else:\r\n count-=1\r\nif count>0:\r\n print(str.upper(word))\r\nelse:\r\n print(str.lower(word))", "s=input() # \"eSraA\"\nu=0\nl=0\nfor i in s:\n if i.islower() == True:\n l += 1\n else:\n u += 1\nif l >= u :\n print(s.lower())\nelse:\n print(s.upper())\n\t\t\t \t \t \t\t \t\t \t\t \t\t \t", "string=input(\"\")\r\ncount1=0\r\ncount2=0\r\nfor i in string:\r\n if(i.islower()):\r\n count1=count1+1\r\n elif(i.isupper()):\r\n count2=count2+1\r\nif(count1>count2):\r\n y=string.lower()\r\nelif(count1==count2):\r\n y=string.lower()\r\nelse:\r\n y=string.upper()\r\nprint(y)\r\n", "s=input()\r\nll=0\r\nul=0\r\nif(len(s)>=1 and len(s)<=100):\r\n for i in s:\r\n if(i.islower()):\r\n ll+=1\r\n else:\r\n ul+=1\r\n if(ll>=ul):\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n ", "s=str(input())\r\nu=0\r\nl=0\r\n\r\nfor i in range(0,len(s)):\r\n temp=str()\r\n temp=temp+s[i]\r\n if(temp.isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "word = input()\r\nu_n = 0\r\nfor i in range(len(word)):\r\n if 65 <= ord(word[i]) <= 90:\r\n u_n += 1\r\nif len(word)//2 < u_n:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "a = input()\r\nbig = []\r\nsmall = []\r\nfor i in a:\r\n k = i.isupper()\r\n if k == True:\r\n big.append(k)\r\n else:\r\n small.append(k)\r\nif len(big)>len(small):\r\n print(a.upper())\r\nelif len(big)<len(small):\r\n print(a.lower())\r\nelse:\r\n print(a.lower())\r\n", "s=input()\r\ncount_l=0\r\ncount_u=0\r\nfor c in s:\r\n if c>='a' and c<='z':\r\n count_l+=1\r\n else:\r\n count_u+=1\r\nif(count_l>=count_u):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "s = input()\r\nlowerLen = 0\r\nupperLen = 0\r\nfor i in range(0, len(s)):\r\n if((ord(s[i])>=65) & (ord(s[i])<=90)):\r\n upperLen+=1\r\n elif(ord(s[i]) >= 97 & ord(s[i]) <= 122):\r\n lowerLen += 1\r\nif (upperLen <= lowerLen):\r\n s = s.lower();\r\nelse:\r\n s = s.upper();\r\nprint(s)", "s = input()\r\nlower_c = 0\r\nupper_c = 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].lower():\r\n lower_c += 1\r\n else:\r\n upper_c += 1\r\nif upper_c > lower_c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "k=input()\na=list(k)\nu,l=0,0\nfor i in a:\n if i.isupper():\n u+=1 \n else:\n l+=1 \nif u>l:\n print(k.upper())\nelif l>=u:\n print(k.lower())\n \t \t\t \t \t \t\t\t\t\t\t\t\t\t \t \t\t\t", "s=list(input())\r\nlow=up=0\r\nfor x in s:\r\n if x.islower()==True:\r\n low+=1\r\n if x.isupper()==True:\r\n up+=1\r\nst=''.join(str(x) for x in s)\r\nif up>low:\r\n print(st.upper())\r\nif up<=low:\r\n print(st.lower())", "s = input()\r\nl = u = 0\r\nfor x in s:\r\n if x >= \"a\":\r\n l += 1\r\n else:\r\n u += 1\r\nprint(s.upper() if u > l else s.lower())\r\n", "import re\r\n\r\ns = input()\r\nupper = len(re.findall(r'[A-Z]',s))\r\n\r\nif upper > len(s) / 2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)", "string = input()\r\ncountUpper = 0\r\ncountLower = 0\r\nfor i in range(len(string)):\r\n if string[i].isupper():\r\n countUpper += 1\r\n else:\r\n countLower += 1\r\n# print(countLower, countUpper)\r\nnewString = \"\"\r\nif countLower >= countUpper:\r\n for i in range(len(string)):\r\n if string[i].isupper():\r\n newString += string[i].lower()\r\n else:\r\n newString += string[i]\r\n\r\n\r\n\r\nelif countLower < countUpper:\r\n for i in range(len(string)):\r\n if string[i].islower():\r\n newString += string[i].upper()\r\n else:\r\n newString += string[i]\r\nprint(newString)", "s = input()\r\nc = sum(1 for x in s if x.isupper())\r\nif c > len(s) / 2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "x = input()\r\ny = list(x)\r\ncheck = 0\r\nfor i in y:\r\n if i == i.lower():\r\n check += 1\r\nif check < (len(y) / 2):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n\r\n\r\n", "a=input()\r\nCount=0\r\ncount=0\r\nfor i in a:\r\n if i>='A' and i<='Z':\r\n Count+=1\r\n if i>='a' and i<='z':\r\n count+=1\r\nif count>=Count:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "def manipulate_word(word):\n capital = 0\n small = 0\n\n for char in word:\n if char.isupper():\n capital += 1\n else:\n small += 1\n\n if capital > small:\n return word.upper()\n else:\n return word.lower()\n\n\nif __name__ == \"__main__\":\n word = str(input())\n\n result = manipulate_word(word)\n print(result)\n", "def main():\r\n word = input()\r\n litle = len(list(filter(lambda x: x in range(97, 123), map(ord, word))))\r\n if litle==0 or (len(word)-1)//litle>1:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "word = input()\r\n\r\nuc = 0\r\nfor c in word:\r\n if c.isupper():\r\n uc += 1\r\n\r\nif uc > len(word) // 2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower()) ", "s = input()\r\nup,low= 0, 0\r\nfor i in s:\r\n\tif i >= 'A' and i<= 'Z':\r\n\t\tup += 1\r\n\telif i >='a' and i <= 'z':\r\n\t\tlow += 1\r\nif(up>low):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "c=input(\"\")\r\nu,l,s=0,0,0\r\nfor i in range(len(c)):\r\n if(c[i].isupper()):\r\n u+=1\r\n elif(c[i].islower()):\r\n l+=1\r\n else:\r\n s+=1\r\nif(u>l):\r\n print(c.upper())\r\nelse:\r\n print(c.lower())\r\n ", "word = input()\r\nc_lower = 0\r\nc_upper = 0\r\nfor ltr in word:\r\n if 'a' <= ltr <= 'z':\r\n c_lower += 1\r\n elif 'A' <= ltr <= 'Z':\r\n c_upper += 1\r\nif c_lower >= c_upper:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)", "a = input()\r\nlow = 0\r\ndown = 0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n low += 1\r\n else:\r\n down += 1\r\nif down > low:\r\n a = a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a)", "n = str(input())\r\nl = 0\r\nu = 0\r\nfor i in n:\r\n if i.islower():\r\n l =l + 1\r\n else:\r\n u = u + 1\r\n\r\nif l >= u:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n\r\n\r\n \r\n \r\n\r\n", "string = input()\r\nupper, lower = 0, 0\r\nfor char in string:\r\n if char.isupper(): upper += 1\r\n else: lower += 1\r\n\r\n\r\nif upper <= lower: print(string.lower())\r\nelse: print(string.upper())\r\n", "string = input()\r\n\r\nlower = string.lower()\r\n\r\nupper = string.upper()\r\n\r\n\r\n\r\nlower_amount = 0\r\nupper_amount = 0\r\n\r\n\r\nfor i in range(len(string)):\r\n\r\n if lower[i] == string[i]:\r\n lower_amount += 1\r\n\r\n\r\n if upper[i] == string[i]:\r\n upper_amount += 1\r\n\r\n\r\n\r\nif lower_amount >= upper_amount:\r\n print(lower)\r\n\r\nelse:\r\n print(upper)\r\n", "s=str(input())\r\nu,l=0,0\r\nfor i in s:\r\n\tif (i>='a' and i<='z'):\r\n\t\tl+=1\r\n\telif (i>='A' and i<='Z'):\r\n\t\tu+=1\r\nif u>(len(s)/2):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "word=input()\r\ncount=0\r\nfor i in word:\r\n if i.islower():\r\n count+=1\r\n elif i.isupper():\r\n count-=1\r\n\r\nif count>0:\r\n print(word.lower())\r\nelif count<0:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s= input()\r\nsum_upper=0\r\nfor c in s:\r\n if c.isupper():\r\n sum_upper+=1\r\nsum_lower= len(s)-sum_upper\r\nif sum_upper>sum_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "import re\r\nstring = input()\r\nlow = re.findall(r'[a-z]',string)\r\nup = re.findall(r'[A-Z]',string)\r\nif len(up) > len(low):\r\n string = string.upper()\r\n print(string)\r\nelse:\r\n string = string.lower()\r\n print(string)", "s=input()\r\nk=k1=0\r\nfor i in range(len(s)):\r\n if s[i].isupper()==True:\r\n k1=k1+1\r\n else:\r\n k=k+1\r\nif k1>k:\r\n print(s.upper())\r\nelif k>=k1:\r\n print(s.lower())", "s = input()\r\nu =0\r\nfor l in s:\r\n if l.isupper()==True:\r\n u+=1\r\nif u>(len(s)-u):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\nlower,upper = 0,0\r\nfor let in word:\r\n if let.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif lower>upper or lower == upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "a=input()\r\nb=0\r\nc=0\r\nfor i in range(len(a)):\r\n if 96<ord(a[i])<123:\r\n b=b+1\r\n if 64<ord(a[i])<91:\r\n c=c+1\r\nif b>=c:\r\n A=[]\r\n for i in range(len(a)):\r\n if 96<ord(a[i])<123: \r\n A.append(a[i])\r\n if 64<ord(a[i])<91:\r\n d=ord(a[i])\r\n A.append(str(chr(d+32)))\r\nif c>b:\r\n A=[]\r\n for i in range(len(a)):\r\n if 64<ord(a[i])<91:\r\n A.append(a[i])\r\n if 96<ord(a[i])<123:\r\n d=ord(a[i])\r\n A.append(str(chr(d-32)))\r\n \r\ns='' \r\nfor i in A:\r\n s=s+i\r\nprint(s)\r\n \r\n \r\n", "s=input()\r\nc_l=0\r\nc_h=0\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n c_l+=1\r\n else:\r\n c_h+=1\r\nif c_l>=c_h:\r\n for i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n print(chr(ord(i)+32),end=\"\")\r\n else:\r\n print(i,end=\"\")\r\nelse :\r\n for i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n print(chr(ord(i)-32),end=\"\")\r\n else:\r\n print(i,end=\"\")", "a=0;b=0\r\nstr1=input()\r\nfor i in range(len(str1)):\r\n if str1[i]==str1[i].upper():\r\n b+=1\r\n else:\r\n a+=1\r\nif a>=b:\r\n print(str1.lower())\r\nelse:\r\n print(str1.upper())", "s=input()\r\nc=0;c1=0\r\nfor index in range(len(s)):\r\n if s[index].islower():\r\n c+=1\r\nprint(s.lower()) if c>=len(s)-c else print(s.upper())\r\n", "word=input()\r\nL=list(word)\r\ndef count(L):\r\n ucount,lcount=0,0\r\n for i in L:\r\n if i.isupper():\r\n ucount+=1\r\n else:\r\n lcount+=1\r\n return lcount>=ucount\r\nif count(L):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\ncount = 0\r\nfor ch in s:\r\n if ch >= 'a':\r\n count += 1\r\n else:\r\n count -= 1\r\nif count >= 0:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "lower=0\r\nupper=0\r\nstring =str(input())\r\nfor i in string:\r\n if(i.isupper()==True):\r\n upper+=1\r\n elif(i.islower()==True):\r\n lower+=1\r\nif(lower>=upper):\r\n print(string.lower())\r\nelif(upper>lower):\r\n print(string.upper())\r\n ", "slovo=input()\r\nupper_count=0\r\nlower_count=0\r\nfor ii in slovo:\r\n if ord(ii) in range(ord('A'),ord('Z')+1): upper_count+=1\r\n else: lower_count+=1\r\nif upper_count>lower_count: print(slovo.upper())\r\nelse: print(slovo.lower())\r\n", "str = input()\r\nlow = 0\r\nupper=0\r\nfor i in str:\r\n if i.islower():\r\n low+=1\r\n else:\r\n upper+=1\r\n \r\nif low >upper:\r\n print(str.lower())\r\nelif low == upper:\r\n print(str.lower())\r\n\r\nelse:\r\n print(str.upper())\r\n", "def controlador(palabra):\r\n mayus=0\r\n mini=0\r\n for n in palabra:\r\n if n.isupper():\r\n mayus+=1\r\n else:\r\n mini+=1\r\n if mayus>mini:\r\n return palabra.upper()\r\n return palabra.lower()\r\n\r\ndef main():\r\n palabra=input()\r\n print(controlador(palabra))\r\nmain()", "def main() :\r\n print(converted_Word(input_Word()))\r\n\r\n\r\n\r\ndef converted_Word(word) :\r\n if uppercase_Count(word) > lowercase_Count(word) : return word.upper()\r\n return word.lower()\r\n\r\n\r\ndef uppercase_Count(word) :\r\n return len(filter_Uppercase(word))\r\n\r\ndef filter_Uppercase(word) :\r\n return \"\".join(filter(is_Uppercase, word))\r\n\r\ndef is_Uppercase(char) :\r\n return ord(\"A\") <= ord(char) <= ord(\"Z\")\r\n\r\n\r\ndef lowercase_Count(word) :\r\n return len(filter_Lowercase(word))\r\n\r\ndef filter_Lowercase(word) :\r\n return \"\".join(filter(is_Lowercase, word))\r\n\r\ndef is_Lowercase(char) :\r\n return ord(\"a\") <= ord(char) <= ord(\"z\")\r\n\r\n\r\n\r\ndef input_Word() :\r\n return input()\r\n\r\n\r\n\r\nmain()", "\r\ndef Count(str):\r\n upper, lower, number, special = 0, 0, 0, 0\r\n for i in range(len(str)):\r\n if str[i].isupper():\r\n upper += 1\r\n elif str[i].islower():\r\n lower += 1\r\n elif str[i].isdigit():\r\n number += 1\r\n else:\r\n special += 1\r\n return (upper, lower)\r\n\r\n\r\nword = input()\r\nup, low = Count(word)\r\nif up > low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "def equivalent(letter: str) -> int:\r\n return 1 if letter.isupper() else -1\r\n\r\n\r\nword: str = input()\r\nprint(word.upper() if sum(map(equivalent, word)) > 0 else word.lower())\r\n", "word = str(input())\r\nupper = \"\"\r\nlower = \"\"\r\nfor i in word:\r\n if i.isupper():\r\n upper += i\r\n elif i.islower():\r\n lower += i\r\nif len(upper)> len(lower):\r\n print(word.upper())\r\nelif len(lower)>len(upper):\r\n print(word.lower())\r\nelif len(lower) == len(upper):\r\n print(word.lower())", "U = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nL = U.lower()\r\n\r\ns = input()\r\n\r\nuc = sum(c in U for c in s)\r\nlc = sum(c in L for c in s)\r\n\r\nif uc <= lc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "S = input()\r\nc = 0\r\nW = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in S:\r\n if i in W:\r\n c+=1\r\n continue\r\nA = len(S) - c\r\nif c==A:\r\n S = S.lower()\r\n print(S)\r\nelif c < A:\r\n S = S.upper()\r\n print(S)\r\nelse:\r\n print(S.lower())", "str1=input()\r\nstr2=\"\"\r\nupcnt=0\r\nlwcnt=0\r\nfor i in str1:\r\n if i.islower():\r\n lwcnt+=1\r\n else:\r\n upcnt+=1\r\nif upcnt==lwcnt:\r\n str2+=str1.lower()\r\nelif upcnt>lwcnt:\r\n str2+=str1.upper()\r\nelse:\r\n str2+=str1.lower()\r\nprint(str2)\r\n", "a=input()\r\ncount=len(a)\r\ncounter=0\r\nfor i in a:\r\n if(i.isupper()):\r\n counter+=1\r\nif(count-counter>counter):\r\n print(a.lower())\r\nelif(count-counter<counter):\r\n print(a.upper())\r\nelif(count-counter==counter):\r\n print(a.lower())", "string = str(input())\r\nup = 0\r\nlo = 0\r\nfor i in string:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n lo += 1\r\nif up > lo:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "x=input()\r\n\r\n\r\na='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nb='abcdefghijklmnopqrstuvwxyz'\r\n\r\nm=0\r\nn=0\r\nfor i in x:\r\n if i in a:\r\n m+=1\r\n if i in b:\r\n n+=1\r\n \r\nif m>n:\r\n print(x.upper())\r\nelif m<n:\r\n print(x.lower())\r\nelse:\r\n print(x.lower())\r\n", "t=input()\r\nn=len(t)\r\ncount=0\r\nfor i in t:\r\n if \"A\"<=i<=\"Z\":\r\n count+=1\r\nif count<=n/2:\r\n k=t.lower()\r\nelse:\r\n k=t.upper()\r\nprint(k)", "s = input()\r\n\r\ncount = 0\r\nfor i in s:\r\n if i.isupper():\r\n count += 1\r\nif count <= len(s)/2:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)\r\n \r\n\r\n", "a=list(map(str,input()))\r\nb=len(a)\r\nc = [char for char in a if char.isupper()]\r\nd=b-len(c)\r\nif len(c)>d:\r\n\r\n new_lst=(''.join(a))\r\n e=new_lst.upper()\r\n print(e)\r\nelse:\r\n new_lst=(''.join(a))\r\n e=new_lst.lower()\r\n print(e)\r\n", "a=input()\r\nc,d=0,0\r\nfor i in a:\r\n if(i.islower()):\r\n c+=1\r\n else:\r\n d+=1\r\nif(c>=d):\r\n print(a.lower())\r\nelse:\r\n print(a.upper()) \r\n", "a = input()\r\nb = 0\r\nc = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i].lower() == a[i]:\r\n b +=1\r\n else:\r\n c +=1\r\n\r\nif b >= c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s = input()\r\nbig = 0\r\nlow = 0\r\nfor i in s:\r\n if str(i).isupper():\r\n big = big + 1\r\n else:\r\n low = low + 1\r\nif big < low:\r\n print(s.lower())\r\nelif big == low:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nupper = 0\r\nlower = 0\r\nfor i in s:\r\n\tif i.isupper():\r\n\t\tupper+=1\r\n\telif i.islower():\r\n\t\tlower+=1\r\n\r\nif upper>lower:\r\n\ts=s.upper()\r\n\r\nelse:\r\n\ts=s.lower()\r\n\r\nprint(s)", "x=input()\r\ncount=count1=0\r\nfor i in range(len(x)):\r\n if(x[i].islower()):\r\n count+=1\r\n else:\r\n count1+=1\r\n \r\n\r\nif(count>count1):\r\n print(x.lower())\r\nif(count1>count):\r\n print(x.upper())\r\nif(count==count1):\r\n print(x.lower())", "n = input()\r\nlowerLetters = 0\r\nupperLetters = 0\r\n\r\nfor i in range(len(n)):\r\n if n[i].islower():\r\n lowerLetters += 1\r\n else:\r\n upperLetters += 1\r\nif upperLetters > lowerLetters:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s=input()\r\nlow=0\r\nup=0\r\nfor i in s:\r\n if i.islower():\r\n low+=1\r\n elif i.isupper():\r\n up+=1\r\n \r\nif(low<up):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\nn_big, n_small = 0, 0\r\nfor c in word:\r\n if c.islower():\r\n n_small += 1\r\n else:\r\n n_big += 1\r\nif n_big > n_small:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nlowerLetters = [c for c in s if c.islower()]\r\nupperLetters = [c for c in s if c.isupper()]\r\nprint(s.lower() if len(lowerLetters) >= len(upperLetters) else s.upper())\r\n", "s=input()\r\nup=0\r\nlow=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n low+=1 \r\n else:\r\n up+=1 \r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=str(input())\r\nupp=0\r\nlow=0\r\nS=\"\"\r\nfor i in range(len(s)): \r\n ascii = ord(s[i])\r\n if ascii>=ord('A') and ascii<= ord('Z'):\r\n upp=upp+1\r\n else:\r\n low=low+1\r\nif upp>low :\r\n for i in range(0,len(s)): \r\n ascii = ord(s[i])\r\n if ascii>=ord('a') and ascii<= ord('z'):\r\n S+=chr(ascii-32) \r\n else:\r\n S+=s[i] \r\nelif upp<=low:\r\n \r\n for i in range(0,len(s)): \r\n ascii = ord(s[i])\r\n if ascii>=ord('A') and ascii<= ord('Z'):\r\n S+=chr(ascii+32) \r\n else:\r\n S+=s[i] \r\nprint(S)\r\n ", "s=input()\r\ncl=0\r\ncu=0\r\nfor i in s:\r\n if(i.islower()):\r\n cl=cl+1\r\n else :\r\n cu = cu +1\r\nif (cl==cu or cl>cu):\r\n print(s.lower())\r\nelse :\r\n print(s.upper())", "s=input()\r\ni=j=0\r\nfor t in s:\r\n if t.islower():\r\n i+=1\r\n else:\r\n j+=1\r\nif i>=j:\r\n print(s.casefold())\r\nelse:\r\n print(s.upper())", "#Word\r\nstring = str(input())\r\nres1 = 0\r\nres2 = 0\r\nfor c in string:\r\n if(c.isupper()):\r\n res1 += 1\r\n elif(c.islower()):\r\n res2 += 1\r\nif(res1 > res2):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "word=input()\r\ndef fun(word):\r\n upcount=0\r\n lcount=0\r\n for i in word:\r\n if(i.isupper()):\r\n upcount+=1\r\n else:\r\n lcount+=1\r\n if(upcount>lcount):\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\nfun(word)", "a=input()\r\nl=0\r\nu=0\r\nfor i in a:\r\n if i==i.upper():\r\n u+=1\r\n elif i!=i.upper():\r\n l+=1\r\nif u>l:\r\n for i in a:\r\n print(i.upper(),end='')\r\nelif l>u:\r\n for i in a:\r\n print(i.lower(),end='')\r\nelse:\r\n for i in a:\r\n print(i.lower(),end='')\r\n", "mylist=['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\nmystring=input()\r\ncount=0\r\nfor i in mystring:\r\n if i in mylist:\r\n count=count+1\r\n else:\r\n pass\r\nif count>len(mystring)-count:\r\n print(mystring.upper())\r\nelse:\r\n print(mystring.lower())", "def solution(S):\n up_l = 0\n lw_l = 0\n\n for i in S:\n if i.isupper():\n up_l += 1\n elif i.islower():\n lw_l += 1\n \n if up_l > lw_l:\n return S.upper()\n else:\n return S.lower()\n\ndef main():\n S = str(input())\n print(solution(S))\n\nmain()\n ", "str = list(input())\r\nbig = 0\r\nlit = 0\r\nfor i in str:\r\n if i.isupper() == True:\r\n big = big+1\r\n else:\r\n lit = lit+1\r\nif big > lit:\r\n str = ''.join(str).upper()\r\nelif big < lit:\r\n str = ''.join(str).lower()\r\nelse:\r\n str = ''.join(str).lower()\r\nprint(str)", "cU=0\r\ncL=0\r\nw=input()\r\nwList=list(w)\r\nfor i in wList:\r\n if i.isupper()==True:\r\n cU=cU+1\r\n else:\r\n cL=cL+1\r\nif cL>=cU:\r\n w=w.lower()\r\nelse:\r\n w=w.upper()\r\nprint(w)", "small = 0\r\nbig = 0\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i].isupper() :\r\n big += 1\r\n if s[i].islower():\r\n small += 1\r\n\r\nif small < big:\r\n print(s.upper())\r\nif small >= big:\r\n print(s.lower())", "q = 'qwertyuiopasdfghjklzxcvbnm'\r\nf= \"QWERTYUIOPASDFGHJKLZXCVBNHM\"\r\nn=input()\r\ns = 0\r\ns1 = 0\r\nfor i in n:\r\n if i in q:\r\n s += 1\r\n elif i in f:\r\n s1+=1\r\nif s>=s1:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "word = input()\r\nn = len(word)\r\nmylist = [x for x in word]\r\nc=0\r\nl=0\r\nu=0\r\n\r\n\r\nfor i in range(0,n):\r\n term = mylist[c]\r\n if term.islower():\r\n l += 1\r\n c += 1\r\n else:\r\n u += 1\r\n c += 1\r\n \r\n \r\n \r\nif l >= u:\r\n word = word.lower()\r\n \r\nelse:\r\n word = word.upper()\r\n\r\n\r\n \r\nprint(word)", "def change_letter_case(word):\r\n u_count = sum(1 for c in word if c.isupper())\r\n l_count = len(word) - u_count\r\n\r\n if u_count > l_count:\r\n \r\n return word.upper()\r\n else:\r\n \r\n return word.lower()\r\n \r\ninput_word = input()\r\n\r\nresult = change_letter_case(input_word)\r\n\r\nprint(result)\r\n", "x= input()\nc=0\ns=0\n\nfor i in x:\n if i.isupper():\n\n c += 1\n elif i.islower():\n s += 1\nif c > s:\n print(x.upper())\nelif c<=s:\n print(x.lower())#bashtola cambrian er opposite notun bazar age .over bridge par hobo american ambassy pash diye vtore #\n", "def main():\n word = input()\n lcount, n = 0, len(word)\n for c in word:\n if c.islower():\n lcount += 1\n if lcount >= n / 2:\n ans = word.lower()\n else:\n ans = word.upper()\n print(ans)\n\n\nmain()\n", "n = input()\nprint(n.lower() if len(\"\".join(i for i in n if i.isupper())) <= len(n)//2 else n.upper())\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed May 27 18:59:33 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\ns = input()\r\ncopy = s \r\n# we aim to count the ascii codes of strings in a-z and A-Z ranges.\r\nl = list(copy)\r\ncount = 0\r\nfor i in range(len(l)):\r\n l[i] = ord(l[i])\r\n if 96< l[i] < 123:\r\n count += 1\r\n elif 64 < l[i] < 91:\r\n count-= 1\r\nif count >= 0:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "s = input()\r\nmaj = 0\r\nfor i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90 :\r\n maj +=1\r\nif maj > len(s)/2:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n", "def main():\n name = input()\n\n count = 0\n for i in name:\n if i.isupper():\n count = count + 1\n\n if count > (len(name) // 2):\n name = name.upper()\n else:\n name = name.lower()\n \n print(name)\n\nif __name__ == \"__main__\":\n main()\n", "a = input()\r\nlow = 0\r\nup = 0\r\nfor i in range(len(a)):\r\n if ord(a[i])>96:\r\n low +=1\r\n else:\r\n up+=1\r\nif low>up or low == up:\r\n a=a.lower()\r\nif up>low:\r\n a = a.upper()\r\nprint(a)\r\n", "def solve2(s):\r\n i,l=0,0\r\n for e in s:\r\n if e.upper()==e:i=i+1\r\n l=len(s)-i\r\n if l>=i:return(s.lower())\r\n else :return(s.upper())\r\ns=str(input())\r\nprint(solve2(s))", "string = input()\r\nlower = sum([int(i.islower()) for i in string])\r\nupper = sum([int(i.isupper()) for i in string])\r\n\r\nif lower >= upper:\r\n answ = string.lower()\r\nelse:\r\n answ = string.upper()\r\n\r\nprint(answ)", "n = input()\r\np = \"\"\r\nq = \"\"\r\nfor i in n:\r\n if (i != i.upper()):\r\n p = p+i\r\n else:\r\n q = q+i\r\n\r\nif (len(p) < len(q)):\r\n n = n.upper()\r\nelse:\r\n n = n.lower()\r\n\r\nprint(n)\r\n\r\n", "word = input()\r\nup = 0\r\nlw = 0\r\nfor x in word:\r\n if x >= 'A' and x <= \"Z\":\r\n up += 1\r\n else:\r\n lw += 1\r\nprint(word.lower() if up <= lw else word.upper())\r\n\r\n", "str=input()\r\na=list(str)\r\nlccount=uccount=0\r\nempty=\"\"\r\nfor i in range(len(a)):\r\n if(a[i].isupper()):\r\n uccount+=1\r\n if(a[i].islower()):\r\n lccount+=1\r\n\r\nif(uccount>lccount):\r\n for i in range(len(a)):\r\n a[i]=a[i].upper()\r\nelse:\r\n for i in range(len(a)):\r\n a[i]=a[i].lower()\r\n\r\nfor i in range(len(a)):\r\n empty+=a[i]\r\nprint(empty)\r\n", "s = input()\nn = 0\nfor c in list(s):\n if c>'Z': n+=1\nprint(n<len(s)/2 and s.upper() or s.lower())\n", "s = input()\n\n\nmayusculasContar = sum(1 for letter in s if letter.isupper())\nminusculasContar = len(s) - mayusculasContar\n\n# Convertir la palabra a mayúsculas o minúsculas según la cantidad\nif mayusculasContar>minusculasContar :\n palabraCorrecta= s.upper()\nelse:\n palabraCorrecta = s.lower()\n\nprint(palabraCorrecta)\n\n \t \t\t \t\t \t\t \t \t\t \t\t", "w = input()\r\nct=0\r\nfor l in w:\r\n if l==l.upper():\r\n ct+=1\r\nif ct>len(w)//2:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "import sys, collections\r\n\r\nline = sys.stdin.readline().strip()\r\n\r\ncounter = collections.Counter()\r\n\r\nfor char in line:\r\n if char.isupper():\r\n counter[\"upper\"] += 1\r\n elif char.islower():\r\n counter[\"lower\"] += 1\r\n\r\nif counter[\"upper\"] > counter[\"lower\"]:\r\n print(line.upper())\r\nelse:\r\n print(line.lower())", "# from curses.ascii import islower, isupper\n\nx=input()\ny=list(x)\nups=0\nls=0\nfor i in y:\n if i.isupper():\n ups+=1\n if i.islower():\n ls+=1\nif(ups>ls):\n print(x.upper())\nelse:\n print(x.lower())\n \t \t \t\t\t \t \t \t\t \t\t\t \t\t", "s=input()\r\nl=len(s)\r\nu,p=0,0\r\nfor i in s:\r\n\tif (i>='a' and i<=\"z\"):\r\n\t\tp+=1\r\n\tif (i>='A' and i<=\"Z\"):\r\n\t\tu+=1\r\nif u==p:\r\n\ts=s.lower()\r\nelif u>p:\r\n\ts=s.upper()\r\nelse:\r\n\ts=s.lower()\r\nprint(s)", "a=input()\r\nt=0\r\nfor _ in a:\r\n\tif ord(_)>=65 and ord(_)<=90:\r\n\t\tt=t+1\r\n\telse:\r\n\t\tt=t-1\r\nif t>0:\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "word= input()\r\nlcount=0\r\nucount=0\r\nfor i in word:\r\n if i.islower():\r\n lcount+=1\r\n else:\r\n ucount+=1\r\nif lcount>=ucount:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "n=input()\r\nuc=lc=0\r\nfor i in n:\r\n if i.isupper():\r\n uc=uc+1\r\n else:\r\n lc=lc+1\r\nif uc>lc:\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n) ", "def main():\n\tupper = []\n\tlower = []\n\tword = str(input())\n\n\tfor i in word:\n\t\tif not(i.isalnum):\n\t\t\tcontinue\n\t\telif i.isupper():\n\t\t\tupper.append(i)\n\t\telif i.islower():\n\t\t\tlower.append(i)\n\n\tif len(lower) >= len(upper):\n\t\treturn word.lower()\n\telse:\n\t\treturn word.upper()\n\t\t\nprint(main())\n\t\t \t\t \t \t \t \t\t\t \t \t \t \t", "a= str(input(\"\"))\r\nb=0\r\nc=0\r\nfor i in a:\r\n if (i==(i.upper())):\r\n b=b+1\r\n else:\r\n c=c+1\r\nif (b<=c):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s = input()\r\ncountA = 0\r\ncounta = 0\r\nfor i in range(len(s)):\r\n if s[i] >= 'A' and s[i] <= 'Z':\r\n countA = countA + 1\r\n elif s[i] >= 'a' and s[i] <= 'z':\r\n counta = counta + 1\r\n#print(countA)\r\n#print(counta)\r\nif countA > counta:\r\n print(s.upper())\r\n\r\nelif countA <= counta:\r\n# s.lower()\r\n print(s.lower()) ", "s=input()\r\nn=0\r\nfor i in s:\r\n if ord(i)<97:\r\n n+=1\r\nif len(s)-n<n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "w = input()\r\nu = sum(1 for i in w if i.isupper())\r\n\r\nif(2*u>len(w)):\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "word = input()\r\nu, l = 0, 0\r\nfor i in range(0,len(word)):\r\n if word[i]==word[i].upper():\r\n u+=1\r\n else :\r\n l+=1\r\nif u>l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower()) \r\n", "l_a = set('abcdefghijklmnopqrstuvwxyz')\r\nu_a = set('ABCDEFGHIJKLMNOPQRSTUVWXYZ')\r\nl_n, u_n = 0, 0\r\ns = input()\r\nfor ch in s:\r\n if ch in l_a:\r\n l_n += 1\r\n else:\r\n u_n += 1\r\n\r\nif l_n >= u_n:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import math\nimport sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\nfrom collections import Counter\n# from itertools import pairwise\n\nstring = input()\nupper = []\nlower = []\nfor letter in string:\n if letter.isupper():\n upper.append(letter)\n else:\n lower.append(letter)\nif len(upper)>len(lower):\n print(string.upper())\nelif len(lower)>len(upper):\n print(string.lower())\nelse:\n print(string.lower())\n", "def is_lower(c: str)->bool:\n return ord(c) >= 97 and ord(c) <= 122\ndef is_upper(c: str)-> bool:\n return ord(c) >= 65 and ord(c) <= 90\ndef to_lower(c: str)->str:\n c_int = ord(c)\n if is_upper(c):\n return chr((c_int - 65) + 97)\n return c\ndef to_upper(c: str)->str:\n c_int = ord(c)\n if is_lower(c):\n return chr((c_int - 97) + 65)\n return c\ndef count_lower_chars(s: str) -> int:\n count = 0\n for c in s:\n if is_lower(c):\n count += 1\n return count\n\ns = input()\nnew_str = \"\"\nlowers = count_lower_chars(s)\nfor c in s:\n if (lowers >= len(s)/2):\n new_str+= to_lower(c)\n else:\n new_str += to_upper(c)\nprint(new_str)\n", "string = input()\r\nupper_count = 0\r\nlower_count = 0\r\n\r\nfor i in range(len(string)):\r\n if ord(string[i]) < 97 :\r\n upper_count += 1\r\n else :\r\n lower_count += 1 \r\n\r\nif upper_count > lower_count :\r\n print(string.upper())\r\nelse :\r\n print(string.lower())\r\n", "s=input()\r\nq=w=0\r\nfor c in s:\r\n if c.islower():\r\n q+=1\r\n else:\r\n w+=1\r\nif w<=q:\r\n print (s.lower())\r\nelse:\r\n print (s.upper())", "n=input()\r\nc=0\r\nfor i in n:\r\n if i.isupper():\r\n c+=1\r\nif c>len(n)-c:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "n = input()\r\na,b = 0,0\r\nfor i in n:\r\n if i.isupper():a+=1\r\n else:b+=1\r\nprint(n.lower() if b>=a else n.upper())", "l=input()\r\nu=0\r\ns=0\r\nfor i in l:\r\n if i.upper()==i:\r\n u+=1\r\n else:\r\n s+=1\r\nif u>s:\r\n print(l.upper())\r\nelse:\r\n print(l.lower())", "s = input()\r\nnu, nl = 0,0\r\nfor d in s:\r\n if d.islower():\r\n nl+=1\r\n else:\r\n nu+=1\r\nif nu>nl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n", "s=input()\r\ncount=0\r\ncount1=0\r\nfor i in s:\r\n if(i.isupper()):\r\n count=count+1\r\n else:\r\n count1=count1+1\r\nif(count<=count1):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=input()\r\nc=0\r\nfor i in a:\r\n if i.isupper()==True:\r\n c+=1\r\nif c>(len(a))-c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n \r\n", "a = input('')\r\nvelke = 0\r\nmajhne = 0\r\nfor i in a:\r\n if i.isupper():\r\n velke += 1\r\n else:\r\n majhne += 1\r\nif majhne >= velke:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s = input()\r\nlower, upper = 0, 0\r\n\r\nfor letter in s:\r\n if letter.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nl = len(s)\r\n\r\ncount = 0\r\n\r\nfor _ in s:\r\n if _ >= 'A' and _ <= 'Z':\r\n count = count + 1\r\n\r\n\r\nif count > (l/2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "x = input()\r\n\r\nu , l =0,0\r\n\r\nfor i in list(x):\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n\r\n\r\nif u>l:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s1 =input()\r\nupper_case_letters=0\r\nfor ch in s1:\r\n if ch.isupper():\r\n upper_case_letters+=1\r\nif upper_case_letters>len(s1)//2:\r\n print(s1.upper())\r\n\r\nelse:\r\n print(s1.lower())\r\n\r\n\r\n\r\n\r\n# numOfColumns= int(input())\r\n# l=sorted(map(int,input().split()))\r\n# print(\" \".join(map(str,l)))\r\n\r\n\r\n#----------------------------------------------\r\n# matrix=[]\r\n# for i in range(5):\r\n# matrix.append(input().split())\r\n\r\n# r=0\r\n# c=0\r\n# for row in matrix:\r\n# for integer in row:\r\n# if integer==\"1\":\r\n# r=matrix.index(row)+1\r\n# c= row.index(integer)+1\r\n# break\r\n# if r !=0:\r\n# break\r\n# print(abs(3-r)+abs(3-c))\r\n\r\n#---------------------------------------------------\r\n# n= int(input())\r\n# answer=0\r\n# for i in range(n): \r\n# if input().split().count(\"1\")>=2:\r\n# answer+=1\r\n# print(answer)\r\n\r\n\r\n\r\n#--------------------------------------------\r\n# l,b= map(int,input().split())\r\n# years =0\r\n# while l<=b:\r\n# l=l*3\r\n# b=b*2\r\n# years+=1\r\n# print(years)\r\n\r\n\r\n#==========================================================================\r\n\r\n# n= int(input())\r\n# s= input()\r\n# if n%2==0 and s.count('A') == n//2:\r\n# print(\"Friendship\")\r\n# elif s.count('A')>n/2:\r\n# print(\"Anton\")\r\n# else:\r\n# print(\"Danik\")\r\n\r\n#-----------------------------------------------------------------------------------------\r\n# w=0\r\n# fh = int(input().split()[-1])\r\n# personsH = input().split()\r\n# for p in personsH:\r\n# if int(p)>fh:\r\n# w+=2\r\n# else:\r\n# w+=1\r\n# print(w)", "s = input()\r\nlength = len(s)\r\nl = list(s)\r\nuppercase = 0\r\nlowercase = 0\r\nfor i in range(length):\r\n if l[i].islower():\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\nif uppercase > lowercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "data = input()\nsize = len(data)\nnumber_of_lower_char = 0\nfor i in range(size):\n if data[i].islower():\n number_of_lower_char += 1\nif number_of_lower_char >= size - number_of_lower_char:\n print(data.lower())\nelse:\n print(data.upper())", "\"\"\"https://codeforces.com/problemset/problem/59/A\"\"\"\r\n\r\ns = input()\r\n\r\nl = 0\r\nu = 0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nc = [0, 0]\r\nfor i in s:\r\n c[ord(i) // 91] += 1\r\ns = \"\".join(s)\r\nans = s.upper() if c[0] > c[1] else s.lower()\r\nprint(ans)", "string = input()\r\nlim = int(len(string) / 2)\r\nup = sum([1 for x in string if x.isupper()])\r\n\r\nprint(string.upper() if up>lim else string.lower())", "n=input()\r\nl=0\r\nu=0\r\nfor i in range(len(n)):\r\n if n[i].islower():\r\n l+=1\r\n elif n[i].isupper():\r\n u+=1\r\nif l==u:\r\n print(n.lower())\r\nelif l>u:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "n = input()\r\ncount_upper_case = 0\r\ncount_lower_case = 0\r\nfor i in n:\r\n if i.isupper():\r\n count_upper_case += 1\r\n else:\r\n count_lower_case += 1\r\nif count_upper_case == count_lower_case:\r\n print(n.lower())\r\nelse:\r\n if count_upper_case > count_lower_case:\r\n print(n.upper())\r\n else:\r\n print(n.lower())", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\ninp = [x for x in insr() if x != ' ']\r\nu = sum([1 for x in inp if x.isupper()])\r\nl = sum([1 for x in inp if not x.isupper()])\r\nprint(''.join([x.upper() for x in inp]) if u > l else ''.join([x.lower() for x in inp]))\r\n", "word = input()\r\n\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor i in range(len(word)):\r\n if word[i] == word[i].lower():\r\n lowercase += 1\r\n elif word[i] == word[i].upper():\r\n uppercase += 1\r\n\r\nif lowercase >= uppercase:\r\n print(word.lower())\r\nelif uppercase > lowercase:\r\n print(word.upper())", "s = input()\r\nlowers = s.lower()\r\nuppers = s.upper()\r\ndif1 = 0\r\ndif2 = 0\r\nfor i in range(len(s)):\r\n if s[i]!=lowers[i]:\r\n dif1+=1\r\nfor i in range(len(s)):\r\n if s[i]!=uppers[i]:\r\n dif2+=1\r\nif dif1<=dif2:\r\n print(lowers)\r\nelse:\r\n print(uppers)", "word = input()\r\nlower_counter = 0\r\nupper_counter = 0\r\nfor i in word:\r\n if 'a' <= i <= 'z':\r\n lower_counter +=1\r\n elif 'A' <=i <= 'Z':\r\n upper_counter +=1\r\nif upper_counter > lower_counter:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n count1 += 1\r\n else:\r\n count2 += 1\r\ns = list(map(str, s))\r\nfor i in range(len(s)):\r\n if count1 >= count2:\r\n s[i] = s[i].lower()\r\n elif count1 < count2:\r\n s[i] = s[i].upper()\r\nprint(''.join(s))", "str=input()\r\nu=0\r\nl=0\r\nfor i in str:\r\n if i.isupper():\r\n u+=1\r\n if i.islower():\r\n l+=1\r\nif u==l:\r\n print(str.lower())\r\nelif u>l:\r\n print(str.upper())\r\nelif u<l:\r\n print(str.lower())", "s=input()\r\nl=0\r\nu=0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].lower():\r\n l=l+1\r\n else:\r\n u=u+1\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "\r\nif __name__ == \"__main__\":\r\n str = input()\r\n lower = sum([1 for c in str if c.islower()])\r\n upper = sum([1 for c in str if c.isupper()])\r\n #print(lower, upper)\r\n\r\n if upper > lower:\r\n print(str.upper())\r\n else:\r\n print(str.lower())\r\n\r\n", "a = input()\r\nlow = 0;\r\nhigh = 0;\r\nfor i in a:\r\n if(i.islower()):\r\n low = low +1\r\n else:\r\n high = high+1\r\n\r\nif(low >= high):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "t=input()\r\nr=0\r\nn=0\r\nfor i in range(len(t)):\r\n if(t[i].isupper()):\r\n r=r+1 \r\n else:\r\n n=n+1 \r\nif(r>n):\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "s=input()\r\nup=0\r\nlo=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n up+=1\r\n else:\r\n lo+=1\r\nif up>lo:\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)", "\"\"\" 59A - Word \"\"\"\r\ntry:\r\n s = input()\r\n caps = 0\r\n for i in s:\r\n if ord(i) <= 90:\r\n caps += 1\r\n ans = s.upper() if caps > len(s) // 2 else s.lower()\r\n print('{}'.format(ans))\r\nexcept EOFError as e:\r\n pass", "n = input()\r\ncup, clo = 0, 0\r\nfor i in range(len(n)):\r\n if n[i].isupper() == True:\r\n cup += 1\r\n else:\r\n clo += 1\r\nif cup > clo:\r\n n = n.upper()\r\nelse:\r\n n = n.lower()\r\nprint(n)", "S= str(input())\r\ncount = 0 \r\nfor i in S:\r\n if i.isupper():\r\n count +=1\r\n\r\nif (count > len(S)/2):\r\n S=S.upper()\r\nelse :\r\n S=S.lower()\r\nprint(S)\r\n", "a=input()\r\nupper_count=0\r\nlower_count=0\r\nfor i in a:\r\n if i.upper()==i:\r\n upper_count+=1 \r\n else:\r\n lower_count+=1\r\nif upper_count>lower_count:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word=input().strip()\r\ncount_low=0\r\ncount_upper=0\r\nfor i in word:\r\n if ord(i)>=97:\r\n count_low+=1\r\n else:\r\n count_upper+=1\r\n\r\nif count_upper > count_low:\r\n y=word.upper()\r\nelse:\r\n y=word.lower()\r\nprint(y)\r\n\r\n", "l=input()\nx=l.upper()\ny=l.lower()\nc=[0,0]\nfor i in range(len(l)):\n if(l[i]!=x[i]):\n c[0]=c[0]+1\n if(l[i]!=y[i]):\n c[1]=c[1]+1\nif(c[0]>=c[1]):\n print(y)\nelse:\n print(x)", "n=input()\r\nk=0\r\nc=0\r\nfor i in n:\r\n if i>='A' and i<='Z':\r\n k+=1\r\n elif i>='a' and i<='z':\r\n c+=1\r\nif k>c:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n \r\n \r\n \r\n ", "s=input()\n\nu=s.upper()\nl=s.lower()\nc=0\nfor i in range(len(s)):\n if(s[i]!=l[i]):\n c+=1\nif(c<=len(s)/2):\n print(l)\nelse:\n print(u)\n", "s=input()\r\nif len(s)>=1 and len(s)<=100:\r\n u=0\r\n l=0\r\n for i in range(len(s)):\r\n if s[i].isupper():\r\n u+=1\r\n elif s[i].islower():\r\n l+=1\r\n if u==l or l>u:\r\n s=s.lower()\r\n print(s)\r\n elif l<u:\r\n s=s.upper()\r\n print(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", "s = input()\r\nli2 = []\r\nli3 = []\r\nfor str in s:\r\n\tif str.isupper() == True:\r\n\t\tli2.append(str)\r\n\tif str.islower() == True:\r\n\t\tli3.append(str)\r\nif len(li2) > len(li3):\r\n\tprint(s.upper())\r\nif len(li2) <= len(li3):\r\n\tprint(s.lower())", "lowers = 'abcdefghijklmnopqrstuvwxyz'\r\nl = 0\r\nn = input()\r\nfor k in n:\r\n if k in lowers:\r\n l+=1\r\nif l>=len(n)-l:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s=input()\r\ncount_upper=0\r\ncount_lower=0\r\nfor i in s:\r\n if i>=\"A\" and i<=\"Z\":\r\n count_upper+=1\r\n else:\r\n count_lower+=1\r\nif count_upper<=count_lower:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\ncont = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n cont += 1\r\n\r\nif cont > len(word)/2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "word = input()\r\nlowercase_count = sum(1 for char in word if char.islower())\r\nuppercase_count = len(word) - lowercase_count\r\nif lowercase_count >= uppercase_count:\r\n corrected_word = word.lower()\r\nelse:\r\n corrected_word = word.upper()\r\nprint(corrected_word) ", "word = input()\r\nlow_count = 0\r\nup_count = 0\r\nfor letter in word :\r\n if letter == letter.upper():\r\n up_count += 1\r\n else :\r\n low_count += 1\r\nif low_count >= up_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "def main():\r\n text = input()\r\n text_list = list(text)\r\n upper_count = 0\r\n lower_count = 0\r\n for letter in text_list:\r\n if ord(letter) >= 65 and ord(letter) <= 90:\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n text = text.upper() if upper_count > lower_count else text.lower()\r\n print(text)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "l_list = []\r\nu_list = []\r\ns = input()\r\nfor i in s:\r\n if i.islower() == True:\r\n l_list.append(i)\r\n else:\r\n u_list.append(i)\r\nif len(l_list) < len(u_list):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\n\r\nkk = 0\r\nka = 0\r\nfor i in a:\r\n if i.islower():\r\n kk += 1\r\n elif i.isupper():\r\n ka += 1\r\n\r\n\r\nif kk < ka:\r\n a = a.upper()\r\nelif kk > ka:\r\n a = a.lower()\r\nelse:\r\n a = a.lower()\r\nprint(a)\r\n", "s = input()\r\ncountlower =0\r\ncountupper = 0\r\nfor i in s:\r\n if i.islower():\r\n countlower+=1\r\n else:\r\n countupper+=1\r\nif countlower >= countupper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import re\r\nmessage = input()\r\nregex = re.compile('[^a-zA-Z]')\r\nmessage = regex.sub('', message)\r\n#print(message) regex.sub('', message) fasakh ay haja differente de [^a-zA-Z]\r\nnbupper = sum(1 for c in message if c.isupper())\r\nnblower = sum(1 for c in message if c.islower())\r\n#print(nbupper)\r\n#print(nblower)\r\nif (nbupper>nblower):\r\n print(message.upper())\r\nelse:\r\n print(message.lower())\r\n", "count1=0\r\ncount2=0\r\nstring = input()\r\nfor i in range(len(string)):\r\n if string[i].isupper():\r\n count1+=1\r\n elif string[i].islower():\r\n count2+=1\r\nif count1>count2:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "word=input()\r\nlow,up=0,0\r\nfor l in word:\r\n if ord('a')<=ord(l) and ord(l)<=ord('z'):\r\n low+=1\r\n else:\r\n up+=1\r\nif low>=up:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s=input()\r\nc=0\r\nfor i in s:\r\n if i.islower():\r\n c+=1\r\nt=len(s)\r\nif 2*c>=t:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "n = input()\r\nnl = n.lower()\r\nnc = n.upper()\r\n\r\ncountl = 0\r\ncountc = 0\r\n\r\nfor i in n :\r\n if i in nl:\r\n countl+=1\r\n elif i in nc:\r\n countc+=1\r\nif countl>countc:\r\n print(nl)\r\nelif countl<countc:\r\n print(nc)\r\nelse:\r\n print(nl)", "s = input()\nletters = list(s)\nupper = []\nlower = []\n\nfor i in letters:\n\tif i.isupper():\n\t\tupper.append(i)\n\telse:\n\t\tlower.append(i)\n\t\t\nif len(upper) > len(lower):\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n\t\t \t\t \t \t\t\t \t \t \t\t\t\t\t\t", "s=input()\r\nk=0\r\nk1=0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].upper():\r\n k+=1\r\n else:\r\n k1+=1\r\nif k>k1:\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)\r\n", "a= input()\r\nupper=lower=0\r\nfor char in a:\r\n if char.isupper():\r\n upper+=1\r\n elif char.islower():\r\n lower+=1 \r\nif upper <= lower:\r\n m=a.lower()\r\nelse:\r\n m=a.upper()\r\nprint(m) ", "word = input ()\r\nlower = upper = 0\r\nfor char in word:\r\n if char.islower ():\r\n lower += 1\r\n else:\r\n upper += 1\r\nif lower < upper:\r\n print (word.upper ())\r\nelse:\r\n print (word.lower ())", "s = input()\r\nupperCaseCount = 0 # 65 - 90\r\nlowerCaseCount = 0 # 97 - 122\r\nfor i in s:\r\n if (ord(i) >= 65 and ord(i) <= 90):\r\n upperCaseCount += 1\r\n elif (ord(i) >= 97 and ord(i) <= 122):\r\n lowerCaseCount += 1\r\nif (upperCaseCount > lowerCaseCount):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a=input()\r\nb=0\r\nc=0\r\nfor i in range(len(a)):\r\n if(a[i].isupper()==True):\r\n b+=1\r\n elif(a[i].islower()==True):\r\n c+=1\r\nif(c>=b):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n \r\n ", "s=input()\r\ncu,cl=0,0\r\nfor x in s:\r\n if x.isupper():\r\n cu+=1\r\n else:\r\n cl+=1\r\nif cu>cl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = str(input())\r\ncount_of_uppers = 0\r\ncount_of_lowers = 0\r\nuppers = [l for l in s if l.isupper()]\r\n\r\nlowers = [l for l in s if l.islower()]\r\n\r\nfor _ in uppers:\r\n count_of_uppers += 1\r\nfor _ in lowers:\r\n count_of_lowers += 1\r\n\r\n\r\nif count_of_uppers > count_of_lowers:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "'''\r\nimport math\r\n\r\ndef BearAndBigBrother():\r\n a, b = map(int, input().split(' '))\r\n year = 0\r\n while 1:\r\n if a > b:\r\n break\r\n else:\r\n a *= 3\r\n b *= 2\r\n year += 1\r\n print(year)\r\n return None\r\n\r\ndef Tram():\r\n n = int(input())\r\n p = [0]\r\n for i in range(1, n+1):\r\n a, b = map(int, input().split())\r\n tmp = p[i-1]\r\n tmp -= a\r\n tmp += b\r\n p.append(tmp)\r\n print(max(p))\r\n return None\r\n\r\n\r\ndef WrongSubtraction():\r\n n ,k = map(int, input().split())\r\n for i in range(k):\r\n if n % 10 == 0:\r\n n = n // 10\r\n else:\r\n n -= 1\r\n print(n)\r\n return None\r\n\r\n\r\ndef Elephant():\r\n x = int(input())\r\n i = steps = 0\r\n tmp = [j for j in range(1, 6) if x // j > 0]\r\n stepsize = max(tmp)\r\n while i < x:\r\n steps += (x-i) // stepsize\r\n i += stepsize*steps\r\n tmp2 = [j for j in range(1, stepsize) if (x-i) // j > 0]\r\n try:\r\n stepsize = max(tmp2)\r\n except:\r\n continue\r\n print(steps)\r\n\r\n return None\r\n\r\n\r\ndef QueueAtTheSchool():\r\n n, t = map(int, input().split())\r\n s = input()\r\n Q = [i for i in s]\r\n for i in range(t):\r\n j = 0\r\n while j < len(Q)-1:\r\n if Q[j] == 'B' and Q[j+1] == 'G':\r\n Q[j], Q[j+1] = Q[j+1], Q[j]\r\n j += 2\r\n else:\r\n j += 1\r\n s_f = ''.join(Q)\r\n print(s_f)\r\n\r\n return None\r\n\r\n\r\ndef NearlyLuckyNumber():\r\n n = input()\r\n nl = str(n.count('4') + n.count('7'))\r\n tmp = set([i for i in nl])\r\n if (len(tmp) <= 2) and (('4' in tmp) or ('7' in tmp)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n '''\r\ndef Word():\r\n s = input()\r\n countA = countB = 0\r\n for i in s:\r\n if i.isupper():\r\n countA += 1\r\n else:\r\n countB += 1\r\n if countA > countB:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n \r\n\r\n\r\ndef main():\r\n #BearAndBigBrother()\r\n #Tram()\r\n #WrongSubtraction()\r\n #Elephant()\r\n #QueueAtTheSchool()\r\n #NearlyLuckyNumber()\r\n Word()\r\n\r\nmain()\r\n", "s = input()\r\nlower = 'qwertyuiopasdfghjklzxcvbnm'\r\nuppper = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nlow_ = 0\r\nup_ = 0\r\nfor i in range(len(s)):\r\n for j in range(len(lower)):\r\n if s[i] == lower[j]:\r\n low_+=1\r\n elif s[i] == uppper[j]:\r\n up_+=1\r\nif low_ < up_:\r\n ans = s.upper()\r\nelse:\r\n ans = s.lower()\r\nprint(ans)\r\n \r\n ", "n = list(input())\r\nsn = \"\".join(n)\r\nb = list(filter(lambda x : x in \"QWERTYUIOPASDFGHJKLZXCVBNM\",n))\r\ns = list(filter(lambda x : x not in \"QWERTYUIOPASDFGHJKLZXCVBNM\",n))\r\nif len(s) >= len(b) :\r\n sn = sn.lower()\r\nelse:\r\n sn = sn.upper()\r\nprint(sn)", "'''\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'''\na=input()\ncount=0\nfor i in range(len(a)):\n if a[i].islower():\n count+=1\nif count>=len(a)-count:\n print(a.lower())\nelse:\n print(a.upper())", "a=str(input())\r\nc=d=0\r\nfor i in a:\r\n if(i>='A' and i<='Z'):\r\n c=c+1\r\n if(i>='a' and i<='z'):\r\n d=d+1\r\nif(c==d):\r\n print(a.lower())\r\nelif(c>d):\r\n print(a.upper())\r\nelif(c<d):\r\n print(a.lower())", "word = input()\r\nl_letter = 0\r\nb_letter = 0\r\nfor i in range(len(word)):\r\n if 97 <= ord(word[i]) <= 122:\r\n l_letter += 1\r\n else:\r\n b_letter += 1\r\nif l_letter >= b_letter:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)", "def Count_LU_Chars(s):\r\n\tupC=0;\r\n\tloC=0;\r\n\tfor x in s:\r\n\t\tif (x.islower()):\r\n\t\t\tloC+=1\r\n\t\telse:\r\n\t\t\tupC+=1;\r\n\tif(loC>=upC):\r\n\t\ts=s.lower()\r\n\telse:\r\n\t\ts=s.upper()\r\n\tprint(s)\r\n\t\r\ndef main():\r\n s=str(input())\r\n Count_LU_Chars(s)\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "word = input()\r\nlower = 0\r\nfor letter in word:\r\n if letter.islower():\r\n lower = lower + 1\r\nif lower >= (len(word) - lower):\r\n newword = word.lower()\r\n print(newword)\r\nelse:\r\n newword = word.upper()\r\n print(newword)", "s = input()\r\nupper = sum(1 for c in s if c.isupper())\r\nlower = sum(1 for c in s if c.islower())\r\nif upper > lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nnl=0\r\nnu=0\r\nfor i in s:\r\n if i.isupper():\r\n nu=nu+1\r\n else:\r\n nl=nl+1\r\nif nu>nl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "# Input the word\r\nword = input()\r\n\r\n# Count the number of uppercase and lowercase letters in the word\r\nuppercase_count = sum(1 for char in word if char.isupper())\r\nlowercase_count = len(word) - uppercase_count\r\n\r\n# Determine whether to convert to uppercase or lowercase\r\nif uppercase_count > lowercase_count:\r\n transformed_word = word.upper()\r\nelse:\r\n transformed_word = word.lower()\r\n\r\n# Print the transformed word\r\nprint(transformed_word)\r\n", "a=input()\nl=0\nu=0\nfor i in a:\n if i.isupper():\n u+=1\n else:\n l+=1\nif u>l:\n a=a.upper()\nelse:\n a=a.lower()\nprint(a)\n\t \t \t\t \t \t \t \t\t \t \t \t\t \t\t\t", "text = input()\nupper = 0\nlower = 0\nfor ch in text:\n if ch.isupper():\n upper = upper + 1\n if ch.islower():\n lower = lower + 1\nif upper > lower:\n text = text.upper()\nif lower >= upper:\n text = text.lower()\nprint(text)\nquit()\n \t\t\t \t\t \t \t \t\t \t \t \t", "w = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in w:\r\n if i == i.upper():\r\n upper_count += 1\r\n elif i == i.lower():\r\n lower_count += 1\r\nprint(w.upper() if upper_count > lower_count else w.lower())\r\n", "name=input()\r\nup=0\r\nfor i in name:\r\n if i.isupper():\r\n up+=1\r\n \r\n\r\nif len(name)-up<up:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())", "st=str(input())\r\nuprcnt,lwrcnt=0,0\r\nfor i in st:\r\n if i.isupper():\r\n uprcnt+=1\r\n else:\r\n lwrcnt+=1\r\nif uprcnt>lwrcnt:\r\n st=st.upper()\r\n print(st)\r\nelse:\r\n st=st.lower()\r\n print(st) \r\n", "s_1 = input( );print([s_1.lower(),s_1.upper( )][sum(x<'['for x in s_1)*2>len (s_1)])", "x=input()\r\nu,l=0,0\r\nfor i in x:\r\n if i.islower():\r\n l=l+1\r\n elif i.isupper():\r\n u=u+1\r\nif u==l:\r\n print(x.lower())\r\nelif u>l:\r\n print(x.upper())\r\nelif l>u:\r\n print(x.lower())", "a=input()\r\nu=0\r\nl=0\r\nfor i in range(len(a)):\r\n if a[i]>='A' and a[i]<='Z':\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s = input()\r\n\r\nlow = 0\r\nup = 0\r\nfor i in range(0,len(s)):\r\n if(s[i].islower()):\r\n low = low +1\r\n else:\r\n up = up + 1\r\nif (low > up):\r\n print(s.lower())\r\nelif (low < up):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\ncounter = 0\r\n\r\nfor i in s:\r\n if i.isupper() == True:\r\n counter += 1\r\n\r\nif counter == len(s) // 2:\r\n print(s.lower())\r\nelif counter > len(s) // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "t = input();\r\nu =0;\r\nl = 0;\r\nfor i in range(0,len(t)):\r\n if(t[i].isupper()):\r\n u = u+1;\r\n else:\r\n l = l+1;\r\nif(u > l):\r\n print(t.upper());\r\nelse:\r\n print(t.lower());\r\n", "n = input()\r\ncont=0\r\nfor i in n:\r\n if i.isupper():\r\n cont+=1\r\n\r\nif cont>(len(n)-cont):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "word = input()\r\nif len([c for c in word if c.isupper()]) > len(word) / 2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "#59A\r\nx = input()\r\nj = 0\r\nk = 0\r\nfor i in range(len(x)):\r\n if(x[i].isupper()):\r\n j = j+1\r\n else:\r\n k = k+1\r\nif(j>k):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "if __name__=='__main__':\n\ts = input()\n\tcnt = 0\n\tfor i in s:\n\t\tif i.islower():\n\t\t\tcnt +=1\n\tif cnt*2>=len(s):\n\t\tprint(s.lower())\n\telse:\n\t\tprint(s.upper())", "a = input()\r\nk = 0\r\nfor i in a:\r\n if ord(i) > 91:\r\n k += 1\r\nprint([a.lower(), a.upper()][k < (len(a) / 2)])\r\n", "# A. Word\n# time limit per test2 seconds\n# memory limit per test256 megabytes\n# inputstandard input\n# outputstandard output\n# Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.\n\n# Input\n# The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.\n\n# Output\n# Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.\n\n\ns = input()\nupper, lower = 0, 0\n\nfor char in s:\n if char.islower():\n lower += 1\n else:\n upper += 1\nif upper > lower:\n s = s.upper()\nelse:\n s = s.lower()\n\nprint(s)", "string = str(input())\r\ncount_upper=0\r\ncount_lower=0\r\nfor char in string:\r\n\tif char.isupper():\r\n\t\tcount_upper+=1\r\n\telse:\r\n\t\tcount_lower+=1\r\nif count_upper>count_lower:\r\n\tprint(string.upper())\r\nelif count_lower>count_upper:\r\n\tprint(string.lower())\r\nelse:\r\n\tprint(string.lower())", "s = input()\r\n\r\na=0\r\nb=0\r\n\r\nfor i in s:\r\n if i>='a' and i<='z':\r\n a+=1\r\n else:\r\n b+=1\r\nif a>=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\ncountLower = 0\r\ncountUpper = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n countLower += 1\r\n else:\r\n countUpper += 1\r\nif countLower >= countUpper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "word = input()\r\nl = 0\r\nu = 0\r\nlower = list(map(chr,range(97,123)))\r\nupper = list(map(chr,range(65,91)))\r\nfor i in word:\r\n if i in lower:\r\n l+=1\r\n else:\r\n u+=1\r\nif l>=u:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n ", "import sys\r\ns=list(sys.stdin.readline())[:-1]\r\nupper=0\r\nlower=0\r\n\r\nfor i in s:\r\n if str(i).isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper==lower:\r\n print(\"\".join(s).lower())\r\nelif upper>lower:\r\n print(\"\".join(s).upper())\r\nelse:\r\n print(\"\".join(s).lower())", "word = input()\r\nupper=0\r\nlower=0\r\nfor char in word:\r\n if char.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif(upper>lower):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s =input()\r\nm = s.upper()\r\nn = s.lower()\r\nupper_c = 0\r\nlower_c = 0\r\nfor i in s :\r\n if i in m :\r\n upper_c=upper_c +1\r\n else :\r\n lower_c =lower_c+1\r\nif upper_c>lower_c :\r\n print(m)\r\nelse :\r\n print(n)", "def getInput():\r\n word = input()\r\n lowerCount = 0\r\n upperCount = 0\r\n for i in word:\r\n if(i.isupper()):\r\n upperCount += 1\r\n else:\r\n lowerCount += 1\r\n isUpper = True if upperCount > lowerCount else False\r\n getNewWord(word, isUpper)\r\n\r\ndef getNewWord(word, isUpper):\r\n print(word.upper()) if isUpper else print(word.lower())\r\n\r\nif(__name__ == '__main__'):\r\n getInput()\r\n", "#Codeforce 59A\r\nstr1=input().strip(\"\\n\\r\")\r\nu,l = 0,0\r\nfor i in range(len(str1)):\r\n if str1[i].isupper() == True:\r\n u+=1\r\n else:\r\n l+=1\r\nif u > l:\r\n print(str1.upper())\r\nelse:\r\n print(str1.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 19 12:21:53 2021\r\n\r\n@author: Nikiq\r\n\"\"\"\r\n\r\nn = input()\r\nx = 0\r\nupper = 0\r\nfor i in range (len(n)):\r\n #print(n[x].isupper())\r\n #isupper() returns true or false\r\n if n[x].isupper() == False:\r\n #print(\"0\")\r\n upper += 0\r\n x += 1\r\n else:\r\n #print(\"1\")\r\n upper += 1\r\n x += 1\r\nif upper <= len(n)/2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n ", "A=input()\r\nx=0\r\ny=0\r\n\r\nfor i in A:\r\n if i>='a':\r\n x+=1\r\n else:\r\n y+=1\r\nif y<=x:\r\n print(A.lower())\r\nelse:\r\n print(A.upper())", "s = list(input())\nlower = 0\nupper = 0\n\nfor i in range(len(s)):\n if(s[i].isupper()):\n upper +=1\n elif(s[i].islower()):\n lower += 1\n\nif(upper > lower):\n print(''.join(i for i in s).upper())\nelse:\n print(''.join(i for i in s).lower())\n", "s = input()\r\nlow = \"abcdefghijklmnopqrstuvwxyz\"\r\nhigh = low.swapcase()\r\n#low = list(low)\r\n#high = list(high)\r\nlc = int(0)\r\nhc = int(0)\r\nfor i in range(0,len(s)):\r\n if s[i] in low :\r\n lc = lc + 1\r\n else:\r\n hc = hc + 1\r\nif lc >= hc :\r\n print(s.casefold())\r\nelse:\r\n s = s.casefold()\r\n print(s.swapcase())\r\n \r\n ", "n=input()\r\nI=M=0\r\nfor i in n:\r\n if(i.isupper()==True):\r\n I=I+1\r\n else:\r\n M=M+1\r\nif(I==M):\r\n print(n.lower())\r\nif(I>M):\r\n print(n.upper())\r\nif(I<M):\r\n print(n.lower())", "s = input()\r\na = 0\r\nb = 0\r\nfor i in s:\r\n if i.lower()==i:\r\n a+=1\r\n else:\r\n b+=1\r\nif a>=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=str(input())\r\ncount_lower=0\r\ncount_upper=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n count_lower+=1\r\n elif s[i].isupper():\r\n count_upper+=1\r\nif count_upper>count_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "string = input()\r\n\r\nno_l = len([x for x in string if x.islower()])\r\nno_u = len([x for x in string if x.isupper()])\r\n\r\nif no_l >= no_u:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "n=input()\r\nl=[]\r\nf=[]\r\nfor i in range(97,123):\r\n a=n.count(chr(i))\r\n l.append(a)\r\nfor i in range(65,91):\r\n b=n.count(chr(i))\r\n f.append(b)\r\nif sum(l)>sum(f):\r\n print(n.lower())\r\nelif sum(l)<sum(f):\r\n print(n.upper())\r\nelif sum(l)==sum(f):\r\n print(n.lower())", "s = str(input())\r\na = 0\r\nb = 0\r\n\r\nfor i in range (0, len(s)):\r\n if (s[i] == s[i].upper()):\r\n a = a + 1\r\n else:\r\n b = b + 1\r\n\r\nif (a <= b):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "# A. Word\r\nword = input(\"\")\r\nu = 0\r\nl = 0\r\nfor i in word:\r\n if i.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif l < u:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "\r\nmessage = input()\r\nupper_count = sum(1 for c in message if c.isupper())\r\nlower_count = len(message) - upper_count\r\n\r\nif upper_count == lower_count: \r\n print(message.lower())\r\nelif upper_count < lower_count:\r\n print(message.lower())\r\nelse: \r\n print(message.upper())", "a=input()\r\nb=0\r\nc=0\r\nd=\"\"\r\nfor i in a:\r\n if i.islower() :\r\n b=b+1\r\n elif i.isupper() :\r\n c=c+1\r\nif b>c :\r\n d=a.lower()\r\nelif c>b :\r\n d=a.upper()\r\nelif b==c :\r\n d=a.lower()\r\nprint(d)\r\n", "s=input()\nupperCount=0\nlowerCount=0\nfor i in s:\n\tif i.islower():\n\t\tlowerCount+=1\n\telse:\n\t\tupperCount+=1\nif lowerCount<upperCount:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n\n \t \t \t \t\t\t\t\t \t \t\t\t \t", "str = input()\r\nsum1 = 0\r\nsum2 = 0\r\nfor i in range(len(str)):\r\n if str[i].isupper():\r\n sum1 += 1\r\n else:\r\n sum2 += 1\r\nif sum1 > sum2:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())\r\n\r\n", "n = input()\r\nx = 0\r\nt = 0\r\nfor i in n:\r\n if i.isupper():\r\n x += 1\r\n else:\r\n t += 1\r\nif x > t:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "b=(input(''))\r\na=list(b)\r\np,q=[],[]\r\nfor i in a:\r\n if i.isupper():\r\n p.append(i)\r\n else:\r\n q.append(i)\r\nif len(p)>len(q):\r\n print(b.upper())\r\nelse:\r\n print(b.lower())\r\n", "s1=input()\r\n\r\ncount1=0\r\ncount2=0\r\nfor i in (range(len(s1))):\r\n if s1[i].islower():\r\n count1+=1\r\n else:\r\n count2+=1\r\n\r\nif count1<count2:\r\n print(s1.upper())\r\nelse:\r\n print(s1.lower())\r\n \r\n \r\n ", "word = input()\r\nupper = [i for i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"]\r\nlower = [i for i in \"abcdefghijklmnopqrstuvwxyz\"]\r\n\r\n\r\ncaps = 0\r\nlowers = 0\r\n\r\nfor i in range(0, len(word)):\r\n letter = word[i]\r\n \r\n if letter in upper:\r\n caps += 1\r\n\r\n elif letter in lower:\r\n lowers += 1\r\n\r\n\r\nif (caps > lowers):\r\n print(word.upper())\r\n\r\nelse:\r\n print(word.lower())\r\n \r\n", "string = input()\r\ncount_upper = 0\r\nlength = len(string)\r\nfor i in string:\r\n\tif ord(i) >=65 and ord(i) <=90:\r\n\t\tcount_upper += 1\r\n\r\ncount_lower = length - count_upper\r\n\r\nif count_upper > count_lower:\r\n\tprint(string.upper())\r\nelse:\r\n\tprint(string.lower())\r\n", "string = input()\r\ncaps = 0\r\nsmalls = 0\r\nfor i in string:\r\n if i.isupper():\r\n caps+=1\r\n else:\r\n smalls +=1 \r\nif caps > smalls:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "x=input()\r\na,b=0,0\r\nfor i in x:\r\n if i.lower()==i:\r\n a+=1\r\nif len(x)-a>a:\r\n print(x.upper())\r\nelif len(x)-a<a:\r\n print(x.lower())\r\nelif (len(x)-a)==a:\r\n print(x.lower())", "'''\r\nA. Word\r\ntime limit per test\r\n2 seconds\r\nmemory limit per test\r\n256 megabytes\r\ninput\r\nstandard input\r\noutput\r\nstandard output\r\n\r\nVasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.\r\nInput\r\n\r\nThe first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.\r\nOutput\r\n\r\nPrint the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.\r\n\r\n'''\r\n\r\nword = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor character in word :\r\n if character.isupper() == True :\r\n upper = upper + 1\r\n else :\r\n lower = lower + 1\r\n\r\nif upper > lower :\r\n print(word.upper())\r\nelse :\r\n print(word.lower())\r\n\r\n", "s = input()\r\nn= len(s)\r\nuppercase_count = sum(1 for char in s if char.isupper())\r\nlowercase =(n-uppercase_count)\r\nif uppercase_count > lowercase:\r\n print(s.upper())\r\nif lowercase > uppercase_count:\r\n print(s.lower())\r\nif uppercase_count == lowercase:\r\n print(s.lower())\r\n", "s = input()\r\nups = 0\r\nlows = 0\r\nfor i in s:\r\n if i.islower():\r\n lows = lows + 1\r\n if i.isupper():\r\n ups = ups + 1\r\nif (ups < lows or lows == ups):\r\n print (s.lower())\r\nelse:\r\n print (s.upper())", "s=input()\r\n# s='HoUSee'\r\ndef fn(s):\r\n l=0\r\n u=0\r\n for i in s:\r\n if i.islower():\r\n l+=1\r\n else:\r\n u+=1\r\n if l==u:\r\n return s.lower()\r\n elif l>u:\r\n return s.lower()\r\n else:\r\n return s.upper()\r\nprint(fn(s))", "str1=input()\nu=0\nl=0\nfor i in str1:\n if i.isupper():\n u+=1\n else:\n l+=1\nif u>l:\n str2=str1.upper()\n print(str2)\nelse:\n str2=str1.lower()\n print(str2)", "input_letter = input()\r\nupper_list = []\r\nfor i in input_letter:\r\n if i.isupper():\r\n upper_list.append(i)\r\n\r\nif len(upper_list) > (len(input_letter)/2):\r\n print(input_letter.upper())\r\nelse:\r\n print(input_letter.lower())", "s = input()\r\nuper = 0\r\ndown = 0\r\nfor letter in s:\r\n if letter != letter.upper():\r\n down += 1\r\n else:\r\n uper += 1\r\nif uper > down:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import math\r\nfrom itertools import permutations\r\n\r\n\r\ns = str(input(\"\"))\r\ncounter = 0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].lower():\r\n counter+=1\r\nif counter >= len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "# codeforces.com/problemset/problem/59/A\r\n# (59A) Word \r\n# (17/02/2023) ALBRIT BENDO\r\n\r\nword = str(input())\r\n\r\nlower_case = 0\r\nupper_case = 0\r\n\r\nfor i in word:\r\n if i.islower(): \r\n lower_case+=1\r\n else: \r\n upper_case+=1\r\n\r\nif lower_case > upper_case: \r\n print(word.lower())\r\nelif lower_case < upper_case: \r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s=input()\r\nlow=0\r\nup=0\r\nfor i in range(0,len(s)):\r\n if ord(s[i]) in range(ord('A'),ord('Z')+1):\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nc = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\na = 0\r\nb = 0\r\nfor i in s:\r\n if i in c:\r\n a += 1\r\n else:\r\n b += 1\r\n \r\nif a > b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=input()\r\nupper=0\r\nlower=0\r\nfor i in word:\r\n if i.isupper():\r\n upper+=1\r\n elif i.islower():\r\n lower+=1\r\n\r\nif upper>lower:\r\n new=word.upper()\r\nelif lower>=upper:\r\n new=word.lower()\r\n\r\nprint(new)", "s = str(input())\nc = 0\nfor x in s:\n if x.isupper():\n c += 1\n\nif c > len(s) // 2:\n print(s.upper())\nelse:\n print(s.lower())\n", "i = input()\r\nr = \"\"\r\np = sum(1 for c in i if c.isupper())\r\nj = sum(1 for c in i if c.islower())\r\nif p>j:\r\n r = i.upper()\r\nelse:\r\n r = i.lower()\r\nprint(r)\r\n", "# 59A - Word\r\n\r\nn = input()\r\nda = 0\r\nxiao = 0\r\nfor i in range(len(n)):\r\n if 64 < ord(n[i]) < 91:\r\n da += 1\r\n else:\r\n xiao += 1\r\nif xiao >= da:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "def lowercount(s):\r\n count = 0\r\n for ch in s:\r\n if ch.islower():\r\n count += 1\r\n return count\r\n\r\ndef word(s):\r\n l_count = lowercount(s)\r\n if l_count < (len(s) - l_count):\r\n return s.upper()\r\n return s.lower()\r\n\r\ns = input()\r\nprint(word(s))", "n = input()\nx = 0\nfor i in n:\n x += 1 if ord(i)>= 65 and ord(i)<= 90 else -1\nprint(n.upper() if x>0 else n.lower())\n\t \t\t \t \t\t \t\t\t \t \t \t", "# Problem 59 A - Word\r\n\r\n# input\r\ns = list(input())\r\n\r\n# initialization\r\nupper_count = 0\r\nlower_count = 0\r\n\r\nfor n in s:\r\n if n.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\n# output\r\nif lower_count>=upper_count:\r\n ans = \"\".join(s)\r\n ans = ans.lower()\r\n print(ans)\r\nelse:\r\n ans = \"\".join(s)\r\n ans = ans.upper()\r\n print(ans)\r\n", "s = input()\r\nup = low = 0\r\nres = ''\r\n\r\nfor letter in s:\r\n if letter == letter.upper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif up > low:\r\n for letter in s:\r\n res += letter.upper()\r\nelse:\r\n for letter in s:\r\n res += letter.lower()\r\nprint(res)", "# Write your code here\r\nimport 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().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ns = input().strip()\r\ncountl, countu = 0, 0\r\nfor i in s:\r\n if(i.islower()):\r\n countl += 1\r\n else:\r\n countu += 1\r\n\r\nif(countu > countl):\r\n s = s.upper()\r\nelif(countl >= countu):\r\n s = s.lower()\r\n\r\nprint(s)", "n=input()\r\nm=list(filter(lambda x:x.islower(),n))\r\nlen1=len(m)\r\nlen2=len(n)-len1\r\nif len1>len2:\r\n original=n.lower()\r\nelif len2>len1:\r\n original=n.upper()\r\nelse:\r\n original=n.lower()\r\nprint(original)\r\n", "n = input()\r\nl = 0\r\nu = 0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nif u>l:\r\n print(n.upper())\r\n\r\nelse:\r\n print(n.lower())\r\n", "s=input()\r\nlst=[i for i in s if i.isupper()]\r\nu=len(lst);l=len(s)-u\r\nif l>=u:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "word = input()\r\ncountup = 0\r\ncountlow = 0\r\nfor letter in word:\r\n if(65<=ord(letter)<=90):\r\n countup+=1\r\n elif(97<=ord(letter)<=122):\r\n countlow +=1\r\nif countup>countlow:\r\n print(word.upper())\r\nelif countlow>countup:\r\n print(word.lower())\r\nelif countlow==countup:\r\n print(word.lower())", "s=input()\r\nc=0\r\nd=0\r\nfor i in s:\r\n if(i.isupper()):\r\n c=c+1\r\n else:\r\n d=d+1\r\nif(c>d):\r\n m=s.upper()\r\n print(m)\r\nelif(c<=d):\r\n m=s.lower()\r\n print(m)", "n=input()\r\n\r\nuc=0\r\nfor i in n:\r\n if i.isupper():\r\n uc+=1\r\nif(uc>len(n)-uc):\r\n print(n.upper())\r\nelif(uc<len(n)-uc):\r\n print(n.lower())\r\nelse:\r\n print(n.lower())", "a = input()\r\ni = 0\r\nj = 0\r\nfor x in a:\r\n if (x.islower()):\r\n i = i + 1\r\n if (x.isupper()):\r\n j = j + 1\r\nif i >= j:\r\n print(a.lower())\r\nif j > i:\r\n print(a.upper())", "def correct_word(word):\r\n upper_count = 0\r\n lower_count = 0\r\n\r\n for char in word:\r\n if char.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\n if upper_count > lower_count:\r\n corrected_word = word.upper()\r\n else:\r\n corrected_word = word.lower()\r\n\r\n return corrected_word\r\n\r\n\r\nword = input().strip()\r\ncorrected_word = correct_word(word)\r\nprint(corrected_word)\r\n", "if __name__ == '__main__':\n s = input()\n up = 0\n for c in s:\n if c.isupper():\n up += 1\n else:\n up -= 1\n if up > 0:\n print(s.upper())\n else:\n print(s.lower())\n\n", "s = str(input())\r\nd={\"UPPER_CASE\":0, \"LOWER_CASE\":0}\r\nfor c in s:\r\n if c.isupper():\r\n d[\"UPPER_CASE\"]+=1\r\n elif c.islower():\r\n d[\"LOWER_CASE\"]+=1\r\n else:\r\n pass\r\nl=len(s)\r\nif(d[\"UPPER_CASE\"]>l/2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = str(input())\nlower = 0\nupper = 0\nfor i in a:\n if i.isupper():\n upper += 1\n else:\n lower += 1\nif lower>=upper:\n print(a.lower())\nelse:\n print(a.upper())\n\n \t \t\t \t\t \t \t \t \t \t", "s = str(input())\r\n\r\nupper, lower = [0] * 2\r\n\r\nfor i in s:\r\n if i.upper() == i:\r\n upper += 1\r\n\r\nlower = len(s) - upper\r\n\r\nif upper > lower:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)\r\n", "n = input()\r\nc=0\r\nl=0\r\nfor ele in n:\r\n if ele.isupper():\r\n c+=1\r\n else:\r\n l+=1\r\nif c>l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "string = input()\r\nlst = []\r\nupper = 0\r\nlower = 0\r\nfor i in string :\r\n lst.append(i)\r\nfor j in lst :\r\n if j.isupper() :\r\n upper += 1\r\n elif j.islower() :\r\n lower += 1\r\nif upper > lower :\r\n print(string.upper())\r\nelif lower > upper :\r\n print(string.lower())\r\nelif lower == upper:\r\n print(string.lower())", "s = input()\r\nl = len(s)\r\nc = 0\r\nfor i in s:\r\n if i >= 'A' and i <= 'Z':\r\n c += 1\r\nif c > (l/2):\r\n s1 = s.upper()\r\n print(s1)\r\nelse:\r\n s2 = s.lower()\r\n print(s2)", "a = input()\r\nb = len(a)\r\nc = b/2\r\nl,u = 0,0\r\nfor i in a:\r\n if (i>=\"a\" and i<=\"z\"):\r\n l +=1\r\n if (l>=c):\r\n n = a.lower()\r\n else:\r\n n = a.upper()\r\n\r\nprint(n)\r\n", "s=input()\r\ncup=0\r\nclo=0\r\nif(len(s)<=100):\r\n for i in range(len(s)):\r\n if(s[i]>='a' and s[i]<='z'):\r\n clo+=1\r\n else:\r\n cup+=1\r\n if(clo==cup):\r\n print(s.lower())\r\n elif(clo>cup):\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\nelse:\r\n exit", "s = input()\r\nl=len(s)\r\nx = 0\r\nfor i in s:\r\n\tx += i.isupper()\r\nif((l%2==0 and x>(l//2)) or (l%2==1 and x>=(l//2)+1)):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "def func(str):\r\n lower = 0\r\n for i in str:\r\n if i.islower():\r\n lower+=1\r\n upper = len(str)-lower\r\n if upper<=lower:\r\n return str.lower()\r\n else:\r\n return str.upper()\r\ndef main():\r\n r = input()\r\n print(func(r))\r\nmain()", "s = input()\r\ncountA = countB = 0\r\nfor i in s:\r\n if i.isupper():\r\n countA += 1\r\n else:\r\n countB += 1\r\nif countA > countB:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if(i.isupper()):\r\n c1+=1\r\n else:\r\n c2+=1\r\nif(c2>=c1):\r\n s = s.lower()\r\n print(s)\r\nelse:\r\n print(s.upper())", "# assignment https://codeforces.com/contest/59/problem/A?locale=ru\r\n'''\r\nВходные данные\r\nВ первой строке записано слово s — оно состоит из больших и маленьких латинских букв и имеет длину от 1 до 100.\r\n\r\nВыходные данные\r\nВыведите исправленное слово s. Если в заданном слове s строго больше заглавных букв, приведите его к верхнему регистру, иначе — к нижнему.\r\n'''\r\n\r\ns = input()\r\n\r\ndef n_upper_chars(string):\r\n return sum(1 for c in string if c.isupper())\r\n# print(len(s))\r\n# print(n_lower_chars(s))\r\n# print(len(s)//2)\r\n\r\n\r\nif (2*n_upper_chars(s)>len(s)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\r\nlist = list(string)\r\nlower = 0\r\nupper = 0\r\nfor i in list:\r\n if ord(i) > 96:\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif upper > lower:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "word=input()\r\nup=0\r\nlow=0\r\nfor i in word:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif(up>low):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n ", "word = input()\r\nupper = 0\r\nfor letter in word:\r\n if letter.isupper() == True:\r\n upper += 1\r\nlower = len(word)-upper\r\nif lower >= upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s=input()\r\nupper,lower=0,0\r\nfor j in s:\r\n if j.isupper():\r\n upper = upper + 1\r\n else:\r\n lower = lower + 1\r\nif(upper>lower):\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n line = str(input())\r\n upp = 0\r\n for it in line:\r\n if it.isupper():\r\n upp += 1\r\n if upp > len(line) / 2:\r\n print(line.upper())\r\n else:\r\n print(line.lower())\r\n", "s=input()\r\nu=0;l=0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n elif i.islower():\r\n l+=1\r\nif u>l:\r\n for i in s:\r\n if i.islower():\r\n s=s.replace(i,i.upper())\r\nif u<=l:\r\n for i in s:\r\n if i.isupper():\r\n s=s.replace(i,i.lower())\r\n \r\nprint(s)\r\n", "word = str(input())\r\nbig = 0\r\nlow = 0\r\n\r\n\"\"\"\r\nif word[i].islower():\r\n low += 1\r\n else:\r\n big += 1\r\n\"\"\"\r\n\r\nfor i in range(len(word)):\r\n if word[i] == word[i].lower():\r\n low += 1\r\n else:\r\n big += 1 \r\nif big == low:\r\n word = word.lower()\r\nelif big > low:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "# # n, h = input().split()\r\n# # n = int(n)\r\n# # h = int(h)\r\n# # arr = list(map(int,input().split()))\r\n# def main():\r\n# \tfrom sys import stdin, stdout\r\n\r\n# \tinp = [int(x) for x in stdin.read().split()]\r\n\r\n# \tn = inp.pop(0)\r\n# \tk = inp.pop(0)\r\n\r\n# \tk_th = inp[k-1]\r\n# \tcnt = 0\r\n\r\n# \tfor x in inp:\r\n# \t\tif x and x >= k_th:\r\n# \t\t\tcnt += 1;\r\n\r\n# \tstdout.write(str(cnt) + '\\n')\r\n\r\n# if __name__ == '__main__':\r\n# \tmain()\r\n\r\n\r\n\r\nstring = input()\r\nl_nums = 0\r\nu_nums = 0\r\nfor letter in string:\r\n if letter.islower():\r\n l_nums += 1\r\n else:\r\n u_nums += 1\r\n\r\n\r\n\r\nif l_nums > u_nums:\r\n print(string.lower())\r\nelif u_nums > l_nums:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "n = input()\r\ncount = 0\r\nfor i in n:\r\n if i.isupper():\r\n count += 1\r\nif(count>len(n)//2):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "a= input()\r\ns = sum(map(str.islower,a))\r\nu = len(a)-s\r\nif s>=u:\r\n a = a.lower()\r\nelse:\r\n a = a.upper()\r\nprint(a)", "word = input()\r\nupperCase = lowerCase = 0\r\n# ord() method is used to get the ASCII value of the character\r\nfor alp in word:\r\n if ord(alp) >= 97:\r\n lowerCase += 1\r\n if ord(alp) < 96:\r\n upperCase += 1\r\nif lowerCase > upperCase or lowerCase == upperCase:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\nl = 0\r\nu = 0\r\n\r\nfor i in s:\r\n if i.islower(): l += 1\r\n else: u += 1\r\n\r\nprint(s.lower() if l>=u else s.upper())", "s=input()\r\nup=0\r\nlow=0\r\nfor i in s:\r\n if i.isupper():\r\n up+=1\r\n elif i.islower():\r\n low+=1\r\n\r\nif up <= int(len(s))/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "# print(ord('a')) 97; print(ord('z')) 122\r\n# print(ord('A')) 65; print(ord('Z')) 90\r\ndef func(s):\r\n\tclow = 0; cup = 0\r\n\tlower = \"\"; upper = \"\"\r\n\tfor i in range(len(s)):\r\n\t\tn = ord(s[i])\r\n\t\tif n >= 97 and n <= 122:\r\n\t\t\t# print(\"Lower\")\r\n\t\t\tclow += 1\r\n\t\t\tlower += chr(n); upper += chr(n - 32)\r\n\t\telse:\r\n\t\t\t# print(\"Upper\")\t\t\r\n\t\t\tcup += 1;\r\n\t\t\tupper += chr(n); lower += chr(n + 32)\r\n\r\n\tif clow >= cup:\r\n\t\treturn lower\r\n\telse:\r\n\t\treturn upper\r\n\r\ns = input()\r\nprint(func(s))", "s=input()\r\nl=0\r\nfor i in s:\r\n if i.islower():\r\n l+=1\r\nu=len(s)-l\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def cf(n):\r\n l=len(n)\r\n u=0\r\n for i in n:\r\n if i.isupper():\r\n u=u+1\r\n if u>l-u:\r\n return n.upper()\r\n else:\r\n return n.lower()\r\n \r\n \r\nN=input()\r\nprint(cf(N))\r\n\r\n \r\n", "a=input()\r\nb=0\r\nc=0\r\nfor k in a:\r\n if ord(k)>=97 and ord(k)<=122:\r\n b+=1\r\n else:\r\n c+=1\r\nif b<c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n\r\n\r\n#a=97,122\r\n#A=65,90\r\n\r\n", "a = input()\r\nmax = list()\r\nmin = list()\r\nfor i in a:\r\n if ord(i)>64 and ord(i)<97:\r\n max.append(i)\r\n else: min.append(i)\r\nif len(max) <= len(min):\r\n print(a.lower())\r\nelse:print(a.upper())", "def algo(inp):\r\n upperLetters = 0\r\n lowerLetters = len(inp)\r\n for letter in inp:\r\n if letter.isupper() == True:\r\n upperLetters += 1\r\n lowerLetters -= 1\r\n if upperLetters > lowerLetters:\r\n out = inp.upper()\r\n else:\r\n out = inp.lower()\r\n print(out)\r\ninp = input()\r\nalgo(inp)", "word = input()\n\nlower_counter, upper_counter = 0, 0\n\nfor ch in word: \n if ord(ch) >= 97:\n lower_counter += 1\n else:\n upper_counter += 1\n\nif upper_counter > lower_counter:\n print(word.upper())\nelse:\n print(word.lower())\n\n", "word=input()\r\ncnt_up=0\r\ncnt_lo=0\r\nfor ele in word:\r\n if ele.isupper():\r\n cnt_up+=1\r\n else:\r\n cnt_lo+=1\r\nif cnt_up>cnt_lo:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "S=input()\r\nL=[x for x in S if x>='A' and x<='Z']\r\nl1=[x for x in S if x>='a' and x<='z']\r\nif len(L)<=len(l1):\r\n S=S.lower()\r\nelse:\r\n S=S.upper()\r\nprint(S) ", "s = input()\r\nif sum(map(str.isupper,s)) > len(s)/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\ns=list(a)\r\nl=0\r\nu=0\r\nfor i in s:\r\n if(i.isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "x=input()\r\nu=0\r\nv=0\r\nfor i in x:\r\n if i.islower():\r\n u=u+1\r\n elif i.isupper():\r\n v=v+1\r\nif u>=v:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "def word(s):\r\n lower = 0\r\n upper = 0\r\n for i in s:\r\n if(i.islower()):\r\n lower+=1\r\n else:\r\n upper+=1\r\n if(upper>lower):\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\ns = input()\r\nprint(word(s))", "s=input()\r\ncount1=0\r\ncount2=0\r\ni=0\r\nwhile i<len(s):\r\n if s[i].islower()==True:\r\n count1+=1\r\n else:\r\n count2+=1\r\n i+=1\r\nif count1>=count2:\r\n \r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "inpWord=input()\r\ni=0\r\nfor x in inpWord:\r\n if x.isupper():\r\n i+=1\r\n else:\r\n i-=1\r\ninpWord = inpWord.upper() if i >0 else inpWord.lower()\r\nprint(inpWord)\r\n", "s = input()\r\ns_upper = []\r\ns_lower = []\r\nfor i in s:\r\n if i.isupper():\r\n s_upper.append(i)\r\n else:\r\n s_lower.append(i)\r\n\r\nif len(s_upper) > len(s_lower):\r\n print(s.upper())\r\nelif len(s_upper) <= len(s_lower):\r\n print(s.lower())", "s = str(input())\r\ns1 = list(s)\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in range(len(s1)):\r\n if (s1[i]>=\"a\" and s1[i]<=\"z\"):\r\n lower+=1\r\n \r\n else:\r\n upper+=1\r\n\r\nif upper>lower :\r\n print(s.upper())\r\n\r\nelse:\r\n print(s.lower())", "word=input()\nup=0\nlow=0\nfor i in range(len(word)):\n if word[i].isupper():\n up=up+1\n i+=1\n else:\n low=low+1\n i+=1\n\nif low<up:\n print(word.upper())\nelse:\n print(word.lower())\n", "s = input()\r\nk1, k2 = 0, 0\r\nfor i in range(len(s)):\r\n if 65 <= ord(s[i]) <= 91:\r\n k1 += 1\r\n else:\r\n k2 += 1\r\nif k1 <= k2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nr1, r2 = 0, 0\r\nfor i in s:\r\n if i.upper() == i:\r\n r2 += 1\r\n else:\r\n r1 += 1\r\nif r1 >= r2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nn1 = 0\r\nn2 = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n n1 += 1\r\n else:\r\n n2 += 1\r\nif n1<=n2:\r\n for i in range(len(s)):\r\n if s[i].isupper():\r\n s = s[:i] + s[i].lower()+s[i+1:]\r\nelse:\r\n for i in range(len(s)):\r\n if s[i].islower():\r\n s = s[:i] + s[i].upper()+s[i+1:]\r\nprint(s)", "s=input()\r\nco=0\r\ncount=0\r\nfor i in range(0,len(s)):\r\n if s[i].islower():\r\n count=count+1\r\n elif s[i].isupper():\r\n co=co+1\r\nif count>=co :\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word =input()\r\na = list(word)\r\nup = 0\r\nl = 0\r\nfor i in a:\r\n if i.isupper():\r\n up +=1\r\n else:\r\n l+=1\r\nif up>l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\nupper = 0\r\nfor char in word:\r\n if char.isupper():\r\n upper += 1\r\n else:\r\n upper -= 1\r\n\r\nif upper > 0:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n = input()\r\nz= 0\r\nfor x in n:\r\n if x.isupper():\r\n z += 1\r\n\r\nif z> len(n) // 2:\r\n n = n.upper()\r\nelse:\r\n n = n.lower()\r\n\r\nprint(n)", "s=input()\r\ncount1=0\r\ncount2=0\r\n\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n count1=count1+1\r\n else:\r\n count2=count2+1\r\nif count1>count2 or count1==count2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = list(input())\r\nupperChars = lowerChars = 0\r\nfor char in word:\r\n if char.isupper():\r\n upperChars += 1\r\n else:\r\n lowerChars += 1\r\nif upperChars > lowerChars:\r\n print(''.join(word).upper())\r\nelse:\r\n print(''.join(word).lower())", "s=input()\r\nc=0\r\nfor x in s:\r\n if x.isupper() :\r\n c+=1\r\nif c>len(s)//2 :\r\n s=s.upper()\r\nelse :\r\n s=s.lower()\r\nprint(s)", "s = list(input())\r\n\r\nc_up = 0\r\nc_low = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n c_up+=1\r\n else:\r\n c_low+=1\r\n \r\ns = ''.join(s)\r\nif c_up<=c_low:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "string = input()\r\nlower = []\r\nupper = []\r\nfor _ in range(len(string)):\r\n if string[_].islower():\r\n lower.append(string[_])\r\n else:\r\n upper.append(string[_])\r\n\r\nif len(lower) >= len(upper):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n", "s = input()\r\nup = [\"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\",\r\n \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\"]\r\nup_num = 0\r\nlow_num = 0\r\nfor i in range(len(s)) :\r\n if s[i] in up:\r\n up_num += 1\r\n else :\r\n low_num += 1\r\n\r\nif up_num > low_num:\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "def uni(a):\r\n lowercount = 0\r\n uppercount = 0\r\n for i in range(len(a)):\r\n if ord(a[i]) >= 65 and ord(a[i]) <= 90:\r\n uppercount += 1\r\n else:\r\n lowercount += 1\r\n if lowercount >= uppercount:\r\n return a.lower()\r\n else:\r\n return a.upper()\r\n\r\nprint(uni(input()))\r\n", "c=str(input())\r\nco=0\r\nco1=0\r\nj=0\r\nfor i in str(c):\r\n if(i.islower()):\r\n co=co+1\r\n j=j+1\r\n else:\r\n co1=co1+1\r\nif(co<co1):\r\n print(c.upper())\r\nelse:\r\n print(c.lower())", "s = str(input())\r\ncount1, count2 = 0, 0\r\nfor i in range(len(s)):\r\n if s[i].isupper() == True:\r\n count1 += 1\r\n else:\r\n count2 += 1\r\nif count1 > count2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n", "from collections import Counter\r\nxx = input()\r\nc = Counter('upper' if x.isupper() else 'lower' if x.islower() else '' for x in list(xx))\r\nprint([xx.lower(), xx.upper()][c['lower'] < c['upper']])", "import sys\r\n\r\n\r\ndef get_data():\r\n data = sys.stdin.readline().split()[0]\r\n return data\r\n \r\ndef solve_problem():\r\n data = get_data()\r\n u = 0\r\n l = 0\r\n for letter in data:\r\n if letter.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n if u > l:\r\n print(data.upper())\r\n else:\r\n print(data.lower())\r\n \r\n \r\nif __name__ == '__main__':\r\n solve_problem()", "s = input()\r\nx = 0\r\n\r\nup = 0\r\ndwn = 0\r\nfor i in s:\r\n if i.isupper():\r\n up += 1\r\n elif i.islower():\r\n dwn += 1\r\nif dwn >= up:\r\n s = s.lower()\r\nelif up > dwn:\r\n s = s.upper()\r\nprint(s)\r\n", "a=input()\r\nl=0\r\nu=0\r\nfor i in range (0,len(a)):\r\n if ord(a[i]) > 91:\r\n l+=1\r\n else :\r\n u+=1\r\nif u>l:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "input_string = input(\"\")\r\nlower, upper = 0, 0\r\nfor i in input_string:\r\n if(i.isupper()):\r\n upper += 1\r\n else:\r\n lower += 1\r\nprint(input_string.upper() if (upper > lower) else input_string.lower())", "\t\t\r\n\r\n\r\ns = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(s)):\r\n if s[i] >= \"a\" and s[i] <= \"z\":\r\n lower += 1\r\n else:\r\n upper += 1\r\nif lower >= upper:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)\r\n\r\n", "s=input()\r\nsu=s.upper()\r\nsl=s.lower()\r\nl=0\r\nu=0\r\nfor i in range(len(s)):\r\n if(sl[i]==s[i]):\r\n l=l+1\r\n elif(su[i]==s[i]):\r\n u=u+1\r\n \r\n \r\nif(l>=u):\r\n print(sl)\r\nelse:\r\n print(su)\r\n", "word = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(word)):\r\n if word[i] >= 'a' and word[i] <= 'z':\r\n lower+=1\r\n elif word[i] >= 'A' and word[i] <= 'Z':\r\n upper+=1\r\n\r\nif upper>lower:\r\n print(word.upper())\r\nelif lower>=upper:\r\n print(word.lower())", "w = input()\r\nl=0\r\nfor i in range(len(w)):\r\n l+=1 if w[i].islower() else 0\r\nprint([w.upper(),w.lower()][l>=len(w)-l])", "s = input().replace('', ' ').split()\r\ncnt = 0\r\nfor i in s:\r\n\tif ord(i) >= 97:\r\n\t\tcnt += 1\r\nif len(s) - cnt > cnt:\r\n\tfor i in range(len(s)):\r\n\t\tif ord(s[i]) >= 97:\r\n\t\t\ts[i] = chr(ord(s[i]) - 32)\r\nelse:\r\n\tfor i in range(len(s)):\r\n\t\tif ord(s[i]) < 91:\r\n\t\t\ts[i] = chr(ord(s[i]) + 32)\r\nprint(*s, sep='')\r\n", "\r\nword = input()\r\n\r\nword_upper = word.upper()\r\nword_lower = word.lower()\r\n\r\nupper_count = 0\r\n\r\nfor position in range(0,len(word)):\r\n\tif word[position] == word_upper[position]:\r\n\t\tupper_count = upper_count + 1\r\n\r\nresult = word_lower\r\nif (len(word) - upper_count < upper_count):\r\n\tresult = word_upper\r\n\r\nprint(result)", "s=input()\r\ncnt1=0\r\ncnt2=0\r\nfor i in s:\r\n if i>='A' and i<='Z':\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\nif cnt1>cnt2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nup,low=0,0\r\nfor i in s:\r\n if(i.isupper()):\r\n up+=1\r\n else:\r\n low+=1\r\nif(up>low):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nn1=[]\r\nn2=[]\r\nh=[n1.append(1) if i.isupper() else n2.append(1) for i in s]\r\nif n1>n2 or n1 == (len(s)/2)+1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "str=str(input())\r\nlower=0\r\nupper=0\r\nfor i in range(0,len(str)):\r\n z=ord(str[i])\r\n if (97<=z and z<=122):\r\n lower+=1\r\n elif (65<=z and z<=90):\r\n upper+=1\r\nif lower>=upper:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "x=input()\r\nh=list(x)\r\nucount=0\r\nlcount=0\r\nh=[ord(j) for j in h]\r\nfor i in range(len(h)):\r\n\tif (h[i]>96 and h[i]<=122):\r\n\t\tlcount=lcount+1\r\n\telif h[i]>=65 and h[i]<=90:\r\n\t\tucount=ucount+1\r\nif(lcount>ucount) or (lcount==ucount):\r\n\tprint (x.lower())\r\nelse:\r\n\tprint (x.upper())", "\r\nline = input()\r\ncount = 0;\r\nfor i in line:\r\n if i.isupper():\r\n count += 1;\r\n \r\nif len(line) - count < count:\r\n print(line.upper())\r\nelse:\r\n print(line.lower())", "#!/usr/bin/python3.5\r\nminus = \"qwertyuiopasdfghjklzxcvbnm\"\r\nmayus = minus.upper()\r\ns = input()\r\nc1 = 0 \r\nc2 = 0\r\nfor l in s:\r\n\tif (l in minus):\r\n\t\tc1 = c1 + 1\r\n\telif(l in mayus):\r\n\t\tc2 = c2 + 1\r\nif(c1-c2 == 0):\r\n\tprint(s.lower())\r\nelif(c1-c2 >= 1):\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "n = input()\r\ncount_small = 0\r\ncount_big = 0\r\nfor i in n:\r\n if ord(i)>90:\r\n count_small+=1\r\n else:\r\n count_big+=1\r\nif count_small >= count_big:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "a=input()\r\nlower=0\r\nupper=0\r\nfor i in a:\r\n if int(ord(i))<=90:\r\n upper=upper+1\r\n else:\r\n lower=lower+1\r\nif upper>lower:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\r\nl,u=0,0\r\nfor i in range(len(s)):\r\n\tif(s[i].isupper()):\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif(u>l):\r\n\tprint(s.upper())\r\nelif(l>u or l==u):\r\n\tprint(s.lower())", "# -*- coding: utf-8 -*-\n\"\"\"answer.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1JACmdEB4KfVO9eAL6xL2DPDPU1P4-oJI\n\"\"\"\n\n#7\nword = input()\nup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\ndown = 'abcdefghijklmnopqrstuvwxyz'\nupc = 0\ndoc = 0\nfor i in word:\n if i in up:\n upc += 1\n else:\n doc += 1\nanswer = ''\nif upc > doc:\n for i in word:\n if 64 < ord(i) < 91:\n answer += i\n else:\n answer += chr(ord(i)-32)\nelse:\n for i in word:\n if 64 < ord(i) < 91:\n answer += chr(ord(i)+32)\n else:\n answer += i\nprint(answer)", "name = input()\r\nlower_name = [i for i in name if i.islower()]\r\nupper_name = [i for i in name if not i.islower()]\r\n\r\nif len(lower_name) >= len(upper_name):\r\n print(name.lower())\r\nelse:\r\n print(name.upper())", "def word(s, l, alpha):\r\n c = 0\r\n for i in alpha:\r\n if i in s:\r\n c += s.count(i)\r\n\r\n diff = l - c\r\n\r\n if diff >= c:\r\n return s.lower()\r\n return s.upper()\r\n\r\ns = input()\r\nl = len(s)\r\nalpha = {'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\nprint(word(s, l, alpha))\r\n\r\n\r\n\r\n", "def DI(): return int(input())\r\ndef DS(): return input()\r\ndef LI(): return list(MPI())\r\ndef MPI(): return map(int, DS().split(' '))\r\ndef SSL(): return DS().split()\r\ndef MPF(): return map(float, DS().split(' '))\r\n\r\ns = DS()\r\nu = 0\r\nl = 0\r\nfor i in s:\r\n if i.islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif l >= u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "y = input()\r\nu = []\r\nl = []\r\nfor i in y:\r\n if i.isupper() == True:\r\n u.append(i)\r\n else:\r\n l.append(i)\r\nif len(u) > len(l):\r\n print(y.upper())\r\nelse:\r\n print(y.lower())", "a=input();c=0;d=0\r\nfor i in a:\r\n\tif(ord(i)<=90):\r\n\t\tc=c+1\r\n\telse:\r\n\t\td=d+1\r\nif(d>=c):\r\n\tprint(a.lower())\r\nelse:\r\n\tprint(a.upper())", "ss = input()\r\nass = 0\r\nsss = 0\r\nfor i in ss:\r\n if i.islower():\r\n ass+=1\r\n else:\r\n sss+=1\r\nif ass >= sss:\r\n print(ss.lower())\r\nelse:\r\n print(ss.upper())", "s = input()\r\n\r\nup = 0\r\nlo = 0\r\nfor l in s:\r\n if l.isupper(): up+=1\r\n else: lo+=1\r\n\r\nprint(s.upper() if up > lo else s.lower())", "__name__ = \"__main__\"\r\n\r\ndef solve(word):\r\n uc = len(list(filter(lambda x: x == x.upper(), word)))\r\n lc = len(list(filter(lambda x: x == x.lower(), word)))\r\n\r\n if uc == lc:\r\n return word.lower()\r\n \r\n if uc < lc:\r\n return word.lower()\r\n else:\r\n return word.upper()\r\n\r\nif __name__ == \"__main__\":\r\n word = input()\r\n print(solve(word))", "x = str(input())\r\nres = 0\r\nfor i in x:\r\n if i.isupper():\r\n res = res + 1\r\ny = len(x)\r\nz = y - res\r\nif (z >= res):\r\n x = x.lower()\r\nelse:\r\n x = x.upper()\r\nprint(x)", "word = input()\r\nl = u = 0\r\nfor c in word:\r\n if c.islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif l >= u:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)", "text = input()\r\n\r\ntext_arr = list(text)\r\nuppercase_words, lowercase_words = [], []\r\n\r\nfor i in range(len(text_arr)):\r\n if text_arr[i].isupper():\r\n uppercase_words.append(i)\r\n else:\r\n lowercase_words.append(i)\r\n\r\nif len(uppercase_words) > len(lowercase_words):\r\n print(text.upper())\r\nelse:\r\n print(text.lower())", "s = input()\r\nb = []\r\nup = 0\r\nlow = 0\r\nfor i in s:b.append(i)\r\nfor i in b:\r\n if i.isupper():up += 1\r\n else:low += 1\r\nif up > low:print(s.upper())\r\nelse:print(s.lower())\r\n\r\n", "n=input()\r\nloer=0\r\nuppr=0\r\nfor i in n:\r\n if(i.islower()):\r\n loer+=1\r\n else:\r\n uppr+=1\r\nif loer>=uppr:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s=input(\"\")\r\ncpt=0\r\ncptIp=0\r\nfor i in s:\r\n if i.islower():\r\n cpt+=1\r\n else:\r\n cptIp+=1\r\n\r\nif cpt > cptIp :\r\n newS = s.lower()\r\nelif cpt < cptIp:\r\n newS = s.upper()\r\nelse :\r\n newS = s.lower() \r\n \r\n\r\nprint(newS)", "'''\r\nA. Word\r\ntime limit per test2 seconds\r\nmemory limit per test256 megabytes\r\ninputstandard input\r\noutputstandard output\r\nVasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.\r\n\r\nInput\r\nThe first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.\r\n\r\nOutput\r\nPrint the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.\r\n\r\nExamples\r\ninputCopy\r\nHoUse\r\noutputCopy\r\nhouse\r\ninputCopy\r\nViP\r\noutputCopy\r\nVIP\r\ninputCopy\r\nmaTRIx\r\noutputCopy\r\nmatrix\r\n'''\r\nINPUT_WORD = str(input())\r\nLatinLow = 'abcdefghijklmnopqrstuvwxyz'\r\nLatinUp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nLOWERCASE_NUM = 0\r\nUPPERCASE_NUM = 0\r\nfor i in INPUT_WORD:\r\n if i in LatinLow:\r\n LOWERCASE_NUM += 1\r\n else:\r\n UPPERCASE_NUM += 1\r\nif LOWERCASE_NUM >= UPPERCASE_NUM:\r\n print(INPUT_WORD.lower())\r\nelse:\r\n print(INPUT_WORD.upper())", "word1 = input()\r\nword = list(word1)\r\nlower=0\r\nupper=0\r\nfor i in range(0, len(word)):\r\n if word[i].islower()==True:\r\n lower=lower+1\r\n else:\r\n upper=upper+1\r\nif(lower>=upper):\r\n print(word1.lower())\r\nelse:\r\n print(word1.upper())\r\n", "s = input()\r\n\r\nt = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].lower() == s[i]:\r\n t += 1\r\n else:\r\n t-=1\r\n\r\nif t>=0:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "#import re\r\na = input()\r\ndef n_lower_chars(string):\r\n return sum([int(c.islower()) for c in string])\r\nif 2*(n_lower_chars(a))>=len(a):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "t = input()\r\nupper = 0\r\nlower = 0\r\nfor i in t:\r\n if i.islower() == True:\r\n lower += 1\r\n else:\r\n upper += 1\r\n \r\nif upper > lower:\r\n t = t.upper()\r\nelse:\r\n t = t.lower()\r\n \r\nprint(t)", "s = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor x in s:\r\n if x.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\nif upper_count > lower_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = input()\r\np = 0\r\nZ = 0\r\nfor c in n:\r\n #print(c)\r\n if c.isupper():\r\n Z += 1\r\n else:\r\n p += 1\r\nif Z <= p:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s = input()\r\nu = 0\r\nl = 0\r\nfor i in range(len(s)):\r\n\tif s[i].isupper():\r\n\t\tu += 1\r\n\telse:\r\n\t\tl += 1\r\nif u > l :\r\n\ts = s.upper()\r\nelse:\r\n\ts = s.lower()\r\nprint(s)", "a=input()\r\ncount=0\r\nfor i in a:\r\n if i==i.lower():\r\n count+=1\r\nif count>=len(a)/2:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "kata = input()\r\nlow=up=0\r\n\r\nfor i in kata:\r\n if i.isupper():\r\n up+=1\r\n elif i.islower():\r\n low+=1\r\n\r\nif up > low:\r\n newkata = kata.upper()\r\nelse:\r\n newkata = kata.lower();\r\n\r\nprint(newkata)\r\n \r\n", "count = 0\r\nword = str(input())\r\nfor char in word:\r\n if char.isupper():\r\n count += 1\r\n\r\n\r\nlower = len(word)-count\r\nif count>lower:\r\n word = word.upper()\r\n print(word)\r\nelse:\r\n word = word.lower()\r\n print(word)", "word = input()\r\n\r\nU = 0\r\nL = 0\r\n\r\nfor i in word:\r\n low = i.lower()\r\n if i == low:\r\n L += 1\r\n else:\r\n U += 1\r\n\r\nif L >= U:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "capital = list(map(chr, range(ord('A'), ord('Z')+1)))\r\nsmall = list(map(chr, range(ord('a'), ord('z')+1)))\r\n\r\nword = input()\r\nc = []\r\ns = []\r\nfor i in word:\r\n if i in capital:\r\n c.append(i)\r\n elif i in small:\r\n s.append(i)\r\nif len(c) <= len(s):\r\n print(word.lower())\r\nelif len(c) > len(s):\r\n print(word.upper())", "a=input()\nu=len(list(filter(lambda x:x.isupper(),a)))\nl=len(list(filter(lambda x:x.islower(),a)))\nif l>=u:\n print(a.lower())\nelse:\n print(a.upper())\n\n\n\n\n\n", "ch=input()\r\nn=0\r\nn1=0\r\nfor i in ch:\r\n if i.isupper()==True:\r\n n+=1\r\n else:\r\n n1+=1\r\nif n>n1:\r\n print(ch.upper())\r\nelse:\r\n print(ch.lower())", "m,n=0,0\r\na=input()\r\na1=a.lower()\r\nl=len(a)\r\nfor i in range (l):\r\n if a[i]==a1[i]:\r\n m=m+1\r\n else:\r\n n=n+1\r\nif m>= n:\r\n print(a1)\r\nelse:\r\n print(a.upper())", "inp=input()\r\ncount=[]\r\ncount2=[]\r\nfor y in range(len(inp)):\r\n if inp[y].isupper():\r\n count.append(inp[y])\r\n elif inp[y].islower():\r\n count2.append(inp[y])\r\nif len(count)>len(count2):\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())\r\n", "# Word: python\r\n\r\ns = input()\r\n\r\nupper_num = 0\r\n\r\nfor char in s:\r\n if char.isupper():\r\n upper_num += 1\r\n\r\nif upper_num > len(s) // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=str(input())\nlist1=[]\nlist2=[]\nfor i in n:\n if i.islower():\n list1.append(i)\n else:\n list2.append(i)\nif len(list1)>=len(list2):\n m=n.lower()\n print(m)\nelse:\n m=n.upper()\n print(m)\n\t\t\t \t\t\t \t \t \t\t\t\t \t \t\t \t \t", "str1 = str(input())\r\nup = 0\r\nlo = 0\r\nfor a in str1:\r\n if a == a.lower():\r\n lo += 1\r\n else:\r\n up += 1\r\nif lo >= up:\r\n print(str1.lower())\r\nelse:\r\n print(str1.upper())\r\n", "word= input()\r\nlower,upper=0,0\r\nfor w in word:\r\n if w.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper<=lower:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\ncl = 0\r\ncu = 0\r\nfor i in s:\r\n if i.islower():\r\n cl += 1 \r\n else:\r\n cu += 1\r\nif cl>=cu:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "x = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in x:\r\n if i.isupper() :\r\n count1+=1\r\n else:\r\n count2+=1\r\nif(count1>count2):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "x=input()\r\na=list(x)\r\nuppers=0\r\nlowers=0\r\nfor b in a:\r\n if b.isupper():\r\n uppers=uppers+1\r\n else:\r\n lowers=lowers+1\r\nif uppers>lowers:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n \r\n", "a = str(input())\r\nb, e = [], []\r\nc, d = 0, 0\r\nfor i in a:\r\n b.append(ord(i))\r\nfor j in b:\r\n if 65 <= j <= 90:\r\n c += 1\r\n else:\r\n d += 1\r\nif c > d:\r\n for j in b:\r\n if 97 <= j <= 122:\r\n e.append(chr(j-32))\r\n else:\r\n e.append(chr(j))\r\nelse:\r\n for j in b:\r\n if 65 <= j <= 90:\r\n e.append(chr(j + 32))\r\n else:\r\n e.append(chr(j))\r\nfor k in e:\r\n print(k, end='')", "s = input()\r\nisu = 0\r\nfor c in s:\r\n if c.isupper():\r\n isu+=1\r\nif isu > len(s)-isu:\r\n print(s.upper())\r\nelse: \r\n print(s.lower())\r\n", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i.isupper() is True:\r\n count = count + 1\r\nn = len(s) - count\r\nif count > n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n\r\n", "k = input()\r\nl, u = 0, 0\r\nfor i in k:\r\n if i.isupper():\r\n u += 1\r\n if i.islower():\r\n l += 1\r\nif l<u:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())\r\n", "s=input()\r\nl=0\r\nu=0\r\nfor ch in s:\r\n if ch.isupper():\r\n u+= 1\r\n else:\r\n l+= 1\r\nif u>l:\r\n s=s.upper()\r\nelse:\r\n s=s.lower() \r\nprint(s)", "word = input()\r\ncountupper = 0\r\ncountlower = 0\r\nfor i in word:\r\n if i == i.upper():\r\n countupper += 1\r\n elif i == i.lower():\r\n countlower += 1\r\nif countupper > countlower:\r\n print(word.upper())\r\nelif countupper <= countlower:\r\n print(word.lower())\r\n\r\n", "a = input()\r\ncntLower = 0\r\ncntUpper = 0\r\nfor i in a:\r\n if i.isupper():\r\n cntUpper += 1\r\n else:\r\n cntLower += 1\r\n\r\nif cntLower >= cntUpper:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\r\nlow=0\r\nup=0\r\nfor i in range(len(s)):\r\n if ord(s[i])>=97:\r\n low+=1\r\n else:\r\n up+=1\r\nif low>=up:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "stri = input()\r\ncount = 0\r\nfor i in stri:\r\n if i.isupper():\r\n count += 1\r\nif count > (len(stri) / 2):\r\n print(stri.upper())\r\nelse:\r\n print(stri.lower())\r\n", "if __name__ == '__main__' :\r\n s = input()\r\n u,l = 0,0\r\n for i in s :\r\n if ord(i) >= 65 and ord(i) <= 90 :\r\n u += 1\r\n else :\r\n l += 1\r\n if u > l :\r\n print(s.upper())\r\n else :\r\n print(s.lower())", "a = input()\r\ns = 0\r\nx = 0\r\n\r\nfor i in range(len(a)):\r\n if ord(a[i]) >= 65 and ord(a[i]) <= 90:\r\n s+=1\r\n else:\r\n x+=1\r\nif s > x:\r\n print(a.upper())\r\nelif s <= x:\r\n print(a.lower())", "hs = input()\r\ncnt_L = 0\r\ncnt_U = 0\r\nfor i in range(len(hs)):\r\n if hs[i].isupper():\r\n cnt_U+=1\r\n elif hs[i].islower():\r\n cnt_L+=1\r\nif cnt_U > cnt_L:\r\n print(hs.upper())\r\nelif cnt_U <= cnt_L:\r\n print(hs.lower())\r\n", "def countlower(n):\n c=0\n for i in n:\n if i.islower():\n c=c+1\n return c\n\ndef countupper(n):\n c=0\n for i in n:\n if i.isupper():\n c=c+1\n return c\nn = input()\nl =countlower(n)\nu = countupper(n)\nif l>=u:\n print(n.lower())\nelif l<u:\n print(n.upper())\n\n \n\n\n", "a=input()\nflag=0\nfor i in a:\n if ord(i)<=90:\n flag+=1\nif len(a)-flag<flag:\n print(a.upper())\nelse:\n print(a.lower())\n\t \t\t \t\t \t \t\t\t \t \t\t\t\t \t", "def countCAP(s):\n return sum(1 for c in s if c.isupper())\na = input()\nif countCAP(a)> len(a)/2:\n print(a.upper())\nelse: print(a.lower())\n \t \t \t \t \t \t \t\t \t \t \t\t", "s = (input())\r\ncnt = 0\r\ncnt1 = 0\r\nfor i in range(len(s)):\r\n\tif ord(s[i]) >= 96:\r\n\t\tcnt += 1\r\n\telse:\r\n\t\tcnt1 +=1\r\nif cnt >= cnt1:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "n = input()\r\nd = len(n)\r\n\r\na = 0\r\nb = 0\r\nfor i in range(d):\r\n if(n[i]>=\"A\" and n[i]<=\"Z\"):\r\n a+=1\r\n else:\r\n b+=1\r\n\r\nif(a>b):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = input()\r\nlower = set(\"abcdefghijklmnopqrstuvwxyz\")\r\nl = u = 0\r\nfor ch in s:\r\n if ch in lower:\r\n l += 1\r\n else:\r\n u += 1\r\nif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nl=len(s)\r\ncount=0\r\nfor i in s:\r\n if(i>=\"A\" and i<=\"Z\"):\r\n count+=1\r\nif(count>(l/2)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n", "s = input()\r\nword = \"\"\r\ncount = 0\r\nfor i in s:\r\n if i.islower():\r\n count+=1\r\nif 2*count<len(s):\r\n for i in s:\r\n word+=i.upper()\r\nelse:\r\n for i in s:\r\n word+=i.lower()\r\nprint(word)\r\n", "s=input()\r\ncountL=0\r\ncountU=0\r\nfor i in s:\r\n if ord(i)<97:\r\n countU+=1\r\n else :\r\n countL+=1\r\nif countL<countU:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nch1='abcdefghijklmnopqrstuvwxyz'\r\nch2='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nch3=''\r\nch4=''\r\nfor i in s:\r\n if i in ch1:\r\n ch3+=i\r\n else:\r\n ch4+=i\r\nif len(ch3)>=len(ch4):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\n\r\nnum_uppercase = 0\r\nnum_lowercase = 0\r\n\r\nfor char in word:\r\n if char.isupper():\r\n num_uppercase += 1\r\n else:\r\n num_lowercase += 1\r\n\r\nif num_uppercase > num_lowercase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "def main():\r\n wo = input()\r\n lower_case = sum(1 for c in wo if c.islower())\r\n\r\n if lower_case >= len(wo) / 2:\r\n conversion_function = str.lower\r\n else:\r\n conversion_function = str.upper\r\n\r\n converted_wo = ''.join(conversion_function(c) for c in wo)\r\n print(converted_wo)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=input()\r\nu=0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n u+=1\r\nif u>(len(n)-u):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "lo = list('abcdefghijklmnopqrstuvwxyz')\r\nm, n = 0, 0\r\nline = input()\r\nfor i in range(len(line)):\r\n\tif line[i] in lo:\r\n\t\tm += 1\r\n\telse:\r\n\t\tn += 1\r\nif m >= n:\r\n\tprint(line.lower())\r\nelse:\r\n\tprint(line.upper())\r\n", "\nnum_of_uppercase, num_of_lowercase = 0, 0\ntext = input()\nnum_of_lowercase = sum(1 for c in text if c.islower())\nnum_of_uppercase = sum(1 for c in text if c.isupper())\nif num_of_uppercase > num_of_lowercase:\n text = text.upper()\nelse:\n text = text.lower()\nprint(text)\n", "p=input()\r\nc=0\r\nl=len(p)\r\nfor i in p:\r\n if i== i.lower():\r\n c+=1\r\ng=l-c\r\n#print('c:',c)\r\nif c>g or c==g:\r\n f=p.lower()\r\nelse:\r\n f=p.upper()\r\nprint(f)", "st = input()\r\ncount_Up = 0\r\ncount_Lo = 0\r\nfor i in st:\r\n if i.isupper():\r\n count_Up += 1\r\n else:\r\n count_Lo += 1\r\nif count_Up > count_Lo:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "st=input()\r\na=0\r\nb=0\r\n\r\nfor z in st:\r\n if z>='a':\r\n a+=1\r\n else:\r\n b+=1\r\nif b<=a:\r\n print(st.lower())\r\nelse:\r\n print(st.upper())", "st = list(input())\r\ncntupper = 0\r\ncnt = 0\r\nfor i in st:\r\n if i.isupper():\r\n cntupper+=1\r\n else:\r\n cnt += 1\r\nif cntupper>cnt:\r\n print(''.join(st).upper())\r\nelse:\r\n print(''.join(st).lower())", "s = input()\r\nc=0\r\nd=0\r\nfor i in range(len(s)):\r\n if ord(\"a\")<=ord(s[i])<=ord(\"z\"):\r\n c+=1\r\n else:\r\n d+=1\r\ntemp=\"\"\r\nif c>=d:\r\n for i in range(len(s)):\r\n if ord(\"a\")<=ord(s[i])<=ord(\"z\"):\r\n temp+=s[i]\r\n else:\r\n temp+=chr(ord(s[i])+32)\r\n print(temp)\r\nelse:\r\n for i in range(len(s)):\r\n if ord(\"A\")<=ord(s[i])<=ord(\"Z\"):\r\n temp+=s[i]\r\n else:\r\n temp+=chr(ord(s[i])-32)\r\n print(temp)", "s = input()\r\nbig, small = 0, 0\r\nfor i in range(len(s)):\r\n if 'A' <= s[i] <= 'Z':\r\n big += 1\r\n else:\r\n small += 1\r\nif big > small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nupper = []\r\nlower = []\r\nfor i in a:\r\n\tif ord(i) < 97:\r\n\t\tupper.append(i)\r\n\telse:\r\n\t\tlower.append(i)\r\nif len(lower) > len(upper):\r\n\tprint(a.lower())\r\nelif len(lower) < len(upper):\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "a = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nb = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".lower()\r\nlowerc = 0\r\nupperc = 0\r\nx = input()\r\nfor i in x:\r\n if i in a:\r\n upperc += 1\r\n if i in b:\r\n lowerc += 1\r\n\r\nif lowerc >= upperc:\r\n x = x.lower()\r\nelif lowerc < upperc:\r\n x = x.upper()\r\n\r\nprint(x)", "word = input()\r\nu_cnt = 0\r\nl_cnt = 0\r\nfor item in word:\r\n if item.isupper():\r\n u_cnt += 1\r\n else:\r\n l_cnt += 1\r\nif u_cnt > l_cnt:\r\n print(word.upper())\r\nelif u_cnt <= l_cnt:\r\n print(word.lower())\r\n\r\n", "s = str(input())\r\nl = 0\r\nu = 0\r\nfor i in range(len(s)):\r\n if s[i] >= 'a' and s[i] <= 'z':\r\n l += 1\r\n if s[i] >= 'A' and s[i] <= 'Z':\r\n u += 1\r\nif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x=input()\r\ncount=0\r\ny=0\r\nfor i in x:\r\n if( ord(i)>64 and ord(i)<91):\r\n if(ord(i)==ord(i.upper())):\r\n count=count+1\r\n else:\r\n y=y+1\r\nif(count>y):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "x=input()\nx1=x.lower()\nx2=x.upper()\nxv=x.replace(\"\",\" \").split()\nxv=[ord(x) for x in xv]\nxv1=x1.replace(\"\",\" \").split()\nxv1=[ord(x) for x in xv1]\nxv2=x2.replace(\"\",\" \").split()\nxv2=[ord(x) for x in xv2]\nxv=sum(xv)\nxv1=sum(xv1)\nxv2=sum(xv2)\nif (abs(xv-xv1)>abs(xv-xv2)):\n print(x2)\nelse:\n print(x1)", "s = input()\r\nl = 0\r\nu = 0\r\na = ''\r\nfor c in s:\r\n if c.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif l >= u:\r\n for i in s:\r\n a+=i.lower()\r\nelse:\r\n for i in s:\r\n a+=i.upper()\r\nprint(a)", "\"\"\"\r\ncontest= https://codeforces.com/contest/59/problem/A\r\ndate= Tuesday, May 9, 2023\r\nVerdict = Accepted\r\n\"\"\"\r\ns=input()\r\nl,u=0,0 #l=lower,upper\r\nfor i in s :\r\n if (\"A\"<=i<=\"Z\"):\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nif(l<u):\r\n print(s.upper()) \r\nelse:\r\n print(s.lower())\r\n \r\n\r\n", "string = str(input())\r\nlowercases = ['a' , 'b' , 'c' , 'd' , 'e' , 'f' , 'g' , 'h' , 'i' , 'j' , 'k' , 'l' , 'm' , 'n' , 'o' , 'p' , 'q' , 'r' , 's' , 't' ,\r\n 'u' , 'v' , 'w' , 'x' , 'y' , 'z']\r\nuppercases = ['A' , 'B' , 'C' , 'D' , 'E' , 'F' , 'G' , 'H' , 'I' , 'J' , 'K' , 'L' , 'M' , 'N' , 'O' , 'P' , 'Q' , 'R' , 'S' , 'T' ,\r\n 'U' , 'V' , 'W' , 'X' , 'Y' , 'Z']\r\nlstletters = list(string)\r\nlowerletters = 0\r\nupperletters = 0\r\nfor i in range(len(lstletters)):\r\n if lstletters[i] in lowercases:\r\n lowerletters += 1\r\n elif lstletters[i] in uppercases:\r\n upperletters += 1\r\nif lowerletters >= upperletters:\r\n for j in range(len(lstletters)):\r\n lstletters[j] = lstletters[j].lower()\r\nelse:\r\n for t in range(len(lstletters)):\r\n lstletters[t] = lstletters[t].upper()\r\nfor p in range(len(lstletters)):\r\n print(lstletters[p] , end='')", "a = input()\r\nb = 0\r\nc = 0\r\n\r\nwhile b < len(a):\r\n if a[b] == a[b].upper():\r\n c += 1\r\n b += 1\r\n\r\nif c > len(a)/2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "inp=input()\r\nsma=cap=0\r\nfor i in inp:\r\n if 'A'<=i and i<='Z':\r\n cap+=1\r\n else:\r\n sma+=1\r\nif cap==sma:\r\n print(inp.lower())\r\nelif cap>sma:\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())\r\n \r\n\r\n\r\n \r\n", "word =input()\nu_count = 0\nl_count = 0\nfor c in word:\n u_count += int(c.isupper())\n l_count += int(c.islower())\n\nif u_count > l_count:\n print(word.upper())\nelse:\n print(word.lower())\n \t\t \t\t\t \t \t\t \t \t \t \t\t\t", "s = input()\r\nlow = []\r\nup = []\r\nfor i in s:\r\n if i == i.lower():\r\n low.append(i)\r\n else:\r\n up.append(i)\r\nif len(low) >= len(up):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\ncl = 0\r\ncu = 0\r\nfor each in s:\r\n if each.islower():\r\n cl += 1\r\n else:\r\n cu += 1\r\nif cl >= cu:\r\n for each in s:\r\n print(each.lower(),end=\"\")\r\nelse:\r\n for each in s:\r\n print(each.upper(),end=\"\")\r\n ", "a=input()\r\nb=len(a)\r\nlow=0\r\nup=0\r\nfor i in range(b):\r\n if a[i].isupper():\r\n up+=1\r\n elif a[i].islower():\r\n low+=1\r\nif up>low:\r\n f=a.upper()\r\nelse:\r\n f=a.lower()\r\nprint(f)", "str1 = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(str1)):\r\n if (str1[i].lower() == str1[i]):\r\n lower +=1\r\n else:\r\n upper+=1\r\n \r\nif (lower>=upper):\r\n print(str1.lower())\r\nelse:\r\n print(str1.upper())", "x=list(input())\r\nu=0\r\nl=0\r\nfor i in range(len(x)):\r\n if x[i].isupper():\r\n u=u+1\r\n else:\r\n l=l+1\r\nif u>l:\r\n for i in range(len(x)):\r\n print(x[i].upper(),end=\"\")\r\nelse:\r\n for i in range(len(x)):\r\n print(x[i].lower(), end=\"\")", "s=input()\r\nuc,lc=0,0\r\nfor i in s:\r\n if(i.isupper()):\r\n uc+=1\r\n else:\r\n lc+=1\r\nif(lc>uc):\r\n x=s.lower()\r\n print(x)\r\nelif(uc>lc):\r\n y=s.upper()\r\n print(y)\r\nelse:\r\n z=s.lower()\r\n print(z)", "#uppercase or lowercase\r\nn = input()\r\nupp = low = 0\r\nfor i in n:\r\n if i.isupper(): upp = upp + 1\r\n else: low = low + 1\r\nif upp > low: print(n.upper())\r\nelse: print(n.lower())\r\n", "n=input()\nlist=[]\nlist2=[]\nup=sum(1 for char in n if char.isupper())\nlow=sum(1 for char in n if char.islower())\nif(up>low):\n print(n.upper())\nelif(low>=up):\n print(n.lower())", "s=input()\r\ns=list(s)\r\nu=0\r\nl=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n u+=1\r\n else:\r\n l+=1\r\nk=\"\"\r\nfor i in s:\r\n k+=i\r\nif l>=u:\r\n print(k.lower())\r\nelse:\r\n print(k.upper())\r\n\r\n ", "s=input() ; up=0\r\nfor i in s:\r\n if i.isupper(): up+=1\r\nif up > len(s)/2:\r\n print(s.upper())\r\nelse: print(s.lower())", "n = input()\r\n\r\ncount1=0\r\ncount2=0\r\nfor a in n:\r\n if a.isupper()==True:\r\n count1+= 1\r\n \r\n elif (a.islower()) == True: \r\n count2+= 1 \r\n \r\nif count1>count2:\r\n print(n.upper())\r\nelif count1<=count2: \r\n print(n.lower())", "s=input()\r\ni=0\r\nfor lett in s:\r\n if ord(lett)>90:\r\n i+=1\r\nif 2*i>=len(s):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nc=0\r\nfor i in s:\r\n if i.islower():\r\n c+=1\r\nif c>=len(s)-c:print(s.lower())\r\nelse:print(s.upper())", "n = input()\r\ncount1 = 0\r\ncount2 = 0 \r\nfor i in n:\r\n\t if i.islower():\r\n\t \tcount1 += 1\r\n\t if i.isupper():\r\n\t \tcount2 += 1\t\r\nif count1<count2:\r\n\tprint(n.upper())\r\nelif count1>=count2:\r\n\tprint(n.lower())\t\t", "x = input()\r\nlow = 0\r\nupper = 0\r\nfor i in x :\r\n if ord(i) > 96 :\r\n low += 1\r\n else :\r\n upper += 1\r\n\r\nif upper > low :\r\n print(x.upper())\r\nelse :\r\n print(x.lower())\r\n", "s = input()\r\nc = 0\r\nd = 0\r\nfor i in s:\r\n if i == i.upper():\r\n c = c+1\r\n elif i == i.lower():\r\n d = d+1\r\n else:\r\n print(s.lower())\r\nif c>d:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "word = input()\r\n\r\nup_count = 0\r\nlow_count = 0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n up_count += 1\r\n elif letter.islower():\r\n low_count += 1\r\n\r\nif up_count > low_count:\r\n print(f'{word.upper()}')\r\nelif low_count > up_count:\r\n print(f'{word.lower()}')\r\nelse:\r\n print(f'{word.lower()}')\r\n ", "s=input()\r\ns1=list(s)\r\nz=0\r\nfor i in s1:\r\n\tif ord(i)<97:\r\n\t\tz+=1\r\nif z*2>len(s):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\t\r\n", "slovo, bols_bykv, mal_bykv = input(), 0, 0\r\n\r\nfor nom in range(0,len(slovo)):\r\n if slovo[nom] == slovo[nom].upper():\r\n bols_bykv += 1\r\n else:\r\n mal_bykv += 1\r\n\r\nif mal_bykv > bols_bykv or mal_bykv == bols_bykv:\r\n print(slovo.lower())\r\nelif bols_bykv > mal_bykv:\r\n print(slovo.upper())", "s = input()\r\nu_cnt, l_cnt = 0, 0 \r\nfor i in s:\r\n if i.isupper():\r\n u_cnt += 1 \r\n elif i.islower():\r\n l_cnt += 1 \r\nif u_cnt > l_cnt:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string=input()\r\nlst_string=list(string)\r\nupper=0\r\nlower=0\r\nfor n in range(len(lst_string)):\r\n if string[n].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper > lower:\r\n print(string.upper())\r\nelif upper <= lower:\r\n print(string.lower())\r\n", "st = input()\r\n\r\nbigs = 0\r\nsmalls = 0\r\nfor i in range(len(st)):\r\n if st[i] == st[i].upper():\r\n bigs += 1\r\n else:\r\n smalls += 1\r\n\r\n\r\nif bigs > smalls:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())\r\n\r\n", "a='abcdefghijklmnopqrstuvwxyz'\r\nb=a.upper()\r\nl1=list(a)\r\nl2=list(b)\r\nn=input()\r\nc1=0\r\nc2=0\r\nfor i in n:\r\n if i in l1:\r\n c1+=1\r\n else:\r\n c2+=1\r\nif c1>c2 or c1==c2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\nupcnt = 0\r\nlowcnt = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n upcnt += 1\r\n elif word[i].islower():\r\n lowcnt += 1\r\nif upcnt > lowcnt:\r\n print(word.upper())\r\nelif lowcnt >= upcnt:\r\n print(word.lower())\r\n\r\n\r\n", "s = input()\r\na=0\r\nb=0\r\nfor i in range(len(s)):\r\n\tif s[i] >= 'a': \r\n\t\tb = b+1\r\n\telse:\r\n\t\ta = a+1\r\nif a > b:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "str = input()\r\n\r\n\r\nlower = 0\r\nfor i in range(len(str)):\r\n if(str[i] >= 'a' and str[i] <= 'z'):\r\n lower += 1\r\n if(lower >= len(str)/2):\r\n print(str.lower())\r\n break\r\n if(i == len(str) - 1):\r\n print(str.upper()) \r\n \r\n", "T=input()\r\ncountU=0\r\ncountL=0\r\nfor i in range(len(T)):\r\n if T[i].islower()==True:\r\n countL+=1\r\n else:\r\n countU+=1\r\n\r\nif countL==countU:\r\n \r\n print(T.lower())\r\nif countL>countU:\r\n \r\n print(T.lower())\r\nif countL<countU:\r\n \r\n print(T.upper())\r\n ", "word = input()\r\nu = 0\r\nl = 0\r\nfor ele in word:\r\n if ele.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u>l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "word = input()\r\nsmall_letters = 0 \r\ncapital_letters = 0 \r\nfor letter in word:\r\n if letter.isupper():\r\n capital_letters += 1\r\n else:\r\n small_letters += 1\r\n\r\nif small_letters >= capital_letters: \r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "word = input()\nupper_count = sum(1 for char in word if char.isupper())\nlower_count = len(word) - upper_count\nif upper_count > lower_count:\n print(word.upper())\nelse:\n print(word.lower())\n\n \t\t \t\t \t\t\t\t\t \t \t\t\t\t \t \t", "s = input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):count1+=1\r\n else:count2+=1\r\nif(count1>count2):\r\n print(s.upper())\r\nelse:print(s.lower())", "def word():\r\n st = input()\r\n upp = 0\r\n low = 0\r\n for i in st:\r\n if i == i.lower():\r\n low+=1\r\n else:\r\n upp+=1\r\n if upp==low:\r\n print(st.lower())\r\n elif upp>low:\r\n print(st.upper())\r\n else:\r\n print(st.lower())\r\nword()\r\n \r\n\r\n", "word = input()\r\ni=0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n i+=1\r\n\r\n\r\nprint(word.upper()) if i > len(word)/2 else print(word.lower())\r\n\r\n\r\n", "str=input()\r\ncount,count1=0,0\r\nfor i in range(len(str)):\r\n if(str[i].islower()):\r\n count+=1\r\n if(str[i].isupper()):\r\n count1+=1\r\nif(count > count1 or count==count1):\r\n str=str.lower()\r\nelse:\r\n str=str.upper()\r\nprint(str)\r\n", "str=input()\r\nupper=lower=0\r\nfor i in str:\r\n if(i.isupper()):\r\n upper+=1\r\n else:\r\n lower+=1\r\nif(upper>lower):\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "a = input()\r\na1 = a\r\nb1 = 0\r\nb2 = 0\r\na2 = a\r\na = list(a)\r\na1 = list(a1.upper()) \r\na2 = list(a2.lower())\r\nfor _ in range(len(a)):\r\n\tfor i in range(len(a)):\r\n\t\tif ord(a[i]) != ord(a1[i]):\r\n\t\t\tb1 += 1\r\n\t\tif ord(a[i]) != ord(a2[i]):\r\n\t\t\tb2 += 1\r\nif b1 < b2:\r\n\tprint(*a1, sep=\"\")\r\nelse:\r\n\tprint(*a2, sep=\"\")\r\n", "l = input()\r\nbig_size = 0\r\nsmall_size = 0\r\nfor i in l:\r\n if i.upper() == i:\r\n big_size += 1\r\n else:\r\n small_size += 1\r\nif big_size > small_size:\r\n print(l.upper())\r\nelse:\r\n print(l.lower())", "s=input()\r\nc=0\r\nc1=0\r\nfor i in s:\r\n if(i.islower()):\r\n c+=1\r\n else:\r\n c1+=1\r\nif(c>=c1):\r\n s=s.lower()\r\n print(s)\r\nelse:\r\n s=s.upper()\r\n print(s)", "l=input()\r\nc=0\r\nfor i in l:\r\n if i.upper()==i:\r\n c=c+1\r\nif c > len(l)-c:\r\n print(l.upper())\r\nelse:\r\n print(l.lower())", "a = input()\nu = l = 0\nfor i in a:\n if i.islower(): l += 1\n else: u += 1\nif u > l: print(a.upper())\nelse: print(a.lower())", "line = input()\nuNum = 0\nlNum = 0\nfor ch in line:\n if ch.isupper():\n uNum += 1\n else:\n lNum += 1\nres = ''\nif uNum > lNum:\n print(line.upper())\nelse:\n print(line.lower())", "a=input()\r\ns=0\r\nc=0\r\nfor i in a:\r\n if(i.islower()==True):\r\n s=s+1\r\n elif(i.isupper()==True):\r\n c=c+1\r\nif(s>c):\r\n print(a.lower())\r\nelif(c>s):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\n#print(ord(\"a\"),ord(\"z\"),ord(\"A\"),ord(\"Z\"),ord(\"a\")-ord(\"A\"),ord(\"z\")-ord(\"Z\"))\n\nlow = 0\nup = 0\nfor l in s:\n\tif(ord(l)>=97):\n\t\tlow += 1\n\telse:\n\t\tup += 1\n\nif up>low:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n \t\t \t\t\t\t\t\t\t \t\t\t \t \t\t\t\t\t\t\t\t \t", "a=input()\r\nv=0\r\nV=0\r\nfor i in a:\r\n if i.isupper():\r\n V+=1\r\n if i.islower():\r\n v+=1\r\nif v>=V:\r\n a=a.lower()\r\nelse:\r\n a=a.upper()\r\nprint(a)\r\n", "text = str(input())\nlower = 0\nupper = 0\nfor i in text:\n if(i.islower()):\n lower+=1\n else:\n upper+=1\nif (lower >= upper):\n lc = text.lower()\n print(lc)\nelse:\n uc = text.upper()\n print(uc)\n", "s=input()\nc=0\nl=0\nfor i in s:\n if i.isupper():\n c+=1\n else:\n l+=1\nif c>l:\n print(s.upper())\nelse:\n print(s.lower())\n", "s=input()\r\nh,l=0,0\r\nfor i in s:\r\n if ord(i) >=65 and ord(i) <91:\r\n h+=1\r\n else:\r\n l+=1\r\nif h>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nlow_con = 0\r\nup_con = 0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n low_con += 1\r\n else:\r\n up_con += 1\r\nif low_con >= up_con:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n ", "s=input()\r\nl=len(s)\r\nlow=0\r\nfor i in s:\r\n if 'a'<=i<='z':\r\n low+=1\r\nup=l-low\r\nif up>low:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n", "string = input()\nsmall = 0\nbig = 0\nfor i in range(len(string)):\n if ord(string[i]) < 97:\n big += 1\n else:\n small += 1\n\nif big > small:\n print(string.upper())\nelif small >= big:\n print(string.lower())\n", "alphaL = \"abcdefghijklmnopqrstuvwxyz\"\r\nalphaU = alphaL.upper()\r\n\r\ninp = input()\r\n\r\ncountL = 0\r\ncountU = 0\r\n\r\nfor char in inp:\r\n if char in alphaL:\r\n countL += 1\r\n elif char in alphaU:\r\n countU += 1\r\n\r\nif countL >= countU:\r\n print(inp.lower())\r\nelse: \r\n print(inp.upper())", "str1 = input()\r\nclower = 0\r\ncupper = 0\r\nfor i in str1:\r\n if i.islower():\r\n clower += 1\r\n elif i.isupper():\r\n cupper += 1\r\nif clower >= cupper:\r\n str1 = str1.lower()\r\n print(str1)\r\nelse:\r\n str1 = str1.upper()\r\n print(str1)\r\n", "string = str(input())\r\nstring_upper = sum(1 for i in string if i.isupper())\r\nif string_upper > len(string) - string_upper:\r\n print(string.upper())\r\nelif string_upper < len(string) - string_upper:\r\n print(string.lower())\r\nelse:\r\n print(string.lower())", "word = input()\r\n\r\nl_word = 0\r\nu_word = 0\r\n\r\nfor i in word:\r\n if i.lower() == i:\r\n l_word+=1\r\n else:\r\n u_word+=1\r\n\r\nif l_word < u_word:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n", "s=str(input())\r\nans=f=0\r\nfor i in range(0,len(s)):\r\n if(s[i] == 'a' or s[i] == 'b' or s[i] == 'c' or s[i] == 'd' or s[i] == 'e' or s[i] == 'f' or s[i] == 'g' or\r\n s[i] == 'h' or s[i] == 'i' or s[i] == 'j' or s[i] == 'k' or s[i] == 'l' or s[i] == 'm' or s[\r\n i] == 'n' or s[i] == 'o' or s[i] == 'p' or s[i] == 'q' or s[i] == 'r' or s[i] == 's' or s[\r\n i] == 't' or s[i] == 'u' or s[i] == 'v' or s[i] == 'w' or s[i] == 'x' or s[i] == 'y' or s[\r\n i] == 'z'):\r\n ans+=1\r\n else:\r\n f+=1\r\nif(ans>=f):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n\r\n", "s = input()\no =0\np =0\nfor i in range(len(s)):\n if s[i].isupper() == True:\n o+=1\n else:\n p +=1\nif o>p:\n print(s.upper())\nelse:\n print(s.lower())\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "s = input()\ncount_uppercase = sum(1 for c in s if c.isupper())\ncount_lowercase = len(s) - count_uppercase\n\nif count_uppercase > count_lowercase:\n print(s.upper())\nelse:\n print(s.lower())\n\n\t\t \t\t\t\t \t\t\t\t \t\t\t \t\t \t", "word = input()\r\ncountLowerCase = 0\r\ncountUpperCase = 0\r\nfor i in word:\r\n if(i.islower()):\r\n countLowerCase+=1\r\n else:\r\n countUpperCase+=1\r\nif countLowerCase> len(word)/2 or countLowerCase==countUpperCase:\r\n print(word.lower())\r\nelif countUpperCase> len(word)/2:\r\n print(word.upper())\r\n", "p=input()\r\nc=0\r\nc1=0\r\nfor i in p:\r\n if i.isupper():\r\n c=c+1\r\n else:\r\n c1=c1+1\r\nif c>c1:\r\n print(p.upper())\r\nelse:\r\n print(p.lower())", "str = input()\r\n# str = str.upper()\r\nlst_lower = []\r\nlst_upper = []\r\nfor i in str:\r\n # print(i)\r\n if i == i.upper():\r\n lst_upper.append(i)\r\n if i == i.lower():\r\n lst_lower.append(i)\r\n# print(str)\r\n# print(len(lst_lower))\r\n# print(len(lst_upper))\r\n# print(lst_upper)\r\nif len(lst_lower) < len(lst_upper):\r\n str = str.upper()\r\nelif len(lst_lower) > len(lst_upper):\r\n str = str.lower()\r\nelse:\r\n str = str.lower()\r\nprint(str)\r\n", "word = input() \r\n\r\nlowercase_count = sum(1 for letter in word if letter.islower()) \r\nuppercase_count = len(word) - lowercase_count\r\n\r\nif uppercase_count > lowercase_count:\r\n corrected_word = word.upper()\r\nelse:\r\n corrected_word = word.lower()\r\n\r\nprint(corrected_word) \r\n", "word = str(input())\r\nnumcap = 0\r\nnumlow = 0\r\nfor i in word:\r\n if str(i) == str(i).upper():\r\n numcap += 1\r\n else:\r\n numlow += 1\r\n\r\nif numcap > numlow: print(word.upper())\r\nelse: print(word.lower())", "def countOfUpperLower(s):\r\n u = 0\r\n l = 0\r\n for i in s:\r\n if i.isupper(): u+=1\r\n else: l+=1\r\n if l >= u:\r\n return s.lower()\r\n return s.upper()\r\n\r\ns = input()\r\nprint(countOfUpperLower(s))\r\n", "strg=input()\r\ncount1=0\r\ncount2=0\r\nfor i in strg:\r\n if(i.islower()):\r\n count1=count1+1\r\n elif(i.isupper()):\r\n count2=count2+1\r\nif count1>=count2:\r\n print(strg.lower())\r\nelse:\r\n print(strg.upper())", "y=input()\r\nx=list(y)\r\nc=0\r\nfor i in range(0,len(x)):\r\n if(ord(x[i])>=ord('A') and ord(x[i])<=ord('Z')):\r\n c+=1\r\nif(c>len(x)/2):\r\n\r\n y=y.upper()\r\nelse:\r\n y=y.lower()\r\nprint(y)", "str = input()\r\narr=list(str)\r\narr.sort()\r\ncount=0\r\nfor i in arr:\r\n if(i>'Z'):\r\n break;\r\n count+=1\r\nif(count>len(str)/2):\r\n print(str.upper())\r\nelse:\r\n print(str.lower())\r\n", "w = input().strip()\r\nuc = sum(1 for c in w if c.isupper())\r\nif uc > len(w) / 2:\r\n cw = w.upper()\r\nelse:\r\n cw = w.lower()\r\nprint(cw)", "str1 = input()\r\nsmall = 0\r\ncap = 0\r\nfor i in range(len(str1)):\r\n if(ord(str1[i])>=65 and ord(str1[i])<=90):\r\n cap+=1\r\n else:\r\n small+=1\r\nif(cap>small):\r\n print(str1.upper())\r\nelif(cap<small):\r\n print(str1.lower())\r\nelse:\r\n print(str1.lower())", "#This was submitted to codeforces.com\r\n#If str contains more ucase, then full ucase. Otherwise full lcase.\r\ntxt=input()\r\nn=len(txt)\r\ns,sL=0,0 #Stores the ascii sum\r\nfor i in range(n):\r\n s+=ord(txt[i]) #original string\r\n sL+=ord(txt[i].lower()) #lower case\r\nnUp=(sL-s)//32\r\nnLow=n-nUp\r\nif (nLow > nUp) or (nLow==nUp):\r\n print(txt.lower())\r\nelse:\r\n print(txt.upper())", "s=input()\r\nc=0\r\nfor i in s:\r\n if (ord(i) > 95 ):\r\n c=c+1\r\n\r\nif c>=len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\nupper_count = 0\nlower_count = 0\n\nfor i in word:\n if i.isupper() == True:\n upper_count += 1\n else:\n lower_count += 1\n\nif upper_count > lower_count:\n print(word.upper())\nelse:\n print(word.lower())\n", "b = input()\na = list(b)\nu = 0\nl= 0\nfor i in a:\n c = i.isupper()\n if c == True:\n u+=1\n else:\n l+=1\nif u > l:\n print(b.upper())\nelse:\n print(b.lower())", "n=input()\r\ncu=0\r\ncl=0\r\nfor i in n:\r\n if i.isupper():\r\n cu+=1\r\n else:\r\n cl+=1\r\nif cu>cl:\r\n print(n.upper())\r\nelif cu<cl:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())", "x=input()\r\nlow=0\r\nup=0\r\nfor i in x:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n low+=1\r\n else:\r\n up+=1\r\nif(up>low):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "w=input()\r\nc=0\r\nv=0\r\nfor i in w:\r\n if i.islower():\r\n c+=1\r\n else:\r\n v+=1\r\nif c>=v:\r\n w=w.lower()\r\nelse:\r\n w=w.upper()\r\nprint(w)", "s = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in (s):\r\n if ord(i)>=97 and ord(i)<=122:\r\n count1+=1\r\nfor i in (s):\r\n if ord(i)<=90:\r\n count2+=1\r\nif count1>=count2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nuppercount=0\r\nlowercount=0\r\nfor i in s:\r\n if i.isupper():\r\n uppercount+=1\r\n else:\r\n lowercount+=1\r\nif uppercount > lowercount:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nu,l=0,0\r\nfor x in s:\r\n if x.isupper():\r\n u+=1\r\n elif x.islower():\r\n l+=1\r\nprint([s.lower(),s.upper()][u>l])", "import re\r\ns = input(); m = len(s)//2\r\nif len(re.findall('[A-Z]', s)) > m:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in s:\r\n if i.isupper():\r\n count1 = count1 + 1\r\nfor j in s:\r\n if j.islower():\r\n count2 = count2 + 1\r\nif count1 > count2:\r\n print(s.upper())\r\nelif count2 > count1:\r\n print(s.lower())\r\nelif count1 == count2:\r\n print(s.lower())\r\n\r\n\r\n", "value = input(\"\")\na=0\ns=0\nfor x in value:\n t = x.isupper()\n if(t):\n a+=1\n else:\n s+=1\nif(a>s):\n print(value.upper())\nelse:\n print(value.lower())\n\t \t\t\t\t \t\t \t \t\t\t \t\t\t \t \t", "word = input()\r\nuppercase_count=sum(1 for char in word if char.isupper())\r\nlowercase_count=len(word) - uppercase_count\r\nif uppercase_count > lowercase_count:\r\n new_word=word.upper()\r\nelse:\r\n new_word=word.lower()\r\nprint(new_word)", "s=input()\r\ncount=0\r\ncount1=0\r\nfor i in range (len(s)):\r\n if ord(s[i])<97:\r\n count=count+1\r\n else:\r\n count1=count1+1\r\nif count>count1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\n\nbig = 0\n\nfor letter in word:\n if letter == letter.upper():\n big += 1\n\nif big > len(word) / 2:\n print(word.upper())\n\nelse:\n print(word.lower())\n", "z,zz=input,lambda:list(map(int,z().split()))\nzzz=lambda:[int(i) for i in stdin.readline().split()]\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\nfrom string import *\nfrom re import *\nfrom collections import *\nfrom queue import *\nfrom sys import *\nfrom collections import *\nfrom math import *\nfrom heapq import *\nfrom itertools import *\nfrom bisect import *\nfrom collections import Counter as cc\nfrom math import factorial as f\nfrom bisect import bisect as bs\nfrom bisect import bisect_left as bsl\nfrom itertools import accumulate as ac\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\ndef prime(x):\n p=ceil(x**.5)+1\n for i in range(2,p):\n if (x%i==0 and x!=2) or x==0:return 0\n return 1\ndef dfs(u,visit,graph):\n visit[u]=True\n for i in graph[u]:\n if not visit[i]:\n dfs(i,visit,graph)\n\n###########################---Test-Case---#################################\n\"\"\"\n\n\n\n\"\"\"\n###########################---START-CODING---##############################\n\nfrom math import *\nnum=1\n\nfor i in range( num ):\n s=z()\n up=0\n dw=0\n for i in s:\n if match('[a-z]',i):dw+=1\n else:up+=1\n if up>dw:\n print(s.upper())\n else:\n print(s.lower())\n \n \n \n\n \n \n\n\n\n\n\n\n\n\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n\n \n\n \n \n \n \n \n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n \t\t\t\t \t \t\t\t \t\t\t \t\t\t \t \t\t", "n=input()\r\ncountlower=0\r\nfor i in range(len(n)):\r\n if ord(n[i])>=97 and ord(n[i])<=122:\r\n countlower+=1\r\nif countlower>=len(n)-countlower:\r\n print(n.lower())\r\nelif countlower<len(n)-countlower:\r\n print(n.upper())\r\n \r\n", "s1=input()\r\ncap=0\r\nsmall=0\r\nfor i in range(len(s1)):\r\n if(s1[i].lower()==s1[i]):\r\n small+=1\r\n else:\r\n cap+=1\r\ns2=\"\"\r\nif(small>=cap):\r\n for i in range(len(s1)):\r\n s2+=s1[i].lower()\r\nelse:\r\n for i in range(len(s1)):\r\n s2+=s1[i].upper()\r\nprint(s2)", "s=str(input())\r\na1=0\r\na2=0\r\nb=s.lower()\r\nfor i in range(len(s)):\r\n\tif s[i]==b[i]:\r\n\t\ta1+=1\r\n\telse:\r\n\t\ta2+=1\r\nif a2>a1:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(b)", "string = str(input())\r\n\r\ncu = 0\r\ncl = 0\r\n\r\nfor items in string:\r\n if items.isupper():\r\n cu = cu + 1\r\n elif items.islower():\r\n cl = cl + 1\r\n\r\nif cl>=cu:\r\n string = string.lower()\r\nelif cu>cl:\r\n string = string.upper()\r\n\r\nprint(string)", "s = input()\r\n\r\nup = 0 \r\nlw = 0\r\nfor c in s:\r\n if c.isupper():\r\n up += 1\r\n else:\r\n lw += 1\r\n\r\nif up > lw:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 solution to 59A Word.\"\"\"\r\n\r\n\r\ndef solution():\r\n s = input()\r\n\r\n n, m = 0, 0\r\n for c in s:\r\n if c.islower():\r\n n += 1\r\n else:\r\n m += 1\r\n\r\n if n < m:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "\r\ns=input(\"\")\r\nlower=0\r\nupper=0\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i].islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nans=\"\"\r\nif (lower==upper or lower>upper):\r\n for i in range(n):\r\n ans+=(s[i].lower())\r\nif upper>lower:\r\n for i in range(n):\r\n ans+=(s[i].upper())\r\nprint(ans)", "s=input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n \r\nif(upper==lower):\r\n print(s.lower())\r\nelif(upper>lower):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n", "\r\ncadena = input()\r\ni = 0\r\nmayusculas=0\r\nminusculas=0\r\nwhile i < len(cadena):\r\n letra = cadena[i]\r\n if letra.isupper() == True:\r\n mayusculas +=1\r\n else:\r\n minusculas +=1\r\n i += 1\r\n\r\nif mayusculas > minusculas:\r\n print(cadena.upper())\r\nelse:\r\n print(cadena.lower())", "alfabeto = ['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\n\r\nentrada = input()\r\ncont = 0\r\n\r\n\r\nfor i in entrada[0:len(entrada)]:\r\n if i in alfabeto:\r\n cont += 1\r\n\r\nif cont == int(len(entrada)/2) or cont < int(len(entrada)/2):\r\n print(entrada.lower())\r\n\r\nif cont > int(len(entrada)/2):\r\n print(entrada.upper())", "string = input().strip()\r\ntmp_upp = 0\r\nfor char in string:\r\n\tif char.isupper(): tmp_upp = tmp_upp + 1\r\nif tmp_upp <= len(string)//2: print(string.lower())\r\nelse: print(string.upper()) ", "\r\nch = input()\r\ns = 0\r\nfor i in ch:\r\n if i.islower():s+=1\r\nif s/len(ch)>=0.5:print(ch.lower())\r\nelse: print(ch.upper())", "str=input()\r\nl,u=0,0\r\nfor i in range(len(str)):\r\n\tif str[i].islower():\r\n\t\tl=l+1\r\n\telse:\r\n\t\tu=u+1\r\nif l==u or l>u:\r\n\tprint(str.lower())\r\nelif l<u:\r\n\tprint(str.upper())", "\r\nstr = input('')\r\ncount = 0\r\ncount_2 = 0\r\nfor i in str:\r\n if ord(i)>=65 and ord(i)<=91:\r\n count+=1\r\n elif ord(i)>=97 and ord(i)<=123:\r\n count_2+=1\r\nif count > count_2:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "#https://codeforces.com/problemset/problem/59/A\r\n\r\nn = input()\r\narr = []\r\nfor i in n:\r\n arr.append(i.isupper())\r\n\r\nprint(n.upper() if len([a for a in arr if a]) > len([a for a in arr if not a]) else n.lower())\r\n", "a = input()\r\nres1 = 0\r\nres2 = 0\r\nfor i in a:\r\n if(i.islower()):\r\n res1 += 1\r\n else:\r\n res2 += 1\r\n\r\nif(res1 >= res2):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\r\na=list(s)\r\nh=0\r\nt=0\r\nfor i in range(len(a)):\r\n if a[i]>='A' and a[i]<='Z':\r\n h=h+1\r\n if a[i]>='a' and a[i]<='z':\r\n t=t+1\r\nif h>t:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = input()\r\nlower = 0\r\nupper = 0\r\nx = len(n)\r\n\r\nfor i in n:\r\n if i.islower() == True:\r\n lower+= 1\r\n\r\n elif i.isupper() == True:\r\n upper += 1\r\n\r\n\r\nif lower < upper:\r\n print(n.upper())\r\nelif lower > upper:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())\r\n\r\n\r\n", "word=input()\r\na=0\r\nfor i in range(len(word)):\r\n if word[i]in'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n a+=1\r\nif a>len(word)/2:word=word.upper()\r\nelse :word=word.lower()\r\nprint(word)\r\n", "x=input()\r\nm=list(x)\r\nup=0\r\nlo=0\r\nfor i in m:\r\n if (i.isupper()==True):\r\n up=up+1\r\n else:\r\n lo=lo+1\r\n\r\n\r\nif (lo<up):\r\n x=x.upper()\r\nelse:\r\n x=x.lower()\r\nprint(x)\r\n \r\n\r\n", "a = input()\r\nb = 0\r\nc = 0\r\nfor i in a:\r\n if i.islower():\r\n b += 1\r\n else:\r\n c += 1\r\nif c > b:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\r\nlwr='abcdefghijklmnopqrstuvwxyz'\r\nupr='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nlcnt=ucnt=0\r\nfor i in s:\r\n if i in lwr:\r\n lcnt+=1\r\n else:\r\n ucnt+=1\r\nif lcnt>=ucnt:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nnu = 0\r\nnl = 0\r\nfor e in s:\r\n if e.isupper():\r\n nu += 1\r\n else:\r\n nl += 1\r\n\r\nif nu > nl:\r\n s = s.upper()\r\n\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)\r\n\r\n", "word = input()\n\nupper = 0\nlower = 0\n\nfor i in word:\n\n if i.isupper():\n upper = upper + 1\n if i.islower():\n lower = lower + 1\n\nif upper > lower:\n print(word.upper())\nelse:\n print(word.lower())\n", "s = input()\ni = sum(map(lambda i: 1 if s[i].islower() else 0, range(len(s))))\nj = sum(map(lambda i: 1 if s[i].isupper() else 0, range(len(s))))\nprint(s.lower() if i >= j else s.upper())\n", "s = input()\r\nq,t = 0,0\r\nfor i in s:\r\n if i.isupper():\r\n q +=1\r\n elif i.islower():\r\n t+=1\r\nif q > t:\r\n p = s.upper()\r\n print(p)\r\nelse:\r\n p = s.lower()\r\n print(p)\r\n", "s=input()\r\ncnt1=0\r\ncnt2=0\r\nfor c in s:\r\n if c.islower():\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\nif cnt1>=cnt2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a = input()\r\nk = 0\r\nl = 0\r\nfor i in a:\r\n if i.isupper():\r\n k += 1\r\n elif i.islower():\r\n l += 1\r\nif k>l:\r\n print(a.upper())\r\nelif k<=l:\r\n print(a.lower())\r\n", "str1 = input()\r\narr = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nbig = 0\r\nmil = 0\r\nfor i in range(len(str1)):\r\n if str1[i] in arr:\r\n big += 1\r\n else:\r\n mil += 1\r\nif big > mil:\r\n print(str1.upper())\r\nelse:\r\n print(str1.lower())", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(n):\r\n if s[i]<'a':\r\n count=count+1\r\nif count>(n/2):\r\n print(s.upper())\r\nelif count==(n/2):\r\n print(s.lower())\r\nelse:\r\n print(s.lower()) ", "def candies(word):\r\n a, b = sum(1 for x in word if x.isupper()), sum(1 for x in word if x.islower())\r\n if a > b:\r\n word = word.upper()\r\n elif a <= b:\r\n word = word.lower()\r\n return word\r\nt = input()\r\nprint(candies(t))", "message = input()\r\n\r\nno_of_lower = sum(1 for char in message if char.islower())\r\nno_of_upper = sum(1 for char in message if char.isupper())\r\n\r\nif no_of_lower >= no_of_upper:\r\n message = message.lower()\r\n print(message)\r\nelse:\r\n message = message.upper()\r\n print(message)\r\n", "s=input()\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if s[i].isupper()==True:\r\n u+=1\r\n if s[i].islower()==True:\r\n l+=1\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "# Read the input word\r\ns = input()\r\n\r\n# Count the number of uppercase and lowercase letters\r\nuppercase_count = sum(1 for letter in s if letter.isupper())\r\nlowercase_count = len(s) - uppercase_count\r\n\r\n# Determine whether to convert to uppercase or lowercase\r\nif uppercase_count > lowercase_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nlo=0\r\nfor i in range(len(s)):\r\n if(s[i]>='a'):\r\n lo=lo+1\r\nhi=len(s)-lo\r\nif(hi>lo):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nnum_uppercase = sum(1 for c in s if c.isupper())\r\nnum_lowercase = sum(1 for c in s if c.islower())\r\nif num_uppercase > num_lowercase:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "s = input()\r\nfirst = []\r\nsecond = []\r\nfor let in s:\r\n if let.isupper():\r\n first.append(let) \r\n else:\r\n second.append(let)\r\nif len(first) > len(second):\r\n print(s.upper())\r\nelif len(first) < len(second):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s = input()\r\nu = len([i for i in s if i.upper() == i])\r\nl = len(s) - u\r\n\r\nprint(s.upper() if u > l else s.lower())", "\r\n\r\nsameer=input();print([sameer.lower(),sameer.upper()][sum(x<'['for x in sameer)*2>len(sameer)])", "s=input()\na=0\nb=0\nif(len(s)>=1 and len(s)<=100):\n\tfor i in s:\n\t\tif(i.islower()):\n\t\t\ta = a +1\n\t\telif(i.isupper()):\n\t\t\tb = b + 1\n\t#print(a)\n\t#print(b)\n\tif(a > b):\n\t\tprint(s.lower())\n\telif(a < b):\n\t\tprint(s.upper())\n\telse:\n\t\tprint(s.lower())\n\n \t \t\t\t \t\t \t\t \t\t \t\t \t", "a = input()\r\nu=0\r\nl=0\r\nfor i in a:\r\n if(i.isupper()):\r\n u+=1\r\n elif(i.islower()):\r\n l+=1\r\nif(u>l):\r\n print(a.upper())\r\nelif(u<=l):\r\n print(a.lower())", "u=input()\r\n#xdcfvb\r\na=0\r\nc=0\r\nfor i in u:\r\n if(i.islower()):\r\n a+=1\r\n else:\r\n c+=1\r\nif(a>c):\r\n print(u.lower())\r\nelif(a==c):\r\n print(u.lower())\r\nelse:\r\n print(u.upper())\r\n \r\n\r\n", "n = list(input())\r\nc = \"\".join(n)\r\nup = 0\r\nlow = 0\r\nfor i in n:\r\n if i.isupper() == True:\r\n up += 1\r\n if i.islower() == True:\r\n low += 1\r\nif low > up:\r\n c = c.lower()\r\nelif up> low:\r\n c = c.upper()\r\nelse:\r\n c = c.lower()\r\nprint(c)", "s = input()\r\nlow = 0\r\nhigh = 0\r\nfor i in s:\r\n if i.isupper():\r\n high += 1\r\n else:\r\n low += 1\r\nif low >= high:\r\n s = s.lower()\r\n print(s)\r\nelse:\r\n print(s.upper())", "p=input()\ns1=0\ns2=0\n\nfor a in p:\n if(a.islower()):\n s1+=1\n elif(a.isupper()):\n s2+=1\n \nif(s2>s1):\n print(p.upper())\nelif(s1>s2):\n print(p.lower())\nelse:\n print(p.lower())\n\t \t \t \t\t \t \t\t\t\t \t\t \t\t", "string = input()\r\ntotalsmall = 0\r\ntotalupper = 0\r\nfor i in range(len(string)):\r\n if string[i] == string[i].upper():\r\n totalupper = totalupper +1\r\n else:\r\n totalsmall = totalsmall +1\r\n\r\nif totalupper == totalsmall:\r\n string = string.lower()\r\nelif totalupper > totalsmall:\r\n string = string.upper()\r\nelse:\r\n string = string.lower()\r\nprint(string)\r\n\r\n", "import string\r\nvalue = input()\r\n\r\na = len([letter for letter in value if letter.isupper()])\r\n\r\nif a>len(value)//2:\r\n print (value.upper())\r\nelse:\r\n print(value.lower())", "s = input()\r\n\r\nn = len(s)\r\nl = 0\r\nfor i in s:\r\n if i.islower():\r\n l += 1\r\n\r\nif l >= n/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "def low(s):\r\n return s.lower()\r\n \r\ndef up(s):\r\n return s.upper()\r\n \r\ns = input()\r\nl = u = 0\r\n\r\nfor i in s:\r\n if(ord(i) >= 65 and ord(i) <= 90):\r\n u += 1\r\n \r\n else:\r\n l += 1\r\n \r\nif( l >= u):\r\n print(low(s))\r\n \r\nelse:\r\n print(up(s))", "In=input()\r\nu=0\r\nl=0\r\nfor i in In:\r\n if i.islower():\r\n l=l+1\r\n else:\r\n u=u+1\r\nif l==u:\r\n print(In.lower())\r\nelif l>u:\r\n print(In.lower())\r\nelse:\r\n print(In.upper())\r\n", "def pera(s):\n x = 0\n for c in s:\n if ord(c)&32!=0:\n x+=1\n return x\n\nst = input()\nn = len(st)\np = pera(st)\nq = n-p\nif p>=q:\n print(st.lower())\nelse:\n print(st.upper())\n", "s=input()\r\ncount=0\r\nfor i in s:\r\n if i>'Z':\r\n count+=1\r\nif count*2<len(s):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "# http://codeforces.com/problemset/problem/271/A\r\n# http://codeforces.com/problemset/problem/275/A\r\n# http://codeforces.com/problemset/problem/59/A\r\n\"\"\"\r\nThis is a question from codeforces.\r\n\"\"\"\r\n\r\n\r\ndef is_distinct(number: int) -> bool:\r\n \"\"\"\r\n :param number: input integer\r\n :return: boolean true/false\r\n \"\"\"\r\n key_map = [0] * 10\r\n\r\n while number:\r\n num = number % 10\r\n if key_map[num]:\r\n return False\r\n key_map[num] = 1\r\n number //= 10\r\n\r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n small, big = 0, 0\r\n for ch in s:\r\n if ord('a') <= ord(ch) <= ord('z'):\r\n small += 1\r\n elif ord('A') <= ord(ch) <= ord('Z'):\r\n big += 1\r\n\r\n if small >= big: # implies there are more or equal uppercase char than lowercase char\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n", "n=input()\r\nl,u=0,0\r\nfor i in n:\r\n if (i>='a'and i<='z'):\r\n l+=1\r\n if (i>='A'and i<='Z'):\r\n u+=1\r\nif u>l:\r\n print(n.upper())\r\nelif l==u:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())", "word = input()\r\nUpperCount =0\r\nLowerCount =0\r\nfor letter in word:\r\n if letter == letter.upper(): \r\n UpperCount = UpperCount + 1\r\n else:\r\n LowerCount = LowerCount + 1\r\nif UpperCount > LowerCount:\r\n\t\tprint(word.upper())\r\nelse:\r\n\tprint(word.lower())\r\n", "def chcase(s):\r\n m=0\r\n for i in s:\r\n if (i.isupper()):\r\n m=m+1\r\n if (m>(len(s)-m)):\r\n return s.upper()\r\n else:\r\n return s.lower()\r\nstri=input()\r\nprint(chcase(stri))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Mar 29 03:20:12 2020\n\n@author: mac\n\"\"\"\n\n\ns = input()\nupper = 0\nlower = 0\nfor i in range(len(s)):\n if s[i].isupper():\n upper += 1\n elif s[i].islower():\n lower += 1\nif upper> lower:\n print(s.upper())\nelse:\n print(s.lower())\n ", "str=input()\r\ncountup=0\r\ncountlo=0\r\nfor i in range(len(str)):\r\n if(str[i].isupper()==True):\r\n countup+=1\r\n else:\r\n countlo+=1\r\nif(countup>countlo):\r\n print(str.upper())\r\nelif(countup==countlo):\r\n print(str.lower())\r\nelse:\r\n print(str.lower())", "\r\ns = input()\r\nl = 0\r\nfor i in s:\r\n if ord(i) <= 122 and ord(i)>=97:\r\n l += 1\r\n\r\nu = len(s)-l\r\n\r\nif u > l:\r\n print(s.upper())\r\nelif u < l:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s = input()\nku = 0\nkl = 0\nfor i in s:\n if ord(i) >= 97:\n kl += 1\n else:\n ku +=1\n\nif ku == kl:\n print(s.lower())\nelif kl < ku:\n print(s.upper())\nelse:\n print(s.lower())\n", "s=input()\r\nup=0\r\nlow=0\r\nfor i in range(len(s)):\r\n\tif s[i].isupper()==True:\r\n\t\tup+=1\r\n\telse:\r\n\t\tlow+=1\r\nif up>low:\r\n\ts=s.upper()\r\nelse:\r\n\ts=s.lower()\r\nprint(s)", "def main():\r\n word = input()\r\n lowercase = 0\r\n uppercase = 0\r\n for c in word:\r\n if c.isupper():\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\n\r\n if uppercase > lowercase:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n\r\nif __name__ == \"__main__\":\r\n main()", "ans = input()\r\n\r\nlower_count = sum(map(str.islower, ans))\r\nupper_count = sum(map(str.isupper, ans))\r\n\r\nif lower_count >= upper_count:\r\n print(ans.lower())\r\nelse:\r\n print(ans.upper())\r\n", "x=input(\"\")\r\nupper=[]\r\nlower=[]\r\nfor char in x:\r\n if char.isupper():\r\n upper.append(char)\r\n elif char.islower():\r\n lower.append(char)\r\nif len(lower)>=len(upper):\r\n print(x.lower())\r\nelif len(upper)>len(lower):\r\n print(x.upper())\r\n", "x=input(\"\") #Enter the String\r\nu=0\r\nl=0\r\nfor i in range(0,len(x)):\r\n if x[i].isupper():\r\n u=u+1\r\n else:\r\n l=l+1\r\nif l>=u:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s=input()\r\ns1=s.upper()\r\nc=0\r\nfor i in range(len(s)):\r\n\tif s[i]==s1[i]:\r\n\t\tc+=1\r\nif c>len(s)//2:\r\n\tprint(s1)\r\nelse:\r\n\tprint(s.lower())", "s=str(input())\nc,d=0,0\nfor i in s:\n if(ord(i)<=96 and ord(i)>=65):\n c+=1 \n else:\n d+=1 \nif(c>d):\n print(s.upper())\nelse:\n print(s.lower())\n\n\t\t\t \t\t \t\t \t \t\t \t \t \t\t\t", "word, up, low = input(), 0, 0\r\nfor letter in word:\r\n if letter.upper() == letter:\r\n up += 1\r\n else:\r\n low += 1\r\nprint(word.lower() if low >= up else word.upper())\r\n", "# cook your dish here\r\n\r\nn=input()\r\nu=0\r\nl=0\r\nfor i in range(len(n)):\r\n if(ord(n[i])<=90 and ord(n[i])>=65):\r\n u+=1\r\n elif(ord(n[i])>=97 and ord(n[i])<=122):\r\n l+=1\r\nif(u>l):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "import string \r\na,b=0,0\r\ns=str(input())\r\nfor i in range(len(s)):\r\n if(s[i]>='a' and s[i]<='z'):\r\n a+=1 \r\n elif(s[i]>='A' and s[i]<='Z'):\r\n b+=1 \r\n else:\r\n pass\r\nif(a>=b):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def solve(s):\r\n cnt = 0\r\n for i in range(len(s)):\r\n if s[i] >= 'A' and s[i] <= 'Z': cnt += 1\r\n if cnt > len(s) - cnt: return s.upper()\r\n return s.lower()\r\nprint(solve(input()))", "str=input()\r\ncnt_upper=0\r\ncnt_lower=0\r\nfor n in str:\r\n if n.isupper():\r\n cnt_upper+=1\r\n else:\r\n cnt_lower+=1\r\nif cnt_upper>cnt_lower:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())\r\n \r\n ", "s=input()\r\ncount_BIG=0\r\ncount_LOW=0\r\nfor i in s:\r\n if i>='A' and i<='Z':\r\n count_BIG+=1\r\n if i>='a' and i<='z':\r\n count_LOW+=1\r\nif count_LOW>=count_BIG:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import sys\n\n\ndef main():\n s = sys.stdin.readline().strip()\n n = 0\n\n for character in s:\n if character.isupper():\n n += 1\n else:\n n -= 1\n\n return s.upper() if n > 0 else s.lower()\n\n\nif __name__ == '__main__':\n print(main())\n", "s=input()\r\nc=sm=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n sm+=1\r\n else:\r\n c+=1\r\nif c>sm:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncount=0\r\n\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n count += 1\r\n\r\nif count >= len(s)-count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "# cook your dish here\ns = input()\ncount_uppercase = 0\nfor i in s:\n if ord(i) in range(65,91):\n count_uppercase += 1 \ncount_lowercase = len(s) - count_uppercase\nif count_uppercase <= count_lowercase:\n z = s.lower()\nelse:\n z = s.upper()\nprint(z)\n ", "Word = input()\r\n \r\nlower = 0\r\nupper = 0\r\n \r\nfor char in Word:\r\n if char.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n Word = Word.upper()\r\nelse:\r\n Word = Word.lower()\r\n \r\nprint(Word)", "str=input()\r\nu=len([s for s in str if s.isupper()])\r\nl=len([s for s in str if s.islower()])\r\nif u>l:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())\r\n", "text = input('')\r\n\r\n\r\ncount_upper = 0\r\nfor l in text:\r\n if l.isupper():\r\n count_upper += 1\r\n\r\nprint(text.upper() if count_upper > (len(text)//2) else text.lower())", "a=list(input())\r\nz1=0\r\nz2=0\r\nfor i in a:\r\n if ord(i)>=65 and ord(i)<=90:\r\n z1+=1\r\n else:\r\n z2+=1\r\nif z1>z2:\r\n for i in range(len(a)):\r\n if ord(a[i])>=97:\r\n a[i]=chr(ord(a[i])-97+65)\r\nelse:\r\n for i in range(len(a)):\r\n if ord(a[i])<=90:\r\n a[i]=chr(ord(a[i])-65+97)\r\nprint(*a, sep='')", "st = input()\r\ncount_lower,count_upper = 0,0\r\nfor i in range(len(st)):\r\n if st[i] == st[i].lower():\r\n count_lower += 1\r\n else:\r\n count_upper += 1\r\nif count_lower >= count_upper:\r\n st = st.lower()\r\nelse:\r\n st = st.upper()\r\nprint(st)", "s = str(input())\r\nc1,c2 = 0,0\r\nfor i in s:\r\n if i == i.lower():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 < c2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\nc=0\r\nc1=0\r\nfor i in n:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n c1+=1\r\nif c>c1:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "a=input()\nsum1=0#小写\nsum2=0#大写\nfor i in range(len(a)):\n if a[i]==a[i].lower():\n sum1+=1\n else:\n sum2+=1\nif sum1>=sum2:\n print(a.lower())\nelse:\n print(a.upper())\n", "s = str(input())\nup = 0\nlow = 0\nfor i in s:\n\tif i.isupper():\n\t\tup += 1\n\telse:\n\t\tlow += 1\nif up > low:\n\tprint(s.upper())\nelif up < low:\n\tprint(s.lower())\nelse:\n\tprint(s.lower())", "word=input()\r\nupper=0\r\nlower=0\r\nfor i in word:\r\n if(i.isupper()):\r\n upper+=1\r\n else:\r\n lower+=1\r\nprint(word.upper() if lower<upper else word.lower())", "data=input()\r\nup=0\r\nlw=0\r\nfor i in data:\r\n if 65<=ord(i)<=90:\r\n up+=1\r\n else:\r\n lw+=1\r\nif up>lw:\r\n print(data.upper())\r\nelse:\r\n print(data.lower())\r\n", "word = input()\r\ncountUpper = 0\r\nfor char in word:\r\n if char.isupper():\r\n countUpper += 1\r\nif countUpper > len(word) // 2:\r\n newString = \"\"\r\n for char in word:\r\n newString += char.upper()\r\n print(newString)\r\nelse:\r\n newString = \"\"\r\n for char in word:\r\n newString += char.lower()\r\n print(newString)", "s = input()\r\nucount = 0\r\nlcount = 0\r\nfor i in s:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n ucount += 1\r\n else:\r\n lcount += 1\r\nif ucount > lcount:\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "a = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor x in a:\r\n if x.isupper():\r\n upper += 1\r\n elif x.islower():\r\n lower += 1\r\n else:\r\n pass\r\nif upper > lower:\r\n a = a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a) ", "'''\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'''\ns=input();\nprint([s.lower(),s.upper()][sum(x<'['for x in s)*2>len(s)])", "# https://codeforces.com/contest/59/problem/A\r\n\r\ns = input()\r\nnbMaj = sum(1 for c in s if 'A' <= c and c <= 'Z')\r\nnbMin = len(s) - nbMaj\r\nprint(s.upper() if nbMaj > nbMin else s.lower())\r\n", "word = input()\nupper_count = 0\nlower_count = 0\nfor i in word:\n if i.isupper():\n upper_count += 1\n else:\n lower_count += 1\nif(upper_count > lower_count):\n print(word.upper())\nelse:\n print(word.lower())\n", "text = str(input())\r\nup = 0\r\nlow = 0\r\nfor i in text:\r\n if \"A\" <= i <= \"Z\":\r\n up += 1\r\n else:\r\n low += 1\r\nif up > low:\r\n print(text.upper())\r\nelse:\r\n print(text.lower())\r\n", "try:\r\n w=input(\"\")\r\n c1=0\r\n c2=0\r\n a=['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\n b=['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\n for i in w:\r\n if i in a:\r\n c1+=1\r\n else:\r\n c2+=1\r\n if c2<=c1:\r\n print(w.lower())\r\n else:\r\n print(w.upper())\r\nexcept:\r\n pass", "n=input()\r\ndi={\"u\":0,\"l\":0}\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n di[\"u\"]+=1\r\n else:\r\n di[\"l\"]+=1\r\nif di[\"l\"] >=di[\"u\"]:\r\n n=n.lower()\r\n print(n)\r\nelse:\r\n n=n.upper()\r\n print(n)\r\n ", "def solve():\r\n string = input()\r\n uppercase = 0\r\n lowercase = 0\r\n for c in string:\r\n if(c.isupper()):\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\n if(uppercase > lowercase):\r\n print(string.upper())\r\n else:\r\n print(string.lower())\r\n\r\nif __name__ == '__main__':\r\n solve()", "str = input()\r\nl = u = 0\r\nfor i in str:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u == l:\r\n print(str.lower())\r\nelif l < u:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "s = input()\r\nc = 0\r\nfor i in s:\r\n if i.islower():\r\n c += 1\r\nif c >= len(s)-c:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=input()\r\ncount=0\r\nfor i in s:\r\n if(i.islower()):\r\n count=count+1\r\nif(count>=(len(s)-count)):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = [i for i in input()]\r\nl, u = 0, 0\r\nfor x in range(len(s)):\r\n if s[x].islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif l == u:\r\n print(''.join(s).lower())\r\nelif l < u:\r\n print(''.join(s).upper())\r\nelse:\r\n print(''.join(s).lower())", "def main():\r\n lower= []\r\n upper= []\r\n username= str(input())\r\n for char in username:\r\n if char.isupper():\r\n upper.append(char)\r\n continue\r\n lower.append(char)\r\n continue\r\n if not len(upper)> len(lower):\r\n return print(username.lower())\r\n return print(username.upper())\r\n \r\nif __name__ == '__main__':\r\n\tmain()", "s=list(input())\r\nuppercase=0\r\nlowercase=0\r\nfor i in range(len(s)):\r\n if ord(s[i]) in range(65,91):\r\n uppercase+=1\r\n else:\r\n lowercase+=1\r\noutput=''.join(s)\r\nif lowercase>=uppercase:\r\n print(output.lower())\r\nelse:\r\n print(output.upper())", "s=str(input())\r\nf1=0\r\nf2=0\r\nfor i in s:\r\n if i.isupper():\r\n f1+=1\r\n else:\r\n f2+=1\r\nprint(s.lower() if f1<=f2 else s.upper())\r\n \r\n \r\n \r\n \r\n \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\n\r\nno_of_upper = sum(1 for c in string if c.isupper())\r\nif(no_of_upper > len(string) - no_of_upper):\r\n string = string.upper()\r\nelse:\r\n string = string.lower()\r\nprint(string)", "word = input()\r\nuppercase = 0;\r\nfor letter in word:\r\n if letter.isupper():\r\n uppercase += 1\r\n\r\nif uppercase > (len(word) - uppercase):\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)", "S=input()\r\nS1=[x for x in S if x>='A' and x<='Z']\r\nS2=[x for x in S if x>='a' and x<='z']\r\nif len(S1)>len(S2):\r\n print(S.upper())\r\nelse:\r\n print(S.lower())\r\n", "string = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(string)):\r\n if string[i].isupper():\r\n upper += 1\r\n elif string[i].islower():\r\n lower += 1\r\nif upper > lower:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "import re as r\nb = input()\np = \"[A-Z]\"\ncaps = 0\nnocap = 0\nfor c in b:\n if r.search(p, c):\n caps += 1\n else:\n nocap += 1\nif caps > nocap:\n print(b.upper())\nelse:\n print(b.lower())", "s = input()\r\nlet_s = 0\r\nlet_b = 0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n let_s += 1\r\n else:\r\n if 'A' <= i <= 'Z':\r\n let_b += 1\r\nif let_s >= let_b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "n=input()\ncb=0\ncm=0\nfor i in n:\n if ord(i)>90:\n cm+=1\n else:\n cb+=1\nif(cb>cm):\n print(n.upper())\nelse:\n print(n.lower())", "s=input()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n if i.islower():\r\n l+=1\r\nif u>l:\r\n r=s.upper()\r\nelse:\r\n r=s.lower()\r\nprint(r) ", "low=\"abcdefghijklmnopqrstuvwxyz\"\r\nup=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n\r\nlower=0\r\nuppper=0\r\nx=input()\r\n\r\nfor i in x:\r\n if i in low:\r\n lower+=1\r\n else:\r\n uppper+=1\r\n\r\nif lower>=uppper:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "l = 0\r\nu = 0\r\nw = input()\r\n\r\nfor i in w:\r\n if i.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif l > u:\r\n print(w.lower())\r\nelif l < u:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "s=str(input())\r\nx=0\r\ny=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n x=x+1\r\n else:\r\n y=y+1\r\nif(x>y):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\nl = 0\nu = 0\nfor i in s:\n if(i>='a' and i<='z'):\n l+=1\n else:\n u+=1\nif(l>=u):\n st = \"\"\n for i in s:\n if(i>='a' and i<='z'):\n st+=i\n else:\n st+=(chr(ord(i)+32))\n print(st)\nelse:\n st = \"\"\n for i in s:\n if(i>='A' and i<='Z'):\n st+=i\n else:\n st+=(chr(ord(i)-32))\n print(st)\n", "count1 = 0\r\ncount2 = 0\r\nword = input()\r\nfor i in word:\r\n if i.islower()== True:\r\n count1+=1\r\n elif i.isupper() == True:\r\n count2+=1\r\n\r\nif count1 >= count2:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "word = input()\nlowCnt, upCnt = 0, 0\nfor ch in word:\n if 'a' <= ch and ch <= 'z':\n lowCnt += 1\n else:\n upCnt += 1\nif upCnt > lowCnt:\n word = word.upper()\nelse:\n word = word.lower()\nprint(word)\n \t \t \t\t\t\t \t\t\t\t \t\t \t", "string = input()\r\nup = sum(1 for i in string if i.isupper())\r\nlow = sum(1 for i in string if i.islower())\r\nif (up > low):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s=input()\r\nl,u=0,0\r\nfor i in range(len(s)):\r\n s1=s[i]\r\n if s1.islower():\r\n l=l+1\r\n else:\r\n u=u+1\r\nif l>=u:\r\n s2=''\r\n for i in range(len(s)):\r\n s1=s[i]\r\n if s1.isupper():\r\n s2=s2+chr(ord(s[i])+32)\r\n else:\r\n s2=s2+s1\r\nelse:\r\n s2=''\r\n for i in range(len(s)):\r\n s1=s[i]\r\n if s1.islower():\r\n s2=s2+chr(ord(s[i])-32)\r\n else:\r\n s2=s2+s1\r\nprint(s2)", "word = input()\r\n\r\nlower = 0\r\nupper = 0\r\nresult = \"\"\r\n\r\nfor i in word:\r\n if \"A\" <= i <= \"Z\":\r\n upper += 1\r\n elif \"a\" <= i <= \"z\":\r\n lower += 1\r\n \r\nif upper > lower:\r\n for i in word:\r\n if \"A\" <= i <= \"Z\":\r\n result += i\r\n elif \"a\" <= i <= \"z\":\r\n result += chr(ord(i)-32)\r\nelse:\r\n for i in word:\r\n if \"a\" <= i <= \"z\":\r\n result += i\r\n elif \"A\" <= i <= \"Z\":\r\n result += chr(ord(i)+32)\r\n \r\nprint(result)", "s = str(input())\r\ns.split()\r\ncountu = 0\r\ncountl = 0\r\nfor i in s:\r\n if i.isupper():\r\n countu += 1\r\n if i.islower():\r\n countl += 1\r\nif countl > countu:\r\n s = s.lower()\r\nelif countu > countl:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n\r\n", "w = input()\r\nu = 0\r\nl = 0\r\n\r\nfor i in w:\r\n if(i.isupper()):\r\n u += 1\r\n else:\r\n l += 1\r\nif u>l :\r\n print(w.upper())\r\nelse:\r\n print(w.lower())\r\n ", "s=input()\r\nc=0\r\nt=0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n t+=1\r\nif t>=c:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "name = input()\r\n\r\nlower_chars = 0\r\nupper_chars = 0\r\n\r\nfor char in name:\r\n if char.isupper():\r\n upper_chars += 1\r\n continue\r\n\r\n lower_chars += 1\r\n\r\n\r\nprint(name.lower() if lower_chars >= upper_chars else name.upper())", "s=input()\r\n\r\nuc=0\r\nlc=0\r\n\r\nfor char in s:\r\n if char.isupper():\r\n uc+=1\r\n elif char.islower():\r\n lc+=1\r\n \r\nif lc==uc:\r\n print(s.lower())\r\nelif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "text_str = input()\r\narray_str = list(text_str)\r\n\r\nc_upper = 0\r\nc_lower = 0\r\nfor i in range(len(array_str)):\r\n if array_str[i].isupper() == True:\r\n c_upper += 1\r\n else:\r\n c_lower += 1\r\n \r\nif c_upper > c_lower:\r\n print(text_str.upper())\r\nelse:\r\n print(text_str.lower())", "n=input()\r\na=[x for x in n if x>='A' and x<='Z']\r\nb=[x for x in n if x>='a'and x<='z']\r\nif len(a)>len(b):\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n)", "m=(input())\r\nq=w=0\r\nfor i in m:\r\n if i.isupper():\r\n q+=1\r\n else:\r\n w+=1\r\nif q>w:\r\n print (m.upper())\r\nelse:\r\n print (m.lower())", "n = input()\r\nu = [\"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\nl = [\"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\n\r\na, b, = 0, 0 \r\n\r\nfor i in range(len(n)):\r\n if n[i] in u:\r\n a += 1\r\n if n[i] in l:\r\n b += 1\r\n\r\nif a >= b:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "a = input()\r\ncnt0 = 0\r\ncnt1 = 0\r\n\r\nfor i in range(0,len(a)):\r\n if a[i] >= \"A\" and a[i] <= \"Z\":\r\n cnt1=cnt1 + 1\r\n else:\r\n cnt0=cnt0 + 1\r\nif cnt1 <= cnt0:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\nl=0\nu=0\nfor i in s:\n if i==i.lower():\n l+=1\n else:\n u+=1\nif l==u or l>u:\n print(s.lower())\nelse:\n print(s.upper())\n\t\t \t\t\t\t\t \t \t \t \t\t\t \t \t \t", "inp=input()\r\ncount1=0\r\ncount2=0\r\nfor i in inp:\r\n if(ord(i) >= 65 and ord(i) <= 90 ):\r\n count1=count1+1\r\n else:\r\n count2=count2+1\r\n \r\nif(count1 > count2):\r\n print(inp.upper())\r\nelse:\r\n \r\n\r\n print(inp.lower())", "a=input()\r\nbig=0\r\nfor x in range(len(a)):\r\n if 'A'<=a[x]<='Z':\r\n big=big+1\r\n\r\nif big>len(a)-big:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\nvals = [char.islower() for char in s]\n\nif vals.count(True) >= vals.count(False):\n\tprint(s.lower())\n\nelse:\n\tprint(s.upper())", "word=input()\r\nnumberOfUpper=0\r\nfor letter in word:\r\n if letter==letter.upper():\r\n numberOfUpper+=1\r\nif ((len(word)-numberOfUpper)<numberOfUpper):\r\n print(word.upper())\r\nelse : print(word.lower())", "s=input()\r\nl='abcdefghijklmnopqrstuvwxyz'\r\nL=l.upper()\r\nlc,Lc=0,0\r\nfor e in s:\r\n if e in l:lc+=1\r\n elif e in L:Lc+=1\r\nif lc>=Lc:print(s.lower())\r\nelif lc<Lc:print(s.upper())", "s = str(input())\r\nuppercase = 0\r\nlowercase = 0\r\nfor char in s:\r\n if char.isupper():\r\n uppercase +=1\r\n else:\r\n lowercase +=1\r\nif uppercase>lowercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "import re\r\nn=str(input())\r\nx=re.findall('[A-Z]',n)\r\ny=re.findall('[a-z]',n)\r\nif(len(x)>len(y)):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "k = input()\r\ninp = [str(i) for i in k]\r\nc_count = 0\r\nl_count = 0\r\nfor i in inp:\r\n if i.isupper():\r\n c_count += 1\r\n else:\r\n l_count += 1\r\nif c_count > l_count:\r\n print(k.upper())\r\nelif c_count <= l_count:\r\n print(k.lower())", "def get_number (string, small, capital):\r\n\r\n allChars = list(string)\r\n if len(allChars) == 0:\r\n return \"smaller\" if small >= capital else \"bigger\"\r\n\r\n firstWord = ord(allChars[0])\r\n \r\n\r\n if firstWord >= 97 and firstWord <= 122:\r\n small += 1\r\n del allChars[0]\r\n return get_number(allChars, small, capital)\r\n else:\r\n capital += 1\r\n del allChars[0]\r\n return get_number(allChars, small, capital)\r\n\r\n\r\nstring = input()\r\n\r\nx = 0\r\ny = 0\r\n\r\nif get_number(string, x, y) == \"smaller\":\r\n print(string.lower())\r\n\r\nelse:\r\n print(string.upper())\r\n\r\n\r\n\r\n", "a = (input())\r\n\r\nc = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i]==a[i].upper():\r\n c = c+1\r\n\r\nif c > (len(a))/2:\r\n print(a.upper())\r\nelse:print(a.lower())", "word = input()\r\nupcase_count = sum(1 for char in word if char.isupper())\r\nlowcase_count = len(word) - upcase_count\r\nif upcase_count > lowcase_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "nums=str(input())\r\nl=0\r\nu=0\r\nfor i in nums:\r\n if i.islower():\r\n l +=1\r\n else:\r\n u+=1\r\nif l==u or l>u:\r\n print(nums.lower())\r\nelse:\r\n print(nums.upper())", "p = input()\r\n\r\nmayus=0\r\nminus=0\r\n\r\nfor l in p:\r\n if l.islower():\r\n minus+=1\r\n elif l.isupper():\r\n mayus+=1\r\n\r\nif minus>mayus:\r\n print(p.lower())\r\nif minus<mayus:\r\n print(p.upper())\r\nif minus==mayus:\r\n print(p.lower())", "s = input()\r\nprint(s.upper() if sum([ord(x) < 97 for x in s]) > len(s) // 2 else s.lower())\r\n\r\n\r\n\r\n\r\n\r\n", "word = input()\nmalenkie = 0\nbolshie = 0\n\nfor letter in word:\n if letter.isupper(): # если большая\n bolshie += 1\n elif letter.islower(): # если маленькая\n malenkie += 1\n\nif bolshie > malenkie:\n word = word.upper()\nelse: # сказано, что даже если кол-во равное, то все маленькие\n word = word.lower()\nprint(word)", "low_case = ['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\nup_case = [\"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\nword = input()\r\nlist_word = [x for x in word]\r\n\r\nsumL, sumU = 0, 0\r\nfor x in low_case:\r\n sumL += list_word.count(x)\r\nfor x in up_case:\r\n sumU += list_word.count(x)\r\nif sumL < sumU:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "m = input()\r\nn = len(m)\r\ncounter = 0\r\nfor _ in m:\r\n if _ >= 'a' and _ <='z':\r\n counter = counter + 1\r\nif counter >= (n/2):\r\n print(m.lower())\r\nelse:\r\n print(m.upper())", "x=input()\r\nalaphaCaptial='ASDFGHJKLZXCVBNMQWERTYUIOP'\r\nalaphaSmall='asdfghjklzxcvbnmqwertyuiop'\r\nalaphaNumber=0\r\nsmallNumber=0\r\n#search if\r\nfor i in range(len(x)):\r\n if x[i] in alaphaCaptial :\r\n alaphaNumber+=1\r\n elif x[i] in alaphaSmall:\r\n smallNumber+=1\r\nif alaphaNumber>smallNumber :\r\n print(x.upper())\r\nelif alaphaNumber==smallNumber :\r\n print(x.lower())\r\nelse:\r\n print(x.lower())", "s = input()\r\na = 0\r\nb = 0\r\nfor i in s:\r\n if i.isupper():\r\n a += 1\r\n elif i.islower():\r\n b += 1\r\n\r\nif a > b:\r\n s = s.upper()\r\n print(s)\r\nelse:\r\n s = s.lower()\r\n print(s)\r\n", "s = input()\r\ntotal = len(s)\r\nuppers = 0\r\nfor c in s:\r\n if c.isupper():\r\n uppers += 1\r\n\r\n\r\nif uppers > total // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x=input()\r\nl=len(x)\r\ni=a=b=0\r\nwhile i<l:\r\n if x[i]==x[i].lower():\r\n a=a+1\r\n else:\r\n b=b+1\r\n i=i+1\r\nif b>a:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "import re\n\ns = input()\n\nprint(s.upper() if (len(re.findall(r'[A-Z]', s)) > len(re.findall(r'[a-z]', s))) else s.lower())\n", "s = input()\r\n\r\nl=0\r\nh = 0\r\nfor i in s:\r\n if(i.islower()):\r\n l=l+1\r\n if(i.isupper()):\r\n h +=1\r\n\r\nif ( l >= h ):\r\n print( s.lower())\r\n\r\nif (l < h):\r\n print(s.upper())", "s = input()\r\nup =0\r\nlow =0\r\nfor ch in s:\r\n if ord(\"a\")<=ord(ch)<=ord(\"z\"):\r\n low+=1\r\n else:\r\n up+=1\r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nn1=0\r\nn2=0\r\nfor i in range(len(s)):\r\n if ord(s[i])<97:\r\n n1=n1+1\r\n else:\r\n n2=n2+1\r\nif n1>n2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = input()\r\nup = 0\r\ndown = 0\r\n\r\n\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n up += 1\r\n if n[i].islower():\r\n down += 1\r\nif down >= up:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word=input(\"\")\r\nnew_word=\"\"\r\nuppercase=0\r\nlowercase=0\r\nfor i in word:\r\n if ord(i)>=65 and ord(i)<=90:\r\n uppercase+=1 \r\n elif ord(i)>=97 and ord(i)<=122:\r\n lowercase+=1 \r\nif uppercase>lowercase:\r\n for i in word:\r\n if ord(i)>=97 and ord(i)<=122:\r\n new_word+=chr(ord(i)-32)\r\n else:\r\n new_word+=i\r\nelif uppercase<=lowercase:\r\n for i in word:\r\n if ord(i)>=65 and ord(i)<=90:\r\n new_word+=chr(ord(i)+32)\r\n else:\r\n new_word+=i\r\nprint(new_word)", "word = input()\r\nupperCounter = 0\r\nlowerCounter = 0\r\nfor i in range(0, len(word)):\r\n if word[i].isupper() == True:\r\n upperCounter += 1\r\n else:\r\n lowerCounter += 1\r\nif upperCounter == lowerCounter:\r\n print(word.lower())\r\nelif upperCounter > lowerCounter:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nf = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == s[i].lower():\r\n f += 1\r\nif f >= (len(s) - f):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "s = input()\r\nl = [x for x in s if x.islower()]\r\nu = [x for x in s if x.isupper()]\r\nif len(u) > len(l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input( )\r\n\r\nlowers = 0\r\n\r\nfor i in word:\r\n if i.islower():\r\n lowers+=1\r\n\r\nupper = len(word) - lowers;\r\n\r\n\r\nif lowers >= upper:\r\n print(word.lower())\r\nelif lowers < upper:\r\n print(word.upper())\r\n \r\n", "CHIR = input()\r\nr1s = 0\r\nr2s = 0\r\nfor SDF in CHIR:\r\n if SDF.isupper() == True:\r\n r1s += 1\r\n else:\r\n r2s += 1\r\nif r1s > r2s:\r\n CHIR = CHIR.upper()\r\nelse:\r\n CHIR = CHIR.lower()\r\nprint(CHIR)", "import re\r\na=input()\r\nb=re.findall('[A-Z]',a)\r\nif len(b)>len(a)-len(b):\r\n print(a.upper())\r\nelse:print(a.lower())", "word = input()\r\n\r\nnum_uppercase = 0\r\nnum_lowercase = 0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n num_uppercase += 1\r\n else:\r\n num_lowercase += 1\r\n\r\nif num_uppercase > num_lowercase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "st=input()\r\nn=len(st)\r\nu=0\r\nl=0\r\nfor i in st:\r\n if i ==i.upper():\r\n u+=1\r\n elif i==i.lower():\r\n l+=1\r\n\r\nif l>=u:\r\n print(st.lower())\r\nelif l<u:\r\n print(st.upper())\r\n", "word = input()\nWORD = word.upper()\ndi = 0\nfor i in range(len(word)):\n if word[i] != WORD[i]:\n di += 1\nif di < len(word) - di:\n print(WORD)\nelse:\n print(word.lower())\n", "n = input()\r\ncaps = 0\r\nlows = 0\r\nfor i in n:\r\n if ord(i)<97: caps+=1\r\n else: lows+=1\r\nif lows<caps: print(n.upper())\r\nelse: print(n.lower())", "def getTarget(s):\r\n i, j = 0, 0\r\n for c in list(s):\r\n if c.isupper():\r\n i+=1\r\n if c.islower():\r\n j+=1 \r\n \r\n return 'lowercase' if j >= i else 'uppercase'\r\n\r\ndef translate(s):\r\n target = getTarget(s)\r\n\r\n if target == 'lowercase':\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n\r\ns = input()\r\ntranslate(s)", "n = input()\r\na,b = 0,0\r\nfor i in n:\r\n\tif i == i.lower():\r\n\t\ta+=1\r\n\telif i == i.upper():\r\n\t\tb+=1\r\nif a>=b:\r\n\tprint(n.lower())\r\nelse:\r\n\tprint(n.upper())\r\n", "s=input()\nuc=0\nlc=0\nfor i in s:\n\tif(i.isupper()):\n\t\tuc=uc+1\n\telif(i.islower()):\n\t\tlc=lc+1\nif(uc<=lc):\n\tprint(s.lower())\nelse:\n\tprint(s.upper())\n", "s = input()\r\n\r\nu = l = 0\r\nfor x in list(s):\r\n if x.upper() == x:\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nc1=0\r\nc2=0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n c1+=1\r\n elif a[i].islower():\r\n c2+=1\r\nif c1>c2:\r\n b=a.upper()\r\n print(b)\r\nelse:\r\n c=a.lower()\r\n print(c)", "a = input()\r\nbigger = 0\r\nsmaller = 0\r\ntemp = ''\r\ntemp_2 = ''\r\nfor i in range(len(a)):\r\n temp = a[i:i+1]\r\n temp_2 = temp.islower()\r\n if temp_2 == True:\r\n smaller += 1\r\n else:\r\n bigger += 1\r\nif bigger > smaller:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "\r\nword = input()\r\n\r\nupper = 0\r\n\r\nlower = 0\r\n\r\n\r\nfor i in range(len(word)):\r\n\r\n letter = word[i]\r\n if letter == letter.upper():\r\n\r\n upper += 1\r\n\r\n else:\r\n lower += 1\r\n\r\nif lower >= upper:\r\n\r\n print(word.lower())\r\n\r\nelse:\r\n\r\n print(word.upper())\r\n", "s = input()\r\na1 = \"qwertyuiopasdfghjklzxcvbnm\"\r\na2 = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nx1 = 0\r\nx2 = 0\r\nc1 = \"\"\r\nc2 = \"\"\r\nfor i in s:\r\n if i in a1:\r\n x1 += 1\r\n else:\r\n x2 += 1\r\n c1 += i.lower()\r\n c2 += i.upper()\r\nif x1 >= x2:\r\n print(c1)\r\nelse:\r\n print(c2)", "s = input()\r\nlc=sum(l.islower()for l in s)\r\nif lc<len(s)-lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "s = input()\nn_upper = 0\nn_lower = 0\nfor i in s:\n if i.isalpha():\n if i.isupper():\n n_upper +=1\n else:\n n_lower +=1\n\n\nif n_lower >= n_upper:\n print(s.lower())\nelse:\n print(s.upper())", "d = 0\r\nf = 0\r\ns = input()\r\nfor i in s:\r\n if i.islower():\r\n d+=1\r\n elif i.isupper():\r\n f+=1\r\nif d<f:\r\n print(s.upper())\r\nelif d>f:\r\n print(s.lower())\r\nelse:\r\n print(s.lower()) \r\n", "v=input()\r\nlc=uc=0\r\nfor i in v:\r\n\tif i.isupper():\r\n\t\tuc+=1\r\n\telse:\r\n\t\tlc+=1\r\nif lc>=uc:\r\n\tv=v.lower()\r\nelse:\r\n\tv=v.upper()\r\nprint(v)", "s=input()\r\nc=0\r\nfor x in s:\r\n if(x.islower()):\r\n c+=1\r\nif(c>=(len(s)/2)):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "name = input()\r\nu , l = 0, 0\r\nfor i in name:\r\n if i == i.upper():\r\n u += 1\r\n else:\r\n l += 1 \r\nif u > l:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())", "s = input()\r\n\r\nx= s.lower()\r\n\r\ny= s.upper()\r\n\r\nlower =0\r\nupper =0\r\nfor i in range(len(s)):\r\n if s[i] == x[i]:\r\n lower+=1\r\nfor i in range(len(s)):\r\n if s[i] == y [i]:\r\n upper+=1\r\n \r\nif lower>=upper:\r\n print(x)\r\nelse:\r\n print(y)\r\n", "original = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in original:\r\n if i.isupper() == True: upper_count += 1\r\n else: lower_count += 1\r\n\r\nif lower_count >= upper_count: print(original.lower())\r\nelse: print(original.upper())", "s = input()\r\n\r\nn = len(s)\r\ncoun = 0\r\n\r\nfor i in range(n) :\r\n if ord('A') <= ord(s[i]) <= ord('Z') :\r\n coun += 1\r\n\r\nans = ''\r\nif n - coun >= coun : #все маленькие\r\n for i in range(n) :\r\n if ord('A') <= ord(s[i]) <= ord('Z') :\r\n ans = ans + chr(ord(s[i]) + ord('a') - ord('A'))\r\n else :\r\n ans = ans + s[i]\r\nelse : # все большие\r\n for i in range(n) :\r\n if ord('a') <= ord(s[i]) <= ord('z') :\r\n ans = ans + chr(ord(s[i]) + ord('A') - ord('a'))\r\n else :\r\n ans = ans + s[i]\r\n\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Dec 17 10:28:42 2017\r\n\r\n@author: admin\r\n\"\"\"\r\n\r\nword = input()\r\nlowernum = 0\r\nuppernum = 0\r\nfor x in word:\r\n if ord('a')<=ord(x)<=ord('z'):\r\n lowernum += 1\r\n if ord('A')<=ord(x)<=ord('Z'):\r\n uppernum += 1\r\n\r\nif lowernum < uppernum:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)\r\n", "s = input(\"\")\r\ncount = 0\r\nc = 0\r\nfor i in range(len(s)):\r\n if(s[i]==s[i].upper()):\r\n count+=1\r\n else:\r\n c+=1\r\nif(count>c):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=input()\r\nlr=0\r\nur=0\r\nfor i in word:\r\n if i.islower():\r\n lr+=1\r\n else:\r\n ur+=1\r\nif lr>ur or lr==ur:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "a = input()\r\nnum_low = 0\r\nnum_upp = 0\r\n\r\nfor i in a:\r\n if i in \"abcdefghijklmnopqrstuvwxyz\":\r\n num_low += 1\r\n elif i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n num_upp += 1\r\n\r\nif num_upp > num_low:\r\n a=a.upper()\r\nelse:\r\n a=a.lower()\r\n\r\nprint(a)\r\n", "a=input()\r\ns=d=0\r\nfor i in range (len(a)):\r\n if a[i]==a[i].lower():\r\n s+=1\r\n else :\r\n d+=1\r\n\r\nif s>=d:\r\n print(a.lower())\r\nelse :\r\n print(a.upper())\r\n", "string = input()\r\nup=0\r\nlow=0\r\nfor letter in string:\r\n if letter.isupper():\r\n up+=1\r\n elif letter.islower():\r\n low+=1\r\n\r\nif low > up:\r\n print(string.lower())\r\nelif up > low:\r\n print(string.upper())\r\nelif up == low:\r\n print(string.lower())\r\n\r\n\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 10 15:19:49 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nw_ = input()\r\nw = list(w_)\r\nlow = []\r\nupp = []\r\nfor i in w :\r\n if i.lower() == i :\r\n low.append(i)\r\n else:\r\n upp.append(i)\r\nnl = len(low)\r\nnu = len(upp)\r\nif nl >= nu :\r\n print(w_.lower())\r\nelse:\r\n print(w_.upper())", "s = input()\r\ncaps = 0\r\nfor i in s:\r\n caps+=(i.isupper())\r\nif caps>(len(s)-caps):print(s.upper())\r\nelse:print(s.lower())", "st = input()\r\ncount = len(st)\r\nmax = 0\r\nmin = 0\r\nfor i in range(count):\r\n if 'A' <= st[i] <= 'Z':\r\n max += 1\r\n else:\r\n min += 1\r\nif min >= max:\r\n\r\n print(st.lower())\r\nelse:\r\n print(st.upper())\r\n", "string = input()\r\nx, y = 0, 0\r\nfor i in string:\r\n if i.islower():\r\n x += 1\r\n else:\r\n y += 1\r\nif x < y:\r\n string = string.upper()\r\nelif x > y:\r\n string = string.lower()\r\nelse:\r\n string = string.lower()\r\nprint(string)", "def main():\r\n \r\n s = input()\r\n\r\n low = 0\r\n up = 0\r\n\r\n for i in range(len(s)):\r\n if s[i].islower() == True:\r\n low += 1\r\n else:\r\n up += 1\r\n\r\n if low >= up:\r\n s = s.lower()\r\n else:\r\n s = s.upper()\r\n\r\n print(s)\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()", "s = input()\r\nmin = 0\r\ntam = len(s)\r\nfor c in s:\r\n if c.islower():\r\n min += 1\r\nif min >= (tam / 2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = str(input())\r\n\r\ni=0\r\nu=0\r\nl=0\r\n# while i < length :\r\nfor i in range(len(s)):\r\n b = s[i]\r\n if b == b.upper():\r\n u+=1\r\n i+=1\r\n else :\r\n l+=1\r\n i+=1\r\n \r\n \r\nif l >= u :\r\n a = s.lower()\r\n print (a)\r\nelse:\r\n a = s.upper() \r\n print (a)", "s = input()\r\nupper = 0\r\nlower = 0\r\nseparated = list(s)\r\nchecks = s.isalpha()\r\nif len(separated) > 0 and len(separated) < 101 and checks == True:\r\n\tfor x in range(len(separated)):\r\n\t\tletter = separated[x]\r\n\t\tif letter.isupper() == True:\r\n\t\t\tupper+=1\r\n\t\telse:\r\n\t\t\tlower+=1\r\n\tif upper > lower:\r\n\t\tprint(s.upper())\r\n\telse:\r\n\t\tprint(s.lower())\r\n", "s=input()\r\nup=lo=0\r\nfor ch in s:\r\n if ch.isupper():\r\n up+=1\r\n if ch.islower():\r\n lo+=1\r\n\r\nif up>lo:\r\n print(s.upper())\r\nelif up<lo:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 4 20:36:24 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nword = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(word)):\r\n if 65 <= ord(word[i]) <= 90:\r\n upper += 1\r\n else:\r\n lower += 1\r\nif lower < upper:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "a=input()\r\nu=a.upper()\r\nl=a.lower()\r\nx=0\r\ny=0\r\nfor i in range(len(a)):\r\n if a[i]==u[i]:\r\n x+=1\r\n else:\r\n y+=1\r\nif y>x:\r\n print(l)\r\nif x>y:\r\n print(u)\r\nif x==y:\r\n print(l)", "def small(x):\r\n y=\"\"\r\n for i in x:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n y+=chr(ord(i)+32)\r\n else:\r\n y+=i\r\n return y\r\ndef large(x):\r\n y=\"\"\r\n for i in x:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n y+=chr(ord(i)-32)\r\n else:\r\n y+=i\r\n return y \r\n \r\nn=input()\r\ns=0\r\nc=0\r\nfor i in n:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n c+=1\r\n elif(ord(i)>=97 and ord(i)<=122):\r\n s+=1\r\nif(s>c):\r\n print(small(n))\r\nelif(c>s):\r\n print(large(n))\r\nelse:\r\n print(small(n))", "n = input()\r\nl = 0\r\nu = 0 \r\n\r\nfor i in n:\r\n\tif(i >= 'a' and i <= 'z'):\r\n\t\tl += 1\r\n\tif(i >= 'A' and i <= 'Z' ):\r\n\t\tu += 1\r\n\r\nif (l >= u):\r\n\tprint(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "s = input()\r\nlength = len(s)\r\nc = 0\r\na = 0\r\nfor i in range(length):\r\n if s[i].isupper():\r\n c += 1\r\n else:\r\n a += 1\r\nif a >= c:\r\n s = s.lower()\r\n print(s)\r\nelse:\r\n s = s.upper()\r\n print(s)", "word = str(input())\r\nlword = list(map(str, word))\r\nuc = []\r\nlc = []\r\n\r\n\r\nfor i in lword:\r\n if i.isupper():\r\n uc.append(i)\r\n else:\r\n lc.append(i)\r\n\r\nif len(uc) == len(lc):\r\n word = word.lower()\r\nelif len(lc) > len(uc):\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\n\r\nprint(word)\r\n\r\n", "x=input()\r\nlow=0\r\nup=0\r\nfor i in x:\r\n if i.islower()==True:\r\n low+=1\r\n else:\r\n up+=1\r\nif low>=up:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "string = input()\r\nhaha = 0\r\nresult = 0\r\nfinal = []\r\n\r\nfor i in string:\r\n if(i.isupper()):\r\n haha += 1\r\n elif(i.islower()):\r\n result += 1\r\n\r\nif(haha == result):\r\n for i in string:\r\n final.append(i.lower())\r\nelif(haha > result):\r\n for i in string:\r\n final.append(i.upper())\r\nelse:\r\n for i in string:\r\n final.append(i.lower())\r\n\r\nfinal_result = \"\".join(final)\r\nprint(final_result)\r\n", "a=input()\r\nn=len(a)\r\nb=0\r\nc='abcdefghijklmnopqrstuvwxyz'\r\nd='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nfor i in range(n):\r\n if c.find(a[i])==-1:\r\n b+=1\r\nif b>n-b:\r\n for i in range(n):\r\n if d.find(a[i])==-1:\r\n a=a[:i]+d[c.find(a[i])]+a[i+1:]\r\n print(a)\r\nelse:\r\n for i in range(n):\r\n if c.find(a[i])==-1:\r\n a=a[:i]+c[d.find(a[i])]+a[i+1:]\r\n print(a)", "# cook your dish here\r\na=input()\r\nn=len(a)\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n if a[i].islower():\r\n x=x+1\r\n else:\r\n y=y+1\r\nif x>=y:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "word = input()\r\nlowLet = 0\r\nupLet = 0\r\nfor i in range(len(word)):\r\n if (word[i] >= \"A\") and (word[i] <= \"Z\"):\r\n upLet += 1\r\n else:\r\n lowLet += 1\r\n\r\nif upLet > lowLet:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "x = input()\r\ncounter = 0\r\nlowwer = 0\r\nfor ch in x:\r\n if ch.isupper():\r\n counter += 1\r\n \r\nfor ch in x:\r\n if ch.islower():\r\n lowwer += 1\r\n \r\nif counter > lowwer:\r\n\tprint(x.upper())\r\nelse:\r\n\tprint(x.lower())", "arr = list(input())\r\nup = low = 0\r\nfor ch in arr:\r\n\tif ch.isupper():\r\n\t\tup += 1\r\n\telse:\r\n\t\tlow += 1\r\nif up > low:\r\n\tprint(''.join(arr).upper())\r\nelse:\r\n\tprint(''.join(arr).lower())", "s = str(input())\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n count+=1\r\nif count>=len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "w = input()\r\n\r\nsmol = 0\r\n\r\nbig = 0\r\n\r\nfor i in w :\r\n if ord(i)>64 and ord(i)<91 :\r\n big += 1\r\n \r\n else :\r\n\r\n smol += 1\r\n\r\nif big==smol or smol>big :\r\n print(w.lower())\r\n\r\nelif big>smol :\r\n print(w.upper())\r\n", "s = input()\n\nl = 0\nu = 0\nfor i in range(len(s)):\n if s[i]>='a' and s[i]<='z':\n l = l + 1\n else:\n u = u + 1\nif(l>=u):\n print(s.lower())\nelse:\n print(s.upper())\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed May 19 23:08:12 2021\r\n\r\n@author: stani\r\n\"\"\"\r\n\r\n\r\ns = input()\r\nl = len(s)\r\ncount = sum(1 for elem in s if elem.isupper())\r\n\r\nif count > l/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\nl_c = u_c = 0\r\nfor i in word:\r\n if(ord(i) >= 97 and ord(i) <= 122 ):\r\n l_c += 1\r\n elif (ord(i) >= 65 and ord(i) <= 90):\r\n u_c += 1\r\nif l_c > u_c or l_c == u_c:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = input()\r\nif sum([1 for i in s if i.islower()]) >= sum([1 for i in s if i.isupper()]):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\na, b = s, s\r\na = a.lower()\r\nb = b.upper()\r\ncnt1, cnt2 = 0, 0\r\nfor i in range(len(s)):\r\n cnt1 += a[i] != s[i]\r\n cnt2 += b[i] != s[i]\r\nif cnt1 <= cnt2:\r\n print(a)\r\nelse:\r\n print(b)", "W=str(input())\r\nl,u=0,0\r\nfor w in W:\r\n if w>='a' and w<='z':\r\n l+=1\r\n if w>='A' and w<='Z':\r\n u+=1 \r\nif (u>l):\r\n W=W.upper()\r\nelse:\r\n W=W.lower()\r\nprint(W) \r\n", "string=input();\r\nupper=0;\r\nlower=0;\r\nfor i in string:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n lower+=1;\r\n elif(ord(i)>=65 and ord(i)<=90):\r\n upper+=1;\r\nif(lower>=upper):\r\n print(string.lower());\r\nelse:\r\n print(string.upper());\r\n ", "word = input()\r\ncount_lower = 0\r\ncount_upper = 0\r\n\r\nfor char in word:\r\n if char.islower():\r\n count_lower+=1\r\n else :\r\n count_upper+=1\r\n\r\n\r\nif count_lower<count_upper:\r\n print(word.upper())\r\nelse:print(word.lower())", "n=input()\r\nl=0\r\nu=0\r\nfor i in n:\r\n if i>='a' and i<='z':\r\n l+=1\r\n else:\r\n u+=1\r\nif l>u or l==u:\r\n print(n.lower())\r\nelif u>l:\r\n print(n.upper())\r\n", "s = input()\r\nmins, maxs = 0, 0\r\nfor i in s:\r\n if i == i.upper():\r\n maxs += 1\r\n else:\r\n mins += 1\r\nif maxs > mins:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "word=input(\"\")\r\nif len(word) >=1 and len(word) <=100:\r\n upper_no=0\r\n lower_no=0\r\n new_word_upper = \"\"\r\n new_word_lower = \"\"\r\n for letter in word:\r\n if letter.isupper():\r\n\r\n upper_no += 1\r\n new_word_upper += letter\r\n new_word_lower += letter.lower()\r\n else:\r\n lower_no += 1\r\n new_word_lower += letter\r\n new_word_upper += letter.upper()\r\n if (upper_no > lower_no):\r\n print(new_word_upper)\r\n else:\r\n print(new_word_lower)", "s = input()\r\nk1=0\r\nk2=0\r\nfor c in s:\r\n if(c.isupper()):\r\n k1+=1\r\n else:\r\n k2+=1\r\nif(k1>k2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\ncl, cb = 0, 0\r\nfor i in s:\r\n if i.islower() == True:\r\n cl += 1\r\n elif i.isupper() == True:\r\n cb += 1\r\nif cl >= cb:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\n\r\ncaps = 0\r\nlow = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n low += 1\r\n else:\r\n caps += 1\r\n \r\nif caps > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "# Triggerd Grammar nazi\r\ns = input()\r\n\r\nLL = 0\r\nUL = 0\r\n\r\n\r\nfor i in s:\r\n if i.islower():\r\n LL+=1\r\n else:\r\n UL+=1\r\n\r\n\r\nif LL>=UL:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\ns1 = s2 = 0\r\nfor c in s:\r\n if c >= 'a' and c <= 'z':\r\n s1 += 1\r\n else:\r\n s2 += 1\r\nprint(s.lower() if(s2 <= s1) else s.upper())", "x=str(input())\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in x:\r\n\tif(i.islower()):\r\n\t\tcount1 = count1+1\r\n\telif(i.isupper()):\r\n\t\tcount2 = count2+1\r\n\r\nif(count1 >count2):\r\n\tprint(x.lower())\r\nelif (count1 == count2):\r\n\tprint(x.lower())\r\nelse:\r\n\tprint(x.upper())\r\n\r\n", "\ndef getValid(s):\n count_upper = count_lower = 0\n for i in sorted(s):\n if str.isupper(i) == True:\n count_upper += 1\n if str.islower(i) == True:\n count_lower += 1\n\n return str.upper(s) if count_lower < count_upper else str.lower(s)\n\n\nif __name__ == \"__main__\":\n s = str(input())\n word = getValid(s)\n print(word)\n", "user_input = input()\r\nupperCase_count = sum(1 for char in user_input if char.isupper())\r\nlowerCase_count = sum(1 for char in user_input if char.islower())\r\n\r\nif upperCase_count > lowerCase_count:\r\n print(user_input.upper())\r\nelse:\r\n print(user_input.lower())", "l, s = 0, input()\r\nfor char in s:\r\n\tl += 1 if char.islower() else -1\r\nprint(s.lower() if l >= 0 else s.upper())\r\n", "s=input()\r\nu=0\r\nl=0\r\nfor char in s:\r\n if char.islower():\r\n l +=1\r\n else :\r\n u +=1\r\nif l >= u :\r\n print(s.lower())\r\nelse :\r\n print(s.upper())", "s = input()\r\nc = len(s)\r\nu = 0\r\nfor i in s:\r\n if i.isupper():\r\n u = u+1\r\nif u>(len(s)-u):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "slovo = input()\r\nup = 0\r\ndown = 0\r\nfor i in slovo:\r\n if i.isupper() == True:\r\n up += 1\r\n else:\r\n down += 1\r\nif down >= up:\r\n slovo = slovo.lower()\r\nelse:\r\n slovo = slovo.upper()\r\nprint(slovo)\r\n", "s = input()\r\nbr1 = 0\r\nbr2 = 0\r\nfor a in s:\r\n if(a.islower()):\r\n br1+=1\r\n if(a.isupper()):\r\n br2+=1\r\nif(br1>=br2):\r\n n = s.lower()\r\n print(n)\r\nelse:\r\n n = s.upper()\r\n print(n)\r\n", "s=input()\r\nc=k=0\r\nfor i in range(0,len(s)):\r\n if s[i].isupper()==1:\r\n c=c+1\r\n else:\r\n k=k+1\r\nif c>k:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def how_many_small_and_big(s):\r\n small = 0\r\n big = 0\r\n for i in s:\r\n if i.isupper():\r\n big+=1\r\n else:\r\n small+=1\r\n return (big, small)\r\ns = input()\r\nbg, sm = how_many_small_and_big(s)\r\nif bg>sm:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\ncapital = 0\r\nlower = 0\r\nfor i in word:\r\n if (i.isupper()):\r\n capital = capital + 1\r\n else:\r\n lower = lower + 1\r\nif capital > lower:\r\n print(word.upper())\r\nelif capital <= lower:\r\n print(word.lower())\r\n\r\n\r\n\r\n", "s=input()\r\nupper_c=0\r\nlower_c=0\r\nfor c in s:\r\n if c.isupper():\r\n upper_c+=1\r\n elif c.islower():\r\n lower_c+=1\r\nif upper_c>lower_c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nu = len([x for x in s if x.isupper()])\r\nl = len([x for x in s if x.islower()])\r\nprint(s.upper() if u>l else s.lower())", "def main(): \r\n word = input()\r\n up = 0\r\n down = 0\r\n for i in word:\r\n if i >= \"A\" and i <= \"Z\":\r\n up = up + 1\r\n if i >= \"a\" and i <= \"z\":\r\n down = down + 1\r\n if up > down:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\nmain()", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\r\n count += 1\r\nif count <= len(s)/2:\r\n print(s.lower())\r\nelse: print(s.upper())", "s=input()\r\nx1=x2=0\r\nfor i in s:\r\n if i.isupper():\r\n x1+=1\r\n else:\r\n x2+=1\r\nif x1>x2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = str(input())\r\n\r\nx = sum(map(str.isupper, s))\r\ny = sum(map(str.islower, s))\r\n\r\nif x > y:\r\n\tprint(s.upper())\r\nelif x <= y:\r\n\tprint(s.lower())", "word = input()\r\n\r\ncap = sml = 0\r\n\r\nfor ch in word:\r\n if 65 <= ord(ch) <= 90:\r\n cap += 1\r\n else:\r\n sml += 1\r\n\r\nprint(word.upper() if cap > sml else word.lower())", "s = input()\r\nu, l = 0, 0\r\nfor i in s:\r\n if ord('A') <= ord(i) <= ord('Z'):\r\n u += 1\r\n else:\r\n l += 1\r\nif l >= u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a = input()\r\ncount = 0\r\nlength = len(a)\r\nfor i in range(len(a)):\r\n if a[i] == a[i].upper():\r\n count += 1\r\n\r\nif count > length / 2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s=input()\r\nt=0\r\nm=0\r\nfor i in range(len(s)):\r\n if s[i]=='A' or s[i]=='B' or s[i]=='C' or s[i]=='D' or s[i]=='E' or s[i]=='F' or s[i]=='G' or s[i]=='H' or s[i]=='I' or s[i]=='J' or s[i]=='K' or s[i]=='L' or s[i]=='M' or s[i]=='N' or s[i]=='O' or s[i]=='P' or s[i]=='Q' or s[i]=='R' or s[i]=='S' or s[i]=='T' or s[i]=='U' or s[i]=='V' or s[i]=='W' or s[i]=='X' or s[i]=='Y' or s[i]=='Z':\r\n t+=1\r\n else:\r\n m+=1\r\nif t>m:\r\n print(s.upper())\r\nelif m>t:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s=input()\r\nlc=0\r\nuc=0\r\nfor i in range(0,len(s)):\r\n if (s[i].isupper()):\r\n uc+=1\r\n else:\r\n lc+=1\r\nif uc<=lc:\r\n print(s.lower())\r\nif uc>lc:\r\n print(s.upper())", "s=input()\r\nu=0\r\nsm=0\r\ng=''\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n u=u+1\r\n else:\r\n sm=sm+1\r\nif u>sm:\r\n g=s.upper()\r\n print(g)\r\nelse:\r\n g=s.lower()\r\n print(g)\r\n \r\n ", "k=str(input())\r\na=list(k)\r\ncountu=0\r\ncountl=0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n countu+=1\r\n elif a[i].islower():\r\n countl+=1\r\nif countu>countl:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "\r\ns = input()\r\na = []\r\nb = []\r\nfor i in s :\r\n if i.islower():\r\n a.append(i)\r\n if i.isupper():\r\n b.append(i)\r\n\r\nif len(a) > len(b) :\r\n print(s.lower())\r\nif len(b) > len(a) :\r\n print(s.upper())\r\nif len(a) == len(b) :\r\n print(s.lower())\r\n\r\n", "a=input()\r\nw=0\r\ne=0\r\nfor i in range (len(a)):\r\n if a[i].islower()==True:\r\n i+=1\r\n w+=1\r\n else:\r\n i+=1\r\n e+=1\r\nif w>=e:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n ", "#https://codeforces.com/problemset/problem/59/A\r\n\r\nletters = input()\r\ncapital = [True for x in letters if x.isupper() == True]\r\nif(len(capital) > len(letters)//2):\r\n print(letters.upper())\r\nelse:\r\n print(letters.lower())", "# for _ in range(int(input())):\r\nword = input()\r\nnumber_of_letters_in_lower_case = 0\r\nnumber_of_uppercase_letters = 0\r\nfor i in word:\r\n if i.islower():\r\n number_of_letters_in_lower_case += 1\r\n elif i.isupper():\r\n number_of_uppercase_letters += 1\r\n\r\nif number_of_letters_in_lower_case < number_of_uppercase_letters:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word=input()\r\nu=0\r\nl=0\r\nfor w in word:\r\n if w.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nlower=0\r\nupper=0\r\nfor i in range (len(s)):\r\n if s[i]>='a' and s[i]<='z':\r\n lower+=1\r\n elif s[i]>='A' and s[i]<='Z':\r\n upper+=1\r\nif lower>upper:\r\n print(s.lower())\r\nelif lower<upper:\r\n print(s.upper())\r\nelif lower==upper:\r\n print(s.lower())", "string = input()\r\nuppercaseCount = sum(1 for i in string if i < 'a')\r\nlowercaseCount = len(string) - uppercaseCount\r\nif(uppercaseCount > lowercaseCount):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "x=input()\ncap,sma=0,0\nfor i in x:\n if i==i.upper():\n cap+=1\n elif i==i.lower():\n sma+=1\nif cap<=sma:\n print(x.lower())\nelif cap>sma:\n print(x.upper())\n\t\t\t\t \t\t\t \t \t \t\t\t\t \t\t\t\t", "n=input()\r\nl=sum(map(str.islower, n))\r\nh=sum(map(str.isupper, n))\r\nif l<h:\r\n print(n.upper())\r\nif l>=h:\r\n print(n.lower())", "from math import ceil as c\r\nword = input()\r\nl = len([i for i in word if ord(i) >= 97])\r\nprint(word.lower() if l >= c(len(word) / 2) else word.upper())", "import re \n\nword = input(\"\")\n\nlower = len(re.findall(\"[a-z]\", word))\n\nupper = len(re.findall(\"[A-Z]\", word))\n\nif upper > lower :\n print(word.upper())\n \nelse:\n print(word.lower())", "def word(s):\n upper, lower = 0, 0\n for c in s:\n if c.isupper():\n upper += 1\n elif c.islower():\n lower += 1\n if lower >= upper:\n s = s.lower()\n else:\n s = s.upper()\n return s\n\nif __name__ == \"__main__\":\n s = input().strip()\n print(word(s))\n\t \t\t\t\t\t \t\t \t\t \t \t\t\t \t\t\t \t \t", "string = input()\nstring_list = [x for x in string]\n\ncount_uppercase = 0\ncount_lowercase = 0\n\nfor num in range(len(string_list)):\n if string_list[num].isupper():\n count_uppercase = count_uppercase + 1\n elif string_list[num].islower():\n count_lowercase = count_lowercase +1\nif count_uppercase > count_lowercase :\n string = string.upper()\n print(string)\nelif count_uppercase <= count_lowercase :\n string = string.lower()\n print(string)\n", "s = input()\nk = len(s)\n\nl, u = 0,0\nfor i in range(k):\n if s[i].isupper():\n u += 1\n else:\n l += 1\nif u > l:\n print (s.upper())\nelse:\n print (s.lower())\n\t\t \t \t\t\t \t\t\t \t\t \t \t \t\t\t\t \t", "s=input();\r\nu=0\r\nl=0\r\nfor c in s:\r\n if (c.isupper()):\r\n u=u+1\r\n else :\r\n l=l+1;\r\nif(l<u):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "import string\r\ndef loop_test_cases():\r\n return range(int(input()))\r\n\r\ndef list_input():\r\n return [int(i) for i in input().split()]\r\n\r\ndef list_input_str():\r\n return [i for i in input()]\r\n\r\n#for i in loop_test_cases():\r\nstr = input()\r\n\r\nlen_ = len(str)\r\ncountUpper = 0\r\nfor i in str:\r\n if i.isupper():\r\n countUpper += 1\r\nprint(str.upper() if countUpper * 2 > len_ else str.lower())", "s=input()\r\nc=len(s)\r\nU=s.upper()\r\nL=s.lower()\r\na,b=0,0\r\nfor i in range(c):\r\n if L[i]==s[i]:\r\n a+=1\r\n elif U[i]==s[i]:\r\n b+=1\r\nif a>b or a==b:\r\n print(L)\r\nelse:\r\n print(U)", "s = input()\r\n\r\ns1 = 0\r\ns2 = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n s1 += 1\r\n elif s[i].isupper():\r\n s2 += 1\r\n \r\n \r\nif s1 > s2:\r\n print(s.lower())\r\nelif s1 < s2:\r\n print(s.upper())\r\nelif s1 == s2:\r\n print(s.lower())", "A=input()\r\nUC=[]\r\nLC=[]\r\nfor i in A:\r\n if i.isupper():\r\n UC.append(i)\r\n elif i.islower():\r\n LC.append(i)\r\nif len(UC)>len(LC):\r\n print(A.upper())\r\nelif len(UC)<len(LC):\r\n print(A.lower())\r\nelif len(UC)==len(LC):\r\n print(A.lower())\r\n", "st=input()\r\nup=0\r\nlow=0\r\nfor i in range(len(st)):\r\n if ord(st[i])>=65 and ord(st[i])<=90:\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n st=st.upper()\r\nelse:\r\n st=st.lower()\r\nprint(st)", "word = input()\n\nupperletters = 0\nlowerletters = 0 \n\nfor letter in word:\n\tif letter.isupper():\n\t\tupperletters +=1\n\telse:\n\t\tlowerletters +=1\n\nif upperletters > lowerletters: \n\tprint(word.upper())\nelse:\n\tprint(word.lower())\n\n\n", "s = input()\r\ncaps,lower = 0,0\r\nfor i in s:\r\n if ord(i) >=65 and ord(i) <= 90:\r\n caps += 1\r\n else:\r\n lower += 1\r\nif caps > lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import sys\n\n\ndef solution(input_data: str):\n upper, lower = 0, 0\n for i in input_data:\n if i.isupper():\n upper += 1\n elif i.islower():\n lower += 1\n return str.lower(input_data) if lower >= upper else str.upper(input_data)\n\n\ndef test_solution():\n assert solution(\"HoUse\") == \"house\"\n assert solution(\"ViP\") == \"VIP\"\n assert solution(\"maTRIx\") == \"matrix\"\n\n\nif __name__ == '__main__':\n print(solution(sys.stdin.read().strip()))\n", "s=input().strip()\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if i.isupper():\r\n c1+=1\r\n else:\r\n c2+=1\r\nif c1>c2:\r\n x=s.upper()\r\nelse:\r\n x=s.lower()\r\nprint(x)\r\n", "n=input()\r\nz=0\r\nfor i in n:\r\n if i.upper()==i:\r\n z+=1\r\nif z>len(n)//2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = input()\r\nk1 = 0\r\nk2 = 0\r\nfor c in s:\r\n if c.islower():\r\n k1 += 1 \r\n else:\r\n k2 += 1\r\nif k1 < k2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import string\n\n\n\ndef solution(s):\n counterU = 0\n counterL = 0\n output = \"\"\n for char in s:\n if char in string.ascii_uppercase:\n counterU += 1\n else:\n counterL += 1\n if counterL >= counterU:\n output = s.lower()\n else:\n output = s.upper()\n \n return output\n\ninp = input()\nprint(solution(inp))", "word=input()\r\nlow=0\r\nup=0\r\nfor i in word:\r\n if i==i.lower():\r\n low+=1\r\n else:\r\n up+=1\r\nif low>=up:\r\n word=word.lower()\r\nelse:\r\n word=word.upper()\r\nprint(word)", "string=str(input())\nlower=0\nupper=0\nfor char in string:\n if char.islower():\n lower+=1\n else:\n upper+=1\nif lower>=upper:\n print(string.lower())\nelse:\n print(string.upper())\n", "s=input()\r\ni=0\r\nu=0\r\nl=0\r\nwhile i<len(s):\r\n if s[i].upper()==s[i]:\r\n u+=1;\r\n else:\r\n l+=1\r\n i+=1\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\n\r\ncB = 0\r\ncS = 0\r\n\r\nfor s in word:\r\n if s == s.upper():\r\n cB += 1\r\n else:\r\n cS += 1\r\n\r\nif cB > cS:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "p=input()\r\nq=list(p)\r\nr,s=0,0\r\nfor i in q:\r\n if i.islower()==True:\r\n r+=1\r\n elif i.isupper()==True:\r\n s+=1\r\nif r>s or r==s:\r\n print(p.lower())\r\nelse:\r\n print(p.upper())", "\r\nS = input()\r\n\r\nup, low =0,0\r\nfor i in range(len(S)):\r\n if S[i].isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif low>=up: print(S.lower())\r\nelse: print(S.upper())\r\n", "word = input()\r\nletters = [char.islower() for char in word]\r\n\r\nlower_counts = sum(letters)\r\nletters_len = len(letters)\r\n\r\nif lower_counts < letters_len - lower_counts:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "string = input()\ncountU = 0\ncountL = 0\nfor st in string:\n if st.isupper() == True:\n countU += 1\n else:\n countL += 1\n\nif countL >= countU:\n print(string.lower())\nelse:\n print(string.upper())\n", "s=input()\r\nupc=lwc=0\r\nfor a in s:\r\n if a.islower():\r\n lwc+=1\r\n else:\r\n upc+=1\r\nif(upc==lwc):\r\n print(s.lower())\r\nelif(lwc>upc):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "given = input()\r\nupper = 0\r\nlower = 0\r\nfor x in given:\r\n if x.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif lower >= upper:\r\n print(given.lower())\r\nelse:\r\n print(given.upper())\r\n", "s=str(input())\r\ncountup=0\r\ncountdown=0\r\nfor i in s:\r\n if i.isupper():\r\n countup=countup+1\r\n else:\r\n countdown=countdown+1\r\n\r\nif countup>countdown:\r\n print(s.upper())\r\nelif(countup<countdown):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n", "u=0;l=0\r\na=input()\r\nfor i in a:\r\n if i.isupper():u+=1\r\n else:l+=1\r\nif u==l:print(a.lower())\r\nelif u>l:print(a.upper())\r\nelse:print(a.lower())", "x = input()\r\nlow = 0\r\nup = 0\r\nfor i in x:\r\n if i.islower():\r\n low += 1\r\n else :\r\n up += 1\r\n\r\nif low >= up :\r\n print(x.lower())\r\nelse :\r\n print(x.upper())", "import math\r\ni = input()\r\n\r\nt = 0\r\nfor x in list(i):\r\n if x.isupper():\r\n t += 1\r\nif t > len(i) - t:\r\n print(i.upper())\r\nelse:\r\n print(i.lower())\r\n", "a=input()\r\nb=0\r\nm=0\r\nfor i in a:\r\n if i>='a' and i<='z':\r\n m+=1\r\n else:\r\n b+=1\r\nif b>m:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nupp = set('QWERTYUIOPASDFGHJKLZXCVBNM')\r\nn, cu, cl = len(s), 0, 0\r\n\r\nfor ch in s:\r\n if ch in upp:\r\n cu += 1\r\n else:\r\n cl += 1\r\nif cu > cl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in a:\r\n if i.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\nif upper_count > lower_count:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "a=input()\r\nlow=0\r\nup=0\r\nfor i in a:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = input()\r\nprint(n.upper()) if sum(s.isupper() for s in n) > sum(s.islower() for s in n) else print(n.lower())\r\n", "a=str(input())\r\nbrmal=0\r\nbrvel=0\r\nfor i in range(0, len(a)):\r\n if a[i].isupper(): brvel+=1\r\n else: brmal+=1\r\nif brmal>=brvel:\r\n a=a.lower()\r\nelse: a=a.upper()\r\nprint(a)\r\n", "n=input();ma=0;mA=0;\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nA=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nfor i in n:\r\n if i in a:\r\n ma+=1\r\n if i in A:\r\n mA+=1\r\nif ma>=mA:\r\n for i in range(len(n)):\r\n if n[i] in A:\r\n n=n.replace(n[i],a[A.find(n[i])],1)\r\nelse:\r\n for i in range(len(n)):\r\n if n[i] in a:\r\n n=n.replace(n[i],A[a.find(n[i])],1)\r\nprint(n)", "string=input()\r\nbig=0\r\nsmall=0\r\nfor x in string:\r\n if ord('a')<=ord(x)<=ord('z'):\r\n small=small+1\r\n if ord('A')<=ord(x)<=ord('Z'):\r\n big=big+1\r\nif small>=big:\r\n string=string.lower()\r\nelse:\r\n \r\n string=string.upper()\r\n \r\n\r\nprint(string)\r\n", "word=str(input(\"\"))\r\nlower=upper=0\r\nfor x in word:\r\n if(x.islower()):\r\n lower=lower+1\r\n elif(x.isupper()):\r\n upper=upper+1\r\nif(upper<=lower):\r\n word=word.lower()\r\nelse:\r\n word=word.upper()\r\nprint(word)\r\n", "low=0\r\nhigh=0\r\na=input()\r\nfor i in a:\r\n if i>=\"a\" and i<=\"z\":\r\n low=low+1\r\n elif i>=\"A\" and i<=\"Z\":\r\n high=high+1\r\nif low>=high:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "upper = \"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\nupper_list = upper.split()\r\nword = input()\r\nn = len(word)\r\ncount_upper = 0\r\ncount_lower = 0\r\nfor i in range(n):\r\n if word[i] in upper_list:\r\n count_upper+=1\r\n else:\r\n count_lower+=1\r\nif (count_upper > count_lower):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "inp = input()\r\n\r\nl, r = 0, 0\r\n\r\nfor letter in inp:\r\n if letter.islower():\r\n l +=1\r\n else:\r\n r +=1\r\n\r\nif l >= r:\r\n print(inp.lower())\r\nelse:\r\n print(inp.upper())\r\n ", "n=input()\r\nupper_count=0\r\nlower_count=0\r\nfor char in n:\r\n if char.isupper():\r\n upper_count+=1\r\n elif char.islower():\r\n lower_count+=1\r\nif upper_count>lower_count:\r\n print(n.upper())\r\nelif lower_count>=upper_count:\r\n print(n.lower())", "i=input();\r\nprint([i.lower(),i.upper()][sum(x<'['for x in i)*2>len(i)])", "word = input()\r\n\r\nup = word.upper()\r\nlow = word.lower()\r\nnumup = 0\r\nnumlow = 0\r\n\r\nfor i in range(len(word)):\r\n\tif word[i]==up[i]:\r\n\t\tnumup += 1\r\nfor i in range(len(word)):\r\n\tif word[i]==low[i]:\r\n\t\tnumlow += 1\r\n\r\nif numup > numlow:\r\n\tprint (up)\r\nelif numlow >= numup:\r\n\tprint (low)", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/59/A\r\n\r\n\"\"\"\r\n\r\n\r\nword = input()\r\nupperCount = 0\r\nlowerCount = 0\r\nfor char in word:\r\n if char.isupper():\r\n upperCount = upperCount + 1\r\n else:\r\n lowerCount = lowerCount + 1\r\n\r\nif upperCount > lowerCount:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s=str(input())\r\nt=0\r\np=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n t=t+1\r\n if(s[i].islower()):\r\n p=p+1\r\n\r\nif(t>p):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nt='qwertyuiopasdfghjklzxcvbnm';\r\ny='QWERTYUIOPASDFGHJKLZXCVBNM';\r\nz=0;\r\ne=0;\r\nfor i in s:\r\n if i in t:\r\n z+=1;\r\n if i in y:\r\n e+=1;\r\n \r\nif z>e or z==e:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "string = input()\r\nlow =0\r\nup = 0\r\nfor char in string:\r\n if char.isupper():\r\n up+=1 \r\n else:\r\n low+=1 \r\nif up>low:\r\n string = string.upper()\r\nelse:\r\n string = string.lower()\r\nprint(string)", "w = input()\nupper = 0\nlower = 0\nfor i in w:\n if i.isupper():\n upper += 1\n elif i.islower():\n lower += 1\nif upper > lower:\n print(w.upper())\nelif lower > upper:\n print(w.lower())\nelse:\n print(w.lower())", "x= 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\nif u>l:\r\n print(x.upper())\r\nelse :\r\n print(x.lower())", "a=input()\r\nc1=0\r\nc2=0\r\nfor i in range(len(a)):\r\n if(a[i].isupper()):\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\nif(c1>c2):\r\n print(a.upper())\r\nelif(c1<c2):\r\n print(a.lower())\r\nelse:\r\n print(a.lower())\r\n", "s=input()\r\nc1=0\r\nc2=0\r\ns1=''\r\nfor i in range(len(s)):\r\n if 65<=(ord(s[i]))<=92:\r\n c1=c1+1\r\n elif 97<=(ord(s[i]))<=122:\r\n c2=c2+1\r\nif c1==c2 or c2>c1:\r\n s1=s.lower()\r\n print(s1)\r\nelse:\r\n s1=s.upper()\r\n print(s1)", "word=input()\r\nlow =0\r\ncap =0\r\nfor i in word:\r\n if ord(i) > 96 :\r\n low+=1\r\n else:\r\n cap+=1\r\nif low >= cap :\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n ", "x = input()\r\nlower = \"\"\r\nupper = \"\"\r\nfor i in x:\r\n if i.islower() == True:\r\n lower += i\r\n elif i.isupper() == True:\r\n upper += i\r\nif len(lower) > len(upper):\r\n print(x.lower())\r\nelif len(upper) > len(lower):\r\n print(x.upper())\r\nelif len(upper) == len(lower):\r\n print(x.lower())\r\n \r\n", "w=input()\r\nup=0\r\nlow=0\r\nfor i in range (len(w)):\r\n if w[i].isupper() :\r\n up+=1\r\n else :\r\n low+=1\r\nif up>low:\r\n w=w.upper()\r\nelse :\r\n w=w.lower()\r\nprint(w)\r\n", "s, lowers, uppers = str(input()), 0, 0\r\n\r\nfor i in range(len(s)):\r\n\tif s[i].isupper():\r\n\t\tuppers += 1\r\n\telse:\r\n\t\tlowers += 1\r\n\t\t\r\nif uppers > lowers:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "def main():\r\n st = input()\r\n up = sum([1 for i in list(st) if i == i.upper()])\r\n if up <= len(st)-up:\r\n print(st.lower())\r\n else:\r\n print(st.upper())\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input('')\r\ni = lowlet = upplet = 0\r\nwhile True:\r\n if (ord('a') <= ord(s[i])):\r\n lowlet += 1\r\n elif (ord('Z') >= ord(s[i])):\r\n upplet += 1\r\n i += 1\r\n if (len(s) == i):\r\n break\r\n\r\nif (lowlet < upplet):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nn = 0\r\nfor c in s:\r\n if c.islower():\r\n n += 1\r\n\r\nprint(s.lower() if n*2 >= len(s) else s.upper())", "word = input()\r\nupper_s = 0 \r\nlower_s = 0\r\nfor i in word:\r\n if i.isupper():\r\n upper_s += 1\r\n else:\r\n lower_s += 1\r\nif upper_s > lower_s:\r\n print(word.upper())\r\nelif upper_s <= lower_s:\r\n print(word.lower())", "def correct_word_case(s):\r\n uppercase_count=sum(1 for letter in s if letter.isupper())\r\n lowercase_count=len(s)-uppercase_count\r\n if uppercase_count>lowercase_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\ns=input()\r\nresult=correct_word_case(s)\r\nprint(result)", "s = input()\r\nnupper = 0\r\nnlower = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n nupper+= 1\r\n else:\r\n nlower += 1\r\n\r\nif nupper > nlower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\ncount_up = 0\r\ncount_down = 0\r\nfor i in word:\r\n if i.isupper():\r\n count_up += 1\r\n else:\r\n count_down += 1\r\nif count_up > count_down:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\nupper_count = sum(1 for letter in word if letter.isupper())\r\nif upper_count > len(word) // 2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "#! /usr/bin/python3\n\nw = input()\n\nn = 0\nfor i in w:\n if i.isupper():\n n += 1\n\nif n > len(w)-n:\n print(w.upper())\nelse:\n print(w.lower())\n\n\n", "n = str(input())\r\nlower, upper = 0, 0 \r\nfor i in range(len(n)):\r\n if ord(n[i]) >= 97 and ord(n[i]) <= 122:\r\n lower += 1\r\n elif ord(n[i]) >= 65 and ord(n[i]) <= 90:\r\n upper += 1\r\n \r\nif lower > upper or lower == upper:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s = str(input())\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\nb = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nc = 0\r\nz = 0\r\nfor i in s:\r\n if i in a:\r\n c +=1\r\n elif i in b:\r\n z +=1\r\nif c < z:\r\n print(s.upper())\r\nelif c >= z:\r\n print(s.lower())\r\n\r\n\r\n\r\n\r\n\r\n#x = int(input())\r\n#a = x//5\r\n#b = x%5\r\n#if b != 0:\r\n# print(a + 1)\r\n#else:\r\n# print(a)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#a, b, c = map(int, input().split())\r\n#d = 0\r\n#for i in range(1, c+1):\r\n# d += i*a\r\n#if b >= d:\r\n# print(0)\r\n#else:\r\n# print(d-b)\r\n", "def main():\r\n word=input()\r\n countUpper=0;\r\n countLower=0;\r\n wordlist=list(word)\r\n for i in range (0,len(wordlist)):\r\n if wordlist[i].isupper():\r\n countUpper+=1\r\n else:\r\n countLower+=1\r\n if countUpper>countLower:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n\r\nmain()", "n=input()\r\nctr=0\r\nfor i in range(len(n)):\r\n if n[i].islower():\r\n ctr+=1\r\nres=len(n)-ctr\r\nif res>ctr:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s = input()\n\nl = 0\nfor i in s:\n if i == i.lower():\n l+=1\n\nif l >= len(s)-l:\n print(s.lower())\nelse:\n print(s.upper())", "s = input()\r\na = \"abcdefghijklmnopqrstuvwxyz\"\r\nA = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ncl = \"\"\r\nsl = \"\"\r\nfor i in s:\r\n if i in a:\r\n sl+=i\r\n elif i in A:\r\n cl+=i\r\nif len(cl)>len(sl):\r\n print(s.upper())\r\nelif len(sl)>=len(cl):\r\n print(s.lower())\r\n", "s = input()\r\n\r\n\r\nupper = 0\r\noriginal_length = len(s)\r\ndef extension(word: str)-> str:\r\n global upper\r\n if len(word) == 0:\r\n if upper > original_length // 2:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n if word[0].isupper():\r\n upper += 1\r\n return extension(word[1:])\r\n\r\nans = extension(s)\r\nprint(ans)", "def word(s):\r\n u_case = 0\r\n l_case = 0\r\n for i in s:\r\n if i.isupper():\r\n u_case += 1\r\n elif i.islower():\r\n l_case += 1\r\n else:\r\n pass\r\n if u_case <= l_case:\r\n return s.lower()\r\n else:\r\n return s.upper()\r\n\r\ns = str(input())\r\nres = word(s)\r\nprint(res)", "st = input()\r\nst = list(st)\r\nlis =[]\r\nup= 0\r\nlow= 0\r\ntemp = \"\"\r\n# print(st[1].upper())\r\nfor i in range(len(st)):\r\n if st[i].isupper():\r\n up +=1\r\n else:\r\n low += 1 \r\n \r\nif up > low:\r\n for i in range(len(st)):\r\n lis.append(st[i].upper())\r\nelse:\r\n for i in range(len(st)):\r\n lis.append(st[i].lower())\r\ntemp = \"\".join(lis)\r\nprint(temp)", "s = input()\r\nl = sum(1 for c in s if c.islower())\r\nu = len(s) - l;\r\nprint(s.upper() if u > l else s.lower())", "n=input()\r\ns=0\r\nc=0\r\nfor i in n:\r\n if(i.isupper()):\r\n s=s+1\r\n else:\r\n c=c+1\r\nif(s>c):\r\n print(n.upper())\r\nelif(s<=c):\r\n print(n.lower())", "s = input ()\nsmall = 0\ncap = 0\n\nfor i in range (len (s)) :\n if (ord (s[i]) >= 97 and ord (s[i]) <= 122) :\n small += 1\n else :\n cap += 1\nif small >= cap :\n print (s.lower ())\nelse :\n print(s.upper ())\n", "str=input()\r\ncount=0\r\nup_str=str.upper()\r\nfor i in range(len(str)):\r\n if str[i]==up_str[i]: count+=1\r\nif count>len(str)/2:\r\n print(str.upper())\r\nelse: print(str.lower())", "t = input()\r\nn = 0\r\nfor i in range(len(t)):\r\n if t[i].isupper():\r\n n += 1\r\nif n > len(t)-n:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "s=input()\r\nu,p=0,0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1 \r\n else:\r\n p+=1 \r\nif u>p:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\r\nlower_count = sum(map(str.islower, string))\r\n\r\nif lower_count < len(string) - lower_count:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "s = input()\r\nu = l = 0\r\nfor _ in s:\r\n if _.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif l >= u:\r\n s = s.lower()\r\nelif l < u:\r\n s = s.upper()\r\nprint(s)", "s=input()\r\nn=len(s)\r\nx=0\r\ny=0\r\nfor i in s:\r\n if i.islower():\r\n x=x+1\r\n if i.isupper():\r\n y=y+1\r\nif x<y:\r\n print(s.upper())\r\nif x>y or x==y:\r\n print(s.lower())", "n=input()\r\na=0\r\nb=0\r\nfor i in range(len(n)):\r\n if str(n[i]).isupper()==True:\r\n a=a+1\r\n else:\r\n b=b+1\r\nif a>b:\r\n print(n.upper())\r\nif b>=a:\r\n print(n.lower())\r\n \r\n", "s=input()\r\np=[]\r\na=sum(map(str.isupper, s))\r\nb=sum(map(str.islower, s))\r\nif a>b:\r\n print(s.upper())\r\nif a<=b:\r\n print(s.lower())\r\n", "def solve(t):\r\n l = 0\r\n h = 0\r\n for c in t:\r\n if ord('a') <= ord(c) <= ord('z'):\r\n l += 1\r\n elif ord('A') <= ord(c) <= ord('Z'):\r\n h += 1\r\n if l >= h:\r\n return t.lower()\r\n else:\r\n return t.upper()\r\n\r\ndef main():\r\n t = input()\r\n print(solve(t))\r\n\r\nif __name__ == '__main__':\r\n main()", "a = input()\r\nb = a.upper()\r\nans = 0\r\nan = 0\r\ni = 0\r\nwhile i < len(a):\r\n if b[i] == a[i]:\r\n ans += 1\r\n else:\r\n an += 1\r\n i += 1\r\nif ans > an:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n", "string = input()\r\ncnt = 0\r\nfor char in string:\r\n if char.isupper():\r\n cnt += 1\r\n \r\nif cnt > len(string)>>1:\r\n string = string.upper()\r\nelse:\r\n string = string.lower()\r\n\r\nprint(string)", "n = input()\r\nl =0\r\nu=0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n u = u+1\r\n else:\r\n l = l +1\r\n\r\nif u > l:\r\n print (n.upper())\r\nelse:\r\n print (n.lower())", "s = input()\nup = 0 \nlow = 0\nfor ch in s:\n if ch.isupper():\n up += 1\n else:\n low += 1\n\nif up > low :\n print(s.upper())\nelse:\n print(s.lower()) #f\n \t\t \t\t \t \t\t\t\t\t\t \t \t\t \t\t\t \t", "raw=input()\r\nn=len(raw)\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n if raw[i].islower():\r\n x+=1\r\n elif raw[i].isupper():\r\n y+=1\r\nif x>=y:\r\n print(raw.lower())\r\nelif x<y:\r\n print(raw.upper())\r\n ", "a = input()\r\n\r\nk, t = 0, 0\r\nfor x in a:\r\n if x.upper() == x:\r\n k += 1\r\n else:\r\n t += 1\r\nif k > t:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\n\r\nhigh, low = 0, 0\r\nfor i in range(0, len(s)):\r\n if s[i].isupper(): high += 1\r\n else : low += 1\r\nif (low >= high): print(s.lower())\r\nelse: print(s.upper())\r\n", "x = input()\r\nupcount = 0\r\nlowcount = 0\r\nfor char in x:\r\n if char.isupper():\r\n upcount +=1\r\n else:\r\n lowcount +=1\r\n\r\nif upcount > lowcount:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "s=input()\r\nupp=0; low=0;\r\nfor ch in s:\r\n if(ch.isupper()):\r\n upp+=1\r\n else:\r\n low+=1\r\nif(upp>low):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "from math import *\r\n\r\ninputInt = lambda: int(input())\r\ninputList = lambda: map(int, input().split())\r\n\r\ns = input()\r\nv, n = 0, 0\r\nfor i in s:\r\n if ord('z')>=ord(i) >= ord('a'):\r\n n += 1\r\n else:\r\n v += 1\r\nif v > n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s1 = input()\n\nlower = 0\nupper = 0\n\nfor i in range(0,len(s1),1):\n\tif s1[i].islower():\n\t\tlower += 1\n\telse:\n\t\tupper += 1\n\t\t\nif upper > lower:\n\tprint(s1.upper())\nelse:\n\tprint(s1.lower())\n", "string_given=input()\r\nup,low=0,0\r\nfor i in string_given:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n up+=1\r\n else:\r\n low+=1 \r\nif up>low:\r\n print(string_given.upper())\r\nelif up<low:\r\n print(string_given.lower())\r\nelse:\r\n print(string_given.lower())", "n=input()\r\nu=[x for x in n if x.isupper()]\r\n\r\nl=[x for x in n if x.islower()]\r\n\r\nif len(u)==len(l) or len(l)>len(u):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "a=input()\r\nup=0\r\nlp=0\r\nfor char in a :\r\n if char.isupper():\r\n up+=1 \r\n else:\r\n lp+=1 \r\nif up>lp:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n ", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\ns = list(input()[:-1])\r\n\r\nup = lo = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n lo += 1\r\n\r\nif up <= lo:\r\n for i in range(len(s)):\r\n s[i] = s[i].lower()\r\nelse:\r\n for i in range(len(s)):\r\n s[i] = s[i].upper() \r\n\r\nstdout.write(\"\".join(s))\r\n", "s = input()\r\nprint(s.upper() if sorted(s)[len(s)//2].isupper() else s.lower())", "s=input()\r\nans=0\r\nfor i in s:\r\n if ord(i) > 96:\r\n ans+=1\r\nif ans>=len(s)-ans:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\na = 0\r\nb = 0\r\n\r\nfor i in s:\r\n\tif i.istitle() == True:\r\n\t\ta = a + 1\r\n\telse:\r\n\t\tb = b + 1\r\n\r\nif a > b:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s=input()\r\nlc=uc=0\r\nfor x in s:\r\n if x.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\nif lc<uc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nprint(s.lower() if 2*sum(i.islower() for i in s) >= len(s) else s.upper())", "s =input()\r\nword = list(s)\r\nupper = []\r\nlower = []\r\ni = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper() == True:\r\n upper.append(word[i])\r\n else:\r\n lower.append(word[i])\r\nif len(upper)>len(lower):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "str=input()\r\ncount1=0\r\ncount2=0\r\n\r\nfor a in str:\r\n if (a.isupper()) == True: \r\n count1+= 1\r\n\r\n elif (a.islower()) == True: \r\n count2+= 1\r\n \r\nif count1>count2:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "l, u = 0, 0\r\nword = input()\r\nfor i in word:\r\n if i.islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif l > u or l == u:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "word = input().strip()\r\nlower = sum(1 for x in word if x.islower())\r\nupper = sum(1 for x in word if x.isupper())\r\nif (lower == upper) or (lower > upper):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "x= input()\r\ncaps=0\r\nfor i in x:\r\n if i.isupper():\r\n caps+=1\r\nif caps>(len(x)-caps):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\nl,u = 0,0\nfor c in s:\n\tif (c.islower()):\n\t\tl+=1\n\telse:\n\t\tu+=1\nif (l>=u):\n\ts = s.lower()\nelse:\n\ts = s.upper()\nprint (s)\n", "import string\r\n\r\ns = input()\r\n\r\nup = 0\r\nlow = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif low >= up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "lower = 0\r\nupper = 0\r\ncad = input()\r\nfor c in cad:\r\n lower += 1 if c.islower() else 0\r\n\r\nif(len(cad) - lower > lower):\r\n print(cad.upper())\r\nelse:\r\n print(cad.lower())", "string = input()\r\nlowercase_letters = [c for c in string if c.islower()]\r\nif len(string) - len(lowercase_letters) <= len(lowercase_letters):\r\n print(string.lower())\r\nelse: print(string.upper())", "string = input()\r\nupperCount=0\r\nlowerCount = 0\r\nfor s in string:\r\n if s.isupper():\r\n upperCount+=1\r\n else:\r\n lowerCount+=1\r\n\r\nif upperCount>lowerCount:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s = input()\r\nupper,lower = 0,0\r\n\r\nfor i in s:\r\n upper+=i.isupper()\r\n lower+=i.islower()\r\n\r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s,u,l=input(),0,0\r\nfor i in s:\r\n if i>='A' and i<='Z': u+=1\r\n elif i>='a' and i<='z': l+=1\r\nprint(s.upper() if u>l else s.lower())", "n = input()\r\ncountA = 0\r\ncountL = 0\r\nfor i in n:\r\n if i.islower():\r\n countL += 1\r\n else:\r\n countA += 1\r\nif countA > countL:\r\n print(n.upper())\r\n # print(countA)\r\nelif countL > countA:\r\n print(n.lower())\r\n # print(countL)\r\nelse:\r\n print(n.lower())\r\n\r\n", "\r\n# Carrega o método Counter da library collections\r\nfrom collections import Counter\r\nfrom itertools import count\r\n\r\nword = input()\r\n\r\ndef case(letter):\r\n\r\n if letter.islower(): \r\n return \"l\"\r\n if letter.isupper():\r\n return \"U\"\r\nmapa = map(case, word)\r\n\r\ncounter = Counter(mapa)\r\n\r\nmaior = max([counter['l'], counter['U']])\r\n\r\nif counter[\"l\"] == maior:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s=input()\r\na=s.upper()\r\ncapital=0\r\nfor i in range(len(s)):\r\n if(s[i]==a[i]):\r\n capital+=1\r\nk=len(s)\r\nif(capital>k//2):\r\n print(a)\r\nelse:\r\n print(a.lower())", "def change_case(word):\r\n count_upper = 0\r\n count_lower = 0\r\n for ch in word:\r\n if ch.isupper():\r\n count_upper += 1\r\n else:\r\n count_lower += 1\r\n if count_upper > count_lower:\r\n return word.upper()\r\n return word.lower()\r\n\r\nword = input()\r\nprint(change_case(word))", "import string\r\nLOWERCASE_LETTERS = list(string.ascii_lowercase) # All alphabets lowercased\r\nword = input()\r\nboundary = len(word) // 2\r\nnum_of_lowercase = 0\r\nnum_of_uppercase = 0\r\nfor letter in word:\r\n if letter in LOWERCASE_LETTERS:\r\n num_of_lowercase += 1\r\n else:\r\n num_of_uppercase += 1\r\nif num_of_lowercase == num_of_uppercase:\r\n print(word.lower())\r\nelif num_of_lowercase > num_of_uppercase:\r\n print(word.lower())\r\nelif num_of_lowercase < num_of_uppercase:\r\n print(word.upper())\r\n", "import string\r\nn = str(input())\r\nmang = list(string.ascii_lowercase)\r\nmang1 = list(string.ascii_uppercase)\r\nlower = 0\r\nupper = 0 \r\nfor i in n :\r\n if i in mang :\r\n lower += 1\r\n else :\r\n upper += 1\r\nif lower > upper or lower==upper:\r\n print(n.lower())\r\nelse :\r\n print(n.upper())\r\n\r\n", "s=input()\r\nsl,sa=0,0\r\nfor i in s:\r\n if 'z'>=i>='a' :\r\n sl=sl+1\r\n elif 'Z'>=i>='A':\r\n sa=sa+1\r\nif sa>sl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a = input()\r\nup=[]\r\nlow=[]\r\nfor c in a:\r\n if c.islower():\r\n low.append(c)\r\n else:\r\n up.append(c)\r\nif (len(up)>len(low)):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\r\ncount=0\r\nfor i in s:\r\n if i.isupper():\r\n count+=1\r\nprint(s.upper() if count>len(s)-count else s.lower())", "s = input()\nl = sum(map(str.islower, s))\nu = sum(map(str.isupper, s))\nprint(s.lower() if l >= u else s.upper())\n", "s = input()\r\nc1 = 0\r\nc2 = 0\r\nx = (s.upper())\r\ny = (s.lower()) \r\nfor i in range(len(s)):\r\n if s[i] in x:\r\n c1+=1\r\nfor i in range(len(s)):\r\n if s[i] in y:\r\n c2+=1\r\nif c1 > c2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) \r\n ", "s = input()\r\nprint((s.casefold(),s.upper())[sum((ord(elem)>=65) and (ord(elem)<=90) for elem in s)>(len(s)/2)])\r\n", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if ord(i) > 96:\r\n count += 1\r\n\r\nif count >= len(s) - count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "#word\r\ns=input()\r\nseq=list(s)\r\nupper=0\r\nlower=0\r\nfor i in seq:\r\n if(i.isupper()):\r\n upper+=1\r\n else:\r\n lower+=1\r\nif(upper>lower):\r\n res=s.upper()\r\nelse:\r\n res=s.lower()\r\nprint(res)", "s = input()\r\nc = sum(1 for i in list(s) if i.isupper())\r\nprint(s.upper()) if c > (len(s)-c) else print(s.lower())\r\n", "s = input()\r\ncount_little = 0\r\ncount_big = 0\r\nfor symb in s:\r\n if symb.isupper():\r\n count_big += 1\r\n else:\r\n count_little += 1\r\nif count_big > count_little:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\nword0 = list(word)\r\nword1 = list(word.lower())\r\n\r\nword1count=0\r\nword2count=0\r\n\r\nfor w in word0:\r\n if w in word1:\r\n word1count+=1\r\n else:\r\n word2count+=1\r\n \r\nif word1count>=word2count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = str(input())\r\nl = 0\r\nu = 0\r\n\r\n#FAZER A CONTAGEM DE LETRAS MAIUSCULAS E MINUSCULAS\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n l += 1\r\n if s[i].isupper():\r\n u += 1\r\n\r\n#SE A QUANTIDADE DE MINUSCULAS FOR MENOR QUE A DE MAIUSCULAS ENTÃO COLOCAR TODAS AS LETRAS MAIUSCULAS\r\nif l < u:\r\n s = s.upper()\r\nelse: #SENÃO COLOCAR MINUSCULAS\r\n s = s.lower()\r\n\r\nprint(s)\r\n", "w = input()\r\na1 = 0\r\na2 = 0\r\nword = ''\r\nb = 0\r\nfor i in w:\r\n if ord(i) > 90:\r\n a1 += 1\r\n else:\r\n a2 += 1\r\n\r\nif a1 >= a2:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n \r\n", "s = input()\nu,l = 0,0\nfor i in s:\n\tif i.isupper():\n\t\tu+=1\n\telse:\n\t\tl+=1\nif u > l:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n\n\n\n", "from string import ascii_lowercase as al\r\nfrom string import ascii_uppercase as au\r\n\r\ns = input()\r\nl, u = 0, 0\r\nfor c in s:\r\n if c in al:\r\n l += 1\r\n else:\r\n u += 1\r\nif l >= u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n=input()\r\nc=0\r\nr=0\r\nfor i in range(len(n)):\r\n if ord(n[i]) in range(97,124):\r\n c=c+1\r\n else:\r\n r=r+1\r\nif(r>c):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "a=input()\r\nsmall=0\r\nbig=0\r\nfor i in a:\r\n if i >= 'a' and i <= 'z':\r\n small+=1\r\n else:\r\n big+=1\r\nif small<big:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "\r\n\r\nif __name__ == \"__main__\":\r\n\r\n word = input()\r\n up, lo = 0, 0\r\n for i in word:\r\n if i.upper() == i:\r\n up += 1\r\n else:\r\n lo += 1\r\n #print(up, lo)\r\n if up > lo:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n", "s = input()\r\nlowerCount = 0\r\nfor i in s:\r\n if i.islower():\r\n lowerCount += 1\r\nupperCount = (len(s) - lowerCount)\r\nif (upperCount - lowerCount) <= 0:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "#!/usr/bin/env python\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport sys,bisect,copyreg,copy,statistics,os\r\n\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef IIX(): return (int(x) for x in sys.stdin.readline().split())\r\ndef II(): return (int(inp()))\r\ndef LI(): return list(map(int, inp().split()))\r\ndef LS(): return list(map(str, inp().split()))\r\ndef L(x):return list(x)\r\ndef out(var): return sys.stdout.write(str(var))\r\n\r\ndef main():\r\n word=L(inp())\r\n \r\n u,l=0,0\r\n \r\n for x in word:\r\n if x.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n \r\n if u>l:\r\n out(''.join(word).upper())\r\n else:\r\n out(''.join(word).lower())\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=str(input())\r\nl1=[]\r\nl2=[]\r\nfor i in s:\r\n if i.islower():\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\nif len(l1)>=len(l2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=input()\r\nc_l=0\r\nc_u=0\r\nfor i in range(0,len(a)):\r\n if(a[i].islower()):\r\n c_l+=1\r\n else:\r\n c_u+=1\r\nif(c_u>c_l):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n ", "v=input()\r\ncap=0\r\nlow=0\r\nfor i in v:\r\n if i.isupper():\r\n cap=cap+1\r\n else:\r\n low=low+1\r\nif cap>low:\r\n print(v.upper())\r\nelse:\r\n print(v.lower())", "a=str(input())\r\ncount1=0\r\ncount2=0\r\nfor i in a:\r\n if(i.isupper())==True:\r\n count1=count1+1\r\n elif(i.islower())==True:\r\n count2=count2+1\r\nif(count1>count2):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "st = input()\r\ncounter = 0\r\nfor char in st:\r\n if char.isupper():\r\n counter += 1\r\n\r\nif counter > len(st) // 2:\r\n st = st.upper()\r\nelse:\r\n st = st.lower()\r\n\r\nprint(st)", "word=input()\r\nuppercase_count=sum(1 for c in word if c.isupper())\r\nlowercase_count=len(word)-uppercase_count\r\nif uppercase_count>lowercase_count:\r\n corrected_word=word.upper()\r\nelse:\r\n corrected_word=word.lower()\r\nprint(corrected_word)\r\n", "main = input()\r\nst = list(main)\r\nlo, up = 0, 0\r\nfor i in range(len(st)):\r\n\tif st[i].islower():\r\n\t\tlo+=1\r\n\telif st[i].isupper():\r\n\t\tup+=1\r\nif lo >= up:\r\n\tprint(main.lower())\r\nelif up > lo:\r\n\tprint(main.upper())", "message = input()\r\nupper = sum(1 for c in message if c.isupper())\r\nlower = sum(1 for c in message if c.islower())\r\nif upper > lower:\r\n print(message.upper())\r\nelse:\r\n print(message.lower())", "# Problem: A. Word\r\n# Contest: Codeforces - Codeforces Beta Round #55 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/59/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\n\"\"\" Python 3 compatibility tools. \"\"\"\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\nw = input().strip()\r\nlowers = 0\r\nfor c in w:\r\n if c == c.lower():\r\n lowers += 1\r\n \r\nif lowers < (len(w) - lowers):\r\n print(w.upper())\r\nelse:\r\n print(w.lower())\r\n ", "n=input()\r\nupper = 0\r\nlower = 0\r\nfor i in n:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n\r\nif upper>lower:\r\n n=n.upper()\r\nelif lower>upper or lower==upper:\r\n n=n.lower()\r\nprint(n)\r\n\r\n\r\n\r\n", "#!/usr/bin/python3\n\nimport sys\nimport argparse\nimport json\n\ndef main():\n word = sys.stdin.readline().rstrip()\n\n upper_count = 0\n lower_count = 0\n\n for char in word:\n if char == char.upper():\n upper_count += 1\n else:\n lower_count += 1\n\n if upper_count > lower_count:\n print(word.upper())\n elif upper_count < lower_count:\n print(word.lower())\n else:\n print(word.lower())\n\n\ndef get_tests():\n tests = [(\"\", \"\"),\n (\"HoUse\", \"house\"),\n (\"ViP\", \"VIP\"),\n (\"maTRIx\", \"matrix\")]\n\n for test in tests:\n print(json.dumps({\"input\": test[0], \"output\": test[1]}))\n\nif __name__ == \"__main__\":\n parser = argparse.ArgumentParser()\n parser.add_argument(\"--get-tests\", action=\"store_true\")\n args = parser.parse_args()\n\n if args.get_tests:\n get_tests()\n else:\n main()\n", "s = input()\r\ncapital = [ch for ch in s if ch.isupper()]\r\ncapital = len(capital)\r\nlow = len(s) - capital\r\nif capital > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\ns_0 = []\r\nx = 0\r\ny = 0\r\n\r\nfor i in range(len(s)):\r\n s_0.append(s[i])\r\n\r\nfor letter in s_0:\r\n if letter == letter.upper():\r\n x += 1\r\n else:\r\n y += 1\r\n\r\nif x > y:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "s = input()\r\ncnt_u = 0\r\ncnt_l = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n cnt_l += 1\r\n else:\r\n cnt_u += 1\r\nif cnt_u > cnt_l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncount1=sum(1 for i in s if i.isupper())\r\ncount2=sum(1 for i in s if i.islower())\r\nif count1>count2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import bisect\r\ns=input()\r\nn=len(s)\r\nl=[]\r\nfor i in s:\r\n l.append(ord(i))\r\nl.sort()\r\nind=bisect.bisect_left(l,93)\r\nif ind>n//2:\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "def uplo(string1):\r\n m=0\r\n n=0\r\n for i in range (0,len(string1)):\r\n a=string1[i]\r\n if a.isupper():\r\n m+=1\r\n else:\r\n n+=1\r\n if m>n:\r\n print(string1.upper())\r\n else:\r\n print(string1.lower())\r\nusinp=input()\r\nuplo(usinp)", "word = input() #we read a word\r\n\r\nupper = 0 #upper case letters\r\nlower = 0 #lower case letters\r\n\r\nfor letra in word: #lets count how many upper and lower case are in the given word\r\n if(ord(letra) < ord('a')): #if letra is an upper case letter:\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif(lower >= upper): #if there are more o equal lower case letters then we turn all the word in lower case mode:\r\n print(word.lower())\r\nelse: #otherwise:\r\n print(word.upper())", "s=input()\r\nl=len(s)\r\nx=0\r\ny=0\r\nfor i in range(0,l):\r\n if ord(s[i])>95:\r\n x=x+1\r\n else:\r\n y=y+1\r\nif x>=y:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "alp= \"abcdefghijklmnopqrstuvwxyz\"\r\nword =input()\r\nif sum([a in alp for a in word]) < (len(word)) / 2:\r\n print(word.upper())\r\nelif sum([a in alp for a in word]) == (len(word)) / 2:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "n=input()\r\nm,z=0,0\r\nfor t in n:\r\n if t.isupper():\r\n m+=1\r\n else:\r\n z+=1\r\nif m>z:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "a = list(input())\r\nb = 0\r\nc = 0\r\ne = ''\r\nfor i in range(len(a)):\r\n d = a[i]\r\n if a[i].lower() != d:\r\n b += 1\r\n else:\r\n c += 1\r\nif b <= c:\r\n for i in range(len(a)):\r\n a[i] = a[i].lower()\r\nelse:\r\n for i in range(len(a)):\r\n a[i] = a[i].upper()\r\nfor i in range(len(a)):\r\n e = e + a[i]\r\nprint(e)\r\n", "s = input()\r\ncount_lower = 0\r\ncount_upper = 0\r\nlower_alpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nupper_alpha = lower_alpha.upper()\r\nfor i in s:\r\n if i in lower_alpha:\r\n count_lower += 1\r\n if i in upper_alpha:\r\n count_upper += 1\r\n \r\nif count_upper > count_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x=input()\r\n\r\ncnt_l=0\r\ncnt_u=0\r\n\r\nfor i in range(len(x)):\r\n if(x[i].islower()):\r\n cnt_l+=1\r\n else:\r\n cnt_u+=1\r\n\r\nif(cnt_l>cnt_u or cnt_l==cnt_u):\r\n print(x.lower())\r\nelif(cnt_u>cnt_l):\r\n print(x.upper())", "s = input()\r\nlowercase_count = 0\r\nuppercase_count = 0\r\nfor i in s:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n uppercase_count += 1\r\n else:\r\n lowercase_count += 1\r\nif lowercase_count >= uppercase_count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def sol():\r\n s=input()\r\n u=0\r\n l=0\r\n for i in s:\r\n if ord(i)<93:\r\n u=u+1\r\n else:\r\n l=l+1\r\n if l>=u:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n\r\n\r\n\r\nsol()\r\n", "s = input()\r\nlower = []\r\nupper = []\r\nfor i in s:\r\n if i.islower():\r\n lower.append(i)\r\n else:\r\n upper.append(i)\r\nif len(upper)>len(lower):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "\n\nstring = str( input( ) )\n\nupper = 0\nlower = 0\n\nfor ch in string :\n\n if ( ch.isupper() == True ) :\n\n upper += 1\n\n else :\n\n lower += 1\n\nif ( upper > lower ) :\n\n print( string.upper() )\n\nif ( upper < lower ) or ( upper == lower ):\n\n print( string.lower() )\n\n \n\n", "def word(n):\r\n x1=0\r\n x2=0\r\n for i in n:\r\n if i.isupper():\r\n x1=x1+1\r\n else:\r\n x2=x2+1\r\n if x1>x2:\r\n print(n.upper())\r\n else:\r\n print(n.lower())\r\nn=input()\r\nword(n)", "\nwords = input()\nupper_count =0\nlower_count = 0\n\nfor i in range(len(words)):\n if words[i].isupper():\n upper_count += 1\n elif words[i].islower():\n lower_count +=1\n \nif upper_count>lower_count:\n print(words.upper())\nelif lower_count>upper_count:\n print(words.lower())\nelse:\n print(words.lower())\n\n\n", "word = str(input())\n\n\n\nuppercase = sum(map(str.isupper, word))\nlowercase = sum(map(str.islower, word))\n\nif lowercase >= uppercase:\n print(word.lower())\n\nelse:\n print(word.upper())\n ", "t=input()\r\ncntup=0\r\ncntlo=0\r\nif(len(t)<=100):\r\n for i in range (0,len(t),1):\r\n if(t[i]>='a' and t[i]<='z'):\r\n cntlo+=1\r\n else:\r\n cntup+=1\r\n if(cntlo==cntup):\r\n print(t.lower())\r\n elif(cntlo>cntup):\r\n print(t.lower())\r\n else:\r\n print(t.upper())\r\nelse:\r\n exit\r\n ", "word = input()\r\nlower_count = 0\r\nfor letter in word:\r\n if letter.islower():\r\n lower_count += 1\r\n\r\nif lower_count >= len(word) - lower_count:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)", "def word():\r\n string = input()\r\n num_upper = 0\r\n num_lower = 0\r\n for letter in string:\r\n if letter.isupper():\r\n num_upper += 1\r\n else:\r\n num_lower += 1\r\n if num_upper <= num_lower:\r\n\r\n print(string.lower())\r\n else:\r\n print(string.upper())\r\n\r\n\r\nif __name__ == '__main__':\r\n word()\r\n", "word = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n \r\nif (upper > lower):\r\n word = word.upper()\r\n print(word)\r\nelse:\r\n word = word.lower()\r\n print(word)", "x=input()\r\ny=list(x)\r\ncount1=0\r\ncount2=0\r\nfor i in y:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n count1+=1\r\n\r\nfor j in y:\r\n if j in \"abcdefghijklmnopqrstuvwxyz\":\r\n count2+=1\r\nif count1<=count2:\r\n print(\"\".join(y).lower())\r\nelse:\r\n print(\"\".join(y).upper())\r\n\r\n", "s=input()\ncounter=0\nfor i in range(len(s)):\n if s[i]==s[i].upper():\n counter +=1\nif counter >len(s)/2:\n print(s.upper())\nelse:\n print(s.lower())\n", "c=0\r\nc1=0\r\nn=input()\r\nfor i in n:\r\n if i>='A' and i<='Z':\r\n c+=1\r\n else:\r\n c1+=1\r\nif c>c1:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "ch=input()\ns1=s2=0\nfor i in ch:\n if i==i.lower():\n s1+=1\n elif i==i.upper():\n s2+=1\nif s2>s1:\n print(ch.upper())\nelse:\n print(ch.lower())\n", "s=input()\r\nlis=list(s)\r\nc=0\r\ns1=0\r\nfor i in lis:\r\n if i>='A' and i<='Z':\r\n c=c+1\r\n else:\r\n s1=s1+1\r\nif c>s1:\r\n print(s.upper())\r\nelif c<s1:\r\n print(s.lower())\r\nelif c==s1:\r\n print(s.lower())\r\n", "n=input()\r\na='qwertyuioplkjhgfdsazxcvbnm'\r\ncounta=0\r\ncountA=0\r\nfor i in n:\r\n if i in a:\r\n counta+=1\r\n if i not in a:\r\n countA+=1\r\nif(counta>=countA):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "st = input()\r\n\r\nup = lo = 0\r\n\r\nfor s in st:\r\n if s.isupper():\r\n up += 1\r\n else:\r\n lo += 1\r\n \r\nif up == lo:\r\n print(st.lower())\r\nelif up > lo:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "word = input()\nup = 0\nlow = 0\nfor char in word:\n if char.isupper():\n up += 1\n else:\n low += 1\nif up > low:\n print(word.upper())\nelse:\n print(word.lower())", "s=input()\r\nupr=0\r\nlwr=0\r\nfor e in s:\r\n if e.isupper():\r\n upr+=1\r\n if e.islower():\r\n lwr+=1\r\nif upr>lwr:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a=str(input())\r\nup=0\r\nlow=0\r\nfor i in a:\r\n if i.islower():\r\n low+=1\r\n else:\r\n up+=1\r\nif low>up:\r\n print (a.lower())\r\nelif low==up:\r\n print (a.lower())\r\nelse:\r\n print (a.upper())", "\r\ns = input(\"\")\r\nz = 0\r\n\r\nfor i in s:\r\n if i.isupper() == True:\r\n z+=1\r\n if i.islower() == True:\r\n z-=1\r\n\r\nif z > 0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "X=input()\r\n\r\nL=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nC_L=0\r\nC_U=0\r\n\r\nfor i in X:\r\n if i in L:\r\n C_L+=1\r\n else:\r\n C_U+=1\r\n\r\nif C_U > C_L :\r\n print (X.upper())\r\nelse:\r\n print (X.lower())\r\n\r\n", "w=input()\r\nk=w.lower()\r\ns=0\r\nb=0\r\nfor i in range(len(w)):\r\n if w[i]==k[i]:\r\n s+=1\r\n else:\r\n b+=1\r\nif b>s:\r\n print(w.upper())\r\nelse:\r\n print(k)", "word = input()\r\nn_upper = sum([x.isupper() for x in word])\r\nif n_upper > len(word)//2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "count=0\r\ncount2=0\r\ns=input()\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n count+=1\r\n else:\r\n count2+=1\r\nif count>count2:\r\n print(s.upper())\r\nelif count<=count2:\r\n print(s.lower())\r\n", "#Word\r\n\r\ns = input()\r\nl=0\r\nh=0\r\nfor i in s:\r\n if(i.islower()):\r\n l=l+1\r\n else :\r\n h=h+1\r\nif l==h:\r\n print(s.lower())\r\nelif l>h:\r\n print(s.lower())\r\nelse: \r\n print(s.upper())\r\n ", "s = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in s:\r\n if ord(\"A\")<=ord(i)<=ord(\"Z\"):\r\n c1+=1\r\nl1 = int(len(s)/2)+1\r\nif c1>=l1:\r\n s=s.upper()\r\nelse:\r\n s = s.lower() \r\nprint(s)", "s = input()\nl = len(s)\ncount = 0\nfor i in s:\n if i >= 'a' and i <= 'z':\n count = count+1\nif count >= (l/2):\n print(s.lower())\nelse:\n print(s.upper())\n\n\t \t \t\t \t\t\t \t\t\t\t \t \t \t", "str=input()\r\ncountl=0\r\ncountu=0\r\nfor i in str:\r\n if(i.islower()):\r\n countl+=1\r\n if(i.isupper()):\r\n countu+=1\r\n\r\nif(countl>=countu):\r\n print(str.lower())\r\n\r\nelse:\r\n print(str.upper())\r\n", "s = input()\r\nsum_upper = 0\r\nsum_lower = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n sum_upper += 1\r\n else:\r\n sum_lower += 1\r\nif (sum_lower >= sum_upper):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = input()\r\n\r\ncount_low = 0\r\ncount_high = 0\r\n\r\nfor i in range(len(a)):\r\n if(a[i].islower()):\r\n count_low +=1\r\n elif(a[i].isupper()):\r\n count_high +=1\r\n \r\nif(count_high > count_low):\r\n print(a.upper())\r\n\r\nelif(count_low > count_high or count_low == count_high):\r\n print(a.lower())\r\n\r\n", "s=input()\nupper_count = 0\nlower_count = 0\n \nfor c in s:\n if c.isupper():\n upper_count +=1\n else:\n lower_count +=1\n\nif lower_count >= upper_count:\n print(s.lower())\nelse:\n print(s.upper())\n\n#fffffefefe\n \t \t \t \t \t", "#initializes word and case count\r\nword = input()\r\ncapitals = 0\r\nlowercases = 0\r\n\r\n#counts how many uppercase and lowercase letters there are \r\n#(ASCII values of upper alphabet is 65-90)\r\nfor letter in word:\r\n if ord(letter) <= 90:\r\n capitals += 1\r\n else:\r\n lowercases += 1\r\n\r\n#prints modified word depending on count of upper and lower case letters\r\nif capitals > lowercases:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word=str(input())\r\ncounter_1=0\r\ncounter_2=0\r\nfor index in range(len(word)):\r\n num=ord(word[index])\r\n if (65<=num<=90):\r\n counter_1+=1\r\n else:\r\n counter_2+=1\r\nif (counter_1>counter_2):\r\n print(word.upper())\r\nelse:\r\n print(word.lower()) ", "n = input()\nlc = 0\nuc = 0\nfor each in n:\n if ord(each) >= 97:\n lc += 1\n else:\n uc += 1\nif uc > lc :\n n = n.upper()\n print(n)\nelse:\n n = n.lower()\n print(n)\n", "n = input()\r\n\r\nucount = 0\r\nlcount = 0\r\n\r\nfor i in n:\r\n if i.upper() == i:\r\n ucount += 1\r\n else:\r\n lcount += 1\r\n\r\nif ucount > lcount:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "n=input()\r\nl=list(n)\r\ns=0\r\nla=0\r\nfor i in range(len(l)):\r\n if 65<=ord(l[i])<=90:\r\n la+=1\r\n elif 97<=ord(l[i])<=122:\r\n s+=1\r\nif s>=la:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s = input()\r\nupper = 0\r\ndown = 0\r\nsize = len(s)\r\nfor i in range(size):\r\n if s[i].upper() == s[i]:\r\n upper+=1\r\n else:\r\n down+=1\r\nif upper > down:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "name=input()\r\nlower=0\r\nupper=0\r\nx=name.lower()\r\ny=name.upper()\r\nfor i in name:\r\n if(i.islower()):\r\n lower+=1\r\n else:\r\n upper+=1\r\nif(lower>upper):\r\n print(x)\r\nelif(upper>lower):\r\n print(y)\r\nelse:\r\n print(x)", "s = input()\r\nu,l = 0,0\r\nfor i in s :\r\n if i==i.lower() :\r\n l+=1\r\n else :\r\n u+=1\r\nif l>=u :\r\n print(s.lower())\r\nelse :\r\n print(s.upper())\r\n", "A=str(input())\nup_a=A.upper()\ncount=0\nfor i in range(len(A)):\n if up_a[i]==A[i]:\n count+=1\n \nif len(A)%2!=0:\n\n\n if count>=(len(A)+1)//2:\n print(A.upper())\n else:\n print(A.lower())\nelse:\n if count>len(A)//2:\n print(A.upper())\n else:\n print(A.lower())", "a = input()\r\nlocase = 0\r\nupcase = 0\r\nfor i in range(len(a)):\r\n if a[i].lower() == a[i]:\r\n locase += 1\r\n else:\r\n upcase += 1\r\nif upcase > locase:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in range(len(word)):\r\n if word[i] == word[i].lower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif upper > lower:\r\n word = word.upper()\r\nelif lower >= upper:\r\n word = word.lower()\r\n\r\nprint(word)", "s= input()\r\nlowercaseLetters,uppercaseLetters=0,0\r\nfor i in s :\r\n if i.isupper()== True:\r\n uppercaseLetters+=1\r\n else:\r\n lowercaseLetters+=1\r\n\r\nif uppercaseLetters>lowercaseLetters:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "wd = input()\r\nif sum(1 for c in wd if c.isupper()) > len(wd) / 2:\r\n print(wd.upper())\r\nelse:\r\n print(wd.lower())\r\n ", "u=0\r\nl=0 \r\ni=input(\"\")\r\nk=[x for x in i]\r\nfor x in k:\r\n if x.isupper() == True:\r\n u+=1\r\n else:\r\n l+=1\r\nif u > l:\r\n print(i.upper())\r\nelse:\r\n print(i.lower())", "word = input()\r\nucount = 0\r\nlcount = 0\r\nfor elm in word:\r\n if elm.isupper():\r\n ucount += 1\r\n elif elm.islower():\r\n lcount += 1\r\n\r\nif ucount > lcount:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "s=input()\r\nl=len(s)\r\nL=0\r\nU=0\r\nfor i in s:\r\n if i.islower():\r\n L+=1\r\n if i.isupper():\r\n U+=1\r\nif L<U:\r\n print(s.upper())\r\nif L>U or L==U:\r\n print(s.lower())\r\n \r\n ", "def word(string):\r\n caps = 0\r\n for elem in string:\r\n if (elem.isupper()):\r\n caps += 1\r\n if(caps > len(string) // 2):\r\n return string.upper()\r\n else:\r\n return string.lower()\r\n \r\nprint(word(input()))", "def fancy(s):\r\n\tm,n=0,0\r\n\tfor i in s:\r\n\t\tif i.isupper():\r\n\t\t\tm+=1\r\n\t\telse:\r\n\t\t\tn+=1\r\n\tif m>n:\r\n\t\tprint(s.upper())\r\n\telse:\r\n\t\tprint(s.lower())\r\ns= input()\r\nfancy(s)", "s = input()\r\n\r\nup = 0\r\nlow = 0\r\n\r\nfor x in s:\r\n if x.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif low >= up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a=input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(a)):\r\n if(a[i].isupper()):\r\n upper=upper+1\r\n else:\r\n lower=lower+1\r\nif(upper>lower):\r\n print(a[0:].upper())\r\nelif(lower>=upper):\r\n print(a[0:].lower())", "s = input()\r\n\r\nn = len(s)\r\n\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor i in range(n):\r\n if ord(s[i]) >= 65 and ord(s[i]) < 91 :\r\n count_upper += 1\r\n\r\n else:\r\n count_lower += 1\r\n\r\nif count_lower >= n/2:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)\r\n", "s=input()\r\nuc,lc=0,0\r\nfor i in s:\r\n if i.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\nif uc>lc:\r\n print(s.upper())\r\nelif lc>uc:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s = input()\r\nc_s = c_u = 0\r\nfor i in s:\r\n if i.isupper():\r\n c_u += 1\r\n else:\r\n c_s += 1\r\nif c_u > c_s:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "a=input()\r\nb=0\r\nfor i in range (len(a)):\r\n if a[i] in 'QWERTYUIOPLKJHGFDSAZXCVBNM':\r\n b=b+1\r\nif b>len(a)/2:\r\n print(str.upper(a))\r\nelse:\r\n print(str.lower(a))\r\n", "def Convert(string): \r\n list1=[] \r\n list1[:0]=string \r\n return list1 \r\n\r\ns = input(\"\")\r\na = Convert(s)\r\n\r\nl = 0\r\nu = 0\r\n\r\nfor i in a:\r\n if i.lower() == i:\r\n l+=1\r\n else:\r\n u+=1\r\n\r\nif (l > u):\r\n print(s.lower())\r\nelif(l < u):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nx=0\r\nd=0\r\nfor i in range(len(a)):\r\n if(a[i])==a[i].upper():\r\n x+=1\r\n elif(a[i]==a[i].lower()):\r\n d+=1\r\nif(x>d):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "enter = input()\nclower = 0\ncupper = 0\nfor letter in enter:\n if letter.isupper():\n cupper+=1\n else:\n clower+=1\n\nif clower > cupper:\n print(enter.lower()) \nelif clower < cupper:\n print(enter.upper())\nelif clower == cupper:\n print(enter.lower())", "s1=0\r\ns2=0\r\na=input()\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n s1+=1\r\n if a[i].islower():\r\n s2+=1\r\nif s1>s2:\r\n print(a.upper())\r\nelif s1<s2:\r\n print(a.lower())\r\nelse:\r\n print(a.lower())\r\n", "# define variables\r\nn_upper = 0\r\nn_lower = 0\r\n\r\n# get input\r\ntext = input()\r\n\r\n#loop through each character in the string to find number of upper and lower characters\r\nfor char in text:\r\n if char.isupper():\r\n n_upper += 1\r\n else:\r\n n_lower += 1\r\n \r\n# check if number of upper characters is greater than lower characters \r\nif n_upper > n_lower:\r\n print(text.upper())\r\nelse:\r\n print(text.lower())", "s=input()\r\nlow=0\r\nhigh=0\r\nn=len(s)\r\nfor i in range(n):\r\n\tif('A'<=s[i]<='Z'):\r\n\t\thigh+=1\r\n\telse:\r\n\t\tlow+=1\r\nif(low>=high):\r\n\ts=s.lower()\r\n\tprint(s)\r\nelse:\r\n\ts=s.upper()\r\n\tprint(s)", "a = input()\r\nl = 0\r\nu = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper() == True:\r\n u += 1\r\n else:\r\n l += 1\r\nif u > l:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "def main():\n word = input()\n upper = 0\n lower = 0\n for letter in word:\n if letter.isupper():\n upper += 1\n else:\n lower += 1\n if upper > lower:\n print(word.upper())\n else:\n print(word.lower())\n\nif __name__ == \"__main__\":\n main()", "a=input()\r\nu,l=0,0\r\nfor x in a:\r\n\tif(x.isupper()):\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif u>l:\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())\r\n", "# print(ord('Z'))\r\nword = input()\r\ndict = {\r\n 'lowercase': 0,\r\n 'uppercase': 0\r\n}\r\n\r\nfor letter in word:\r\n if ord(letter) >= 65 and ord(letter) <= 90:\r\n dict['uppercase'] += 1\r\n else:\r\n dict['lowercase'] += 1\r\n \r\nif dict['uppercase'] > dict['lowercase']:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "def diff(a, b):\r\n dc = 0\r\n for i in range(min(len(a), len(b))):\r\n if a[i] != b[i]:\r\n dc += 1\r\n return dc\r\n \r\ns = input()\r\n \r\na = diff(s, s.lower())\r\nb = diff(s, s.upper())\r\nif a > b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nsmall=0\r\nbig=0\r\nfor i in range(0,len(s)):\r\n if(s[i].isupper()):\r\n big+=1\r\n else:\r\n small+=1\r\nif(big>small):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "m = str(input())\r\n\r\ndown = ['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\nup = ['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\n\r\ncnt_up = 0\r\ncnt_down = 0\r\n\r\nfor i in range(len(m)):\r\n if m[i] in down:\r\n cnt_down = cnt_down + 1\r\n else :\r\n cnt_up = cnt_up + 1\r\n\r\nif cnt_up > cnt_down :\r\n print(m.upper())\r\nelse :\r\n print(m.lower())", "\"\"\"\n Time O(N) 108 ms\n Space O(1) 19700 KB\n\"\"\"\n\n\ndef f():\n s = input()\n n = len(s)\n lowers = 0\n uppers = 0\n for c in s:\n if 0 <= ord(c) - ord('A') <= 25:\n uppers += 1\n elif 0 <= ord(c) - ord('a') <= 25:\n lowers += 1\n if lowers * 2 >= n:\n return s.lower()\n return s.upper()\n\n\nprint(f())\n", "str = input()\r\nu = 0\r\nl = 0\r\nfor i in range(len(str)):\r\n if str[i].isupper():\r\n u += 1\r\n else:\r\n l+= 1\r\n\r\nif u>l:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "a=input()\r\nb=[i for i in a]\r\nc=a.lower()\r\nd=[i for i in c]\r\ne=0\r\nf=0\r\nfor i in range(len(a)):\r\n if(d[i]>b[i]):\r\n e+=1\r\n else:\r\n f+=1\r\nif(e>f):\r\n print(a.upper())\r\nelse:\r\n print(c)\r\n", "s = input()\ncount_u = 0\ncount_l = 0\n\nfor i in range(len(s)):\n if s[i] == s[i].upper():\n count_u += 1\n if s[i] == s[i].lower():\n count_l += 1\n\nif count_u > count_l:\n print(s.upper())\nelse:\n print(s.lower())", "a = input()\r\nl = 'abcdefghijklmnopqrtsuvwxyz'\r\nu = l.upper()\r\n\r\nuc = 0\r\nlc = 0\r\nfor i in a:\r\n if i in u:\r\n uc += 1\r\n else:\r\n lc += 1\r\nif uc>lc:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "n=input()\r\nu=0\r\nl=0\r\nfor i in n:\r\n if(ord(i)<97):\r\n u+=1\r\n else:\r\n l+=1\r\nif(l<u):\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n)", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\n\r\ns = input().strip()\r\nu = 0\r\nfor each in s:\r\n u += each.isupper()\r\n\r\nif u > len(s) - u:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "str = input()\nlower, upper = 0, 0\nfor i in range(len(str)):\n if (str[i].isupper()): \n upper += 1\n else:\n lower += 1\n\nif (lower < upper):\n print(str.upper())\nelse:\n print(str.lower())\n\t \t \t\t \t\t\t\t\t\t\t\t \t\t\t\t \t", "# URL: https://codeforces.com/problemset/problem/59/A\ns = input()\nl = sum(map(lambda ch: ch.islower(), s))\nr = sum(map(lambda ch: ch.isupper(), s))\nprint(s.lower() if l >= r else s.upper())\n", "slovo = input()\r\nm = 0\r\nb = 0\r\nslov1 = list(slovo)\r\nfor i in slov1:\r\n if ord(u'{}'.format(i)) > 90:\r\n m+=1\r\n else:\r\n b+=1\r\nif b > m:\r\n print(slovo.upper())\r\nelse:\r\n print(slovo.lower())", "import string\r\nupper = list(string.ascii_uppercase)\r\nline = str(input())\r\nres = 0\r\nfor i in line:\r\n if i in upper:\r\n res += 1\r\nprint(line.upper() if res > len(line)//2 else line.lower())", "k=str(input())\nlower=0\nupper=0\nfor i in k:\n if (i.islower()):\n lower+=1\n \n else:\n upper+=1\n \nif upper>lower:\n print(k.upper())\nelse:\n print(k.lower())\n\t \t \t \t\t \t \t\t\t \t\t\t\t \t", "word = input()\r\n\r\nlower_len = int()\r\nupper_len = int()\r\n\r\nfor char in word:\r\n if char == char.upper():\r\n upper_len += 1\r\n else:\r\n lower_len +=1\r\n\r\nif lower_len < upper_len:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "a = input()\ncountM = 0\ncountm = 0\nfor i in range (len(a)):\n\tif a[i].islower():\n\t\tcountm += 1\n\telse:\n\t\tcountM += 1\nif countm >= countM:\n\tprint(a.lower())\nelse:\n\tprint(a.upper())", "str1 = input()\r\nu,l = 0,0\r\nfor i in str1:\r\n if i.isupper():\r\n u+=1\r\n if i.islower():\r\n l+=1\r\nif u>l :\r\n print(str1.upper())\r\nelif l>u or u==l:\r\n print(str1.lower())\r\n", "a=input()\r\nnum=0\r\ni=0\r\nwhile i < len(a):\r\n if 'A'<=a[i]<='Z':\r\n num=num+1\r\n i=i+1\r\nif num<=len(a)/2:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "n=input()\r\ns1=sum(1 for c in n if c.islower())\r\ns2=sum(1 for c in n if c.isupper())\r\nif s1==s2:\r\n print(n.lower())\r\nelif s1>s2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "first=input()\r\nup=0\r\nlow=0\r\n\r\nfor i in first:\r\n if i==i.upper():\r\n up+=1\r\n else:\r\n low+=1\r\n \r\nif up>low:\r\n print( first.upper())\r\nelse:\r\n print( first.lower() ) ", "e = input()\r\nUC= 0\r\nLC= 0\r\n\r\nfor i in e:\r\n if i.isupper():\r\n UC = UC + 1\r\n if i.islower():\r\n LC = LC+1\r\n\r\nif UC > LC:\r\n e= e.upper()\r\n print (e)\r\nif UC < LC:\r\n e= e.lower()\r\n print (e)\r\nif UC == LC:\r\n e= e.lower()\r\n print (e)", "def func():\r\n s=list(\"abcdefghijklmnopqrstuvwxyz\")\r\n c=list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\n c1=0\r\n c2=0\r\n st=input()\r\n for i in st:\r\n if i in s:\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\n if(c1==c2) or c1>c2:\r\n st=st.lower()\r\n print(st)\r\n else:\r\n st=st.upper()\r\n print(st)\r\n \r\nfunc()", "x = input()\r\na = 0\r\nb = 0\r\nfor i in x:\r\n if i == i.upper():\r\n b += 1\r\n else:\r\n a += 1\r\nprint(x.upper() if b > a else x.lower())", "s=input()\r\ncu,cl=0,0\r\nfor i in s:\r\n if i in 'abcdefghijklmnopqrstuvwxyz':cl+=1\r\n else:cu+=1\r\nif cu>cl:s=s.upper()\r\nelse:s=s.lower()\r\nprint(s)", "def Check(letter):\r\n return True if letter.islower() else False\r\nUpper = 0\r\nLower = 0\r\nString = input()\r\nfor i in String:\r\n if Check(i):\r\n Lower += 1\r\n else:\r\n Upper += 1\r\nif Upper > Lower:\r\n print(String.upper())\r\nelse:\r\n print(String.lower())", "def lowerlize(name):\r\n return name[0].lower() + name[1:len(name)].lower()\r\ndef upperlize(name):\r\n return name[0].upper() + name[1:len(name)].upper()\r\nn=input()\r\na=0\r\nb=0\r\nfor i in n:\r\n if i.islower():\r\n a+=1\r\n else:\r\n b+=1\r\nif a>b:\r\n print(lowerlize(n))\r\nelif a==b:\r\n print(lowerlize(n))\r\nelse:\r\n print(upperlize(n))", "s=input();c=0\r\nfor x in s:c+=int(x.isupper())\r\nprint([s.upper(),s.lower()][c<=len(s)//2])", "s = input()\r\nlower_case = []\r\nupper_case = []\r\n\r\nwhile not (s.isalpha() and (1 <= len(s) <= 100)):\r\n s = input()\r\n\r\nfor i in s:\r\n if i.islower():\r\n lower_case.append(i)\r\n elif i.isupper():\r\n upper_case.append(i)\r\n \r\nif len(upper_case) > len(lower_case):\r\n print(s.upper())\r\nelif len(upper_case) < len(lower_case):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncap=0\r\nsm=0\r\nfor c in s :\r\n if c.isupper():\r\n cap+=1\r\n else:\r\n sm+=1\r\nif cap>sm:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s1=input()\r\nl1=len(s1)\r\ncount=0\r\nfor i in s1:\r\n if(i.islower()==True):\r\n count=count+1\r\nif(2*count>=l1):\r\n print(s1.lower())\r\nelse:\r\n print(s1.upper())", "\r\ns = input()\r\n\r\nupper = 0\r\nlower = 0\r\nansw = \"\"\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper > lower:\r\n answ = s.upper()\r\nelif lower > upper:\r\n answ = s.lower()\r\nelse:\r\n answ = s.lower()\r\n\r\nprint(answ)\r\n", "s=str(input()) \r\nup=0\r\nlo=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up+=1\r\n else:\r\n lo+=1\r\nif lo>=up :\r\n x=s.lower()\r\n print(x)\r\nelse:\r\n x=s.upper()\r\n print(x)", "s=input()\r\nk1=0\r\nk2=0\r\nfor i in range(len(s)):\r\n j=s[i].islower()\r\n if j==True:\r\n k1+=1\r\n else:\r\n k2+=1\r\nif k1>=k2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\nlowercase = 0\r\nuppercase = 0\r\n\r\nfor c in word:\r\n if c.islower() == True:\r\n lowercase = lowercase + 1\r\n else:\r\n uppercase = uppercase + 1\r\n\r\nif(lowercase >= uppercase):\r\n word = word.lower()\r\n print(word)\r\nelse:\r\n word = word.upper()\r\n print(word)\r\n", "word = input()\r\nuppercase,lowercase = 0,0\r\nfor i in word:\r\n if i>='A' and i<='Z':\r\n uppercase += 1\r\n else: lowercase += 1\r\nif uppercase>lowercase:\r\n print(word.upper())\r\nelse: print(word.lower())", "word = input()\nup = 0\ndown = 0\nfor i in word:\n if i == i.upper():\n up += 1\n else:\n down += 1\n\nif up > down:\n print(word.upper())\nelse:\n print(word.lower())", "s = input()\r\nl = sum([x.islower() for x in s])\r\nprint([s.upper(),s.lower()][l>=len(s)-l])\r\n", "s=input()\r\nsol=[s.lower(),s.upper()][sum(x<'[' for x in s)*2>len(s)]\r\nprint(sol)\r\n", "x = 0\r\nword = input()\r\nfor i in word:\r\n if ord(i) < 91:\r\n x += 1\r\n else: x -= 1\r\nif x > 0:\r\n print(word.upper())\r\nelse: print(word.lower())", "t = input()\r\nur = 0\r\nlr = 0\r\nfor i in t:\r\n if(i.isupper()):\r\n ur += 1 \r\n else:\r\n lr += 1 \r\nif(ur>lr):\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "a = str(input())\r\nup = lo = 0\r\nfor i in range(len(a)):\r\n\tif a[i].isupper()==True:\r\n\t\tup+=1\r\n\telse:\r\n\t\tlo+=1\r\n\r\nif lo>=up:\r\n\tprint(a.lower())\r\nelse:\r\n\tprint(a.upper())", "word = input()\nc = 0\n\nfor i in word:\n if i.isupper() == True:\n c += 1\n else:\n c -= 1\nif c > 0:\n print(str.upper(word))\nelif c == 0:\n print(str.lower(word))\nelse:\n print(str.lower(word))", "s=input()\r\na=0\r\nb=0\r\nfor i in s:\r\n if i>'Z':\r\n a+=1\r\n else:\r\n b+=1\r\nif a>=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\nuc = 0\nfor i in s:\n if i.isupper():\n uc += 1\nif uc> len(s)-uc:\n print(s.upper())\nelse:\n print(s.lower())\n", "string = input()\r\ncase_upper = 0\r\ncase_lower = 0\r\nfor i in range(0, len(string)):\r\n if(string[i].isupper()):\r\n case_upper = case_upper + 1\r\n # print(case_upper)\r\n \r\n# print(case_upper)\r\ncase_lower = len(string) - case_upper\r\n# print(case_lower)\r\n\r\nif(case_lower >= case_upper):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n \r\n ", "s=input()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i>='a' and i<='z':\r\n l=l+1\r\n if i>='A' and i<='Z':\r\n u=u+1\r\nif l>=u:\r\n ans=s.lower()\r\nelse:\r\n ans=s.upper()\r\nprint(ans)", "s = input()\r\nupper = [a for a in s if a.isupper()]\r\na1 = ''.join(upper)\r\nlower =[b for b in s if b.islower()]\r\nb1 = ''.join(lower)\r\nif len(a1)>len(b1):\r\n print(s.upper())\r\nelif len(a1)<len(b1) or len(a1)==len(b1):\r\n print(s.lower())\r\n \r\n", "s=input()\r\nc=0\r\nfor i in s:\r\n if(ord(i)<=90):\r\n c+=1\r\nif(c<=len(s)/2):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "s = input()\nr = 0\nb = 0\nfor i in range(0,len(s)):\n if s[i].isupper():\n r += 1\n else:\n b += 1\nif b >= r:\n print(s.lower())\nelse:\n print(s.upper())", "str1 = input()\nl1 = list(str1)\nupper = 0\nlower = 0\nfor i in range(len(l1)):\n if l1[i].isupper() == True:\n upper += 1\n else:\n lower += 1 \nif upper > lower:\n print(str1.upper())\nelse:\n print(str1.lower())", "word=input()\r\nl=0\r\nu=0\r\n\r\nfor i in range(0,len(word)):\r\n if(word[i].islower()):\r\n l=l+1\r\n else:\r\n u=u+1\r\n \r\nif(u>l):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "# -*- coding: utf-8 -*-\n\n\ns = str(input())\n\nlower_word = 0\nupper_word = 0\n\nfor i in range(len(s)):\n if s[i].islower():\n lower_word += 1\n else:\n upper_word += 1\n\nif lower_word >= upper_word:\n print(s.lower())\nelse:\n print(s.upper())\n", "word=input()\ncnt=0\ncnt2=0\nfor i in range(0,len(word),1):\n if word[i].isupper()==True:\n cnt+=1\n else:\n cnt2+=1\n\nif cnt<=cnt2:\n print(word.lower())\nelse:\n print(word.upper())\n \t\t\t\t \t \t \t\t\t\t \t\t\t \t\t\t", "s = str(input())\r\ne = 0\r\nup= 0\r\nwe = 0\r\nfor y in s:\r\n abc = str(s[e])\r\n is_low = abc.islower()\r\n if is_low == False:\r\n up = up + 1\r\n else:\r\n we = we + 1\r\n e = e + 1\r\nif up > we:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "a = input()\r\ncl = 0\r\ncu = 0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n cl += 1\r\n else:\r\n cu += 1\r\nif cl > cu:\r\n print(a.lower())\r\nelif cu > cl:\r\n print(a.upper())\r\nelif cl == cu:\r\n print(a.lower())\r\n", "s = input()\r\nn_upper = 0\r\nfor i in s:\r\n if i == i.upper():\r\n n_upper +=1\r\n \r\nif n_upper > len(s)/2:\r\n print(s.upper())\r\nelif n_upper <= len(s)/2:\r\n print(s.lower())", "s=input()\nu=0\nl=0\nfor i in s:\n if i.islower():\n l+=1\n else:\n u+=1\nif u>l:\n b=s.upper()\nelse:\n b=s.lower()\nprint(b)\n\n\n \t\t \t \t\t\t\t \t \t \t\t \t \t\t", "str1 = input()\r\nc = 0\r\nfor x in str1:\r\n if x.isupper():\r\n c += 1\r\n\r\nif c > len(str1) // 2:\r\n str1 = str1.upper()\r\nelse:\r\n str1 = str1.lower()\r\n\r\nprint(str1)", "def word(s):\r\n count = 0\r\n for i in s:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n count+=1\r\n if len(s)-count >= count:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n \r\nword(input())", "a = input()\r\nkb = 0\r\nkm = 0\r\nl = ''\r\nam = ''\r\nfor i in range(len(a)):\r\n if (ord(a[i]) > 64) and (ord(a[i]) < 91):\r\n kb += 1\r\n else:\r\n km += 1\r\nif kb > km:\r\n for i in range(len(a)):\r\n if (ord(a[i]) > 96) and (ord(a[i]) < 123):\r\n am = chr(ord(a[i]) - 32)\r\n else:\r\n am = a[i]\r\n l = l + am\r\nelse:\r\n for i in range(len(a)):\r\n if (ord(a[i]) > 64) and (ord(a[i]) < 91):\r\n am = chr(ord(a[i]) + 32)\r\n else:\r\n am = a[i]\r\n l = l + am\r\nprint(l)", "original = input()\r\nlower, upper = 0, 0\r\nfor letter in original:\r\n if letter.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n original = original.upper()\r\nelse:\r\n original = original.lower()\r\nprint(original)\r\n", "s = (input())\r\nc = 0\r\nl=0\r\nfor i in range(len(s)):\r\n if s[i].isupper() == 1:\r\n c = c+1\r\n if s[i].islower() == 1:\r\n l = l+1\r\nif c>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "str = input()\r\ncnt = 0\r\nfor i in str:\r\n if i.isupper(): cnt += 1\r\n else: cnt += -1\r\n\r\nif cnt <= 0: print(str.lower())\r\nelse: print(str.upper())", "word = input()\r\nword_list = list(word)\r\nupper, lower = 0, 0\r\nfor i in word_list:\r\n if i.isupper():\r\n upper += 1\r\n else:\r\n lower +=1\r\nif upper > lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "string = input()\r\nlow, hi = 0, 0\r\n\r\nfor i in range(len(string)):\r\n if ord(string[i]) >= 97:\r\n low += 1\r\n else:\r\n hi += 1\r\n\r\nif low >= hi:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "word = input()\r\ncount = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n count = count+1\r\nans = len(word)//2\r\nif count > ans:\r\n print(word.upper())\r\nelif ans == count:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "s = input()\r\ncont1 = 0\r\ncont2 = 0\r\nfor i in s:\r\n if 65<=ord(i)<=90:\r\n cont1 = cont1 + 1\r\n else:\r\n cont2 = cont2 + 1\r\nif cont1>cont2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "from math import ceil\r\n\r\nword = input()\r\n\r\ncont = 0\r\nfor i in word:\r\n if i.islower():\r\n cont += 1\r\n\r\nprint(word.upper()) if ceil(len(word)/2) > cont else print(word.lower())", "g= input()\r\n\r\n\r\nsplot=list(g)\r\nupper=sum(list(map(lambda x:ord(x)>=97,splot)))\r\nlower = (len(g)-upper)\r\nif lower>upper:\r\n print(g.upper())\r\nelse:\r\n print(g.lower())\r\n\r\n", "a = input()\r\nb = a.lower()\r\nc = len(a)\r\ncount = 0\r\nfor i in range(c):\r\n if(a[i] == b[i]):\r\n count += 1\r\nif(count >= c/2):\r\n print(b)\r\nelse:\r\n print(a.upper()) \r\n\r\n", "a = list(input())\r\nb = 0\r\ns = 0\r\nfor i in a:\r\n if ord(i) < 95:\r\n b += 1\r\n else:\r\n s += 1\r\nif b > s:\r\n print(\"\".join(a).upper())\r\nelse:\r\n print(\"\".join(a).lower())\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 19 05:03:47 2020\r\n\r\n@author: Admin\r\n\"\"\"\r\n\r\na=input()\r\nimport string\r\nd=u=0\r\nfor i in a:\r\n if str.upper(i)==i:\r\n u+=1\r\n else:\r\n d+=1\r\n \r\nif u>d:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = str(input()) \r\n\r\ncount_upper = int(0)\r\ncount_lower = int(0)\r\n\r\nfor ele in s :\r\n\r\n if ( ele.islower() ) :\r\n\r\n count_lower += 1\r\n\r\n else :\r\n\r\n count_upper += 1 \r\n\r\nif ( count_upper > count_lower ) :\r\n\r\n print(s.upper())\r\n\r\nelse :\r\n\r\n print(s.lower())", "s=input()\r\nl='abcdefghijklmnopqrstuvwxyz'\r\nu='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nu_c,l_c=0,0\r\nfor x in s:\r\n if x in u:\r\n u_c=u_c+1\r\n else:\r\n l_c=l_c+1\r\nif u_c<=l_c:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)\r\n", "s=input()\nlo = sum(list(map(lambda x: 1 if x.islower() else 0, list(s))))\nhi = len(s) - lo\nif lo >= hi:\n\tprint(s.lower())\nelse:\n\tprint(s.upper())", "lower = list(map(chr, range(97, 123)))\r\nupper = list(map(chr, range(65, 91)))\r\n\r\n\r\nstring = input()\r\n\r\nupper_count = 0\r\nlower_count = 0\r\n\r\nfor i in string:\r\n if i in lower:\r\n lower_count += 1\r\n if i in upper:\r\n upper_count += 1\r\n\r\nif lower_count == upper_count:\r\n string = string.lower()\r\nelif lower_count > upper_count:\r\n string = string.lower()\r\nelse:\r\n string = string.upper()\r\n\r\nprint(string)\r\n", "word = input()\r\nbig = 0\r\nsmall = 0\r\nuppercase=[\"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\nlowercase=[\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"]\r\nfor x in word:\r\n for y in uppercase:\r\n if x==y:\r\n big +=1\r\nfor x in word:\r\n for z in lowercase:\r\n if x==z:\r\n small +=1\r\n\r\nif big > small:\r\n print(word.upper())\r\n\r\nif big < small:\r\n print(word.lower())\r\nif big == small:\r\n print(word.lower())\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\n\ndef partition(str_):\n uppers = []\n lowers = []\n for v in str_:\n if v.isupper():\n uppers.append(v)\n else:\n lowers.append(v)\n return lowers, uppers\n\ndef main():\n '''\n word as input\n '''\n word = sys.stdin.readline().strip()\n lowers, uppers = partition(word)\n if len(lowers) < len(uppers):\n result = word.upper()\n else:\n result = word.lower()\n\n return result\n\nprint(main())\n", "word = input()\r\n\r\namount_lower = 0\r\namount_upper = 0\r\nfor letter in word:\r\n if letter.islower():\r\n amount_lower += 1\r\n else:\r\n amount_upper += 1\r\n\r\nif amount_upper > amount_lower:\r\n print(word.upper())\r\nelif amount_lower > amount_upper:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "lis=list(input())\r\nup=0\r\nlp=0\r\nfor i in range(len(lis)):\r\n if lis[i].isupper():\r\n up+=1\r\n else:\r\n lp+=1\r\nif up>lp:\r\n print(\"\".join(lis).upper())\r\nelse :\r\n print(\"\".join(lis).lower())\r\n", "string = input()\r\ncount=0\r\nfor i in string:\r\n if i.islower(): count+=1\r\nif count >= round(len(string)/2+0.1):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "s=input()\r\nup,low=0,0\r\nfor i in range(len(s)):\r\n\tif 65<=ord(s[i])<=90:\r\n\t\tup+=1\r\n\telse:\r\n\t\tlow+=1\r\nif low>=up:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "word=input()\r\nU=0\r\nS=0\r\nfor i in word:\r\n if i.isupper():\r\n U+=1\r\n else:\r\n S+=1\r\nif U==S or U<S:\r\n word=word.lower()\r\nelse:\r\n word=word.upper()\r\nprint(word)", "s = input()\nl = 0\nb = 0\n\nfor i in s:\n\tif i == i.lower(): l += 1\n\telse: b += 1\n\nif l >= b: print(s.lower())\nelse: print(s.upper())\n", "a = input()\n\nl = sum([int(i.islower()) for i in a])\nu = sum([int(i.isupper()) for i in a])\n\nif l >= u:\n\tprint(a.lower())\nelse:\n\tprint(a.upper())", "# Read the input word\nword = input()\n\n# Count the number of uppercase and lowercase letters\nuppercase_count = sum(1 for letter in word if letter.isupper())\nlowercase_count = len(word) - uppercase_count\n\n# Transform the word based on the counts\nif uppercase_count > lowercase_count:\n transformed_word = word.upper()\nelse:\n transformed_word = word.lower()\n\n# Print the corrected word\nprint(transformed_word)\n\n \t\t\t\t\t \t\t \t \t \t \t\t\t \t\t", "n=input()\nlow=0\nup=0\nfor i in n:\n if i.isupper():\n up+=1\n else:\n low+=1\nif up>low:\n print(n.upper())\nelse:\n print(n.lower())\n#f\n \t\t\t\t \t \t\t\t\t \t\t\t \t \t \t\t", "s = input()\r\nt = 0\r\nh = 0\r\nm = 0\r\nk = 0\r\na = [\"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"V\", \"X\", \"Y\", \"Z\", \"J\", \"U\", \"W\"]\r\nfor i in range(1, len(s) + 1):\r\n for n in range(26):\r\n if a[n] == s[k]:\r\n h += 1\r\n m += 1\r\n break\r\n if m != 1:\r\n t += 1\r\n m = 0\r\n k += 1\r\nif t >= h:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = input()\r\nmi = 0\r\nma = 0\r\n\r\nfor i in a:\r\n if ord(i) > 64 and ord(i) < 91:\r\n ma += 1\r\n if ord(i) > 96 and ord(i) < 123:\r\n mi += 1\r\nif ma > mi:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "def main():\n s=input()\n \n ucount=0\n lcount=0\n\n for i in s:\n if i.isupper():\n ucount+=1\n elif i.islower():\n lcount+=1\n\n if ucount > lcount:\n print(s.upper())\n elif ucount < lcount:\n print(s.lower())\n else:\n print(s.lower())\n\nmain()\n", "word = input()\r\nup_count, low_count = 0, 0\r\nfor _ in word:\r\n if _.islower():\r\n low_count += 1\r\n else:\r\n up_count += 1\r\nif up_count <= low_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "def diff(word):\r\n h_count = 0\r\n l_count = 0\r\n for w in word:\r\n if w!=w.upper():\r\n h_count += 1\r\n else:\r\n l_count += 1\r\n if h_count<l_count:\r\n return word.upper()\r\n return word.lower()\r\n\r\nprint(diff(input()))", "s = input()\r\n\r\ns1 = s.lower()\r\n\r\nx = 0\r\n\r\nfor i in range(len(s)):\r\n if(s[i] != s1[i]):\r\n x += 1\r\n\r\ny = len(s) -x\r\n\r\nif(y >= x):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def news(s):\n upper = 0\n lower = 0\n for i in s:\n if i>=\"A\" and i<=\"Z\":\n upper+=1\n elif i>=\"a\" and i<=\"z\":\n lower+=1\n if lower>=upper:\n newstring = s.lower()\n else:\n newstring = s.upper()\n return newstring\n\ns = input()\nprint(news(s))\n", "str1 = [*input()]\n\ndef check_upper(letter: str):\n return letter.isupper()\n\nfiltered_word = list(filter(check_upper, str1))\n\nl_str1, l_str2 = len(str1), len(filtered_word)\n\nprint(''.join(str1).upper()) if l_str1 / 2 < l_str2 else print(''.join(str1).lower())\n", "s = input()\r\nuppers = 0\r\nlowers = 0\r\nfor c in s:\r\n if c == c.upper():\r\n uppers += 1\r\n else:\r\n lowers += 1\r\nif uppers > lowers:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 25 21:48:21 2020\r\n\r\n@author: pc612\r\n\"\"\"\r\nupper=lower=0\r\ns = input()\r\nfor i in s:\r\n if i.isupper()==True:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif (upper>lower):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ns1=list(s)\r\nup,lo=0,0\r\nfor i in s1:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n lo+=1\r\nif up>lo:\r\n print(s.upper())\r\nelif lo>up:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "word=input()\r\nuppercount=0\r\nlowercount=0\r\nl=len(word)\r\nfor i in range(l):\r\n if word[i].isupper():\r\n uppercount+=1\r\n else:\r\n lowercount+=1\r\nif uppercount==lowercount or uppercount<lowercount:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "a=input()\r\ns=0\r\nl=0\r\nfor i in a:\r\n if i.islower():\r\n s=s+1\r\n elif i.isupper():\r\n l=l+1\r\nif s>=l:\r\n print(a.lower())\r\nelif s<l:\r\n print(a.upper())", "x = input(\"\")\nq_lower = 0\nq_upper = 0\n\nfor i in x:\n if i.islower():\n q_lower += 1\n elif i.isupper():\n q_upper += 1\nif q_lower > q_upper or q_lower == q_upper:\n print(x.lower())\nelse:\n print(x.upper())\n", "s = input()\n\nupper_count = 0\nfor char in s:\n if char.isupper():\n upper_count += 1\n\nif upper_count > len(s)/2:\n s = s.upper()\nelse:\n s = s.lower()\n\nprint(s)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 17 23:37:56 2020\r\n\r\n@author: 赵泽华\r\n\"\"\"\r\n\r\ns=str(input())\r\nn=len(s)\r\nupper=0\r\nlower=0\r\n\r\nfor i in range(n):\r\n if ord(s[i])<91:\r\n upper+=1\r\n else:\r\n lower+=1\r\n\r\nif upper<=lower :\r\n print(str(s).lower())\r\nelse:\r\n print(str(s).upper())", "c1=0\nc2=0\na=\"abcdefghijklmnopqrstuvwxyz\"\nA=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nst=input()\nfor i in range(len(st)):\n if st[i] in a:\n c1+=1\n else:\n c2+=1\nif c2>c1:\n st=st.upper()\nelse:\n st=st.lower()\nprint(st)\n", "x=input()\r\nll=0\r\nuu=0\r\nl=\"abcderfghijklmnopqrstuvwxyz\"\r\nu=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nfor n in range(len(x)):\r\n if x[n] in l:\r\n ll=ll+1\r\n elif x[n] in u:\r\n uu=uu+1\r\nif ll>=uu:\r\n z=x.lower()\r\n print(z)\r\nelif ll<uu:\r\n print(x.upper()) \r\n \r\n ", "s = input()\r\ncount = 0 \r\nfor letter in s:\r\n\tif letter.islower():\r\n\t\tcount += 1\r\nif count < len(s)/2: \r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "n = input()\r\nl = 0\r\nfor i in n:\r\n if i.islower():\r\n l += 1\r\n\r\nif l >= len(n)-l:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "y = str(input())\r\ni=0\r\ns=0\r\nfor letter in y :\r\n if letter == letter.upper():\r\n i+=1\r\n else:\r\n s+=1\r\n\r\nif i>s :\r\n print(y.upper())\r\n\r\nelse :\r\n print(y.lower())", "x = input()\r\ncb, cs = 0, 0\r\nfor char in x[::]:\r\n ascii = ord(char)\r\n if(ascii >= 65 and ascii <=90):\r\n cb+=1\r\n else:\r\n cs+=1\r\n\r\nif(cb>cs):\r\n x = x.upper()\r\n print(x)\r\nelse:\r\n x = x.lower()\r\n print(x)", "input_string = input()\r\nlower_count = 0\r\nupper_count = 0\r\n\r\nfor char in input_string:\r\n if char.islower():\r\n lower_count += 1\r\n elif char.isupper():\r\n upper_count += 1\r\n\r\nif lower_count >= upper_count:\r\n modified_string = input_string.lower()\r\nelse:\r\n modified_string = input_string.upper()\r\n\r\nprint(modified_string)\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\nimport re\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 solve():\r\n word = input()\r\n dic = {\r\n 'up': 0,\r\n 'down': 0\r\n }\r\n\r\n for i in range(len(word)):\r\n if word[i].islower():\r\n dic['down'] += 1\r\n else:\r\n dic['up'] += 1\r\n \r\n if dic['up'] > dic['down']:\r\n return word.upper()\r\n return word.lower()\r\n \r\n\r\nif __name__ == \"__main__\":\r\n print(solve())", "string = input()\r\ncount = 0\r\nfor x in string:\r\n\tif x.upper() == x:\r\n\t\tcount+= 1\r\n \r\nif len(string) / 2 < count:\r\n\tprint(string.upper())\r\nelse:\r\n\tprint(string.lower())\r\n", "x = str(input())\r\nt = 0 \r\nd = 0\r\nfor i in range(len(x)):\r\n if x[i].isupper():\r\n t += 1\r\n else:\r\n d += 1\r\nif t>d:\r\n print(x.upper())\r\nelif t<d:\r\n print(x.lower())\r\nelif t==d:\r\n print(x.lower())", "s=input()\r\nuc=lc=0\r\nfor i in s:\r\n if i.isupper():\r\n uc+=1\r\n else:\r\n lc+=1\r\nif(lc>=uc):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "s = input()\r\nup, low = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import string\r\nch = input()\r\nc=0\r\ns=0\r\nfor v in range(0,len(ch)):\r\n if ch[v]>='A' and ch[v]<='Z':\r\n c+=1\r\n if ch[v]>='a' and ch[v]<='z':\r\n s+=1;\r\nif c>s:\r\n print(ch.upper())\r\nelse:\r\n print(ch.lower())\r\n", "import re\r\nword=str(input())\r\nx=len(re.findall(r\"[a-z]\",word))\r\ny=len(re.findall(r\"[A-Z]\",word))\r\nif x>y:\r\n print(word.lower())\r\nelif x<y:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "def sol(a,b,s):\r\n if a>=b:\r\n return s.lower()\r\n else:\r\n return s.upper()\r\n\r\ncount_small=0\r\ncount_big=0\r\ns=input()\r\nfor i in s:\r\n if i.islower():\r\n count_small+=1\r\n else:\r\n count_big+=1\r\n#print(count_small,count_big)\r\nprint(sol(count_small,count_big,s))", "s=input()\r\ncount_lower=0\r\ncount_uper=0\r\nfor i in s:\r\n if i.isupper():\r\n count_uper+=1\r\n else:\r\n count_lower+=1\r\nif count_lower<count_uper:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=str(input())\r\nc=0\r\nd=0\r\nfor i in s:\r\n if i.islower():\r\n c=c+1\r\n else:\r\n d=d+1\r\nif d>c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "s=input()\r\nj=0\r\nk=0\r\nfor i in s:\r\n if i.islower():\r\n j=j+1\r\n else:\r\n k=k+1\r\nif(j<k):\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "s = input()\r\n\r\nup = 0\r\nlow = 0\r\n\r\nfor c in s:\r\n if c.islower():\r\n low += 1\r\n else:\r\n up += 1\r\n\r\nif up > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "s=str(input())\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if (i.isupper()):\r\n c1=c1+1\r\n elif(i.islower()):\r\n c2=c2+1\r\n\r\nif(c1>c2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nu_count =0\r\nfor i in range(len(s)):\r\n if(s[i].isupper() == True):\r\n u_count += 1\r\n \r\nif(u_count > len(s)/2):\r\n print(s.upper())\r\n \r\nelif(u_count < len(s)/2):\r\n print(s.lower())\r\n \r\nelse:\r\n print(s.lower())\r\n ", "word = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor letter in word:\r\n if ord(letter) <= 90:\r\n upper += 1\r\n else:\r\n lower += 1\r\n \r\nprint(word.lower() if lower >= upper else word.upper())", "s=input()\r\nl_count=0\r\nu_count=0\r\nfor c in s:\r\n if c.isupper():\r\n u_count+=1\r\n elif c.islower():\r\n l_count+=1\r\nif u_count>l_count:\r\n crct_word=s.upper()\r\nelse:\r\n crct_word=s.lower()\r\nprint(crct_word)", "n=input()\r\na1=0;a=0;\r\nfor i in n:\r\n if(ord(i)<97):\r\n a1=a1+1\r\n else:\r\n a=a+1\r\nif(a1>a):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = input()\r\nc = 0\r\nC = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n c += 1\r\n elif s[i].isupper():\r\n C += 1\r\n\r\nif C > c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "x = 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\nif u > l : \r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s=str(input())\r\na=s.lower()\r\nb=s.upper()\r\nsmall=0\r\ncap=0\r\nfor i in range (len(s)):\r\n if ord(s[i])<97:\r\n cap+=1\r\n else:\r\n small+=1\r\nif cap >small:\r\n print(b)\r\nelse:\r\n print(a)\r\n \r\n \r\n ", "input = input()\nuppers = 0\nlowers = 0\n\nfor x in input:\n if x.isupper():\n uppers += 1\n\n else:\n lowers += 1\n\nif uppers > lowers:\n output = \"\"\n for x in input:\n output += x.upper()\n\n print(output)\n\nelse:\n output = \"\"\n for x in input:\n output += x.lower()\n\n print(output)\n", "str = input()\r\ncnt_high, cnt_low = 0, 0\r\nfor i in range(len(str)):\r\n if (ord(str[i]) >= 97) and (ord(str[i]) <= 122):\r\n cnt_low += 1\r\n elif (ord(str[i]) >= 65) and (ord(str[i]) <= 90):\r\n cnt_high += 1\r\n \r\nif cnt_low < cnt_high:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "word = input()\r\ns = 0\r\nl = 0\r\nfor var in word:\r\n if 65 <= ord(var) <= 90:\r\n l += 1\r\n else:\r\n s += 1\r\n \r\nif s>=l:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "upper_count = 0\r\nlower_count = 0\r\nstr = input()\r\nfor c in str:\r\n if ord(c) <= 90:\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\nif upper_count > lower_count:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "x = input()\r\nnum_of_upper = 0\r\nfor i in range(len(x)):\r\n if x[i].isupper():\r\n num_of_upper += 1\r\nif num_of_upper > len(x) / 2:\r\n print(x.upper())\r\nelif num_of_upper <= len(x) / 2:\r\n print(x.lower())\r\n\r\n", "# Problem: A. Word\n# Contest: Codeforces - Codeforces Beta Round #55 (Div. 2)\n# URL: https://codeforces.com/problemset/problem/59/A\n# Memory Limit: 256 MB\n# Time Limit: 2000 ms\n# Powered by CP Editor (https://cpeditor.org)\n\ndef sol():\n\tinp = input().strip()\n\tcount_caps = 0\n\tcount_small = 0\n\tfor i in inp:\n\t\tif i == i.upper():\n\t\t\tcount_caps +=1\n\t\telse:\n\t\t\tcount_small +=1\n\tif count_caps > count_small:\n\t\tinp = inp.upper()\n\telse:\n\t\tinp = inp.lower()\n\treturn inp\n\nprint(sol())", "x = input(\"\")\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(x)):\r\n if(x[i]>='a' and x[i]<= 'z'):\r\n lower+=1\r\n elif(x[i]>='A' and x[i]<='Z'):\r\n upper+=1\r\n\r\nif(lower>upper):\r\n print(x.lower())\r\nelif(lower<upper):\r\n print(x.upper())\r\nelif(lower == upper):\r\n print(x.lower())", "message = input()\r\na= sum(1 for c in message if c.isupper())\r\nprint(message.upper() if a>(len(message)//2) else message.lower())", "a = input()\r\ncount = 0\r\ncount1 = 0\r\nfor i in a:\r\n if i.isupper():\r\n count += 1\r\n else:\r\n count1 += 1\r\nif count > count1:\r\n a = a.upper()\r\n print(a)\r\nelse:\r\n a = a.lower()\r\n print(a)", "l1 = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\n\r\ns = input()\r\nABC = 0\r\nabc = 0\r\nfor i in s:\r\n if i in l1:\r\n ABC += 1\r\n else:\r\n abc += 1\r\n\r\nif ABC > abc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "\r\nstinp = str(input())\r\nlower = []\r\nupper = []\r\nif len(stinp) not in range(1,101):\r\n print(\"Limit exceeded.\")\r\nelse:\r\n for i in stinp:\r\n if i.islower():\r\n lower.append(i)\r\n else:\r\n upper.append(i)\r\n\r\n if len(lower) > len(upper):\r\n print(stinp.lower())\r\n elif len(lower) < len(upper):\r\n print(stinp.upper())\r\n else:\r\n print(stinp.lower())\r\n", "word = input()\r\nL=0\r\nU=0\r\nfor i in word:\r\n if i.isupper():\r\n U+=1\r\n else:\r\n L+=1\r\nprint( word.upper() if U > L else word.lower() )", "n=input()\r\nc1=0\r\nc2=0\r\nfor i in range(len(n)):\r\n if(n[i].islower()):\r\n c1+=1\r\n else:\r\n c2+=1\r\nif(c2>c1):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "word = input()\r\nis_small = []\r\nis_capital = []\r\nfor x in range(0, len(word)):\r\n if word[x].islower():\r\n is_small.append(x)\r\n else:\r\n is_capital.append(x)\r\nif len(is_small) > len(is_capital):\r\n print(word.lower())\r\nelif len(is_small) == len(is_capital):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "a = input()\r\n\r\nnum1 = 0\r\nnum2 = 0\r\nfor ch in a:\r\n code = ord(ch)\r\n if 97 <= code <= 122:\r\n num1 += 1\r\n elif 65 <= code <= 90:\r\n num2 += 1\r\nif num1 >= num2:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "string = input()\r\nlower = 0 \r\nupper = 0 \r\n\r\nfor s in string:\r\n if( s.islower()):\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif(upper > lower):\r\n ans = string.upper()\r\nelse:\r\n ans = string.lower()\r\n\r\nprint(ans)", "s = input()\r\nsl= s.lower()\r\nminusculas=0\r\nfor k in range(0,len(s)):\r\n if(s[k]==sl[k]):\r\n minusculas+=1\r\nif(minusculas*2 >= len(s)):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "string = input()\r\nlower = list(\"abcdefghijklmnopqrstuvwxyz\")\r\nupper = list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nl = u = 0\r\nlis = list(string)\r\nfor ele in lis:\r\n if ele in lower:\r\n l += 1\r\n else:\r\n u += 1\r\nif l >= u:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "s = input()\r\ncountLower = 0\r\ncountHigher = 0\r\nfor letter in s:\r\n if ord(letter) <= 122 and ord(letter) >= 97:\r\n countLower += 1\r\n else:\r\n countHigher += 1\r\nif countLower < countHigher:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "s = [x for x in input()]\r\nucount,lcount = 0,0\r\nfor char in s:\r\n if char.isupper():\r\n ucount +=1\r\n else:\r\n lcount +=1\r\nprint(''.join(s).lower()) if lcount >= ucount else print(''.join(s).upper())", "#!/usr/bin/env python\r\nfrom typing import Sequence\r\n\r\n\r\n\r\ndef main(input: Sequence) -> None:\r\n\tupper :int = 0\r\n\tlower :int = 0\r\n\r\n\tfor char in input:\r\n\t\tif char.isupper():\r\n\t\t\tupper+=1\r\n\t\telse:\r\n\t\t\tlower+=1\r\n\r\n\tif lower >= upper:\r\n\t\tprint(input.lower())\r\n\telse :\r\n\t\tprint(input.upper())\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain(input())", "\nimport string\n\ns = input().strip()\n\nlower = len([a for a in s if a in string.ascii_lowercase])\nif lower >= len(s) / 2:\n print(s.lower())\nelse:\n print(s.upper())\n", "word: str = str(input())\ncounter: int = 0\n\nfor c in word:\n if c == c.upper():\n counter += 1\n\nif counter <= len(word) // 2:\n print(word.lower())\nelse:\n print(word.upper())\n", "x=input()\r\nsuml=0\r\nsumu=0\r\nsum=0\r\nfor i in x:\r\n sum+=ord(i)\r\nxl=x.lower()\r\nxu=x.upper()\r\nfor i in xl:\r\n suml+=ord(i)\r\nfor i in xu:\r\n sumu+=ord(i)\r\nif sum-sumu<suml-sum:\r\n print(xu)\r\nelse:\r\n print(xl)\r\n", "word = str(input())\r\n\r\ninc = 0\r\ndef number_of_lowercase() :\r\n inc = 0\r\n for i in word:\r\n if i.islower():\r\n inc = inc +1\r\n return inc\r\n\r\nif number_of_lowercase() >= len(word) - number_of_lowercase(): \r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "t=input(\"\")\r\na=t.lower()\r\nb=t.upper()\r\nj=0\r\nfor i in range (len(t)):\r\n if t[i]!=a[i]:\r\n j+=1\r\nif j<=(len(t)-j):\r\n print(a)\r\nelse:\r\n print(b)", "n=input()\r\nsmall=0\r\nbig=0\r\nfor i in n:\r\n if 97<=ord(i)<=122:\r\n small+=1\r\n else:\r\n big+=1\r\nif big>small:\r\n s=n.upper()\r\nelse:\r\n s=n.lower()\r\nprint(s)", "Word = input()\r\nif not Word.isalpha():\r\n print()\r\nelse:\r\n UpperCount = 0\r\n LowerCount = 0\r\n for i in range(len(Word)):\r\n if Word[i].isupper():\r\n UpperCount += 1\r\n elif Word[i].islower():\r\n LowerCount += 1\r\n if UpperCount > LowerCount:\r\n Word = Word.upper()\r\n else:\r\n Word = Word.lower()\r\n print(Word)", "a = input()\r\nm = 0\r\nfor i in a:\r\n if i.islower():\r\n m += 1\r\n else:\r\n m -= 1\r\nprint([a.upper(), a.lower()][m >= 0])", "s=input()\r\nlc=0\r\nuc=0\r\nfor i in s:\r\n if i.isupper():\r\n uc+=1\r\n elif i.islower():\r\n lc+=1\r\nif uc>lc:\r\n k=s.upper()\r\nelse:\r\n k=s.lower()\r\nprint(k)", "list=list(input())\r\nupper=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\nup=0\r\nlow=0\r\nfor i in range(len(list)):\r\n if list[i] in upper:\r\n up+=1\r\n else:\r\n low+=1\r\na=''.join(list)\r\nif low>=up:\r\n a=a.lower()\r\nelse:\r\n a=a.upper()\r\nprint(a)\r\n", "word = input()\r\nlwr_cnt = 0\r\nupr_cnt = 0\r\nfor letter in word:\r\n if(letter == letter.lower()):\r\n lwr_cnt += 1\r\n elif(letter == letter.upper()):\r\n upr_cnt += 1\r\nif(upr_cnt > lwr_cnt):\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "word = input()\r\nupper = lower = 0\r\nfor i in word:\r\n if (i.isupper()):\r\n upper+=1\r\n else:\r\n lower+=1\r\nif (lower>=upper):\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)", "def transform_word(word):\r\n uppercase_count = sum(1 for c in word if c.isupper())\r\n lowercase_count = len(word) - uppercase_count\r\n \r\n if uppercase_count > lowercase_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\n# Read input\r\nword = input().strip()\r\n\r\n# Transform and print the word\r\ntransformed_word = transform_word(word)\r\nprint(transformed_word)\r\n\r\n", "a=input()\r\ncym=0\r\ncym1=0\r\nfor i in range(len(a)):\r\n if 65<=ord(a[i])<=90:\r\n cym+=1\r\n elif 97<=ord(a[i])<=122:\r\n cym1+=1\r\nif cym>cym1:\r\n print(a.upper())\r\nelif cym1>cym or cym1==cym:\r\n print(a.lower())\r\n", "w = input()\r\nu,l=0,0\r\nfor i in w:\r\n\tif i.isupper():\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif (u>l):\r\n\tprint(w.upper())\r\nelse:\r\n\tprint(w.lower())\r\n\r\n\r\n\t\r\n\t\r\n\t\r\n\r\n\r\n", "s=input()\r\nl=0\r\nm=0\r\nfor i in s:\r\n if(i==i.lower()):\r\n l+=1 \r\n else:\r\n m+=1 \r\nif(m>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nlc=0\r\nfor ele in s: \r\n if (ord(ele) >= 97 and ord(ele) <= 122): \r\n lc-=1\r\n else: \r\n lc+=1\r\nif lc>0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nup,lp=0,0\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n lp+=1\r\n elif(s[i].isupper()):\r\n up+=1\r\n\r\nif(up>lp):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = []; w = input(); word.extend(w)\r\nk, a = sum([1 for i in word if 'a' <= i <= 'z']), sum([1 for i in word if 'A' <= i <= 'Z'])\r\nif k >= a:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "def solution():\r\n word = input()\r\n low, up = 0, 0\r\n for letter in word:\r\n if letter.islower():\r\n low += 1\r\n else:\r\n up += 1\r\n if low >= up:\r\n return word.lower()\r\n else:\r\n return word.upper()\r\n\r\n\r\nprint(solution())\r\n", "st=input()\ncount1=0\ncount2=0\nfor char in st :\n if (char.isupper()) :\n count1+=1\n else :\n count2+=1\n\nif (count1>count2) :\n st=st.upper()\n\nelse :\n st=st.lower()\n\nprint(st)\n\n \t \t\t\t\t \t\t \t\t\t \t\t \t \t", "s = input()\nn_upper = len(list(filter(lambda x: x.isupper(), s)))\nn_lower = len(list(filter(lambda x: x.islower(), s)))\nif n_lower >= n_upper:\n print(s.lower())\nelse:\n print(s.upper())\n\n", "s=input()\r\nup=0\r\nlow=0\r\nfor l in s:\r\n if ord(l)>96 and ord(l)<123:\r\n low+=1\r\n elif ord(l)> 64 and ord(l) < 91:\r\n up+=1\r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "ch=input()\r\nmins=0\r\nmaju=0\r\nfor i in ch :\r\n if i.isupper():\r\n maju=maju+1\r\n else:\r\n mins=mins+1\r\nif maju>mins:\r\n print(ch.upper())\r\nelif mins>=maju:\r\n print(ch.lower())", "a = input()\r\nb = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n b += 1\r\n else:\r\n b -= 1\r\nif b > 0:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "msg = input()\r\nlower=0\r\nupper=0\r\nfor i in msg:\r\n if i.isupper():\r\n upper+=1\r\n elif i.islower():\r\n lower+=1\r\nif upper>lower:\r\n print(msg.upper())\r\nelse:\r\n print(msg.lower())\r\n", "# Word\n\nfrom collections import deque\n\ns = input()\nuppercase_lst = []\nlowercase_lst = []\nlst = deque(s)\n\nfor i in lst:\n if i.isupper():\n uppercase_lst.append(i)\n else:\n lowercase_lst.append(i)\n \nif len(uppercase_lst) > len(lowercase_lst):\n print(\"\".join(s).upper())\nelse:\n print(\"\".join(s).lower())\n\n\n \n", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n if ord(s[i])>=97:\r\n c+=1\r\nb=len(s)-c\r\nif b>c:\r\n print(s.upper())\r\nelif b<c:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "\r\ny = str(input())\r\na =0\r\nb = 0\r\nfor i in range(len(y)):\r\n\tif y[i].islower():\r\n\t\ta += 1\r\n\telse:\r\n\t\tb += 1\r\nif a >= b:\r\n\tprint(y.lower())\r\nelse:\r\n\tprint(y.upper())", "s=input()\r\nsu=s.upper()\r\nsl=s.lower()\r\njsu=0\r\njsl=0\r\nfor i in range(len(s)):\r\n if su[i]==s[i]:\r\n jsu+=1\r\n if sl[i]==s[i]:\r\n jsl+=1\r\nif jsl>=jsu:\r\n print(sl)\r\nelse:\r\n print(su)", "x=str(input())\r\nupp=0\r\nlow=0\r\nfor i in range(len(x)):\r\n if ord(x[i])>=65 and ord(x[i])<=90:\r\n upp=upp+1\r\n elif ord(x[i])>=97 and ord(x[i])<=122:\r\n low=low+1\r\nif upp==low:\r\n t=x.lower()\r\n print(t)\r\nelif upp>low:\r\n t=x.upper()\r\n print(t)\r\nelif upp<low:\r\n t=x.lower()\r\n print(t)\r\n", "words = input()\r\nwords = list(words)\r\nlower_count = 0\r\nupper_count = 0\r\nupper_idx = []\r\nlower_idx = []\r\nfor i in range(len(words)):\r\n if words[i].isupper():\r\n upper_count += 1\r\n upper_idx.append(i)\r\n else:\r\n lower_count+=1\r\n lower_idx.append(i)\r\n\r\nif upper_count > lower_count:\r\n for idx in lower_idx:\r\n words[idx] = words[idx].upper()\r\nelse:\r\n for idx in upper_idx:\r\n words[idx].lower()\r\n words[idx] = words[idx].lower()\r\n# print(words)\r\nprint(\"\".join(words))\r\n", "word=input()\r\nucount=0\r\nlcount=0\r\nfor char in word:\r\n if char.isupper():\r\n ucount+=1\r\n else:\r\n lcount+=1\r\nif ucount>lcount:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nlower = 0\r\nfor letter in s:\r\n if letter.islower():\r\n lower += 1\r\nif lower >= len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "U_c = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nL_c = 'abcdefghijklmnopqrstuvwxyz'\r\ns = input()\r\nL = list(s)\r\nu = sum(1 for letter in L if letter in U_c)\r\nl = sum(1 for letter in L if letter in L_c)\r\nif u > l:\r\n L = [letter.upper() if letter in L_c else letter for letter in L]\r\nelse:\r\n L = [letter.lower() if letter in U_c else letter for letter in L]\r\nprint(''.join(L))", "x=input()\r\nlower=0\r\nfor i in x:\r\n if i.islower():lower+=1\r\nupper=len(x)-lower\r\nif lower>=upper:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s = input()\r\nl = len(s)\r\nup, low = 0, 0\r\nfor i in range(l):\r\n if ord(s[i]) >= 65 and ord(s[i]) <= 90:\r\n up += 1 \r\n else:\r\n low += 1\r\ns1 = \"\"\r\nif up > low:\r\n for i in range(l):\r\n if ord(s[i]) >= 65 and ord(s[i]) <= 90:\r\n s1 = s1 + s[i]\r\n else:\r\n s1 = s1 + chr(ord(s[i])-32)\r\nelse:\r\n for i in range(l):\r\n if ord(s[i]) >= 97 and ord(s[i]) <= 122:\r\n s1 = s1 + s[i]\r\n else:\r\n s1 = s1 + chr(ord(s[i])+32)\r\nprint(s1)\r\n ", "s=input()\r\nc=0\r\nc1=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n c=c+1 \r\n else:\r\n c1=c1+1\r\nif(c>c1):\r\n s1=s.upper()\r\n print(s1)\r\nelse:\r\n s1=s.lower()\r\n print(s1)", "s = input()\r\nuc = lc = 0\r\nfor ch in s:\r\n if ch.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\ns = s.upper() if uc > lc else s.lower()\r\nprint(s)", "s = input()\r\nupper = 0\r\nlower = 0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\n\r\nprint([word.lower(),word.upper()][sum(i>='A' and i<='Z'for i in word)>sum(i>='a' and i<='z'for i in word)])", "l = input()\r\nup, low = 0, 0\r\n\r\nfor i in l:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif up > low:\r\n print(l.upper())\r\nelse:\r\n print(l.lower())", "c=0\r\nC=0\r\na=input()\r\nfor i in a:\r\n if i.islower():\r\n c+=1\r\n else:\r\n C+=1\r\n \r\nif C> c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\ncnt_b = 0\r\ncnt_s = 0\r\n\r\nfor i in s:\r\n if i == i.upper():\r\n cnt_b += 1\r\n else:\r\n cnt_s += 1\r\n\r\nif cnt_b > cnt_s:\r\n print(s.upper())\r\nelif cnt_b == cnt_s:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s=str(input())\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n print(s.upper()) \r\nelif(u==l):\r\n print(s.lower())\r\nelse:\r\n print(s.lower()) \r\n\r\n\r\n\r\n \r\n", "x=input()\r\ncap=['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\nsmall=['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\ny=list(x)\r\nnc=0\r\nns=0\r\nfor i in y:\r\n if i in cap:\r\n nc+=1\r\n else:\r\n ns+=1\r\nif nc>ns:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s=input()\nlis=[]\nlower=upper=0\nfor i in s:\n lis.append(i)\nfor j in lis:\n if j.islower():\n lower+=1\n else:\n upper+=1\nif lower>upper:\n print(s.lower())\nelif upper>lower:\n print(s.upper())\nelse:\n print(s.lower())\n\t\t \t \t \t\t\t\t\t\t \t\t \t \t", "s = input()\r\nl=0\r\np=0\r\nfor ele in s:\r\n if ele.islower():\r\n l += 1\r\n if ele.isupper():\r\n p += 1\r\nif l >= p:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "s = input()\r\nb = 0\r\nl = 0\r\nfor i in s:\r\n if ord(i) < 97:\r\n b += 1\r\n else:\r\n l += 1\r\nif b > l:\r\n s = s.upper()\r\n print(s)\r\nelse:\r\n s = s.lower()\r\n print(s)\r\n", "string = input()\r\nuppercase = 0\r\nlowercase = 0\r\nfor l in string:\r\n\tif(l.isupper()):\r\n\t\tuppercase += 1\r\n\telse:\r\n\t\tlowercase += 1\r\nif(uppercase > lowercase):\r\n\tprint(string.upper())\r\nelse:\r\n\tprint(string.casefold())", "s = input()\r\ns_list = list(s)\r\nups = 0\r\nlows = 0\r\n\r\nfor letter in s_list:\r\n if letter.isupper():\r\n ups += 1\r\n else:\r\n lows += 1\r\n\r\nif ups > lows:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "unknown_word = input()\r\n\r\nsmall_letters = 0\r\n\r\nbig_letters = 0\r\n\r\nfor i in unknown_word:\r\n if ord(i) in range(65, 91):\r\n big_letters += 1\r\n elif ord(i) in range(97, 123):\r\n small_letters += 1\r\nif big_letters > small_letters:\r\n print(unknown_word.upper())\r\nelif big_letters <= small_letters:\r\n print(unknown_word.lower())\r\n \r\n", "a=input()\r\nu=l=0\r\nfor i in a:\r\n if i>=\"A\" and i<=\"Z\":\r\n u+=1\r\n elif i>=\"a\" and i<=\"z\":\r\n l+=1\r\nif u>l:\r\n print(a.upper())\r\nelif l>=u:\r\n print(a.lower())", "s=input()\nlow=0\nup=0\nfor i in s:\n if ord(i) in range(65,65+26):\n up=up+1\n else:\n low+=1\nprint(s.lower()) if up<=low else print(s.upper())", "s=input()\r\nlc=hc=0\r\nfor i in s:\r\n if i.isupper():\r\n hc+=1;\r\n else:\r\n lc+=1\r\nif hc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncount1=0\r\ncount2=0\r\nfor a in s:\r\n if (a.isupper())==True:\r\n count1+=1\r\n elif(a.islower())==True:\r\n count2+=1\r\nif count1>count2:\r\n print(s.upper())\r\nelif count1<=count2:\r\n print(s.lower())\r\n\r\n", "s = input()\r\nhelpera = 'qwertyuiopasdfghjklzxcvbnm';\r\nk = 0\r\nfor i in s:\r\n if i in helpera:\r\n k += 1\r\nif len(s) <= 2 * k:\r\n print(s.lower())\r\nelif len(s) > 2 * k:\r\n print(s.upper())", "s=str(input())\r\nl=h=0\r\nfor i in s:\r\n if(i.islower()==True):\r\n l=l+1\r\n if(i.isupper()==True):\r\n h=h+1\r\nif(l>h):\r\n print(s.lower())\r\nelif(l<h):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "k=input()\r\nu=0\r\nl=0\r\np=\"\"\r\nfor i in k:\r\n if i.islower():\r\n l+=1\r\n p+=i.upper()\r\n else:\r\n u+=1\r\n p+=i.lower()\r\nif u>l:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())\r\n", "string = input()\r\n\r\nbig, small = 0, 0\r\n\r\nfor i in string:\r\n if i.isupper():\r\n big += 1\r\n elif i.islower():\r\n small += 1\r\n\r\nif big > small:\r\n print(string.upper())\r\nelif small > big or small == big:\r\n print(string.lower())\r\n\r\n", "my_list = []\r\nupper_count = 0\r\nword = input()\r\nfor letter in word:\r\n my_list.append(letter)\r\nfor item in my_list:\r\n if item.isupper() == True:\r\n upper_count = upper_count + 1\r\n\r\nif (len(word)/2) < upper_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "def solve(a):\r\n countL = 0\r\n countU = 0\r\n for c in a:\r\n if c.islower() == True :\r\n countL += 1\r\n else :\r\n countU += 1\r\n if countL < countU :\r\n a = a.upper()\r\n else :\r\n a = a.lower()\r\n print(a)\r\n\r\na = input()\r\n\r\nsolve(a)", "word = input()\r\nup = []\r\nlow = []\r\nfor i in word:\r\n if str.isupper(i):\r\n up.append(i)\r\n if str.islower(i):\r\n low.append(i)\r\nif len(up) > len(low):\r\n word = word.upper()\r\nelif len(low) >= len(up):\r\n word = word.lower()\r\nprint(word)", "word = str(input())\r\ntab = \" \".join(word)\r\ntabl = tab.split(\" \")\r\n\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(tabl)):\r\n if tabl[i].isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper > lower:\r\n j = word.upper()\r\nelse:\r\n j = word.lower()\r\n\r\nprint(j)\r\n", "word=str(input())\r\ncount=0\r\ntally=0\r\nfor i in word:\r\n if i.isupper()==True:\r\n count=count+1\r\n elif i.islower()==True:\r\n tally=tally+1\r\nif tally == count:\r\n print(word.lower())\r\nelif tally > count:\r\n print(word.lower())\r\nelif tally < count:\r\n print(word.upper())", "s = input(\"\")\r\ns1 = list(str(s))\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(s1)):\r\n if s1[i] == s1[i].upper():\r\n count1 = count1 + 1\r\n else:\r\n count2 = count2 + 1\r\nif count1 > count2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "n = input()\r\nupc = 0\r\nlowc = 0\r\nfor i in n:\r\n if i.isupper():\r\n upc += 1\r\n else:\r\n lowc += 1\r\nif lowc >= upc:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "inp=input()\r\nu,l=0,0\r\nfor x in inp:\r\n if x.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())", "s = str(input())\r\nd = 0\r\nfor ch in s:\r\n if ch.isupper():\r\n d += 1\r\n if ch.islower():\r\n d -= 1\r\nprint(s.lower()) if d < 0 or d == 0 else print(s.upper())", "str1=input()\r\nw1=0\r\nw2=0\r\nfor i in str1:\r\n if(i.islower()):\r\n w1=w1+1\r\n else:\r\n w2=w2+1\r\nif(w1>=w2):\r\n print(str1.lower())\r\nelse:\r\n print(str1.upper())\r\n", "s=input()\r\nn=len(s)\r\nupper=0\r\nlower=0\r\nfor i in s:\r\n if (i.isupper()):\r\n upper=upper+1\r\n elif(i.islower()):\r\n lower=lower+1\r\n\r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "inp=input()\r\n\r\nlcount=0\r\nucount=0\r\nfor x in inp:\r\n if x.isupper():\r\n ucount=ucount+1\r\n elif x.islower():\r\n lcount=lcount+1\r\n\r\nif ucount>lcount:\r\n inp=inp.upper()\r\nelse:\r\n inp=inp.lower()\r\n\r\nprint(inp)", "str=input()\r\nu = sum(1 for c in str if c.isupper())\r\nl = sum(1 for c in str if c.islower())\r\nif u>l:\r\n str=str.upper()\r\nelse:\r\n str=str.lower()\r\nprint(str)\r\n\r\n\r\n\r\n", "s = input()\nu = l = 0\n\nfor i in range(len(s)):\n if s[i].islower():\n l += 1\n else:\n u += 1\nif l >= u:\n print(s.lower())\nelse:\n print(s.upper())\n\n", "a = list(input())\r\na1 = 0\r\na2 = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n a1+=1\r\n else:\r\n a2+=1\r\nif a1 == a2:\r\n print(''.join(a).lower())\r\nelif a1>a2:\r\n for i in range(len(a)):\r\n if a[i].islower():\r\n a[i] = a[i].upper()\r\n print(''.join(a))\r\nelse:\r\n for i in range(len(a)):\r\n if a[i].isupper():\r\n a[i] = a[i].lower()\r\n print(''.join(a))\r\n", "s = input()\r\n\r\nup = 0\r\nlo = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up += 1\r\n else:\r\n lo += 1\r\n\r\nif up > lo:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nu1=0\r\nl1=0\r\nfor i in s:\r\n if 65<=ord(i)<=90:\r\n u1+=1\r\n elif 97<=ord(i)<=122:\r\n l1+=1\r\nif u1==l1:\r\n print(s.lower())\r\nelif u1<l1:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "S = input()\r\nlisl =[]\r\nlisu = []\r\nfor i in S:\r\n if i.islower():\r\n lisl.append(i) \r\n else:\r\n lisu.append(i)\r\nif len(lisl) >= len(lisu):\r\n print(S.lower())\r\nelse:\r\n print(S.upper())", "n = input()\r\nlow = 0\r\nhigh = 0\r\nfor i in n:\r\n if i.islower():\r\n low += 1\r\n else:\r\n high += 1\r\nprint(n.lower() if low >= high else n.upper())", "x = input()\r\nCountUpper = 0\r\nCountLower = 0\r\n\r\nfor Char in x:\r\n\r\n if Char.isupper():\r\n CountUpper += 1\r\n\r\n else:\r\n CountLower += 1\r\n\r\nif CountUpper > CountLower:\r\n print(x.upper())\r\n\r\nelse:\r\n print(x.lower())\r\n", "n=input()\r\nc=0\r\nfor i in n:\r\n if i.isupper():\r\n c=c+1\r\n \r\nif c>len(n)//2:\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\n \r\nprint(n)", "str = input()\r\nupper = 0\r\nlower = 0\r\nfor i in str:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n upper += 1\r\n else:\r\n lower += 1\r\nif lower >= upper:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "line = input()\r\ncounter_1 = 0\r\ncounter_2 = 0\r\nfor i in line:\r\n if i.islower() == True:\r\n counter_1 += 1 \r\n else:\r\n counter_2 += 1\r\nif counter_1 > counter_2:\r\n line = line.lower()\r\nelif counter_1 < counter_2:\r\n line = line.upper()\r\nelse:\r\n line = line.lower()\r\nprint(line)", "s = input().strip()\na, b = 0, 0\nfor ch in s:\n\tif ch != ch.lower():\n\t\ta += 1\n\tif ch != ch.upper():\n\t\tb += 1\nif a <= b:\n\tprint(s.lower())\nelse:\n\tprint(s.upper())\n", "n=str(input())\r\nc=[]\r\ns=[]\r\nfor i in n:\r\n if i.isupper():\r\n c.append(i)\r\n else:\r\n s.append(i)\r\nif len(c)>len(s):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = str(input())\nlower = 0\nupper = 0\nfor i in range(len(s)):\n if s[i].islower():\n lower += 1\n else:\n upper += 1\n\nif upper>lower:\n print(s.upper())\nelse:\n print(s.lower())", "def get_values():\n\tword = input()\n\tlower = 0\n\tupper = 0\n\tresult = ''\n\tfor i in word:\n\t\tif i.isupper():\n\t\t\tupper += 1\n\t\telse:\n\t\t\tlower += 1\n\tif upper > lower:\n\t\treturn print(word.upper())\n\treturn print(word.lower())\n\nget_values()", "import string\r\ndef converter(world):\r\n noofuppercase=0\r\n nooflowercase=0\r\n for i in world:\r\n if i.islower():\r\n nooflowercase+=1\r\n else:\r\n noofuppercase+=1\r\n if noofuppercase>nooflowercase:\r\n print(world.upper())\r\n else:\r\n print(world.lower())\r\nn = str(input())\r\nconverter(n)", "t=input()\r\na=0\r\nb=0\r\nfor j in t:\r\n if j.islower() == True:\r\n a=a+1\r\n \r\n else:\r\n b=b+1\r\n \r\nif(a>=b):\r\n print(t.lower())\r\n\r\nelse:\r\n print(t.upper())\r\n \r\n ", "s=input()\r\nup=low=0\r\nfor i in range(0,len(s)):\r\n x=ord(s[i])\r\n if x>=65 and x<=90:\r\n up+=1 \r\n else:\r\n low+=1\r\nif up>low:\r\n print(s.upper())\r\nelif up<low:\r\n print(s.lower())\r\nelif up==low:\r\n print(s.lower())\r\n", "s = input()\r\ncnt = 0\r\nfor i in s:\r\n if i.isupper():\r\n cnt += 1\r\nif cnt > (len(s)-cnt):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n\r\n\r\n'''s = input()\r\nn = int(s)\r\nflag = 0\r\nif n%4 == 0 or n%7 == 0:\r\n print(\"YES\")\r\nelse:\r\n for i in s:\r\n if i not in ['4','7']:\r\n print(\"NO\")\r\n break\r\n\r\n else:\r\n print(\"YES\")'''", "ujju=input()\r\ncount=0\r\nfor jyo in ujju:\r\n if jyo.isupper():\r\n count+=1\r\nif count>len(ujju)//2:\r\n ujju=ujju.upper()\r\nelse:\r\n ujju=ujju.lower()\r\nprint(ujju)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled28.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/17NGy8LL7YBN5puihWSsMEWHmStWUXIP-\n\"\"\"\n\ns = input()\nn = len(s)\nx = 0\ny = 0\nfor i in s:\n if (i.isupper()):\n x = x+1\n if (i.islower()):\n y = y+1\n\nif (x>y):\n print(s.upper())\nelse:\n print(s.lower())\n\n", "s= input(\"\")\r\n\r\nl=len(s)\r\ncount_upper=0\r\n\r\nfor i in range(l):\r\n if (s[i]>='A' and s[i]<='Z'):\r\n count_upper+=1\r\nif ((l-count_upper)>=count_upper):\r\n print(s.lower())\r\nelse:\r\n print(s.upper()) ", "word = input()\r\n\r\ncapitalCount = 0\r\nsmallCount = 0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n capitalCount += 1\r\n else:\r\n smallCount += 1\r\n\r\nif smallCount >= capitalCount:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "n=input()\r\nu=0\r\nl=0\r\nfor i in list(n):\r\n if i.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif l>=u:\r\n t=n.lower()\r\nelse:\r\n t=n.upper()\r\n\r\n\r\nprint(t) ", "x = input()\r\n\r\nup = down = 0\r\n\r\nfor letter in x:\r\n if letter.isupper():\r\n up += 1\r\n else:\r\n down += 1\r\n\r\nif up > down:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "a = input()\r\nx = 0\r\ny = 0\r\n\r\nfor char in a:\r\n if char.isupper():\r\n x += 1\r\n elif char.islower():\r\n y += 1\r\n\r\nnew_str = \"\"\r\n\r\nif x > y:\r\n new_str = a.upper()\r\nelse:\r\n new_str = a.lower()\r\n\r\nprint(new_str)\r\n", "word=input()\r\nn=len(word)\r\nu=0\r\nl=0\r\nfor i in range(n):\r\n if word[i].islower()==True:\r\n l=l+1\r\n else:\r\n u=u+1\r\nif u>l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s = input()\nupper_diff = 0\n\nfor c in s:\n if c.islower():\n upper_diff -= 1\n else:\n upper_diff += 1\n\nif upper_diff > 0:\n print(s.upper())\nelse:\n print(s.lower())\n", "s=input()\r\nuc=0\r\nlc=0\r\nfor i in s:\r\n if(i.isupper()):\r\n uc=uc+1\r\n else:\r\n lc=lc+1\r\nif(lc>uc):\r\n s=s.lower()\r\nelif(uc>lc):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "s = input()\r\n\r\nupper = 0\r\nfor i in s:\r\n\tif i.upper() == i:\r\n\t\tupper += 1\r\n\telse:\r\n\t\tcontinue\r\n\r\nif upper > len(s)-upper:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "n= input()\r\ncounter= 0\r\n\r\nfor line in n:\r\n if line.upper() == line:\r\n counter+= 1\r\n\r\nif counter > len(n)//2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "ss=input()\r\nc=0\r\ns=0\r\nfor i in range(len(ss)):\r\n t=ord(ss[i])\r\n if(t>=97 and t<=122):\r\n s+=1\r\n else:\r\n c+=1\r\n# print(c,s)\r\nif(c>s):\r\n ss=ss.upper()\r\nelse:\r\n ss=ss.lower()\r\nprint(ss)", "s = input()\r\n\r\nbl = 0\r\nsl = 0\r\n\r\ncheck = \"qwertyuiopasdfghjklzxcvbnm\"\r\n\r\nfor i in s:\r\n if i in check:\r\n sl += 1\r\n else:\r\n bl += 1\r\n\r\nif bl > sl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nc1=0\r\nc2=0\r\nfor ele in s:\r\n if ele.isupper():\r\n c1+=1\r\n elif ele.islower():\r\n c2+=1\r\nif c1==c2:\r\n print(s.lower())\r\nelif c1>c2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=['Q','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M']\r\nb=['q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m']\r\nn=str(input())\r\nl=list(n)\r\nchet_min=0\r\nchet_max=0\r\nfor i in l:\r\n if i in a:\r\n chet_max+=1\r\n else:\r\n chet_min+=1\r\nif chet_max>chet_min:\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n)", "s=input()\r\nc=0\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]>='A' and s[i]<='Z':\r\n c+=1\r\n else:\r\n j+=1\r\nif(c>j):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n", "s = str(input())\r\nx = 0; y = 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].lower():\r\n x += 1\r\n else:\r\n y +=1\r\nif x >= y:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "t=input()\r\nc=0\r\nd=0\r\nfor i in t:\r\n if i.isupper():\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "try:\r\n s = input()\r\n u, l = 0, 0\r\n for i in range(len(s)):\r\n if ord(s[i]) in range(65, 91):\r\n u += 1\r\n else: l += 1\r\n if l<u: print(s.upper())\r\n else: print(s.lower())\r\n \r\nexcept:\r\n pass", "s=str(input())\r\nnbre_carmajuscule=0\r\nnbre_carminiscule=0 \r\nfor i in s : \r\n if ord(i) in range(65,91) : \r\n nbre_carmajuscule+=1 \r\n else : \r\n nbre_carminiscule+=1\r\nif nbre_carmajuscule > nbre_carminiscule : \r\n print(s.upper())\r\nelse : \r\n print(s.lower())\r\n", "s=input()\r\nc=0\r\nt=0\r\nfor i in s:\r\n if i.islower():\r\n c+=1;\r\n else:\r\n t+=1;\r\nif c>=t:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "n = input()\r\n\r\ncap_count = 0\r\n\r\nfor char in n:\r\n if char >= 'A' and char <= 'Z':\r\n cap_count+=1\r\n\r\nif cap_count > len(n)/2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower()) \r\n\r\n", "def correct_word_case(s):\r\n uppercase_count = sum(1 for char in s if char.isupper())\r\n lowercase_count = len(s) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n corrected_word = s.upper()\r\n else:\r\n corrected_word = s.lower()\r\n\r\n return corrected_word\r\n\r\n# Read input\r\ns = input().strip()\r\n\r\n# Correct the word case and print the result\r\ncorrected_word = correct_word_case(s)\r\nprint(corrected_word)\r\n", "s = input()\r\na = s.lower()\r\nb = s.upper()\r\nif sum(i != j for i, j in zip(s, a)) <= sum(i != j for i, j in zip(s, b)):\r\n print(a)\r\nelse:\r\n print(b)\r\n", "\nword = input()\t# ViP\t\tchar = word[i]\t\tfor i in range(len(word))\nl = list(word)\nup,down = 0,0\n\nfor char in word:\n\tif(char >='A' and char <= 'Z'):\n\t\tup+=1\n\telse:\n\t\tdown+=1\n\n\nif( up> down):\n\tfor i in range(len(l)):\n\t\tif(l[i] > 'Z'):\n\t\t\tl[i] = chr(ord(word[i])- 32)\n\t\t\t\nelse:\n\tfor i in range(len(l)):\n\t\tif(l[i] < 'a'):\n\t\t\tl[i] = chr(ord(word[i])+ 32)\n\n\nfor char in l:\n\tprint(char,end=\"\")\n\t\t \t\t \t\t \t \t \t \t\t \t\t\t", "s=input()\r\nl=len(s)\r\nc=d=0\r\nfor i in range (0,l):\r\n if s[i].isupper():\r\n c=c+1\r\n\r\n else:\r\n d=d+1\r\n\r\nif d>=c:\r\n print(s.lower())\r\n\r\nelse:\r\n print(s.upper())\r\n \r\n", "word=input()\r\nletters=list(word)\r\ni=0;\r\nlength=len(letters);\r\nfor item in letters:\r\n if (item==item.upper()):\r\n i+=1\r\nif(i>(length/2)):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "inp = input()\ncount1 = 0\nfor i in inp:\n\tif ord(i) >= 65 and ord(i) <= 90:\n\t\tcount1 += 1\n\telse:\n\t\tcount1 -= 1\nif count1 > 0:\n\tprint(inp.upper())\nelse:\n\tprint(inp.lower())\n\t\t\n", "# 59 A\r\ns=str(input())\r\nif sum(map(str.isupper,s))>len(s)/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\n \r\nin1 = \"\"\r\ncount1 = 0\r\n \r\nin2 = \"\"\r\n \r\nif len(s) > 100:\r\n \r\n r = 100\r\n \r\nelse:\r\n \r\n r = len(s)\r\n \r\nfor i in range(0,r):\r\n \r\n if s[i].isupper():\r\n \r\n count1 += 1\r\n \r\n in1 += s[i].upper()\r\n \r\n in2 += s[i].lower()\r\n \r\n \r\nif count1 > len(s)-count1:\r\n \r\n print(in1)\r\n \r\nelse:\r\n \r\n print(in2)", "\r\na=input()\r\nu=0\r\nl=0\r\nfor c in a:\r\n if c.isupper():\r\n u=u+1\r\n else:\r\n l=l+1\r\nif l>=u:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "a=input()\r\ncnt1=0\r\ncnt2=0\r\nfor i in a:\r\n if i.isupper():\r\n cnt1=cnt1+1\r\n elif i.islower():\r\n cnt2=cnt2+1\r\nif(cnt1>cnt2):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\n# — For taking integer inputs.\r\ndef inp():\r\n return(int(input()))\r\n # — For taking List inputs.\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n # For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n # — For taking space seperated integer variable inputs.\r\ndef invr():\r\n return(map(int,input().split()))\r\n# --------------------------------------------------\r\ninputString = input().strip()\r\nnumLower = 0\r\nfor s in inputString:\r\n if s.islower():\r\n numLower += 1\r\nif len(inputString)/2 > numLower:\r\n print(inputString.upper())\r\nelse:\r\n print(inputString.lower())", "a = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(a)):\r\n if a[i] == a[i].lower():\r\n count1 += 1\r\n elif a[i] == a[i].upper():\r\n count2 += 1\r\n\r\nif count1 >= count2:\r\n print(a.lower())\r\nelif count2 > count1:\r\n print(a.upper())", "s = input()\r\nv = 0\r\nm = 0\r\n\r\nfor i in range(len(s)):\r\n if ord(s[i]) <= ord('Z') and ord(s[i]) >= ord('A'):\r\n v += 1\r\n else:\r\n m += 1\r\n\r\nif v > m:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)\r\n", "n=input()\r\nalf=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nalf2=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=0\r\nd=0\r\nfor i in n:\r\n if i in alf:\r\n s+=1\r\n elif i in alf2:\r\n d+=1\r\nif s>d:\r\n a=str.upper(n)\r\n print(a)\r\nelse:\r\n a=str.lower(n)\r\n print(a)", "w = input()\r\nn = 0 \r\nfor i in w:\r\n if i >= 'a' and i <= 'z' : n+=1\r\nif len(w) - n > int(len(w)/2) : print(w.upper())\r\nelse : print(w.lower()) ", "s = input()\r\nu = 0\r\nl = 0\r\nfor i in s:\r\n if ord(i)<=90:\r\n u = u+1\r\n else:\r\n l = l+1\r\nif u-l<=0:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)\r\n", "s=input()\r\ncap=0\r\nlow=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n cap=cap+1\r\n else:\r\n low=low+1\r\nif cap>low:\r\n x=s.upper()\r\nelif cap==low:\r\n x=s.lower()\r\nelse:\r\n x=s.lower()\r\nprint(x)", "#!/usr/bin/env python3\n\n\n\n\ndef main():\n inp = input()\n l = 0\n u = 0\n for c in inp:\n if c.islower():\n l+=1\n else:\n u+=1\n\n if l >= u:\n print(inp.lower())\n else:\n print(inp.upper())\n\n\n\n\n\nif __name__ == \"__main__\":\n main()\n", "s = input()\r\nlst = [i for i in s]\r\nup = 0\r\nlow = 0\r\nfor elem in lst:\r\n if elem.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif up > low:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "x=input(\" \")\r\nupper=0\r\nlower=0\r\nfor i in x:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s0=list(input())\r\nx=0\r\ns=''\r\nfor l in s0:\r\n if l.isupper():\r\n x=x+1\r\n s=s+l\r\nif 2*x>len(s):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "stroka = input()\r\nu = 0\r\nl = 0\r\nupper = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nlower = 'qwertyuiopasdfghjklzxcvbnm'\r\nfor i in stroka:\r\n if upper.count(i):\r\n u += 1\r\n if lower.count(i):\r\n l += 1\r\nif l >= u:\r\n print(stroka.lower())\r\nelse:\r\n print(stroka.upper())", "palavra = input()\r\nmenor = 0\r\nmaior = 0\r\n\r\nfor x in palavra:\r\n if x.islower():\r\n menor += 1\r\n else:\r\n maior += 1\r\n\r\nif maior > menor:\r\n print(palavra.upper())\r\nelse:\r\n print(palavra.lower())", "lcount = 0\r\nucount = 0\r\nword = input()\r\nfor ch in word:\r\n if ch.isupper():\r\n ucount += 1\r\n else:\r\n lcount += 1\r\n# print(lcount, ucount)\r\nif lcount == ucount:\r\n print(word.lower())\r\nelif lcount < ucount:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "x=input()\r\nl=len(x)\r\ncl=0\r\nfor i in x:\r\n if i.islower():\r\n cl+=1\r\nif cl>=l-cl:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s=input()\r\nl=list(s)\r\nc,k=0,0\r\nfor i in l:\r\n if i.islower():\r\n c=c+1\r\n else:\r\n k=k+1\r\nif c>=k:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=input()\r\na=0\r\nb=0\r\nfor i in s:\r\n if(i.isupper()):\r\n a=a+1\r\n else:\r\n b=b+1\r\n if(a>b):\r\n new=s.upper()\r\n else:\r\n new=s.lower()\r\nprint(new)", "s = input()\r\ncount_upper = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n count_upper += 1 \r\ncount_lower = len(s) - count_upper\r\nif count_upper>count_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) \r\n", "n = input()\r\nlng = len(n)\r\nc = 0\r\n \r\nfor i in range(len(n)):\r\n if n[i] == n[i].upper():\r\n c += 1\r\n \r\nif c > lng / 2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "sentence=input(\"\")\r\nuppercase_counter=0\r\nlowercase_counter=0\r\nfor i in range(len(sentence)):\r\n x=sentence[i]\r\n y=ord(x)\r\n if(64<y<91):\r\n uppercase_counter+=1\r\n if(96<y<123):\r\n lowercase_counter+=1\r\nif uppercase_counter<=lowercase_counter:\r\n print(sentence.lower())\r\nelse:\r\n print(sentence.upper())", "word = input()\r\nif sum(map(str.isupper,word)) > sum(map(str.islower,word)):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\t\t\t\t \t \t \t \t\t\t\t\t\t\t \t\t \t", "t=input()\r\nlower,upper=0,0\r\nfor i in t:\r\n if i.isupper()==True:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n a=t.upper()\r\nelif upper<lower:\r\n a=t.lower()\r\nelif upper==lower:\r\n a=t.lower()\r\nprint(a)", "n=input()\r\nl=u=0\r\nfor i in n:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n#print(u,l)\r\nif u>l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s = input()\r\nU = 0\r\nL = 0 \r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n U = U + 1\r\n else:\r\n L = L + 1\r\nif U > L:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\ncount = 0\r\nfor x in word:\r\n if x.isupper():\r\n count = count + 1\r\n\r\nif count > len(word) // 2:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)", "def string_test(s):\r\n d = 0\r\n a = 0\r\n for c in s:\r\n if c.isupper():\r\n d = d + 1 #ВЕРХНИЙ\r\n elif c.islower():\r\n a = a + 1 #НИЖНИЙ\r\n else:\r\n pass\r\n if a >= d:\r\n print(s.lower())\r\n elif a == d:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n\r\ns = input()\r\nstring_test(s)\r\n\r\n", "d=input()\r\na=str(d)\r\na=list(a)\r\nx=0\r\ny=0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n x+=1\r\n else:\r\n y+=1\r\nif x==y:\r\n print(d.lower())\r\nelif x>y:\r\n print(d.lower())\r\nelse:\r\n print(d.upper())", "n = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(n)):\r\n if n[i].lower() == n[i]:\r\n lower += 1\r\n elif n[i].upper() == n[i]:\r\n upper += 1\r\nif lower >= upper:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "word = list(input())\r\ncounter_lower = 0\r\ncounter_upper = 0\r\nfor c in word:\r\n if c.islower():\r\n counter_lower+=1\r\n else:\r\n counter_upper+=1\r\nif counter_lower >= counter_upper:\r\n print(\"\".join(word).lower())\r\nelse:\r\n print(\"\".join(word).upper())", "s=input()\r\ncc=0\r\ncs=0\r\nfor i in s:\r\n o=ord(i)\r\n if o in range (65 , 91 ,1):\r\n \r\n cc+=1\r\n if o in range (97 , 123 , 1):\r\n \r\n cs+=1\r\n \r\n \r\n if cc>cs:\r\n s=s.upper()\r\n elif cc==cs or cs> cc:\r\n s=s.lower()\r\n \r\nprint(s)", "n = input()\n# = maiúsculas e minúsculas\ncontM = 0\ncontMin = 0\n\nfor letra in n:\n if letra.isupper():\n contM += 1\n else:\n contMin += 1\n\nif contM == contMin:\n print(n.lower())\n\nelif contMin > contM:\n print(n.lower())\nelse:\n print(n.upper())\n\n\n# 1506176251629\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Feb 15 16:23:19 2022\r\n\r\n@author: dell\r\n\"\"\"\r\n\r\nC_A=0\r\nC_L=0\r\ne=input()\r\nfor i in e:\r\n if i.isupper():\r\n C_A+=1\r\n elif i.islower():\r\n C_L+=1\r\nif (C_A == C_L or C_A < C_L ):\r\n print(e.lower())\r\nelif C_A > C_L :\r\n print(e.upper())\r\n\r\n", "def main():\n\tw=input()\n\tscount=0\n\tccount=0\n\tfor i in w:\n\t\tif ord(i)>=ord('a') and ord(i)<=ord('z'):\n\t\t\tscount+=1\n\t\tif ord(i)>=ord('A') and ord(i)<=ord('Z'):\n\t\t\tccount+=1\n\t#print(ccount, scount)\n\tprint(w.upper()) if scount<ccount else print(w.lower())\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "import string\r\nu=list(string.ascii_uppercase)\r\nl=list(string.ascii_lowercase)\r\ns=input()\r\nup=0\r\nlr=0\r\nfor i in s:\r\n if i in u:\r\n up+=1\r\n if i in l:\r\n lr+=1\r\nif up>lr:\r\n print(s.upper())\r\nif lr>up:\r\n print(s.lower())\r\nif up==lr:\r\n print(s.lower())\r\n", "n=input()\r\nup_count=0\r\nlow_count=0\r\nfor i in n:\r\n if i.isupper()==True:\r\n up_count+=1\r\n elif i.islower()==True:\r\n low_count+=1\r\n\r\nif up_count>low_count:\r\n s=n.upper()\r\nelif up_count<low_count:\r\n s=n.lower()\r\nelif up_count==low_count:\r\n s=n.lower()\r\nprint(s)\r\n", "s=input()\r\nc=0\r\ns1=0\r\nfor i in s:\r\n if i.islower():\r\n s1+=1\r\n else:\r\n c+=1\r\nif c>s1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nif sum(map(str.isupper, s)) <= sum(map(str.islower, s)):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "letters = input()\r\ncount_u = 0\r\ncount_l = 0\r\nfor letter in letters:\r\n if letter.isupper() == True:\r\n count_u = count_u + 1\r\n else:\r\n count_l = count_l + 1\r\n\r\nif count_u > count_l:\r\n print(letters.upper())\r\nelse:\r\n print(letters.lower())", "s = input()\r\ncntUpper = sum(1 for c in s if c.isupper())\r\nprint(s.upper() if cntUpper > len(s)/2 else s.lower())", "\r\n\r\n\r\nstring = input()\r\n\r\nupper_total = 0\r\nlower_total = 0\r\n\r\nfor char in string:\r\n if char.islower():\r\n lower_total +=1\r\n elif char.isupper():\r\n upper_total +=1\r\n\r\nif upper_total > lower_total:\r\n string = string.upper()\r\nelse:\r\n string = string.lower()\r\n\r\nprint(string)\r\n \r\n", "s= input()\r\nj=0\r\nk=0\r\nfor i in s:\r\n if i.islower()== True:\r\n j+=1\r\n else:\r\n k+=1\r\nif j>=k:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "s=input()\r\nup=0\r\nlp=0\r\nfor i in s:\r\n if(i.isupper()):\r\n up=up+1\r\n if(i.islower()):\r\n lp=lp+1\r\nif(up>lp):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "lcnt, ucnt = 0, 0\r\n\r\ns = input()\r\n\r\nfor c in s:\r\n if c == c.upper():\r\n ucnt += 1\r\n else:\r\n lcnt += 1\r\n\r\nif ucnt > lcnt:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "\r\ndef main():\r\n s = input()\r\n lower , upper = 0, 0\r\n for i in s :\r\n if i.isupper() : upper += 1\r\n else: lower += 1\r\n fl = True if lower >= upper else False\r\n tmp = []\r\n for i in s :\r\n if fl == True:\r\n tmp.append(i.lower())\r\n else : tmp.append(i.upper())\r\n ans = ''.join(tmp)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\": main()", "n=input()\r\ncl=0\r\nc=0\r\nfor i in range(0,len(n)):\r\n if(n[i].islower()):\r\n cl+=1\r\n else:\r\n c+=1\r\nif cl>=c:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "alphabet = \"qwertyuiopasdfghjklzxcvbnm\"\nword = str(input())\nif sum([c in alphabet for c in word]) < (len(word)) / 2:\n print(word.upper())\nelse:\n print(word.lower())\n\n\n#NguyenDangHuy\n\t \t \t\t\t \t\t \t \t \t \t \t\t", "word = input()\r\n\r\nn_upper = 0\r\nfor w in word:\r\n n_upper += (1 if w.upper() == w else 0)\r\n\r\nn_lower = len(word) - n_upper\r\n\r\nif n_lower >= n_upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n\r\n", "word=str(input())\r\n\r\n# Count the number of uppercase and lowercase letters\r\nnum_upper = sum(1 for char in word if char.isupper()) # generates 1 for any upper letter and 0 for any lower letter . \r\nnum_lower = sum(1 for char in word if char.islower())\r\n\r\nif num_upper > num_lower:\r\n corrected_word = word.upper()\r\n\r\nelif num_lower == num_upper :\r\n corrected_word = word.lower()\r\n\r\nelse:\r\n corrected_word = word.lower()\r\n\r\nprint(corrected_word)", "S = input()\r\nA=0\r\nfor x in S:\r\n if x.isupper():\r\n A+=1\r\nif A>len(S)//2:\r\n S=S.upper()\r\nelse:\r\n S=S.lower()\r\nprint(S)", "a = input()\r\nl_c,u_c = 0,0\r\nfor i in a:\r\n if i.islower():\r\n l_c += 1\r\n if i.isupper():\r\n u_c += 1\r\nif u_c>l_c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "inp_str = input()\n\ncount_lower = 0\n\nfor i in inp_str:\n count_lower += i.islower()\n \nif count_lower >= (int(len(inp_str)/2) + len(inp_str)%2):\n print(inp_str.lower())\nelse:\n print(inp_str.upper())\n\n# print(inp_str.islower())\n\n", "string = input()\r\nu_count = 0\r\nl_count = 0\r\nfor i in string:\r\n if i.isupper() == True:\r\n u_count += 1\r\n else:\r\n l_count += 1\r\nif u_count > l_count:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "a = input()\r\nctl = 0\r\nctu = 0\r\nfor i in a:\r\n if i.islower():\r\n ctl += 1\r\n else:\r\n ctu += 1\r\nif ctu > ctl:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nucnt = 0\r\nlcnt = 0\r\nfor c in s:\r\n if c.isupper():\r\n ucnt += 1\r\n else:\r\n lcnt += 1\r\nif ucnt > lcnt:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nb = 0\r\ns = 0\r\nfor i in a:\r\n if ord(i) <= 91:\r\n b += 1\r\n else:\r\n s += 1\r\nif b > s:\r\n print(a.upper())\r\nelif b == s:\r\n print(a.lower())\r\nelse:\r\n print(a.lower())\r\n", "s = input()\r\ncU = 0\r\ncL = 0\r\nfor i in s:\r\n if i.isupper():\r\n cU += 1\r\n else:\r\n cL += 1\r\nif cU > cL:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "s1=input()\r\ns=list(s1)\r\nc=0\r\nfor i in s:\r\n if i.isupper():\r\n c=c+1\r\nif c>(len(s)-c):\r\n print(s1.upper())\r\nelse:\r\n print(s1.lower())\r\n\r\n", "# ord() kodu harfleri sayıya , chr() kodu sayıları harf'e çevirir.\r\n# Büyük harfler---> 65-90 , Küçük harfler---> 97-122\r\n\r\nWord = input()\r\nWord_String = str(Word)\r\nWord_List = list(Word)\r\nBig = 0\r\nSmall = 0\r\n\r\nfor x in Word_List:\r\n if ord(x) >= 97:\r\n Small += 1\r\n \r\n else:\r\n Big += 1\r\n\r\n\r\nif Big > Small:\r\n print(Word_String.upper())\r\n\r\nelif Small > Big:\r\n print(Word_String.lower())\r\n\r\nelif Small == Big:\r\n print(Word_String.lower())\r\n\r\n\r\n\r\n", "import string\r\ns=input()\r\nn=len(s)\r\nuc=0\r\nlc=0\r\nfor i in range(0,n):\r\n if(s[i].isupper()):\r\n uc=uc+1\r\n else:\r\n lc=lc+1\r\nif(lc>=uc):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\nuppers = list(filter(lambda c : c.isupper(),list(word)))\nif len(uppers) > len(word)-len(uppers):\n print(word.upper())\nelse :\n print(word.lower())", "s=input()\r\ns1=0\r\ns2=0\r\nfor i in range(0,len(s)):\r\n if s[i].isupper():\r\n s1=s1+1\r\n else:\r\n s2=s2+1\r\nif s1>s2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nupper, lower = 0, 0\r\nfor c in s:\r\n if c.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper <= lower:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\n\r\nlowers = \"abcdefghijklmnopqrstuvwxyz\"\r\nuppers = lowers.upper()\r\nnumlow = 0\r\nnumhigh = 0\r\nfor c in word:\r\n if c in lowers:\r\n numlow+=1\r\n elif c in uppers:\r\n numhigh+=1\r\nif numhigh>numlow:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "import sys\r\n\r\nword = sys.stdin.read().strip()\r\ncap_count = 0\r\nfor l in word:\r\n cap_count = cap_count+1 if l.isupper() else cap_count\r\nif 2*cap_count > len(word):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "x=input()\r\ny=list(x)\r\nl,u=0,0\r\nfor i in y:\r\n if i>=\"a\" and i<=\"z\":\r\n l+=1\r\n else:\r\n u+=1\r\nif l>=u:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "n=str(input())\r\nu=0\r\nl=0\r\nfor i in n:\r\n\tif(i.isupper()):\r\n\t u=u+1\r\n\telse:\r\n\t l=l+1\r\nif(u==l):\r\n print(n.lower())\r\n \r\nelif(u>l):\r\n\tprint(n.upper())\r\n\t\r\nelse:\r\n\tprint(n.lower())", "s = input()\n\nres = sum([1 if c.islower() else 0 for c in s])\n\nif res >= len(s) - res:\n print(s.lower())\nelse:\n print(s.upper())\n", "def solve():\r\n s = input()\r\n count_lowercase = 0\r\n count_uppercase = 0\r\n\r\n for i in range(len(s)):\r\n if s[i].isupper():\r\n count_uppercase += 1\r\n else:\r\n count_lowercase += 1\r\n\r\n if count_uppercase > count_lowercase:\r\n s = s.upper()\r\n else:\r\n s = s.lower()\r\n \r\n print(s)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "s=input()\r\nsml=0\r\ncap=0\r\nfor i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n cap+=1\r\n else:\r\n sml+=1\r\nif(sml>=cap):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\nc = 0\nfor i in range(len(s)):\n if s[i].isupper() == True: c = c + 1 \n\nprint(s.upper() if c > len(s)-c else s.lower())\n", "s = str(input())\r\ncount_upper = 0\r\ncount_lower = 0\r\nfor i in s:\r\n if i.isupper():\r\n count_upper += 1\r\n elif i.islower():\r\n count_lower += 1\r\nif count_upper > count_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "n=input()\r\nbig,small=0,0\r\nfor i in n:\r\n if 'z'>=i>='a':\r\n small+=1\r\n else:\r\n big+=1\r\nif big>small:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "word = input()\r\n\r\na = []\r\nb = []\r\nfor i in word:\r\n if i == i.upper():\r\n a.append(i)\r\n else:\r\n b.append(i)\r\n\r\nif len(a) > len(b):\r\n print(word.upper())\r\n\r\nelif len(a) < len(b):\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "def solve(word):\r\n lowercase = 0\r\n uppercase = 0\r\n for char in word:\r\n if char.islower():\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\n if lowercase >= uppercase:\r\n return word.lower()\r\n else:\r\n return word.upper()\r\n\r\nif __name__ == \"__main__\":\r\n word = input()\r\n print(solve(word))", "s = input()\r\n\r\ncl = 0\r\nfor x in s:\r\n cl += int(x.islower())\r\n\r\ncu = len(s) - cl\r\nif(cl >= cu):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = str(input())\nlength = (len(word))\ncount1=0\ncount2=0\nfor i in word:\n if(i.isupper()):\n count1=count1+1\n elif(i.islower()):\n count2=count2+1\nif count1 > count2:\n print(word.upper())\nelif count1 < count2 or count1 == count2:\n print(word.lower())", "a=input()\r\nlowercase=0\r\nuppercase=0\r\nfor i in a:\r\n if i.islower():\r\n lowercase+=1\r\n elif i.isupper():\r\n uppercase+=1\r\nif lowercase>=uppercase :\r\n a=a.lower()\r\n print(a)\r\nelse:\r\n a=a.upper()\r\n print(a)\r\n \r\n\r\n ", "a=input()\r\nu=0\r\nl=0\r\nfor i in a:\r\n if (i.islower()):\r\n l+=1\r\nfor i in a:\r\n if (i.isupper()):\r\n u+=1\r\nif l>u :\r\n print(a.lower())\r\nelif u>l:\r\n print(a.upper())\r\nelif l==0 or u==0:\r\n print(a)\r\nelif l==u:\r\n print(a.lower())", "s = input()\r\nupper_number = sum(c.isupper() for c in s)\r\nif len(s) >= upper_number * 2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nu = sum(c.isupper() for c in s)\r\nif u > len(s)//2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = str(input())\r\nlen = len(word)\r\nlensmall = 0\r\nlencap = 0\r\nfor i in range(0, len):\r\n if word[i] == word[i].lower():\r\n lensmall += 1\r\n else:\r\n lencap += 1\r\nif lencap > lensmall:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "a = [*input()]\r\n\r\nupper = 0\r\nfor i in a:\r\n if ord(i) <97:\r\n upper+=1\r\n\r\nif upper > len(a) - upper:\r\n for i in range(len(a)):\r\n if ord(a[i]) >=97:\r\n a[i] = chr(ord(a[i])-32)\r\nelse:\r\n for i in range(len(a)):\r\n if ord(a[i]) <97:\r\n a[i] = chr(ord(a[i])+32)\r\n \r\na = \"\".join(a)\r\n\r\nprint(a)\r\n", "s=input()\r\nca,sm=0,0\r\nfor i in s:\r\n if i>='A' and i<='Z':\r\n ca+=1\r\n else:\r\n sm+=1\r\nif ca>sm:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\n\r\nmici=0\r\nmari=0\r\n\r\nfor i in s:\r\n if i.islower():\r\n mici=mici+1\r\n else:\r\n mari=mari+1\r\n\r\nif mari>mici:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\n\r\nprint(s)", "s=input()\r\nl=0\r\nh=0\r\nfor i in s:\r\n if(i.isupper()):\r\n h=h+1\r\n else:\r\n l=l+1\r\nif(l==h):\r\n print(s.lower())\r\nelif(h>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = list(input())\r\nupper = 0\r\nlower = 0\r\nfor c in word:\r\n if ord(c) < 91:\r\n upper +=1\r\n else:\r\n lower +=1\r\nif upper > lower:\r\n print(''.join([c.upper() for c in word]))\r\nelse:\r\n print(''.join([c.lower() for c in word]))", "word = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in word:\r\n if(i.islower()):\r\n count1=count1+1\r\n elif(i.isupper()):\r\n count2=count2+1\r\nif count1 > count2:\r\n print(word.lower())\r\nelif count1 < count2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input();up,down=0,0\r\nfor letter in word:\r\n if letter.isupper():up+=1\r\n else: down+=1\r\nword = word.lower() if down >= up else word.upper()\r\nprint(word)\r\n \r\n", "a = input()\r\n\r\nlower_count = 0\r\nfor c in a:\r\n if c.islower():\r\n lower_count += 1\r\n\r\nif (len(a) + 1) // 2 <= lower_count:\r\n a = a.lower()\r\nelse:\r\n a = a.upper()\r\n \r\nprint(a)", "def solve():\r\n s = input()\r\n print([s.lower(), s.upper()][sum(1 for c in s if c.isupper()) > len(s)/2])\r\n\r\ndef main():\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def lower(text):\r\n for i in range(len(text)):\r\n if(text[i]>='a' and text[i]<='z'):\r\n print(text[i],end=\"\")\r\n elif(text[i]>='A' and text[i]<='Z'):\r\n print(chr(ord(text[i])+32),end=\"\")\r\n\r\ntext=input()\r\nuppercase_count=0\r\nlowercase_count=0\r\nfor i in range(len(text)):\r\n if(text[i]>='a' and text[i]<='z'):\r\n lowercase_count+=1\r\n elif(text[i]>='A' and text[i]<='Z'):\r\n uppercase_count+=1\r\n\r\nif(uppercase_count==lowercase_count):\r\n lower(text)\r\nelif(uppercase_count>lowercase_count):\r\n for i in range(len(text)):\r\n if(text[i]>='A' and text[i]<='Z'):\r\n print(text[i],end=\"\")\r\n elif(text[i]>='a' and text[i]<='z'):\r\n print(chr(ord(text[i])-32),end=\"\")\r\nelse:\r\n lower(text)", "userInput = input()\r\nlow = 0\r\nup = 0\r\nfor c in userInput:\r\n if c.islower():\r\n low += 1\r\n else:\r\n up += 1\r\nif low == up or low > up:\r\n print(userInput.lower())\r\nelse:\r\n print(userInput.upper())\r\n", "n=input()\r\nc=0\r\nd=0\r\nfor i in n:\r\n if i>='a' and i<='z':\r\n c+=1 \r\n elif i>='A' and i<='Z':\r\n d+=1 \r\nif(c>d):\r\n print(n.lower())\r\nelif(c==d):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\nlower = 0\r\nfor letter in word:\r\n if 'a' <= letter <= 'z' :\r\n lower +=1\r\nupper = len(word) - lower\r\n\r\nif upper > lower:\r\n print(word.upper())\r\n \r\nelse :\r\n print (word.lower())", "s = input()\r\ncoun = 0\r\nfor a in s:\r\n if a.isupper():\r\n coun = coun+1\r\n\r\nif coun > len(s)-coun:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\n\r\nlowers = ''\r\nuppers = ''\r\n\r\nfor let in word:\r\n if let.islower():\r\n lowers += let\r\n else:\r\n uppers += let\r\n\r\nif len(uppers) > len(lowers):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "b = input()\r\na = list(b)\r\nile=0\r\nmal=0\r\nif len(a)%2==0:\r\n dod=0\r\nelse:\r\n dod=1\r\nfor i in range(len(a)):\r\n if a[i].islower()== True:\r\n ile+=1\r\n if ile==int(len(a)/2)+dod:\r\n print(b.lower())\r\n mal=1\r\n break\r\nif mal==0:\r\n print(b.upper())", "word = input()\r\nlc = 0\r\nuc = 0\r\nfor c in word:\r\n if c.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\n\r\nif uc > lc:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nc=0\r\nl=0\r\nfor i in s:\r\n if ord(i)<97:\r\n c+=1\r\n else:\r\n l+=1\r\n \r\nif c>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "txt=input()\r\ncu=0\r\ncl=0\r\nfor z in txt:\r\n if z.islower():\r\n cl=cl+1\r\n else:\r\n cu=cu+1\r\nif cu>cl:\r\n out=txt.upper()\r\nelse:\r\n out=txt.lower()\r\nprint(out)\r\n ", "def isupper(c):\r\n if (c.isupper()):\r\n return True\r\n \r\ns=input()\r\nd=len(s)\r\nj=(1+len(s))//2\r\nc=0\r\nif(d%2!=0):\r\n for i in s:\r\n if(isupper(i)):\r\n c+=1\r\n if(c>=j):\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\nelse:\r\n for i in s:\r\n if(isupper(i)):\r\n c+=1\r\n if(c>j):\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n", "def convert(s):\r\n l = u = 0\r\n\r\n for c in s:\r\n if c.islower():\r\n l += 1\r\n else:\r\n u += 1\r\n\r\n if l >= u:\r\n return s.lower()\r\n\r\n return s.upper()\r\n\r\n\r\ndef main():\r\n print(convert(input()))\r\n\r\n\r\nmain()\r\n", "word = input().strip()\r\nupper = lower = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif lower>=upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "str = input()\r\nlength = len(str)\r\ncapitals = 0\r\nfor char in str:\r\n if char < char.lower():\r\n capitals += 1\r\nif capitals <= length // 2:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())\r\n", "if __name__ == '__main__':\n s = input()\n\n l_count = 0\n u_count = 0\n\n for i in s:\n if i.isupper():\n u_count += 1\n else:\n l_count += 1\n\n if u_count > l_count:\n print(s.upper())\n\n else:\n print(s.lower())\n\n\t \t\t\t \t\t\t\t \t\t\t \t \t\t\t \t \t \t\t", "import re\r\nword = input().strip()\r\nup = re.findall(\"[A-Z]\",word)\r\nlow = re.findall(\"[a-z]\",word)\r\nif len(up) > len(low):\r\n print(word.upper())\r\n exit()\r\nprint(word.lower())", "import string\nlowerCount = 0\nupperCount = 0\nword = input()\nfor char in word:\n\tif char in string.ascii_lowercase:\n\t\tlowerCount += 1\n\telse:\n\t\tupperCount += 1\nif upperCount > lowerCount:\n\tprint(word.upper())\nelse:\n\tprint(word.lower())\n", "n = str(input())\r\nx = 0\r\n\r\nfor i in range(len(n)):\r\n\tif n[i].isupper() == True:\r\n\t\tx += 1\r\nif x > len(n) - x:\r\n\tprint(n.upper())\r\nelse:\r\n\tprint(n.lower())\r\n", "k = list(map(str, input().strip()))\r\nm=0\r\nl=0\r\nfor i in range(len(k)):\r\n if k[i].isupper():\r\n l=l+1\r\n else:\r\n m=m+1\r\nk = \"\".join(k)\r\nif m>=l:\r\n print(k.lower())\r\nelse:\r\n print(k.upper())", "a=input()\r\nx=0\r\ny=0\r\nfor i in a:\r\n if i.isupper():\r\n x+=1\r\n else:\r\n y+=1\r\nif y>=x:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\nc=0\nf=0\nfor i in range(len(s)):\n\tif (s[i].isupper()):\n\t\tc+=1\n\telse:\n\t\tf+=1\nif(c>f):\n\tprint(s.upper())\nelif(c==f):\n\tprint(s.lower())\nelse:\n\tprint(s.lower())\n \t\t \t \t\t\t\t\t \t\t\t\t \t\t\t \t\t", "s=input()\r\nl=[]\r\nop=['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\nopp=['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\ndef lowerize(s):\r\n new=\"\"\r\n for i in s:\r\n if i in op:\r\n new+=i\r\n else:\r\n i=op[opp.index(i)]\r\n new+=i\r\n print(new)\r\ndef upperize(s):\r\n new=\"\"\r\n for i in s:\r\n if i in opp:\r\n new+=i\r\n else:\r\n i=opp[op.index(i)]\r\n new+=i\r\n print(new)\r\nfor i in s:\r\n l.append(i)\r\nlower=0\r\nupper=0\r\nfor i in l:\r\n if i in op :\r\n lower+=1\r\n else:\r\n upper+=1\r\nif lower>=upper:\r\n lowerize(s)\r\nelse:\r\n upperize(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x=input()\r\nu=0\r\nl=0\r\nfor i in x:\r\n if i.islower():\r\n l=l+1\r\n if i.isupper():\r\n u=u+1\r\nif l>u or l==u:\r\n print(x.lower())\r\nif u>l:\r\n print(x.upper())", "s=input()\r\na=0\r\nb=0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].lower():\r\n a+=1\r\nfor j in range(len(s)):\r\n if s[j]==s[j].upper():\r\n b+=1\r\nif b>a:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "i=input(\"\")\r\ns=0\r\np=0\r\nfor j in i:\r\n if ord(j)>=96:\r\n s+=1\r\n else:\r\n p+=1\r\nif s==p or s>p:\r\n print(i.lower())\r\nelse:\r\n print(i.upper())", "def solve():\r\n word = input()\r\n lower = 0\r\n upper = 0\r\n for char in word:\r\n if ord(\"A\")<=ord(char)<=ord(\"Z\"):\r\n upper+=1\r\n else:\r\n lower+=1\r\n if lower >= upper:\r\n return word.lower()\r\n return word.upper()\r\n\r\nprint(solve())", "x=input()\r\nl1=list()\r\nl2=[]\r\nfor i in range(len(x)):\r\n if x[i]>=chr(65) and x[i]<=chr(90):\r\n l1+=x[i]\r\n if x[i]>chr(90):\r\n l2+=x[i]\r\nif len(l1)<len(l2) or len(l1)==len(l2):\r\n x=x.lower()\r\n\r\nif len(l2)<len(l1):\r\n x=x.upper()\r\nprint(x)", "x=input()\r\ndef count(word):\r\n caps, small = 0, 0\r\n for letter in word:\r\n if letter.isupper():\r\n caps += 1\r\n else:\r\n small += 1\r\n \r\n return caps, small\r\n\r\ndef caps_small(word):\r\n numCaps, numSmall = count(word)\r\n if numCaps > numSmall:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n \r\ncaps_small(x)", "word =input()\r\ncp = 0\r\nsm = 0\r\nfor i in word:\r\n if i.isupper():\r\n cp+=1\r\n elif i.islower():\r\n sm+=1\r\nif cp>sm:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input().strip()\r\nuppercount=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n uppercount+=1\r\nif uppercount/len(s) > 0.5:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nupper_count, lower_count = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\nif upper_count > lower_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nl=u=0\r\nfor let in s:\r\n if(ord(let)>=65 and ord(let)<=90):\r\n u+=1\r\n else:\r\n l+=1\r\nif(l==u or l>u):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "u=0\r\nl=0\r\ns=input()\r\nfor i in range(len(s)):\r\n\tif s[i].isupper()==True:\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif l>=u:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())\t", "s=input()\r\ncount=0\r\ncounter=0\r\nfor i in s:\r\n if i>='a' and i<='z':\r\n count+=1\r\n else:\r\n counter+=1\r\nif count>=counter:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nl=0\r\nfor i in range(len(s)):\r\n if ord(s[i])>ord(s[i].swapcase()):\r\n l+=1\r\n else:\r\n l-=1\r\nif l>=0:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\nl = 0\r\nu = 0\r\nfor i in range(len(n)):\r\n if(n[i].islower()):\r\n l += 1\r\n else:\r\n u += 1\r\nif l >= u:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(word)):\r\n if (word[i].islower()):\r\n lower+=1\r\n elif (word[i].isupper()):\r\n upper+=1\r\nif (upper>lower):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "u_list=[]\r\nl_list=[]\r\nstring=input()\r\nfor i in range(len(string)):\r\n if ord(string[i])<=90:\r\n u_list.append(string[i])\r\n else:\r\n l_list.append(string[i])\r\nif len(l_list)>=len(u_list):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "a=input()\r\nc=0\r\nfor i in a:\r\n if i>=\"A\" and i<=\"Z\":\r\n c+=1\r\nd=len(a)-c\r\nif d>=c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "\nword= input().strip()\nu =0\nl =0\nfor i in word:\n\tif i.isupper():\n\t\tu+=1\n\telse:l+=1\n#print(\"u:%d, l:%d\"%(u,l))\nprint(word.upper() if u>l else word.lower())", "s = input()\r\nnum = len(s)\r\ncaps = 0\r\nfor i in range(65,91):\r\n caps = caps + s.count(chr(i))\r\nlow = num - caps\r\nif low >= caps:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def ins(s):\r\n i = 0\r\n for si in s:\r\n if si>='a': i+=1\r\n return i >= len(s)-i\r\n\r\nif ins(s:=input()): print(s.lower())\r\nelse: print(s.upper())\r\n", "word = str(input())\r\nborder = len(word) / 2\r\ncap = 0\r\nsmall = 0\r\ncapital = 0\r\nletList = []\r\nfor i in range(0, len(word)):\r\n letList.append(word[i])\r\n if ord(word[i]) > 95:\r\n small += 1\r\n else:\r\n cap += 1\r\n if cap > border:\r\n capital = 1\r\nfor j in range(0, len(letList)):\r\n if capital:\r\n if ord(word[j]) > 95:\r\n letList[j] = chr(ord(word[j]) - 32)\r\n else:\r\n if ord(word[j]) < 95:\r\n letList[j] = chr(ord(word[j]) + 32)\r\nprint(''.join(letList))", "a = input()\r\nc = 0\r\nfor i in a:\r\n\tif ord(i)>=97 and ord(i)<=122:\r\n\t\tc+=1\r\nif len(a)-c>c:\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "s=input()\r\nupp,low=0,0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n upp+=1\r\n else:\r\n low+=1\r\nif upp>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\n\nsz = len(s)\nupper = 0\nlower = 0\nfor i in range(0,sz):\n if ord(s[i]) < 97 :\n upper = upper +1\n else :\n lower = lower + 1\n\nif upper > lower :\n s = s.upper()\nelse :\n s = s.lower()\n\nprint(s)", "\n# 65 90 97 122\n\ndef solution(word):\n\tl, u = 0, 0\n\tfor c in word:\n\t\t_c = ord(c)\n\t\tif _c >= 65 and _c <= 90:\n\t\t\t u += 1\n\t\telse:\n\t\t\tl += 1\n\t\n\tif l >= u:\n\t\treturn word.lower()\n\t\n\treturn word.upper()\n\t\n\n\nif __name__ == \"__main__\":\n\tword = input()\n\tprint(solution(word))\n", "from sys import stdin, stdout\r\n\r\nword = str(stdin.readline())\r\nup = 0\r\nlow = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n up += 1\r\n elif i.islower():\r\n low += 1\r\n\r\nif low > up or low == up:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\n\r\nprint(word)\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n", "miin=0\r\nmaj=0\r\nk=''\r\ns=input()\r\nfor x in s:\r\n if (str(x).islower()==True):\r\n miin+=1\r\n else:\r\n maj+=1\r\nif (maj>miin):\r\n k=s.upper()\r\n print(k)\r\nelse:\r\n k=s.lower()\r\n print(k)", "n=input()\r\nupper_num=0\r\nlower_num=0\r\nfor x in n:\r\n if ord(x)<=90:\r\n upper_num+=1\r\n if ord(x)>=97:\r\n lower_num+=1\r\nif upper_num>lower_num:\r\n for t in n:\r\n t=t.upper()\r\n print(t,end='')\r\nif lower_num>=upper_num:\r\n for t in n:\r\n t=t.lower()\r\n print(t, end='')", "t=input(\"\")\r\na=len(t)\r\nc=0\r\nd=0\r\nfor x in range(a):\r\n if (t[x].isupper()):\r\n c+=1\r\n elif(t[x].islower()):\r\n d+=1\r\nif(c>d):\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "def rec (s , up) :\r\n if len(s) == 0 :\r\n return up\r\n else :\r\n if s[0].isupper() :\r\n up += 1\r\n return rec (s[1:] , up)\r\n\r\ns = input()\r\nup = rec(s , 0)\r\n\r\nlow = len(s) - up\r\n\r\nif up > low :\r\n s = s.upper()\r\nelse :\r\n s = s.lower()\r\n\r\nprint(s)", "s = input()\nu = 0\nfor i in s:\n if i.isupper():\n u += 1\nif len(s)/2 < u:\n print(s.upper())\nelse:\n print(s.lower()) ", "s = input()\r\nuppercase = 0\r\nlowercase = 0\r\nfor i in s :\r\n if i.isupper() :\r\n uppercase = uppercase +1\r\n else:\r\n lowercase = lowercase + 1\r\nif uppercase > lowercase:\r\n print(s.upper())\r\nelif lowercase > uppercase:\r\n print(s.lower())\r\nelif lowercase == uppercase:\r\n print(s.lower())\r\n", "s = input()\r\nl = 0\r\nu = 0\r\nfor i in s:\r\n if i.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif u>l:\r\n for i in s:\r\n print(i.upper(),end=\"\")\r\nelse:\r\n for i in s:\r\n print(i.lower(),end=\"\")\r\nprint()\r\n", "a=input(\"\")\r\nlen=len(a)\r\nnSmall=0\r\nfor letter in a:\r\n if ord(letter)>=97 :\r\n nSmall=nSmall+1\r\n \r\nif nSmall<(len/2):\r\n a=a.upper()\r\nelse: a=a.lower() \r\n\r\nprint(a)", "s = input()\r\nlow=0\r\nhigh=0\r\nfor i in s:\r\n if(i.islower()):\r\n low+=1\r\n else:\r\n high+=1\r\nif(low>=high):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import string\r\nx=input()\r\nli=list(string.ascii_letters)\r\ny=sum(1 for li in x if li.isupper())\r\nd=sum(1 for li in x if li.islower())\r\nif y>d:\r\n print(x.upper())\r\nelif d>=y:\r\n print(x.lower())", "def change_letters():\n word = input()\n upper_count = len([*filter(lambda letter:letter.isupper(), word)])\n if upper_count > (len(word)-upper_count):\n print(word.upper())\n else:\n print(word.lower())\nchange_letters()\n\t\t\t\t\t\t \t\t\t \t\t\t \t \t \t \t", "try:\r\n s = input()\r\n cap=0\r\n low=0\r\n\r\n for i in s:\r\n if ord(i) in range(97,123):\r\n low+=1\r\n else:\r\n cap+=1\r\n if low>=cap:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\nexcept :\r\n pass", "if __name__ == '__main__':\r\n\ts = input()\r\n\r\n\tprint(s.upper() if sum([1 for letter in s if letter.isupper()]) > sum([1 for letter in s if letter.islower()]) else s.lower(), end = '')", "stg=input(\"\")\r\ncount=0\r\nsum=0\r\nfor i in stg:\r\n if(i>='A' and i<='Z'):\r\n count=count+1\r\n else:\r\n sum=sum+1\r\nif(count>sum):\r\n print(stg.upper())\r\nelse:\r\n print(stg.lower())", "word = input()\r\ncount_low = 0\r\ncount_hig = 0\r\nfor letter in word:\r\n if letter.islower() == True:\r\n count_low += 1\r\ncount_hig = len(word) - count_low\r\n\r\nif count_hig <= count_low:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "word = input()\r\n\r\nlower=0\r\nupper=0\r\nfor letter in word:\r\n if letter.islower()==True:\r\n lower += 1\r\n else:\r\n upper += 1\r\n \r\nif upper > lower:\r\n print(word.upper())\r\nelif upper==lower:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "a=input()\r\nu=0\r\nl=0\r\nfor i in a:\r\n if(i.isupper()):\r\n u=u+1\r\n elif(i.islower()):\r\n l+=1\r\nif(l>=u):\r\n print(a.lower())\r\nelif(u>l):\r\n print(a.upper())\r\n \r\n \r\n", "var=input()\r\nupers=0\r\nlowers=0\r\nfor i in range(len(var)):\r\n if ord(var[i]) >= 65 and ord(var[i]) <= 90:\r\n upers += 1\r\n else:\r\n lowers += 1\r\nif upers>lowers:\r\n print(var.upper())\r\nelse:\r\n print(var.lower())", "s = input()\n\ncountUpper = 0\ncountLower = 0\nfor x in s:\n if x.isupper(): countUpper+=1\n else: countLower += 1\n\nif countUpper > countLower:\n print(s.upper())\nelse:\n print(s.lower())\n\n ", "word = input()\r\ncounter =0\r\nfor i in word:\r\n if i.isupper():\r\n counter+=1\r\n else:\r\n counter-=1\r\nif counter<=0:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s= input ()\nlower=0\nupper=0\nfor char in s:\n if char.isupper():\n upper+=1\n else:\n lower+=1\nif upper>lower:\n s=s.upper()\nelse:\n s=s.lower()\nprint(s)\n\n\t \t\t\t \t \t\t\t\t\t \t\t \t\t \t", "#59A\r\nbig=0\r\nsmall=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n big+=1\r\n else:\r\n small+=1\r\nif big>small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "w=input()\r\nlower=0\r\nupper=0\r\nfor char in w:\r\n if char.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n w=w.upper()\r\nelse:\r\n w=w.lower()\r\nprint(w)", "s0 = input()\r\ns1 = s0.upper()\r\ns2 = s0.lower()\r\nn = len(s0)\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(n):\r\n if s0[i] == s1[i]:\r\n c1 += 1\r\n elif s0[i] == s2[i]:\r\n c2 += 1\r\nif c1 > c2:\r\n print(s1)\r\nelse:\r\n print(s2)\r\n", "n = list(input())\r\ncount_upper=count_lower=0\r\nfor i in range(len(n)):\r\n if n[i].isupper()==True:\r\n count_upper+=1\r\n else:\r\n count_lower+=1\r\nx = ''.join(n)\r\nif count_upper<count_lower or count_upper == count_lower:\r\n x = x.lower()\r\nelse:\r\n x = x.upper()\r\nprint(x)", "s = input()\r\nupp = sum([1 for ch in s if ch.isupper()])\r\nlow = len(s)-upp\r\nif upp > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nx = sum(1 for i in a if i.isupper())\r\ny = len(a) - x\r\nif x > y:\r\n n = a.upper()\r\nelse:\r\n n = a.lower()\r\nprint(n)", "s=input()\r\nupper=0\r\nlower=0\r\nfor i in s:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper<=lower:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "ans=input()\r\nuip=0\r\nlip=0\r\nfor i in ans:\r\n if i.islower():\r\n lip+=1\r\n elif i.isupper():\r\n uip+=1\r\n else:\r\n pass\r\nif uip>lip:\r\n ans=ans.upper()\r\nelse:\r\n ans=ans.lower()\r\n \r\nprint(ans)", "import re\r\ns = input()\r\ndef regex(text):\r\n upper = len(re.findall(r'[A-Z]',text))\r\n lower = len(re.findall(r'[a-z]',text))\r\n if upper < lower:\r\n print(text.lower())\r\n elif upper == lower:\r\n print(text.lower())\r\n else:\r\n print(text.upper())\r\nregex(s)", "lower=['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\nupper=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\ns=input()\r\nu,l=0,0\r\nfor i in s:\r\n if i in upper:\r\n u+=1\r\n else:\r\n l+=1\r\nif u<l or u==l:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n\r\n", "str = input();\r\nu = 0\r\nl = 0\r\nfor c in str:\r\n if c >= 'A' and c <= 'Z':\r\n u = u + 1;\r\n else:\r\n l = l + 1;\r\nif(l >= u):\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "lowerabc = [*'qwertyuiopasdfghjklzxcvbnm']\r\nword = input()\r\nhold = 0\r\nfor c in word:\r\n if c in lowerabc:\r\n hold += 1\r\nif 2*hold >= len(word):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "import string\r\ns = input()\r\n\r\nup_couner = 0\r\nlow_counter = 0\r\n\r\nfor x in s:\r\n if x in string.ascii_lowercase:\r\n low_counter += 1\r\n if x in string.ascii_uppercase:\r\n up_couner += 1\r\n\r\nif up_couner > low_counter:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nc=[]\r\nfor i in a:\r\n c.append(i)\r\nl=0\r\nu=0\r\nfor j in range(0,len(c)):\r\n ll=c[j].islower()\r\n uu=c[j].isupper()\r\n if ll==True:\r\n l+=1\r\n if uu==True:\r\n u+=1\r\nif l>=u:\r\n a=a.lower()\r\nelse:\r\n a=a.upper()\r\nprint(a)", "s = input()\r\nup = 0\r\nlo = 0\r\nfor i in s:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n lo += 1\r\nif lo >= up:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "def listToString(s): \r\n str1 = \"\" \r\n return (str1.join(s))\r\n\r\ns=str(input())\r\ns=list(s)\r\nc=0\r\nc1=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n c=c+1\r\n else:\r\n c1=c1+1\r\nif(c>c1):\r\n s=listToString(s)\r\n print(s.upper())\r\nelse:\r\n s=listToString(s)\r\n print(s.lower())", "word = input()\nlowers = 0\nuppers = 0\n\nfor i in word:\n if i.islower():\n lowers += 1\n else:\n uppers += 1\n\nif lowers > uppers or lowers == uppers:\n print(word.lower())\nelse:\n print(word.upper())", "s = 0\r\nu = 0\r\nn = input()\r\nfor i in n:\r\n if ord(i)>=97 and ord(i) < 123:\r\n s += 1\r\n else:\r\n u += 1\r\nif s >= u:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\ndef upper_lower_count(words):\r\n upper = lower = 0\r\n for letter in words:\r\n if letter.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n return upper, lower\r\n\r\nupper_count, lower_count = upper_lower_count(word)\r\nif upper_count > lower_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "names = input()\nuppc,low = 0,0\nfor i in names:\n if(i.isupper()):\n uppc+=1\n else:\n low+=1\nif(uppc>len(names)//2):\n print(names.upper())\nelse:\n print(names.lower())\n \t\t \t \t \t\t \t\t\t \t \t\t\t", "z = input()\r\ncount = 0\r\nfor i in z:\r\n if i.islower():\r\n count = count + 1\r\n\r\nif len(z) - count > len(z) // 2:\r\n print(z.upper())\r\nelse:\r\n print(z.lower())", "def function(s):\r\n total1=0\r\n total2=0\r\n for i in s:\r\n if i.isupper():\r\n total1+=1\r\n else:\r\n total2+=1\r\n if total1>total2:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\nif __name__ == '__main__':\r\n s=input()\r\n # n1 = input()\r\n # n = int(n1)\r\n #l = list(map(int, input().rstrip().split()))\r\n #n=l[0]\r\n #k=l[1]\r\n print(function(s))", "S=input()\r\nA = 0\r\nC = 0\r\nfor i in S:\r\n if ord(i)<=90:\r\n A+=1 \r\n else:\r\n C+=1\r\nif A>C:\r\n S = S.upper()\r\nelif A==C:\r\n S = S.lower()\r\nelse:\r\n S = S.lower()\r\nprint(S)", "s = input()\n\nup = 0\nlo = 0\n\nfor c in s:\n if c.islower():\n lo += 1\n else:\n up += 1\n\nprint(s.upper() if up > lo else s.lower())", "str = input()\nupper = sum(1 for char in str if char.isupper())\nlower = len(str) - upper\n\nif lower >= upper:\n print(str.lower())\nelse:\n print(str.upper())\n\t\t\t \t \t \t \t \t\t\t \t\t \t\t\t \t\t \t", "s = input()\r\nu_count =0\r\nl_count =0\r\nfor i in s:\r\n if i==i.upper():\r\n u_count +=1\r\n else:\r\n l_count +=1\r\n\r\nif u_count>l_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncu=0\r\ncl=0\r\nfor i in range(len(s)):\r\n if s[i]>='A' and s[i]<='Z':\r\n cu+=1\r\n else:\r\n cl+=1\r\nif(cl>=cu):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def main():\n\tstring = input()\n\tflag=0\n\tfor letter in string:\n\t\tif letter.isupper():\n\t\t\tflag+=1\n\t\telse:\n\t\t\tflag-=1\n\tif flag > 0:\n\t\treturn string.upper()\n\telse:\n\t\treturn string.lower()\nif __name__=='__main__':\n\tprint(main())\n", "s = input()\r\na=0\r\nb=0\r\nfor i in range(0,len(s)):\r\n if s[i]==s[i].upper():\r\n a=a+1\r\nfor j in range(0,len(s)):\r\n if s[j]==s[j].lower():\r\n b=b+1\r\nif a<=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "text = input()\nup_cout = 0\nlow_count = 0\nfor i in range(len(text)):\n if text[i].isupper():up_cout += 1\n else : low_count += 1\nif up_cout > low_count : print(text.upper())\nelse : print(text.lower())\n", "w = input()\nu = 0\nl = 0\nfor i in range(len(w)):\n if ord(w[i]) >= 97:\n l += 1\n else:\n u += 1\nif u > l:\n print(w.upper())\nelse:\n print(w.lower())", "def upper_lower(a_string):\r\n countU = 0\r\n countL = 0\r\n \r\n for i in a_string:\r\n \r\n if i.isupper() == True:\r\n \r\n countU += 1\r\n elif i.islower() == True:\r\n \r\n countL += 1\r\n \r\n if countU > countL:\r\n a_string = a_string.upper()\r\n elif countU <= countL:\r\n a_string = a_string.lower()\r\n \r\n return a_string\r\n \r\n\r\ndef main():\r\n a_string = input(\"\")\r\n print(upper_lower(a_string))\r\n\r\nmain()", "s=input()\r\nc=0\r\nz=0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n z+=1\r\nif c>z:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "str1 = input()\r\nupperstr1 = str1.upper()\r\ncnt = 0\r\nfor i in range(len(str1)):\r\n if upperstr1[i] != str1[i]:\r\n cnt += 1\r\nif cnt >= len(str1) * 1.0/ 2:\r\n print(str1.lower())\r\nelse:\r\n print(str1.upper())\r\n", "s = input()\r\nc1 = 0\r\nfor i in s :\r\n if i.isupper():\r\n c1+=1 \r\nc2 = len(s) - c1 # c1*2 >n condition can also be used\r\nif c1>c2:\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "s=input()\r\nj=k=0\r\nfor i in s:\r\n if i.isupper(): j+=1\r\n else: k+=1\r\nif j>k: print(s.upper())\r\nelse: print(s.lower())\r\n", "s=str(input())\r\ncnt = 0\r\nfor i in s:\r\n if(i >='a' and i<='z'): cnt += 1\r\nj = len(s)-cnt\r\nif(cnt >= j): print(s.lower())\r\nelse: print(s.upper())", "st=input()\r\ncp,sm=0,0\r\nfor iv in st:\r\n if ord(iv)<=90 and ord(iv)>=65:\r\n cp+=1\r\n else:\r\n sm+=1\r\nif cp==sm or sm>cp:\r\n print(st.lower())\r\nelif cp>sm:\r\n print(st.upper())", "from sys import stdin\r\n\r\n\r\ndef getLowerCount(word):\r\n count = 0\r\n for x in range(0, len(word)):\r\n if word[x].islower():\r\n count += 1\r\n return count\r\n\r\n\r\ndef getUpperCount(word):\r\n count = 0\r\n for x in range(0, len(word)):\r\n if word[x].isupper():\r\n count += 1\r\n return count\r\n\r\n\r\nw = input()\r\nif(getLowerCount(w) >= getUpperCount(w)):\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n", "n = input()\r\nL=[\"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\nL1=[]\r\nm = \"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in m:\r\n L1.append(i)\r\ncount = 0\r\ncount1= 0\r\nfor i in n:\r\n if i in L:\r\n count = count+1\r\n if i not in L:\r\n count1=count1+1\r\nif count>count1:\r\n print(n.upper())\r\nelif count<count1:\r\n print(n.lower())\r\nelif count == count1:\r\n print(n.lower())\r\n", "n = input()\r\na = 0 \r\nb = 0\r\nfor i in range(len(n)):\r\n if n[i] == n[i].upper():\r\n a+=1\r\n else :\r\n b+=1\r\nif a > b:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "f=input()\nc1=0\nc2=0\nfor char in f:\n if char.isupper():\n c1+=1\n else:\n c2+=1\n#print(c1,c2)\nif c1>c2:\n print(f.upper())\nelse:\n print(f.lower())\n\n ", "s = input()\r\n\r\nlc = 0\r\nuc = 0 \r\n\r\n\r\nfor l in s :\r\n if l.islower():\r\n lc += 1 \r\n else :\r\n uc += 1\r\n\r\nif lc == uc or lc > uc:\r\n s = s.lower()\r\nelse :\r\n s = s.upper()\r\n\r\nprint(s)", "s=input()\r\nkm=0\r\nkb=0\r\nfor i in range(len(s)):\r\n if s[i] in 'qwertyuiopasdfghjklzxcvbnm':\r\n km=km+1\r\n if s[i] in 'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n kb=kb+1\r\nif kb>km:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "s = input()\r\nnumUpper = 0\r\nnumLower = 0\r\n\r\nfor c in s:\r\n if c.isupper():\r\n numUpper+=1\r\n else:\r\n numLower+=1\r\n\r\nif numUpper > numLower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n", "a=str(input())\r\ns=0\r\nfor i in range (len(a)):\r\n\tif a[i]>=\"a\":\r\n\t\ts=s+1\t\t\r\nif 2*s<len(a):\r\n\ta=a.upper()\r\nelse:\r\n\ta=a.lower()\t\r\nprint(a)", "counter = 0\r\nfor x in (string := input()):\r\n if x.isupper():counter += 1\r\n\r\nif counter > len(string)-counter:\r\n print(string.upper())\r\nelse:print(string.lower())", "s=list(input())\nup=0\nlo=0\nfor i in s:\n if i.isupper():\n up+=1\n else:\n lo+=1\nif lo>=up:\n for i in range(len(s)):\n s[i]=s[i].lower()\n print(''.join(s))\nelse:\n for i in range(len(s)):\n s[i]=s[i].upper()\n print(''.join(s))\n", "word = input()\r\nupper = sum(x.isupper() for x in word)\r\nif upper > len(word)//2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "a=input()\r\nv=list(a)\r\nuppercount=0\r\nlowecount=0\r\nfor i in range(0,len(v)):\r\n if(v[i].isupper() == True):\r\n uppercount+=1\r\n else:lowecount+=1\r\nif(uppercount>lowecount):print(a.upper())\r\nelse:print(a.lower())\r\n \r\n\r\n \r\n ", "s = input()\r\nq = sum([-1 if i.islower() else 1 for i in s])\r\nif q > 0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "words = input()\r\n# words = 'maTRIx'\r\n\r\n# word_list = list(word)\r\n\r\nl_count = 0\r\nu_count = 0\r\nfor i in words:\r\n\tif i == i.lower():\r\n\t\tl_count += 1\r\n\telse:\r\n\t\tu_count += 1\r\n\r\nif l_count >= u_count:\r\n\tprint(words.lower())\r\nelse:\r\n\tprint(words.upper()) ", "a=input()\r\ncount=0\r\nb=0\r\nc=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nd=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in a:\r\n\tfor j in c:\r\n\t\tif j==i:\r\n\t\t\tcount+=1\r\n\tfor k in d:\r\n\t\tif k==i:\r\n\t\t\tb+=1\r\nif count==b:\r\n\tprint(a.lower())\r\nelif count>b:\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "n = input()\r\n\r\ndef checker(word):\r\n ls = list(word)\r\n countlow = 0\r\n countup = 0\r\n for items in ls:\r\n if(ord(items) >= 97 ):\r\n countlow += 1\r\n else:\r\n countup += 1\r\n if(countup > countlow):\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\na = checker(n)\r\nprint(a)\r\n \r\n\r\n \r\n", "from string import ascii_uppercase\n\ns = input()\n\nl = 0\nu = 0\n\nfor elem in s:\n if elem in ascii_uppercase:\n u += 1\n else:\n l += 1\n\nif l >= u:\n print(s.lower())\nelse:\n print(s.upper())\n\n", "s=input()\r\nalphabets=\"abcdefghijklmnopqrstuvwxyz\"\r\nlc,uc=0,0\r\nfor i in s:\r\n if i in alphabets:\r\n lc+=1\r\n else:\r\n uc+=1\r\nif lc>=uc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "a = input()\r\ncount = 0\r\nn = len(a)\r\nfor i in range(len(a)):\r\n b = a[i].isupper()\r\n if(b == True):\r\n count = count + 1\r\nif(count > (n-count)):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\ncount = 0\r\n\r\nfor x in s:\r\n if x.islower() == True:\r\n count += 1\r\n\r\nif len(s)-count < count:\r\n s = s.lower()\r\nelif len(s)-count > count:\r\n s = s.upper()\r\nelif len(s)-count == count:\r\n s = s.lower()\r\n\r\nprint(s)", "s=input()\r\ndef fun(s):\r\n cc,sc=0,0\r\n for i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n cc+=1\r\n elif ord(i)>=97 and ord(i)<=122:\r\n sc+=1\r\n \r\n if cc==sc or sc>cc:\r\n return s.lower()\r\n return s.upper()\r\nprint(fun(s))", "s = input()\nup,low = 0,0\nfor i in s:\n if i>=\"a\"and i <= \"z\":\n low+=1\n \n elif i>=\"A\" and i <= \"Z\":\n up+=1\n \nif up>low:\n s=s.upper()\n print(s)\nelif low >=up:\n s=s.lower()\n print(s)\n\t \t \t\t \t \t\t \t \t \t\t\t\t\t\t\t\t", "s=input()\r\na=0\r\nb=0\r\nfor i in s:\r\n if(i.islower()):\r\n b=b+1\r\n elif(i.isupper()):\r\n a=a+1\r\nif(a>b):\r\n print(s.upper())\r\nelif(b>a):\r\n print(s.lower())\r\nelif(b==a):\r\n print(s.lower())", "from turtle import up\r\n\r\n\r\ns = input()\r\nlower = 0\r\nupper = 0\r\nfor i in s:\r\n if i.islower() is True:\r\n lower +=1\r\n elif i.isupper() is True:\r\n upper +=1\r\nif lower>=upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\n\r\ncount_upper = 0\r\ncount_lower = 0\r\nfor letter in word:\r\n if letter.isupper():\r\n count_upper += 1\r\n else:\r\n count_lower += 1\r\n\r\nif count_lower >= count_upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "i=[x for x in input()]\r\nu=l=0\r\nfor x in i:\r\n if x.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif u>l:\r\n print((''.join(i)).upper())\r\nelse:\r\n print((''.join(i)).lower())", "n=input()\r\na=len(n)\r\nc=0\r\nd=0\r\nfor i in range(a):\r\n if(n[i].isupper()):\r\n c=c+1\r\n else:\r\n d=d+1\r\nif(c>d):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "st = input()\r\ncc=cs=0\r\nfor i in st:\r\n if i>='A' and i <='Z':\r\n cc+=1\r\n else:\r\n cs+=1\r\n#print(cc,cs)\r\nif cc>cs:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "s = input()\r\n\r\nk1 = 0\r\nk2 = 0\r\n\r\nfor i in range(0, len(s)):\r\n if ord(s[i]) >= 97 and ord(s[i]) <= 122:\r\n k1 += 1\r\n else:\r\n k2 += 1\r\nif k1 >= k2:\r\n s = s.lower()\r\n print(s)\r\nelse:\r\n s = s.upper()\r\n print(s)", "str = input()\ncount_lower = 0\ncount_upper = 0\nfor i in str:\n if i >= 'a' and i <= 'z':\n count_lower = count_lower + 1\n else:\n count_upper = count_upper + 1 \nif count_lower >= count_upper:\n print(str.lower())\nelse:\n print(str.upper())\n\n", "word = input()\nl = 0\nu = 0\nfor c in word:\n\tif ('a' <= c <= 'z'):\n\t\tl += 1\n\telse:\n\t\tu += 1\nif (u>l):\n\tword = word.upper()\nelse:\n\tword = word.lower()\nprint(word)\n", "s=input();\r\nprint([s.lower(),s.upper()][sum (x<'[' for x in s)*2>len(s)])", "data = input()\r\n\r\nl=u = 0\r\n\r\nfor x in data:\r\n if x.islower():\r\n l+=1\r\n else:\r\n u+=1\r\n\r\nif l>=u:\r\n print(data.lower())\r\nelse:\r\n print(data.upper())", "a=input()\r\nb=list(a)\r\nc=0\r\nd=0\r\nfor i in b:\r\n if 65<=ord(i)<=90:\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n print(a.upper())\r\nelif d>=c:\r\n print(a.lower())", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[4]:\n\n\ns=input()\nun=0\nln=0\n\nfor i in range(len(s)):\n if s[i].isupper()==True:\n un+=1\n if s[i].islower()==True:\n ln+=1\nif un>ln:\n print(s.upper())\nelse:\n print(s.lower())\n\n\n# In[ ]:\n\n\n\n\n", "s = str(input())\r\n\r\nuppercount = 0\r\n\r\nlowercount = 0\r\n\r\nfor letter in s:\r\n if letter.isupper() == True:\r\n uppercount += 1\r\n elif letter.isupper() == False:\r\n lowercount += 1\r\n\r\nif uppercount > lowercount:\r\n print (s.upper())\r\nelse:\r\n print (s.lower())\r\n", "x = input()\r\nupper = []\r\nlower = []\r\nfor i in range(len(x)):\r\n if x[i] == x[i].upper():\r\n upper.append(x[i])\r\n if x[i] == x[i].lower():\r\n lower.append(x[i])\r\nif len(upper) > len(lower):\r\n x = x.upper()\r\nif len(upper) < len(lower):\r\n x = x.lower()\r\nif len(upper) == len(lower):\r\n x = x.lower()\r\nprint(x)", "stg = input()\r\nst = list(stg)\r\nupper = []\r\nlower = []\r\nfor i in range(0, len(st)):\r\n if st[i].isupper():\r\n upper.append(st[i])\r\n else:\r\n lower.append(st[i])\r\n\r\nif len(upper) > len(lower):\r\n print(stg.upper())\r\nelse:\r\n print(stg.lower())\r\n", "str=input()\r\ncount_1=0\r\ncount_2=0\r\nfor i in str:\r\n if(i.isupper()):\r\n count_1+=1\r\n else :\r\n count_2+=1\r\nif (count_1>count_2):\r\n print(str.upper())\r\nelse :\r\n print (str.lower())\r\n\r\n", "s=input()\r\nlow=0\r\nup=0\r\nfor i in s:\r\n if(i.islower()):\r\n low+=1\r\n if(i.isupper()):\r\n up+=1\r\nif(low>up):\r\n print(s.lower())\r\nelif(up>low):\r\n print(s.upper())\r\nelif(up==low):\r\n print(s.lower())", "string = list(input())\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor item in string:\r\n if item.islower():\r\n count_lower += 1\r\n else:\r\n count_upper += 1\r\n\r\nif count_lower >= count_upper:\r\n for i in range(len(string)):\r\n string[i] = string[i].lower()\r\nelse:\r\n for i in range(len(string)):\r\n string[i] = string[i].upper()\r\n\r\nprint(\"\".join(string))", "s=input()\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if(s[i]>='A' and s[i]<='Z'):\r\n u+=1\r\n else:\r\n l+=1\r\nif(u<=l):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\n\r\nlowers = uppers = 0\r\n\r\nfor char in word:\r\n if char.islower():\r\n lowers += 1\r\n else:\r\n uppers += 1\r\n\r\nif lowers < uppers:\r\n word = word.upper()\r\n print(word)\r\nelse:\r\n word = word.lower()\r\n print(word)", "s = input()\n\ncountu = 0\ncountl = 0\nfor i in range(len(s)):\n if s[i].isupper():\n countu+=1\n else:\n countl+=1\n\n\n\nif countu > countl:\n print(s.upper())\nelse:\n print(s.lower())\n\n", "s=input()\ncount1=0\ncount2=0\nfor i in s:\n if i.islower():\n count1+=1\n else:\n count2+=1\nif count1>=count2:\n print(s.lower())\nelse: \n print(s.upper())\n", "x=input()\r\nmin,may=0,0\r\nfor i in x:\r\n if i.islower():\r\n min+=1\r\n else:\r\n may+=1\r\nif min>may: print(x.lower())\r\nelif may>min: print(x.upper())\r\nelse: print(x.lower())", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(0,n):\r\n if s[i].isupper():\r\n c+=1\r\nif c>n/2:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "a=input()\r\nc=0\r\nfor i in a:\r\n if i.islower():\r\n c+=1\r\nb=len(a)-c \r\nif c<b:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word = input()\r\n \r\ncl = 0\r\ncu = 0\r\n \r\nfor i in word:\r\n if i.isupper():\r\n cu += 1\r\n else:\r\n cl += 1\r\nif cu > cl:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n \r\nprint(word)", "s=input()\r\nl=0\r\nu=0\r\nfor i in s:\r\n\tif i.islower():\r\n\t\tl=l+1\r\n\telse:\r\n\t\tu=u+1\r\nh=\"\"\r\nif l>=u:\r\n\tfor i in s:\r\n\t\td=i.lower()\r\n\t\th=h+d\r\nelif u>l:\r\n\tfor i in s:\r\n\t\td=i.upper()\r\n\t\th=h+d\r\nprint(h)\r\n\r\n\t", "s=input()\r\nc=0\r\nl=0\r\nfor i in range(len(s)):\r\n if(ord(s[i])>64 and ord(s[i])<91):\r\n c+=1\r\n else:\r\n l+=1\r\nif(l>=c):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "string = input()\r\nuppercase_letters = list(\"abcdefghijklmnopqrstuvwxyz\".upper())\r\nlowercase_letters = list(\"abcdefghijklmnopqrstuvwxyz\")\r\nlowercase = 0\r\nuppercase = 0\r\nfor s in string:\r\n if s in lowercase_letters:\r\n lowercase += 1\r\n elif s in uppercase_letters:\r\n uppercase += 1\r\n\r\nif uppercase > lowercase:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "str=input()\r\n\r\nc1=0\r\nc2=0\r\nfor i in str:\r\n if(i.islower()):\r\n c1=c1+1\r\n elif(i.isupper()):\r\n c2=c2+1\r\nif(c1>c2):\r\n print(str.lower())\r\nelif(c1==c2):\r\n print(str.lower())\r\nelse:\r\n print(str.upper())\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 7 10:06:51 2019\r\n\r\n@author: Administrator\r\n\"\"\"\r\n\r\na = input()\r\nnum = 0\r\nfor s in a:\r\n if s.isupper():\r\n num += 1\r\nprint(a.lower() if num <= len(a)/2 else a.upper())", "x=input()\nupper=0\nfor i in x:\n if i.isupper():\n upper=upper+1\nlower=len(x)-upper\nif upper>lower:\n print(x.upper())\nelse:\n print(x.lower())\n", "a = input()\r\nthuong = 0\r\nhoa = 0\r\nfor i in a:\r\n if \"a\" <= i <= \"z\":\r\n thuong += 1\r\n else:\r\n hoa += 1\r\nif thuong >= hoa:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "import string \r\nw=str(input())\r\ns=string.ascii_uppercase\r\nc=0\r\nd=len(w)\r\nfor e in w:\r\n if e in s:\r\n c+=1\r\nif c> d/2:\r\n w= w.upper()\r\n print(w)\r\nelse:\r\n w=w.lower()\r\n print(w)", "x = input()\r\ncntlow=0\r\ncnthgh=0\r\n\r\nfor i in x:\r\n if i.islower():\r\n cntlow+=1\r\n else:\r\n cnthgh+=1\r\n\r\nif cntlow==cnthgh:\r\n print(x.lower())\r\nelif cntlow>cnthgh:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "# word\r\ns = input()\r\nc1,c2 = 0,0\r\nfor i in s:\r\n if i.islower():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nprint(s.upper() if c2 > c1 else s.lower())", "import string\r\ns = input()\r\nw = 0\r\nq = 0\r\nfor i in s:\r\n if i in string.ascii_lowercase:\r\n w+=1\r\n else:q+=1\r\nif w>=q:print(s.lower())\r\nelse:print(s.upper())", "s = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in s:\r\n if i.isupper():\r\n upper_count +=1\r\n elif i.islower():\r\n lower_count +=1\r\n\r\nif lower_count >= upper_count:\r\n print(s.lower())\r\nelif upper_count>lower_count:\r\n print(s.upper())\r\n", "a = input('')\r\nb = 0\r\nc = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n b = b + 1\r\n else:\r\n c = c + 1\r\nif b > c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nbig = 0\r\nsmall = 0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n small += 1\r\n else:\r\n big += 1\r\nif big > small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nl=len(s)\r\na=0\r\nfor i in s:\r\n if i >='A' and i<='Z':\r\n a=a+1\r\nif a>(l/2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nc=0\r\nn=len(s)\r\nfor i in s:\r\n if i.isupper():\r\n c=c+1\r\nif c>n/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nj=0\r\no=0\r\nfor i in s:\r\n if i.isupper():\r\n o+=1\r\n else:\r\n j+=1\r\nif o>j:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "x = input()\r\n\r\nupper_counter = 0\r\nlower_counter = 0\r\nfor i in x:\r\n if i.isupper():\r\n upper_counter += 1\r\n elif i.islower():\r\n lower_counter += 1\r\n else:\r\n pass\r\n\r\nif upper_counter > lower_counter:\r\n print(x.upper())\r\nelif lower_counter > upper_counter:\r\n print(x.lower())\r\nelse:\r\n print(x.lower())", "x=input().strip()\r\nxsmall=0\r\nxcapital=0\r\nfor i in range(len(x)):\r\n if ord(x[i]) >= 97 :\r\n xsmall+=1\r\n else:\r\n xcapital+=1\r\ny=\"\"\r\nif xcapital > xsmall:\r\n y=x.upper()\r\nelse:\r\n y=x.lower()\r\nprint(y)", "a='qwertyuiopasdfghjklzxcvbnm'\r\nb='QWERTYUIOPASDFGHJKLZXCVBNM'\r\nc=input()\r\nd=0\r\ne=0\r\nfor i in c:\r\n if a.count(i)==1:\r\n d=d+1\r\n if b.count(i)==1:\r\n e=e+1\r\nif e>d:\r\n print(c.upper())\r\nelse:\r\n print(c.lower())\r\n\r\n", "s=str(input())\r\nupc=0\r\nfor i in s:\r\n if i.isupper():\r\n upc+=1\r\nlwc=len(s)-upc\r\nif upc>lwc:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "a=input()\r\nar=list(a)\r\nsuml=0\r\nsumu=0\r\nfor i in ar:\r\n if i.islower():\r\n suml+=1\r\n elif i.isupper():\r\n sumu+=1\r\nif suml >= sumu:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "palavra = input()\nmaiusculo = 0\nminusculo = 0\nfor i in palavra:\n if i.isupper():\n maiusculo += 1\n else:\n minusculo += 1\npalavra.split()\nif maiusculo > minusculo:\n print(palavra.upper())\nelse:\n print(palavra.lower())\n\n\n\n", "s = input()\r\nn = sum(1 for c in list(s) if c in 'abcdefghijklmnopqrstuvwxyz')\r\nprint(s.lower() if 2 * n >= len(s) else s.upper())", "t=str(input())\r\nc=0\r\ns=0\r\nfor i in t:\r\n if i>='A' and i<='Z':\r\n c+=1\r\n elif i>='a' and i<='z':\r\n s+=1\r\nif c>s:\r\n t=t.upper()\r\nelif s>=c:\r\n t=t.lower()\r\nprint(t)", "count1=0\r\ncount2=0\r\nstr=input(\"\")\r\nfor i in str:\r\n if i>='a' and i<='z' :\r\n count1+=1\r\n else :\r\n count2+=1\r\nif count1<count2 :\r\n print(str.upper())\r\nelse :\r\n print(str.lower())", "s = input()\r\nbig = 0\r\nsmall = 0\r\nfor i in s:\r\n if 'A' <= i <= 'Z':\r\n big += 1\r\n elif 'a' <= i <= 'z':\r\n small += 1\r\nif big > small:\r\n print(s.upper())\r\nelif big < small:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "##### A. Word\r\n\r\ns=input()\r\ncap=0\r\nfor i in s:\r\n if ord(i) < 97:\r\n cap+=1\r\nsmall=len(s)-cap\r\nif small >= cap:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "a = input()\r\nif sum(1 for c in a if c.isupper()) > sum(1 for c in a if c.islower()):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "word = str(input())\r\n\r\nU = 0\r\n\r\nL = 0\r\n\r\nfor i in (word):\r\n if i.isupper():\r\n U = U + 1\r\n if i.islower():\r\n L = L + 1\r\n\r\nif U > L:\r\n ans = word.upper()\r\nelif U < L:\r\n ans = word.lower()\r\nelif U == L:\r\n ans = word.lower()\r\n\r\nprint(ans)\r\n", "def main():\r\n s = input()\r\n l, u = 0, 0\r\n for c in s:\r\n if c.islower():\r\n l += 1\r\n else:\r\n u += 1\r\n if l < u:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\n\r\ncont_maiu = 0\r\ncont_minu = 0\r\n\r\nfor l in s:\r\n if l.isupper():\r\n cont_maiu += 1\r\n else:\r\n cont_minu += 1\r\n\r\nif cont_maiu > cont_minu:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\nh=0\nt=0\nfor i in range(len(s)):\n if \"A\"<=s[i]<=\"Z\":\n h+=1\n else:\n t+=1\nif h>t:\n s=s.upper()\nelif t>h:\n s=s.lower()\nelse:\n s=s.lower()\nprint(s)\n", "n=input()\r\nc=0\r\nc1=0\r\nfor i in n:\r\n if(i.islower()):\r\n c=c+1\r\n elif(i.isupper()):\r\n c1=c1+1\r\nif(c>c1):\r\n print(n.lower())\r\nif(c<c1):\r\n print(n.upper())\r\nif(c==c1):\r\n print(n.lower())\r\n", "a=input()\ncountup=countlw=0\nfor walkA in range (0,len(a)):\n letter=a[walkA]\n if(letter.isupper()):\n countup+=1\n if(letter.islower()):\n countlw+=1\nif(countlw>=countup):\n print(a.lower())\nelse:\n print(a.upper())", "word = input()\r\n\r\nlowerCount = 0\r\nupperCount = 0\r\n\r\nfor c in word:\r\n if c.islower():\r\n lowerCount += 1\r\n else:\r\n upperCount += 1\r\n\r\nprint(word.upper() if upperCount > lowerCount else word.lower())", "s=input()\r\nupper=0\r\nlower=0\r\nn=len(s)\r\nfor i in s:\r\n if i.isupper():\r\n upper=upper+1\r\n if i.islower():\r\n lower=lower+1\r\nif upper>lower:\r\n print(s.upper())\r\nelif upper<lower:\r\n print(s.lower())\r\nelse:\r\n print(s.lower()) \r\n\r\n", "a=input()\r\nuc=0\r\nlc=0\r\n\r\nfor i in a:\r\n if i.isupper():\r\n uc+=1\r\n else:\r\n lc+=1\r\nif(uc>lc):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\r\nsl=0;su=0\r\nfor i in s:\r\n if i.islower():sl+=1\r\n if i .isupper():su+=1\r\nif sl > su:print(s.lower())\r\nif sl == su:print(s.lower())\r\nif sl < su:print(s.upper())\r\n", "s = str(input())\r\nl=0\r\nm=0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].lower():\r\n l+=1\r\n else:\r\n m+=1\r\nif m>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\nn=str(n)\r\nf=0\r\ng=0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n f += 1\r\n else:\r\n g += 1\r\nif f <= g:\r\n l = n.lower()\r\nelse:\r\n l = n.upper()\r\nprint(l)", "n=input()\r\nc=0\r\ns=0\r\nfor i in n:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n s+=1\r\nif s>=c:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n \r\n ", "a = input()\r\ncountL = 0\r\ncountU = 0\r\nfor i in a:\r\n b = i.lower()\r\n c = i.upper()\r\n if i == b:\r\n countL += 1\r\n else:\r\n countU += 1\r\nif countL > countU:\r\n print(a.lower())\r\nelif countL < countU:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "text = input()\n\nn = len(text)\n \ncount = 0\n \nfor c in text:\n if c >= \"A\" and c <= \"Z\":\n count += 1\n \nif count > (n/2):\n print(text.upper())\nelse:\n print(text.lower())\n", "word = input()\r\nu=[]\r\nl = []\r\nfor x in word :\r\n if x.isupper():\r\n u.append(x)\r\n else :\r\n l.append(x)\r\n# print(c)\r\nif len(u) > len(l) :\r\n print(word.upper())\r\n \r\nelse :\r\n print(word.lower())", "s = input()\r\n\r\nupL = 0\r\nloL = 0\r\n\r\n\r\nfor ch in s: \r\n if ch.islower():\r\n loL = loL + 1\r\n if ch.isupper():\r\n upL = upL + 1\r\n\r\nif upL > loL:\r\n print(s.upper())\r\nelif loL > upL:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\nup = 0\r\nlow = 0\r\n\r\nfor l in word:\r\n if 65 <= ord(l) <= 90:\r\n up += 1\r\n elif 97 <= ord(l) <= 122:\r\n low += 1\r\n\r\nif up > low:\r\n print(word.upper())\r\nelif up < low:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())\r\n", "s=input()\r\nk=0\r\nfor i in s:\r\n if i.islower():\r\n k+=1\r\n\r\nif k>=len(s)/2 :\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "\"\"\"Word\"\"\"\r\ntry:\r\n s = input()\r\n count = 0\r\n for ch in s:\r\n if ch.isupper() == True:\r\n count+=1\r\n if len(s) == count and len(s) - count !=0:\r\n print(s.lower())\r\n elif count > len(s) - count:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\nexcept EOFError as identifier:\r\n pass", "Str=input()\r\nlower=0\r\nupper=0\r\nfor i in Str:\r\n\tif(i.islower()):\r\n\t\tlower+=1\r\n\telse:\r\n\t\tupper+=1\r\nif upper>lower:\r\n print(Str.upper())\r\nelif lower>upper:\r\n print(Str.lower())\r\nelse:\r\n print(Str.lower())\r\n", "big = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nsmall = 'qwertyuiopasdfghjklzxcvbnm'\r\n\r\ntext = input()\r\nc = 0\r\nfor w in text:\r\n if w in big:\r\n c += 1\r\n elif w in small:\r\n c -= 1\r\n\r\nif c > 0:\r\n print(text.upper())\r\nelse:\r\n print(text.lower())\r\n", "from re import sub\r\n\r\nword = input()\r\nupper_letters = len(sub(r'[a-z]', '', word))\r\nlower_letters = len(sub((r'[A-Z]'), '', word))\r\n\r\nif lower_letters >= upper_letters:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "w = input()\r\nl = 0\r\nu = 0\r\nfor x in w:\r\n if x==x.upper():\r\n u+=1\r\n else:\r\n l+=1\r\nif l>=u:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n", "a=input()\r\nu=0\r\nv=0\r\nfor l in a:\r\n if l.isupper():\r\n u=u+1\r\n else:\r\n v=v+1\r\nif u>v:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n\r\n", "def fix_word_register(word):\r\n uc=sum(1 for letter in word if letter.isupper())\r\n lc=len(word)-uc\r\n if uc>lc:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\nword=input()\r\nres=fix_word_register(word)\r\nprint(res)", "s = input()\r\nn = len(s)\r\nc = sum([1 for i in s if i.isupper() == True])\r\nif(c > (n-c)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nlc = 0\r\nuc = 0\r\nfor c in s:\r\n lc += c.islower()\r\n uc += c.isupper()\r\nprint(s.lower() if lc >= uc else s.upper())\r\n", "# your code goes here\r\ns=input()\r\nlow=upper=0\r\nfor i in s:\r\n\tif i.islower():\r\n\t\tlow=low+1\r\n\telif i.isupper():\r\n\t\tupper=upper+1\r\nif(low>=upper):\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "str=input()\r\nlo=0\r\nhi=0\r\nfor i in str:\r\n if i.islower():\r\n lo=lo+1\r\n else:\r\n hi=hi+1\r\nif lo>=hi:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "word = input()\r\nres = 0\r\nfor i in word:\r\n res += i.isupper()\r\n\r\nif 2 * res <= len(word):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\nu = sum(1 for i in s if i.isupper())\r\nl = len(s) - u\r\n\r\nif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nl,u = 0,0\r\nfor i in s: \r\n l += 1 if (i>='a'and i<='z') else -1\r\nif l >= 0 :\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nl=0\r\nu=0\r\nfor i in range(len(s)):\r\n if ord(s[i]) in range(65, 91):\r\n u=u+1\r\n if ord(s[i]) in range(97, 123):\r\n l=l+1\r\nif l>=u:\r\n s=s.lower()\r\nelif u>l:\r\n s=s.upper()\r\nprint(s)", "s = input()\r\ncountlower = 0\r\ncountupper = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n countlower+=1\r\n else:\r\n countupper+=1\r\n\r\nif countlower >= countupper:\r\n s = s.lower()\r\nelse: \r\n s = s.upper()\r\nprint(s)\r\n\r\n", "s=input()\r\nc=0\r\nfor i in s:\r\n if i.isupper()==True:\r\n c+=1\r\na=len(s)-c\r\nif(a>=c):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\nnlower = n.lower()\r\nnupper = n.upper()\r\ncountl = 0\r\ncountu = 0\r\nfor i in range(len(n)):\r\n if nlower[i] != n[i]:\r\n countl += 1\r\n if nupper[i] != n[i]:\r\n countu += 1\r\nif countl <= countu:\r\n print(nlower)\r\nelse:\r\n print(nupper)", "a=input()\nk,m=0,0\nfor i in range(len(a)):\n if a[i].isupper():\n k+=1\n else:\n m+=1\nif m>=k:\n print(a.lower())\nelse:\n print(a.upper())\n\t\t\t \t \t\t \t\t\t \t\t \t\t \t\t \t\t\t\t\t", "word = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor w in word:\r\n if w.isupper():\r\n upper +=1\r\n else:\r\n lower+=1\r\n\r\nif upper > lower:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)", "x = input()\r\nnupper = 0\r\nnlower = 0\r\nfor y in x:\r\n if y.isupper():\r\n nupper += 1\r\n elif y.islower():\r\n nlower += 1\r\nif nupper > nlower:\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\nprint(x)", "word=input()\r\nx=y=0\r\nfor i in word:\r\n if i==i.upper():\r\n x+=1\r\n else:\r\n y+=1\r\nif x>y:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n", "word = input()\r\nlow, upp = 0, 0\r\nfor letter in word:\r\n if letter.islower() == True:\r\n low += 1\r\n else:\r\n upp += 1\r\nif low < upp:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "cl = 0\r\ncu = 0\r\ns =input()\r\nfor i in s:\r\n if i.isupper():\r\n cu +=1\r\n else:\r\n cl +=1\r\nif cl >= cu:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "y=input()\nd=0\nfor i in y:\n if i.isupper():\n d+=1\n else:\n d-=1\nif d>0:\n print(y.upper())\nelse:\n print(y.lower())\n \n", "s = str(input())\r\nf1 = s.upper()\r\nf2 = s.lower()\r\na = []\r\nt1 = []\r\nt2 = []\r\nfor i in range(len(s)):\r\n t1.append(f1[i])\r\n t2.append(f2[i])\r\n a.append(s[i])\r\nkol1 = 0\r\nkol2 = 0\r\nfor i in range(len(s)):\r\n if t1[i] == a[i]:\r\n kol1 += 1\r\n elif t2[i] == a[i]:\r\n kol2 += 1\r\nif kol1 > kol2 :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "def correct_word(s):\r\n uppercase_count = sum(1 for char in s if char.isupper())\r\n lowercase_count = len(s) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\ns = input()\r\n\r\nresult = correct_word(s)\r\nprint(result)\r\n", "s,l,u=[c for c in input()],0,0\nfor i in range(len(s)):\n if s[i].isupper():\n u+=1\n else:\n l+=1\nif u==l:\n print(('').join(s).lower())\nelif u>l:\n print(('').join(s).upper())\nelse:\n print(('').join(s).lower())\n", "s = input()\r\nfrom string import ascii_lowercase as l, ascii_uppercase as u\r\na = 0\r\nb = 0\r\nfor i in s:\r\n if i in l: a += 1\r\n else : b += 1\r\nif b > a: print(s.upper())\r\nelse: print(s.lower())", "s=input()\r\ncounter1=0\r\ncounter2=0\r\nfor letter in s:\r\n if letter.islower():\r\n counter1+=1\r\n if letter.isupper():\r\n counter2+=1\r\nif counter1>counter2:\r\n new_s=s.lower()\r\nelif counter1<counter2:\r\n new_s=s.upper()\r\nelse:\r\n new_s=s.lower()\r\nprint(new_s)", "def main(word):\r\n num_upper = 0\r\n num_lower = 0\r\n\r\n for letter in word:\r\n if ord(letter) in range(97, 123):\r\n num_lower += 1\r\n\r\n elif ord(letter) in range(65, 91):\r\n num_upper += 1\r\n\r\n if num_lower >= num_upper:\r\n return word.lower()\r\n\r\n return word.upper()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n word = input().strip()\r\n print(main(word))\r\n", "word=input()\r\n\r\nlowercase=0\r\nuppercase=0\r\n\r\nletters=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q',\r\n 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n\r\nfor i in word:\r\n if i in letters:\r\n lowercase+=1\r\n else:\r\n uppercase+=1\r\n\r\nif lowercase>uppercase:\r\n word=word.lower()\r\nelif uppercase>lowercase:\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\n\r\nprint(word)", "n=input()\r\nc=0\r\nx=0\r\nfor i in n:\r\n if i.isupper():\r\n c=c+1\r\n elif i.islower():\r\n x=x+1\r\nif c>x:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "mixed = input()\n\nno_upper = 0\nno_lower = 0\n\nfor letter in mixed:\n if letter.isupper():\n no_upper +=1\n else:\n no_lower += 1\n\nif no_upper > no_lower:\n print(mixed.upper())\nelse:\n print(mixed.lower())\n", "w=str(input())\r\nnum=0\r\nfor i in range(len(w)):\r\n if w[i].lower()==w[i]:\r\n num+=1\r\nif num>=len(w)/2:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n \r\n", "word = input()\r\ncnt = 0\r\ncnt1 = 0\r\nfor i in word:\r\n if i.isupper():\r\n cnt+=1\r\n else:\r\n cnt1+=1\r\nif cnt > cnt1:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "import sys\n\nstr1 = input()\nstr2 = str1.lower()\n\nn = 0\n\nfor i in range(len(str1)):\n if str1[i] != str2[i]:\n n += 1\n\nif n > (len(str1) - n):\n print(str1.upper())\nelse:\n print(str1.lower())\n", "x=input()\r\nx1=[]\r\nx1+=x\r\nkolb=0\r\nkolm=0\r\nfor i in x1:\r\n if i==i.upper():\r\n kolb+=1\r\n if i==i.lower():\r\n kolm+=1\r\nif kolb>kolm:\r\n print(x.upper())\r\nelif kolb==kolm:\r\n print(x.lower())\r\nelse:\r\n print(x.lower())", "str = input()\r\nupper = 0\r\nlower = 0\r\n \r\nfor i in str:\r\n if i == i.upper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n \r\nif upper > lower:\r\n print(str.upper())\r\nif upper < lower or upper == lower:\r\n print(str.lower())", "a=input()\r\nhn = 0;ln = 0\r\nfor i in a:\r\n if i>'[':\r\n hn+=1\r\n else:\r\n ln+=1\r\nif ln>hn:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s = input()\nk = 0\nfor i in s:\n k += int(i.islower())\nif k >= len(s)-k:\n print(s.lower())\nelse:\n print(s.upper())\n\n", "word = input()\r\nnum_uprcase = 0\r\nnum_lwrcase = 0\r\nfor c in word:\r\n if c.isupper():\r\n num_uprcase += 1\r\n elif c.islower():\r\n num_lwrcase += 1\r\nif num_uprcase > num_lwrcase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nfinal =''\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in s:\r\n if i.isupper():\r\n count1 += 1\r\n if i.islower():\r\n count2 += 1\r\nif count1 > count2:\r\n final += s.upper()\r\nelse:\r\n final += s.lower()\r\nprint (final)", "def solve():\r\n s = list(input().strip())\r\n if sum([i.isupper() for i in s]) > len(s)//2:\r\n print(''.join(s).upper())\r\n else:\r\n print(''.join(s).lower())\r\n\r\nsolve()\r\n", "def countLowerUpper(string):\n countLower = 0\n countUpper = 0\n\n for ch in string:\n if ch.islower():\n countLower += 1\n else:\n countUpper += 1\n return countUpper > countLower\n\n\nstring = input()\n\nif countLowerUpper(string):\n print(string.upper())\nelse:\n print(string.lower())\n\n", "s = input()\r\nsupper=0\r\nslower=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n supper += 1\r\n else:\r\n slower += 1\r\nif(supper > slower):\r\n print(s.upper()) \r\nelse:\r\n print(s.lower())\r\n", "# <--------- Made by torretoX_x ------------>\r\n\r\nn = input()\r\nc = 0\r\nfor i in list(n):\r\n if i.isupper():\r\n c += 1\r\nif c > len(n)/2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n\r\n# <------------------------------------------>", "s=input()\r\nc=0\r\nl=len(s)\r\nfor i in s:\r\n if(i.isupper()):\r\n c=c+1\r\nif(c>(l/2)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "x, count1, count2 = input(), 0, 0\r\nfor i in x:\r\n if i.isupper():\r\n count1 += 1\r\n else:\r\n count2 += 1\r\nprint(x.upper() if count1 > count2 else x.lower())\r\n", "a=input()\r\nb=list(a)\r\nupper=''\r\nlower=''\r\nfor i in range(len(a)):\r\n if b[i].isupper() == True:\r\n upper+=a[i]\r\n else:\r\n lower+=a[i]\r\nif len(upper)>len(lower):\r\n a=a.upper()\r\nelse:\r\n a=a.lower()\r\nprint(a)", "LOWER_LETTER_A = 'a'\r\nLOWER_LETTER_Z = 'z'\r\nUPPER_LETTER_A = 'A'\r\nUPPER_LETTER_Z = 'Z'\r\n\r\n\r\ndef solve():\r\n string = list(input())\r\n upper_letter = [0] * 26\r\n lower_letter = [0] * 26\r\n for i in range(len(string)):\r\n if UPPER_LETTER_A <= string[i] <= UPPER_LETTER_Z:\r\n upper_letter[ord(string[i]) - ord(UPPER_LETTER_A)] += 1\r\n else:\r\n lower_letter[ord(string[i]) - ord(LOWER_LETTER_A)] += 1\r\n if sum(upper_letter) > sum(lower_letter):\r\n print(\"\".join(string).upper())\r\n else:\r\n print(\"\".join(string).lower())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "alf1 = 'abcdefghijklmnopqrstuvwxyz'\nalf2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nc1, c2 = 0, 0\ns = list(input())\nfor i in range(len(s)):\n if s[i] in alf1:\n c1 += 1 \n else:\n c2 += 1\n \nif(c1 >= c2):\n print(\"\".join(s).lower())\nelse:\n print(\"\".join(s).upper())", "s = input()\r\nn = len(s)\r\nu = 0\r\nl = 0\r\nfor i in range(n):\r\n if s[i].isupper():\r\n u = u + 1\r\n else:\r\n l = l + 1\r\nif u > l:\r\n print(s.upper())\r\nelif u < l or u == l:\r\n print(s.lower())\r\n ", "s=input()\r\nl=len(s)\r\ncounter=0#counter for upper\r\nfor i in s:\r\n if (i>='A' and i<='Z'):\r\n counter+=1\r\nif counter>(l/2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\n\r\nbig = sum([1 for x in s if x >= 'A' and x <= 'Z'])\r\nsmall = sum([1 for x in s if x >= 'a' and x <= 'z'])\r\n\r\nif big > small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import string\r\n\r\nx = input()\r\nupper_count = 0\r\nlower_count = 0\r\n\r\nfor i in x:\r\n if i in string.ascii_lowercase:\r\n lower_count += 1\r\n else:\r\n upper_count += 1\r\n\r\nprint(x.upper() if upper_count > lower_count else x.lower())\r\n", "s = input()\r\nk = 0\r\nd = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n k += 1\r\n if s[i].islower():\r\n d += 1\r\nif k > d:\r\n u = s.upper()\r\n print(u)\r\nelif k < d:\r\n o = s.lower()\r\n print(o)\r\nelse:\r\n y = s.lower()\r\n print(y)\r\n", "def solition():\r\n s = input()\r\n low = 0\r\n \r\n for i in s:\r\n if i.islower():\r\n low += 1\r\n else:\r\n low -= 1\r\n \r\n if low >= 0:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n \r\n\r\nif __name__ == '__main__':\r\n solition()", "a = input()\r\nupper = 0\r\nlower = 0\r\nfor c in a:\r\n if c.isupper():\r\n upper += 1 \r\n if c.islower():\r\n lower += 1 \r\nif lower >= upper:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "string = str(input())\r\ncountup = sum(1 for char in string if char.isupper())\r\ncountlow = sum(1 for char in string if char.islower())\r\nif countup>countlow:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s= input()\r\nl= 0\r\nu= 0\r\nfor char in s:\r\n if char.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u> l:\r\n s = s.upper()\r\nelse:\r\n s =s.lower()\r\nprint(s)", "s = input()\r\na=0\r\nb=0\r\nfor i in s:\r\n if i.isupper()==True:\r\n a=a+1\r\n elif i.islower()==True:\r\n b=b+1\r\nif b>=a:\r\n r=s.lower()\r\nelse:\r\n r=s.upper()\r\nprint(r)", "c=0\r\nd=0\r\na=input()\r\nfor i in a:\r\n if i==i.upper():\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\n\r\nlow = 0\r\nup = 0\r\n\r\nfor i in range(len(s)):\r\n if ord(s[i]) >= 97:\r\n low += 1\r\n else:\r\n up += 1\r\n\r\nif low >= up:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Aug 30 15:01:37 2020\n\n@author: anirudhasarmatumuluri\n\"\"\"\ndef main():\n word = input()\n lower = 0\n upper = 0\n \n for letter in word:\n if letter == letter.lower():\n lower+=1\n else:\n upper+=1\n if lower>=upper:\n print(word.lower())\n else:\n print(word.upper())\n\n\n\nmain()", "s = input()\r\n\r\nu = 0\r\nl = 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].upper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "st = input()\r\nlc = 0\r\nuc = 0\r\n\r\nfor i in st:\r\n if i.isupper()==True:\r\n uc += 1\r\n elif i.islower() == True:\r\n lc += 1\r\n\r\nif lc>=uc:\r\n print(st.lower())\r\nelse:\r\n print(st.upper())", "s = input()\r\nlow = 0\r\nup = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n low += 1\r\n elif i.isupper():\r\n up += 1\r\n\r\nif low >= up:\r\n print(s.lower())\r\nelif up > low:\r\n print(s.upper())", "a = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')\nb = list('abcdefghijklmnopqrstuvwxyz')\ncap = 0\nsmall = 0\n\ns = input()\n\nfor i in s:\n if i in a:\n cap += 1\n else: \n small += 1\n\nif cap > small:\n s = s.upper()\nelif small > cap or cap == small:\n s = s.lower()\n\nprint(s)", "word=input()\r\nlow =0\r\ncap =0\r\nfor i in word:\r\n if i.islower():\r\n low+=1\r\n else:\r\n cap+=1\r\nif low >= cap :\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n ", "word = input()\n\n# Contar el número de letras en mayúscula y minúscula\nupper_count = sum(1 for letter in word if letter.isupper())\nlower_count = len(word) - upper_count\n\n# Convertir todas las letras a minúsculas si hay más letras en minúscula o a mayúsculas en caso contrario\nif upper_count > lower_count:\n corrected_word = word.upper()\nelse:\n corrected_word = word.lower()\n\nprint(corrected_word)\n \t \t \t\t\t\t \t \t\t \t \t\t \t\t \t \t", "b = 0\r\nm = 0\r\nn = input()\r\nfor i in n:\r\n if i.upper() == i:\r\n b+=1\r\n else:\r\n m+=1\r\nif b>m:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "import string\nz=list(string.ascii_lowercase)\na=input()\ncount1=0\ncount2=0\nfor x in a:\n if x in z:\n count1+=1\n else:\n count2+=1\nif count1>=count2:\n newa=a.lower()\n print(newa)\nelse:\n newa=a.upper()\n print(newa)", "s = input()\r\n\r\ncount_u = 0\r\ncount_l = 0\r\nfor i in s:\r\n if (i.isupper()):\r\n count_u += 1\r\n else :\r\n count_l +=1\r\nif count_u > count_l :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "st = input()\r\nsmall = 0\r\ncaptial = 0\r\nfor i in range(0, len(st)):\r\n if ord(st[i]) > 64 and ord(st[i])< 91:captial += 1\r\n if ord(st[i]) > 96 and ord(st[i])< 123:small += 1\r\nif len(st) == 1:\r\n if ord(st[i]) > 64 and ord(st[i]) < 91:\r\n print(st.upper())\r\n if ord(st[i]) > 96 and ord(st[i]) < 123: print(st.lower())\r\nelif small>=captial:print(st.lower())\r\nelse:print(st.upper())\r\n", "\ns = str(input())\n\nlower_count = sum(map(str.islower, s))\nupper_count = sum(map(str.isupper, s))\n\nif lower_count > upper_count:\n print(s.lower())\n\nelif upper_count > lower_count:\n print(s.upper())\n\nelse:\n print(s.lower())", "a=input()\r\nu=0\r\nl=0\r\nfor i in range(0,len(a)):\r\n\tif(a[i]==a[i].upper()):\r\n\t\tu=u+1\r\n\tif(a[i]==a[i].lower()):\r\n\t\tl+=1\r\nif(u<=l):\r\n\tprint(a.lower())\r\nelse:\r\n\tprint(a.upper())\r\n", "from sys import stdin,stdout\r\nfrom math import ceil\r\nfrom collections import deque\r\ninp = stdin.readline\r\nout = stdout.write\r\n\r\ns=inp().strip()\r\nup = sum(1 for c in s if c.isupper())\r\nlo = sum(1 for c in s if c.islower())\r\nif up<=lo:\r\n\ts=s.lower()\r\nelse:\r\n\ts=s.upper()\r\nout(s)", "a=input()\r\nup=0\r\nlow=0\r\ns=''\r\nfor i in range(len(a)):\r\n if a[i].isupper()==1:\r\n up+=1\r\n else :\r\n low+=1\r\nif up>low:\r\n s=a.upper()\r\nelif low>up:\r\n s=a.lower()\r\nelif up==low:\r\n s=a.lower()\r\nprint(s)\r\n", "word = input()\r\nlower = 0\r\nupper = 0\r\nfor ch in word:\r\n if ch.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif lower < upper:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "import math\r\nstr1=input()\r\ncount=0\r\nfor i in str1:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n count+=1\r\nif(count>=math.ceil((len(str1)/2))):\r\n print(str1.lower())\r\nelse:\r\n print(str1.upper())\r\n \r\n", "# Ammirhossein Alimirzaei\r\n# Eail: [email protected]\r\n# Instagram : Amirhossein_Alimirzaei\r\n# Telegram : @HajLorenzo\r\n\r\nN=input()\r\nWTF=0\r\nfor _ in range(len(N)):\r\n if N[_].isupper():\r\n WTF+=1\r\n else:\r\n WTF-=1\r\nprint(N.upper() if WTF>0 else N.lower())", "word = input().strip()\r\n\r\nuppercase=0\r\nlowercase=0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n uppercase += 1\r\n \r\n else:\r\n lowercase += 1\r\n \r\n\r\nif uppercase > lowercase:\r\n correct= word.upper()\r\n \r\nelse:\r\n correct = word.lower()\r\n\r\nprint(correct) \r\n", "count = 0\r\na = input()\r\nfor i in range(len(a)):\r\n if ord(a[i]) < 92:\r\n count += 1\r\nif count > len(a)//2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "a = str(input())\r\ns = 0\r\nc = 0 \r\nfor _ in a:\r\n if _ >= 'A' and _ <= 'Z':\r\n s += 1\r\n else:\r\n c += 1\r\n\r\nif s > c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n ", "def correct_word(s):\r\n upper_count = sum(1 for c in s if c.isupper())\r\n lower_count = len(s) - upper_count\r\n\r\n if upper_count > lower_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\ndef main():\r\n s = input()\r\n result = correct_word(s)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import re\r\n\r\nstring = input()\r\nupper = len(re.findall(r'[A-Z]', string))\r\nlower = len(re.findall(r'[a-z]', string))\r\n\r\nif lower >= upper :\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "s = input()\r\ndef word(s):\r\n u_count = 0\r\n l_count = 0\r\n for i in s:\r\n if i.islower():\r\n l_count += 1\r\n else :\r\n u_count += 1\r\n if u_count > l_count:\r\n print (s.upper())\r\n else:\r\n print(s.lower())\r\nword(s)", "s = input()\na = [ 1 for ch in s if ch.isupper()]\nif len(s) - len(a) < len(a):\n print(s.upper())\nelse:\n print(s.lower())\n \t \t\t \t \t \t\t\t\t\t \t\t\t", "palabra=input()\npalabram=palabra.lower()\npalabraM=palabra.upper()\nminus=0\nmayus=0\nfor i in range (len(palabra)):\n if palabra[i]==palabram[i]:\n minus+=1\n else:\n mayus+=1\nif mayus>minus:\n print(palabraM)\nelse:\n print(palabram)\n\t \t \t\t \t\t\t \t\t \t\t \t\t\t\t", "import sys\r\na=input()\r\nu,l=0,0\r\nfor i in a:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nsys.stdout.write((a.upper() if u>l else a.lower())+'\\n')\r\n", "s = input()\r\nl = 0\r\nu = 0\r\nfor ch in s:\r\n if(ch.islower()):\r\n l += 1\r\n elif(ch.isupper()):\r\n u += 1\r\nif(l >= u ):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def prog():\r\n a = input()\r\n mas = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n',\r\n 'o','p','q','r','s','t','u','v','w','x','y','z']\r\n mas2 = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N',\r\n 'O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\n k,k1 = 0,0\r\n for i,x in enumerate(a):\r\n if x in mas:\r\n k+=1\r\n else:\r\n k1+=1\r\n rezalt = ''\r\n if k>=k1:\r\n for i,x in enumerate(a):\r\n i = a[i]\r\n if x in mas2:\r\n i = mas[mas2.index(x)]\r\n rezalt = '%s%s'%(rezalt,i)\r\n else:\r\n for i,x in enumerate(a):\r\n i = a[i]\r\n if x in mas:\r\n i = mas2[mas.index(x)]\r\n rezalt = '%s%s'%(rezalt,i)\r\n print(rezalt)\r\nprog()\r\n", "s = input()\r\n\r\ns1 = s.upper()\r\ns2 = s.lower()\r\n\r\nn1,n2 = 0,0\r\n\r\nfor i in range(len(s)):\r\n if s[i] != s1[i]:\r\n n1 += 1\r\n if s[i] != s2[i]:\r\n n2 += 1\r\n \r\nif n2 <= n1:\r\n print(s2)\r\nelse:\r\n print(s1)", "s = input()\r\n\r\nnum_ki = 0\r\nnum_ka = 0\r\n\r\nfor i in s:\r\n if i.lower() == i:\r\n num_ki += 1\r\n else:\r\n num_ka += 1\r\n\r\nif num_ki>=num_ka:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "st = str(input())\r\narr = [i for i in st if i.isupper()]\r\nprint(st.upper()) if len(arr)*2 > len(st) else print(st.lower())\r\n", "x=input()\r\ni=0\r\nl=0\r\nu=0\r\nwhile i<len(x):\r\n if x[i].islower():\r\n l+=1\r\n else:\r\n u+=1\r\n i+=1\r\nif u>l:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "word = input()\r\nc,l = 0,0\r\nfor i in range(len(word)):\r\n if word[i].islower(): l += 1\r\n if word[i].isupper(): c += 1\r\nprint(word.upper()) if c>l else print(word.lower())", "word = str(input())\r\n\r\nlength = len(word)\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in range(0,length):\r\n letter= word[i]\r\n if letter.isupper() == True:\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper > lower:\r\n new_word = word.upper()\r\nelse:\r\n new_word = word.lower()\r\n\r\nprint(new_word)\r\n \r\n", "a = input()\r\nl,u = 0,0\r\n\r\nfor i in a:\r\n if i.isupper():u+=1\r\n else: l+=1\r\nif l == u or l>u:print(a.lower())\r\nelif l<u:print(a.upper())", "s = input()\r\nlowercauses = 0\r\nuppercases = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n lowercauses += 1\r\n else:\r\n uppercases += 1\r\nif lowercauses >= uppercases:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "\n# Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.\n# Input\n\n# The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.\n# Output\n\n# Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.\n\nif __name__ == '__main__':\n word = input()\n lowercase = len([c for c in word if c.islower()])\n uppercase = len([c for c in word if c.isupper()])\n if lowercase >= uppercase:\n print(word.lower())\n else:\n print(word.upper())\n", "def value(xl):\r\n if xl=='a' or xl=='b' or xl=='c' or xl=='d' or xl=='e' or xl=='f' or xl=='g' or xl=='h' or xl=='i' or xl=='j' or xl=='k' or xl=='l' or xl=='m' or xl=='n' or xl=='o' or xl=='p' or xl=='q' or xl=='r' or xl=='s' or xl=='t' or xl=='u' or xl=='v' or xl=='w' or xl=='x' or xl=='y' or xl=='z':\r\n return 1\r\n return 0\r\nai=input()\r\nle=len(ai)\r\nvv=0\r\nfor xx in ai:\r\n vv+=value(xx)\r\nif vv>le/2:\r\n print(ai.lower())\r\nelif vv==le/2:\r\n print(ai.lower())\r\nelse:\r\n print(ai.upper())", "s=input()\r\nlower_case_count=0\r\nupper_case_count=0 \r\n\r\nfor i in s:\r\n if i.isupper():\r\n upper_case_count+=1\r\n else:\r\n lower_case_count+=1\r\n\r\nif upper_case_count>lower_case_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "l=input()\r\nn=list(l)\r\nif 2*sum(i.islower() for i in n)>=len(n):\r\n print(l.lower())\r\nelse:\r\n print(l.upper())", "s = input()\r\nu = 0\r\nd = 0\r\nfor a in s:\r\n if a.isupper():\r\n u = u + 1\r\n else:\r\n d = d + 1\r\nif u > d:\r\n s = s.upper()\r\nelif d >= u:\r\n s = s.lower()\r\nprint (s)\r\n", "n = input()\nm = 0\nfor x in n:\n m = m + int(x.isupper())\nif m <= len(n)/2:\n print(n.lower())\nelse:\n print(n.upper())", "import string\r\ns=input()\r\nl=len(s)\r\nk=list(s)\r\nc1=0\r\nc2=0\r\nif(1<=l<=100):\r\n for i in range(l):\r\n if(k[i] in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"):\r\n c1+=1\r\n elif(k[i] in \"abcdefghijklmnopqrstuvwxyz\"):\r\n c2+=1\r\n\r\nif c1>c2:\r\n print(s.upper())\r\nelif c2>c1:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "w = input()\r\nlow = 0\r\nup = 0\r\nfor z in w:\r\n\tif z.isupper():\r\n\t\tup+=1\r\n\telse:\r\n\t\tlow+=1\r\nif low == up or low>up:\r\n\tprint(w.lower())\r\nelse:\r\n\tprint(w.upper())\t\t\t\r\n", "a = input()\r\nupper = 0; lower = 0\r\nfor i in a:\r\n if i.isupper() == 1: upper += 1\r\n else: lower += 1\r\nif lower >= upper: print(a.lower())\r\nelse: print(a.upper())", "s = list(input())\ni = list(filter(lambda x: x.isupper(), s))\nprint (\"\".join(s).lower() if len(i) <= len(s) - len(i) else \"\".join(s).upper())\n", "s = input()\r\ncap = 0\r\nfor c in s:\r\n if c.upper() == c:\r\n cap += 1\r\nif cap > len(s)/2.0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nc = 0\r\nl = 0\r\nfor i in s:\r\n if(ord(i) <= 90):\r\n c += 1\r\n else:\r\n l += 1\r\nif(l >= c):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "m = input()\r\na = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nb = a.lower()\r\ncounter1, counter2 = 0, 0\r\nfor i in m:\r\n if i in b:\r\n counter1 += 1\r\n else:\r\n counter2 += 1\r\nif counter1 >= counter2:\r\n print(m.lower())\r\nelse:\r\n print(m.upper())", "s = str(input())\r\nu = 0\r\nl = 0\r\nfor c in s:\r\n\tif c.isupper():\r\n\t\tu+=1\r\n\tif c.islower():\r\n\t\tl+=1\r\n\r\nif u > l:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n\r\n", "inp = input()\r\nx = 0\r\ny = 0\r\nfor i in inp:\r\n A = i\r\n if i.isupper() == True:\r\n y += 1\r\n else:\r\n x += 1\r\nif y > x:\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())", "s = list(input())\r\na, b = [], []\r\nfor i in s:\r\n if i in 'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n a.append(i)\r\n else:\r\n b.append(i) \r\nif len(b) >= len(a):\r\n s = ''.join(s)\r\n print(s.lower())\r\nelse:\r\n s = ''.join(s)\r\n print(s.upper())\r\n\r\n", "s = input()\nk = 0\nfor x in s: \n if(x >= 'A' and x <= 'Z'):\n k += 1\nprint(s.upper() if len(s) - k < (len(s) + 1) // 2 else s.lower())", "s = input()\r\nup = 0\r\nlo = 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].upper():\r\n up += 1\r\n else:\r\n lo += 1\r\nif up > lo:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x=input()\r\nu_ct=0\r\nl_ct=0\r\nfor char in x:\r\n if char.isupper():\r\n u_ct+=1\r\n else:\r\n l_ct+=1\r\n# print(u_ct,l_ct)\r\nif l_ct<u_ct:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "n=input()\r\nu=0\r\nl=0\r\nfor i in n:\r\n if(i=='A' or i=='B' or i=='C' or i=='D' or i=='E' or i=='F' or i=='G'\r\n or i=='H' or i=='I' or i=='J' or i=='K' or i=='L' or i=='M' or\r\n i=='N' or i=='O' or i=='P' or i=='Q' or i=='R' or i=='S' or i=='T'\r\n or i=='U' or i=='V' or i=='W' or i=='X' or i=='Y' or i=='Z'):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n n=n.upper()\r\nelif(l>u):\r\n n=n.lower()\r\nelse:\r\n n=n.lower()\r\nprint(n)\r\n \r\n \r\n\r\n", "str1 = input()\r\n\r\nupperCaseCount, lowerCaseCount = 0, 0\r\n\r\nfor i in str1:\r\n if i.isupper(): upperCaseCount += 1\r\n else: lowerCaseCount += 1\r\n\r\nif upperCaseCount > lowerCaseCount:\r\n str1 = str1.upper()\r\nelse:\r\n str1 = str1.lower()\r\n\r\nprint(str1)\r\n", "w = input()\r\n\r\nu = 0\r\nl = 0\r\n\r\nfor c in w:\r\n if c.lower() == c:\r\n l += 1\r\n else:\r\n u += 1\r\n \r\nif(u > l):\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "s = input()\r\n\r\nuppercount = 0\r\nlowercount = 0\r\nfor i in s:\r\n if i.isupper():\r\n uppercount += 1\r\n else:\r\n lowercount += 1\r\n\r\nif uppercount > lowercount:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)", "word = input()\r\nl = 0\r\ncounter = 0\r\n\r\nfor s in range(len(word)):\r\n if word[s].islower():\r\n l += 1\r\n elif word[s].isupper():\r\n counter += 1\r\n\r\nif l > counter:\r\n for w in range (len(word)):\r\n print(word[w].lower(), end = \"\")\r\nelif l == counter:\r\n for w in range (len(word)):\r\n print(word[w].lower(), end = \"\")\r\nelse:\r\n for w in range (len(word)):\r\n print(word[w].upper(), end = \"\")", "string = list(input().rstrip())\nupr, lwr = 0, 0\nfor x in string:\n if x.islower():\n lwr += 1\n else:\n upr += 1\n\nif upr > lwr:\n print(''.join(string).upper())\nelse:\n print(''.join(string).lower())\n", "s = input();a = 0; b = 0\r\nfor i in s:\r\n if i >= 'a':\r\n a+=1\r\n else:\r\n b+=1\r\nif a<b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "st= str(input())\r\nu=0\r\ns=0\r\n# res = s[0].upper() + s[1:]\r\nfor i in st:\r\n if i.islower():\r\n s+=1\r\n if i.isupper():\r\n u+=1\r\nif u>s:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "x = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in x:\r\n if i == i.upper():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 > c2:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\r\nlow = up = 0\r\n\r\nfor i in s:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif up > low:\r\n for i in s:\r\n if ord(i) >= 97 and ord(i) <= 122:\r\n print(chr(ord(i)-32),end=\"\")\r\n else:\r\n print(i,end=\"\")\r\nelse:\r\n for i in s:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n print(chr(ord(i)+32),end=\"\")\r\n else:\r\n print(i,end=\"\")\r\n", "#Word\r\ns = input()\r\nc,c1 = 0,0\r\nfor i in s:\r\n if i.isupper():\r\n c1+=1\r\n else:\r\n c+=1\r\nif c1>c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nif sum(map(str.isupper, a)) > sum(map(str.islower, a)):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "import string\r\ns=input()\r\nlower=0\r\nupper=0\r\nfor x in s:\r\n if x in string.ascii_lowercase:\r\n lower+=1\r\n else:\r\n upper+=1\r\nif lower>=upper:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\n\r\nprint(s)", "s=input()\r\nu=0 ; l=0\r\nfor x in s:\r\n if 'a'<=x and x<='z': l=l+1\r\n else: u=u+1\r\nif l>=u: print (s.lower())\r\nelse: print(s.upper())", "n=input()\r\nupper=[]\r\nlower=[]\r\nfor i in n:\r\n if i==i.upper():\r\n upper.append(i)\r\n elif i==i.lower():\r\n lower.append(i)\r\nif len(upper)>len(lower):\r\n n=n.upper()\r\nelif len(upper)<len(lower):\r\n n=n.lower()\r\nelse:\r\n n=n.lower()\r\nprint(n)\r\n ", "s=input()\r\ncnt=0\r\nfor i in s:\r\n if 'a'<=i<='z':\r\n cnt+=1\r\nprint(s.lower() if cnt*2>=len(s) else s.upper())", "input = input()\r\n\r\nlowercase=0\r\nuppercase=0\r\n\r\nfor char in input:\r\n if char.islower():\r\n lowercase+=1\r\n elif char.isupper():\r\n uppercase+=1\r\n\r\nif lowercase==uppercase:\r\n print(input.lower()) \r\n\r\n\r\nelif lowercase>uppercase:\r\n print(input.lower())\r\n\r\nelif lowercase<uppercase:\r\n print(input.upper()) \r\n\r\n\r\n \r\n", "string=input()\r\nuppercount=0\r\nlowercount=0\r\nfor i in string:\r\n if i.isupper():\r\n uppercount+=1\r\n else:\r\n lowercount+=1\r\nif uppercount>lowercount:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "word =input()\r\nupper = sum(ch.isupper() for ch in word)\r\nprint(word.upper() if upper > len(word) / 2 else word.lower())", "def main():\r\n s = input()\r\n cnt = 0\r\n for i in range(len(s)):\r\n if ord(s[i]) < 97:\r\n cnt += 1\r\n if cnt > len(s)//2:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n\r\n\r\nmain()\r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\ndef int_array():\n return list(map(int, input().strip().split()))\n\n\ndef str_array():\n return input().strip().split()\n\ndef lower_letters():\n lowercase = [chr(i) for i in range(97, 97+26)]\n return lowercase\n \ndef upper_letters():\n uppercase = [chr(i) for i in range(65, 65+26)]\n return uppercase\n\n######################## TEMPLATE ENDS HERE ########################\n\nlower = lower_letters()\nupper = upper_letters()\nword = input()\nl,u = 0, 0\n\nfor i in word:\n if i in lower:\n l+=1\n elif i in upper:\n u+=1\n\nif l >= u:\n word = list(word)\n for i in range(len(word)):\n if word[i] in upper:\n word[i] = lower[upper.index(word[i])]\nelse:\n word = list(word)\n for i in range(len(word)):\n if word[i] in lower:\n word[i] = upper[lower.index(word[i])]\n\nprint(\"\".join(word))", "def solve():\r\n str = input()\r\n cnt_up = 0\r\n cnt_l = 0\r\n for i in str:\r\n if i.isupper():\r\n cnt_up += 1\r\n else:\r\n cnt_l +=1\r\n if cnt_up <= cnt_l:\r\n print(str.lower())\r\n else:\r\n print(str.upper())\r\n\r\nsolve()", "# Leer la palabra desde la entrada\ns = input()\n\n# Contar el número de letras mayúsculas y minúsculas en la palabra\nuppercase_count = sum(1 for char in s if char.isupper())\nlowercase_count = len(s) - uppercase_count\n\n# Si hay más letras mayúsculas, convertir la palabra a mayúsculas\nif uppercase_count > lowercase_count:\n corrected_word = s.upper()\nelse:\n corrected_word = s.lower()\n\n# Imprimir la palabra corregida\nprint(corrected_word)\n\n \t \t\t\t\t \t \t\t\t \t \t\t\t", "word = input()\r\nli_a = \"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\".split(\", \")\r\nli_A = [a.upper() for a in li_a]\r\n\r\nbig = 0\r\nsmall = 0\r\nfor letter in word:\r\n if letter in li_a:\r\n small += 1\r\n else:\r\n big += 1\r\n\r\nif big > small:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in s:\r\n if(i.islower()):\r\n count1+=1\r\n if(i.isupper()):\r\n count2+=1\r\nif count1 == count2:\r\n print(s.lower())\r\nelif count1 > count2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "x = input()\r\nx_upper,x_lower = 0, 0\r\nfor i in x:\r\n if i.islower():\r\n x_lower += 1\r\n else:\r\n x_upper += 1\r\n\r\nif x_upper > x_lower:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "x=input()\r\ncountc=0; counts=0\r\nfor i in x:\r\n if i>=\"A\" and i<=\"Z\":\r\n countc+=1\r\n else:\r\n counts+=1\r\nif counts>=countc:\r\n print(x.lower())\r\nelse: print(x.upper())\r\n \r\n", "x=input()\r\nn=len(x)\r\nup=0\r\nlow=0\r\nfor i in range(0,n,1):\r\n if ord(x[i])>=65 and ord(x[i])<=90:\r\n up=up+1\r\n else:\r\n low=low+1\r\nif up>low:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "n=input()\r\nb,s=0,0\r\nfor i in n:\r\n if 65<=ord(i)<=90:\r\n b+=1\r\n else:\r\n s+=1 \r\nif b>s:\r\n x=n.upper()\r\n print(x)\r\nelse:\r\n d=n.lower()\r\n print(d)", "import string\r\ns=input()\r\nx=0\r\ny=0\r\nfor e in s:\r\n if e in string.ascii_lowercase:\r\n x+=1\r\n if e in string.ascii_uppercase:\r\n y+=1\r\n\r\nif y>x:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncnt=0\r\nfor i in s:\r\n if i<\"a\":\r\n cnt+=1\r\nif cnt >len(s)/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=str(input())\r\nlowcount=0\r\nfor i in s:\r\n if (i.islower()):\r\n lowcount+=1\r\nhighcount=len(s)-lowcount\r\nif highcount>lowcount:\r\n print(s.upper())\r\nelif highcount<lowcount:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n", "l = input()\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(len(l)):\r\n if 'a' <= l[i] <= 'z':\r\n ans1 += 1\r\n else:\r\n ans2 += 1\r\nif ans1 >= ans2:\r\n print(l.lower())\r\nelse:\r\n print(l.upper())", "word = input()\r\nl_case = 0\r\nu_case = 0\r\nfor i in word:\r\n if i.islower():\r\n l_case += 1\r\n else:\r\n u_case += 1\r\nif l_case < u_case:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\ns_lower = s.lower()\r\ns_upper = s.upper()\r\ndiff1, diff2 = 0, 0\r\nfor i in range(len(s)):\r\n if s[i] != s_lower[i]:\r\n diff1 += 1\r\n if s[i] != s_upper[i]:\r\n diff2 += 1\r\nprint(s_lower if diff1 <= diff2 else s_upper)\r\n", "entrada = input()\r\nmai = 0\r\nfor i in range(len(entrada)):\r\n if entrada[i].isupper():\r\n mai += 1\r\n\r\nif mai > len(entrada)//2:\r\n print(entrada.upper())\r\nif mai <= len(entrada)//2:\r\n print(entrada.lower()) ", "n=input()\r\nlc=0\r\nuc=0\r\nfor i in n:\r\n if i.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\nif lc>=uc:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "if __name__ == \"__main__\":\r\n s = input()\r\n count_up = 0\r\n count_low = 0\r\n\r\n for ch in s:\r\n if ch.isupper():\r\n count_up += 1\r\n else:\r\n count_low += 1\r\n\r\n if count_up > count_low:\r\n for ch in s:\r\n print(ch.upper(), end=\"\")\r\n else:\r\n for ch in s:\r\n print(ch.lower(), end=\"\")\r\n", "s = input()\r\nupper = 0\r\nlower = 0\r\nfor i in s:\r\n if i.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nprint(s.lower() if lower >= upper else s.upper())\r\n", "s=input()\r\nupp=0\r\nlow=0\r\nfor i in (s):\r\n if(65<=ord(i)<=90):\r\n upp+=1\r\n else:\r\n low+=1\r\nif(upp<=low):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "n=input()\r\ns=0\r\nc=0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n s=s+1\r\n if n[i].islower():\r\n c=c+1\r\n\r\nif s==c:\r\n print(n.lower())\r\nelif s>c:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "def solve(a):\n uppers = 0\n lowers = 0\n for i in a:\n if i.isupper():\n uppers += 1\n else:\n lowers += 1\n if uppers > lowers:\n print(a.upper())\n else:\n print(a.lower())\n\n\nuser = input()\n\nsolve(user)\n", "# https://vjudge.net/contest/484114#problem/F\n\n\nclass Ejercicio:\n\n def handle(self, text: str):\n\n upper_letters = list(filter(lambda t: t.isupper(), text))\n lower_letters = list(filter(lambda t: t.islower(), text))\n\n if len(upper_letters) > len(lower_letters):\n result = text.upper()\n else:\n result = text.lower()\n\n return result\n\n\nif __name__ == '__main__':\n text = input()\n use_case = Ejercicio()\n result = use_case.handle(text)\n print(result)\n \t\t\t \t\t\t\t\t \t \t\t \t\t\t\t\t\t \t\t", "n=input()\r\nb=0\r\nc=0\r\nfor i in range(len(n)):\r\n if 'a'<=n[i]<='z':\r\n b+=1\r\n else:\r\n c+=1\r\nif b>=c:\r\n a=n.lower()\r\nelse:\r\n a=n.upper()\r\nprint(a)", "s=input()\r\nup=0\r\nlow=0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].upper():\r\n up+=1\r\n else:\r\n low+=1\r\nif low>=up:\r\n print(s.lower())\r\nelif up>low:\r\n print(s.upper())", "word = input()\r\nuppercase= 0\r\nfor i in range(len(word)):\r\n if(word[i]== word[i].upper()):\r\n uppercase +=1\r\nif(uppercase > len(word)/2):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "a = input()\r\n\r\ncount = 0\r\nc =0\r\nfor i in a:\r\n if i == i.upper():\r\n count +=1 \r\n else:\r\n c+=1\r\n\r\nif count>c :\r\n \r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word = input()\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in word:\r\n if(i.islower() == True):\r\n count1 = count1 + 1\r\n elif(i.isupper() == True):\r\n count2 = count2 + 1\r\n\r\nif(count1>=count2):\r\n word = word.lower()\r\n print(word)\r\n\r\nelif(count1<count2):\r\n word = word.upper()\r\n print(word)", "from math import *\r\ndef main():\r\n\r\n s = input()\r\n\r\n u = 0\r\n l = 0\r\n\r\n for c in s:\r\n if c.upper() == c:\r\n u += 1\r\n else:\r\n l += 1\r\n\r\n if u == l:\r\n print(s.lower())\r\n elif u < l:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n \r\nmain()", "lCount = 0\r\nuCount = 0\r\n\r\nstrin = input()\r\n\r\nfor i in range(len(strin)):\r\n \r\n if strin[i].isupper():\r\n uCount += 1\r\n else:\r\n lCount += 1\r\n\r\nif uCount > lCount:\r\n print(strin.upper())\r\nelse:\r\n print(strin.lower())", "def slovo(x):\r\n lc = 0\r\n uc = 0\r\n for letter in x:\r\n if letter == letter.lower():\r\n lc = lc + 1\r\n else:\r\n uc = uc + 1\r\n if lc == uc or lc > uc:\r\n return x.lower()\r\n else:\r\n return x.upper()\r\n\r\n\r\na = str(input())\r\nprint(slovo(a))\r\n", "s=input()\r\nm=''\r\nl=0;u=0\r\nfor i in s:\r\n if(i==i.lower()):\r\n l+=1\r\n else:\r\n u+=1\r\nif(l>u or l==u):\r\n for i in s:\r\n m+=i.lower()\r\nelif(u>l):\r\n for i in s:\r\n m+=i.upper()\r\nprint(m)\r\n", "s=input()\r\nc=0\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n c+=1\r\nif (len(s)-c)==c:\r\n print(s.lower())\r\nelif (len(s)-c)<c:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "arr=str(input())\r\ncount=0\r\nflag=0\r\nfor i in range(len(arr)):\r\n if(arr[i]==arr[i].upper()):\r\n count+=1\r\n elif(arr[i]==arr[i].lower()):\r\n flag+=1\r\nif(count>flag):\r\n print(arr.upper())\r\nelse:\r\n print(arr.lower())", "string=input()\ncount1=0\ncount2=0\nfor i in string:\n if(i.islower()):\n count1=count1+1\n elif(i.isupper()):\n count2=count2+1\nif count1>=count2:\n print(string.lower())\nelif count1<count2:\n print(string.upper())\n \n \n \n \n \n\n\n\n", "n = list(input())\r\nlower = 0\r\nupper = 0\r\nfor i in n:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif lower<upper:\r\n print(\"\".join(n).upper())\r\nelse:\r\n print(\"\".join(n).lower())\r\n", "import collections\r\na = input()\r\n\r\nd = collections.Counter()\r\nfor i in a:\r\n if i.islower():\r\n d['l'] +=1\r\n else:\r\n d['u'] += 1\r\nif d['l'] >= d['u']:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n ", "import sys\r\n\r\ns = list(sys.stdin.readline())[:-1]\r\n\r\nup = 0\r\nlow = 0\r\n\r\nfor i in s:\r\n if str(i).isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif low >= up:\r\n print(''.join(s).lower())\r\nelse:\r\n print(''.join(s).upper())", "s = input()\r\nls = sorted(list(s))\r\n\r\nup = 0\r\nfor i in ls:\r\n if i == i.upper():\r\n up += 1\r\n\r\nlow = len(ls)-up\r\nif up > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "a = input()\r\nb = a.upper()\r\nn = len(a)\r\nx = []\r\nfor z in range(n):\r\n x.append(b[z])\r\nc = 0\r\nfor i in range(n):\r\n if a[i] == x[i]:\r\n c+=1\r\nif c>n//2 :\r\n a = a.upper()\r\n print(a)\r\nelse:\r\n a = a.lower()\r\n print(a)", "string = input()\r\nup= 0\r\nlow = 0\r\n\r\nfor i in range (len(string)) :\r\n if string[i].islower() :\r\n low += 1\r\n elif string[i].isupper() :\r\n up += 1\r\n\r\nif up > low :\r\n string = string.upper()\r\nelif up == low :\r\n string = string.lower()\r\nelse :\r\n string = string.lower()\r\nprint(string)\r\n", "word = input()\r\ncount_upper = 0\r\ncount_lower = 0\r\nfor char in word:\r\n if char.isupper():\r\n count_upper += 1\r\n else:\r\n count_lower += 1\r\nif count_lower > count_upper:\r\n print(word.lower())\r\nelif count_upper > count_lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "str = input()\r\nupp = 0\r\nlow =0\r\nfor i in str:\r\n\tif i.isupper():\r\n\t\tupp += 1\r\n\telse:\r\n\t\tlow += 1\r\nif upp > low:\r\n\tprint(str.upper())\r\nelse:\r\n\tprint(str.lower())", "A,k=input(),0\r\nfor char in A :\r\n if ord(char) <97 :k=k+1 \r\nprint(A.upper()) if len(A)/2<k else print(A.lower())", "\r\na=input()\r\nk=a.lower()\r\nj=a.upper()\r\nc=0\r\nfor i in range(len(a)):\r\n\tif a[i]==k[i]:\r\n\t\tc=c+1\r\n\telse:\r\n\t\tc=c+0\r\nif len(a)%2==0:\r\n\tif c>=len(a)//2:\r\n\r\n\t\t\tprint(k) \r\n\telse:\r\n\t\t\tprint(j)\r\nelif len(a)%2!=0:\r\n\tif c>=(len(a)//2)+1:\r\n\t\t\tprint(k)\r\n\telse:\r\n\t\t\tprint(j)\r\n\r\n\r\n\r\n", "word = input()\r\nuppCount = 0\r\nlowCount = 0\r\nfor letter in word: \r\n if letter.isupper(): uppCount += 1\r\n else: lowCount += 1\r\n\r\nif uppCount > lowCount: print(word.upper())\r\nelse: print(word.lower())", "if __name__ == '__main__':\r\n\ts=input()\r\n\tl=u=0\r\n\tfor i in s:\r\n\t\tif(i.islower()):\r\n\t\t\tl += 1\r\n\t\telse:\r\n\t\t\tu += 1\r\n\tif(l<u):\r\n\t\tprint(s.upper())\r\n\telse:\r\n\t\tprint(s.lower())", "n=input()\r\nc=0\r\na=len(n)\r\nfor i in (n):\r\n if 97<=ord(i)<=122:\r\n c+=1\r\nif c>=(a-c):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n\r\n", "x=input()\r\nt=0\r\nv=0\r\nfor i in range (len(x)):\r\n if x[i].isupper():\r\n t=t+1\r\n elif x[i].islower():\r\n v=v+1\r\nif v>=t:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "word = input('')\r\nuppercase = 0\r\nlowercase = 0\r\nfor letter in word:\r\n\tif letter.isupper():\r\n\t\tuppercase += 1\r\n\telse:\r\n\t\tlowercase += 1\r\nif uppercase > lowercase:\r\n\tprint(word.upper())\r\nelse:\r\n\tprint(word.lower())\r\n\r\n", "s=input()\nc1=0\nc2=0\nfor i in range(0,len(s)):\n if s[i].islower():\n c1=c1+1\n elif s[i].isupper():\n c2=c2+1\nif c1>=c2:\n g=s.lower()\n print(g)\nelse:\n h=s.upper()\n print(h)\n\t \t \t\t \t \t\t\t\t \t\t\t \t\t \t \t\t", "n = str(input())\r\nList = list(n)\r\nu = 0\r\nl = 0\r\nfor x in range(len(n)):\r\n if \"A\" <= List[x] <= \"Z\":\r\n u+=1\r\n elif \"a\" <= List[x] <= \"z\":\r\n l+=1\r\n\r\nn_new = \"\".join(List)\r\n\r\nif u > l:\r\n print(n_new.upper())\r\n\r\nelif l > u:\r\n print(n_new.lower())\r\n\r\nelif u == l:\r\n print(n_new.lower())", "\r\ncc = input()\r\n\r\nc = len([x for x in cc if x.isupper()])\r\n\r\nprint(cc.upper() if c > (len(cc)-c) else cc.lower())", "str = input()\r\nres = sum(x.isupper() for x in str)\r\nif (len(str)-res) >= res:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "s = list(input())\r\ntotal = 0\r\nfor x in s:\r\n if x.isupper():\r\n total += 1\r\nif total > len(s)-total:\r\n print(\"\".join(s).upper())\r\nelse:\r\n print(\"\".join(s).lower())", "n = input()\r\n\r\nl = 0\r\nu = 0\r\n\r\nfor i in n:\r\n if i.islower():\r\n l +=1\r\n else:\r\n u+=1\r\n\r\nif l == u or l>u:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "ch = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range (len(ch)):\r\n if ch[i].isupper():\r\n upper +=1\r\n else:\r\n lower +=1\r\n\r\nif upper>lower:\r\n print(ch.upper())\r\n\r\nelse:\r\n print(ch.lower())", "word = input()\r\nlowercase_count = 0\r\n\r\nfor s in word:\r\n if ord(s) >= 97 and ord(s) <= 122:\r\n lowercase_count = lowercase_count + 1\r\n\r\nuppercase_count = len(word) - lowercase_count\r\n\r\nif lowercase_count == uppercase_count:\r\n print(word.lower())\r\nelif lowercase_count > uppercase_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n ", "def correct_word(word):\r\n num_upper = sum(1 for char in word if char.isupper())\r\n num_lower = len(word) - num_upper\r\n\r\n if num_upper > num_lower:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\n# Read the word\r\nword = input()\r\n\r\n# Correct the word\r\ncorrected_word = correct_word(word)\r\n\r\n# Print the result\r\nprint(corrected_word)\r\n", "y=input()\r\ny=[x for x in str(y)]\r\n\r\nl=0\r\nu=0\r\nfor i in y:\r\n\tif i.islower():\r\n\t\tl=l+1\r\n\tif i.isupper():\r\n\t\tu=u+1\t\r\nd=\"\"\r\nif(l>=u):\r\n\tfor i in y:\r\n\t\td=d+i.lower()\r\nelse:\r\n\tfor i in y:\r\n\t\td=d+i.upper()\r\n\r\nprint(d)\r\n", "s=input('')\r\nupper,lower=0,0\r\nl=['0']*len(s)\r\nfor i in range(len(s)):\r\n l[i]=s[i]\r\nfor i in s:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n for i in range(len(s)):\r\n if s[i].islower():\r\n l[i]=s[i].upper()\r\nelse:\r\n for i in range(len(s)):\r\n if s[i].isupper():\r\n l[i]=s[i].lower()\r\nfor i in l:\r\n print(\"\".join(i),end=\"\")", "def fix_word(word):\r\n lowers = 0\r\n for letter in word:\r\n if letter >= \"a\" and letter <=\"z\":\r\n lowers += 1\r\n uppers = len(word) - lowers\r\n if uppers > lowers:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n \r\nword = input()\r\nfix_word(word)", "word = input()\r\nlower = sum(1 for c in word if c.islower())\r\nupper = len(word) - lower\r\nif lower >= upper: print(word.lower())\r\nelse: print(word.upper())", "str = input()\r\nupp, low = 0,0\r\nfor c in str:\r\n if c.isupper():\r\n upp +=1\r\n if c.islower():\r\n low +=1\r\nif (upp>low):\r\n str=str.upper()\r\nelse:\r\n str=str.lower()\r\nprint(str)", "n=input()\r\nuc=0\r\nlc=0\r\nfor i in n:\r\n if i.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\nif(uc>lc):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "st=input()\r\nuc=lc=0\r\nfor i in st:\r\n if i.isupper():\r\n uc+=1\r\n else:\r\n lc+=1\r\nif(uc>lc):\r\n st=st.upper()\r\nelif(uc<lc):\r\n st=st.lower()\r\nelse:\r\n st=st.lower()\r\nprint(st)\r\n ", "s = input(\" \")\r\nx = s.upper()\r\ny = s.lower()\r\nk = len(s)\r\nno_of_upper = 0\r\nno_of_lower = 0\r\ni = 0\r\nwhile i < k:\r\n if s[i] == x[i]:\r\n no_of_upper += 1\r\n else:\r\n no_of_lower += 1\r\n i += 1\r\n\r\nif no_of_upper > no_of_lower:\r\n print(x)\r\nelse:\r\n print(y)", "s=str(input())\r\na=0\r\nb=0\r\nfor i in s:\r\n if i.isupper():\r\n a+=1\r\n else:\r\n b+=1\r\nif b>=a:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = str(input())\r\nup = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up+=1\r\n else :\r\n up-=1\r\nif up > 0 :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nc=0\r\nsm=0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n sm+=1\r\nif c>sm:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import math\r\na=input()\r\nw=0\r\nfor i in a:\r\n if i>='a' and i<='z':\r\n w+=1\r\nprint([a.lower(),a.upper()][w<math.ceil(len(a)/2)])", "word=input()\r\nlowernum=0\r\nuppernum=0\r\nfor x in word:\r\n if ord('a')<=ord(x)<=ord('z'):\r\n lowernum+=1\r\n if ord('A')<=ord(x)<=ord('Z'):\r\n uppernum+=1\r\nif lowernum>=uppernum:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "U=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nl=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=str(input())\r\ndu=0\r\ndl=0\r\nfor i in range(len(s)):\r\n if (s[i]in U)==True: du+=1 \r\n elif (s[i] in l)==True: dl+=1\r\nif du>dl: print(s.upper())\r\nelse: print(s.lower())\r\n", "s = input()\r\nupper = len([s for i in s if i.isupper() == True])\r\nlower = len([s for i in s if i.islower() == True])\r\nif upper <= lower:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=input()\nM=0\nm=0\nfor i in a:\n if i == i.upper():\n M+=1\n else:\n m+=1 \nif M>m:\n print(a.upper())\nelse:\n print(a.lower())\nk:179254912\n \t \t \t \t\t\t\t \t \t\t\t\t\t\t\t \t \t", "s= input()\r\nc_l=0\r\nc_u=0\r\nfor i in s:\r\n if i.isupper():\r\n c_u+=1\r\n else:\r\n c_l+=1\r\nif c_u>c_l:\r\n print(s.upper())\r\nelif c_u==c_l:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "n=input()\r\ns=0\r\ns1=0\r\nfor i in n:\r\n if ord(i)>=65 and ord(i)<=90:\r\n s+=1\r\n else:\r\n s1+=1\r\nif s<=s1:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "# Word\r\n\r\ns = input()\r\ncounter1 = 0\r\ncounter2 = 0\r\n\r\nfor i in range(len(s)):\r\n if 97 <= ord(s[i]) <= 122:\r\n counter1 += 1\r\n else:\r\n counter2 += 1\r\n\r\nif counter1 == counter2:\r\n s = s.lower()\r\nelif counter1 > counter2:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)\r\n", "s=input()\r\nl=0\r\nu=0\r\nfor i in s:\r\n if ord('a') <= ord(i) <= ord('z'):\r\n l+=1\r\n elif ord('A') <= ord(i) <= ord('Z'):\r\n u+=1\r\nif l>=u:\r\n print(s.lower())\r\nelif u>l:\r\n print(s.upper())", "def func(st):\r\n n = len(st)\r\n up, down = 0, 0\r\n for char in st:\r\n if(str(char).isupper()):\r\n up += 1\r\n else:\r\n down += 1\r\n if((n & 1) == 1):\r\n if(up > down):\r\n return st.upper()\r\n return st.lower()\r\n if(up > down):\r\n return st.upper()\r\n elif(down > up):\r\n return st.lower()\r\n return st.lower()\r\n \r\n\r\nst = input()\r\nprint(func(st))", "x = input()\r\ny = list(x)\r\nup =0\r\ndown=0\r\nfor i in y:\r\n if(i.islower()):\r\n down=down+1\r\n if(i.isupper()):\r\n up = up+1\r\nif(up>down):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "from collections import Counter\nstring = input(\"\")\ninfoList = Counter(map(lambda x:x.islower(), string))\nif infoList[True] >= infoList[False]: print(string.lower())\nelse: print(string.upper())", "w=input() #a word given by the user\r\nupper=0\r\nlower=0\r\nfor i in w:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n\r\n if upper>lower:\r\n w=w.upper()\r\n else:\r\n w=w.lower()\r\nprint(w)", "s = input()\r\nuppercase = 0\r\n\r\nfor c in s:\r\n if c.isupper():\r\n uppercase += 1\r\n\r\nif uppercase > int(len(s) / 2):\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)\r\n", "def split(word): \n return [char for char in word] \n\nword = str(input())\nchars= split(word)\nlowerNumber =0 \nupperNumber = 0\nfor char in chars :\n if char.isupper():\n upperNumber +=1\n else: \n lowerNumber +=1\n\nif upperNumber > lowerNumber:\n print(word.upper())\nelse:\n print(word.lower())", "w = input()\r\nu, l = 0, 0\r\n\r\nfor c in w:\r\n if c.islower():\r\n l += 1\r\n else:\r\n u += 1\r\n\r\nif l >= u:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "a = input()\r\ncounters = 0\r\ncountert = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n countert += 1\r\n else:\r\n counters += 1\r\nif counters >= countert:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "string = input()\r\n\r\nlower_ch = 0\r\nupper_ch = 0\r\nfor i in range(len(string)):\r\n if string[i].islower():\r\n lower_ch += 1\r\n else:\r\n upper_ch += 1\r\n\r\nprint(string.upper() if upper_ch > lower_ch else string.lower())", "str1 = input()\r\nu = 0\r\nl = 0\r\nfor i in range(len(str1)):\r\n\tif str1[i].isupper():\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif u>l:\r\n\tprint(str1.upper())\r\nelse:\r\n\tprint(str1.lower())", "def split(word):\r\n return list(word)\r\n \r\nx = input()\r\na = 0\r\nb = 0\r\ny = split(x)\r\nfor i in y:\r\n if i.islower() :\r\n a = a + 1\r\n else :\r\n b = b + 1\r\n\r\nif b > a:\r\n print(''.join(y).upper())\r\nelse:\r\n print(''.join(y).lower())", "o=input()\ne=0\nf=0\nfor x in o:\n if x.isupper():\n \te+=1\n else:\n \tf+=1\nif e>f:\n print(o.upper())\nelse:\n print(o.lower())\n\t \t\t \t\t \t\t\t\t\t\t \t \t\t\t\t\t", "word = list(str(input()))\r\n\r\ncount_caps = 0\r\nfor letter in word:\r\n if letter.upper() == letter:\r\n count_caps += 1\r\n\r\nif count_caps > len(word) - count_caps:\r\n for i in range(len(word)):\r\n char = word[i].upper()\r\n word[i] = char\r\nelse:\r\n for i in range(len(word)):\r\n char = word[i].lower()\r\n word[i] = char\r\n\r\nword = ''.join(word)\r\nprint(word)", "a = input()\r\na1 = ''; a2 = ''\r\ncnt, cnt1 =0,0\r\nfor i in a:\r\n\tif ord(i) < 97:\r\n\t\ta1+= i\r\n\t\ta2+= chr(ord(i)+32)\r\n\t\tcnt +=1\r\n\telse:\r\n\t\ta2 += i\r\n\t\ta1 += chr(ord(i)-32)\r\n\t\tcnt1 += 1 \r\nprint(a1 if cnt > cnt1 else a2)", "n=input()\r\nl=0\r\nu=0\r\nfor i in range(len(n)):\r\n if ord(n[i])>=97 and ord(n[i])<=122:\r\n l+=1\r\n elif ord(n[i])>=65 and ord(n[i])<=90:\r\n u+=1\r\nif l>=u:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n \r\n", "s=str(input())\nu=0\nl=0\nb=\"\"\na=[i for i in s]\nfor i in range(len(a)):\n if a[i].isupper():\n u+=1\n elif a[i].islower():\n l+=1\nif u<l:\n b=s.lower()\n print(b)\nelif u>l:\n b=s.upper()\n print(b)\nelse:\n b=s.lower()\n print(b)\n \t \t \t \t \t \t \t\t\t\t \t", "a = input()\r\n\r\nl = 0\r\n\r\nu = 0\r\n\r\nfor i in range(len(a)):\r\n if ord(a[i]) >= ord('a') and ord(a[i]) <= ord('z'):\r\n l += 1\r\n else:\r\n u += 1\r\nif l > u:\r\n print(a.lower())\r\nelif l == u:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\r\ncountu=0\r\ncountl=0\r\nfor i in s:\r\n if i.isupper():\r\n countu=countu+1\r\n else:\r\n countl=countl+1\r\nif countu>countl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ns1=list(s)\r\nu,l=0,0\r\n\r\nfor i in s1:\r\n if 65<=ord(i)<=90:\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nif u>l:\r\n print(s.upper())\r\nelif u<=l:\r\n print(s.lower())\r\n\r\n \r\n \r\n", "s=input()\r\nuc=0\r\nlc=0\r\nfor c in s:\r\n if c.isupper():\r\n uc+=1\r\n else:\r\n lc+=1\r\nif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "\r\ndef opt(s) :\r\n u,l=0,0\r\n for i in s:\r\n if ord(i) in range(65,91) :\r\n u += 1\r\n else :\r\n l += 1\r\n if l >= u :\r\n return True\r\n else :\r\n return False\r\n\r\nx = input()\r\nif opt(x) == True :\r\n print(x.lower())\r\nelse :\r\n print(x.upper())\r\n", "s=input()\r\ncount1=0\r\nfor a in s:\r\n if a==a.lower():\r\n count1+=1\r\ncount2=len(s)-count1\r\nif count1>=count2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "w = input()\r\n\r\nupperLetter = 0\r\nlowerLetter = 0\r\n\r\nfor l in w:\r\n if l.islower():\r\n lowerLetter += 1\r\n elif l.isupper():\r\n upperLetter += 1\r\n\r\nif lowerLetter >= upperLetter:\r\n x = w.lower()\r\nelif upperLetter > lowerLetter:\r\n x = w.upper()\r\nelse:\r\n pass\r\nprint(x)", "word = input()\r\n\r\nu = 0\r\nl = 0\r\n\r\nfor let in word:\r\n\tif let.isupper():\r\n\t\tu += 1\r\n\telse:\r\n\t\tl += 1\r\n\r\nif u > l:\r\n\tprint(word.upper())\r\nelse:\r\n\tprint(word.lower())", "s = input()\r\n\r\nu_count = sum(1 for i in s if i.isupper())\r\nl_count = len(s) - u_count\r\n\r\nif u_count > l_count:\r\n S = s.upper()\r\nelse:\r\n S = s.lower()\r\n\r\nprint(S)\r\n", "def test(word):\r\n upper_count = 0\r\n lower_count = 0\r\n for each_chr in word:\r\n if each_chr.isupper():\r\n upper_count = upper_count + 1\r\n elif each_chr.islower():\r\n lower_count = lower_count + 1\r\n if upper_count == lower_count or lower_count>upper_count:\r\n return word.lower()\r\n elif upper_count > lower_count:\r\n return word.upper()\r\n \r\nprint(test(input()))", "s = input()\r\na = sum((1 if c.isupper() else 0) for c in s)\r\nprint(s.upper()) if a > len(s)-a else print(s.lower())", "from collections import defaultdict\r\nimport math\r\n\r\n# n=int(input())\r\n# n,t=list(map(int,input().split()))\r\ns=input()\r\nlis=[]\r\n# for ele in s:\r\n# lis.append(ele)\r\n# print(s)\r\n\r\n# x,y,z=0,0,0\r\ns1=s.upper()\r\ns2=s.lower()\r\nc=0\r\nfor ele in s:\r\n if(ele>='a' and ele<='z'):\r\n c+=1\r\n# print(c)\r\nif(c>=len(s)-c):\r\n print(s2)\r\nelse:\r\n print(s1)\r\n\r\n\r\n\r\n", "s=input()\r\np=len(s)\r\nalpha=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nif(sum(c in alpha for c in s) < (p+1)/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = list(input())\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in range(len(n)):\r\n if 65 <= ord(n[i]) <= 96:\r\n upper += 1\r\n else:\r\n lower += 1\r\nm = ''.join(n)\r\nif upper > lower:\r\n print(m.upper())\r\nelse:\r\n print(m.lower())\r\n\r\n\r\n\r\n\r\n\r\n", "k=count=0\r\ns=input()\r\nfor i in s:\r\n if i.islower():\r\n k+=1\r\n if i.isupper():\r\n count+=1\r\nif k>=count:\r\n s=s.lower()\r\nif count>k:\r\n s=s.upper()\r\nprint(s)", "s = input()\r\nupper_count = 0\r\nfor char in s:\r\n if char.isupper():\r\n upper_count += 1\r\n\r\nif upper_count > len(s) / 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nlow_cnt=0\r\nupp_cnt=0\r\nfor i in a:\r\n if i.isupper():\r\n upp_cnt+=1 \r\n else:\r\n low_cnt+=1 \r\nif upp_cnt>low_cnt:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input() \r\nupper_c = 0 \r\nlower_c = 0 \r\nfor c in s: \r\n if c.isupper(): \r\n upper_c+=1 \r\n elif c.islower(): \r\n lower_c+=1 \r\nif upper_c>lower_c: \r\n print(s.upper()) \r\nelse: \r\n print(s.lower())", "word=input()\r\ncapital=[]\r\n\r\nlenght=len(word)\r\n# print(lenght)\r\nfor x in word:\r\n if x.isupper():\r\n capital.append(x)\r\n\r\ncapital_letters=len(capital)\r\n\r\nif lenght/2==capital_letters:\r\n print(word.lower())\r\n \r\nelif lenght/2>capital_letters:\r\n print(word.lower())\r\nelif lenght/2<capital_letters:\r\n print(word.upper())\r\n \r\n# print(capital)", "s = input()\r\nuc = 0\r\ndc = 0\r\nfor x in s:\r\n if x.isupper():\r\n uc += 1\r\n else:\r\n dc += 1\r\nif uc > dc:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s);", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inputOne():\r\n return(int(input()))\r\ndef inputListAsList():\r\n return(list(map(int,input().split())))\r\ndef inputString():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef inputList():\r\n return(map(int,input().split()))\r\n\r\ndef main():\r\n s = inputString()\r\n\r\n isUpper = 0\r\n for c in s:\r\n isUpper += 1 if c.isupper() else 0\r\n\r\n s = \"\".join(s)\r\n\r\n return s.lower() if isUpper <= len(s) // 2 else s.upper()\r\n\r\nprint(main())", "t=input()\r\nc=s=0\r\nfor i in t:\r\n if ord(i)>=65 and ord(i)<=90:\r\n c+=1\r\n else:\r\n s+=1\r\nif c>s:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "ip = input()\r\na = 0\r\nnum = 0\r\n\r\nfor i in ip:\r\n if i.isupper():\r\n a += 1\r\n else:\r\n num += 1\r\n \r\nif a>num:\r\n print(ip.upper())\r\n \r\nelse:\r\n print(ip.lower())", "s = input()\r\nll = []\r\nul = []\r\nfor i in s:\r\n if i.isupper():\r\n ul.append(i)\r\n else:\r\n ll.append(i)\r\nif len(ll) >= len(ul):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "\r\ndef words(word):\r\n lower = 0\r\n upper = 0\r\n for ch in word:\r\n if ch == ch.lower():\r\n lower +=1\r\n elif ch == ch.upper():\r\n upper +=1\r\n if lower == upper:\r\n return word.lower()\r\n elif upper > lower:\r\n return word.upper()\r\n elif lower > upper:\r\n return word.lower()\r\n\r\n\r\nprint(words(input(\"\")))", "x=input()\r\ncountlo=0\r\ncountup=0\r\nfor i in x:\r\n if ord(i)>=65 and ord(i)<=90 :\r\n countup+=1\r\n elif ord(i)>=97 and ord(i)<=122:\r\n countlo+=1\r\nif(countlo>=countup):\r\n print(x.lower())\r\nelif(countup>countlo):\r\n print(x.upper())\r\n\r\n ", "word=input()\n\nupper=0\nlower=0\n\nfor i in range(len(word)):\n if word[i].isupper():\n upper=upper+1\n else:\n lower=lower+1\n\n\nresult=\"\"\n\nif upper>lower:\n result=word.upper()\nelif upper<=lower:\n result=word.lower()\n\nprint(result)\n", "num = input()\n\ncount = 0\nfor i in num:\n if i.isupper():\n count += 1\n\nif count/len(num) > 0.5:\n print(num.upper())\nelse:\n print(num.lower())\n", "s = input()\r\ncapital = 0\r\nsmall = 0\r\nfor i in s:\r\n if i.isupper():\r\n capital += 1\r\n else:\r\n small += 1\r\n\r\nprint(s.upper() if capital > small else s.lower())\r\n", "s=input();upp =0;low=0\r\nfor i in range(len(s)):\r\n if(s[i].upper()==s[i]):\r\n upp+=1\r\n else:\r\n low+=1\r\nif(upp>low):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\n\nlow_count = len([c for c in word if c.islower()])\n\nif (2*low_count < len(word)):\n print(word.upper())\nelse:\n print(word.lower())\n", "string = input()\r\nupper = lower = 0\r\nfor a in string:\r\n if a.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper > lower:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "word = input()\r\nlst = []\r\ncountLower, countUpper = 0, 0\r\nfor letter in word:\r\n lst.append(ord(letter))\r\nfor index in lst:\r\n if 97 <= index <= 122:\r\n countLower += 1\r\n else:\r\n countUpper += 1\r\nif countLower >= countUpper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n\r\n# print(ord('a'), ord('z'), ord('A'), ord('Z'))\r\n# 97 122 65 90\r\n", "word = input()\r\ncount1=0\r\ncount2=0\r\nfor char in word:\r\n if char.isupper():\r\n count1+=1\r\n elif char.islower():\r\n count2+=1\r\nif(count1<=count2):\r\n print(word.lower())\r\nelse:\r\n print(word.upper()) ", "word = input()\r\nupcount = lowcount = 0\r\nfor i in word:\r\n if i.isupper():\r\n upcount += 1\r\n else:\r\n lowcount += 1\r\nif upcount>lowcount:\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)", "s=input()\r\nn=len(s)\r\n\r\na=0\r\nb=0\r\nfor i in range(n):\r\n if s[i].isupper():\r\n a+=1\r\n else:\r\n b+=1\r\n \r\nif a>b:\r\n s=s.upper()\r\n\r\nelse:\r\n s=s.lower()\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\t \t\r\n\r\n\r\n\r\n\r\n\r\n", "name=input()\r\nname_low=name.lower()\r\nname_up=name.upper()\r\ndef value(a):\r\n output=0\r\n for i in a:\r\n output+=ord(i)\r\n return output\r\nname_up_value=abs(value(name)-value(name_up))\r\nname_low_value=abs(value(name)-value(name_low))\r\nprint(name_up if(name_up_value<name_low_value)else name_low)", "numberoflowercase=0\r\nnumberofuppercase=0\r\n\r\n\r\nlist=input(\" \")\r\nfor x in list:\r\n if x>='a' and x<='z':\r\n numberoflowercase=numberoflowercase+1\r\n if x>='A' and x<='Z':\r\n numberofuppercase=numberofuppercase+1\r\nif numberoflowercase>=numberofuppercase:\r\n\r\n print(list.lower())\r\nelse:\r\n\r\n print(list.upper())", "s=input()\r\ndef d(a, b):\r\n c=0\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n c+=1\r\n return c\r\nsl=s.lower()\r\nsu=s.upper()\r\nif d(s, sl)<=d(s, su):\r\n print(sl)\r\nelse:\r\n print(su)", "str = input()\r\nloct = 0\r\nhict = 0 \r\nfor ch in str :\r\n if ch.islower() : loct += 1\r\n else : hict += 1\r\n\r\nif hict > loct : str = str.upper()\r\nelse : str = str.lower()\r\n\r\nprint(str)", "s = input()\r\nlow, up = 0, 0\r\nfor a in s:\r\n if a.islower():\r\n low += 1\r\n else:\r\n up += 1\r\nif low >= up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import math\r\ns=input()\r\nl=0\r\nh=0\r\nfor i in s:\r\n if i.islower():\r\n l+=1\r\n else:\r\n h+=1\r\nif l>= math.ceil(len(s)/2):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "s=input()\r\nn=len(s)\r\nlo=0\r\nup=0\r\nfor i in range(n):\r\n if(s[i]>='A' and s[i]<='Z'):\r\n up+=1\r\n else:\r\n lo+=1\r\nif lo<up:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nc1=0\r\nc2=0\r\nfor i in range(len(s)):\r\n\tt=s[i].isupper()\r\n\tif t==True:\r\n\t\tc1=c1+1\r\n\telse:\r\n\t\tc2=c2+1\r\nif c1<=c2:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "n=input()\r\ns=0\r\nc=0\r\nfor i in range(len(n)):\r\n if(n[i].isupper()):\r\n s=s+1 \r\n else:\r\n c=c+1\r\nif(s>c):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "if __name__ == '__main__':\n countUpper = 0\n countLower = 0\n\n str = input()\n for x in str:\n if x.isupper():\n countUpper += 1\n else:\n countLower += 1\n\n if countLower >= countUpper:\n print(str.lower())\n else:\n print(str.upper())\n \t\t \t \t\t \t\t\t \t\t \t \t \t\t\t\t", "a=input()\r\nx,y=0,0\r\nfor i in a:\r\n if i.isupper():x+=1\r\n elif i.islower():y+=1\r\n\r\nif x==y:\r\n print(a.lower())\r\nelif x>y:\r\n print(a.upper())\r\nelif y>x:\r\n print(a.lower())", "s = input()\r\nupcount =0\r\nlwcount =0\r\nfor ch in s:\r\n if ch.isupper():\r\n upcount += 1\r\n else:\r\n lwcount += 1\r\n \r\nif(upcount>lwcount):\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "word = input()\r\nlow = 0\r\nup = 0\r\nfor x in word:\r\n if x.islower():\r\n low += 1\r\n else:\r\n up += 1\r\nif low >= up:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "n=input()\r\nupper=0\r\nlower=0\r\nfor i in n:\r\n\tif i.isupper() ==True:\r\n\t\tupper+=1\r\n\telse:\r\n\t\tlower+=1\r\nif upper>lower:\r\n\tprint(n.upper())\r\nelse:\r\n\tprint(n.lower())", "s = input()\n\nl = 0\nu = 0\nfor i in s:\n if i.isupper():\n u += 1\n if i.islower():\n l += 1\nif l >= u:\n print(s.lower())\nif u > l:\n print(s.upper())\n\n \t\t \t \t \t\t\t\t \t \t\t\t \t \t\t \t \t\t", "a = input()\r\nc = 0\r\nd = 0\r\nif len(a)%2==0:\r\n p = len(a)//2\r\nelse:\r\n p = (len(a)+1)//2\r\nfor i in a:\r\n if ord(i)>=97:\r\n c += 1\r\n else:\r\n d += 1\r\nif (c >=p and d>=p) or c>=p:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "word=input()\r\nlower=0\r\nupper=0\r\nfor i in word:\r\n if i==i.lower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif lower>=upper:\r\n print(word.lower())\r\nif upper>lower:\r\n print(word.upper())\r\n", "s=input()\r\nc1,c2=0,0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\nif c1>c2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nlc=uc=0\r\n\r\nfor i in s:\r\n p = i.islower()\r\n if(p == True):\r\n lc+=1\r\n q = i.isupper()\r\n if(q == True):\r\n uc+=1\r\n\r\nif(lc>=uc):\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n \r\nprint(s)", "word = input()\r\nupper_counter = 0\r\nlower_counter = 0\r\nlength = len(word)\r\nword_list = list(word)\r\nfor i in range(length):\r\n check = word_list[i].isupper()\r\n if check:\r\n upper_counter += 1\r\n else:\r\n lower_counter += 1\r\n\r\n\r\nif lower_counter >= upper_counter:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)\r\n", "s=input()\r\nl=0\r\nu=0\r\nfor i in range(len(s)):\r\n if s[i].islower() == True:\r\n l+=1\r\n else:u+=1\r\nprint(s.upper() if u>l else s.lower())", "# 2EZ4MEGUMIN\n\ns = input()\nlower_count = 0\nupper_count = 0\nfor i in range(len(s)):\n if ord(s[i]) <= 90:\n upper_count += 1\n else:\n lower_count += 1\nif lower_count >= upper_count:\n print(s.lower())\nelse:\n print(s.upper())\n \t\t \t \t\t \t \t\t\t\t\t\t\t \t \t", "K = input(str())\nuppercase_count = 0\nlowercase_count = 0\nfor c in K:\n if c.isupper():\n uppercase_count += 1\n else:\n lowercase_count += 1\nif uppercase_count > lowercase_count: \n print(K.upper())\nelse:\n print(K.lower())\n \t \t \t \t \t \t \t\t \t \t\t\t\n\t \t \t\t \t \t \t\t\t \t\t \t \t \t \t\t\t", "s = str(input())\r\nlc = 0\r\nuc = 0\r\nfor i in range (len(s)):\r\n if(s[i].islower()):\r\n lc+=1\r\n if(s[i].isupper()):\r\n uc+=1\r\n \r\nif(lc>uc or lc==uc):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "text = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(text)):\r\n if text[i].isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper <= lower:\r\n print(text.lower())\r\nelse:\r\n print(text.upper())", "pot = input()\r\nfox = 0\r\nfor gun in pot:\r\n if gun.isupper():\r\n fox += 1\r\n\r\nif fox > len(pot) // 2:\r\n pot = pot.upper()\r\nelse:\r\n pot = pot.lower()\r\n\r\nprint(pot)", "s=input()\n\r\nlower=upper=0\n\r\nl=\"abcdefghijklmnopqrstuvwxyz\"\r\n\nu=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n\nfor i in s:\n\r\n if i in l:\n\r\n lower+=1\r\n\n else:\n\r\n upper+=1\r\n\n\r\nif(lower>=upper):\r\n\n print(s.lower())\r\n\nelse:\n\r\n print(s.upper())\n ", "string = input();print(string.upper()) if sum(i.isupper() for i in string) > len(string)/2 else print(string.lower())", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i >='A' and i <= 'Z':\r\n count += 1\r\nif count>(len(s)/2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "def word(s):\r\n c1=0\r\n c2=0\r\n for i in range(0,len(s)):\r\n if(s[i].islower()):\r\n c1+=1\r\n if(s[i].isupper()):\r\n c2+=1\r\n if(c1>c2):\r\n return s.lower()\r\n elif(c2>c1):\r\n return s.upper()\r\n else:\r\n return s.lower()\r\nif __name__=='__main__':\r\n s=input()\r\n res=word(s)\r\n print(res)\r\n \r\n", "word = input()\r\n\r\ncountUpper = 0\r\ncountLower = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n countUpper += 1\r\n elif i.islower():\r\n countLower += 1\r\n \r\nif countUpper > countLower:\r\n print(word.upper())\r\nelif countUpper < countLower:\r\n print(word.lower())\r\nelif countUpper == countLower:\r\n print(word.lower())", "palabraUsuario = input()\n\nmayusculasCuenta = sum(1 for char in palabraUsuario if char.isupper())\nminusculasCuenta = len(palabraUsuario) - mayusculasCuenta\n\nif mayusculasCuenta > minusculasCuenta:\n \n palabraCorrejida = palabraUsuario.upper()\n \nelse:\n \n palabraCorrejida = palabraUsuario.lower()\n \nprint(palabraCorrejida)\n\n \t \t \t\t\t\t \t \t\t\t\t\t\t\t\t\t \t\t", "s = str(input())\r\nu, l = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nprint(s.upper() if l<u else s.lower())\r\n", "n=0\ns=input()\nfor i in s:\n if i.isupper():\n n+=1\nif len(s)-n>=n:\n print(s.casefold())\nelse:\n print(s.upper())", "n = input()\nma = 0\nmi = 0\nfor i in n:\n if ord(i)>= 65 and ord(i)<= 90:\n ma+=1\n else:\n mi+=1\nprint(n.upper() if ma > mi else n.lower())\n\t \t \t \t\t \t \t\t\t\t\t \t\t\t \t\t\t \t\t \t", "a=input()\r\nC=0\r\nS=0\r\nfor i in a:\r\n if i.isupper():\r\n C=C+1\r\n else:\r\n S=S+1\r\nif C>S:\r\n print(''.join([i.upper() for i in a]))\r\nelse:\r\n print(''.join([i.lower() for i in a]))\r\n", "x=input()\r\nl=0\r\nu=0\r\nfor i in x:\r\n if ord(i)>=65 and ord(i)<=90:\r\n u=u+1\r\n elif ord(i)>=97 and ord(i)<=122:\r\n l=l+1\r\n\r\nif l>=u:\r\n x=x.lower()\r\n print(x)\r\nelif l<u:\r\n x=x.upper()\r\n print(x)\r\n", "x = str(input())\r\nu_count = 0\r\nl_count = 0\r\nfor i in range(len(x)):\r\n if x[i].isupper():\r\n u_count+=1\r\n else:\r\n l_count+=1\r\nif u_count>l_count:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "#Youssef Hassan\r\ns=input()\r\nupp=0\r\nlow=0\r\nfor i in s:\r\n if i.isupper()==True:\r\n upp+=1\r\n else:\r\n low+=1\r\nif low>=upp:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n", "#Word\r\nword = input().strip()\r\nupperCaseCount = len([x for x in word if x.isupper() == True])\r\n\r\n# if upperCaseCount > (len(word) - upperCaseCount):\r\n# \tprint(''.join(list(map(lambda x: x.upper(),word))))\r\n# else:\r\n# \tprint(''.join(list(map(lambda x : x.casefold(),word))))\r\n\r\n\r\nif upperCaseCount > (len(word) - upperCaseCount):\r\n\tprint(\"\".join([x.upper() for x in word]))\r\nelse:\r\n\tprint(\"\".join([x.casefold() for x in word]))\r\n\t", "ss = input()\r\n\r\nstring=list(map(ord,ss))\r\nupper = 0\r\nlower = 0\r\nfor s in string:\r\n if s > 90 :\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper > lower:\r\n print(ss.upper())\r\nelse:\r\n print(ss.lower())", "def word():\r\n s=input()\r\n lcount=0\r\n for i in range(len(s)):\r\n if s[i].islower():\r\n lcount=lcount+1\r\n if lcount>=(len(s)/2):\r\n ans=s.lower()\r\n print(ans)\r\n else:\r\n ans=s.upper()\r\n print(ans)\r\n\r\nword()\r\n\r\n", "word = input()\r\nlowerCase = 0\r\nupperCase = 0\r\nfor i in word:\r\n if i.islower():\r\n lowerCase += 1\r\n if i.isupper():\r\n upperCase += 1\r\nif upperCase > lowerCase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "b = input()\r\nnewstring = ''\r\ncount1 = 0\r\ncount2 = 0\r\nfor a in b:\r\n if (a.isupper()) == True:\r\n count1 += 1\r\n newstring += (a.lower())\r\n elif (a.islower()) == True:\r\n count2 += 1\r\n newstring += (a.upper())\r\nif(count1>count2):\r\n print(b.upper())\r\nelse:\r\n print(b.lower())", "num=input()\r\nx=len(num)\r\nlower_case=0\r\nelse_case=0\r\nfor i in range(x):\r\n numpers=num[i]\r\n lowerr=numpers.lower()\r\n if numpers==lowerr:\r\n lower_case=lower_case+1\r\n else:\r\n else_case=else_case+1\r\nif lower_case>else_case:\r\n print(num.lower())\r\nelif lower_case<else_case:\r\n print(num.upper())\r\nelse:\r\n print(num.lower())\r\n", "def upperCase(s):\r\n uppercase = 0\r\n for letter in s:\r\n if letter == letter.upper():\r\n uppercase += 1\r\n return uppercase\r\n \r\ns = input()\r\nif upperCase(s) <= len(s) - upperCase(s):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\na=(len(s)/2)\nb=0\nfor i in s:\n\tif i.islower():\n\t\tb=b+1\nif b>a:\n\tprint(s.lower())\nelif b==a:\n\tprint(s.lower())\nelse:\n\tprint(s.upper())\n\n", "lower = 0\r\nupper = 0\r\n\r\ns = input()\r\n\r\nfor c in s:\r\n if c.islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\n\r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "x=input()\r\nlo=0\r\nupp=0\r\nfor i in range(len(x)):\r\n t=ord(x[i])\r\n if t>=65 and t<=90:\r\n upp=upp+1\r\n elif t>=97 and t<=122:\r\n lo=lo+1\r\n#print(lo,upp) \r\nif lo>=upp:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n ", "s=input()\r\nl=list(s)\r\ncaps=0\r\nsmall=0\r\nfor i in s:\r\n if 65<=ord(i)<=90:\r\n caps=caps+1\r\n else:\r\n small=small+1\r\nif caps>small:\r\n for i in range(len(l)):\r\n if 97<=ord(l[i])<=122:\r\n l[i]=chr(ord(l[i])-32)\r\n print(\"\".join(str(e) for e in l))\r\n\r\nelse:\r\n for i in range(len(l)):\r\n if 65<=ord(l[i])<=90:\r\n l[i]=chr(ord(l[i])+32)\r\n print(\"\".join(str(e) for e in l))", "s=input()\r\nn=0\r\nfor i in range(len(s)):\r\n if s[i].islower():n+=1\r\nprint( s.lower()if n==len(s)-n else s.lower()if n>len(s)-n else s.upper())", "x = str(input())\r\ncnt1,cnt2 = 0,0\r\nfor ch in x:\r\n if(ord(ch) >= 65 and ord(ch) <= 90):\r\n cnt1 += 1\r\n elif(ord(ch) >= 97 and ord(ch) <= 122):\r\n\t cnt2 += 1\r\nif cnt1 > cnt2:\r\n y = x.upper()\r\n print(y)\r\nelse:\r\n y = x.lower()\r\n print(y)", "wrd = input()\r\nuppercase_count = sum(1 for char in wrd if char.isupper())\r\nlowercase_count = len(wrd) - uppercase_count\r\nif uppercase_count > lowercase_count:\r\n print(wrd.upper())\r\nelse:\r\n print(wrd.lower())", "s = input()\r\nu = []\r\nl = []\r\nfor i in s:\r\n if i == i.upper():\r\n u.append(i)\r\n else:\r\n l.append(i)\r\nif len(u) > len(l):\r\n print(f'{s.upper()}')\r\nelse:\r\n print(f'{s.lower()}')", "word = input()\r\nlen_word = len(word)\r\ncounter_upper = 0\r\ncounter_lower = 0\r\n\r\nfor letter in word:\r\n if letter == letter.upper():\r\n counter_upper += 1\r\n else:\r\n counter_lower += 1\r\n\r\nif counter_upper == counter_lower:\r\n word = word.lower()\r\nelif counter_lower > counter_upper:\r\n word = word.lower()\r\nelif counter_lower < counter_upper:\r\n word = word.upper()\r\n\r\nprint(word)\r\n\r\n\r\n\r\n", "s = str(input())\r\nu = s\r\nup = 0\r\nfor i in s:\r\n if i in u.upper():\r\n up += 1\r\nif up > len(s)-up:\r\n s = s.upper()\r\nelse: s = s.lower()\r\nprint(s)", "st = input()\r\nlow = 0\r\nup = 0\r\nfor i in range(len(st)):\r\n if(st[i].islower()):\r\n low += 1\r\n else:\r\n up += 1\r\nif (up > low):\r\n st = st.upper()\r\nelse:\r\n st = st.lower()\r\nprint(st)", "n=input()\r\nl=0\r\nu=0\r\nfor i in n:\r\n if i.isupper()==True:\r\n u+=1\r\n else:\r\n l+=1\r\nr=\"\"\r\nif l>=u:\r\n for i in n:\r\n r+=i.lower()\r\nelse:\r\n for i in n:\r\n r+=i.upper()\r\nprint(r)", "t=input()\r\nc=0\r\nfor i in t:\r\n if i.isupper():\r\n c+=1\r\nl=len(t)-c \r\nif c>l:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "def is_lowercase(c: str) -> bool:\n return c >= 'a' and c <= 'z'\n\ndef main() -> None:\n word = input()\n n = len(word)\n lower_case_count = 0\n for i in range(n):\n if is_lowercase(word[i]):\n lower_case_count += 1\n\n if lower_case_count >= n - (n // 2):\n print(word.lower())\n else:\n print(word.upper())\n\n\nif __name__ == \"__main__\":\n main()\n", "d = input()\r\nu = 0\r\nfor i in d:\r\n if i.isupper():\r\n u += 1\r\nif u <= len(d)/2:\r\n print(d.lower())\r\nelse:\r\n print(d.upper())", "sink=input()\r\nlower=0\r\nupper=0\r\nfor i in range(len(sink)):\r\n if sink[i].lower()==sink[i]:\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper>lower:\r\n print(sink.upper())\r\nelse:\r\n print(sink.lower())", "\"\"\"\r\n nombre: Word\r\n id: 59A\r\n fuente: codeforces\r\n coder: cgesu\"\"\"\r\n\r\ns = input()\r\nnupper = nlower = 0\r\nfor letter in list(s):\r\n nupper += letter.isupper()\r\n nlower += letter.islower()\r\nprint(s.lower()) if nlower >= nupper else print(s.upper())", "a=input()\r\nl=0\r\nu=0\r\nfor i in range(0,len(a)):\r\n if(a[i].islower()==True):\r\n l+=1\r\n else:\r\n u+=1\r\nif(l>=(len(a)/2)):\r\n a=a.lower()\r\nelse:\r\n a=a.upper()\r\nprint(a)", "def main():\n s, upper, lower = input(), 0, 0\n for char in s:\n if char.isupper():\n upper += 1\n else:\n lower += 1\n if upper > lower:\n print(s.upper())\n else:\n print(s.lower())\n\n\nif __name__ == \"__main__\":\n main()\n", "word = input()\n\n\nc = list(filter(lambda x: x >= 97, map(ord, word)))\n\nif len(c) >= len(word) // 2 + len(word) % 2:\n print(word.lower())\nelse:\n print(word.upper())\n", "a = input()\r\nb = a.lower()\r\nl = []\r\nu = []\r\nfor i in range(len(a)):\r\n if a[i] == b[i]:\r\n l.append(1)\r\n else:\r\n u.append(1)\r\nif len(l) >= len(u):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "q=input()\r\nw=['q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m']\r\ns=0\r\nfor i in range(len(q)):\r\n if w.count(q[i])==1:\r\n s+=1\r\nif s>=len(q)-s: q=q.lower()\r\nelse: q=q.upper()\r\nprint(q)\r\n", "string = input()\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\n \r\nfor a in string:\r\n # converting to uppercase.\r\n if (a.isupper()) == True:\r\n count1 += 1\r\n\r\n # converting to lowercase.\r\n elif (a.islower()) == True:\r\n count2 += 1\r\n\r\nif count1==count2:\r\n print(string.lower())\r\nelif count1>count2:\r\n print(string.upper())\r\nelif count1<count2:\r\n print(string.lower())\r\n ", "a = input()\r\nb = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nc = b.lower()\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(a)):\r\n if a[i] in b:\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 > c2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "n,c,m=input(),0,0\nfor i in n:\n m+=1\n if i.lower()>i:c+=1\nprint(n.upper() if m//2<c else n.lower())\n", "word=input()\r\ndef lowcap(word):\r\n low=[]\r\n up=[]\r\n for i in word:\r\n if i.isupper():\r\n up.append(i)\r\n elif i.islower():\r\n low.append(i)\r\n if len(low)>=len(up):\r\n print(word.lower())\r\n elif len(up)>len(low):\r\n print(word.upper())\r\nlowcap(word)", "s = input()\nc = 0\nfor x in s:\n c += 1 if x.isupper() else 0\nif c>len(s)//2:\n print(s.upper())\nelse:\n print(s.lower())\n", "st=str(input())\r\nl=0\r\nu=0\r\nfor i in st:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif(u>l):\r\n st1=st.upper()\r\nelse:\r\n st1=st.lower()\r\nprint(st1)\r\n ", "s = input()\r\nlists = [i for i in s]\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor i in lists:\r\n if i.isupper():\r\n count_upper += 1\r\n if i.islower():\r\n count_lower += 1\r\n\r\nif count_upper > count_lower:\r\n print(s.upper())\r\nif count_upper < count_lower or count_upper == count_lower:\r\n print(s.lower())", "word = input()\nnumer_of_lower_case = 0\nnumer_of_upper_case = 0\n\nfor char in word:\n if char.isupper():\n numer_of_upper_case += 1\n else:\n numer_of_lower_case += 1\n\nif numer_of_lower_case == numer_of_upper_case:\n print(word.lower())\n\nelif numer_of_lower_case > numer_of_upper_case:\n print(word.lower())\nelse:\n print(word.upper())\n ", "s=input();l=u=0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n else:l+=1\r\nprint(s.upper()if u>l else s.lower())\r\n", "s = input()\r\n\r\nlower = sum(map(str.islower, s))\r\nupper = sum(map(str.isupper, s))\r\n\r\nif lower < upper:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\na=s.lower()\r\nn=0\r\nfor i in range(len(a)):\r\n if s[i]==a[i]:\r\n n+=1\r\nif n>=len(s)/2:\r\n print(a)\r\nelse:\r\n print(s.upper())", "if __name__ == '__main__':\r\n string = input()\r\n counta = 0\r\n countaA = 0\r\n for s in string:\r\n if s.isupper():\r\n countaA += 1\r\n if s.islower():\r\n counta += 1\r\n \r\n res = \"\"\r\n if countaA <= counta:\r\n for k in string:\r\n res += k.lower()\r\n else:\r\n for k in string:\r\n res += k.upper()\r\n\r\n print(res)\r\n\r\n\r\n\r\n", "# Sarievo.\r\n# URL: https://codeforces.com/problemset/problem/59/A\r\n\r\nword = input()\r\nLC = 0\r\nfor ch in word:\r\n if ch.islower():\r\n LC += 1\r\n\r\n# if the number of uppercase letters is lesser equal to lowercase letters\r\nif len(word)-LC <= LC:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "\n\nif __name__ == '__main__':\n str1 = input()\n str2 = str1.upper()\n k = 0\n for i in range(len(str1)):\n if str1[i] == str2[i]:\n k += 1\n if len(str1) - k >= k:\n print(str1.lower())\n else:\n print(str2)\n\n\n\n", "n= input()\r\nlow=[]\r\nup=[]\r\nfor i in n:\r\n if i>='a' and i<='z':\r\n low.append(i)\r\n else:\r\n up.append(i)\r\nif len(low)>=len(up):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n\r\n", "x=str(input())\r\nlowercase_letters = [c for c in x if c.islower()]\r\nuppercase_letters=[c for c in x if c.isupper()]\r\nif len(lowercase_letters)>=len(uppercase_letters):\r\n print(x.lower())\r\nelse: \r\n print(x.upper()) \r\n\r\n", "a=input()\r\nc1,c2=0,0\r\nfor i in a:\r\n\tif i.isupper():\r\n\t\tc1+=1\r\n\telse:\r\n\t\tc2+=1\r\nif c1>c2:\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "word = input()\r\n\r\n# count the number of uppercase and lowercase letters in the word\r\nupper_count = sum(1 for letter in word if letter.isupper())\r\nlower_count = len(word) - upper_count\r\n\r\n# check which case to convert the word to\r\nif upper_count > lower_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "def word(string):\r\n countUp = 0\r\n countLo = 0\r\n for i in string:\r\n if(i.isupper()):\r\n countUp += 1\r\n else:\r\n countLo += 1\r\n if countUp > countLo:\r\n return string.upper()\r\n else:\r\n return string.lower()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n string = input()\r\n print(word(string))\r\n", "s = input()\r\nl,u = 0,0\r\nfor i in s:\r\n if i.isupper():\r\n u += 1\r\n else:\r\n l +=1\r\n \r\nif l >u or l==u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "s = input()\r\na = list(s)\r\nup = low = 0\r\nfor i in a:\r\n if 'a' <= i <= 'z':\r\n low += 1\r\n else:\r\n up += 1\r\nif low < up:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nlowercase=0\r\nuppercase=0\r\nfor item in s:\r\n if item.isupper():\r\n uppercase+=1\r\n else:\r\n lowercase+=1\r\nif uppercase>lowercase:\r\n s=s.upper()\r\n print(s)\r\nelif uppercase<lowercase:\r\n s=s.lower()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)", "n = input()\r\nupper = []\r\nlower = []\r\nmyword = []\r\nfor x in n:\r\n upper.append(x.upper())\r\n lower.append(x.lower())\r\n myword.append(x)\r\n\r\nsum_upper = 0\r\nfor y in myword:\r\n if y in upper:\r\n upper.remove(y)\r\n sum_upper += 1\r\n\r\nsum_lower = 0\r\nfor y in myword:\r\n if y in lower:\r\n lower.remove(y)\r\n sum_lower += 1\r\n\r\nif sum_lower >= sum_upper:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "a=input()\r\nx=0\r\nfor i in a:\r\n if(i.islower()):\r\n x+=1\r\nprint([a.upper(),a.lower()][x>=len(a)/2])\r\n\r\n", "def main():\r\n word = input()\r\n lower_case = 0\r\n\r\n for char in word:\r\n if char.islower():\r\n lower_case += 1\r\n\r\n if lower_case >= len(word) / 2:\r\n conversion_function = str.lower\r\n else:\r\n conversion_function = str.upper\r\n\r\n word = ''.join(conversion_function(char) for char in word)\r\n print(word)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "str = input()\r\ndef uper_lower(s):\r\n count = 0\r\n count2 = 0\r\n result = s\r\n for i in range(len(s)):\r\n if (s[i] >= \"A\") and (s[i] <= \"Z\"):\r\n count += 1\r\n else:\r\n count2 += 1\r\n if count == count2:\r\n return result.lower()\r\n elif count > count2:\r\n return result.upper()\r\n elif count < count2:\r\n return result.lower()\r\nprint(uper_lower(str))", "In=input()\r\nif(sum([str(i).isupper() for i in In])>len(In)/2):\r\n print(In.upper())\r\nelse:\r\n print(In.lower())", "def mix(string):\r\n l=0\r\n u=0\r\n for i in range(len(string)):\r\n if string[i].islower():\r\n l=l+1\r\n elif string[i].isupper():\r\n u=u+1\r\n if u>l:\r\n return string.upper()\r\n elif l>u:\r\n return string.lower()\r\n else:\r\n return string.lower()\r\nstring=input()\r\nprint(mix(string))\r\n ", "word = input()\r\na = 0\r\nfor i in word:\r\n if i.isupper() :\r\n a +=1\r\n else:\r\n a -=1\r\nif a >0 :\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n", "def correct_word(s):\r\n # Count the number of uppercase and lowercase letters in the word\r\n uppercase_count = sum(1 for char in s if char.isupper())\r\n lowercase_count = len(s) - uppercase_count\r\n\r\n # If there are more uppercase letters, convert the word to uppercase; otherwise, to lowercase\r\n if uppercase_count > lowercase_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\nword = input()\r\n\r\ncorrected_word = correct_word(word)\r\nprint(corrected_word)\r\n", "buyult = 0\r\nkucult = 0\r\nkelime = input()\r\nfor i in range(len(kelime)):\r\n if kelime[i] == kelime[i].upper():\r\n buyult += 1\r\n else:\r\n kucult += 1\r\nif kucult >= buyult:\r\n print(kelime.lower())\r\nelse:\r\n print(kelime.upper())\r\n", "n = input()\r\n\r\nc1 = sum(1 for i in n if i.isupper())\r\nc2 = len(n)-c1\r\n\r\nn = (n.upper() if c1 > c2 else n.lower())\r\n\r\nprint(n)", "t=input()\r\ncountlower=0\r\ncountupper=0\r\nfor i in t:\r\n if i.islower():\r\n countlower+=1\r\n else:\r\n countupper+=1\r\nif countlower>=countupper:\r\n print(t.lower())\r\nelse:\r\n print(t.upper())", "a=input()\r\nb=0\r\nc=0\r\nfor i in range(0,len(a)):\r\n if a[i]==a[i].upper():\r\n b=b+1\r\n else:\r\n c=c+1\r\nif b>c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "lowercase = \"qwertyuiopasdfghjklzxcvbnm\"\r\nuppercase = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\n\r\nl_counter = 0\r\nu_counter = 0\r\ns = input(\"\")\r\n\r\nfor c in s:\r\n if c in lowercase:\r\n l_counter += 1\r\n if c in uppercase:\r\n u_counter += 1\r\n\r\nprint(s.upper() if (u_counter > l_counter) else s.lower())\r\n", "word = str(input())\r\n\r\nupper = 0\r\nlower = 0\r\nfor w in word:\r\n if w.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\n\r\nif lower >= upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\nn = len(s)\r\nlower = 0\r\nupper = 0\r\nfor i in range(n):\r\n if(s[i] >= 'a' and s[i] <= 'z'):\r\n lower = lower+1\r\n else:\r\n upper = upper + 1\r\nif(lower > upper):\r\n print(s.lower())\r\nelif(lower < upper):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def n_lower_chars(string):\r\n return sum(map(str.islower, string))\r\ndef n_upper_chars(string):\r\n return sum(map(str.isupper, string))\r\n\r\nn=str(input())\r\nk=n_lower_chars(n)\r\nl=n_upper_chars(n)\r\nif(l>k):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "t=input()\nctl=ctu=0\nfor i in t:\n if i.islower():\n ctl+=1\n elif i.isupper():\n ctu+=1\nif ctl>ctu:\n print(t.lower())\nelif ctu>ctl:\n print(t.upper())\nelif ctl==ctu:\n print(t.lower())\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled29.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1MxQzYiYxXIMTCFfeiimCApsqRZvdY10T\n\"\"\"\n\nword = input()\n\nlower = 0\nupper = 0\n\nfor char in word:\n if char.isupper():\n upper += 1\n else:\n lower += 1\nif upper > lower:\n word = word.upper()\nelse:\n word = word.lower()\n\nprint(word)", "#a, k = input(\"\").split()\r\ns = input(\"\")\r\nanother_s = s.lower()\r\n\r\nupper_number = 0\r\nlower_number = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i-1] == another_s[i-1]:\r\n lower_number+=1\r\n\r\n else:\r\n upper_number+=1\r\n\r\nif upper_number <= lower_number:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n#problem link https://codeforces.com/problemset/problem/59/A", "s=input()\r\nd=0\r\nfor i in range(len(s)):\r\n if 64<ord(s[i])<91:\r\n d+=1\r\nif d>len(s)-d:\r\n print(s.upper())\r\nelse:print(s.lower())\r\n", "n=str(input())\nlower=0\nupper=0\nfor i in n:\n if (i.islower()):\n lower+=1\n \n else:\n upper+=1\n \nif upper>lower:\n print(n.upper())\nelse:\n print(n.lower())\n\t\t \t \t \t\t\t \t\t \t \t \t \t\t \t \t", "a=input()\r\ns=0\r\nk=0\r\nfor i in a:\r\n if i.isupper():\r\n s+=1\r\n else:\r\n k+=1\r\nif s==k:\r\n print(a.lower())\r\nelif s>k:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n", "sa = input()\r\nlc = sum(1 for ca in sa if ca.islower())\r\nuc = sum(1 for ca in sa if ca.isupper())\r\n\r\nif uc > lc: \r\n print(sa.upper())\r\nelse: \r\n print(sa.lower())", "s= input()\r\nlowerc=sum(1 for c in s if c.islower())\r\nupperc=sum(1 for c in s if c.isupper())\r\nif upperc>lowerc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nl = 0\r\nu = 0\r\nfor ele in s:\r\n\tif(ele.islower()):\r\n\t\tl+=1\r\n\telif(ele.isupper()):\r\n\t\tu+=1\r\nif(l>=u):\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())\r\n\r\n\r\n", "def isupper(a):\n\tif a == a.upper():\n\t\treturn True\n\treturn False\n\ns = input()\nupper = 0\nlower = 0\nfor a in s: \n\tif isupper(a):\n\t\tupper +=1\n\telse:\n\t\tlower +=1\nif upper > lower:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n\n", "x=input()\r\nl,u=0,0\r\nfor i in range(len(x)):\r\n\tif(x[i].isupper()):\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif l>=u:\r\n\tprint(x.lower())\r\nelse:\r\n\tprint(x.upper())", "word = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor x in word:\r\n if(x.islower()):\r\n count1 += 1\r\n elif(x.isupper()):\r\n count2 += 1\r\n if count1 >= count2:\r\n word = word.lower()\r\n else:\r\n word = word.upper()\r\n\r\nprint(word)", "t =input()\r\nc=[]\r\nl=[]\r\nfor i in (t):\r\n if i.isupper():\r\n c+=i\r\n\r\nfor r in (t):\r\n if r.islower():\r\n l+=r\r\n\r\nif len(l)>len(c):\r\n print(t.lower())\r\nelif len(c)>len(l):\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "t=input()\r\nnM=0\r\nnm=0\r\nfor k in t:\r\n if(k.isupper()):\r\n nM+=1\r\n else:\r\n nm+=1\r\nif(nM>nm):\r\n print(t.upper())\r\nelse:\r\n print(t.lower())\r\n", "# from math import gcd, log, floor, ceil, floor\r\nfrom sys import stdin, stdout\r\n\r\nstdStr = lambda: stdin.readline()\r\nstdInt = lambda: int(stdin.readline())\r\nstdOut = lambda x: stdout.write(str(x))\r\n\r\n\r\n# ........................................\r\ndef quick_sort(nums):\r\n if len(nums) <= 1:\r\n return nums\r\n else:\r\n pivot = nums[0]\r\n less = [int(i) for i in nums[1:] if i <= pivot]\r\n high = [int(i) for i in nums[1:] if i > pivot]\r\n\r\n return quick_sort(less) + [pivot] + quick_sort(high)\r\n\r\n\r\ndef brute_force(box):\r\n upper = 0\r\n lower = 0\r\n for i in box:\r\n if i.islower():\r\n lower += 1\r\n elif i.upper():\r\n upper += 1\r\n\r\n # print(upper, lower)\r\n if upper > lower:\r\n stdOut(box.upper()+\"\\n\")\r\n else:\r\n stdOut(box.lower()+\"\\n\")\r\n\r\n\r\ndef solve():\r\n s = input()\r\n brute_force(s)\r\n # nums = list(map(int, stdStr().split()))\r\n # n, m = map(int, stdStr().split())\r\n\r\n\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 # check()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "string= str(input())\r\nF={\"UPPER_CASE\":0, \"LOWER_CASE\":0}\r\nfor s in string:\r\n if s.isupper():\r\n F[\"UPPER_CASE\"]+=1\r\n elif s.islower():\r\n F[\"LOWER_CASE\"]+=1\r\n else:\r\n pass\r\n\r\nl=len(string)\r\n\r\nif(F[\"UPPER_CASE\"]>l/2):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "def word():\r\n\ts = input()\r\n\t# hoUse > house, maTRIx > matrix, ViP > VIP\r\n\tu_count = 0\r\n\tl_count = 0\r\n\tk = s.lower()\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] == s[i].upper():\r\n\t\t\tu_count += 1\r\n\r\n\t\tif s[i] == s[i].lower():\r\n\t\t\tl_count += 1\r\n\t\r\n\tif u_count <= l_count:\r\n\t\treturn s.lower()\r\n\t\r\n\telif u_count > l_count:\r\n\t\treturn s.upper()\r\n\t\t\r\n\t\r\n\t\r\n\r\nprint(word())\r\n", "s=input()\r\nl=0\r\nu=0\r\nfor i in s:\r\n if i<\"a\" or i>\"z\":\r\n l+=1\r\n if i<\"A\" or i>\"Z\":\r\n u+=1\r\nif l<=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\ns_upper=0\r\ns_lower=0\r\nfor val in s:\r\n if val.isupper():\r\n s_upper+=1\r\n else:\r\n s_lower+=1\r\n# print(s_upper)\r\n# print(s_lower)\r\nif s_upper>s_lower:\r\n print(s.upper())\r\nelif s_upper<s_lower:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s=list(input())\na=b=0\nst=\"\"\nfor i in range(len(s)):\n\tif s[i].isupper():\n\t\ta=a+1\n\t\tst=st+s[i]\n\telse:\n\t\tb=b+1\n\t\tst=st+s[i]\nif a>b:\n\tprint(st.upper())\nelse:\n\tprint(st.lower())\n\t\n \t \t \t\t\t \t\t \t\t\t\t \t \t\t", "def main():\r\n stream = input()\r\n upper = 0\r\n lower = 0\r\n for letter in stream:\r\n if letter.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n if upper > lower:\r\n ans = stream.upper()\r\n else:\r\n ans = stream.lower()\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nlower_count=0\r\nupper_count=0\r\nfor i in s:\r\n if i.isupper():\r\n upper_count+=1\r\n else:\r\n lower_count+=1\r\n \r\nif upper_count>lower_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def solve(s): \n l = map(lambda c: 1 if c.islower() else 0, list(s))\n return s.lower() if sum(l)>=( len(s)/2) else s.upper() \n\n\nif __name__ == '__main__': \n\n s = input()\n print(solve(s))\n", "s=input()\r\ncount=0\r\ncap=[\"A\",\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"H\",\"I\",\"J\",\"K\",\"L\",\"M\",\"N\",\"O\",\"P\",\"Q\",\"R\",\"S\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\",\"Z\"]\r\nfor i in s:\r\n if i in cap:\r\n count+=1\r\nif count>len(s)-count:\r\n ans=s.upper()\r\n print(ans)\r\nelse:\r\n ans=s.lower()\r\n print(ans)\r\n ", "word=input()\r\nu=sum(1 for char in word if char.isupper())\r\nl=len(word)-u\r\nif u>l:\r\n c=word.upper()\r\nelse:\r\n c=word.lower()\r\nprint(c)", "k=input()\r\nc1=0\r\nc2=0\r\nfor i in k:\r\n if i>=\"a\" and i<=\"z\":\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\nif c1>=c2:\r\n print(k.lower())\r\nelse:\r\n print(k.upper())\r\n ", "a = input()\r\ns = 0\r\nd = 0\r\na2 = a.lower()\r\na3 = a.upper()\r\nfor i in range(len(a)):\r\n if a2[i] == a[i]:\r\n s = s + 1\r\n if a3[i] == a[i]:\r\n d = d + 1\r\nif(s > d):\r\n print(a2)\r\nelif(d > s):\r\n print(a3)\r\nelse: \r\n print(a2)", "s=input()\r\nlow=list(filter(lambda c: c.islower(),s))\r\nif len(low)>=len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "# Slova\r\ns = input();\r\nsA = \"\";\r\nsa = \"\";\r\ns1 = 0;\r\ns2 = len(s) // 2;\r\nfor i in s:\r\n sA += i.upper(); \r\n sa += i.lower();\r\n if i >= 'A' and i <= 'Z':\r\n s1 += 1\r\nif s1 > s2: print(sA);\r\nelse: print(sa);", "s = input()\n\nminus = 0\nmayus = 0\n\nfor c in s:\n if c.islower():\n minus += 1\n else:\n mayus += 1\n\nif minus >= mayus:\n s = s.lower()\nelse:\n s = s.upper()\n \nprint(s)\n \t \t \t\t\t \t\t\t\t\t\t\t\t\t \t\t \t\t \t \t", "s=input()\r\nlength=len(s)\r\nif length>100:\r\n print('wrong input')\r\n exit\r\nupper=0\r\nfor i in range(0,length):\r\n if s[i]>='A' and s[i]<='Z':\r\n upper+=1\r\nif upper>length/2:\r\n print (s.upper())\r\nif upper<=length/2:\r\n print (s.lower())\r\n", "# HoUse\r\n# house\r\na = input()\r\nu = []\r\nl = []\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n u.append(a[i])\r\n else:\r\n l.append(a[i])\r\nif len(u) == len(l) or len(u)<len(l):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n\r\n\r\n", "s=input()\r\n(u,l)=(0,0)\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n s=s.upper()\r\nif(u<=l):\r\n s=s.lower()\r\nprint(s)\r\n", "a = input()\r\nu = ('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\nupper = 0\r\nlower = 0\r\nfor i in a:\r\n if i in u:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n a = a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a)", "string=input()\r\nd=1\r\nf=0\r\nfor i in string:\r\n if (i.islower()):\r\n d+=1\r\n else:\r\n f+=1\r\nif (d>f):\r\n print(string.lower()) \r\nelse:\r\n print(string.upper()) \r\n\r\n", "word = input()\n\nlowercase_num = 0\nuppercase_num = 0\n\nfor c in word:\n if c.islower():\n lowercase_num += 1\n else:\n uppercase_num += 1\n\nif lowercase_num >= uppercase_num:\n print(word.lower())\nelse:\n print(word.upper())\n", "n=input()\nchota=0\nwada=0\nfor i in n:\n\tif ord(i)>95:\n\t\tchota+=1\n\telse:\n\t\twada+=1\nif chota>wada:\n\tprint(n.lower())\nelif chota==wada:\n\tprint(n.lower())\nelif chota<wada:\n\tprint(n.upper())", "if __name__ == '__main__':\r\n s = str(input())\r\n up, low = 0, 0\r\n for x in s:\r\n if x == x.upper():\r\n up += 1\r\n else:\r\n low += 1\r\n print(s.upper()) if up > low else print(s.lower())\r\n", "# cook your dish here\r\ns=input()\r\nL=0\r\nU=0\r\nfor i in range(len(s)):\r\n if(s[i]>='A' and s[i]<='Z'):\r\n U=U+1\r\n else:\r\n L=L+1\r\nif(L>=U):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "word=input()\r\nuppers=0\r\nlowers=0\r\nfor i in word:\r\n if i.isupper() :\r\n uppers += 1\r\n else:\r\n lowers +=1\r\nif uppers > lowers:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "n=list(input())\r\na,b=0,0\r\nfor i in n:\r\n if i.isupper():\r\n a+=1\r\n elif i.islower():\r\n b+=1\r\nn=\"\".join(n)\r\nif b>=a:\r\n n=n.lower()\r\nelse:\r\n n=n.upper()\r\nprint(n)", "s=input()\r\nc=0\r\nl=0\r\nfor i in range(len(s)):\r\n if(ord(s[i])>=ord('A'))and(ord(s[i])<=ord('Z')):\r\n c=c+1\r\n else:\r\n l=l+1\r\nif(c>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "#count of upper case\r\n#count of lower case\r\nn=input()\r\nc=0\r\nfor i in n:\r\n if(i>='a' and i<='z'):\r\n c=c+1\r\nif(c==0):\r\n print(n)\r\nelif(len(n)-c<=len(n)/2 or len(n)==len(n)-c):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n \r\n\r\n ", "x = input()\r\ncapital,small,i = 0,0,0\r\nwhile i<len(x):\r\n if x[i].isupper()== True:\r\n capital+=1\r\n else:\r\n small+=1\r\n i+=1\r\n\r\nif small >=capital:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n", "word = input()\r\nupperList = []\r\nlowerList = []\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n upperList.append(i)\r\n else:\r\n lowerList.append(i)\r\n\r\nif len(upperList)>len(lowerList):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "c=input()\r\no=0\r\np=0\r\nu=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nfor i in range(len(c)):\r\n if c[i] in u:\r\n o=o+1\r\n else:\r\n p=p+1\r\nif o>p:\r\n print(c.upper())\r\nelse:\r\n print(c.lower())\r\n", "string = input()\r\n\r\nuc = 0\r\nlc = 0\r\n\r\nfor letter in string:\r\n\tif letter == letter.upper():\r\n\t\tuc += 1\r\n\telse:\r\n\t\tlc += 1\r\n\r\nif uc == lc:\r\n\tprint(string.lower())\r\nelif uc > lc:\r\n\tprint(string.upper())\r\nelse:\r\n\tprint(string.lower())\r\n", "s = input()\r\nif len(s) >= 1 and len(s) <= 100:\r\n\tlcc,ucc = 0,0\r\n\tfor i in s:\r\n\t\tif i.isupper() == True: ucc+=1\r\n\t\telse: lcc+=1\r\n \r\n\tif lcc >= ucc: s = s.lower()\r\n\telse: s = s.upper()\r\n\tprint(s)", "s=input()\r\ncnt1=cnt2=0\r\nif len(s)>=1 and len(s)<=100:\r\n for i in s:\r\n if i.islower():\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\n if cnt1>=cnt2:\r\n print(s.lower())\r\n else:\r\n print(s.upper())", "s=input()\r\nc=d=0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1\r\n elif i.islower():\r\n d+=1\r\nif c>d:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "\n\ndef count_uc(word):\n cnt = 0\n for i in word:\n if i.isupper():\n cnt += 1\n return cnt\n\nword = input()\nucCnt = count_uc(word)\nif ucCnt > len(word)//2:\n print(word.upper())\nelse:\n print(word.lower())", "word = input()\r\nnumUp = 0\r\nfor l in word:\r\n if l.isupper():\r\n numUp += 1\r\nif numUp > len(word)-numUp:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "str=input()\r\ncount = 0\r\nfor elem in str:\r\n if elem.isupper():\r\n count += 1\r\nlower=len(str)-count\r\nif count>lower:\r\n str=str.upper()\r\nelse:\r\n str=str.lower()\r\nprint(str)", "s = input()\r\nx = 0\r\ny = 0\r\nfor i in s:\r\n if(i.islower()):\r\n x+=1\r\n elif(i.isupper()):\r\n y+=1\r\nif y>x:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nup=0\r\nlow=0\r\nfor char in s:\r\n if char.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "k=input()\r\nlower=0\r\nupper=0\r\nfor i in k:\r\n if i.isupper():\r\n upper+=1\r\n if i.islower():\r\n lower+=1\r\nif upper>lower:\r\n print(k.upper())\r\nelif upper<=lower:\r\n print(k.lower())\r\n ", "def main():\n s = input()\n\n small_letters = 0\n for c in s:\n if ord(\"a\") <= ord(c) <= ord(\"z\"):\n small_letters += 1\n\n upp_letters = len(s) - small_letters\n if upp_letters > small_letters:\n print(s.upper())\n else:\n print(s.lower())\n\n\nmain()\n", "word = input()\n\nlowercase = 'abcdefghijklmnopqrstuvwxyz'\n\nlower_count = [letter for letter in word if letter in lowercase]\n\nif len(lower_count) >= len(word) - len(lower_count):\n print(word.lower())\nelse:\n print(word.upper())\n", "arr=list(input())\r\ny=len(arr)\r\ncou1,cou2=0,0\r\nfor i in range(y):\r\n k=ord(arr[i])\r\n if(k>=65 and k<=90):\r\n cou1=cou1+1\r\n else:\r\n cou2=cou2+1 \r\n \r\nif(cou2>=cou1):\r\n for j in range(y):\r\n if(ord(arr[j])>=65 and ord(arr[j])<=90):\r\n arr[j]=chr(ord(arr[j])+32)\r\n \r\nelse:\r\n for k in range(y):\r\n if(ord(arr[k])>=97 and ord(arr[k])<=122):\r\n arr[k]=chr(ord(arr[k])-32)\r\n \r\nprint(\"\".join(arr))\r\n ", "# O(n) -> n = tamaño de palabra (letra in palabra)\r\npalabra = input()\r\n\r\nmayusculas = 0\r\nminusculas = 0\r\n\r\nfor letra in palabra: \r\n if letra.isupper():\r\n mayusculas += 1\r\n else:\r\n minusculas += 1\r\nif mayusculas > minusculas:\r\n palabra = palabra.upper()\r\nelse:\r\n palabra = palabra.lower()\r\n\r\nprint(palabra)", "word = input()\r\nlowercase = 0\r\nuppercase = 0\r\nfor char in word:\r\n if (char.islower()):\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\nif (lowercase == uppercase):\r\n print(word.lower())\r\n exit(0)\r\nelse:\r\n if (lowercase > uppercase):\r\n print(word.lower())\r\n exit(0)\r\n else:\r\n print(word.upper())\r\n exit(0)\r\n", "s=input()\r\nl=s.lower()\r\nu=s.upper()\r\nn=len(s)\r\nlc,uc=0,0\r\nfor i in range(n):\r\n if s[i]==l[i]:\r\n lc+=1\r\n else:\r\n uc+=1\r\nif lc>=uc:\r\n print(l)\r\nelse:\r\n print(u)", "s= input()\r\nl=len(s)\r\ncounter=0\r\nfor i in s:\r\n if i>= 'a' and i<='z':\r\n counter = counter + 1\r\nif counter >= (l/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\nsl = 0\r\nsu = 0\r\nfor i in range(len(s)):\r\n if s[i].lower() == s[i]:\r\n sl+=1\r\n elif s[i].upper() == s[i]:\r\n su+=1\r\nif sl>su:\r\n print(s.lower())\r\nelif su>sl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=list(input())\r\nc=0\r\nfor i in s:\r\n if i.isupper():\r\n c=c+1\r\n\r\ns2=\"\".join(s)\r\nif c>len(s)/2:\r\n print(s2.upper())\r\nelif c<len(s)/2 or c==len(s)/2 :\r\n print(s2.lower())\r\n", "import sys\r\n\r\nfor line in sys.stdin:\r\n upper = 0\r\n lower = 0\r\n for c in line:\r\n if c.isupper():\r\n upper += 1\r\n if c.islower():\r\n lower += 1\r\n if lower >= upper:\r\n line = line.lower()\r\n else:\r\n line = line.upper()\r\n print(line)\r\n", "s = str(input())\r\nb = len([i for i in s if i.isupper()])\r\nb1 = len(s) - b\r\nif b <= b1:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\nl, u = 0, 0\n\nfor lt in word:\n if lt.isupper():\n u += 1\n else:\n l += 1\n\nprint(word.lower() if l >= u else word.upper())", "class Solution():\n\n def letters_changed():\n word = input()\n upper_letters = 0\n\n for letter in word:\n if letter == letter.upper():\n upper_letters += 1\n return word.upper() if upper_letters*2 > len(word) else word.lower()\n\nif __name__ == '__main__':\n print(Solution.letters_changed())\n", "word = str(input())\r\nlow_count = 0\r\nfor i in word:\r\n if (i.islower()):\r\n low_count += 1\r\nif (low_count >= len(word)/2):\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)\r\n", "count = 0\r\ns = input()\r\nfor i in s:\r\n if ord(i) < 95:\r\n count += 1\r\n else:\r\n count -= 1\r\nif count > 0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=str(input())\r\nlow=0\r\nfor i in word:\r\n if i.islower():\r\n low+=1\r\nif len(word)-low<=low:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n\r\n", "n = input()\r\nuc = 0\r\nlc = 0\r\nfor i in n:\r\n if i.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\nif(uc>lc):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s=input()\r\nl=0\r\nb=0\r\nfor i in s:\r\n if 65<=ord(i)<=90:\r\n b+=1\r\n else:\r\n l+=1\r\nif l>=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a=input()\r\nlower=0\r\nupper=0\r\nfor i in a:\r\n if i.islower():\r\n lower=lower+1\r\n else:\r\n upper=upper+1\r\nif lower>=upper:\r\n c=a.lower()\r\nelse:\r\n c=a.upper()\r\nprint(c)\r\n", "s = input()\r\nhalf_of_strlen = len(s)//2\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n count += 1 \r\nif count == half_of_strlen and len(s)%2 == 0:\r\n output = s.lower()\r\nelif count > half_of_strlen:\r\n output = s.lower()\r\nelse:\r\n output = s.upper()\r\nprint(output)", "s = input()\ns2 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\ns1 = s2.lower()\nu,l = 0,0\nfor i in s:\n if i in s2:\n u += 1\n else:\n l += 1\nif l >= u:\n print(s.lower())\nelse:\n print(s.upper())", "s=input()\r\ncl,cu=0,0\r\nfor i in s:\r\n if i.isupper(): cu+=1\r\n else: cl+=1\r\nif cu<=cl: s=s.lower()\r\nelse: s=s.upper()\r\nprint(s)", "a=input()\r\nb='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nx=0\r\ny=0\r\n\r\nn=len(a)\r\nfor i in range(n):\r\n if a[i] in b:\r\n x=x+1\r\n else:\r\n y=y+1\r\n\r\nif x>y:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\nl=0\nfor c in s:\n if c.islower():\n l=l+1\nif(len(s)-l>l):\n print(s.upper())\nelse:\n print(s.lower())\n\n", "str = input()\r\n\r\nn = len(str)\r\nupper_count = 0\r\nfor i in range(n):\r\n if str[i] == str[i].upper():\r\n upper_count += 1\r\n\r\nif upper_count > n/2:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "# Read the input word\r\nword = input()\r\nuppercase_count = 0\r\nlowercase_count = 0\r\nfor letter in word:\r\n if letter.isupper():\r\n uppercase_count += 1\r\n else:\r\n lowercase_count += 1\r\nif uppercase_count > lowercase_count:\r\n corrected_word = word.upper()\r\nelse:\r\n corrected_word = word.lower()\r\nprint(corrected_word)\r\n", "v=input();print([v.lower(),v.upper()][sum(x<'['for x in v)*2>len(v)])", "s = list(input())\n\nlows = list(map(str.lower, s)) \n\nlow = 0\nhig = 0\n\nfor i in range(len(s)):\n if s[i] == lows[i]:\n low = low + 1\n else:\n hig = hig + 1\n\nif hig > low:\n print(str.upper(''.join(s)))\nelse:\n print(str.lower(''.join(s)))\n", "st = str(input())\r\nsl_l = st.upper()\r\ncnt = 0\r\nfor i in range(len(st)):\r\n if st[i] != sl_l[i]:\r\n cnt += 1\r\nif cnt >= len(st) - cnt:\r\n print(st.lower())\r\nelse:\r\n print(st.upper())\r\n", "word=list(input())\r\nu,l=0,0\r\nfor letter in word:\r\n i=ord(letter)\r\n if(i<97):\r\n u+=1\r\n else:\r\n l+=1\r\nr_word=''\r\nif(u>l):\r\n for letter in word:\r\n r_word+=letter.upper()\r\nelse:\r\n for letter in word:\r\n r_word+=letter.lower()\r\nprint(r_word)", "import string\r\ns=input()\r\nup=0\r\nlow=0\r\nfor i in s:\r\n if(i in string.ascii_lowercase):\r\n low+=1\r\n if(i in string.ascii_uppercase):\r\n up+=1\r\nif(up>low):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nx = 0\r\nfor i in range(len(s)):\r\n if s[i:i+1].isupper():\r\n x +=1\r\nif x>len(s)/2:\r\n print( s.upper())\r\nelse:\r\n print( s.lower())\r\n ", "word = input()\nupper = 0\nlower = 0\nfor i in word:\n\tif i.islower():\n\t\tlower += 1\n\telif i.isupper():\n\t\tupper += 1\n\nif upper > lower:\n\tprint(word.upper())\nelse:\n\tprint(word.lower())\n\n", "def func(s):\r\n l1 = [x for k in [list(map(str, i)) for i in s] for x in k]\r\n upper, lower = [x for x in l1 if x.isupper()], [x for x in l1 if x.islower()]\r\n if len(upper) > len(lower):\r\n ans = [x.upper() for x in l1]\r\n else:\r\n ans = [x.lower() for x in l1]\r\n final = ''.join(ans)\r\n return final\r\n\r\n\r\nprint(func(input()))\r\n", "s = input()\nucount = lcount = 0\nfor i in s:\n if i.isupper():\n ucount+=1\n else:\n lcount+=1\nif ucount > lcount:\n print(s.upper())\nelse:\n print(s.lower())\n", "upper_count = 0\r\nlower_count = 0\r\nword = str(input())\r\nword_list = list(word)\r\nfor i in range(0, len(word)):\r\n if word_list[i].isupper() != True:\r\n lower_count = lower_count + 1\r\n else:\r\n upper_count = upper_count + 1\r\nif upper_count > lower_count:\r\n upper_word = word.upper()\r\n print(upper_word)\r\nelse:\r\n lower_word = word.lower()\r\n print(lower_word)", "a = input()\r\nup=0\r\ndown = 0\r\nfor i in a:\r\n if i==i.upper():\r\n up+=1\r\n else:\r\n down+=1\r\nif up>down:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "v=input()\r\nh=0\r\na=0\r\nfor i in v:\r\n if (i==i.lower()):\r\n h=h+1\r\n elif(i==i.upper()):\r\n a=a+1\r\nif(h>a):\r\n print(v.lower())\r\nif (h<a):\r\n print(v.upper())\r\nif(h==a):\r\n print(v.lower())", "string = input()\r\n\r\nlowercase_count = 0\r\nuppercase_count = 0\r\n\r\nfor char in string:\r\n if char.islower():\r\n lowercase_count = lowercase_count + 1\r\n else:\r\n uppercase_count = uppercase_count + 1\r\n\r\nif lowercase_count >= uppercase_count:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "s, c = input(), 0\nfor i in s:\n if i.isupper():\n c += 1\nprint(s.upper() if c > len(s)-c else s.lower())\n", "import string\r\ndef check(s):\r\n lc,uc=0,0\r\n for i in range(len(s)):\r\n if (s[i] in string.ascii_lowercase):\r\n lc=lc+1\r\n elif(s[i] in string.ascii_uppercase):\r\n uc=uc+1\r\n if(lc>uc or lc==uc):\r\n s= s.lower()\r\n else:\r\n s= s.upper()\r\n print(s)\r\n\r\ns=input()\r\ncheck(s)", "x = input()\r\nupc = 0\r\nlowc = 0\r\nfor i in range (len(x)) :\r\n if (x[i].isupper() == True) :\r\n upc+=1\r\n if (x[i].islower() == True) :\r\n lowc+=1\r\nif upc > lowc :\r\n print (x.upper())\r\nelse :\r\n print (x.lower())", "s = input()\r\nprint([s.lower(),s.upper()][sum(1 for item in s if item.isupper() == True) > len(s)/2])", "def main():\r\n\r\n word = input()\r\n lower, upper = 0, 0\r\n\r\n for char in word:\r\n if char.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\n if lower >= upper:\r\n word = word.lower()\r\n else:\r\n word = word.upper()\r\n\r\n for char in word:\r\n print(char, end=\"\") \r\n\r\nmain()", "n=(input())\r\nc=0\r\nc0=0\r\nfor i in n:\r\n if i.isupper():\r\n c=c+1\r\n else:\r\n c0=c0+1\r\nif c>c0:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "import string\r\nl = [i for i in string.ascii_lowercase]\r\nu = [i for i in string.ascii_uppercase]\r\ns = input()\r\nlowercase = 0\r\nuppercase = 0\r\nfor i in s:\r\n for x in l:\r\n if (i==x):\r\n lowercase = lowercase+1\r\nfor r in s:\r\n for y in u:\r\n if (r==y):\r\n uppercase = uppercase + 1\r\nif (lowercase<uppercase):\r\n s = s.upper()\r\n print(s)\r\nelse:\r\n s = s.lower()\r\n print(s)\r\n", "s=input()\r\np=0\r\nq=0\r\nfor i in s:\r\n if i>='a' and i<='z' :\r\n p=p+1\r\n else :\r\n q=q+1\r\nif p>=q :\r\n print(s.lower())\r\nelse :\r\n print(s.upper())", "def getWordComp(s):\r\n small_c = 0\r\n big_c = 0\r\n for letter in s:\r\n if letter.lower() == letter:\r\n small_c += 1\r\n else:\r\n big_c += 1\r\n\r\n if small_c == big_c:\r\n return s.lower()\r\n if small_c > big_c:\r\n return s.lower()\r\n if small_c < big_c:\r\n return s.upper()\r\n\r\n\r\ndef main():\r\n print(getWordComp(input()))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "word = input()\r\nlower = 0\r\nupper=0\r\nfor i in range (len(word)):\r\n if word[i].islower():\r\n lower += 1 \r\n else:\r\n upper+=1\r\nif lower >= upper:\r\n res = word.lower()\r\nelse:\r\n res =word.upper()\r\nprint(res)", "s = input()\r\nlow_cnt = 0\r\nup_cnt = 0\r\nfor el in s:\r\n if el.islower():\r\n low_cnt += 1\r\n else:\r\n up_cnt += 1\r\nif low_cnt>=up_cnt:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import string\nu = string.ascii_uppercase\nl = string.ascii_lowercase\ns = input()\ncu = cl = 0\nfor _ in s:\n if _ in u:\n cu += 1\n else:\n cl += 1\n\nif cu > cl:\n print(s.upper())\nelse:\n print(s.lower())", "word = input()\r\n\r\nl = 0\r\nu = 0\r\n\r\nfor i in word:\r\n if i.islower():\r\n l += 1\r\n elif i.isupper():\r\n u += 1\r\n\r\nif l > u:\r\n print(word.lower())\r\nelif u > l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "n = input()\r\nsize = len(n)\r\ncont_lower = 0\r\ncont_upper = 0\r\nwon = \"\"\r\nfor letter in n:\r\n if str(letter).islower():\r\n cont_lower += 1\r\n else:\r\n cont_upper += 1\r\nif cont_lower == cont_upper:\r\n print(n.lower())\r\nelif cont_upper > cont_lower:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "a = input()\r\nb = 0\r\nfor x in a:\r\n if x.isupper():\r\n b += 1\r\nif b > len(a) //2:\r\n a = a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a)", "#! /usr/bin/env python\n\n# Header\nimport sys\n\n# Input \nGet_input = input()\n\n# Main Code\ndef main(Get_input):\n\tChr_upper,Chr_lower=0,0\n\tfor i in Get_input:\n\t\tif i.isupper():\n\t\t\tChr_upper+=1\n\t\telif i.islower():\n\t\t\tChr_lower+=1\n\n\tif Chr_lower == Chr_upper:\n\t\tprint(Get_input.lower())\n\telif Chr_lower > Chr_upper:\n\t\tprint(Get_input.lower())\n\telse:\n\t\tprint(Get_input.upper())\n\nif __name__=='__main__':\n\tmain(Get_input)", "n = input()\r\ncountUpper = 0\r\nfor i in n:\r\n\tif i.upper() == i: countUpper += 1\r\nif countUpper > len(n) - countUpper: print(n.upper())\r\nelse: print(n.lower())", "\r\nA = input()\r\nB = 0\r\nfor N in A:\r\n if N.isupper():\r\n B += 1\r\n\r\nif B > len(A) // 2:\r\n A = A.upper()\r\nelse:\r\n A = A.lower()\r\n\r\nprint(A)\r\n", "s=input()\r\ncountu=0\r\ncountl=0\r\nfor i in s:\r\n if(i.isupper()):\r\n countu+=1\r\n else:\r\n countl+=1\r\nif(countu>countl):\r\n print(s.upper())\r\nelif(countu<=countl):\r\n print(s.lower())\r\n ", "w = input()\r\n\r\nlow = 0 \r\n\r\nupp = 0\r\n\r\nfor i in w:\r\n\r\n if i == i.upper():\r\n\r\n upp +=1\r\n\r\n else:\r\n low+=1\r\n\r\nif upp > low:\r\n print(w.upper())\r\n\r\nelse:\r\n print(w.lower())", "def solution():\r\n\r\n s = input()\r\n \r\n lowers = 0\r\n\r\n uppers = 0\r\n \r\n for i in s:\r\n\r\n if i.islower():\r\n\r\n lowers += 1\r\n\r\n else:\r\n\r\n uppers += 1\r\n\r\n if uppers > lowers:\r\n\r\n print(s.upper())\r\n \r\n else:\r\n\r\n print(s.lower())\r\n\r\n\r\nsolution()\r\n", "n=input()\r\ncountupp=0\r\ncountlow=0\r\nif(len(n)<=100):\r\n for i in range(0,len(n),1):\r\n if(n[i]>='a' and n[i]<='z'):\r\n countlow+=1\r\n else:\r\n countupp+=1\r\n if(countlow==countupp):\r\n print(n.lower())\r\n elif(countlow>countupp):\r\n print(n.lower())\r\n else:\r\n print(n.upper())\r\nelse:\r\n exit", "ch=input()\r\nc1=0\r\nc2=0\r\nfor s in ch:\r\n if s in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\r\n c1=c1+1\r\n if s in'abcdefghijklmnopqrstuvwxyz':\r\n c2=c2+1\r\nif(c1>c2):\r\n print(ch.upper())\r\nelse:\r\n print(ch.lower())\r\n", "s = input()\r\nprint(s.lower() if 2*len(list(filter(lambda x: x.islower(), [y for y in s]))) >= len(s) else s.upper())", "import sys\r\nimport fileinput\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\nword = get_string()\r\n\r\nlower_lett = sum( 1 for c in word if c.islower())\r\n\r\nif lower_lett >= len(word)/2:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\ns1 = list(s)\r\n\r\nlow = 0\r\nup = 0\r\n\r\nfor i in s:\r\n if str(i).isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif low == up:\r\n print(s.lower())\r\nelif low > up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nc,l=0,0\r\nfor i in s:\r\n if i.isupper():c+=1\r\n else:l+=1\r\nprint(s.upper() if c>l else s.lower())", "st = input()\r\ns = [str(st[i]) for i in range(len(st))]\r\nx= len(s)\r\nu=0\r\nl=0\r\nfor i in range(1,x+1):\r\n if s[i-1]>='A' and s[i-1]<='Z':\r\n u+=1\r\n\r\n elif s[i-1]>='a' and s[i-1]<='z':\r\n l+=1\r\n\r\n# print(u,l,x)\r\nif u==(x):\r\n print(st.upper())\r\nelif l==(x):\r\n print(st.lower())\r\nelif u == l:\r\n print(st.lower())\r\nelif l>u:\r\n print(st.lower())\r\nelif u>l:\r\n print(st.upper())", "n=input()\r\nn1=0\r\nn2=0\r\nfor i in n:\r\n if(i.islower()):\r\n n1+=1\r\n else:\r\n n2+=1\r\nif(n2>n1):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "word=input()\r\nuppercase_count=sum(1 for letter in word if letter.isupper())\r\nlowercase_count=len(word)-uppercase_count\r\nif uppercase_count>lowercase_count:\r\n corrected_word=word.upper()\r\nelse:\r\n corrected_word=word.lower()\r\nprint(corrected_word)", "ui = input()\r\nuc, lc = 0, 0\r\nfor i in range(len(ui)):\r\n if ui[i].isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\nif uc == lc or uc < lc:\r\n print(ui.lower())\r\nelse:\r\n print(ui.upper())", "n = input()\r\ncount = 0\r\nfor c in n:\r\n if \"A\" <= c <= \"Z\":\r\n count += 1\r\nif count > len(n) - count:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "a = input()\r\nb = 0\r\nfor i in a:\r\n if(i.islower()):\r\n b = b + 1\r\nx = (len(a)/2)\r\nif b >= x:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\ns1=s.lower()\ns2=s.upper()\nv1=v2=0\nfor i in range(0,len(s)):\n v1+=s[i]!=s1[i]\n v2+=s[i]!=s2[i]\nprint([s1,s2][v1>v2])\n", "s=input()\r\nupp=0\r\nlow=0\r\nfor i in range(len(s)):\r\n if 'a'<=s[i]<='z':\r\n low+=1\r\n else:\r\n upp+=1\r\nif low<upp:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n", "s = input()\r\nc = 0\r\ncs = 0\r\nfor i in s:\r\n if i.isupper():\r\n c +=1\r\n else:\r\n cs +=1\r\nif c > cs:\r\n sr = s.upper()\r\nelse:\r\n sr = s.lower()\r\nprint(sr)", "s = input()\r\nn = len(s)\r\nc = 0\r\nc1 = 0\r\nfor i in range(0,n):\r\n if((s[i]>='a') and (s[i]<='z')):\r\n c = c+1\r\n if((s[i]>='A') and (s[i]<='Z')):\r\n c1 = c1+1\r\nif((c==c1) or (c>c1)):\r\n s = s.lower()\r\nelif(c<c1):\r\n s = s.upper()\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", "s=str(input())\r\nm=len(s)\r\nk=0\r\nfor i in range(0,m):\r\n S=s[i:i+1]\r\n if S.istitle()==True:\r\n k+=1\r\nif k>m-k:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "string = input()\r\nif len([1 for _ in string if ord(_) >= ord('a')])-len(string)/2 >= 0:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "string = str(input())\r\nsmall = 0\r\ncap = 0\r\nfor i in string:\r\n if 65 <= ord(i) <= 90:\r\n cap += 1\r\n elif 97 <= ord(i) <= 122:\r\n small += 1\r\n\r\nif cap > small:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "#le site du bfs c'est jylen algo\r\n\r\nimport sys\r\n\r\n\r\ndef rl():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef rn():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef ri():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef rln(n):\r\n l = [None] * n\r\n for i in range(n):\r\n l[i] = int(rl())\r\n return l\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n a = input()\r\n c_l = 0\r\n for e in a:\r\n if e.islower():\r\n c_l += 1\r\n c_u = len(a) - c_l\r\n print(a.lower() if c_l >= c_u else a.upper())\r\n", "n = input()\r\nm = sum(map(str.islower,n))\r\nk = sum(map(str.isupper,n))\r\nif m >= k:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\nupperSum = sum([1 for x in word if x.lower() != x])\r\nprint(word.lower() if upperSum <= len(word) - upperSum else word.upper())", "s = input()\ncount = 0\n\nfor i in s:\n\tcount += abs(ord(i) - 65)//32\n\nfor j in range(len(s)):\n\tletter = abs(ord(s[j]) - 65)%32 + 65\n\tif count >= len(s)-count:\n\t\tprint(chr(letter + 32), end=\"\")\n\telse:\n\t\tprint(chr(letter), end=\"\")\n", "str = input()\r\n\r\nc_large = 0;\r\nc_little = 0;\r\n\r\nfor s in str:\r\n if s.islower():\r\n c_little = c_little + 1\r\n elif s.isupper():\r\n c_large = c_large + 1\r\n \r\nif c_little > c_large:\r\n print(str.lower())\r\nelif c_little < c_large:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "n=input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(n)):\r\n \r\n if(n[i]>='a' and n[i]<='z'):\r\n lower+=1\r\n \r\n elif(n[i]>='A' and n[i]<='Z'):\r\n upper+=1\r\nif lower >= upper:\r\n print(n.lower())\r\nelif upper > lower:\r\n print(n.upper())\r\n", "word = input()\r\nlower_letter_count = (sum(map(str.islower, word)))\r\nupper_letter_count = (sum(map(str.isupper, word)))\r\n\r\nif upper_letter_count > lower_letter_count:\r\n print(word.upper())\r\nelif upper_letter_count < lower_letter_count:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())\r\n\r\n\r\n", "def solver(text):\r\n lc=0;hc=0\r\n for i in text:\r\n if i.islower():\r\n lc+=1\r\n else:\r\n hc+=1\r\n if lc==hc or lc > hc:\r\n return text.lower()\r\n return text.upper()\r\n\r\nif __name__=='__main__':\r\n print(solver(input()))\r\n ", "a = input()\r\ns, t = 0, 0\r\nfor i in a:\r\n if(i.isupper()):\r\n s += 1\r\n else:\r\n t += 1\r\nif(s > t):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "inp=input()\r\nup=0\r\ndown=0\r\nfor i in inp:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n down+=1\r\nif down<up:\r\n out=inp.upper()\r\nelse:\r\n out=inp.lower()\r\nprint(out)", "a=\"abcdefghijklmnopqrstuvwxyz\"\r\nb=a.upper()\r\ns=input()\r\nc,d=0,0\r\nfor i in s:\r\n if i in a:\r\n c+=1\r\n else:\r\n d+=1\r\nif d>c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=set(\"abcdefghijklmnopqrstuvwxyz\")\r\nb=set(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\ns=input()\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if i in a:\r\n c1+=1\r\n else:\r\n c2+=1\r\nif(c1>=c2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nuppercase_count = sum(1 for char in s if char.isupper())\r\nlowercase_count = len(s) - uppercase_count\r\n\r\n# Convert the word to uppercase or lowercase based on the counts\r\nif uppercase_count > lowercase_count:\r\n corrected_word = s.upper()\r\nelse:\r\n corrected_word = s.lower()\r\n\r\nprint(corrected_word)\r\n", "def uporlow():\r\n s = input()\r\n up = 0\r\n low = 0\r\n for i in range(len(s)):\r\n if s[i].islower():\r\n low += 1\r\n else:\r\n up += 1\r\n if up <= low:\r\n return s.lower()\r\n else:\r\n return s.upper()\r\n\r\nprint(uporlow())", "string = input()\r\ny = n = 0\r\nfor i in string:\r\n if i.isupper():\r\n y += 1\r\n else:\r\n n += 1\r\nif y > n:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 27 02:45:38 2021\r\n\r\n@author: ASUS\r\n\"\"\"\r\n\r\na=input()\r\ncount= 0\r\nfor i in a:\r\n if i.isupper():\r\n count+= 1\r\nif count>len(a)// 2:\r\n a= a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a)", "x=input()\r\ny=0\r\nz=0\r\nfor i in x:\r\n if(i.islower()):\r\n y+=1\r\n elif(i.isupper()):\r\n z+=1\r\nif(z>y):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i.isupper() == True:\r\n \r\n count += 1\r\nif count > len(s)/2:\r\n print(s.upper())\r\n exit()\r\nprint(s.lower())\r\n", "A = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in A:\r\n if i.islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper>lower:\r\n print(A.upper())\r\nelse:\r\n print(A.lower())\r\n\r\n", "# from functools import partial as p_\r\n# from operator import *\r\n\r\ns = input()\r\nif sum(map(str.islower,s)) >= len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "# Word\r\ntxt = str(input())\r\nlower, upper = 0, 0\r\n\r\nfor i in range(len(txt)):\r\n if txt[i].islower() == True:\r\n lower += 1\r\n elif txt[i].isupper:\r\n upper += 1\r\n\r\nif upper <= lower:\r\n print(txt.lower())\r\nelse:\r\n print(txt.upper())", "li = list(map(str, input()))\r\nupercase = \"\"\r\nlowercase = \"\"\r\nif 1<=len(li)<=100:\r\n for c in li:\r\n if c.isupper():\r\n upercase+=c\r\n else:\r\n lowercase+=c\r\n Up = \"\"\r\n if len(upercase) > len(lowercase):\r\n for t in li:\r\n if t.isupper():\r\n Up+=t\r\n else:\r\n r = t.upper()\r\n Up+=r\r\n else:\r\n for c in li:\r\n if c.islower():\r\n Up+=c\r\n else:\r\n t = c.lower()\r\n Up+=t\r\n\r\n print(Up)\r\n\r\n", "s=(input())\r\nd={'upper':0,'lower':0}\r\n\r\nfor i in s:\r\n if(i.islower()):\r\n d['lower']+=1\r\n else:\r\n d['upper']+=1\r\nif(d['upper']<=d['lower']):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "# A. Word\r\n\r\nword = input()\r\nlwr = 0\r\nupr = 0\r\n\r\nfor i in word:\r\n if(i == i.lower()):\r\n lwr+=1\r\n elif(i == i.upper()):\r\n upr += 1\r\n\r\nif (lwr >= upr):\r\n print(word.lower())\r\nelse :\r\n print(word.upper())", "word = input()\r\ncouS, couB = 0, 0\r\nfor letter in word:\r\n if ord(letter) < 91:\r\n couB += 1\r\n else:\r\n couS += 1\r\nif couB > couS:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n \r\n", "n = str(input())\r\ncountup = 0\r\ncountlow = 0\r\nfor i in n:\r\n if i.isupper() == True:\r\n countup += 1\r\n else:\r\n countlow += 1\r\nif countup > countlow:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "n=input()\r\nup=0\r\nlo=0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n up+=1\r\n else:\r\n lo+=1\r\nif up>lo:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n ", "s=input()\r\nup=0\r\nlow=0\r\nfor letter in s:\r\n if letter.isupper():\r\n up=up+1\r\n else:\r\n low=low +1\r\nif up>low:\r\n p=s.upper()\r\nelse:\r\n p=s.lower()\r\n \r\nprint(p)", "\"\"\"\r\nVasya está muy molesto porque muchas personas en la Red mezclan letras mayúsculas y minúsculas en una \r\nsola palabra. Por eso decidió inventar una extensión para su navegador favorito que cambiaría el registro \r\nde las letras de cada palabra para que solo estuvieran en minúsculas o viceversa, solo en mayúsculas.\r\nEn eso, se deben cambiar lo menos posible las letras en la palabra. Por ejemplo, la palabra HoUse debe \r\nreemplazarse por house y la palabra ViP por VIP. Si una palabra contiene la misma cantidad de letras \r\nmayúsculas y minúsculas, debe reemplazar todas las letras por minúsculas. Por ejemplo, maTRIx debería \r\nser reemplazado por matrix.\r\nSu tarea es usar el método dado en una palabra dada.\r\n\r\nAporte\r\nLa primera línea contiene una palabra s: consta de letras latinas mayúsculas y minúsculas y tiene una \r\nlongitud de 1 a 100.\r\n\r\nProducción\r\nImprime la palabra corregida s. Si la palabra dada s tiene estrictamente más letras mayúsculas, escriba \r\nla palabra en el registro de mayúsculas, de lo contrario:\r\nen minúsculas.\r\n\"\"\"\r\n\r\ns = input()\r\nmayus = 0\r\nmin = 0\r\nfor i in s:\r\n if i.isupper():\r\n mayus += 1\r\n else:\r\n min += 1\r\n \r\nprint(s.upper() if mayus>min else s.lower())", "s=input()\r\nu=[]\r\nl=[]\r\nfor i in range(len(s)):\r\n\tif s[i].isupper():\r\n\t\tu.append(s[i])\r\n\telse:\r\n\t\tl.append(s[i])\r\nif len(u)<=len(l):\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "word = input()\n\nalphabetu = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\n\nalphabetl = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\n\ncounter1 = 0\n\ncounter2 = 0\n\nfor i in range(len(word)):\n if word[i] in alphabetl:\n counter1 += 1\n if word[i] in alphabetu:\n counter2 += 1\n\nif (counter2) > (counter1):\n print(word.upper())\nif (counter2) < (counter1):\n print(word.lower())\nif (counter2) == (counter1):\n print(word.lower())\n\n\n\n\n\n\n\n\n", "s=input()\r\ns1=[]\r\nfor i in range(len(s)):\r\n if s[i]>='A' and s[i]<='Z':\r\n s1.append(1)\r\n else:\r\n s1.append(0)\r\nif s1.count(1)>s1.count(0):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\ncontup, contlo = 0, 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n contup+=1\r\n else:\r\n contlo+=1\r\nif contup > contlo:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "word=input()\r\nword1=word.lower()\r\nword2=word.upper()\r\na=0\r\nb=0\r\nc=len(word)\r\nfor i in range(c):\r\n if word[i]==word1[i]:\r\n a+=1\r\n if word[i]==word2[i]:\r\n b+=1\r\nif a>=b:\r\n print(word1)\r\nelse:\r\n print(word2)", "def f(s):\r\n a = [i for i in s if i == i.lower()]\r\n v = [i for i in s if i == i.upper()]\r\n if (len(a) < len(v)): return s.upper()\r\n return s.lower()\r\n \r\ns = input()\r\nprint(f(s))", "name = str(input()) \r\nn = len(name) \r\nc = 0 \r\nans = 0 \r\nfor i in range (n): \r\n if name[i].islower(): \r\n c = c+1 \r\n else: \r\n ans = ans+1 \r\nif c >= ans: \r\n \r\n \r\n \r\n print(name.lower()) \r\n \r\n \r\nelse: \r\n print(name.upper())", "om=input()\r\no=0\r\nm=0\r\nfor i in om:\r\n if(i.islower()):\r\n o=o+1\r\n elif(i.isupper()):\r\n m=m+1\r\n\r\nif o<m:\r\n print(om.upper())\r\nelse:\r\n print(om.lower())", "from string import ascii_lowercase\r\n\r\n\r\na = input()\r\nmay = 0\r\nmin = 0\r\nfor i in a:\r\n if i in ascii_lowercase:\r\n min+=1\r\n else:\r\n may+=1\r\n\r\nif may > min:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "u=0\r\nl=0\r\ns= input()\r\nfor i in s:\r\n if i.isupper():\r\n u=u+1\r\n else: l+=1\r\nif u>l:\r\n print(s.upper())\r\nelse: print(s.lower())", "string = input()\r\nlow = 0\r\nhigh = 0\r\nfor i in range(len(string)):\r\n if ord(string[i]) >= 65 and ord(string[i]) <= 90:\r\n high += 1\r\n else:\r\n low += 1\r\nif low >= high:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n", "\r\nlower = 0\r\nupper = 0\r\nstring = input()\r\n\r\nfor x in string:\r\n if x.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif lower >= upper:\r\n string = string.lower()\r\nelse:\r\n string = string.upper()\r\n\r\nprint(string)", "s = input()\r\nups = 0\r\nlows = 0\r\nfor ch in s:\r\n if ch.isupper():\r\n ups += 1\r\n else:\r\n lows += 1\r\nif ups > lows:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nb = 0\r\nc = 0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n b += 1\r\n else:\r\n c += 1\r\nif b >= c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "user_input=input()\r\ntemp=list(user_input)\r\n\r\ncount1=0\r\ncount2=0\r\nfor i in temp:\r\n if (i.isupper()):\r\n count1+=1\r\n else:\r\n count2+=1\r\nif count1==count2: \r\n print(user_input.lower())\r\nelif count1>count2:\r\n print(user_input.upper())\r\nelse:\r\n print(user_input.lower())", "i = input()\r\nlow = [str(x) for x in i if x.islower()]\r\nloq = len(low)\r\nupp = len(i) - loq\r\nif upp > loq:\r\n print(i.upper())\r\nelse:\r\n print(i.lower())\r\n \r\n\r\n", "s = input()\r\nword = []\r\nlength = len(s)\r\nuppercase = 0\r\nlowercase = 0\r\nfor i in range(length):\r\n word.append(s[i])\r\n\r\n\r\nfor i in word:\r\n if i.isupper() == True:\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\n\r\nif uppercase > lowercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "if __name__ == '__main__':\r\n s = input()\r\n u, l = 0, 0\r\n\r\n for i in range(len(s)):\r\n if ord(s[i]) >= 97:\r\n l = l + 1\r\n else:\r\n u = u + 1\r\n\r\n if l >= u:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n ", "word = input()\nuppercase = 0\nlowercase = 0\n\nfor index, letter in enumerate(word):\n if letter == word[index].upper():\n uppercase += 1\n else:\n lowercase += 1\n\nif uppercase > lowercase:\n print(word.upper())\nelse:\n print(word.lower())\n", "s=input()\r\na=list(s)\r\nl=0\r\nu=0\r\nfor x in a:\r\n if x.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif l>u:\r\n print(s.lower())\r\nelif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input(\"\")\r\nc = sum(map(str.isupper, a))\r\nd = sum(map(str.islower, a))\r\nif d>=c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "a=input()\r\n\r\nb=\"abcdefghijklmnopqrstuvwxyz\"\r\nc=b.upper()\r\n\r\ncount=0\r\ncount1=0\r\n\r\nfor i in a:\r\n if i in b:\r\n count+=1\r\n else:\r\n count1+=1\r\n\r\nif count>=count1:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "s = input()\r\nu = list(filter(lambda x: x.isupper(), s))\r\nl = list(filter(lambda x: x.islower(), s))\r\nprint(s.lower() if len(u) <= len(l) else s.upper())\r\n", "s=input()\r\nn=len(s)\r\ncnt=0\r\nfor i in range(n):\r\n if(s[i].isupper()):\r\n cnt+=1\r\nif(cnt>n-cnt):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nq=list(s[:])\r\na=[]\r\nfor k in s: \r\n if k==k.upper():\r\n a.append(k)\r\nif len(a)>len(s)-len(a):\r\n print(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s=input()\r\nl=len(s)\r\nu=0\r\no=0\r\nfor i in range(l):\r\n if s[i].isupper():\r\n u=u+1\r\n else:\r\n o=o+1\r\nif u>o:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=str(input())\r\nl=sum(map(str.islower,s))\r\nu=sum(map(str.isupper,s))\r\nif l<u:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\ns = list(s)\r\ncount=0\r\ncount1=0\r\nfor x in s:\r\n if(x.isupper()):\r\n count += 1\r\n elif(x.islower()):\r\n count1 += 1\r\ns = \"\".join(s)\r\n\r\nif count==count1 or count1>count:\r\n print(s.lower())\r\nelif count > count1:\r\n print(s.upper())\r\n \r\n", "s=input()\r\nl=[]\r\nu=[]\r\nfor i in s:\r\n if(i.islower()):\r\n l.append(i) \r\nfor i in s:\r\n if(i.isupper()):\r\n u.append(i)\r\nif(len(u) > len(l)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "sm = 0\r\ncap = 0\r\ns = input()\r\nfor i in s:\r\n if(i.islower()):\r\n sm = sm + 1\r\n else:\r\n cap = cap + 1\r\nif(cap > sm):\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "a= input()\r\nlower=0\r\nupper=0\r\nfor i in range(len(a)):\r\n\tif a[i].islower():\r\n\t\tlower+=1\r\n\telse:\r\n\t\tupper+=1\r\nif lower>=upper:\r\n\tprint(a.lower())\r\nelse:\r\n\tprint(a.upper())\r\n", "s = input()\r\ncount_small = 0\r\ncount_big = 0\r\nfor i in s:\r\n if i == i.upper():\r\n count_big += 1\r\n elif i == i.lower():\r\n count_small +=1\r\nif count_small > count_big:\r\n print(s.lower())\r\nelif count_small < count_big:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "a = input()\nupper = 0\nlower = 0\nfor ch in a:\n if ch.isupper():\n upper = upper + 1\n else:\n lower = lower + 1\nif upper > lower:\n a = a.upper()\nif lower >= upper:\n a = a.lower()\nprint(a)\nquit()\n \t\t\t\t\t \t \t \t \t \t \t \t\t \t \t", "s = input()\r\ncapital_counter = 0\r\nlower_counter = 0\r\n\r\nfor w in s:\r\n if w.islower():\r\n lower_counter += 1\r\n elif w.isupper():\r\n capital_counter += 1\r\n\r\nif capital_counter > lower_counter:\r\n s = s.upper()\r\nelif lower_counter >= capital_counter:\r\n s = s.lower()\r\nprint(s)", "#lowerup.py\n\ns = input()\n\nuppers = 0\nlowers = 0\n\nfor i in s:\n if i.isupper():\n uppers += 1\n elif i.islower():\n lowers += 1\n\nif uppers == lowers:\n s =s.lower()\nelif uppers > lowers:\n s =s.upper()\nelse:\n s = s.lower()\n\nprint(s)\n", "b = input()\r\nc = list(b)\r\nupper = 0\r\nlower = 0\r\nfor i in c:\r\n if (i.isupper()):\r\n upper += 1\r\n elif (i.islower()):\r\n lower += 1\r\nif upper > lower:\r\n print(b.upper())\r\nelse:\r\n print(b.lower())\r\n", "word=input()\r\nup=0\r\nlow=0\r\nfor i in word:\r\n if (ord(i)>=65 and ord(i)<=90):\r\n up+=1\r\n elif (ord(i)>=97 and ord(i)<=122):\r\n low+=1\r\nif low>up:\r\n print(word.lower())\r\nelif low<up:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "first = input()\r\nupper = 0\r\nlower = 0\r\nfor i in first:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(first.upper())\r\nelif lower>upper:\r\n print(first.lower())\r\nelse:\r\n print(first.lower())", "n = input()\r\nsize = len(n)\r\nlw = 0\r\nup = 0\r\n\r\nfor i in range(size):\r\n if n[i] >= 'a' and n[i] <= 'z':\r\n lw += 1\r\n else:\r\n up += 1\r\n\r\nif lw >= up:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s=input()\r\nlower=0\r\nupper=0\r\nfor i in s:\r\n if (i.islower()):\r\n lower+=1\r\n elif (i.isupper()):\r\n upper+=1\r\nif lower>upper:\r\n print(s.lower())\r\nelif upper>lower:\r\n print(s.upper())\r\nelif upper==lower:\r\n print(s.lower())", "s = input()\r\n\r\nl = list(s)\r\nl.sort()\r\n\r\nif l[len(s)//2].isupper():\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s = input()\r\n\r\nlower = sum( 1 for c in s if c.islower() )\r\nlower *= 2\r\nn = len(s)\r\nif lower < n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\nlowCaseCounter = 0\r\n\r\nfor c in word:\r\n lowCaseCounter += 1 if str.islower(c) else 0\r\n\r\nword = word.lower() if lowCaseCounter >= len(word) / 2 else word.upper()\r\n\r\nprint(word)", "p=input()\r\nu=l=0\r\nfor i in p:\r\n if(i.isupper()==True):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u==l):\r\n print(p.lower())\r\nif(u>l):\r\n print(p.upper())\r\nif(u<l):\r\n print(p.lower())", "string=input()\r\ncntu=0\r\ncntl=0\r\nfor k in range(len(string)):\r\n\tif(ord(string[k])>=65 and ord(string[k])<=91):\r\n\t\tcntu=cntu+1\r\n\telif(ord(string[k])>=97 and ord(string[k])<=122):\r\n\t\tcntl=cntl+1\r\nif(cntu>cntl):\r\n\tprint(string.upper())\r\nelse:\r\n\tprint(string.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 20 18:55:14 2021\r\n\r\n@author: wlt52\r\n\"\"\"\r\n\r\na = input()\r\nleng = len(a)\r\n\r\nup = 0\r\nlow = 0\r\n\r\nfor i in range (leng):\r\n if a[i] == str.upper(a[i]):\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif up > low:\r\n a = str.upper(a)\r\n \r\nelse:\r\n a = str.lower(a)\r\n \r\nprint(a)", "n=input()\r\nl=0\r\nu=0\r\nfor char in n:\r\n if char.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u> l:\r\n n = n.upper()\r\nelse:\r\n n = n.lower()\r\n \r\nprint(n)", "\r\na=input()\r\nupper=0\r\nlower=0\r\n\r\nfor i in range(0,len(a)):\r\n if a[i].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n# print(upper)\r\n# print(lower)\r\n\r\nif(upper>lower):\r\n e=a.upper()\r\nelse:\r\n e=a.lower()\r\nprint(e)", "arr = []\r\nup = 0\r\nlow = 0\r\nword = str(input())\r\nfor k in word:\r\n arr.append(k)\r\nfor i in range(len(arr)):\r\n if(arr[i].isupper()==True):\r\n up+=1\r\n elif(arr[i].islower()==True):\r\n low+=1\r\nif(up>low):\r\n print(word.upper())\r\nelif(up<=low):\r\n print(word.lower())", "s = input()\r\nprint((s.lower(),s.upper())[sum(x.isupper() for x in s)>len(s)//2])", "word=input()\r\nlol=''\r\nkey=0\r\nif word==word.lower() or word==word.upper():\r\n print(word)\r\n \r\nelse:\r\n for i in word:\r\n if i==i.lower():\r\n key+=1\r\n for i in word:\r\n if i==i.upper():\r\n key-=1\r\n if key>=0:\r\n print(word.lower())\r\n else:\r\n print(word.upper())", "s = input()\r\nc = 0\r\nd = 0\r\nfor i in range (len(s)):\r\n if s[i].isupper():\r\n c = c+1\r\n if s[i].islower():\r\n d = d+1\r\n\r\nif c>d:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input() \r\ns_upper = s.upper() \r\ncnt = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == s_upper[i]:\r\n cnt += 1\r\n\r\nif cnt > len(s)//2:\r\n print(s_upper)\r\nelse:\r\n print(s.lower())", "inp=input()\r\n\r\nc=0\r\n\r\nfor char in inp:\r\n if char.islower():\r\n c+=1\r\n\r\nif 2*c<len(inp):\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())", "s=input()\r\na=len(s)\r\nc=0\r\nfor i in s:\r\n if(i.isupper()):\r\n c+=1\r\nif((a-c)>=c):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "Str= input()\r\nlower=0\r\nupper=0\r\nfor i in Str:\r\n if(i.islower()):\r\n lower+=1\r\n else:\r\n upper+=1\r\nif lower >= upper :\r\n print(Str.lower())\r\nelse:\r\n print(Str.upper())", "s = str(input())\r\ni = 0\r\nsm = 0\r\nbi = 0\r\nwhile i < len(s):\r\n if 97 <= ord(s[i]) <= 122:\r\n sm += 1\r\n else:\r\n bi += 1\r\n i += 1\r\nif sm < bi:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "s = input()\r\nk = 0\r\nl = 0\r\nfor i in s:\r\n if i == i.upper():\r\n k += 1\r\n else:\r\n l += 1\r\nif k > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = str(input())\r\nsum = 0\r\nfor i in n:\r\n if i.isupper() == True:\r\n sum = sum + 1\r\nif sum > len(n)-sum:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s =input()\r\n\r\nno_upper = 0\r\nno_lower = 0\r\n\r\nfor i in s:\r\n if 64<ord(i)<91:\r\n no_upper = no_upper + 1\r\n elif 96<ord(i)<123:\r\n no_lower = no_lower + 1\r\n else:\r\n pass\r\n \r\nif no_lower > no_upper:\r\n a = s.lower()\r\nelif no_lower < no_upper:\r\n a = s.upper()\r\nelif no_lower == no_upper:\r\n a = s.lower()\r\n \r\nprint(a)", "s=input()\r\nwordList=list(s)\r\nlowerLetter=[]\r\nupperLetter=[]\r\nfor i in wordList:\r\n if i.islower():\r\n lowerLetter.append(i)\r\n else:\r\n upperLetter.append(i)\r\nif len(lowerLetter)>len(upperLetter):\r\n print(s.lower())\r\nelif len(lowerLetter)==len(upperLetter):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\ns1=s.upper()\r\ns2=s.lower()\r\nup=0\r\nlow=0\r\nfor i in range(len(s)):\r\n if s[i]==s1[i]:\r\n up+=1\r\n if s[i]==s2[i]:\r\n low+=1\r\nprint(s.upper() if up>low else s.lower())", "s=input()\r\nup=0\r\nfor x in s:\r\n if x.isupper():\r\n up+=1 \r\nlo=len(s)-up\r\nif up>lo:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nlower=0\r\nupper=0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n\r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\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\ns=input() \r\nlst=['0']\r\n\r\nfor i in s:\r\n lst.append(i)\r\n\r\nlst.append('0')\r\nprint(lst)\r\n\r\ni=0\r\nwhile True:\r\n if lst[i]==lst[i-1] or lst[i]==lst[i+1]:\r\n lst.remove(lst[i])\r\n print(lst[i])\r\n else:\r\n print(lst[i],end='')\r\n i+=1\r\n'''\r\n", "s=input()\r\na=b=0\r\nfor i in s:\r\n if ord(i)>=97:\r\n b+=1\r\n else:\r\n a+=1\r\nprint(s.upper() if a>b else s.lower())", "up=0\r\nlo=0\r\nword=str(input())\r\nlen=len(word)\r\n\r\nif len >=1 and len <=100:\r\n for i in word[:]:\r\n n=i\r\n if n.islower():\r\n lo+=1\r\n elif n.isupper():\r\n up+=1\r\n\r\n if lo>=up :\r\n print(word.lower())\r\n elif lo<up :\r\n print(word.upper())\r\nelse:\r\n print('plz int word 1<=len(word)>=100' )", "# Problem: https://codeforces.com/problemset/problem/59/A\n\ndef main(word):\n upper_count = 0\n\n # Find num characters that are lower/upper case\n for letter in word:\n if letter.isupper():\n upper_count += 1\n lower_count = len(word) - upper_count\n\n # Determine which case to use\n if upper_count > lower_count:\n return word.upper()\n return word.lower()\n\n\nif __name__ == \"__main__\":\n word = input()\n print(main(word))\n", "# cook your dish here\r\na = input()\r\nb = a.upper()\r\nc = a.lower()\r\nl1 = [i for i in b]\r\nl2 = [i for i in c]\r\nl3 = [i for i in a]\r\n\r\nu = [value for value in l3 if value in l1]\r\nl = [value for value in l3 if value in l2] \r\n\r\nif (len(u) <= len(l)):\r\n print(c)\r\nelse:\r\n print(b)", "x = input()\r\nlower = 0\r\n\r\nfor i in x :\r\n if ord(i) >= 97 :\r\n lower += 1\r\nupper = len(x) - lower\r\n\r\nif lower >= upper:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n\r\n", "value = input()\r\nup = 0\r\ndown = 0\r\nfor cur in value:\r\n if 'a' <= cur:\r\n down += 1\r\n else:\r\n up += 1\r\nif up > down:\r\n print(value.upper())\r\nelse:\r\n print(value.lower())", "#import math\nip = lambda : int(input())\nsp = lambda : input()\nlsp = lambda : list(input())\nli = lambda : list(map(int,input().split()))\npy = lambda :print(\"YES\")\npn = lambda :print(\"NO\")\n\ns = sp()\n\nupper = 0\nlower = 0\nfor i in s:\n if i.islower():\n lower+=1\n else:\n upper+=1\nif lower>=upper:\n print(s.lower())\nelse:\n print(s.upper())", "s = input()\r\nzagl = 0\r\nniz = 0\r\nfor i in s:\r\n if ord(i) >= ord('a') and ord(i) <= ord('z'):\r\n niz+=1\r\n else:\r\n zagl+=1\r\nif niz >= zagl:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "str_obj=input()\r\ncount_small=0\r\ncount_large=0\r\nfor elem in str_obj:\r\n if elem.isupper():\r\n count_large += 1\r\n if elem.islower():\r\n count_small +=1\r\nif (count_small>count_large):\r\n print(str_obj.lower())\r\nelif (count_large>count_small):\r\n print(str_obj.upper())\r\nelse:\r\n print(str_obj.lower())", "s = input()\r\nc = 0\r\ndef f():\r\n for i in range(2):\r\n ddd=999\r\nfor x in s:\r\n if x.isupper():\r\n c += 1\r\n\r\nif c > len(s) // 2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nf()\r\nprint(s)", "s = input()\r\n\r\nlower = upper = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nprint(s.lower() if lower >= upper else s.upper())", "a=input()\r\nb=0\r\nc=0\r\nfor i in range(0,len(a)):\r\n if ('a'<=a[i])and(a[i]<='z'):\r\n b=b+1\r\n else:\r\n c=c+1\r\nif b>=c:\r\n print(a.lower())\r\nelif b<c:\r\n print(a.upper())", "def lowercase(a):\r\n return (ord(a)>=97 and ord(a)<=122)\r\n\r\n\r\n\r\n\r\n\r\ndef solve(s):\r\n lower=0\r\n upper=0\r\n for item in s:\r\n if(lowercase(item)):\r\n lower+=1\r\n else:\r\n upper+=1\r\n \r\n if(lower>=upper):\r\n return s.lower()\r\n \r\n else:\r\n return s.upper()\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n s=input()\r\n print(solve(s))", "import string \r\nlis= list(string.ascii_uppercase)\r\nst = input()\r\ncount,coun=0,0\r\nfor i in st:\r\n if i in lis:\r\n count+=1\r\n else:\r\n coun+=1\r\nif count > coun:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())\r\n", "word = str(input())\r\ncap_count = 0\r\nsmall_count = 0\r\n\r\n\r\nfor each in word:\r\n\tif each.isupper() == True:\r\n\t\tcap_count += 1\r\n\telse:\r\n\t\tsmall_count += 1\r\n\r\nif cap_count > small_count:\r\n\tnew_word = word.upper()\r\nelse:\r\n\tnew_word = word.lower()\r\n\r\nprint(new_word)", "n=input()\r\nw=l=0\r\nfor i in n:\r\n if(i.isupper()==True):\r\n w=w+1\r\n else:\r\n l=l+1\r\nif(w==l):\r\n print(n.lower())\r\nif(w>l):\r\n print(n.upper())\r\nif(w<l):\r\n print(n.lower())\r\n", "lowerCnt , upperCnt = 0 , 0 \r\ns = input()\r\nfor i in s:\r\n if i.islower():\r\n lowerCnt += 1 \r\n else:\r\n upperCnt += 1 \r\nif upperCnt > lowerCnt :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nap=len(list(filter(str.isupper,s)))\r\nsp=len(list(filter(str.islower,s)))\r\nprint(s.upper())if ap>sp else print(s.lower())", "w = input()\nnbr = sum(1 for i in w if i.islower())\nprint(w.lower()) if nbr >= len(w)/2 else print(w.upper())", "s = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in range(len(s)):\r\n if (ord(s[i]) >= 97 and ord(s[i]) <= 122):\r\n lower += 1\r\n\r\n elif (ord(s[i]) >= 65 and ord(s[i]) <= 90):\r\n upper += 1\r\n\r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\nuCount = 0\r\nlCount = 0\r\n\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n uCount += 1\r\n else:\r\n lCount += 1\r\n\r\nprint(word.lower()) if lCount >= uCount else print(word.upper())", "g=input()\r\nt=len(g)\r\nN=0\r\nB=0\r\nfor i in g:\r\n if i.islower():\r\n N+=1\r\n if i.isupper():\r\n B+=1\r\nif N<B:\r\n print(g.upper())\r\nif N>B or N==B:\r\n print(g.lower())", "word = input()\r\n\r\nup = len([x for x in word if x.isupper()])\r\nlow = len([x for x in word if x.islower()])\r\n\r\nif up>low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=str(input())\r\n\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nprint(s.upper()) if u>l else print(s.lower())", "s=input()\r\nn=[ord(x) for x in s]\r\nu=0\r\nl=0\r\nfor i in n:\r\n if i>=97 and i<=122:\r\n l+=1\r\n else:\r\n u+=1\r\nd=str(s)\r\nif u>l:\r\n ns=d.upper()\r\nelse:\r\n ns=d.lower()\r\nprint(str(ns))", "s = input()\r\n# n = len(s)\r\n# low_count, up_count = 0, 0\r\ncount = 0\r\nfor c in s:\r\n count += (-1) ** (c.islower())\r\nprint(s.lower() if count <= 0 else s.upper())\r\n", "word = input()\r\nu = [x for x in word if x.isupper()]\r\nl = [x for x in word if x.islower()]\r\nif len(u)<len(l) or len(u)==len(l):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "#Word\n#Problem Link : http://codeforces.com/problemset/problem/59/A\n\nword = input()\nn = len(word)\nuCount = 0\nfor letter in word:\n if letter.isupper():\n uCount += 1\nprint(word.upper() if uCount > n // 2 else word.lower())", "s=input()\r\nupper=0\r\nlower=0\r\nfor i in s:\r\n if i.isupper():\r\n upper += 1\r\n\r\n elif i.islower():\r\n lower += 1\r\n\r\nif lower>=upper:\r\n print(s.lower())\r\n\r\nelse:\r\n print(s.upper())\r\n", "c = input()\r\nbig = 0\r\nsmall = 0\r\nfor i in c:\r\n if i == i.upper():\r\n big += 1\r\n else:\r\n small += 1\r\nif small >= big:\r\n print(c.lower())\r\nelse:\r\n print(c.upper())\r\n", "x=input()\r\nc,d=0,0\r\nl=\"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nfor i in range(0,len(x)):\r\n if(x[i] in l):\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "x = input()\r\nU = 0\r\nl = 0\r\nfor i in x:\r\n temp = i.isupper()\r\n if temp == True:\r\n U += 1\r\n else:\r\n l += 1\r\nif U == l or U < l:\r\n print(x.lower())\r\nelif U > l:\r\n print(x.upper())", "w=input()\r\nl=0\r\nu=0\r\nz=\"\"\r\nfor i in w:\r\n l=l+i.islower()\r\n u=u+i.isupper()\r\nif l >= u:\r\n for i in w:\r\n if i.isupper():\r\n z+=i.lower()\r\n else:\r\n z+=i\r\nelse:\r\n for i in w:\r\n if i.islower():\r\n z+=i.upper()\r\n else:\r\n z+=i\r\nprint(z)", "k=input()\r\ncount=0\r\ny=0\r\nfor i in k:\r\n if( ord(i)>64 and ord(i)<91):\r\n if(ord(i)==ord(i.upper())):\r\n count=count+1\r\n else:\r\n y=y+1\r\nif(count>y):\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "s = input()\r\nif len(s) > 0 and len(s) < 101:\r\n up = sum(1 for c in s if c.isupper())\r\n lo = sum(1 for c in s if c.islower())\r\n\r\n if up > lo:\r\n s = s.upper()\r\n else:\r\n s = s.lower()\r\n\r\n print(s)\r\n", "import string\r\n\r\ns = str(input())\r\ns = list(s)\r\n\r\nupper_count = 0\r\nlower_count = 0\r\n\r\nfor j in range(0, len(s)):\r\n\tif s[j].isupper() == True:\r\n\t\tupper_count += 1\r\n\telif s[j].islower() == True:\r\n\t\tlower_count += 1\r\n\r\nif upper_count > lower_count:\r\n\tfinal_string = ''.join([str(elem) for elem in s])\r\n\tfinal_string = final_string.upper()\r\n\tprint(final_string)\r\nelif upper_count < lower_count or upper_count == lower_count:\r\n\tfinal_string = ''.join([str(elem) for elem in s])\r\n\tfinal_string = final_string.lower()\r\n\tprint(final_string)\r\n", "x=input()\r\nup=0\r\nlow=0\r\nfor i in range(0,len(x)):\r\n if (x[i].isupper()):\r\n up=up+1\r\n else :\r\n low=low+1\r\nif up > low :\r\n print(x.upper())\r\nelse :\r\n print(x.lower())\r\n", "# https://codeforces.com/problemset/problem/59/A\ni = input()\ncount=0\nfor x in i:\n if x.isupper():\n count+=1\nif count>len(i)//2:\n i=i.upper()\nelse:\n i=i.lower()\nprint(i)", "s=input()\r\ncount1=0\r\ncount2=0\r\nfor i in s:\r\n if(i.islower()):\r\n count1=count1+1\r\n elif(i.isupper()):\r\n count2=count2+1\r\nif(count1>count2):\r\n print(s.lower())\r\nelif(count1==count2):\r\n print(s.lower())\r\nelif(count1<count2):\r\n print(s.upper())", "word=input()\r\nl=0\r\nw=0\r\nfor i in word:\r\n if i.islower():\r\n l+=1\r\n else:\r\n w+=1\r\nif w > l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nsup = 0\r\nfor i in s:\r\n if(i.isupper()):\r\n sup += 1\r\nslow = len(s) - sup\r\nif(slow < sup):\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "# cook your dish here\r\na= input()\r\ncl=0\r\ncu=0\r\nfor i in a:\r\n if(i.islower()):\r\n cl+=1\r\n elif(i.isupper()):\r\n cu+=1\r\nif(cl>=cu):\r\n b=a.lower()\r\nelif(cu>cl):\r\n b=a.upper()\r\nprint(b)", "s=input()\r\nup=0\r\nlow=0\r\nfor item in s:\r\n if item.isupper():up+=1\r\n else:low+=1\r\nif up>low:print(s.upper())\r\nelse:print(s.lower())", "s=input()\r\ncount1=0\r\ncount2=0\r\nn=len(s)\r\nfor i in range(n):\r\n if ord(s[i])>=97 and ord(s[i])<=122:\r\n count1=count1+1\r\n if ord(s[i])>=65 and ord(s[i])<=95:\r\n count2=count2+1\r\nif count1>=count2:\r\n for i in range(n):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n print(chr(ord(s[i])+32),end=\"\")\r\n else:\r\n print(s[i],end=\"\")\r\n \r\n \r\nif count1<count2:\r\n for i in range(n):\r\n if ord(s[i])>=97 and ord(s[i])<=122:\r\n print(chr(ord(s[i])-32),end=\"\")\r\n else:\r\n print(s[i],end=\"\")\r\n \r\n\r\n \r\n", "u = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nm = input()\r\nuc = 0\r\nfor i in m:\r\n if i in u:\r\n uc += 1\r\nlc = len(m)-uc\r\n\r\nif uc>lc:\r\n print(m.upper())\r\nelse:\r\n print(m.lower())", "s = input()\r\nbolsh = mal = 0\r\nfor i in range(len(s)):\r\n if('A' <= s[i] <= 'Z'):\r\n bolsh+=1\r\n else:\r\n mal+=1\r\nif(bolsh > mal):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nup = 0\r\nlo = 0\r\nfor i in a:\r\n if i.islower():\r\n lo += 1\r\n else:\r\n up += 1\r\nif lo >= up:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "a = input()\r\nt=len(a)//2;q=0\r\nfor x in range(len(a)):\r\n if a[x]==a[x].upper():\r\n q=q+1\r\n if q==t or q<t:\r\n e=a.lower()\r\n elif q>t:\r\n e=a.upper()\r\nprint(e)", "word = input()\nlowercase_count = sum(1 for c in word if c.islower())\nuppercase_count = len(word) - lowercase_count\nif lowercase_count >= uppercase_count:\n modified_word = word.lower()\nelse:\n modified_word = word.upper()\n\nprint(modified_word)\n\n\t \t \t \t\t \t\t\t \t \t \t\t \t\t\t \t\t", "s = input()\r\ns2 = \"\"\r\nucount = 0\r\nl = len(s)\r\n\r\nfor i in range(l):\r\n if s[i] in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n ucount += 1\r\n\r\nif ucount > l/2:\r\n for i in s:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n s2 += i\r\n else: \r\n s2 += chr(ord(i) - abs(ord('A') - ord('a')))\r\n\r\nelse:\r\n for i in s:\r\n if i in \"abcdefghijklmnopqrstuvwxyz\":\r\n s2 += i\r\n else:\r\n s2 += chr(ord(i) + abs(ord('A') - ord('a')))\r\n\r\nprint(s2)", "cap=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\ns=input()\r\nc=sm=0\r\nfor i in s:\r\n if i in cap:\r\n c+=1\r\n else:\r\n sm+=1\r\nif c>sm:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\n\r\nupper_count = sum(1 for c in word if c.isupper())\r\nif upper_count > len(word) // 2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "b = input()\r\nl = len(b)\r\ncounter=0\r\n\r\nfor _ in b:\r\n if _ >='a'and _ <='z':\r\n counter =counter +1\r\nif counter >=(l/2):\r\n print(b.lower())\r\nelse:\r\n print(b.upper())\r\n", "n = input()\r\nup = 0\r\nlo = 0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n up += 1\r\n else:\r\n lo += 1\r\nprint(n.upper() if up > lo else n.lower())", "s = input()\r\ncountu = 0\r\ncountl = 0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n countu+=1\r\n else:\r\n countl += 1\r\nif(countu>countl):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "def solve():\r\n\r\n string = input() \r\n\r\n caps = 0\r\n for i in range(len(string)):\r\n if string[i].isupper():\r\n caps += 1\r\n\r\n if (caps > len(string) // 2):\r\n return string.upper()\r\n else:\r\n return string.lower() \r\n \r\n\r\nprint(solve()) \r\n", "\r\n\r\nif __name__ == \"__main__\":\r\n w = input()\r\n wl = list(w)\r\n\r\n u = 0\r\n l = 0\r\n\r\n for letter in wl:\r\n if letter.isupper():\r\n u += 1\r\n elif letter.islower():\r\n l += 1\r\n\r\n if u > l:\r\n print(w.upper())\r\n else:\r\n print(w.lower())\r\n\r\n \r\n", "s=input()\r\ndem1=0\r\ndem2=0\r\nfor i in range (0,len(s)) :\r\n if s[i]>='A' and s[i]<='Z':\r\n dem1+=1\r\n else :\r\n dem2+=1\r\nif dem1>dem2 :\r\n print(s.upper())\r\nelse :\r\n print(s.lower()) ", "w = input()\r\n\r\nl = 0\r\nu = 0\r\n\r\nfor x in w: \r\n\tif x == x.lower():\r\n\t\tl += 1\r\n\telse:\r\n\t\tu += 1\r\n\r\nprint([w.lower(), w.upper()][u>l])", "n=input()\r\nt=list(n)\r\nc=0\r\nfor i in t:\r\n if i.islower()==True:\r\n c+=1\r\nif len(t)-c>c:\r\n print(n.upper())\r\nelse:\r\n print(n.lower()) ", "x=input()\r\nup=low=0\r\nfor i in range(len(x)):\r\n if x[i].islower():\r\n low+=1\r\n else:\r\n up+=1\r\nif low>=up:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s = str(input())\r\ndef calc(s):\r\n upper_s = 0\r\n lower_s = 0\r\n for i in range(len(s)):\r\n if s[i].isupper() == True:\r\n upper_s += 1\r\n else:\r\n lower_s += 1\r\n if upper_s > lower_s:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\ncalc(s)", "s=input()\r\nupp=0\r\nlow=0\r\nfor i in s:\r\n if (i.isupper()==True):\r\n upp+=1\r\n else:\r\n low+=1\r\nif(upp>low):\r\n print(s.upper())\r\nelif(low>upp or low==upp):\r\n print(s.lower())\r\n", "# cook your dish here\r\ntry:\r\n s=input()\r\n # lst=list(s)\r\n # print(lst)\r\n u=0\r\n l=0\r\n for i in s:\r\n if (i.isupper()) is True:\r\n u=u+1\r\n else:\r\n l=l+1\r\n \r\n if u>l:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n \r\n \r\n \r\nexcept:\r\n pass", "s=input(\"\")\r\na=0\r\nb=0\r\nfor i in range(len(s)):\r\n if s[i].isupper()==True:\r\n a=a+1\r\n else :\r\n b=b+1\r\nif( a<=b):\r\n s=s.lower()\r\nelse:\r\n s= s.upper()\r\nprint(s)\r\n \r\n \r\n ", "word = input()\r\nup=0\r\nlow=0\r\nfor letter in word:\r\n if letter.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\n\r\nif up > low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\n\nupper = 0\nlower = 0\nfor c in s:\n if ord(c) < 97:\n upper += 1\n else:\n lower += 1\n \nprint(s.upper() if upper > lower else s.lower())", "s = input()\r\nup,low = 0,0\r\nfor i in s:\r\n\tif ord(i)>= 97:\r\n\t\tlow+=1\r\n\telse:\r\n\t\tup+=1\r\nif up>low:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "upper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nlower = upper.lower()\r\ns = input()\r\nupper_num = 0\r\nlower_num = 0\r\nfor char in s:\r\n if char in upper:\r\n upper_num+=1\r\n else:\r\n lower_num+=1\r\nif upper_num>lower_num:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n", "n = list(input())\r\ncount = 0\r\nlength = len(n)\r\nfor i in range(length):\r\n if n[i].islower():\r\n count += 1\r\nn = \"\".join(n)\r\nif length % 2 == 0:\r\n if count < length/2:\r\n print(n.upper())\r\n else:\r\n print(n.lower())\r\nif length % 2 == 1:\r\n if count <= length/2:\r\n print(n.upper())\r\n else:\r\n print(n.lower())\r\n", "\r\nu = 0\r\nl = 0\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u += 1\r\n elif s[i].islower():\r\n l += 1\r\nif u <= l: \r\n s = s.lower()\r\nelif u > l:\r\n s = s.upper()\r\nprint(s)\r\n", "a=input()\r\nd=0\r\nn=len(a)\r\nl=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in a:\r\n\tif i in l:\r\n\t\td+=1\r\nc=n-d\r\nif(c>d):\r\n\tprint(a.upper())\r\nelif(c<d):\r\n\tprint(a.lower())\r\nelse:\r\n\tprint(a.lower())\r\n ", "a=input()\r\ncount=0\r\ncount1=0\r\nfor i in a:\r\n if(i.islower()):\r\n count=count+1\r\n else:\r\n count1=count1+1\r\nif(count>=count1):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "str=input()\r\nl=0\r\nu=0\r\nlength=len(str)\r\nfor i in range(length):\r\n if(str[i].islower()):\r\n l=l+1\r\n else:\r\n u=u+1\r\nif(l>=u):\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "s=input()\r\nu = 0\r\nl= 0\r\nfor char in s:\r\n if char.isupper():\r\n u+= 1\r\n else:\r\n l+= 1\r\nif u>l:\r\n res=s.upper()\r\nelse:\r\n res=s.lower()\r\n\r\nprint(res)\r\n\r\n\r\n\r\n\r\n", "a=input()\r\nl = sum(map(str.islower,a))\r\nu = sum(map(str.isupper,a))\r\nif(l<u):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "p=input()\r\nl=list(p)\r\nc=0\r\ns=0\r\nfor i in range(len(l)):\r\n if ord(l[i])>=65 and ord(l[i])<=90:\r\n c=c+1\r\n else:\r\n s=s+1\r\nfor i in range(len(l)):\r\n if s>=c and ord(l[i])>=65 and ord(l[i])<=90:\r\n l[i]=chr(ord(l[i])+32)\r\n elif c>s and ord(l[i])>=97 and ord(l[i])<=122:\r\n l[i]=chr(ord(l[i])-32)\r\nfor i in range(len(l)):\r\n print(l[i],end=\"\")", "w = input()\r\ncont = 0\r\nfor i in w:\r\n if i.lower() == i:\r\n cont+=1\r\nif 2 * cont >= len(w):\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "upper_count = 0\r\nlower_count = 0\r\nN = input()\r\nfor i in N:\r\n if i.islower():\r\n lower_count+=1\r\n else:\r\n upper_count+=1\r\n if upper_count>lower_count:\r\n N = N.upper()\r\n else:\r\n N = N.lower()\r\nprint(N)", "s=input()\r\nl1=0\r\nu1=0\r\nfor i in s:\r\n if i.islower()==True:\r\n l1=l1+1\r\n else:\r\n u1=u1+1\r\nif l1>u1:\r\n print(s.lower())\r\nelif u1>l1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = input()\r\nm = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\no ='abcdefghijklmnopqrstuvwxyz'\r\nx = []\r\ncA = 0\r\ncM = 0\r\nfor i in n:\r\n x.append(i)\r\nfor i in range(len(n)):\r\n if n[i] in m:\r\n cA += 1\r\n elif n[i] in o:\r\n cM += 1\r\nif cA > cM:\r\n print(n.upper())\r\nelif cM >= cA:\r\n print(n.lower())\r\n", "s=input()\r\ncount=0\r\ncount2=0\r\nfor i in s:\r\n if(i.isupper()):\r\n count+=1\r\n elif(i.islower()):\r\n count2+=1\r\nif(count>count2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "s=input()\r\nc=0\r\nfor i in s:\r\n if(i.isupper()):\r\n c+=1\r\no=len(s)-c\r\nif(c>o):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\nlowercase = 0\r\nuppercase = 0\r\n\r\nfor letter in word:\r\n if letter.islower():\r\n lowercase += 1\r\n elif letter.isupper():\r\n uppercase += 1\r\n\r\nif lowercase >= uppercase:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s=input()\nup=0\nlow=0\nl=len(s)\nfor i in range(l):\n\tif s[i].islower():\n\t\tlow+=1\n\telse:\n\t\tup+=1\nif up == low or low>up:\n\tst=s.lower()\nelse:\n\tst=s.upper()\nprint(st)\n", "s = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor letter in s:\r\n if ord(letter) > 90:\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a = input()\r\n\r\nlength = len(a)\r\naup=0\r\nlast=\"\"\r\n\r\nfor i in range(len(a)):\r\n if(a[i].isupper()):\r\n aup+=1\r\n pass\r\n\r\nif (aup>(length-aup)):\r\n last = a.upper()\r\n\r\nelse:\r\n last = a.lower()\r\n\r\nprint(last);", "s = input ()\r\nl = len(s)\r\nmayusculas = 0\r\nminusculas = 0\r\nfor i in range (l):\r\n if s[i].islower(): minusculas += 1\r\n else: mayusculas += 1 \r\n#print(mayusculas, minusculas)\r\nif minusculas >= mayusculas : s = s.casefold()\r\nelse: s= s.upper()\r\nprint (s)", "s=input() \r\nl=0 \r\nu=0 \r\nfor i in s:\r\n if 65<=ord(i)<=90:\r\n u+=1 \r\n else:\r\n l+=1 \r\nif u>l:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "s=input()\r\nu=0\r\nl=0\r\nfor c in s:\r\n if c.isupper()==True:\r\n u=u+1\r\n else:\r\n l=l+1\r\n \r\nif (u>l):\r\n print(s.upper())\r\nelse:\r\n \r\n print(s.lower())", "#59a\r\na=input()\r\ncl=cu=0\r\nfor i in a:\r\n if i == i.lower():\r\n cl+=1\r\n else:\r\n cu+=1\r\nif cu==cl or cl>cu:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "word = input()\r\nupper = sum(map(str.isupper, word))\r\n\r\nif upper > (len(word) - upper):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s = input()\r\ncount= 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n count += 1\r\na = abs(count - len(s))\r\nb = len(s)/2\r\nif a < b:\r\n c = s.upper()\r\n \r\nelse:\r\n c = s.lower()\r\nprint(c) \r\n \r\n", "a = input()\r\nx = 0\r\ny = 0\r\nfor i in a:\r\n if i.islower():\r\n x+=1\r\n else:\r\n y+=1\r\nif x >= y:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "S=input()\r\nA=S.lower()\r\nB=S.upper()\r\nC=len(S)\r\nprint([A,B][sum(x<'['for x in S)*2>C])", "s=input()\r\ns1=0\r\ns2=0\r\nfor i in s:\r\n if ord('a')<=ord(i)<=ord('z'):\r\n s1+=1\r\n if ord('A')<=ord(i)<=ord('Z'):\r\n s2+=1\r\nif s1>=s2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a = input()\r\nlow = 0\r\nup = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n up+=1\r\n else:\r\n low+=1\r\n\r\nprint(a.lower()) if low>=up else print(a.upper())\r\n\r\n \r\n \r\n", "s = input()\r\nuppercount = 0\r\nlowercount = 0\r\nfor letter in s:\r\n if letter == letter.upper():\r\n uppercount += 1\r\n elif letter == letter.lower():\r\n lowercount += 1\r\nif uppercount > lowercount:\r\n print(s.upper())\r\nelif uppercount <= lowercount:\r\n print(s.lower())", "def main (string):\r\n\tlowers, uppers = 0, 0\r\n\tfor i in range(len(string)):\r\n\t\tif string[i].lower() == string[i]:\r\n\t\t\tlowers += 1\r\n\t\telse:\r\n\t\t\tuppers += 1\r\n\tif uppers > lowers:\r\n\t\treturn string.upper()\r\n\treturn string.lower()\r\n\t\r\nprint(main(input()))", "word = input()\r\nhalf = (len(word))/2\r\nli = [y for x in word for y in x.split(' ')]\r\nm = 0\r\nfor i in li:\r\n x = i.islower()\r\n if(x == True):\r\n m += 1\r\nif(m > half):\r\n new = word.lower()\r\n print(new)\r\nelif(m < half):\r\n new1 = word.upper()\r\n print(new1)\r\nelif(m == half):\r\n new2 = word.lower()\r\n print(new2)", "a=input()\r\ncl=0\r\ncu=0\r\nfor i in range(len(a)):\r\n if a[i].isupper()==True:\r\n cu=cu+1\r\n elif a[i].islower()==True:\r\n cl=cl+1\r\nif cl>=cu:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s = input()\r\nlow = []\r\nupp = []\r\nfor i in s:\r\n if i.isupper():\r\n upp.append(i)\r\n else:\r\n low.append(i)\r\nif len(upp) > len(low):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nlow = 0\r\nup = 0\r\nfor i in range(len(s)):\r\n if ord(s[i]) > 95:\r\n low += 1\r\n else:\r\n up += 1\r\nif low >= up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nc1, c2 = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nprint(s.upper()) if c1 > c2 else print(s.lower())", "A=input()\r\nKA,s=0,0\r\nfor i in range(len(A)):\r\n if(ord(A[i])>=65 and ord(A[i])<=90):\r\n KA=KA+1\r\n else:\r\n s=s+1\r\n \r\nif(KA<s):\r\n d=A.lower()\r\n print(d)\r\nelif(KA==s):\r\n \r\n print(A.lower())\r\nelse:\r\n print(A.upper())", "s=[chr(i) for i in range(97,123)]\r\nx=input()\r\nt=0\r\nfor i in range(len(x)):\r\n if x[i] in s:\r\n t+=1\r\nif 2*t>=len(x):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "a = input()\r\nb = len(a)\r\nx = 0\r\ny = 0\r\nfor i in range(0,b):\r\n c = a[i]\r\n if c.isupper() == True:\r\n x = x + 1\r\n elif c.islower() == True:\r\n y = y + 1\r\n\r\nif x > y:\r\n print(a.upper())\r\nif x <= y:\r\n print(a.lower())\r\n \r\n", "enter = input()\r\nent2 = enter.lower()\r\nent3 = enter.upper()\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\nfor i in enter:\r\n l1.append(i)\r\nfor a in l1:\r\n if a == a.lower():\r\n l2.append(a)\r\n else:\r\n l3.append(a)\r\ncou_l = 0\r\ncou_up = 0\r\nfor i in l2:\r\n cou_l += 1\r\nfor x in l3:\r\n cou_up += 1\r\nif cou_l >= cou_up:\r\n print(ent2)\r\nif cou_l < cou_up:\r\n print(ent3)", "s = input()\r\ncount = 0\r\nfor i in range(0,len(s)):\r\n a = ord(s[i])\r\n if(a<97):\r\n count+=1\r\n\r\nl = len(s)\r\nif(count>l/2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "import string\r\n\r\nname = input()\r\n\r\ndef count_of(name: str):\r\n\r\n number_of_lowers = 0\r\n number_of_uppers = 0\r\n\r\n for char in name:\r\n if(char in string.ascii_lowercase):\r\n number_of_lowers += 1\r\n\r\n elif(char in string.ascii_uppercase):\r\n number_of_uppers += 1\r\n \r\n return number_of_lowers, number_of_uppers\r\n\r\n\r\ndef convert(name: str):\r\n number_of_lowers, number_of_uppers = count_of(name)\r\n\r\n if(number_of_lowers > number_of_uppers):\r\n return name.lower()\r\n\r\n elif(number_of_lowers < number_of_uppers):\r\n return name.upper()\r\n\r\n else:\r\n return name.lower()\r\n\r\nprint(convert(name))", "s = input()\r\nup= 0\r\ndown = 0\r\nfor i in s:\r\n if i.islower():\r\n down+=1\r\n else:\r\n up+=1\r\nif down>=up:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "n=input()\r\ncnt_lower = 0\r\ncnt_upper = 0\r\n \r\nfor i in n:\r\n if i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\r\n cnt_upper +=1\r\n else:\r\n cnt_lower += 1\r\n \r\nif cnt_lower > cnt_upper:\r\n print(n.lower())\r\nelif cnt_lower <cnt_upper:\r\n print(n.upper())\r\nelif cnt_upper==cnt_lower:\r\n print(n.lower())", "string = input()\r\nlower =0\r\nfor i in range(0, len(string)):\r\n if(string[i] == string[i].lower()):\r\n lower = lower+1\r\nif(lower>=len(string)/2):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "x=input()\r\nl=[]\r\nm=[]\r\nfor i in x:\r\n if i.isupper():\r\n m.append(i)\r\n else:\r\n l.append(i)\r\nif len(l)>=len(m):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "c= 0\r\nz=0 \r\ns =input()\r\nfor i in s: \r\n if i.isupper(): \r\n c= c+1\r\n else: \r\n z=z+1 \r\nif z>=c: \r\n print(s.lower())\r\nelse: \r\n print(s.upper())\r\n ", "s = input()\r\nucount,lcount = 0,0\r\nfor e in s:\r\n ucount+=e.isupper()\r\n lcount+=e.islower()\r\n# print(ucount,lcount)\r\nif ucount>lcount:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nb=0\r\nc=0\r\nfor i in a:\r\n if ord(i)>=97 and ord(i)<=122:\r\n b=b+1\r\n else:\r\n c=c+1\r\nif b<c:\r\n k=a.upper()\r\n print(k)\r\nelse:\r\n k=a.lower()\r\n print(k)", "n=input()\r\ncount=0\r\ncount1=0\r\nfor i in n:\r\n if(i>='A' and i<='Z'):\r\n count+=1\r\n if(i>='a' and i<='z'):\r\n count1+=1\r\n\r\nif(count>count1):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n \r\n", "a = input()\r\nn = 0\r\ns = 0\r\nfor x in a:\r\n if(x.isupper()):\r\n n+=1\r\n else:\r\n s += 1\r\nif(n>s):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n u=u+1\r\n elif ord(i)>=97 and ord(i)<=122:\r\n l=l+1\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x = input()\r\n\r\nlowerCnt = 0\r\nupperCnt = 0\r\n\r\nfor letter in x:\r\n \r\n if letter.islower():\r\n lowerCnt += 1\r\n else:\r\n upperCnt += 1\r\n\r\nif lowerCnt >= upperCnt:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "from re import S\n\nword = input()\ncount_upper = 0\ncount_lower = 0\nfor c in word:\n if c.isupper():\n count_upper += 1\n else:\n count_lower += 1\nif count_upper > count_lower:\n print(word.upper())\nelse:\n print(word.lower())", "s = str(input())\r\nlcount=0\r\nucount=0\r\nfor i in s:\r\n if i.islower():\r\n lcount+=1\r\n elif i.isupper():\r\n ucount+=1\r\n\r\n\r\nif lcount==ucount:\r\n print(s.lower())\r\nelif lcount>ucount:\r\n print(s.lower())\r\nelif lcount<ucount:\r\n print(s.upper())\r\n\r\n", "# I'm The King Of Pirates\r\n\r\nfrom string import ascii_lowercase as l\r\nfrom string import ascii_uppercase as u\r\n\r\n\r\nlc = 0\r\nuc = 0 \r\n\r\na = input()\r\nfor i in a:\r\n if i in l:\r\n lc+=1\r\n else:\r\n uc+=1\r\n\r\nif lc > uc :\r\n print(a.lower())\r\nelif lc < uc :\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "name =input('')\r\nupper=0\r\nlower=0\r\nfor i in name:\r\n if ord(i)<=90:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jun 17 22:04:40 2020\r\n\r\n@author: Anouar\r\n\"\"\"\r\n\r\ns = input()\r\nupper_counter = 0\r\nlower_counter = 0\r\n\r\nfor e in s:\r\n if e.isupper(): upper_counter += 1\r\n else: lower_counter += 1\r\n\r\nif upper_counter > lower_counter: print(s.upper())\r\nelse: print(s.lower())", "n = input()\r\nlength = len(n)\r\n\r\ndef count_uppercase(message):\r\n return sum([1 for c in message if c.isupper()])\r\nup = count_uppercase(n)\r\n\r\nlower = length - up\r\n\r\nif lower >= up:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "S = input()\r\nupper = sum(1 for _ in S if _.isupper())\r\nlower = sum(1 for _ in S if _.islower())\r\n\r\nif upper > lower:\r\n print(S.upper())\r\nelif upper == lower:\r\n print(S.lower())\r\nelse:\r\n print(S.lower())\r\n\r\n\r\n", "x = input()\r\nprint(x.upper() if len([True for y in x if y.isupper()]) > len(x)/2 else x.lower(), sep='\\n', end=None)\r\n", "s = input()\r\nlower=0\r\nupper=0\r\n\r\nfor x in s:\r\n if x.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=input()\r\ncap=0\r\nsmall=0\r\nfor i in word:\r\n if i.islower():\r\n small+=1\r\n else:\r\n cap+=1\r\nprint([word.upper(),word.lower()][small>=cap])\r\n", "st=input()\ncount_lower=0\ncount_upper=0\nif len(st)>= 1 and len(st)<=100:\n\tfor i in st:\n\t\tif i.islower():\n\t\t\tcount_lower+=1\n\t\telif i.isupper():\n\t\t\tcount_upper+=1\n\tif count_lower>=count_upper:\n\t\tprint(st.lower())\n\telse: \n\t\tprint(st.upper())", "\"\"\" # Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. \nThat's why he decided to invent an extension for his favorite browser that would change the letters' \nregister in every word so that it either only consisted of lowercase letters or, vice versa, only of \nuppercase ones. At that as little as possible letters should be changed in the word. For example, the \nword HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number \nof uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, \nmaTRIx should be replaced by matrix. Your task is to use the given method on one given word. \"\"\"\n\nfrom enum import Enum\n\n\nclass Case(Enum):\n UPPER = 1\n LOWER = 2\n EQUAL = 3\n CORRECT = 4\n\nupperCount = 0\nlowerCount = 0\n\nstring = input()\n\n# Counts lowercase and uppercase letters in a word \nfor letter in string:\n if letter.isupper():\n upperCount += 1\n else:\n lowerCount += 1\n\n# Checks the case of the string input\nif (upperCount == 0) or (lowerCount == 0):\n case = Case.CORRECT\n print(string)\nelif upperCount > lowerCount:\n case = Case.UPPER\n print(string.upper())\nelif lowerCount > upperCount:\n case = Case.LOWER\n print(string.lower())\nelif (upperCount == lowerCount):\n case = Case.EQUAL\n print(string.lower())\n", "word = str(input())\r\n\r\ncount_l = 0\r\ncount_u = 0\r\n\r\nfor i in word:\r\n if i.isupper() == True:\r\n count_u += 1\r\n else:\r\n count_l += 1\r\n \r\nif count_l >= count_u:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "word = input()\r\nupper = 0\r\ncount = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n upper += 1\r\n if upper > len(word)/2:\r\n count = 1\r\n break\r\n\r\nif count == 1:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s=input()\r\nu=0\r\nl=0\r\nfor a in s:\r\n if a.islower():\r\n l=l+1\r\n if a.isupper():\r\n u=u+1\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "I = [i for i in input()]\nU = [i for i in I if i.isupper()]\nL = [i for i in I if i.islower()]\nif len(U) > len(L):\n print(''.join(I).upper())\nelse:\n print(''.join(I).lower())\n\n", "# garbage.py\n\n# from pathlib import Path\n# ROOT = Path(__file__).parent.absolute()\n\ndef main():\n\n a = input()\n\n l_cnt = 0\n u_cnt = 0\n\n for i in a:\n if ord(i) >= 97:\n l_cnt += 1\n else:\n u_cnt += 1\n\n if l_cnt >= u_cnt:\n print(a.lower())\n else:\n print(a.upper())\n \n \n\nif __name__ == '__main__':\n # print(\"Running garbage.py\")\n main()\n\t \t\t\t\t \t\t \t\t \t\t\t \t \t \t", "ch=input()\r\nnbl=0\r\nnbu=0\r\nfor i in range(len(ch)):\r\n if ch[i].islower()==True:\r\n nbl+=1\r\n else:\r\n nbu+=1\r\n\r\nif nbl<nbu:\r\n print(ch.upper())\r\nelse:\r\n print(ch.lower())", "s=input()\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n l=l+1\r\n else:\r\n u=u+1\r\nif(u<=l):\r\n s=s.lower()\r\nelif(u>l):\r\n s=s.upper()\r\nprint(s)\r\n", "s = input()\r\nc = 0\r\nd = 0\r\nfor i in s:\r\n if i.isupper():\r\n c += 1\r\n else:\r\n d+= 1\r\nif c > d:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "from math import *\r\nfrom typing import *\r\n\r\nif __name__ == '__main__':\r\n up = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n low = \"abcdefghijklmnopqrstuvwxyz\"\r\n cu, cl = 0, 0\r\n word = str(input())\r\n\r\n for i in range(len(word)):\r\n if word[i] in up: cu += 1\r\n elif word[i] in low: cl += 1\r\n\r\n if cu < cl: print(word.lower())\r\n elif cu == cl: print(word.lower())\r\n else: print(word.upper())\r\n", "a = input()\r\nsmall = 0\r\nbigg = 0\r\nfor i in a:\r\n if i in \"abcdefghijklmnopqrstuvqwxyz\":\r\n small += 1\r\n else:\r\n bigg += 1\r\n\r\nif small >= bigg:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "\r\na= input()\r\nb = 0\r\nc=0 \r\nfor z in a :\r\n if ord(z) < 97 :\r\n b +=1\r\n else :\r\n c +=1 \r\nif c >= b :\r\n print(a.lower())\r\nelse :\r\n print(a.upper())", "s=input()\r\nl=0\r\nu=0\r\nfor i in range(len(s)):\r\n if(ord(s[i])>=97 and ord(s[i])<=122):\r\n l=l+1\r\n else:\r\n u=u+1\r\nif(l==u or l>u):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "str1 = input()\r\ncnt,cntupper = 0,0\r\nfor i in str1:\r\n if i.islower():\r\n cnt += 1\r\n else:\r\n cntupper += 1\r\nprint(str1.lower()) if cnt >= cntupper else print(str1.upper())", "countUpper=0\r\ncountLower=0\r\nw=input()\r\nfor i in w:\r\n if (''+i).isupper():\r\n countUpper+=1\r\n else:\r\n countLower+=1\r\nif(countLower>=countUpper):\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "# your code goes here\r\ns = input()\r\nsmall = \"abcdefghijklmnopqrstuvwxyz\"\r\nbig = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ns1 = 0\r\nb1 = 0\r\nfor i in s:\r\n\tif i in small:\r\n\t\ts1 += 1\r\n\telse:\r\n\t\tb1 += 1\r\nif s1 >= b1:\r\n\tprint(s.lower())\r\n\t\r\nelse:\r\n\tprint(s.upper())\r\n\t", "s=input()\r\nno_s=0\r\nno_l=0\r\nl='abcdefghijklmnopqrstuvwxyz'\r\nm=l.upper()\r\nfor i in s:\r\n if i not in l:\r\n no_l+=1\r\n else:\r\n no_s+=1\r\nif no_l>no_s:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = str(input())\r\ncountl = 0\r\ncountu = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n countu += 1\r\n else:\r\n countl += 1\r\n\r\nif countl >= countu:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nc1=0\r\nn=len(s)//2\r\nfor i in s:\r\n if i.isupper():\r\n c1+=1\r\nif c1>n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\nm=list(n)\r\ncount=0\r\ncount2=0\r\nfor a in m:\r\n if a.isupper():\r\n count=count+1\r\n else:\r\n count2=count2+1\r\nif count>count2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "A=list(input())\r\nn=len(A)\r\nt=0\r\ni=0\r\nwhile i<n:\r\n if A[i]==A[i].upper():\r\n t+=1\r\n else:\r\n pass\r\n i=i+1\r\nif 2*t>n:\r\n B=[i.upper() for i in A]\r\nelse:\r\n B=[i.lower() for i in A]\r\nprint(''.join(B))\r\n", "n=input()\r\na=0\r\nb=0\r\nfor i in range(len(n)):\r\n if(n[i].isupper()):\r\n a+=1\r\n else:\r\n b+=1\r\nif(a>b):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "st = input()\r\nupper,lower = 0,0\r\nfor i in st:\r\n if(i.isupper()):\r\n upper += 1 \r\n elif(i.islower()):\r\n lower+=1 \r\n\r\nif(upper > lower):\r\n st = st.upper()\r\nelse:\r\n st = st.lower()\r\nprint(st)\r\n", "t = input()\r\nucnt, lcnt = 0, 0\r\nfor i in range(len(t)):\r\n if t[i].islower():\r\n lcnt+=1\r\n else:\r\n ucnt+=1\r\n\r\nif ucnt > lcnt:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "x=input()\r\nc=0\r\nd=0\r\nfor i in x:\r\n if i.isupper():\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "b = input()\na = list(b)\nup = 0\nk = 0\nfor elem in a:\n if elem.isupper() == True:\n up += 1\n else:\n k += 1\nif up <= k:\n b.lower()\n print(b.lower())\nelif up > k:\n b.upper()\n print(b.upper())\n", "word = input()\r\nupper = 0\r\nlower = 0\r\n# length = 0\r\nfor i in word:\r\n\tif i.isupper():\r\n\t\tupper += 1\r\n\telse:\r\n\t\tlower += 1\r\n\t# length += 1\r\nif lower >= upper:\r\n\tprint(word.lower())\r\nelse:\r\n\tprint(word.upper())", "s = input()\r\nlow = 0\r\nupr = 0\r\nfor i in s:\r\n if i.islower():\r\n low+=1\r\n else:\r\n upr+=1\r\nif low>=upr:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nu=(sum(1 for i in s if i.isupper()))\r\nl=sum(1 for j in s if j.islower())\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\nlength = len(string)\nsmall = 0\ncapital = 0\nfor i in string:\n if i.isupper():\n capital = capital+1\n elif i.islower():\n small = small+1\n\nif capital>small:\n word = string.upper()\n print(word)\nelse:\n word = string.lower()\n print(word)\n\n", "s=input()\r\nx=len(s)\r\nl=0\r\nfor i in range (x) :\r\n if s[i] == s[i].upper() :\r\n l+=1\r\nif l> x/2 :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = str(input())\r\n\r\nupper_count = 0\r\n\r\nfor i in s:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n upper_count += 1\r\n\r\nlower_count = len(s) - upper_count\r\n\r\nif upper_count > lower_count:\r\n new_str = s.upper()\r\nelif upper_count <= lower_count:\r\n new_str = s.lower()\r\n\r\nprint(new_str)", "word = input()\r\nwordlwr = word.lower()\r\ncount = 0\r\nfor i in range (len(word)):\r\n\tif(word[i] == wordlwr[i]):\r\n\t\tcount += 1\r\ncntlower = count\r\ncntupper = len(word) - count\r\nif(cntlower>=cntupper):\r\n\tprint (word.lower())\r\nelse:\r\n\tprint (word.upper())", "n=input()\r\nU=0\r\nL=0\r\nfor i in range(len(n)):\r\n k=n[i]\r\n if k.isupper():\r\n U+=1\r\n else:\r\n L+=1 \r\nprint(n.upper() if U>L else n.lower())", "'''\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\ns=input()\r\nc=0\r\nc1=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n c=c+1\r\n elif(s[i].islower()):\r\n c1=c1+1\r\nif(c1>=c):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "string=input()\r\nn1=n2=0\r\nfor i in string:\r\n if i.isupper():\r\n n1+=1\r\n else:\r\n n2+=1\r\nif n1>n2:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "str = input()\r\n\r\nlower = 0\r\nl = len(str)\r\n\r\nfor letter in str:\r\n if letter.islower():\r\n lower +=1\r\n\r\nupper = l - lower\r\n\r\nif lower >= upper:\r\n str = str.lower()\r\nelse:\r\n str = str.upper()\r\n\r\nprint(str)", "strr=input()\r\nlower=len([i for i in strr if i.islower()])\r\nupper=len([i for i in strr if i.isupper()])\r\nif upper>lower:\r\n print(strr.upper())\r\nelse:\r\n print(strr.lower())", "s = input()\r\ncount1 ,count2 = 0 , 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n count1+=1\r\n else:\r\n count2+=1\r\n\r\nif count1>count2:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\n\r\nprint(s)", "n=input()\r\nq=0\r\ne=0\r\nfor i in n:\r\n if ord(i)>=65 and ord(i)<=90:\r\n q+=1\r\n else:\r\n e+=1\r\nif q>e:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s=input()\r\nuc=0\r\nlc=0\r\nfor i in range(len(s)):\r\n if ord(s[i])<96:\r\n uc+=1\r\n else:\r\n lc+=1\r\nif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\na1=0\r\na2=0\r\nfor i in a:\r\n if(i.isupper()==True):\r\n a1+=1\r\n else:\r\n a2+=1\r\nif(a1<=a2):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "s = input()\r\nuc , lc = 0 , 0 \r\nfor i in s :\r\n if i.isupper() == True :\r\n uc += 1 \r\n else :\r\n lc += 1 \r\nif uc > lc :\r\n print(s.upper())\r\nelse :\r\n print(s.lower())\r\n", "s=input()\r\nnum_lower=0\r\nnum_upper=0\r\nfor letter in s:\r\n if letter.islower():\r\n num_lower+=1\r\n else:\r\n num_upper+=1\r\n\r\nif num_upper>num_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = input()\r\n\r\nlow_cnt = 0\r\nup_cnt = 0\r\n\r\nfor i in range(0,len(n)):\r\n if n[i].islower():\r\n low_cnt +=1\r\n elif n[i].isupper():\r\n up_cnt += 1\r\n\r\nif low_cnt >= up_cnt:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "string = input()\r\nupper=0\r\nfor a in string:\r\n if(a.isupper()):\r\n upper=upper+1\r\nif(upper>(len(string)/2)):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s = input()\r\nk = 0\r\nfor i in s:\r\n if i.islower():\r\n k += 1\r\nprint(s.lower() if 2 * k >= len(s) else s.upper())", "word= input()\r\n\r\ndef restructure_word(word):\r\n lower_cnt=upper_cnt=0\r\n for c in word:\r\n if c.isupper(): upper_cnt+=1\r\n else: lower_cnt+=1\r\n if lower_cnt>=upper_cnt: return word.lower()\r\n else: return word.upper()\r\n\r\nprint(restructure_word(word))", "a = input(); print(a.lower()) if len([1 for i in a if i.isupper()]) <= len(a) // 2 else print(a.upper())\r\n", "s=input()\nc=0\nd=0\nfor i in range(len(s)) :\n if s[i].isupper() :\n c=c+1\n else:\n d=d+1\nif c==d :\n print(s[0:len(s)].lower())\nelif c>d :\n print(s[0:len(s)].upper())\nelse:\n print(s[0:len(s)].lower())\n \t \t \t \t\t \t\t\t \t\t\t", "sl = input()\r\nabc = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nm=0\r\nb=0\r\nbig = \"\"\r\nfor i in range(len(sl)):\r\n\tif sl[i]== abc[abc.find(sl[i])]:\r\n\t\t\tb+=1\r\n\telse:\r\n\t\t\tm +=1\r\nif m>b:\r\n\tbig += sl.lower()\r\n\tprint(big)\r\nelif b>m:\r\n\tbig += sl.upper()\r\n\tprint(big)\r\nelif b==m:\r\n\tbig += sl.lower()\r\n\tprint(big)\r\n", "s=input()\r\nucnt=0\r\nlcnt=0\r\nfor i in s:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n ucnt+=1\r\n else :\r\n lcnt+=1\r\nif ucnt>lcnt:\r\n print(s.upper())\r\nif lcnt>=ucnt:\r\n print(s.lower())", "n = input()\r\nt = 0\r\nl = 0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n t += 1\r\n else:\r\n l += 1\r\n\r\nif l>= t:\r\n n = n.lower()\r\nelse:\r\n n = n.upper()\r\n \r\nprint(n)", "n=input()\r\ni=0\r\nu=[]\r\nl=[]\r\nx=True\r\nwhile x==True:\r\n if x==True:\r\n if n[i]==n[i].lower() :\r\n l.append(n[i])\r\n i+=1\r\n if i==len(n):\r\n x=False\r\n if x==True:\r\n if n[i]==n[i].upper():\r\n u.append(n[i]) \r\n i+=1\r\n if i==len(n):\r\n x=False\r\n \r\nif len(u)>len(l):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s=input()\r\nk=0\r\nt1=''\r\nt2=''\r\ns1='qwertyuiopasdfghjklzxcvbnm'\r\nfor i in range(len(s)):\r\n if s[i] in s1:\r\n k+=1\r\nif k<len(s)-k:\r\n for i in range(len(s)):\r\n if s[i] in s1:\r\n k1=ord(s[i])\r\n t1+=chr(k1-32)\r\n else:\r\n t1+=s[i]\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] not in s1:\r\n k1=ord(s[i])\r\n t1+=chr(k1+32)\r\n else:\r\n t1+=s[i]\r\nprint(t1)\r\n", "s=input()\r\na='qwertyuiopasdfghjklzxcvbnm'\r\nb='QWERTYUIOPASDFGHJKLZXCVBNM'\r\nk1=0\r\nk2=0\r\nfor i in s:\r\n if i in a:\r\n k1+=1\r\n elif i in b:\r\n k2+=1\r\nif k1>=k2: print(s.lower())\r\nelse: print(s.upper())\r\n", "s = input()\r\nans = ''\r\nupper_c = 0\r\nlower_c = 0\r\nfor i in s:\r\n if i.isupper():\r\n upper_c += 1\r\n else:\r\n lower_c += 1\r\nif upper_c == lower_c:\r\n ans = s.lower()\r\nelif upper_c > lower_c:\r\n ans = s.upper()\r\nelse:\r\n ans = s.lower()\r\nprint(ans)", "s = input()\r\na = list(s)\r\nu = 0\r\nl = 0\r\nfor i in a:\r\n if i == i.upper():\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nlist1=list(s)\r\ntest=0\r\nfor i in range(0,len(list1)):\r\n if list1[i].isupper()==True:\r\n test=test+1\r\n else:\r\n test=test-1\r\nif test>0:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "x = 0\r\ny = 0\r\nz = input()\r\nfor i in z:\r\n if ord(i) > 90:\r\n x += 1\r\n else:\r\n y += 1\r\nif x >= y:\r\n for i in z:\r\n if ord(i) > 90:\r\n print(i, end=\"\")\r\n else:\r\n print(chr(ord(i)+32), end='')\r\nelse:\r\n for i in z:\r\n if ord(i) <= 90:\r\n print(i, end=\"\")\r\n else:\r\n print(chr(ord(i)-32), end='')\r\n", "mass = []\r\n\r\nstring = input()\r\n\r\nfor i in string:\r\n mass.append(i)\r\n\r\ncount1= 0\r\ncount2 = 0\r\n\r\nfor i in mass:\r\n if i >= 'A' and i <= 'Z':\r\n count1 += 1\r\n elif i >='a'and i <= 'z':\r\n count2 += 1\r\n\r\nif count1 > count2:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n \r\n\r\n \r\n", "s=str(input())\r\nA=0\r\na=0\r\nfor i in s:\r\n if i==i.upper():\r\n A+=1\r\n else:\r\n a+=1\r\nif A>a:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\nlower = len([c for c in word if c.islower()])\r\nif lower >= (len(word) - lower):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "import math\r\ns = input()\r\nl = 0\r\nfor i in range(len(s)):\r\n if(s[i]>'Z'):\r\n l = l + 1\r\nif(l>=math.ceil(len(s)/2)):\r\n print(s.lower())\r\nelse :\r\n print(s.upper())", "\n\ndef calc(s):\n upper = 0\n for char in s:\n if char.upper() == char:\n upper += 1\n if upper > len(s)/2:\n return s.upper()\n return s.lower()\n\n# get inputs\ns = input()\nprint(calc(s))\n\n\n\n\n\n", "x=input()\r\na=x\r\nlowercount=0\r\nuppercount=0\r\nx=list(map(str,str(x)))\r\nfor i in x:\r\n if i==i.lower():\r\n lowercount=lowercount+1\r\n else:\r\n uppercount=uppercount+1\r\nif(lowercount>=uppercount):\r\n a=a.lower()\r\nelse:\r\n a=a.upper()\r\nprint(a)", "s=input()\r\na=0\r\nif len(s)>0 and len(s)<=100:\r\n for i in s:\r\n if i==i.upper():\r\n a+=1\r\n if a>(len(s)/2):\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n", "n =input()\r\n\r\nstr_len =len(n)\r\ncount_lower_letter=0\r\ncount_upper_letter=0\r\n\r\nfor x in range(0,str_len):\r\n item1 =n[x]\r\n\r\n if ord(item1) < 96:\r\n count_upper_letter =count_upper_letter+1\r\n\r\n else:\r\n count_lower_letter= count_lower_letter+1\r\n\r\n#print(\"upper :\",count_upper_letter)\r\n#print(\"lower :\",count_lower_letter)\r\n\r\nif count_upper_letter>count_lower_letter:\r\n temp1=n.upper()\r\n print(temp1)\r\n\r\nelse:\r\n temp2=n.lower()\r\n print(temp2)", "import string\nimport sys\ns = sys.stdin.readlines()[0].strip()\nuppers = sum(map(lambda c: str(c).isupper(), list(s)))\nif uppers * 2 > len(s):\n print(s.upper())\nelse:\n print(s.lower())\n", "n = input()\r\nle = [i.islower() for i in n].count(True)\r\nprint(n.lower() if le >= (len(n) - le) else n.upper())\r\n", "w = input()\r\nu = 0\r\nl = 0\r\nfor c in w:\r\n if c.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u > l:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "def main():\r\n y = input()\r\n lower = len([x for x in y if x.islower()])\r\n upper = len([x for x in y if x.isupper()])\r\n\r\n if upper > lower:\r\n print(y.upper())\r\n else:\r\n print(y.lower())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "i=0;j=0;\r\ns=input()\r\nfor k in s:\r\n if k.islower():\r\n i+=1\r\n else:\r\n j+=1\r\nif(i>=j):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "\r\nstring_name = input()\r\n\r\nupper_counter = 0\r\nfor char in string_name: \r\n if char.isupper():\r\n upper_counter += 1\r\n \r\nlower_counter = len(string_name) - upper_counter\r\n\r\nif upper_counter > lower_counter: \r\n print(string_name.upper())\r\nelse:\r\n print(string_name.lower())", "inp = input()\r\nlowercaseCounter = 0\r\nuppercaseCounter = 0\r\nfor i in inp:\r\n if i.islower():\r\n lowercaseCounter += 1\r\n else:\r\n uppercaseCounter += 1\r\n \r\nif lowercaseCounter > uppercaseCounter:\r\n print(inp.lower())\r\nelif uppercaseCounter > lowercaseCounter:\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())", "word = input()\r\nnum_of_lower = 0\r\nnum_of_upper = 0\r\nfor x in word:\r\n if x.islower():\r\n num_of_lower += 1\r\n else:\r\n num_of_upper += 1\r\n\r\nprint(word.upper() if num_of_upper > num_of_lower else word.lower())", "word=input()\r\n\r\nlow=len(word)\r\n\r\nupper=\"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\n\r\nupcount=0\r\n\r\nfor i in word:\r\n if i in upper:\r\n upcount+=1\r\nif upcount==low/2:\r\n print(word.lower())\r\nelif upcount<low/2:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = input()\r\n\r\nn = len(s)\r\nn_upper = len([x for x in s if x.isupper()])\r\n\r\nif n_upper > n // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nu_count = 0 \r\nl_count = 0 \r\nfor i in s:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n u_count += 1 \r\n elif ord(i) >= 97 and ord(i) <= 122:\r\n l_count += 1 \r\n \r\nif u_count > l_count:\r\n print(s.upper())\r\nelif u_count < l_count:\r\n print(s.lower())\r\nelif u_count == l_count:\r\n print(s.lower())", "word = input()\ncountUpper = 0\ncountLower = 0\n\nfor letter in word:\n if letter in \"QWERTYUIOPASDFGHJKLZXCVBNM\":\n countUpper += 1\n elif letter in \"qwertyuiopasdfghjklzxcvbnm\":\n countLower += 1\n \nif countUpper > countLower:\n word = word.upper()\nelse:\n word = word.lower()\n\nprint(word)\n", "a=input()\r\nc=91\r\nd=len(a)\r\nx=0\r\ny=0\r\nfor i in range (d):\r\n if a[i].isupper():\r\n x=x+1\r\n else:\r\n y=y+1\r\n \r\nif x>y:\r\n print(a.upper())\r\nelse:\r\n print(a.lower()) ", "chars = input()\r\nlower = 0\r\nupper = 0\r\n\r\nfor i in chars:\r\n if ord(i) >= 97:\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif upper > lower:\r\n print( chars.upper())\r\nelse:\r\n print( chars.lower())\r\n", "s = input()\r\nl = 0\r\nfor i in s:\r\n if i.islower():\r\n l+=1\r\nu = len(s)-l\r\nif l>=u:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "word = input()\r\nlower_letters = 0\r\nupper_letters = 0\r\n\r\nfor i in range(len(word)):\r\n if word[i].islower():\r\n lower_letters += 1\r\n if word[i].isupper():\r\n upper_letters += 1\r\n\r\nif lower_letters < upper_letters:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nu = sum(1 for c in s if c.isupper())\r\nv = len(s) - u\r\nif u > v:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "s = input()\r\n\r\nsl = list(s)\r\n\r\nlow = 0\r\nup = 0\r\n\r\nfor i in range(len(sl)):\r\n if sl[i].islower():\r\n low+=1\r\n else:\r\n up+=1\r\nif up>low:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "a = ['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\nword = str(input())\r\nnum = len(word)\r\np=[]\r\nfor i in word:\r\n if i in a:\r\n p.append(i)\r\nlower = len(p)\r\ncap = num - lower\r\n\r\nif cap <= lower:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = str(input())\r\ns_upper = s.upper()\r\nbound = len(s)/2\r\nc = 0\r\nf = False\r\nfor l, l_upper in zip(s, s_upper):\r\n if l == l_upper:\r\n c+=1\r\n if c > bound:\r\n f=True\r\n break\r\nif f:\r\n print(s_upper)\r\nelse:\r\n print(s.lower())", "\nword = input()\nw = word\nlower = 0\nupper = 0\n\nfor i in range(len(w)):\n if w[i].isupper():\n upper += 1\n else:\n lower += 1\nif upper > lower:\n print(word.upper())\nelse:\n print(word.lower())\n\n \t\t \t \t\t\t\t \t\t\t\t\t\t \t \t \t\t", "s = input()\nn, m = 0, 0\n\nfor i in s:\n if i >= 'A' and i <= 'Z':\n m += 1\n else:\n n += 1\nprint(s.lower() if n > m else (s.upper() if n < m else s.lower()))", "x = input()\r\ncount = 0\r\nfor y in x:\r\n if y.isupper():\r\n count += 1\r\n\r\nif count > len(x) // 2:\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\n\r\nprint(x)\r\n", "s=input()\r\ncntu,cntl=0,0\r\nfor i in s:\r\n if i.isupper()== True:\r\n cntu+=1\r\n if i.islower() ==True:\r\n cntl+=1\r\nif(cntu>cntl):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n ", "s=input()\r\nlcount = 0\r\nucount = 0\r\nfor i in s:\r\n if i.isupper():\r\n ucount += 1\r\n else:\r\n lcount += 1\r\nif ucount < lcount or ucount == lcount:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nn=len(s)\r\na=s.lower()\r\nb=s.upper()\r\nx=0\r\nfor i in range(n):\r\n if s[i]==a[i]:\r\n x+=1\r\nif 2*x>=n:\r\n print(a)\r\nelse:\r\n print(b)\r\n", "word = input()\r\nuppers = 0\r\nlowers = 0\r\nfor i in word:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n uppers += 1\r\n else:\r\n lowers += 1\r\nif uppers > lowers:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n=input()\r\nsc,cc=0,0\r\nfor i in range(len(n)):\r\n if(ord(n[i])>=97 and ord(n[i])<=122):\r\n sc+=1\r\n else:\r\n cc+=1\r\nif(cc<=sc):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n ", "word = input()\nl = 0\nu = 0\n\nfor ltr in word:\n\tif ltr.isupper(): u+=1\n\telif ltr.islower(): l+=1\n\nif l == u:\n\tword = word.lower()\nelif l > u:\n\tword = word.lower()\nelif l < u:\n\tword = word.upper()\n\t\nprint(word)", "s = input()\r\ncaptal = 0\r\nlower = 0\r\nfor i in s:\r\n if(ord(i)>=65 and ord(i)<97):\r\n captal+=1\r\n else:\r\n lower+=1\r\nif(captal>lower):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nlowercount=0\r\nuppercount=0\r\nl=[]\r\nfor i in s:\r\n if (ord(i)>64 and ord(i)<91):\r\n uppercount+=1\r\n else:\r\n lowercount+=1\r\n l.append(i)\r\nif (lowercount>uppercount or lowercount==uppercount):\r\n for i in range(len(l)):\r\n if (ord(l[i])>64 and ord(l[i])<91):\r\n l[i]=l[i].lower()\r\nelif (lowercount<uppercount):\r\n for i in range(len(l)):\r\n if (ord(l[i])>96 and ord(l[i])<123):\r\n l[i]=l[i].upper()\r\ns=\"\".join(l)\r\nprint(s)", "s = input()\r\nh = 0\r\nl = 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].upper():\r\n h+=1\r\n else:\r\n l+=1\r\nif h>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\na = b = 0\r\nfor i in s:\r\n if i.islower():\r\n a += 1\r\n else:\r\n b += 1\r\nif b > a:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nd={'u':0,'l':0}\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n d['l']+=1\r\n else:\r\n d['u']+=1\r\nif(d['l']>=d['u']):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if(i>='a' and i<='z'):\r\n c1+=1\r\n else:\r\n c2+=1\r\nif(c2>c1):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=input()\r\ncountU=0\r\ncountL=0\r\nfor i in word:\r\n if i.isupper() ==True:\r\n countU+=1\r\n if i.islower() ==True:\r\n countL+=1\r\n\r\nif countL == countU:\r\n print(word.lower())\r\nif countU <countL:\r\n print(word.lower())\r\nif countU>countL:\r\n print(word.upper())\r\n", "n=input()\r\na=0\r\nb=0\r\nfor i in range(0,len(n)):\r\n if n[i].isupper():\r\n a=a+1\r\n else:\r\n b=b+1\r\nif a>b:\r\n print(n.upper())\r\nelse:\r\n print(n.lower()) \r\n\r\n", "word = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor x in word:\r\n if x.isupper():\r\n upper+=1\r\n\r\n else:\r\n lower+=1\r\nif upper > lower:\r\n word = word.upper()\r\n\r\nelse:\r\n word = word.lower()\r\n\r\n\r\n\r\nprint(word)\r\n\r\n", "s=input()\r\nt=0\r\nt2=0\r\n\r\nfor x in s:\r\n if x>='A' and x<='Z':\r\n t+=1\r\n else:\r\n t2+=1\r\n\r\nif(t==t2):\r\n print(s.lower())\r\nelif t>t2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "n=input()\r\nc=0\r\nfor i in n:\r\n if i.isupper():\r\n c=c+1\r\nd=len(n)-c\r\nif c>d:\r\n print(n.upper())\r\nelif c<d:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())\r\n", "s = str(input())\r\n\r\nb = len(s)\r\n\r\ncl = 0\r\ncu = 0\r\n\r\nfor i in range(b):\r\n\tif s[i].islower():\r\n\t\tcl+=1\r\n\telif s[i].isupper():\r\n\t\tcu+=1\r\n\r\nif cl>=cu:\r\n\tprint(s.lower())\r\nelif cu>cl:\r\n\tprint(s.upper())\r\n", "a = input()\r\nbig = 0\r\nsmall = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n big += 1\r\n else:\r\n small += 1\r\nif small >= big:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "h=input()\nc=0\nd=0\nfor i in h:\n if i.islower():\n c+=1\n if i.isupper():\n d+=1\nif c>d:\n print(h.lower())\nif d>c:\n print(h.upper())\nif d==c:\n print(h.lower())\n \n \n \t\t \t \t\t\t\t\t \t\t \t\t \t \t\t\t\t", "word = input()\r\n\r\nlower = 0\r\nupper = 0\r\n\r\nfor i in word:\r\n if i >= 'a' and i <= 'z':\r\n lower += 1\r\n elif i >= 'A' and i <= 'Z':\r\n upper += 1\r\n\r\nif lower > upper:\r\n print(word.lower())\r\nelif lower == upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = input()\r\n\r\nu =0\r\nl =0\r\n\r\nfor x in s:\r\n if x.islower() == True:\r\n l+=1\r\n else:\r\n u+=1\r\n\r\nif l >= u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n \r\n", "string=input()\r\ncountc=0\r\ncountl=0\r\nfor i in string:\r\n\tif i.isupper():\r\n\t\tcountc+=1\r\n\telse:\r\n\t\tcountl+=1\r\nif countl>=countc:\r\n\tl=string.lower()\r\nelse:\r\n\tl=string.upper()\r\nprint(l)\r\n", "word = input().strip()\r\nupper = 0\r\nalphabet = [\"Q\",\"W\",\"E\",\"R\",\"T\",\"Y\",\"U\",\"I\",\"O\",\"P\",\"A\",\"S\",\"D\",\"F\",\"G\",\"H\",\"J\",\"K\",\"L\",\"Z\",\"X\",\"C\",\"V\",\"B\",\"N\",\"M\"]\r\nfor x in word:\r\n if x in alphabet:\r\n upper = upper + 1\r\nif upper > len(word)//2:\r\n print (word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nccount=0\r\nlcount=0\r\nfor l in s: \r\n if l.isupper():\r\n ccount+=1\r\n else:\r\n lcount+=1\r\nif ccount>lcount:\r\n print(s.upper())\r\nelif ccount<lcount or ccount==lcount:\r\n print(s.lower())\r\n ", "s = input ()\r\nA = 0\r\nb = 0\r\nfor c in s:\r\n if c.islower():\r\n b=b+1\r\n if c.isupper():\r\n A=A+1\r\nif A>b:\r\n print(s.upper())\r\nelif b>A:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "a=input()\r\nc=0\r\nd=0\r\nfor i in a:\r\n if(i.isupper()):\r\n c+=1\r\n elif(i.islower()):\r\n d+=1\r\nif d>=c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "n = input()\r\n \r\nn_ = len(n)\r\ncount_lower = 0\r\ncount_upper = 0\r\n \r\nfor i in n:\r\n if i == i.lower():\r\n count_lower += 1\r\n elif i == i.upper():\r\n count_upper += 1\r\n \r\nif count_lower > count_upper:\r\n print(n.lower())\r\nelif count_lower < count_upper:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = input()\r\ndownCase = \"abcdefghijklmnopqrstuvwxyz\"\r\nupperCase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndown = 0\r\nup = 0\r\nresult = \"\"\r\n\r\nfor i in range(len(s)):\r\n if s[i] in downCase:\r\n down += 1\r\n if s[i] in upperCase:\r\n up += 1\r\nif down >= up:\r\n for i in range(len(s)):\r\n if s[i] in downCase:\r\n for j in range(len(downCase)):\r\n if downCase[j] == s[i]:\r\n result += downCase[j]\r\n if s[i] in upperCase:\r\n for j in range(len(upperCase)):\r\n if upperCase[j] == s[i]:\r\n result += downCase[j]\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] in downCase:\r\n for j in range(len(downCase)):\r\n if downCase[j] == s[i]:\r\n result += upperCase[j]\r\n if s[i] in upperCase:\r\n for j in range(len(upperCase)):\r\n if upperCase[j] == s[i]:\r\n result += upperCase[j]\r\nprint(result)\r\n", "word=input()\r\ncu=0\r\ncl=0\r\nfor i in word:\r\n if i.isupper():\r\n cu+=1\r\n else:\r\n cl+=1\r\nif cu>cl:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s=input()\r\nl=0\r\nu=0\r\nfor i in s:\r\n if (i>='a' and i<='z') :\r\n l+=1\r\nif l>=len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word=input()\r\nx=list(word)\r\ns1=0\r\ns2=0\r\nfor letter in x:\r\n if letter.isupper()==True:\r\n s1+=1\r\n else:\r\n s2+=1\r\nif s1>s2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s=input()\r\nu=0\r\nl=0\r\nfor ch in s:\r\n if ch.isupper():\r\n u=u+1\r\n else:\r\n l=l+1\r\n\r\nif l<u:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\n\r\nprint(s)", "t=input()\r\nup=0;low=0 \r\nfor i in t:\r\n if i.isupper()==True:\r\n up+=1\r\n elif i.islower()==True:\r\n low+=1\r\nif up>low:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "s = input()\r\nsumu = 0\r\nsuml = 0\r\nsumu = sum(1 for words in s if words.isupper())\r\nsuml = sum(1 for words in s if words.islower())\r\nif sumu > suml:\r\n print(s.upper())\r\nelif sumu < suml:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nA. Word\n\nhttps://codeforces.com/problemset/problem/59/A\n\n\"\"\"\n\n#大写：65-90，小写：97-122，用ord函数#\ns = input()\nl = len(s)\na = 0\nb = 0\nfor i in range(0,l):\n if ord(s[i])>95:\n a+=1\n else:\n b+=1\n continue\nif a>=b:\n print(s.lower())\nelse:\n print(s.upper())\n", "sum1 = 0\r\nsum2 = 0\r\nm = input()\r\nw = m.split()\r\nfor i in m:\r\n if (i.isupper() == True):\r\n sum1 +=1\r\n else :\r\n sum2+=1\r\nif (sum1>sum2):\r\n print(m.upper())\r\nelse :\r\n print(m.lower())\r\n", "a = input()\r\nb = a.upper()\r\nc = a.lower()\r\nx = 0\r\nfor i in range(len(a)):\r\n if a[i]==b[i]:\r\n x = x+1\r\n else:\r\n pass \r\nif x>len(a)-x:\r\n print(b)\r\nelse:\r\n print(c)\r\n", "s = input()\r\nlower = \"\"\r\nupper = \"\"\r\nfor i in s:\r\n if i.isupper():\r\n upper += i\r\n elif i.islower():\r\n lower += i\r\n\r\nif len(lower)>=len(upper):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "l = input()\r\nl2 = [x.isupper() for x in l]\r\nif l2.count(1)>l2.count(0):\r\n print(l.upper())\r\nelse:\r\n print(l.lower())", "line = input()\r\nlow_letters = 0\r\nup_letters = 0\r\nfor i in line:\r\n if i.isupper():\r\n up_letters += 1\r\n else:\r\n low_letters += 1\r\nif low_letters >= up_letters:\r\n print(line.lower())\r\nelse:\r\n print(line.upper())", "x = input()\r\ns=l=0\r\nfor i in x :\r\n if ord(i) in range(97,123):\r\n s+=1\r\n else:\r\n l+=1\r\nif s>l or s==l :\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n", "from string import ascii_uppercase as upper\n\ncount = 0\n\na = input()\n\nfor letter in a:\n if letter in upper:\n count += 1\n\nif count > len(a) // 2:\n print(a.upper())\nelse:\n print(a.lower()) ", "word=input()\r\nncount=0\r\nfor i in word:\r\n if ord(i)>=65 and ord(i)<=90:\r\n ncount+=1\r\nif ncount*2>len(word):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n ", "lowercase = \"qwertyuiopasdfghjklzxcvbnm\"\n\nword = input()\nwordlen = len(word)\nnumlow = numup = 0\nfor i in range(0, wordlen):\n if(word[i] in lowercase):\n numlow+=1\n else:\n numup+=1\n if(numlow > wordlen/2):\n print(word.lower())\n break;\n elif(numup > wordlen/2):\n print(word.upper())\n break;\nif((numlow == numup) and (numlow == wordlen/2)):\n print(word.lower())\n\n \t \t\t\t\t \t\t \t\t\t\t \t \t \t \t\t", "s=input()\r\nup=[]\r\nlow=[]\r\nfor i in s:\r\n if i.isupper():\r\n up.append(i)\r\n else:\r\n low.append(i)\r\nif len(up)>len(low):\r\n s=s.upper()\r\nelif len(up)==len(low):\r\n s=s.lower()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "s = input()\r\ncl = 0\r\ncu = 0\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n cl+=1\r\n else:\r\n cu +=1\r\n \r\nif cl>=cu:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nupper=sum(c.isupper() for c in s)\r\nlower=len(s)-upper\r\nif upper>lower:\r\n cw=s.upper()\r\nelse:\r\n cw=s.lower()\r\nprint(cw)", "uppers = 0\nlowers = 0\n\ns = input()\n\nfor x in list(s):\n if x.isupper():\n uppers += 1\n else:\n lowers += 1\n\nif uppers > lowers:\n print(s.upper())\nelse:\n print(s.lower())", "def solution(word):\r\n nbLowerCaseLetters = 0\r\n nbUpperCaseLetters = 0\r\n for letter in word:\r\n if letter.islower():\r\n nbLowerCaseLetters += 1\r\n else:\r\n nbUpperCaseLetters += 1\r\n\r\n if nbUpperCaseLetters > nbLowerCaseLetters:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n \r\n \r\n\r\nprint(solution(input()))\r\n\r\n", "s = input()\nprint(s.lower()) if list(x.islower() for x in s).count(True) >= list(x.isupper() for x in s).count(True) else print(s.upper())\n\n\t\t\t\t \t\t \t \t \t \t \t \t \t \t", "s = input()\nn1 = sum(1 for x in s if x.isupper())\nn2 = sum(1 for x in s if x.islower())\nif n2>=n1:\n print(s.lower())\nelse:\n print(s.upper())", "s = input()\r\nupper = 0\r\nfor c in s:\r\n if c >= 'A' and c <= 'Z':\r\n upper += 1\r\n else:\r\n upper -= 1\r\nif upper <= 0:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)", "x = input()\r\nupper = 0\r\nlower =0\r\nfor k in x:\r\n if ord(k) >=65 and ord(k)<= 91:\r\n upper = upper+1\r\n else:\r\n lower = lower +1\r\nif(lower>=upper):\r\n x=x.lower()\r\nelse:\r\n x=x.upper()\r\nprint(x)", "s=str(input())\r\ns1=sum(map(str.isupper, s))\r\ns2=sum(map(str.islower, s))\r\nif s1>s2:\r\n print(s.upper()) \r\nelse:\r\n print(s.lower())", "y=input()\nl=0\nu=0\nfor i in y:\n if i.islower() == True :\n l += 1\n else:\n u += 1\nif l >= u :\n print(y.lower())\nelse:\n print(y.upper())\n\n \t\t \t\t \t \t\t\t\t\t \t \t \t \t\t \t\t \t\t", "x = input()\r\ncountu=0\r\ncountl=0\r\nfor i in x:\r\n if(i.islower()):\r\n countl=countl+1\r\n elif(i.isupper()):\r\n countu=countu+1\r\n \r\nif countu > countl :\r\n\tx = x.upper()\r\n\tprint(x)\r\nelse :\r\n\tx = x.lower()\r\n\tprint (x)", "s=input()\r\n\r\nbigc=0\r\nsc=0\r\n\r\nfor i in s:\r\n if (i==i.upper()):\r\n bigc+=1\r\n else:\r\n sc+=1\r\n\r\nif (sc>bigc):\r\n print(s.lower())\r\nelif(sc<bigc):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nbg=0\r\nfor i in s:\r\n if i>='A' and i<='Z':\r\n bg+=1\r\nif bg>len(s)/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nss = s.upper()\r\nkol = 0\r\nfor i in range(len(s)):\r\n if s[i] != ss[i]:\r\n kol += 1\r\nif kol >= len(s) - kol:\r\n print(s.lower())\r\nelse:\r\n print(ss)\r\n", "s=input()\r\nup=0\r\nlo=0\r\nfor i in s:\r\n if(i.isupper()):\r\n up+=1\r\n else:\r\n lo+=1\r\nif(up>lo):\r\n s1=s.upper()\r\nelse:\r\n s1=s.lower()\r\nprint(s1)", "# n=int(input())\r\n# s1=0\r\n# s2=0\r\n# s3=0\r\n# for _ in range(n):\r\n# x,y,z=(map(int,input().split()))\r\n# s1=s1+x\r\n# s2=s2+y\r\n# s3=s3+z\r\n#\r\n# if s1==0 and s2==0 and s3==0:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# l=[]\r\n# for i in range(5):\r\n# arr=list(map(int,input().split()))\r\n# l.append(arr)\r\n# # print(l)\r\n# x,y=3,3\r\n# for i in range(1,6):\r\n# for j in range(1,6):\r\n# if l[i-1][j-1]==1:\r\n# print(abs(x-i)+abs(y-j))\r\n\r\n\r\n# n,t=map(int,input().split())\r\n# s=input()\r\n#\r\n# for i in range(t):\r\n#\r\n#\r\n# s=s.replace(\"BG\",'GB')\r\n#\r\n#\r\n# print(s)\r\n\r\n# s=input()\r\n# for i in range(len(s)):\r\n# s = s.replace(\"--\", '2')\r\n# s = s.replace(\"-.\", \"1\")\r\n# s=s.replace(\".\",'0')\r\n#\r\n#\r\n#\r\n# print(s)\r\n# n=int(input())\r\n# n = n + 1\r\n# res = set(map(int, str(n)))\r\n# # print(res)\r\n#\r\n# while len(res)!=4:\r\n# n=n+1\r\n# res = set(map(int, str(n)))\r\n# if len(res)==4:\r\n# break\r\n#\r\n# print(n)\r\n\r\ns=input()\r\nc1=0\r\nc2=0\r\nfor i in range(len(s)):\r\n # print(s[i])\r\n if 65<=ord(s[i])<=90:\r\n c1+=1\r\n elif 97<=ord(s[i])<=122:\r\n c2+=1\r\n# print(c1)\r\n# print(c2)\r\nif c1>c2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 27 11:02:19 2021\r\n\r\n@author: cheehong\r\n\"\"\"\r\ndef count_upper_case_letters(str_obj):\r\n count = 0\r\n for elem in str_obj:\r\n if elem.isupper():\r\n count += 1\r\n return count\r\nk=input()\r\nif count_upper_case_letters(k)>len(list(k))//2:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "s1=input()\r\ncount1=0\r\ncount2=0\r\nfor i in s1:\r\n if i<='z' and i>='a':\r\n count1+=1\r\n else:\r\n count2+=1\r\nif count1>=count2:\r\n s2=s1.lower()\r\n print(s2)\r\nelse:\r\n s2=s1.upper()\r\n print(s2)", "x = input()\nsl = cl = 0\nfor i in range(len(x)):\n if(x[i].isupper()):\n cl+=1\n else:\n sl+=1\nif(cl>sl):\n print(x.upper())\nelse:\n print(x.lower())\n\n#MY_CODE_COPIED_FROM_MY_CODEFORCES_ACCOUNT[Badree_31987]\n \t \t\t \t\t\t\t\t \t \t \t \t \t", "word = input()\r\n\r\nupper = []\r\nlower = []\r\n\r\n\r\nfor char in word:\r\n if char == char.upper():\r\n upper.append(char)\r\n else:\r\n lower.append(char)\r\n\r\nif len(upper) == len(lower) or len(upper) < len(lower):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n\r\n", "def aaa(b):\r\n c,d=0,0\r\n for i in range(0,len(b)):\r\n if ord(b[i])<97:\r\n c+=1\r\n else:\r\n d+=1\r\n return c>d\r\na=input()\r\naa=list(a)\r\nif aaa(aa):\r\n print(a.upper())\r\nelif not aaa(aa):\r\n print(a.lower())\r\n", "up=0\r\nlo=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up=up+1\r\n else :\r\n lo=lo+1\r\nif up>lo:\r\n upper=s.upper()\r\n print(upper)\r\nelse:\r\n lower=s.lower()\r\n print(lower)\r\n", "s=input()\r\nc=c1=0\r\nfor i in s:\r\n\tif i>='a' and i<='z':\r\n\t\tc+=1\r\n\telif i>='A' and i<='Z':\r\n\t\tc1+=1\r\nif c>=c1:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())\r\n\t", "n=input('')\r\nx=list(n)\r\nu=0\r\nl=0\r\nfor a in range(len(n)):\r\n if(x[a].isupper()):\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nif(u>l):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "word = input()\nsmall, large = 0, 0\n\nfor letter in word:\n if letter >= 'A' and letter <= 'Z':\n large += 1\n else:\n small += 1\n\n\nif small < large:\n word = word.upper()\nelse:\n word = word.lower()\n\nprint(word)", "s = input()\r\nlow = 0\r\nupp = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n low += 1\r\n else:\r\n upp += 1\r\nif low < upp:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "input = input()\r\ncount = 0 \r\nfor i in input:\r\n if i == i.upper():\r\n count += 1\r\ncnt = len(input) - count\r\n\r\nstring = \"\"\r\nif count == cnt:\r\n for i in input:\r\n string += i.lower()\r\n print(string)\r\nelif count > cnt:\r\n for i in input:\r\n string += i.upper()\r\n print(string)\r\nelse:\r\n for i in input:\r\n string += i.lower()\r\n print(string)", "x = str(input())\r\nlista = []\r\nfor i in x:\r\n lista.append(i)\r\n\r\ns = 0\r\nn = 0\r\nveliko = 0\r\nmalo = 0\r\nwhile s < len(x):\r\n if lista[n].isupper():\r\n veliko += 1\r\n else:\r\n malo += 1\r\n \r\n n += 1\r\n s += 1\r\n\r\nif veliko > malo:\r\n z = x.upper()\r\nelse:\r\n z = x.lower()\r\n\r\nprint(z)", "ss = input(); x = sum(1 for i in ss if i < 'a');\r\nprint(ss.upper() if x > len(ss) - x else ss.lower());\r\n\r\n", "s = str(input())\r\n\r\ncounter = 0\r\n\r\nfor c in s:\r\n if c.isupper():\r\n counter += 1\r\n\r\nif counter <= len(s) / 2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\nsmall = 0\r\nbig = 0\r\nfor i in s:\r\n if ord(i) in range(ord('a'), ord('z')+1):\r\n small += 1\r\n else:\r\n big += 1\r\nif big > small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nuppercase_count=sum(1 for char in s if char.isupper())\r\nlowercase_count=len(s)-uppercase_count\r\nif uppercase_count> lowercase_count:\r\n correctword=s.upper()\r\nelse:\r\n correctword=s.lower()\r\nprint(correctword)\r\n", "word=input()\r\nl = []\r\nfor x in range(len(word)):\r\n if word[x] == word[x].upper():\r\n l.append(x)\r\nif len(word)/2 < len(l): print(word.upper())\r\nelse: print(word.lower())", "\nword = str ( input ( ) )\nlowerCase = 0\nupperCase = 0\nl = len ( word )\n\nfor x in range ( l ):\n if word [ x ] >= \"A\" and word [ x ] <= \"Z\":\n upperCase += 1\n elif word [ x ] >= \"a\" and word [ x ] <= \"z\":\n lowerCase += 1\n\nif upperCase > lowerCase:\n print ( word.upper ( ) )\nelse:\n print ( word.lower ( ) )\n\n\n", "s = str(input())\r\nkolvo_melkix = 0\r\n\r\nfor i in s:\r\n if ord(i) >= 92:\r\n kolvo_melkix += 1\r\n\r\nif len(s) - kolvo_melkix > kolvo_melkix:\r\n for x in range(len(s)):\r\n a = s[x:x+1]\r\n if ord(a) >= 92:\r\n s = s[0:x] + chr(ord(a) - 32) + s[x+1:len(s)]\r\n \r\nelse:\r\n for x in range(len(s)):\r\n a = s[x:x+1]\r\n if ord(a) < 92:\r\n s = s[0:x] + chr(ord(a) + 32) + s[x+1:len(s)]\r\nprint(s)\r\n \r\n", "word=input()\r\nL=0\r\nU=0\r\nfor i in word:\r\n if(ord(i) >=65 and ord(i) <= 90):\r\n U+=1\r\n elif(ord(i)>=97 and ord(i)<=122):\r\n L+=1\r\nif(L>=U):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n \r\n \r\n", "a=str(input())\r\n\r\nn=list(a)\r\ns=0\r\ns1=0\r\nfor j in n:\r\n i=ord(j)\r\n if i>= 65 and i<=90:\r\n s=s+1\r\n## зaглавные буквы \r\n else:\r\n s1=s1+1\r\nif s>s1:\r\n print(a.upper())\r\nelif s<=s1:\r\n print(a.lower())\r\n", "a = input()\r\nlow =0\r\nup = 0\r\nfor i in range(len(a)):\r\n ch = a[i]\r\n if ch.isupper():\r\n up+=1\r\n else:\r\n low += 1\r\nif up>low:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "string = input()\r\nupper = 0\r\nlower = 0\r\nup=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nlo=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in string:\r\n if i in up:\r\n upper+=1\r\n elif i in lo:\r\n lower+=1\r\nif upper > len(string)/2:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "# n = int(input())\r\n# words = [input() for i in range(n)]\r\n# def shorter(word):\r\n# if len(word) <= 10:\r\n# return word\r\n# else:\r\n# return word[0] + str(len(word)-2) + word[-1]\r\n\r\n# for i in words:\r\n# print(shorter(i))\r\n\r\n\r\n# n = int(input())\r\n# sol = [input().split(\" \") for i in range(n)]\r\n# soln = 0\r\n# for item in sol:\r\n# if item.count(\"1\")>=2:\r\n# soln += 1\r\n# print(soln)\r\n\r\n\r\n# n, k = input().split(\" \")\r\n# score = input().split(\" \")\r\n# count = 0\r\n# for i in score:\r\n# if int(i) >= int(score[int(k) - 1]) and int(i) != 0:\r\n# count+=1\r\n# print(count)\r\n\r\n\r\n# m, n = list(map(int,input().split(\" \")))\r\n# print(m*n//2)\r\n\r\n# from functools import reduce\r\n# n = int(input())\r\n# ops = [input() for i in range(n)]\r\n# def operation_(op):\r\n# x = 0\r\n# if op.find(\"++\") != -1:\r\n# x += 1\r\n# elif op.find(\"--\") != -1:\r\n# x -= 1\r\n# return x\r\n# print(sum(list(map(operation_, ops))))\r\n\r\n\r\n# idx = [input().split() for i in range(5)]\r\n# row = 0\r\n# col = 0\r\n# for id in idx:\r\n# row += 1\r\n# try:\r\n# col = id.index(\"1\") + 1\r\n# break\r\n# except:\r\n# pass\r\n# print(abs(3-row)+abs(3-col))\r\n\r\n\r\n# s1 = input().lower().split(\" \")\r\n# s2 = input().lower().split(\" \")\r\n# if s1 != s2:\r\n# for a, b in zip(s1, s2):\r\n# if a == b:\r\n# continue\r\n# else:\r\n# if a < b:\r\n# print(-1)\r\n# elif a > b:\r\n# print(1)\r\n# else:\r\n# print(0)\r\n\r\n\r\n# s = sorted(input().split('+'))\r\n# for num in s[:-1]:\r\n# print(num, end=\"\")\r\n# print(\"+\", end=\"\")\r\n# print(s[-1])\r\n\r\n\r\n# A. Word Capitalization\r\n# wprd = input()\r\n# print(wprd[0].upper()+wprd[1:])\r\n\r\n\r\n# A. Boy or Girl\r\n# name = input()\r\n# username = [i for i in name]\r\n# username = list(set(username))\r\n# try:\r\n# username.remove(\" \")\r\n# except:\r\n# pass\r\n# unq = len(username)\r\n# if unq%2 == 0:\r\n# print(\"CHAT WITH HER!\")\r\n# elif unq%2 == 1:\r\n# print(\"IGNORE HIM!\")\r\n\r\n\r\n# Stones on the Table\r\n# n = int(input())\r\n# s = input()\r\n# a = 0\r\n# for i in range(n-1):\r\n# if s[i] == s[i+1]:\r\n# a+=1\r\n# print(a)\r\n\r\n#Bear and Big Brother\r\n# a, b = list(map(int, input().split(\" \")))\r\n# def time_needed(a, b):\r\n# t = 0\r\n# a1 = a\r\n# b1 = b\r\n# while a1<=b1:\r\n# a1 = a1*3\r\n# b1 = b1*2\r\n# t += 1\r\n# return t\r\n# print(time_needed(a, b))\r\n\r\n\r\n#Soldier and Bananas\r\n# k, n, w = list(map(int, input().split(\" \")))\r\n# price = k*((w*(w+1))/2)\r\n# if price<=n:\r\n# print(0)\r\n# else:\r\n# print(int(abs(n-price)))\r\n\r\n#Greed\r\n# n = int(input())\r\n# rem = list(map(int,input().split()))\r\n# cap = sum((sorted(list(map(int,input().split()))))[-2:])\r\n# if sum(rem)<=cap:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n\r\n#Elephent\r\n# n = int(input())\r\n# steps = sorted([i for i in range(1,6)], reverse=True)\r\n# step = 0\r\n# for i in steps:\r\n# step += (n//i)\r\n# n -= (n//i)*i\r\n# print(step)\r\n\r\n\r\n#Word\r\ns = input()\r\nups, lows = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n ups+=1\r\n elif i.islower():\r\n lows += 1\r\nif lows>=ups:\r\n print(s.lower())\r\nelif lows<ups:\r\n print(s.upper())", "a= input()\r\nup=0\r\nlow=0\r\ni=0\r\nwhile i<len(a):\r\n if a[i].isupper():\r\n up +=1\r\n else:\r\n low+=1\r\n i+=1\r\nif up>low:\r\n print(a.upper())\r\nelif low>=up:\r\n print(a.lower())\r\n\r\n", "n = input()\r\nlow = 0\r\nup = 0\r\nfor i in range(len(n)):\r\n if n[i].upper() == n[i]:\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "n=input()\r\nm=len(n)\r\ntemp=0\r\ncount=0\r\nfor i in range(m):\r\n if n[i].islower():\r\n temp=temp+1\r\n else:\r\n count=count+1;\r\nif count>temp:\r\n a=n.upper()\r\n print(a)\r\nelif temp>=count:\r\n a=n.lower()\r\n print(a)\r\n \r\n", "s=input()\r\nx=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n x += 1\r\nif x > len(s)/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "n=input()\r\nx=0\r\ny=0\r\nfor i in n:\r\n if i.isupper():\r\n x+=1\r\n else:\r\n y+=1\r\nif x>y:\r\n print(n.upper())\r\nelif x<y:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())", "#59A\r\ns=input()\r\nlc=0\r\nuc=0\r\nfor x in s:\r\n if(x.islower()):\r\n lc=lc+1\r\n else:\r\n uc=uc+1\r\nif(lc>=uc):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in s:\r\n if i.islower():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 >= c2:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "s=input()\r\nuc=lc=0\r\nfor i in s:\r\n if ord(i) in range(97,123):\r\n lc=lc+1\r\n else:\r\n uc=uc+1\r\nif lc>=uc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\nlower = 0\nupper = 0\nfor w in word:\n if w.islower():\n lower +=1\n elif w.isupper():\n upper +=1\n\nif upper > lower:\n new_word = word.upper()\nelse:\n new_word = word.lower()\n\nprint(new_word)\n \t \t\t \t \t \t\t\t \t", "word = str(input())\nupper = 0\nlower = 0\nfor i in word:\n if i.isupper():\n upper += 1\n if i.islower():\n lower += 1\nif upper > lower:\n word = word.upper()\nelse:\n word = word.lower()\nprint(word)\n\n\n", "T=input()\nU=0\nL=0\nfor I in T:\n\tif I.isupper():\n\t\tU+=1\n\telif I.islower():\n\t\tL+=1\nif U>L:\n\tprint(T.upper())\nelse:\n\tprint(T.lower())", "a=input()\r\ns=0\r\nc=0\r\nn=[]\r\nfor i in range(len(a)):\r\n n.append(a[i])\r\nfor i in range(len(n)):\r\n if ord(n[i])<97 :\r\n c+=1\r\n else:\r\n s+=1\r\nif s==c or s>c:\r\n for i in range(len(n)):\r\n if ord(n[i])<97:\r\n n[i]=chr(ord(n[i])+32)\r\nif c>s:\r\n for i in range(len(n)):\r\n if ord(n[i])>96:\r\n n[i]=chr(ord(n[i])-32)\r\nq=''\r\nfor i in range(len(n)):\r\n q=q+n[i]\r\nprint(q)\r\n \r\n", "import sys\ninput = sys.stdin.readline\n\ns = input().strip()\nlet = 0\n\nfor c in s:\n let += 1 if ord(c) >= 97 else -1\n\nprint(s.lower() if let >= 0 else s.upper())\n", "s = input()\r\nup = low = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif up > low:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "s = input()\nlowercnt = 0\nuppercnt = 0\n\nfor char in s:\n if char.isupper():\n uppercnt = uppercnt+1\n else:\n lowercnt = lowercnt+1\n\nif uppercnt>lowercnt:\n s = s.upper()\nelse:\n s = s.lower()\n\nprint(s)\n \t\t\t \t \t\t \t\t \t\t \t\t \t\t\t\t", "s = input()\r\ncount = 0\r\nup = 0\r\nfor i in range(len(s)):\r\n if s[i] >= 'a' and s[i] <= 'z':\r\n count = count + 1\r\n else:\r\n up = up + 1\r\n\r\nif up > count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nc=0\r\np=0\r\nfor i in s:\r\n if(i.islower()):\r\n c+=1\r\n else:\r\n p+=1\r\nif(c<p):\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 28 13:11:51 2020\r\n\r\n@author: PREET MODH\r\n\"\"\"\r\n\r\n\r\ns=input()\r\ncountl=0\r\ncountu=0\r\nfor i in s:\r\n if(i.islower()):\r\n countl=countl+1\r\n elif(i.isupper()):\r\n countu=countu+1\r\nif countu>countl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\ns1, s2 = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n s1+=1\r\n else:\r\n s2+=1\r\nif s1>s2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\ncnt1=0\r\ncnt2=0\r\nfor i in a:\r\n if i==i.lower():\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\nif cnt2>cnt1:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nupper= 0\r\nlower = 0\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n lower= lower+1\r\n else:\r\n upper= upper+1\r\n\r\nif(lower>=upper):\r\n s= s.lower()\r\n print(s)\r\nelse:\r\n s= s.upper()\r\n print(s)\r\n\r\n\r\n\r\n", "x=list(input())\nup=0\nlow=0\nfor i in x:\n if i.isupper()==True:\n up+=1;\n else:\n low+=1\nif up>low:\n for j in range(len(x)):\n x[j]=x[j].upper()\nelse:\n for j in range(len(x)):\n x[j]=x[j].lower()\nfor k in x:\n print(k,end=\"\")\n", "s = input()\r\nsize = len(s)\r\ncnt_upper = 0\r\ncnt_lower = 0\r\nfor i in range(size):\r\n if(s[i].islower()):\r\n cnt_lower += 1\r\n elif(s[i].isupper()):\r\n cnt_upper += 1\r\nif(cnt_lower>=cnt_upper):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "alphabet=\"abcdefghijklmnopqrstuvwxyz\"\r\nword=input()\r\nl = 0\r\nu = 0\r\n\r\nfor c in word:\r\n if c.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u > l:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n \r\nprint(word)", "low = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = input()\r\nl = len(s)\r\nlowCount = 0\r\ncapCount = 0\r\nfor i in range (l):\r\n if s[i] in low:\r\n lowCount += 1\r\n else:\r\n capCount += 1\r\nif capCount > lowCount:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input('').strip()\r\nlower = []\r\nupper = []\r\nword_list = list(word)\r\nword_list_len = len(word_list)\r\nfor i in word:\r\n if i.isupper():\r\n upper.append(i)\r\n else:\r\n lower.append(i)\r\nlen_upper = len(upper)\r\nlen_lower = len(lower)\r\n\r\nif len_lower > len_upper:\r\n for i in range(word_list_len):\r\n if word_list[i].isupper():\r\n word_list[i] = word_list[i].lower()\r\nelif len_lower < len_upper:\r\n for i in range(word_list_len):\r\n if word_list[i].islower():\r\n word_list[i] = word_list[i].upper()\r\nelse:\r\n for i in range(word_list_len):\r\n word_list[i] = word_list[i].lower()\r\n\r\nprint(''.join(word_list))", "s = input()\r\nl = list(s)\r\nlw = 0\r\nfor i in range(len(l)):\r\n if ord(l[i])<=122 and ord(l[i])>=97:\r\n lw=lw+1\r\nif lw >= (len(s)-lw):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "def browserExtention( string ):\n l,u = 0, 0\n for x in string:\n if x.islower():\n l += 1\n else:\n u += 1\n\n if l < u:\n return string.upper()\n else:\n return string.lower()\n\nstring = input()\nprint(browserExtention( string ))\n", "s=input()\r\nups=sum(1 for char in s if char.isupper())\r\nlowers=sum(1 for char in s if char.islower())\r\nif ups==lowers:\r\n print(s.lower())\r\nelif ups>lowers:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\ni = 0\r\ncnt = 0\r\ncnt1 = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n cnt+=1\r\n else:\r\n cnt1+=1\r\n\r\nif cnt > cnt1:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\nlower_letters = 0\r\nupper_letters = 0\r\nfor letter in word:\r\n\tif letter.islower() == True:\r\n\t\tlower_letters += 1\r\n\telse:\r\n\t\tupper_letters += 1\r\nif lower_letters >= upper_letters:\r\n\tprint(word.lower())\r\nelse:\r\n\tprint(word.upper())", "s = input()\r\nif sum([1 if c.islower() else -1 for c in s]) < 0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\ncl = 0\r\ncu = 0\r\nfor i in s:\r\n if i>=\"A\" and i<=\"Z\":\r\n cu += 1\r\n if i>=\"a\" and i<=\"z\":\r\n cl += 1\r\nif cu > cl:\r\n print(s.upper())\r\nif cl>cu:\r\n print(s.lower())\r\nelif cl==cu:\r\n print(s.lower())\r\n \r\n", "w = input()\r\nl,u=0,0\r\nfor i in w:\r\n\tif i.islower()==True:\r\n\t\tl+=1\r\n\telif i.isupper()==True:\r\n\t\tu+=1\r\nif l>=u:\r\n\tprint(w.lower())\r\nelif u>l:\r\n\tprint(w.upper())\r\n ", "a = input()\r\nl = \"abcdefghijklmnopqrstuvwxyz\"\r\nu = l.upper()\r\nl_count = 0\r\nu_count = 0\r\nfor i in a:\r\n if i in l:l_count += 1\r\n else:u_count += 1\r\nif l_count < u_count:print(a.upper())\r\nelse:print(a.lower())", "string = input()\r\nlow = 0\r\nup = 0\r\nfor char in string:\r\n if char.islower():\r\n low += 1\r\n else:\r\n up += 1\r\n\r\nif low >= up:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "s=input()\r\nu=0\r\nfor x in s:\r\n if x>='A' and x<='Z':\r\n u+=1\r\nif u>len(s)-u:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef input_string():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\nif __name__ == '__main__':\r\n\r\n s = input_string()\r\n l = len(s)\r\n upper_count = 0\r\n # solution 2\r\n for c in s:\r\n if c >= 'A' and c <= 'Z':\r\n upper_count += 1\r\n\r\n if upper_count > (l / 2):\r\n print(s.upper())\r\n else:\r\n print(s.lower())", "alphabet=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=input()\r\n\r\nif sum([i in alphabet for i in s])<(len(s))/2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "O=input()\r\nx=0\r\nm=0\r\nfor i in O:\r\n if i.isupper():\r\n x=x+1\r\n else:\r\n m=m+1\r\nif x>m:\r\n print(''.join([i.upper() for i in O]))\r\nelse:\r\n print(''.join([i.lower() for i in O]))", "s = input()\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n count_upper += 1\r\n else:\r\n count_lower += 1 \r\n\r\nif count_upper > count_lower:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n \r\nprint(s)", "# -*- coding: utf-8 -*-\n\"\"\"59.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1hYxPSks58iBj6lqO-ZFgsg_7bcRbm3l3\n\"\"\"\n\n#https://codeforces.com/contest/59/problem/A Word\n\ncap=0\nnocap = 0\n \ns = input()\nfor i in s:\n if i.islower():\n nocap += 1\n else:\n cap+=1\nif cap>nocap:\n print(s.upper())\nelse:\n print(s.lower())", "x=input()\r\nup=[]\r\nlow=[]\r\nfor i in x:\r\n if i.isupper():\r\n up.append(i)\r\n else:\r\n low.append(i)\r\n\r\n \r\nif len(up)>len(low):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n\r\n \r\n", "def word():\r\n w=input()\r\n l=0\r\n for i in w:\r\n if i.islower():\r\n l+=1\r\n else:\r\n pass\r\n if (len(w)-l)>l:\r\n print(w.upper())\r\n elif (len(w)-l)<l:\r\n print(w.lower())\r\n elif (len(w)-l)==l:\r\n print(w.lower())\r\nword()\r\n ", "def word(str):\r\n upper = 0\r\n lower = 0\r\n order = list(str)\r\n for i in range(len(order)):\r\n if order[i].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n if upper > lower:\r\n return str.upper()\r\n else:\r\n return str.lower()\r\n\r\nif __name__ == '__main__':\r\n order = input()\r\n print(word(order))", "s = input()\r\n\r\nn_lower = 0\r\nn_upper = 0\r\nfor c in s:\r\n if c >= 'a':\r\n n_lower += 1\r\n else:\r\n n_upper += 1\r\nprint(s.upper()) if n_upper > n_lower else print(s.lower())", "word = input()\nup,down = 0,0\n\nfor char in word:\n\tif(char.isupper()):\n\t\tup+=1\n\telse:\n\t\tdown+=1\n\nif( up> down):\n\tword = word.upper()\nelse:\n\tword = word.lower()\n\nprint(word)\n\n\n\t\t\t\t \t \t \t\t\t \t \t\t\t\t", "x = str(input())\r\nup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nlo = 'abcdefghijklmnopqrstuvwxyz'\r\nc = [0,0]\r\nfor i in x:\r\n if i in up:\r\n c[0] += 1\r\n elif i in lo:\r\n c[1] += 1\r\nif c[0] > c[1]:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 16 09:51:03 2018\r\n\r\n@author: Minh Tuấn1\r\n\"\"\"\r\n# =============================================================================\r\n# import math\r\n# a = input()\r\n# a = a.split()\r\n# a1 = int(a[0])\r\n# a2 = int(a[1])\r\n# nub = a2 - math.ceil(a1 / 2)\r\n# if nub <= 0:\r\n# ai= (2 * nub - 1)*-1\r\n# print(ai)\r\n# else:\r\n# print(2*nub)\r\n# =============================================================================\r\n\r\na = input()\r\nlib = '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\nlib1 = lib.lower()\r\nl = []\r\nu = []\r\nfor i in a:\r\n if i in lib:\r\n u.append(i)\r\n else:\r\n l.append(i)\r\nif len(u) > len(l):\r\n b = a.upper()\r\nelse:\r\n b = a.lower()\r\nprint(b)\r\n", "w=input()\r\nn=len(w)\r\na=0\r\nb=0\r\nfor i in range (0,n):\r\n if w[i]==w[i].lower():\r\n a+=1\r\n else:\r\n b+=1\r\nif a>=b:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n", "\r\n\r\nword = input()\r\n\r\nlength = len(word)\r\ncnt = 0\r\nfor i in word:\r\n if i.isupper():\r\n cnt += 1\r\n\r\nif cnt <= (length - cnt):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n\r\n", "s = input()\r\nc_upper = 0\r\nc_lower = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == s[i].lower():\r\n c_lower +=1\r\n else:\r\n c_upper += 1\r\n\r\nif c_lower < c_upper:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nn_l = sum([int(c.islower()) for c in s])\r\nn_u = sum([int(c.isupper()) for c in s])\r\nif n_l<n_u:\r\n print(s.upper())\r\nelif n_l>=n_u:\r\n print(s.lower())\r\n", "word=input()\r\ncount_up,count_down=0,0\r\nfor character in word:\r\n\tif character.isupper():\r\n\t\tcount_up+=1\r\n\telse:\r\n\t\tcount_down+=1\r\nif count_up>count_down:\r\n\tprint(word.upper())\r\nelse:\r\n\tprint(word.lower())", "s = input()\r\nu = 0\r\nl = 0\r\nfor elem in s:\r\n if elem.isupper():\r\n u = u+1\r\n else:\r\n l = l+1\r\n\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\nl=0\r\nfor i in n:\r\n if 97<=ord(i) and ord(i)<=122:\r\n l+=1\r\nu=len(n)-l\r\nif u<=l:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "letter = input()\nH = a =0\nfor i in letter:\n if i.isupper(): a +=1\n else: H +=1\nif a > H: letter = letter.upper()\nelse: letter = letter.lower()\nprint(letter)\n\t\t\t \t\t \t \t\t \t\t\t \t\t \t\t\t", "a = input()\r\ncountBig = 0\r\ncountSmall = 0\r\nfor i in a:\r\n if 'a' <= i <= 'z':\r\n countSmall += 1\r\n else:\r\n countBig += 1\r\nprint(a.upper()) if countBig > countSmall else print(a.lower())", "word = input()\r\nuppers = 0\r\nlowers = 0\r\nfor letter in word:\r\n if letter.isupper():\r\n uppers += 1\r\n else:\r\n lowers += 1\r\n \r\nif uppers > lowers:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\nl = len(word)\na = 0\nb = 0\nfor i in range(l):\n if word[i].upper() == word[i]:\n a += 1\n else:\n b += 1\nif a > b:\n print(word.upper())\nelse:\n print(word.lower())\n", "s = input().strip()\r\nnl = 0\r\nnu = 0\r\nfor c in s:\r\n if 'a' <= c and c <= 'z':\r\n nl += 1\r\n else:\r\n nu += 1\r\nif nu > nl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "a = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in a:\r\n if i.isupper():\r\n upper+=1\r\n elif i.islower():\r\n lower+=1\r\n \r\nif upper>lower:\r\n print(a.upper())\r\nelif lower>=upper:\r\n print(a.lower())", "from os import path, truncate\r\nfrom sys import int_info, stdin, stdout\r\nif path.exists('tc.txt'):\r\n stdin = open('tc.txt', 'r')\r\ndef gmi(): return map(int, stdin.readline().strip().split())\r\ndef gms(): return map(str, stdin.readline().strip().split())\r\ndef gari(): return list(map(int, stdin.readline().strip().split()))\r\ndef gart(): return tuple(map(int, stdin.readline().strip().split()))\r\ndef gars(): return list(map(str, stdin.readline().strip().split()))\r\ndef gs(): return stdin.readline().strip()\r\ndef gls(): return list(stdin.readline().strip())\r\ndef gi(): return int(stdin.readline())\r\n\r\n# for _ in range(int(input())):\r\ns=gs()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def main():\r\n word = input()\r\n lower_count = upper_count = 0\r\n # Loop to count number of lowercase\r\n # and uppercase letters respectively\r\n for w in word:\r\n if 97 <= ord(w) <= 122:\r\n lower_count += 1\r\n elif 65 <= ord(w) <= 90:\r\n upper_count += 1\r\n # Compare and update word\r\n if lower_count >= upper_count:\r\n word = word.lower()\r\n else:\r\n word = word.upper()\r\n print(word)\r\n \r\n\r\nmain()", "word = input()\r\nupper = lower = 0\r\nU = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nL = 'abcdefghijklmnopqrstuvwxyz'\r\nfor char in word:\r\n if char in U:\r\n upper+=1\r\n if char in L:\r\n lower+=1\r\nprint(word.lower() if lower>=upper else word.upper())", "s = input()\r\nupc = 0\r\nloc = 0\r\nfor i in s:\r\n if i.isupper() == True:\r\n upc += 1\r\n elif i.islower() == True:\r\n loc += 1\r\n\r\nif upc > loc:\r\n print(s.upper())\r\nelif upc < loc or upc == loc:\r\n print(s.lower())\r\n", "s = input()\r\nuppercase_count = sum(1 for c in s if c.isupper())\r\nlowercase_count = sum(1 for c in s if c.islower())\r\nif uppercase_count > lowercase_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "# a,b = map(int,input().split(' '))\r\ns = input()\r\nlower_case = ''\r\nupper_case = ''\r\nfor i in s:\r\n if i == i.lower():\r\n lower_case += i\r\n else:\r\n upper_case += i\r\nif len(lower_case) > len(upper_case):\r\n print(s.lower())\r\nelif len(lower_case) < len(upper_case):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input();\r\ntemp1= s.lower();\r\ntemp2= s.upper();\r\n\r\ncount = 0;\r\nfor i in range(len(s)):\r\n if(s[i]!=temp1[i]):\r\n count+=1\r\n\r\nif(2*count <= len(s)):\r\n print(temp1)\r\nelse:\r\n print(temp2)", "w = input()\r\n\r\nlCount = 0\r\nuCount = 0\r\nfor i in w:\r\n if ord(i)<97:\r\n uCount+=1\r\n else:\r\n lCount+=1\r\n \r\nprint(w.lower() if lCount>=uCount else w.upper())", "import string\r\n\r\ndef _main(entry:str) -> str:\r\n uppercase, lowercase = int(0), int(0)\r\n for i in entry:\r\n if str(i) in string.ascii_uppercase:\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\n if uppercase == lowercase or lowercase > uppercase:\r\n return entry.lower()\r\n else:\r\n return entry.upper()\r\n \r\nif __name__ == \"__main__\":\r\n print(_main(str(input())))", "import string\r\ns = input()\r\nlower_count = 0\r\nupper_count = 0\r\nfor c in s:\r\n if c in string.ascii_lowercase:\r\n lower_count += 1\r\n elif c in string.ascii_uppercase:\r\n upper_count += 1\r\nif lower_count >= upper_count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "t = input()\r\nup = 0\r\ndown = 0\r\nfor i in t:\r\n if i == i.upper():\r\n up += 1\r\n else:\r\n down += 1\r\nif down >= up:\r\n print(t.lower())\r\nelse:\r\n print(t.upper())", "s=str(input())\r\nnum=0\r\nfor i in s:\r\n if i.islower():\r\n num+=1\r\nif 2*num>=len(s):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "def defineWord(word): \r\n maiuscula = 0\r\n minusculo = 0\r\n for a in word:\r\n if a.isupper():\r\n maiuscula += 1\r\n elif a.islower():\r\n minusculo += 1\r\n if(maiuscula > minusculo):\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\nprint(defineWord(input()))", "s=input()\r\ncount=0\r\ncount1=0\r\nfor i in s:\r\n if i.isupper():\r\n count += 1\r\n else:\r\n count1 += 1\r\nif count <= count1:\r\n r=s.lower()\r\nelse:\r\n r=s.upper()\r\nprint(r)", "word = str(input())\n\nupper_list = [u for u in word if u.isupper()]\nlower_list = [l for l in word if l.islower()]\n\nif len(upper_list) > len(lower_list):\n print(word.upper())\nelif len(upper_list) < len(lower_list):\n print(word.lower())\nelif len(upper_list) == len(lower_list):\n print(word.lower())\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=input()\r\nupper = 0\r\nlower = 0\r\n \r\nfor i in range(len(n)): \r\n \r\n # For lower letters \r\n if (ord(n[i]) >= 97 and ord(n[i]) <= 122): \r\n lower += 1\r\n \r\n # For upper letters \r\n elif (ord(n[i]) >= 65 and ord(n[i]) <= 90): \r\n upper += 1\r\n\r\nif(upper > lower):\r\n print(n.upper())\r\nelse:\r\n print(n.lower()) \r\n\r\n \r\n\r\n\r\n", "x=input()\r\nc=0\r\nc2=0\r\nfor i in x:\r\n if i<str(\"a\"):\r\n c=c+1\r\n else:\r\n c2=c2+1\r\nif c>c2:\r\n x=x.upper()\r\nelse:\r\n x=x.lower()\r\nprint(x)", "s=input()\r\nlength=(len(s))\r\nboro=0\r\nsoto=0\r\nfor i in range(length):\r\n if s[i]==s[i].upper():\r\n boro+=1\r\n else:\r\n soto+=1\r\nif boro>soto:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = input()\r\n\r\nupcounter=0\r\nlocounter=0\r\nfor char in n:\r\n if char.isupper():\r\n upcounter+=1\r\n elif char.islower():\r\n locounter+=1\r\n\r\nif upcounter>locounter:\r\n print(n.upper())\r\nelif upcounter<=locounter:\r\n print(n.lower())\r\n", "x=input('')\r\narr=[]\r\nARR=[]\r\nfor i in x:\r\n arr.append(i.islower())\r\n ARR.append(i.isupper())\r\nif sum(arr)>=sum(ARR):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "# problem 1\n# persons_count, fence_height = input(\"\").split()\n#\n# minimum_road_width = 0\n# all_persons_height = ''\n#\n# person_height = input(\"\").split()\n#\n# for i in range(len(person_height)):\n# if int(person_height[i]) <= int(fence_height):\n# minimum_road_width += 1\n# else:\n# minimum_road_width += 2\n# all_persons_height += str(person_height[i]) + ' '\n#\n# print(str(minimum_road_width))\n\n# problem 2\n# problems_count = input(\"\")\n#\n# problems_solved_count = 0\n#\n# for i in range(int(problems_count)):\n# petya, vasya, tonya = input().split()\n#\n# sum = int(petya) + int(vasya) + int(tonya)\n#\n# if sum >= 2:\n# problems_solved_count += 1\n#\n#\n# print(str(problems_solved_count))\n\n# problem 3\n# matrix = ''\n# for i in range(5):\n# matrix_line_input = input()\n# matrix += matrix_line_input + '\\n'\n#\n# minimum_moves_number = 0\n#\n# for i in range(len(matrix.split())):\n# index = matrix.split().index('1')\n# matrix.split().insert(12, '1')\n# matrix.split().insert(index, '1')\n#\n# new_index_positive = index + 5\n# new_index_minas = index - 5\n# if index > 7:\n# minimum_moves_number = 12 - index\n# elif index <= 2:\n# minimum_moves_number = (12 - (new_index_positive + 5))+2\n# else:\n# minimum_moves_number = (12- new_index_positive)+1\n# if index < 17:\n# minimum_moves_number = 16 - index\n# elif index < 22:\n# minimum_moves_number = (new_index_minas - 12) + 1\n# else:\n# minimum_moves_number = (new_index_minas - 5) - 12 + 2\n#\n# print(minimum_moves_number)\n\n\n# problem 4\n# num_of_columns = input()\n# numbers_of_box_per_column = input().split()\n# numbers_of_box_per_column_int = []\n# for num in numbers_of_box_per_column:\n# numbers_of_box_per_column_int.append(int(num))\n# numbers_of_box_per_column_int.sort()\n# print(str(numbers_of_box_per_column_int).replace('[', '').replace(']', '').replace(',', ' '))\n\n# problem 5\n# alphabet = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U',\n# 'V', 'W', 'X', 'Y', 'Z']\n#\n# first_String = input()\n# second_String = input()\n# match = 0\n#\n# for i in range(len(first_String)):\n# str1Index = alphabet.index(first_String[i].upper())\n# str2Index = alphabet.index(second_String[i].upper())\n# if str1Index < str2Index:\n# match = -1\n# break\n# elif str1Index > str2Index:\n# match = 1\n# break\n#\n#\n# print(match)\n\n# problem 5\n# person_name = input()\n#\n# char_in_list = []\n#\n# for char in person_name:\n# if not (char in char_in_list):\n# char_in_list.append(char)\n#\n# print_line = ''\n# if len(char_in_list) % 2 == 0:\n# print_line = 'CHAT WITH HER!'\n# else:\n# print_line = 'IGNORE HIM!'\n#\n# print(print_line)\n\n\n# problem 6\n\nword = input()\n\nupper_word = []\nlower_word = []\n\nfor char in word:\n if char.isupper():\n upper_word.append(char)\n else:\n lower_word.append(char)\n\nif len(upper_word) > len(lower_word):\n print(word.upper())\nelse:\n print(word.lower())\n\n", "a = input()\r\nb = len(a)\r\ncount = sum(1 for elem in a if elem.isupper())\r\nc = b - count\r\n\r\nif c == count:\r\n print(a.lower())\r\nelif c > count:\r\n print(a.lower())\r\nelif c < count:\r\n print(a.upper())", "n = input()\r\nk = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nm = 'abcdefghijklmnopqrstuvwxyz'\r\nu,l = 0,0\r\nfor i in n:\r\n if i in k:\r\n u += 1\r\n if i in m:\r\n l += 1\r\nif u > l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "n=input()\r\nlower =0\r\nupper=0\r\nfor i in n:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n if upper >lower:\r\n n=n.upper()\r\n else:\r\n n=n.lower()\r\nprint(n) ", "orig = input()\r\nli_ = []\r\nfor inp in orig:\r\n li_.append(inp)\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor letter in li_:\r\n if letter.isupper():\r\n upper +=1\r\n elif letter.islower():\r\n lower +=1\r\n \r\nif upper > lower :\r\n print(orig.upper())\r\nelse:\r\n print(orig.lower())", "s = input()\r\nl=[]\r\nfor i in s:\r\n\tl.append(i.isupper())\r\nif l.count(False)>=l.count(True):\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "word = input()\r\nsmall=0\r\nbig=0\r\nfor i in range(0,len(word)):\r\n if(word[i].islower()==True):\r\n small+=1\r\n else:\r\n big+=1\r\nif(big>small):\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)\r\n\r\n \r\n ", "s = str(input())\r\nup = 0\r\nlow = 0\r\nfor c in s:\r\n if c.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif low >= up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper()) ", "s = input()\r\nif s.lower() == 'house':\r\n print('house')\r\nelif s.lower() == 'vip':\r\n print('VIP')\r\nelif s == s.upper():\r\n print(s)\r\nelif s == s.lower():\r\n print(s)\r\nelse:\r\n c = 0\r\n sm = 0\r\n for i in range(0, len(s)):\r\n if \"A\" <= s[i] <= \"Z\":\r\n c += 1\r\n else:\r\n sm += 1\r\n if c > sm:\r\n print(s.upper())\r\n # elif c == sm:\r\n # print(s.lower())\r\n else:\r\n print(s.lower())", "s=input()\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if i.islower()==True:\r\n c1=c1+1\r\n else:\r\n c2+=1\r\nif c1>=c2:print(s.lower())\r\nelse:print(s.upper())", "str = input()\r\ntitles = int()\r\n \r\nfor i in str:\r\n if i.istitle():\r\n titles += 1\r\n \r\nif float(titles) > float(len(str)) / 2:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "a=input()\r\nb,c=0,0\r\nfor i in a:\r\n\r\n if i.islower():\r\n b+=1\r\n else:\r\n c+=1\r\nif c>b:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n", "word=input()\r\ncu=0\r\ncl=0\r\nfor i in word:\r\n if(i.isupper()):\r\n cu=cu+1\r\n else:\r\n cl=cl+1\r\nans=word.upper()\r\nans1=word.lower()\r\nif(cu>cl):\r\n print(ans)\r\nelif(cu==cl):\r\n print(ans1)\r\nelse:\r\n print(ans1)", "a = input()\r\nuc = 0\r\nlc = 0\r\nfor i in a:\r\n if i.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\nif uc <= lc:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "#==============NEVER GIVE UP==================\r\n#===========ALLAH ALMIGHT WILL HELP===========\r\n#==================YOU========================\r\ns=input()\r\nl=sum(1 for i in s if i.islower())\r\nu=len(s)-l\r\nprint([s.lower(),s.upper()][u>l])", "st = input()\r\nn = len(st)\r\nu = len(list(filter(lambda x : x.isupper(), st)))\r\nl = n - u\r\nprint(st.upper() if u > l else st.lower())\r\n", "s = input()\r\ncount = 0 \r\nfor i in s:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n count = count+1\r\nif(count>(len(s)//2)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) \r\n", "word = input()\r\ncount = 0\r\n#print(ord(a))\r\nfor i in range(len(word)):\r\n if ord(word[i])<97:\r\n count = count+1\r\nif(count>(len(word)/2)):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nu = 0\r\nfor c in s:\r\n if c.isupper():\r\n u += 1\r\nif u > len(s)/2:\r\n print(s.upper())\r\nelse:\r\n print (s.lower())", "s = input()\ndata = 2 * [0]\nfor item in s:\n if item.islower():\n data[0] += 1\n else:\n data[1] += 1\nif data[0] >= data[1]:\n print(s.lower())\nelse:\n print(s.upper())\n", "str=input()\r\ncount=0\r\ncount1=0\r\nfor i in str:\r\n if i.islower():\r\n count+=1\r\n else:\r\n count1+=1\r\nif count1>count:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 13:18:22 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\ns=input()\r\nstr1='qwertyuiopasdfghjklzxcvbnm'\r\nstr2='QWERTYUIOPASDFGHJKLZXCVBNM'\r\nsum=0\r\nSUM=0\r\nfor letter in s:\r\n if letter in str1:\r\n sum+=1\r\n else: SUM+=1\r\nif sum<SUM:\r\n print(s.upper())\r\nelse:print(s.lower())", "k,a=0,list(input())\nfor item in a:\n\tif(item.isupper()):\n\t\tk+=1\n\telse:\n\t k-=1\t\nprint([\"\".join(a).upper(),\"\".join(a).lower()][k<=0])", "s=input()\r\nlcount=0\r\nucount=0\r\nfor i in range(len(s)):\r\n if(65<=ord(s[i])<=90):\r\n ucount+=1\r\n elif(97<=ord(s[i])<=122):\r\n lcount+=1\r\nif(ucount>lcount):\r\n print(s.upper())\r\nelif(ucount<=lcount):\r\n print(s.lower())", "f=input()\r\nk=f\r\ns=[x for x in k]\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n \r\n if s[i].isupper()==True:\r\n u=u+1\r\n else:\r\n l=l+1\r\nif l>=u:\r\n print(f.lower())\r\nelse:\r\n print(f.upper())\r\n \r\n", "a = input()\r\nbro = 0\r\nbroj = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper() == True:\r\n broj += 1\r\n elif a[i].islower() == True:\r\n bro += 1\r\nif broj > bro:\r\n print(a.upper())\r\nelif bro > broj:\r\n print(a.lower())\r\nelse:\r\n print(a.lower())", "s = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in s:\r\n if i >= \"A\" and i <= \"Z\":\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\nif upper_count <= lower_count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = input()\r\nlower_count = 0\r\nupper_count = 0\r\nfor i in a:\r\n if i.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\nif upper_count < lower_count:\r\n print(a.lower())\r\nelif upper_count == lower_count:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "m=input()\r\nn=list(m)\r\nup=0\r\nlow=0\r\nfor i in n:\r\n if(ord(i)<=90):\r\n up=up+1\r\n else:\r\n low=low+1\r\nif(low>=up):\r\n print(m.lower())\r\nelse:\r\n print(m.upper())", "# Read input\r\ns = input()\r\n\r\n# Initialize counters for uppercase and lowercase letters\r\nuppercase_count = 0\r\nlowercase_count = 0\r\n\r\n# Count the number of uppercase and lowercase letters\r\nfor letter in s:\r\n if letter.isupper():\r\n uppercase_count += 1\r\n else:\r\n lowercase_count += 1\r\n\r\n# Convert the word to either all uppercase or all lowercase based on counts\r\nif uppercase_count > lowercase_count:\r\n corrected_word = s.upper()\r\nelse:\r\n corrected_word = s.lower()\r\n\r\n# Print the corrected word\r\nprint(corrected_word)\r\n", "w = input()\r\nn = len(w)\r\nword = list(w)\r\nc = 0\r\nfor i in range(n):\r\n if ord(word[i]) in range(ord('A'),ord('Z')+1):\r\n c += 1\r\nif 2 * c > n:\r\n for i in range(n):\r\n if ord(word[i]) in range(ord('a'),ord('z')+1):\r\n word[i] = chr(ord(word[i])-32)\r\nelse:\r\n for i in range(n):\r\n if ord(word[i]) in range(ord('A'),ord('Z')+1):\r\n word[i] = chr(ord(word[i])+32)\r\nw = ''.join(word)\r\nprint (w)", "\r\ns = input()\r\ns1 = 0;\r\ns2 = len(s) // 2\r\nfor i in s:\r\n if i >= 'A' and i <= 'Z':\r\n s1 += 1\r\nif s1 <= s2: print(s.lower())\r\nelse: print(s.upper())", "s = input()\r\nu,l = 0,0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n l += 1\r\n else:\r\n u += 1\r\nans = \"\"\r\nif u > l:\r\n for i in s:\r\n ans += i.upper()\r\nelse:\r\n for i in s:\r\n ans += i.lower()\r\nprint(ans)", "try:\r\n s = input()\r\n low = high = 0\r\n for i in s :\r\n if i.islower() :\r\n low +=1\r\n else:\r\n high +=1\r\n if low >=high:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\nexcept:\r\n pass", "n=input()\ncount=0\nflag=0\nfor i in n:\n\tif i.islower():\n\t\tcount+=1\n\tif i.isupper():\n\t\tflag+=1\nif(count>=flag):\n\tprint(n.lower())\nelif(flag>count):\n\tprint(n.upper())\n \t \t\t \t \t \t \t\t \t \t \t\t\t \t\t\t\t", "s = str(input())\r\nup, low = 0, 0\r\nfor i in s:\r\n if ord(i)>=97:\r\n low += 1\r\n else:\r\n up += 1\r\nif up > low:\r\n for i in s:\r\n if ord(i)>=97:\r\n print(chr(ord(i)-32), end='')\r\n else:\r\n print(i, end='')\r\nelse:\r\n for i in s:\r\n if ord(i)<97:\r\n print(chr(ord(i)+32), end='')\r\n else:\r\n print(i, end='')", "word = input()\nlower_count,upper_count = 0,0 \nstring = \"\"\nfor i in word :\n if i.isupper() :\n upper_count += 1\n else :\n lower_count += 1\nif upper_count > lower_count :\n \n for i in word :\n \n string += i.upper()\n \nelse :\n \n for i in word :\n \n string += i.lower()\n \nprint(string) ", "s = input()\r\nlow = [1 for i in s if i.islower()]\r\nupp = [1 for i in s if i.isupper()]\r\nif sum(low) >= sum(upp):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nlow = 0\r\nhigh = 0\r\nfor i in s:\r\n if i.lower() == i:\r\n low += 1\r\n else:\r\n high +=1\r\nif high > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "i_s=input()\r\ns1=\"abcdefghijklmnopqrstuvwxyz\"\r\ns2=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ncount1, count2=0,0\r\nfor i in range(len(i_s)):\r\n if i_s[i] in s1:\r\n count1+=1\r\n elif i_s[i] in s2:\r\n count2+=1\r\n \r\nif count1>=count2:\r\n print(i_s.lower())\r\nelif count2>count1:\r\n print(i_s.upper())", "s = input()\nu=0 \nl=0\nn= ''\nfor i in range(len(s)):\n if s[i] == s[i].upper():\n u+=1 \n elif s[i] == s[i].lower():\n l+=1 \nif l > u:\n for i in range(len(s)):\n if s[i] == s[i].lower():\n n += s[i]\n else:\n n += s[i].lower()\nelif u > l:\n for i in range(len(s)):\n if s[i] == s[i].upper():\n n += s[i]\n else:\n n += s[i].upper()\nelse:\n for i in range(len(s)):\n n += s[i].lower()\nprint(n)\n", "s = input()\r\nk = k1 = 0\r\nfor a in s:\r\n if a.islower():\r\n k += 1\r\n else:\r\n k1 += 1\r\nif k >= k1:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "word = input()\r\nlword = word.lower()\r\nuppercaseNum = 0\r\nlowercaseNum = 0 \r\n\r\nfor i in range(len(word)):\r\n if(word[i]==lword[i]):\r\n lowercaseNum+=1\r\n else : \r\n uppercaseNum+=1\r\n\r\nif(lowercaseNum>uppercaseNum):\r\n print(lword)\r\nelif (lowercaseNum<uppercaseNum):\r\n print(word.upper())\r\nelse : \r\n print(lword)", "s = input()\r\nlc = 0\r\nuc = 0\r\n \r\nfor char in s:\r\n if char.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\nif uc > lc:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n \r\nprint(s)", "s = list(map(str, input().strip()))\nlowerCount = 0\nupperCount = 0\nfor i in range(0, len(s)):\n if(s[i].islower()):\n lowerCount += 1\n else:\n upperCount += 1\n\nif(lowerCount >= upperCount):\n for i in range(0, len(s)):\n print(s[i].lower(), end=\"\")\nelse:\n for i in range(0, len(s)):\n print(s[i].upper(), end=\"\")", "s=str(input())\r\nb=0;l=0\r\nfor i in s:\r\n if i==i.lower():l+=1\r\n else:\r\n b+=1\r\nif b<=l:print(s.lower())\r\nelse:\r\n print(s.upper())", "word=input()\r\ni=u=l=0\r\nwhile i<len(word):\r\n if str(word[i]).islower():\r\n l+=1\r\n else:\r\n u+=1\r\n i+=1\r\ni=0 \r\nif u>l:\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)", "s=str(input())\r\nb=0\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n b+=1\r\n if s[i].isupper():\r\n c+=1\r\nif c<=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\na=set(\"abcdefghijklmnopqrstuvwxyz\")\r\nb=set(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nn=len(s)\r\nl=0\r\nu=0\r\nfor i in s:\r\n if i in a:\r\n l+=1\r\n else:\r\n u+=1\r\nif u>l:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n", "input_temp = input()\r\nup_counter = 0\r\nlow_counter = 0\r\nfor i in input_temp:\r\n if i.isupper():\r\n up_counter += 1\r\n else:\r\n low_counter += 1\r\n#print(len(input_temp)//2)\r\nif len(input_temp)//2+1 <= up_counter:\r\n print(input_temp.upper())\r\nelse:\r\n print(input_temp.lower())\r\n", "S = input()\r\nLow = 0\r\nUpp = 0\r\nfor X in S:\r\n if (X>='a' and X<='z'): \r\n Low += 1\r\n else:\r\n Upp += 1\r\nif (Low>=Upp):\r\n print(S.lower())\r\nelse:\r\n print(S.upper())", "s = input()\r\nbg = 0\r\nfor i in s:\r\n if i.isupper():\r\n bg += 1\r\nif (bg > (len(s)-bg)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a = str(input())\r\n\r\ncount_all = sum(1 for i in a)\r\ncount_upper = sum(1 for c in a if c.isupper())\r\ncount_lower = count_all-count_upper\r\n\r\nif count_upper > count_lower:\r\n print(a.upper())\r\n\r\nelse:\r\n print(a.lower())", "a=input()\r\nd,e=0,0\r\nfor j in a:\r\n if j.islower():\r\n d+=1\r\n else:\r\n e+=1\r\nif(d>=e):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "s=input()\r\nlower=upper=0\r\nfor word in s:\r\n if word.islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper >lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word=input()\r\nup,low=0,0\r\nfor i in word:\r\n if i.isupper():\r\n up+=1\r\n elif i.islower():\r\n low+=1 \r\nprint(word.upper()if up>low else word.lower())", "\r\n\r\nb = input()\r\nt = 0\r\nfor i in b:\r\n if i.islower() == True:\r\n t += 1\r\nif t >= len(b) / 2:\r\n print(b.lower())\r\nelse:\r\n print(b.upper())", "x=input()\r\ny=0\r\nfor i in range(0,len(x)):\r\n if(x[i].isupper()):\r\n y=y+1\r\nif(y>len(x)-y):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "x = str(input())\r\nc = 0\r\nfor i in x:\r\n if i.isupper():\r\n c = c+1\r\n\r\nif len(x)-c>c:\r\n print(x.lower())\r\nelif len(x)-c < c:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "r=input()\r\nc=0\r\nfor i in r:\r\n if(i.islower()):\r\n c+=1\r\nb=0\r\nb=len(r)-c\r\nif(b>c):\r\n print(r.upper())\r\nelse:\r\n print(r.lower())\r\n ", "w=input()\nu=0\nl=0\n\nfor x in range(len(w)):\n if ord(w[x]) >=65 and ord(w[x])<=90:\n u=u+1\n elif ord(w[x]) >=97 and ord(w[x])<=122:\n l=l+1\nif u>l:\n w=w.upper()\nelse:\n w=w.lower()\nprint(w)", "# import sys\n# sys.stdin = open('in', 'r')\n\ns = input()\n\nuppers = [c.isupper() for c in s].count(True)\n\nif uppers * 2 > len(s):\n print(s.upper())\nelse:\n print(s.lower())\n", "word = input()\r\n\r\nupper = sum(1 for char in word if char.isupper())\r\nlower = sum(1 for char in word if char.islower())\r\n\r\nif upper>lower:\r\n print(word.upper())\r\nelif upper<lower:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "s=input()\r\nlc=uc=0\r\nfor x in range(len(s)):\r\n if s[x].isupper():\r\n uc+=1\r\n else:\r\n lc+=1\r\nif lc<uc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input(); cU = 0; cS = 0\r\n\r\nup = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\n\r\nsm = up.lower()\r\n\r\nfor i in s:\r\n if i in up:\r\n cU += 1\r\n elif i in sm:\r\n cS += 1\r\n\r\nif cU > cS:\r\n print(s.upper())\r\n\r\nelif cU < cS:\r\n print(s.lower())\r\n\r\nelse:\r\n print(s.lower())", "inp = input()\r\nl = 0\r\nu = 0\r\nfor i in range(len(inp)):\r\n if inp[i].islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif l >=u:\r\n print(inp.lower())\r\nelif l < u:\r\n print(inp.upper())\r\n", "t=input()\r\ncount=0\r\nfor i in t:\r\n if ord(i)>54 and ord(i)<91:\r\n count+=1\r\nif count>len(t)/2:\r\n print(t.upper())\r\nelse:\r\n print(t.lower()) ", "n=input()\r\nsmall=0\r\ncap=0\r\nfor i in n:\r\n if 97<=ord(i)<=122:\r\n small=small+1 \r\n if 65<=ord(i)<=90:\r\n cap=cap+1\r\n\r\nif small==cap:\r\n print(str.lower(n))\r\nelif small>cap:\r\n print(str.lower(n))\r\nelse :\r\n print(str.upper(n))\r\n ", "a=input()\r\nb=0\r\nfor i in range(0,len(a)):\r\n if(a[i].isupper()==True):\r\n b+=1\r\nif(int(len(a)/2)>=b):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "s = str(input())\r\ncnt1 = cnt2 = 0\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n cnt1 += 1\r\n elif(s[i].isupper()):\r\n cnt2 += 1\r\n\r\nif(cnt1>cnt2):\r\n print(s.lower())\r\nelif(cnt1==cnt2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=input()\r\nc=0\r\nd=0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n c+=1\r\n elif a[i].isupper():\r\n d+=1\r\nif c>=d:\r\n print(a.lower())\r\nelif d>c:\r\n print(a.upper())", "s=input()\r\nl=u=0\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n l=l+1\r\n elif ord(i)>=65 and ord(i)<=90:\r\n u=u+1\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = input()\r\nprint(a.upper() if [1 if 65 <= ord(x) <= 90 else 0 for x in a].count(1) > len(a) // 2 else a.lower())", "t = input()\r\ns = 0\r\nfor i in t:\r\n if ord(i) < 97:\r\n s += 1\r\n \r\nif s >= (len(t)//2) + 1:\r\n t = t.upper()\r\nelse:\r\n t = t.lower()\r\n \r\nprint(t)\r\n\r\n", "s= input()\r\n\r\nlow=0\r\nupp=0\r\nfor char in s:\r\n if char.islower():\r\n low+=1\r\n else:\r\n upp+=1\r\n\r\nif low>upp:\r\n print(s.lower())\r\nelif upp>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import sys\r\n\r\nn = list(sys.stdin.readline())[:-1]\r\n\r\ncounter_l, counter_u = 0,0\r\nfor char in n:\r\n if char.islower():\r\n counter_l +=1\r\n if char.isupper():\r\n counter_u +=1\r\nif counter_l>=counter_u:\r\n print(\"\".join(n).lower())\r\nelse:\r\n print(\"\".join(n).upper())", "s = str(input())\r\nupper = 0\r\nlower = 0\r\na = []\r\na = s\r\nfor i in range(len(s)):\r\n if a[i] <= 'Z':\r\n upper += 1\r\n elif a[i] >= 'a':\r\n lower += 1\r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n#1", "string = input()\r\na = 0\r\nb= 0\r\nfor char in string:\r\n if char.isupper():\r\n a += 1\r\n continue\r\n if char.islower():\r\n b += 1\r\nif b>=a:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n\r\n", "word = input()\r\nup = low = 0\r\nfor i in word:\r\n if i.islower():\r\n low += 1\r\n else:\r\n up += 1\r\nif low >= up:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "import string\r\n\r\ns = input()\r\nx = 0\r\ny = 0\r\nfor c in s:\r\n if c.islower():\r\n x = x + 1\r\nfor c in s:\r\n if c.isupper():\r\n y = y + 1\r\nif x==y:\r\n print(s.lower())\r\nelif x>y:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word=input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(word)):\r\n if word[i]==word[i].upper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n#print(upper)\r\n#print(lower)\r\nif(lower>=upper):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "x=input()\r\nl=len(x)\r\nuc=0\r\nfor i in range(l):\r\n\tck=x[i].upper()\r\n\tif ck==x[i]:\r\n\t\tuc+=1\r\nlc=l-uc\r\nif (uc>lc):\r\n\tprint(x.upper())\r\nelse:\r\n\tprint(x.lower())\r\n", "s = input()\r\ns = list(s)\r\nresult = 0\r\n\r\nfor x in s:\r\n if x < x.lower():\r\n result = result + 1\r\n else:\r\n result = result\r\n\r\ns = ''.join(s)\r\n\r\nif len(s) - result < result:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "# http://codeforces.com/problemset/problem/59/A\n\n\ns = input()\n\nlength = len(s)\nup_count = 0\n\nfor i in s:\n\tif i.isupper():\n\t\tup_count += 1\n\n\nif up_count > length//2:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())", "s=input()\r\nsU=sL=0\r\nfor i in range(len(s)):\r\n if 'A'<=s[i]<='Z':\r\n sU+=1\r\n elif 'a'<=s[i]<='z':\r\n sL+=1\r\nif sU>sL:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "inputA = input()\r\n\r\nlower = 0\r\nupper = 0\r\n\r\n\r\nwordUpper = inputA.upper()\r\n\r\nfor char in range(len(inputA)):\r\n\tif wordUpper[char] != inputA[char]:\r\n\t\tlower = lower + 1\r\n\telse:\r\n\t\tupper = upper + 1\r\n\r\nif upper > lower:\r\n\tprint(wordUpper)\r\nelse:\r\n\tprint(inputA.lower())\r\n", "n = input()\r\nup = 0\r\nlow = 0\r\ntam = len(n)\r\n\r\nfor x in n:\r\n if x.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\n\r\nif low>=up:\r\n n = n.lower()\r\nelse:\r\n n = n.upper()\r\n\r\nprint(n)\r\n", "def case(s):\r\n\tl=[]\r\n\tfor i in range(0,len(s)):\r\n\t\tl.append(s[i])\r\n\tup=0\r\n\tlow=0\r\n\tfor i in range(0,len(s)):\r\n\t\tif l[i].isupper()==True:\r\n\t\t\tup+=1\r\n\t\telse:\r\n\t\t\tlow+=1\r\n\tif up==low:\r\n\t\treturn s.lower()\r\n\telif up>low:\r\n\t\treturn s.upper()\r\n\telse:\r\n\t\treturn s.lower()\r\n\r\ns=input()\r\nprint(case(s))\r\n", "u = 0\r\nl = 0\r\nw = input()\r\nfor c in w:\r\n if c == c.upper():\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif u > l:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())\r\n", "def correct_word(word):\r\n uppercase_count = sum(1 for ch in word if ch.isupper())\r\n lowercase_count = len(word) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\ndef main():\r\n word = input().strip()\r\n corrected_word = correct_word(word)\r\n print(corrected_word)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def correct_word(s):\r\n num_uppercase = sum(1 for c in s if c.isupper())\r\n num_lowercase = len(s) - num_uppercase\r\n if num_uppercase > num_lowercase:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\nword = input().strip()\r\nresult = correct_word(word)\r\nprint(result)", "s = input()\r\nlow=0\r\nhigh=0\r\nfor i in s:\r\n if i.islower():\r\n low+=1\r\n else:\r\n high+=1\r\n\r\n# print(high,low)\r\n\r\nif(high>low):\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)", "x = input()\r\n\r\nword = list(x)\r\nupper = []\r\nfor y in range(len(word)) :\r\n\tif word[y].isupper() :\r\n\t\tupper.append(word[y])\r\n\r\nfor y in range(len(word)) :\r\n\tif len(upper) > 0 and len(word) / len(upper) < 2 :\r\n\t\tword[y] = word[y].upper()\r\n\telse:\r\n\t\tword[y] = word[y].lower()\r\n\r\nprint(''.join(word))", "import string\r\nword=input()\r\ncount_small=0\r\ncount_capital=0\r\nfor x in range(len(word)):\r\n if word[x] in string.ascii_uppercase:\r\n count_capital+=1\r\n elif word[x] in string.ascii_lowercase:\r\n count_small+=1\r\n \r\nif count_capital>count_small:\r\n print(word.upper())\r\nelif count_small>count_capital:\r\n print(word.lower())\r\nelif count_capital==count_small:\r\n print(word.lower())\r\n \r\n\r\n", "s=input()\r\nlower=0\r\nupper=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n lower+=1\r\n elif s[i].isupper():\r\n upper+=1\r\nif upper>lower:\r\n a=s.upper()\r\n print(a)\r\nelse:\r\n a=s.lower()\r\n print(a)", "from re import U\n\n\ns = input()\nu = 0\nfor c in s:\n if c.isupper():\n u += 1\nl = len(s) - u\nif u > l:\n print(s.upper())\nelse:\n print(s.lower())\n", "s=input()\r\nsm_count=0\r\ncap_count=0\r\nsmall=\"\"\r\nlarge=\"\"\r\nfor alpha in s:\r\n if ord(alpha)>=97 and ord(alpha)<=122:\r\n small+=alpha\r\n large+=chr(ord(alpha)-97+65)\r\n sm_count+=1\r\n else:\r\n small+=chr(ord(alpha)+97-65)\r\n large+=alpha\r\n cap_count+=1\r\nif sm_count>=cap_count:\r\n print(small)\r\nelse:\r\n print(large)", "s = input()\r\nl = len(s)\r\nup = 0\r\nfor c in s:\r\n\tif(c.isupper()):\r\n\t\tup = up + 1\r\n#print(l)\r\n#print(up)\r\nif up <= (l/2):\r\n\ts = s.lower()\r\nelse:\r\n\ts = s.upper()\r\nprint(s)", "word=input()\r\nlower=sum(map(str.islower, word))\r\nupper=sum(map(str.isupper, word))\r\nif upper>lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\nlower = 0\nupper = 0\nfor i in s:\n if i.islower():\n lower+=1\n else:\n upper+=1\n\nif lower == upper:\n print(s.lower())\nelif lower<upper:\n print(s.upper())\nelse:\n print(s.lower())\n", "str1=input()\r\nl1='abcdefghijklmnopqrstuvwxyz'\r\nl2='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nc1=0\r\nc2=0\r\nfor i in str1:\r\n if i in l1:\r\n c1+=1\r\n if i in l2:\r\n c2+=1\r\nif c1>=c2:\r\n str1=str1.lower()\r\nelse:\r\n str1=str1.upper()\r\nprint(str1)", "word = input()\r\n\r\ncovToCap = False\r\ncntUpperCase = 0\r\ncntLowerCase = 0\r\n\r\nfor i in range(len(word)):\r\n if(word[i].isupper()):\r\n cntUpperCase+=1\r\n else:\r\n cntLowerCase+=1\r\n\r\nif cntUpperCase> cntLowerCase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n", "str = input()\r\ncount = 0\r\nfor i in str:\r\n if i.isupper():\r\n count+=1\r\nif (len(str)/2) < count:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "word = input()\r\ncontador_upper = 0\r\ncontador_lower = 0\r\nfor i in word:\r\n if i == i.upper():\r\n contador_upper +=1\r\n else:\r\n contador_lower += 1\r\nif contador_upper <= contador_lower:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n \r\n", "x = input()\r\nl=0\r\nu=0\r\nfor i in x:\r\n\tif i.islower():\r\n\t\tl=l+1\r\n\telse:\r\n\t\tu=u+1\r\nif u>l:\r\n\tprint(x.upper())\r\nelse:\r\n\tprint(x.lower())", "str = input()\r\nl_count = 0\r\nfor i in str:\r\n if (i.islower() == True): l_count += 1\r\nif (l_count >= (len(str) - l_count)): print(str.lower())\r\nelse: print(str.upper())", "def correct_word(s):\r\n uppercase_count = sum(1 for char in s if char.isupper())\r\n lowercase_count = len(s) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\nword = input().strip()\r\n\r\nresult = correct_word(word)\r\nprint(result)\r\n", "# Read input 1 <= word <= 100 Latin letters\r\nraw_word = input()\r\n\r\n# Identify how many are uppercase and how many lowercase\r\nuppercase_letters = []\r\nlowercase_letters = []\r\n\r\nfor letter in raw_word:\r\n if letter.islower() is True:\r\n lowercase_letters.append(letter)\r\n else:\r\n uppercase_letters.append(letter)\r\n\r\n# Change to majority, ties in lowercase\r\nif len(lowercase_letters) >= len(uppercase_letters):\r\n formatted_word = raw_word.lower()\r\nelse:\r\n formatted_word = raw_word.upper()\r\n\r\n# Print out the result\r\nprint(formatted_word)", "str = input()\r\nlow = 0\r\nhigh = 0\r\n\r\nfor i in str:\r\n if(i.islower()):\r\n low += 1\r\n elif(i.isupper()):\r\n high += 1\r\n\r\nif low > high:\r\n print(str.lower())\r\nelif low < high:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "s = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n if ord(s[i]) <= 90:\r\n count += 1\r\n else:\r\n count -= 1\r\nif count > 0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input(\"\")\r\nuppercase = 0\r\nlowercase = 0 \r\n\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n uppercase += 1\r\n else:\r\n lowercase += 1 \r\n\r\nif uppercase > lowercase: \r\n print(word.upper())\r\n\r\nelse:\r\n print(word.lower())\r\n\r\n\r\n\r\n", "'''\r\nquestion link: \r\n'''\r\nclass Solution:\r\n\tdef __init__(self)->None:\r\n\t\tpass\r\n\tdef solve(self)->str:\r\n\t\tst=input().strip()\r\n\t\tct=0\r\n\t\tfor ch in st:\r\n\t\t\tif ord(ch)<97:\r\n\t\t\t\tct+=1\r\n\t\tif (ct>(len(st)//2) and len(st)%2==0):\r\n\t\t\treturn st.upper()\r\n\t\telif (ct>=(len(st)//2)+1):\r\n\t\t\treturn st.upper()\r\n\t\telse:\r\n\t\t\treturn st.lower()\r\n\r\n\r\n\r\nimport sys\r\nimport math\r\nif __name__ == \"__main__\":\r\n\tsl=Solution()\r\n\tprint(sl.solve())\r\n", "s = input()\r\n\r\nup_count = 0\r\nlow_count = 0\r\n\r\nfor i in s:\r\n if i.isupper() == True:\r\n up_count = up_count + 1\r\n else:\r\n low_count = low_count + 1\r\nif up_count > low_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import string\r\ns=input()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i in string.ascii_lowercase:\r\n l=l+1\r\n else:\r\n u=u+1\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n \r\n", "w = input()\r\nl = 0\r\nu = 0\r\nfor c in w:\r\n if c.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif l>=u:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n ", "s = input()\nsarray = []\n\ncount = [0,0]\n\nfor i in range(len(s)):\n sarray.append(ord(s[i]))\n if ord(s[i]) <= 90:\n count[0] = count[0]+1\n else:\n count[1] = count[1]+1\n\nif count[0] <= count[1]:\n print(s.lower())\nelse:\n print(s.upper())", "t=input()\r\nlen1=0\r\nlen2=0\r\nfor char in t:\r\n if char.isupper():\r\n len1+=1\r\nfor char in t:\r\n if char.islower():\r\n len2+=1\r\nif len1>len2:\r\n print(t.upper())\r\nelif len1<len2:\r\n print(t.lower())\r\nelse:\r\n print(t.lower())\r\n ", "n=input()\r\nlc=0\r\nuc=0\r\nfor c in n:\r\n if c.isupper():\r\n uc+=1\r\n elif c.islower():\r\n lc+=1\r\nif lc>=uc:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s=input()\r\nl=0\r\nu=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n ans=s.upper()\r\nelse:\r\n ans=s.lower()\r\nprint(ans)", "t=input();\r\nprint([t.lower(),t.upper()][sum(x<'['for x in t)*2>len(t)])", "mayuscula = 0\nminuscula = 0\n \npalabra = input()\n\nfor i in palabra:\n if i.isupper():\n mayuscula += 1\n else:\n minuscula +=1\n\n\n\nif minuscula >= mayuscula: print(palabra.lower())\n\nelse:\n print(palabra.upper())\n \t\t\t\t \t\t \t \t \t \t\t \t\t \t", "word = input()\r\n\r\nif sum([i.isupper() for i in word]) > len(word) - sum([i.isupper() for i in word]):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "import math, sys, collections\r\n'''\r\nsys - maxsize\r\ncollections - defaultdict, Counter\r\n'''\r\ninput = sys.stdin.readline\r\n\r\nistr = lambda: input().strip()\r\ninum = lambda: int(input().strip())\r\nimap = lambda: map(int,input().strip().split())\r\nilist = lambda: list(map(int, input().strip().split()))\r\n\r\ntry:\r\n w = istr()\r\n u, l = 0, 0\r\n for x in w:\r\n if x.isupper():\r\n u += 1\r\n else:\r\n l += 1 \r\n print(w.upper() if u > l else w.lower())\r\n\r\n\r\nexcept Exception as e:\r\n print(\"ERROR: \", e)\r\n pass", "n=input()\r\nu,l=0,0\r\nfor i in range(len(n)):\r\n\tif n[i]<='Z' and n[i]>='A':\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif u>l:\r\n\tprint(n.upper())\r\nelse:\r\n\tprint(n.lower())", "s=str(input())\r\nlow=0\r\nsup=0\r\nfor i in range (len(s)):\r\n if s[i].islower()==1:\r\n low+=1\r\n else:\r\n sup+=1\r\nif sup>low:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "def up(str):\r\n\tcnt = 0;\r\n\tfor c in str:\r\n\t\tif(c.isupper()):\r\n\t\t\tcnt += 1\r\n\treturn cnt\r\ni = input\r\ns = i()\r\nif(up(s) > len(s) / 2):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "stringInput = input()\r\nupperCaseCounter=0\r\nlowerCaseCounter=0\r\nfor x in stringInput:\r\n if(x.isupper()==True):\r\n upperCaseCounter+=1\r\n else:\r\n lowerCaseCounter+=1\r\nif upperCaseCounter > lowerCaseCounter:\r\n stringInput=stringInput.upper()\r\nelse:\r\n stringInput=stringInput.lower()\r\nprint(stringInput)\r\n", "\r\nz=input()\r\nup=0\r\nlow=0\r\nfor i in z:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\n\r\nif low>=up:\r\n print(z.lower())\r\nelse:\r\n print(z.upper())\r\n", "import re\r\n\r\ns = input()\r\n\r\nr = re.findall(r'[A-Z]', s)\r\nif len(r) <= len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=str(input())\r\na=s.upper()\r\nb=s.lower()\r\nupper=0\r\nlower=0\r\nfor i in range(len(s)):\r\n if s[i]==a[i]:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(a)\r\nelse:\r\n print(b)", "\r\na=input()\r\nn=0\r\nl=int(len(a))\r\nfor i in a:\r\n if i.isupper():\r\n n+=1\r\nif n>l/2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "a=input()\r\ncc=0\r\nc1=0\r\nfor i in range(len(a)):\r\n if ord(a[i])<97:\r\n cc+=1\r\n else:\r\n c1+=1\r\nif cc > c1:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "def count_big_and_little_let(word):\r\n big = little = 0\r\n for let in word:\r\n if let.isupper():\r\n big += 1\r\n else:\r\n little += 1\r\n return big, little\r\n\r\n\r\ndef solution_template(word):\r\n big, little = count_big_and_little_let(word)\r\n if big > little:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\n\r\ndef main():\r\n word = input()\r\n print(solution_template(word))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def first():\r\n word = input()\r\n lower_count = sum(map(str.islower, word))\r\n upper_count = sum(map(str.isupper, word))\r\n if lower_count >= upper_count:\r\n print(word.lower())\r\n if upper_count > lower_count:\r\n print(word.upper())\r\n\r\n\r\nfirst()", "result = input()\n\nupper_count = 0\nlower_count = 0\nfor c in result:\n\tif c.isupper():\n\t\tupper_count += 1\t\n\telse:\n\t\tlower_count += 1\n\nif(lower_count >= upper_count):\n\tprint(result.lower())\nelse:\n\tprint(result.upper())\n\n\n", "n=input()\r\nl=0\r\nu=0\r\nfor i in n:\r\n if i.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nprint(n.upper() if u>l else n.lower())", "s=input()\r\nclower=0\r\nfor i in s:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n clower+=1\r\ncupper=len(s)-clower\r\nif (cupper<=clower):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nlength = len(s)\r\ncount_up = 0\r\ncount_low = 0\r\nfor letter in s:\r\n if letter.isupper():\r\n count_up += 1\r\ncount_low = length - count_up\r\nif count_low >= count_up:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)", "l = 0\r\nu = 0\r\ndef compute ( str ):\r\n global l,u\r\n for i in range (len(str)):\r\n value = ord(str[i])\r\n if value <= 90:\r\n u += 1\r\n else:\r\n l += 1\r\n if u > l:\r\n return 'u'\r\n elif l > u:\r\n return 'l'\r\n else:\r\n return 'l'\r\nstr = input()\r\ns1 = compute ( str )\r\nif s1[0] == 'l':\r\n str = str.lower()\r\nelse:\r\n str = str.upper()\r\nprint (str) \r\n", "a=input()\r\np=0\r\nq=0\r\nfor i in range(len(a)):\r\n if (ord(a[i]))>=97:\r\n p+=1\r\n else:\r\n q+=1\r\nif(p>=q):\r\n b=a.lower()\r\nelse:\r\n b=a.upper()\r\nprint(b)\r\n ", "a=input()\r\nc1=c2=0\r\nfor i in a:\r\n\tif ord(i)>=92 and ord(i)<=122:\r\n\t\tc1+=1\r\n\telse:\r\n\t\tc2+=1\r\nif c1>=c2:\r\n\ta=a.lower()\r\nelse:\r\n\ta=a.upper()\r\nprint(a)", "# 10/10\r\ns = input()\r\nprint(s.lower() if 2 * sum([x.isupper() for x in s]) <= len(s) else s.upper())", "txt = input()\r\n\r\nlc = 0\r\nfor i in txt:\r\n if i.islower():\r\n lc += 1\r\nrc = len(txt) - lc\r\n\r\nif lc > rc or lc == rc:\r\n print(txt.lower())\r\n \r\nelif rc > lc:\r\n print(txt.upper())", "s = input()\nlower_count = 0\nupper_count = 0\n\nfor c in s:\n if c.islower():\n lower_count += 1\n elif c.isupper():\n upper_count += 1\n\n\nif lower_count >= upper_count:\n print(s.lower())\n \nelse:\n print(s.upper())\n \t \t\t \t\t \t \t\t\t \t\t\t \t\t\t", "string = str(input())\r\naupper = 0\r\ndlower = 0\r\nfor i in range(len(string)):\r\n if string[i] == string[i].lower():\r\n dlower += 1\r\n else:\r\n aupper += 1\r\nif dlower >= aupper:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n ", "a = input()\r\nlo = 0\r\nu = 0\r\nfor i in a:\r\n if i.islower():\r\n lo += 1\r\n if i.isupper():\r\n u += 1\r\nif lo < u:\r\n print(a.upper())\r\nif lo > u or lo == u:\r\n print(a.lower())", "n = input()\r\np = list(n)\r\nu = 0\r\nl = 0\r\nfor i in range(0,len(p)):\r\n if 65<=ord(p[i])<=90:\r\n u += 1\r\n else:\r\n l += 1\r\nif l>=u:\r\n print(n.casefold())\r\nelse:\r\n print(n.upper())\r\n\r\n ", "s = input()\r\nu, l =0, 0\r\nfor i in s:\r\n\tif(i.islower()):\r\n\t\tl+=1\r\n\telse:\r\n\t\tu+=1\r\n\r\nif l<u:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "n = input()\nlower = 0 \nupper = 0 \nfor i in n:\n if (i.islower()):\n lower += 1 \n elif (i.isupper()):\n upper += 1\nif upper>lower:\n print(n.upper())\nelse:\n print(n.lower())", "def main():\r\n s=input()\r\n z=s.lower()\r\n f=s.upper()\r\n i=0\r\n count1=0\r\n count2=0\r\n while(i<len(s)):\r\n if(s[i]==z[i]):\r\n count1+=1\r\n else :\r\n count2+=1\r\n i+=1\r\n if(count1>=count2):\r\n print(z)\r\n else :\r\n print(f)\r\nmain()\r\n", "word = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor char in word:\r\n if 97 <= ord(char) <= 122:\r\n lower+=1\r\n else:\r\n upper+=1\r\n\r\nif upper>lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "import string\r\n\r\nlows = list(string.ascii_lowercase)\r\nhighs = list(string.ascii_uppercase)\r\n\r\nh = 0\r\nl = 0\r\n\r\nx = input()\r\ny = list(x)\r\n\r\nfor letter in y:\r\n if letter in lows:\r\n l +=1\r\n elif letter in highs:\r\n h += 1\r\nif h > l:\r\n z = x.upper()\r\nelse:\r\n z = x.lower()\r\nprint(z)\r\n\r\n", "n = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n upper += 1\r\n elif i.islower():\r\n lower += 1\r\n\r\nif upper > lower:\r\n print(n.upper())\r\nelif upper < lower:\r\n print(n.lower())\r\nelif upper == lower:\r\n print(n.lower())", "a = input();\r\nu = 0;\r\nres = a.lower();\r\n\r\nfor i in a:\r\n\tif(i.isupper()):\r\n\t\tu+=1\r\n\r\nif(len(a)-u < u):\r\n\tres = res.upper()\r\nprint(res)", "name=input()\r\nx=list(filter(lambda a:a.isupper(),name))\r\ntotal_length=len(name)\r\nupper_length=len(x)\r\nlower_length=(total_length)-(upper_length)\r\nif upper_length>lower_length:\r\n result1=name.upper()\r\n print(result1)\r\nelif (lower_length>upper_length) or (upper_length==lower_length):\r\n result2=name.lower()\r\n print(result2)", "s = input()\r\ncnt = 0\r\nfor i in s:\r\n if i.isupper(): cnt += 1\r\nif cnt > len(s)-cnt:\r\n print(s.upper())\r\nelse: print(s.lower())", "a= input()\r\n\r\nref1='abcdefghijklmnopqrstuvwxyz'\r\nref2= ref1.upper()\r\n\r\nlow=[]\r\nhigh=[]\r\n\r\nfor i in a:\r\n if i in ref1:\r\n low.append(i)\r\n else:\r\n high.append(i)\r\n \r\nif len(low)>=len(high):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "def ciml(i):\r\n ucs = 0\r\n for l in i:\r\n if l == l.upper() and l != ' ':\r\n ucs += 1\r\n return ucs <= len(i)/2\r\n \r\ns = input()\r\nif ciml(s):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\na = list(n)\r\nc1=0\r\nc2=0\r\nfor i in a:\r\n if 'A' <= i <= 'Z':\r\n c1+=1\r\n else:\r\n c2 += 1\r\nl1=[]\r\nl2=[]\r\nif c1<= c2:\r\n for i in a:\r\n l1.append(i.lower())\r\n print(\"\".join(l1))\r\nelse:\r\n for i in a:\r\n l2.append(i.upper())\r\n print(\"\".join(l2))", "string=str(input())\ncountU=0\ncountL=0\nfor i in string:\n\tif i==i.upper():\n\t\tcountU+=1\n\telif i==i.lower():\n\t\tcountL+=1\n\telse:\n\t\tpass\nif countU>countL:\n\tprint(string.upper())\nelse:\n\tprint(string.lower())\n", "s = input()\r\n\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n uppercase += 1\r\n elif i.islower:\r\n lowercase += 1\r\n\r\nif lowercase < uppercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s1=input()\r\ncap=0\r\nsmall=0\r\nfor i in range(len(s1)):\r\n if(ord(s1[i])>=65 and ord(s1[i])<=90 ):\r\n cap+=1\r\n else:\r\n small+=1\r\nif(small<cap):\r\n print(s1.upper())\r\nelse:\r\n print(s1.lower())\r\n", "n=input()\r\nk=0\r\nfor i in range(len(n)) :\r\n if n[i]>='a' :\r\n k+=1\r\nif k>=(len(n)-k) :\r\n print(n.lower())\r\nelse :\r\n print(n.upper())", "import sys\r\n\r\ndef main():\r\n s = str(input()) \r\n upp =len(list(filter(lambda c : 'A' <= c and c <= 'Z',s)))\r\n low =len(list(filter(lambda c : 'a' <= c and c <= 'z',s)))\r\n\r\n if upp > low : \r\n print(s.upper())\r\n else :\r\n print(s.lower())\r\n \r\n\r\nif __name__ == '__main__' :\r\n\tmain()\r\n", "import re\r\ns=input()\r\nmay=len(re.findall(\"[A-Z]\",s))\r\nlow=len(s)-may\r\nprint(s.lower() if low>=may else s.upper())", "word = input()\r\nnum_caps = 0\r\n\r\nfor i in range(len(word)):\r\n if ord(word[i]) < 97:\r\n num_caps += 1\r\n \r\nif num_caps > len(word) - num_caps:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nlower = s.lower()\r\nupper = s.upper()\r\n\r\nlength = len(s)\r\nlower_cost = 0\r\nupper_cost = 0\r\n\r\nfor i in range(0, length):\r\n if lower[i] != s[i]:\r\n lower_cost += 1\r\n if upper[i] != s[i]:\r\n upper_cost += 1\r\n\r\nif lower_cost <= upper_cost:\r\n print(lower)\r\nelse:\r\n print(upper)", "x = input()\r\nu = 0\r\nl = 0\r\nfor i in range(len(x)):\r\n if x[i].isupper():\r\n u +=1\r\n else:\r\n l +=1\r\n\r\nif l>u or l==u:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "import sys\r\ninputs=sys.stdin.readline().strip()\r\nn=inputs.upper()\r\na=[x for x in inputs]\r\nl=len(a)\r\nb=[y for y in n]\r\nc=0\r\nfor i in range(len(a)):\r\n if a[i]==b[i]:\r\n c=c+1\r\ns=l-c\r\nif c>s:\r\n print(inputs.upper())\r\nelse:\r\n print(inputs.lower())", "s1=str(input())\r\nu,j=0,0\r\nfor i in s1:\r\n if(i.isupper()):\r\n u=u+1 \r\n else:\r\n j=j+1 \r\nif(u<=j):\r\n print(s1.lower())\r\nelse:\r\n print(s1.upper())\r\n ", "s=input()\r\nupper=0\r\nlower=0\r\nfor x in s:\r\n if x.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper > lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x = input()\r\ncount = 0\r\ncount2 = 0\r\nfor a in x:\r\n if a.isupper():\r\n count += 1\r\n else:\r\n count2 += 1\r\nif count > count2:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "import math\r\nm=input()\r\nlist_1=list(m)\r\nlist_2=[x.lower() for x in list_1]\r\nb=len(list_1)\r\na=0\r\nc=math.ceil(b/2)\r\nfor i in list_1:\r\n if i in list_2:\r\n a+=1\r\nif a>=c:\r\n print(m.lower())\r\nelse:\r\n print(m.upper())", "s=input()\r\nupper=0\r\nlower=0\r\nfor char in s:\r\n if char.isupper():\r\n upper=upper+1\r\n else:\r\n lower=lower+1\r\nif upper>lower:\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)", "\r\nn = str(input())\r\nd={\"uc\":0, \"lc\":0}\r\nfor c in n:\r\n if c.isupper():\r\n d[\"uc\"]+=1\r\n elif c.islower():\r\n d[\"lc\"]+=1\r\n else:\r\n pass\r\n\r\nl=len(n)\r\n\r\nif(d[\"uc\"]>l/2):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s = input()\ncounter = 0\ncounter1 = 0\n\nfor i in s:\n if i.isupper() == True :\n counter += 1\n else:\n counter1 += 1\nif counter > counter1:\n print(s.upper())\nelse:\n print(s.lower())\n\n \t \t \t\t \t \t\t\t\t\t \t\t\t\t\t \t \t\t", "c = input()\r\nn = \"\"\r\nk = \"\"\r\nmal = 0\r\nbig = 0\r\nfor i in range(len(c)):\r\n n = c[i].upper()\r\n k = c[i]\r\n if n == k:\r\n big = big + 1\r\n else:\r\n mal = mal + 1\r\nif mal >= big:\r\n print(c.lower())\r\nelse:\r\n print(c.upper())\r\n", "def capitalize(word):\r\n upper = 0\r\n lower = 0\r\n for letter in word:\r\n if letter.isupper():\r\n upper += 1\r\n elif letter.islower():\r\n lower += 1\r\n if lower >= upper:\r\n return(word.lower())\r\n elif upper > lower:\r\n return(word.upper())\r\n else:\r\n return(0)\r\n\r\nprint(capitalize(str(input())))", "def main():\n word = input()\n x = [1 for _ in word if _.islower()]\n if len(x) >= len(word)-len(x):\n print(word.lower())\n else:\n print(word.upper())\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\ndef main():\r\n w = input()\r\n print(w.upper() if sum(1 for c in w if c.isupper()) > sum(1 for c in w if c.islower()) else w.lower())\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "#Word\nword = input()\ncount_lower = 0\ncount_upper = 0\n\nfor s in word:\n if s.isupper():\n count_upper+=1\n else:\n count_lower+=1\n\nif count_upper>count_lower:\n print(word.upper())\nelse:\n print(word.lower())\n\n'''\nHoUse\n\nhouse\n\nViP\n\nVIP\n\nmaTRIx\n\nmatrix\n\n'''", "a=input()\r\nl=len(a)\r\nlo=0\r\nup=0\r\nfor i in a:\r\n if (i.isupper()):\r\n up=up+1\r\n else:\r\n lo=lo+1\r\nif(up>lo):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "st = input()\r\ncount_up = 0\r\ncount_down = 0\r\nfor i in st:\r\n if i.isupper():\r\n count_up = count_up + 1\r\n else:\r\n count_down = count_down + 1\r\nif count_up > count_down:\r\n st = st.upper()\r\nelif (count_down > count_up) or (count_down == count_up):\r\n st = st.lower()\r\nprint (st)", "s=input()\r\nlow=0\r\nupp=0\r\nfor i in s:\r\n if i==i.upper():\r\n upp=upp+1\r\n else:\r\n low=low+1\r\nif upp>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\na=b=0\r\nfor i in s:\r\n if i.isupper():\r\n a+=1\r\n else:\r\n b+=1\r\nif a>b:\r\n for i in s:\r\n print(i.upper(),end=\"\")\r\nelse:\r\n for i in s:\r\n print(i.lower(),end=\"\")\r\n ", "str=input()\r\nu1=0\r\nl1=0\r\nfor k in str:\r\n if 65<=ord(k)<=90:\r\n u1+=1\r\n elif 97<=ord(k)<=122:\r\n l1+=1\r\nif u1==l1:\r\n print(str.lower())\r\nelif u1<l1:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "text=input()\r\nupper=0\r\nlower=0\r\nfor i in text:\r\n if i.islower():\r\n lower=lower+1\r\n elif i.isupper():\r\n upper=upper+1\r\nif upper>lower:\r\n print(text.upper())\r\nelif(lower>upper):\r\n print(text.lower())\r\nelif(upper==lower):\r\n print(text.lower())", "import sys\r\nword = sys.stdin.readline()\r\n\r\nu=0\r\nl=0\r\nfor i in word:\r\n if i.isupper():\r\n u=u+1\r\n if i.islower():\r\n l=l+1\r\nif u>l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nupperlst, lowerlst = [], []\r\n\r\nfor i in s:\r\n #print(i)\r\n upperlst.append(i.isupper())\r\n #print(upperlst)\r\n lowerlst.append(i.islower())\r\n #print(lowerlst)\r\n \r\nif sum(upperlst) > sum(lowerlst):\r\n print(s.upper())\r\nelif sum(lowerlst) > sum(upperlst):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "word = input()\ncap, sm = 0, 0\nfor c in word:\n if ord('A') <= ord(c) <= ord('Z'):\n cap += 1\n else:\n sm += 1\nif cap > sm:\n print(word.upper())\nelse:\n print(word.lower())", "s = input()\r\ncap=small = 0\r\nfor i in s:\r\n if (ord(i)>=65 and ord(i)<97):\r\n cap+= 1 \r\n else:\r\n small +=1 \r\n \r\nif (small>=cap):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "x=input()\r\nl,u=0,0\r\nfor i in x:\r\n if (i>='a'and i<='z'):\r\n l=l+1 \r\n if (i>='A'and i<='Z'):\r\n u=u+1\r\nprint((x.upper(),x.lower())[l>=u])", "n=input()\r\nup=0\r\nlow=0\r\nfor i in range(len(n)):\r\n if(ord(n[i])>96):\r\n low=low+1\r\n else:\r\n up=up+1\r\nif(low==up or low>up):\r\n n=n.lower()\r\nelse:\r\n n=n.upper()\r\nprint(n)", "# Link: https://codeforces.com/contest/59/problem/A\n\nstring = input()\nlowercases = uppercases = 0\n\nfor letter in string:\n if letter.islower():\n lowercases += 1\n else:\n uppercases += 1\n\nif lowercases >= uppercases:\n print(string.lower())\nelse:\n print(string.upper())", "s = input()\r\ncaps = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nsmall = \"abcdefghijklmnopqrstuvwxyz\"\r\ncaps_c = 0\r\nsmall_c = 0\r\nfor i in s:\r\n if i in caps:\r\n caps_c += 1\r\n else:\r\n small_c += 1\r\nif(caps_c <= small_c):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=input()\r\ncount=0\r\ncount2=0\r\nfor i in a:\r\n if i==i.upper():\r\n count+=1\r\n elif i==i.lower():\r\n count2+=1\r\nif count>count2:\r\n print(a.upper())\r\nelif count<count2:\r\n print(a.lower())\r\nelse:\r\n print(a.lower())", "s=input()\r\nlow=0\r\n\r\nfor letter in s:\r\n if letter.islower()==1:\r\n low+=1\r\nif low<len(s)-low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jan 16 10:38:32 2021\r\n\r\n@author: Syed Ishtiyaq Ahmed\r\n\"\"\"\r\nstat=input()\r\nlcount=0\r\nucount=0\r\nfor i in range(len(stat)):\r\n if stat[i].isupper()==True:\r\n ucount+=1\r\n elif stat[i].islower()==True:\r\n lcount+=1\r\nif ucount>lcount:\r\n print(stat.upper())\r\nif lcount>ucount:\r\n print(stat.lower())\r\nif ucount==lcount:\r\n print(stat.lower())\r\n\r\n \r\n\r\n \r\n \r\n \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\nup = 0\r\nlo = 0\r\nfor i in s :\r\n if i == i.lower() :\r\n lo += 1 \r\n else :\r\n up += 1 \r\nif lo >= up :\r\n print(s.lower())\r\nelse :\r\n print(s.upper())", "s=str(input())\r\nb=0\r\nfor i in range(0,len(s)):\r\n if s[i]==s[i].lower():\r\n b=b+1\r\nif b>=len(s)-b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "from math import*\r\n\r\ns = input()\r\na = list(s)\r\nb = 0\r\nc = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper() == True:\r\n b += 1\r\n else:\r\n c += 1\r\nif b > c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\r\ncnt1 = cnt2 = 0\r\nfor s in string:\r\n cnt1 += int('a' <= s <= 'z')\r\n cnt2 += int('A' <= s <= 'Z')\r\nif cnt1 >= cnt2:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n", "s=input()\r\nc=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n c+=1\r\nn=len(s)-c \r\nif c>n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=input(\"\")\r\nupper_let,lower_let=0,0\r\nfor i in word:\r\n if i == \" \":\r\n continue\r\n if i.isupper()==True:\r\n upper_let+=1\r\n else:\r\n lower_let+=1\r\nif upper_let>lower_let:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "a=input()\r\np=0\r\nn=0\r\nfor i in a:\r\n if(i.islower()):\r\n n+=1\r\n else:\r\n p+=1\r\nif(n>=p):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s=input()\r\nhm={'l':0,'u':0}\r\nfor i in s:\r\n x=ord(i)\r\n if x>=65 and x<=90:\r\n hm['u']+=1\r\n else:\r\n hm['l']+=1\r\nif hm['l']>=hm['u']:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\nu = []\r\nl = []\r\n\r\nfor i in n:\r\n if i.isupper():\r\n u.append(i)\r\n else:\r\n l.append(i)\r\n\r\nif len(u) == len(l) or len(u) < len(l):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\nupperCase = 0\r\nlowerCase = 0\r\nfor i in word:\r\n if i.isupper()==True:\r\n upperCase+=1\r\n else:\r\n lowerCase+=1\r\nif upperCase == lowerCase or upperCase < lowerCase:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "strr = str(input())\r\nn = len(strr)\r\nupper = 0\r\nlower = 0\r\nfor i in strr:\r\n if(65 <= ord(i) <= 90):\r\n upper +=1\r\n else:\r\n lower +=1\r\nif(upper>lower):\r\n print(strr.upper())\r\nelse:\r\n print(strr.lower())\r\n \r\n ", "s = input()\r\nsmall = 0\r\nbig = 0\r\n\r\nfor i in s:\r\n if \"a\" <= i <= \"z\":\r\n small += 1\r\n elif \"A\" <= i <= \"Z\":\r\n big += 1\r\n\r\nif small < big:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nuppercount=0\r\nlowercount=0\r\nfor i in a:\r\n if i.islower():\r\n lowercount+=1\r\n else:\r\n uppercount+=1\r\nif uppercount>lowercount:\r\n a=a.upper()\r\nelse:\r\n a=a.lower()\r\nprint(a)", "x=input()\r\ns=0;k=0\r\nfor i in x:\r\n if i.islower():\r\n s+=1\r\n if i.isupper():\r\n k+=1\r\nif s>=k:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "word = input()\ncaps = 0\nfor i in range(len(word)):\n if word[i].isupper():\n caps+=1\nif caps>len(word)//2:\n print(word.upper())\nelse:\n print(word.lower())", "word = input()\r\ncaps = int(0)\r\nlow = int(0)\r\nfor i in range(len(word)):\r\n if word[i].isupper() == True:\r\n caps+=1\r\n else:\r\n low+=1\r\nif caps>low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "ch,x,y= input(),0,0\r\nfor i in range(len(ch)):\r\n if ch[i].isupper():\r\n x+=1\r\n else:\r\n y+=1\r\nif x>y:\r\n print(ch.upper())\r\nelse:\r\n print(ch.lower())", "List = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\",\r\n \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"]\r\n\r\ns = input()\r\nsmall = 0\r\nlarge = 0\r\n\r\nfor item in s:\r\n if item in List:\r\n small += 1\r\n elif item not in List:\r\n large += 1\r\n\r\nif small >= large:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=input()\na,b=0,0\nfor i in range(len(s)):\n if 65<=ord(s[i])<=90:\n a+=1\n else:\n b+=1\nif b>=a:\n s=s.lower()\n print(s)\nelse:\n s=s.upper()\n print(s)\n\t \t \t \t \t\t \t\t\t \t\t \t \t", "s = input()\r\nprint(s.lower() if len([x for x in s if x in 'QWERTYUIOPASDFGHJKLZXCVBNM']) <= len(s) // 2 else s.upper())", "def n_lower_chars(string):\n return sum(map(str.islower, string))\n\ni = input()\na = i.upper()\nb = i.lower()\nif (i==a):\n print(a)\nelif (i==b):\n print(b)\nelse:\n if (n_lower_chars(i) >= (len(i)/2)):\n print(b)\n else :\n print(a)\n", "word = input()\r\n\r\nB = 0\r\nA = 0\r\n\r\nfor i in word:\r\n if i.lower() == i:\r\n A+=1\r\n else:\r\n B+=1\r\nif(A > B or A == B):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s=input()\r\nres=0\r\nfor j in range(len(s)):\r\n if s[j].islower():\r\n res=res+1\r\nif len(s)<=2*res:\r\n print (s.lower())\r\nelse:\r\n print (s.upper())\r\n", "x=(input())\r\ncount=0\r\nc=0\r\nfor i in range(len(x)):\r\n if x[i].isupper():\r\n count=count+1\r\n else:\r\n c=c+1\r\n#print(count,c)\r\nif (count <= c):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "string = input()\r\nuc = 0\r\nlc = 0\r\nfor i in string:\r\n\tif i < 'a':\r\n\t\tuc += 1\r\n\telse: lc += 1\r\n\r\nif(lc >= uc):\r\n\tprint(string.lower())\r\n\r\nelse:\r\n\tprint(string.upper())\t\t\r\n", "s=input()\r\nk=sum(i.isupper() for i in s)\r\nprint(s.lower() if k<=len(s)-k else s.upper())", "s = input()\r\ncount_b, count_m = 0, 0\r\nr = \"\"\r\n\r\nfor i in s:\r\n if (ord(i) >= 65) and ord(i) <= 90:\r\n count_b += 1\r\n elif (ord(i) >= 97) and (ord(i) <= 122):\r\n count_m += 1\r\n\r\nif count_m >= count_b:\r\n for i in s:\r\n if (ord(i) >= 65) and ord(i) <= 90:\r\n r += chr(ord(i) + 32)\r\n else:\r\n r += i\r\nelse:\r\n for i in s:\r\n if (ord(i) >= 97) and (ord(i) <= 122):\r\n r += chr(ord(i) - 32)\r\n else:\r\n r += i\r\n\r\nprint(r)\r\n", "word = list(input())\r\na = 0\r\nb = 0\r\nfor i in word:\r\n if i == i.upper():\r\n a += 1\r\n if i == i.lower():\r\n b += 1\r\n\r\nword = ('').join(word)\r\n\r\nif a > b:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "text=list(input())\r\nupr_cnt,lwr_cnt=0,0\r\nfor i in range(len(text)):\r\n if(text[i].islower()):\r\n lwr_cnt+=1\r\n if(text[i].isupper()):\r\n upr_cnt+=1\r\nif(upr_cnt==lwr_cnt):\r\n text = (\"\".join(text)).lower()\r\nelif(upr_cnt>lwr_cnt):\r\n for i in range(len(text)):\r\n if(text[i].isupper()):\r\n text[i]\r\n if(text[i].islower()):\r\n text[i] = text[i].upper()\r\nelse:\r\n text = (\"\".join(text)).lower()\r\nprint(\"\".join(text))", "s = input()\r\ncount_up = 0\r\ncount_low = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n count_up += 1\r\n else:\r\n count_low += 1\r\n\r\nif count_up > count_low:\r\n for i in range(len(s)):\r\n ch = s[i].upper()\r\n print(ch, end='')\r\nelse:\r\n for i in range(len(s)):\r\n ch = s[i].lower()\r\n print(ch, end='')\r\n", "N = input()\nupper = sum(letter.isupper() for letter in N)\nlower = sum(letter.islower() for letter in N)\nif upper == lower:\n\tprint(N.lower())\nelif lower > upper:\n\tprint(N.lower())\nelse :\n\tprint(N.upper())\n", "s=input().strip()\r\nct=sum(1 for i in s if i.isupper())\r\nct1=len(s)-ct\r\nif ct>ct1:\r\n s1=s.upper()\r\nelse:\r\n s1=s.lower()\r\nprint(s1)\r\n", "w=input()\nu=0\nl=0\nfor i in w:\n if i.isupper():\n u+=1\n else:\n l+=1\nprint(w.lower() if(l>=u) else w.upper())", "import re\r\na = input()\r\nprint([a.lower(),a.upper()][len(re.findall(r'[A-Z]',a))>len(a)/2])", "s=input()\r\ns1=\"\"\r\nu=0\r\nl=0\r\nfor i in s:\r\n if(i.isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n for i in s:\r\n if(i.islower()):\r\n s1=s1+i.upper()\r\n else:\r\n s1=s1+i\r\nelse:\r\n for i in s:\r\n if(i.isupper()):\r\n s1=s1+i.lower()\r\n else:\r\n s1=s1+i\r\nprint(s1) ", "s=input()\r\nU=0\r\nL=0\r\nfor el in s:\r\n if el.isupper():\r\n U+=1\r\n if el.islower():\r\n L+=1\r\nif U>L:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nlower = sum([1 for c in s if c.islower()])\r\nupper = sum([1 for c in s if c.isupper()])\r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "word = str(input())\r\nacounter=0\r\nbcounter=0\r\nfor i in range(0,len(word)) :\r\n x = word[i].isupper()\r\n if x == True :\r\n acounter +=1\r\n else :\r\n bcounter+=1\r\nif acounter > bcounter :\r\n print(word.upper())\r\nelse :\r\n print(word.lower())", "#https://codeforces.com/problemset/problem/59/A\r\nword=input()\r\nlc=uc=0\r\nfor i in word:\r\n if (i >='a' and i<='z'):\r\n lc+=1\r\n if (i >='A' and i<='Z'):\r\n uc+=1\r\nif uc>lc:\r\n print(word.upper())\r\nif lc>=uc:\r\n print(word.lower())", "#!/bin/python3\r\n\r\ns = str(input())\r\nup, lo = 0, 0\r\n\r\nfor x in s:\r\n\tif x.isupper():\r\n\t\tup += 1\r\n\telse:\r\n\t\tlo += 1\r\n\r\nprint(s.lower() if lo >= up else s.upper())", "from sys import stdin\n\n\ndef main():\n s = stdin.readline().strip()\n return (str.lower, str.upper)[sum(map(str.islower, s)) < sum(map(str.isupper, s))](s)\n\n\nprint(main())\n", "a = 0\r\nb = 0\r\nn = input()\r\nnu = n.upper()\r\nfor i in range(len(n)):\r\n if n[i] > nu[i]:\r\n a += 1\r\n else:\r\n b += 1\r\n\r\n\r\nif a > b:\r\n print(n.lower())\r\nelif b > a:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "a=input()\r\nn=len(a)/2\r\nb=a.lower()\r\nlis1=list(a)\r\nlis2=list(b)\r\n\r\nlis3=[x for x in lis1 if x in lis2]\r\n\r\nif(len(lis3)>=n):\r\n print(b)\r\nelse:\r\n print(a.upper()) ", "Word = input()\r\nuppercount = 0\r\nlowercount = 0\r\nfor i in Word:\r\n if i.isupper():\r\n uppercount += 1\r\n else:\r\n lowercount += 1\r\nif uppercount > lowercount:\r\n print(Word.upper())\r\nelse:\r\n print(Word.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jun 14 18:02:46 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nx = sum(1 for c in s if c.isupper())\r\n\r\nif x > len(s)/2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "s = input()\r\n\r\nprint((s.lower(),s.upper())[sum([x.isupper() for x in s])>len(s)/2])", "word = input()\r\nno_of_upper = 0\r\nno_of_lower = 0\r\nfor w in word:\r\n if w.isupper():\r\n no_of_upper += 1\r\n else:\r\n no_of_lower += 1\r\n\r\nif no_of_upper > no_of_lower:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)\r\n", "x=input()\r\nupper = 0\r\nlower = 0\r\n \r\nfor a in x: \r\n if (a.isupper()) == True: \r\n upper+= 1\r\n elif (a.islower()) == True: \r\n lower+= 1\r\n elif (a.isspace()) == True: \r\n continue\r\nif upper>lower:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s=input()\r\nn=0\r\nm=0\r\nfor i in s:\r\n if i.islower():\r\n n+=1\r\n elif i.isupper():\r\n m+=1\r\nif n>=m:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n\r\n\r\n", "slovo = input()\r\nsmall = 0\r\nbig = 0\r\nfor i in slovo:\r\n if i.isupper():\r\n big += 1\r\n elif i.islower():\r\n small += 1\r\nif big > small:\r\n slovo = slovo.upper()\r\nelse:\r\n slovo = slovo.lower()\r\nprint(slovo)\r\n", "b = input()\r\na = list(b)\r\ncount = 0\r\nfor i in range(len(a)):\r\n if a[i]<='Z':\r\n count += 1\r\nif int(len(a)/2+1)>count:\r\n print(b.lower())\r\nelse:\r\n print(b.upper())", "w = input()\nc = 0\nfor i in w:\n if i.isupper():\n c += 1\n\nif c > len(w) - c:\n w = w.upper()\nelse:\n w = w.lower()\n\nprint(w)\n", "a=input()\r\nb=list(a)\r\ncount=0;count1=0\r\nfor i in b:\r\n if(i.upper()==i):\r\n count=count+1\r\n else:\r\n count1=count1+1\r\nif(count>count1):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "str = input()\r\nx=0\r\ny=0\r\nfor c in str:\r\n if c.isupper():\r\n x +=1\r\n else:\r\n y +=1\r\n\r\nif x > y:\r\n print (str.upper())\r\nelse:\r\n print (str.lower())\r\n", "s1 = input()\r\ncount = 0\r\ncount1 = 0\r\nfor i in s1:\r\n if i.islower():\r\n count += 1\r\n else:\r\n count1 += 1\r\nif count < count1:\r\n print(s1.upper())\r\nelse:\r\n print(s1.lower())\r\n", "s=input()\r\ncap=0\r\nsma=0\r\nfor i in s:\r\n s1= i.upper()\r\n if s1==i:\r\n cap+=1\r\n else:\r\n sma+=1\r\nif cap<=sma:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = str(input())\r\nb = len(a)\r\nk=0\r\nk1 = 0\r\nfor i in range(0,b):\r\n if a[i] == a[i].lower():\r\n k = k + 1\r\n else:\r\n k1 = k1 + 1\r\nif k < k1:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "\r\n\r\ndef main():\r\n\ts = input()\r\n\tn = len(s)\r\n\td = 0\r\n\tfor c in s:\r\n\t\tif c.islower():\r\n\t\t\td += 1\r\n\tif n-d > d:\r\n\t\tprint(s.upper())\r\n\t\texit()\r\n\tprint(s.lower())\r\n\texit()\r\n\r\nif __name__ == '__main__':\r\n main()", "a =input()\r\nup = 0\r\ndown = 0\r\nfor i in range (0,len(a)):\r\n if (a[i].upper() == a[i]):\r\n up+=1\r\n else:\r\n down+=1\r\nif (up>down):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "x=input()\r\nc=d=0\r\nl=len(x)\r\nfor i in range(l):\r\n if x[i].isupper():\r\n c=c+1\r\n elif x[i].islower():\r\n d=d+1\r\nif d>=c:\r\n x=x.lower()\r\n print(x)\r\nelif d<c:\r\n print(x.upper())", "i = input()\r\nl = 0\r\nu = 0\r\ny = str()\r\nfor n in i:\r\n if (n.islower()):\r\n l += 1\r\n elif (n.isupper()):\r\n u += 1\r\nif l >= u:\r\n y = i.lower()\r\nelif l < u:\r\n y = i.upper()\r\nprint(y)\r\n#sum(i.isupper() for i in s)\r\n#sum(i.islower() for i in s)", "a = input()\r\nuppercase_count = 0\r\nfor i in range(0,len(a)):\r\n if a[i].isupper() == True:\r\n uppercase_count += 1\r\n \r\nlowercase_count = len(a) - uppercase_count\r\n \r\n\r\n\r\nif uppercase_count > lowercase_count:\r\n print(a.upper())\r\n \r\n \r\nelse:\r\n print(a.lower())\r\n ", "s=input()\r\nlcnt=0;\r\nucnt=0;\r\nfor i in s:\r\n if(i.isupper()):\r\n ucnt=ucnt+1\r\n else:\r\n lcnt=lcnt+1\r\nif(ucnt>lcnt):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(word)):\r\n if ord(word[i]) < 91:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper > lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "a=input()\r\nu=0\r\nd=0\r\nfor i in range(len(a)):\r\n if(a[i].isupper()):\r\n u+=1\r\n else:\r\n d+=1\r\nif(u>d):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "# Har har mahadev\r\n# author : @harsh kanani\r\n\r\ns =input()\r\nlow = 0\r\nupp = 0\r\nfor i in s:\r\n if i.islower():\r\n low += 1\r\n else:\r\n upp += 1\r\n# print(low)\r\n# print(upp)\r\nif low >= upp:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Nov 13 19:13:19 2019\n\n@author: aiman77\n\"\"\"\n\ns = input()\n\nupper = 0\nlower = 0\n\nfor char in s:\n if ord('a') <= ord(char) <= ord('z'):\n lower += 1\n else:\n upper += 1\n\nif upper > lower:\n s = s.upper()\nelse:\n s = s.lower()\n \nprint(s)\n \n \n\n ", "def word():\r\n s = input()\r\n c_l = 0\r\n c_u = 0\r\n for i in range(len(s)):\r\n if ord(s[i]) >=65 and ord(s[i]) <= 90:\r\n c_u += 1\r\n if ord(s[i]) >=97 and ord(s[i]) <= 122:\r\n c_l += 1 \r\n if c_l >= c_u:\r\n print(s.lower())\r\n elif c_u >= c_l:\r\n print(s.upper()) \r\n else:\r\n print(s.lower())\r\nword()\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\nc=[\"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\nn=input() \r\nm=0\r\nk=0\r\nfor i in n: \r\n if i in s: \r\n m=m+1\r\n elif i in c: \r\n k=k+1 \r\nif k>m: \r\n print(n.upper()) \r\nelse: \r\n print(n.lower())", "def count_lw(st):\r\n num=0\r\n for i in st:\r\n if(i.islower() ):\r\n num+=1\r\n return num\r\ndef count_up(st):\r\n num=0\r\n for i in st:\r\n if(i.isupper() ):\r\n num+=1\r\n return num\r\n\r\nstr=input()\r\nup=count_up(str)\r\n\r\n\r\nlo=count_lw(str)\r\n\r\nif(up > lo):\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "s=input()\ncount_lo=0\ncount_up=0\nalpha=\"abcdefghijklmnopqrstuvwxyz\"\nfor i in s:\n if i in alpha:\n count_lo+=1\n else:\n count_up+=1\nif(count_lo==count_up or count_lo>count_up):\n print(s.lower())\nelse:\n print(s.upper())\n \t \t\t\t \t\t\t\t \t \t \t\t \t \t", "s=input()\r\ncount=0\r\nno=0\r\n\r\nfor i in s:\r\n\tif i.isupper():\r\n\t\tcount=count+1\r\n\telse:\r\n\t\tno=no+1\r\nif count>no:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "\ns = input()\n\nlower_count = sum([1 if l == l.lower() else 0 for l in s])\nnew_s = ''\nif lower_count < len(s)/2:\n for l in s:\n new_s += l.upper()\nelse:\n for l in s:\n new_s += l.lower()\nprint(new_s)\n", "x = str(input())\r\nk = 0\r\nfor i in range(len(x)):\r\n if x[i].islower():\r\n k+=1\r\n else:\r\n k-=1\r\nif k == 0:\r\n x=x.lower()\r\nelif k > 0:\r\n x=x.lower()\r\nelse:\r\n x = x.upper()\r\nprint(x)\r\n\r\n", "x=list(input())\r\nupper=0\r\nlower=0\r\nfor j in x:\r\n if j.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nm=\"\".join(x)\r\nif upper>lower:\r\n print(m.upper())\r\nelse:\r\n print(m.lower())", "z=input()\r\nu=0\r\nfor i in z:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n u-=1\r\nif u>0:\r\n print(z.upper())\r\nelse:\r\n print(z.lower())", "user_input = input()\r\nuppercase, lowercase = sum(1 for x in user_input if x.isupper()), sum(1 for x in user_input if x.islower())\r\nif uppercase == lowercase or uppercase < lowercase: print(user_input.lower())\r\nelse: print(user_input.upper())\r\n", "word = input()\r\ncountCap = 0\r\ncountSm = 0\r\n\r\nfor i in word:\r\n if ord(i) < 97:\r\n countCap += 1\r\n else:\r\n countSm+=1\r\nres = \"\"\r\nif countCap <= countSm:\r\n for i in range(len(word)):\r\n tempOrd = ord(word[i])\r\n if tempOrd < 97:\r\n res+= chr(97+tempOrd-65)\r\n else:\r\n res+= word[i]\r\n \r\nelse:\r\n for i in range(len(word)):\r\n tempOrd = ord(word[i])\r\n if tempOrd >= 97:\r\n res += chr(tempOrd-97+65)\r\n else:\r\n res+=word[i]\r\nprint(res)", "s = input()\r\nrest = len(s)//2+1\r\nlow_count, up_count = 0, 0\r\nfor c in s:\r\n if c.islower():\r\n low_count += 1\r\n else:\r\n up_count += 1\r\n if rest <= low_count:\r\n break\r\nprint(s.lower() if up_count <= low_count else s.upper())", "word = input()\r\nlowercase, uppercase = 0, 0;\r\nfor letter in word:\r\n if(letter.islower()): lowercase += 1;\r\n else: uppercase += 1;\r\nnew_word = \"\"\r\nif(lowercase < uppercase):\r\n for letter in word: new_word += letter.upper()\r\nelse:\r\n for letter in word: new_word += letter.lower()\r\nprint(new_word)", "s=input()\r\nlow=0\r\nupp=0\r\nfor i in s:\r\n if i.islower():\r\n low+=1\r\n else:\r\n upp+=1\r\nif low>=upp:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "w = list(input())\r\ns,c=0,0\r\nfor i in range(len(w)):\r\n if w[i]>='a' and w[i]<='z': s += 1\r\n else : c +=1\r\nstr = ''.join(w)\r\nif(c>s):print(str.upper())\r\nelse:print(str.lower())", "word = input(\"\")\nlower = 0\nupper = 0\n\nfor i in word:\n if i.isupper():\n upper += 1\n else:\n lower += 1\n \n\nif upper > lower:\n upper_word = word.upper()\n print(upper_word)\nelif lower > upper:\n lower_word1 = word.lower()\n print(lower_word1)\nelse:\n lower_word = word.lower()\n print(lower_word)\n\n \t\t \t\t \t \t \t \t\t \t", "word = input()\r\nnupper = 0\r\nnlower = 0\r\nfor letter in word:\r\n if letter.isupper():\r\n nupper = nupper + 1\r\n elif letter.islower():\r\n nlower = nlower + 1\r\nif nlower >= nupper:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)\r\n", "word=input()\r\nw1 =word.lower()\r\nw2 = word.upper()\r\n# s1=0\r\ns2=0\r\nfor i in range(len(word)) :\r\n # if word[i] != w1[i] :\r\n # s1+= 1\r\n if word[i] != w2[i] :\r\n s2+= 1\r\nif len(word)/2 > s2:\r\n print(w2)\r\nelse:\r\n print(w1)\r\n ", "n=['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\nm=input()\r\na=0\r\nfor i in range(len(n)):\r\n a+=m.count(n[i])\r\nif a>=len(m)/2:\r\n print(m.lower())\r\nelse:\r\n print(m.upper())\r\n", "w=input()\r\nl=0\r\nu=0\r\nfor i in w:\r\n if i.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif u>l:\r\n w=w.upper()\r\nelse:\r\n w=w.lower()\r\nprint(w)\r\n", "s=input()\ns1=s.upper()\nc=0\nfor i in range(len(s)):\n\tif s[i]==s1[i]:\n\t\tc+=1\nif c>len(s)//2:\n\tprint(s1)\nelse:\n\tprint(s.lower())\n \t\t \t \t \t\t\t \t \t\t\t\t\t \t", "s=input()\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if(s[i]>='a' and s[i]<='z'):\r\n l=l+1\r\n else:\r\n u=u+1\r\nif(u>l):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "palavra = input()\n\nuppers = 0\nlowers = 0\n\nfor letra in palavra:\n\tlowers += 1 if letra.islower() else 0\n\tuppers += 1 if letra.isupper() else 0\n\nif uppers > lowers:\n\tprint(palavra.upper())\nelse:\n\tprint(palavra.lower())\n# 1506168228685\n", "n=input()\r\nx=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nY=\"abcdefghijklmnopqrstuvwxyz\"\r\nco=0\r\nc=0\r\nfor i in n:\r\n if i in x:\r\n c+=1\r\n if i in Y:\r\n co+=1\r\nif c>co:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s=str(input())\r\na=b=0\r\nfor i in s:\r\n if ord(i)<96:\r\n a=a+1\r\n else:\r\n b=b+1\r\nif a>b:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n ", "s = input()\r\ncnt = 0\r\nfor x in s:\r\n if x.isupper():\r\n cnt += 1\r\n\r\nif cnt > len(s) // 2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)", "a=str(input())\r\nn=0\r\nb=[]\r\nd=\"\"\r\nfor i in a:\r\n if 65<=ord(i)<=90:\r\n n=n+1\r\nif n>len(a)/2:\r\n for i in a:\r\n if 97<=ord(i)<=122:\r\n c=chr(ord(i)-32)\r\n else:\r\n c=i\r\n b.append(c)\r\nelse:\r\n for i in a:\r\n if 65<=ord(i)<=90:\r\n c=chr(ord(i)+32)\r\n else:\r\n c=i\r\n b.append(c)\r\nfor i in range(len(b)):\r\n d=d+str(b[i])\r\n\r\nprint(d)\r\n \r\n \r\n", "i = input()\r\nc = sum(1 for item in i if item.isupper() == True);s = sum(1 for item in i if item.islower() == True)\r\nprint(i.lower() if c == s or min(c,s) == c else i.upper())", "s = input()\n\nupper_count = 0\nlower_count = 0\n\n# Contar el número de letras mayúsculas y minúsculas en la palabra\nfor c in s:\n if c.isupper():\n upper_count += 1\n else:\n lower_count += 1\n\n# Convertir la palabra a minúsculas si tiene más letras minúsculas\nif lower_count >= upper_count:\n print(s.lower())\n# Convertir la palabra a mayúsculas si tiene más letras mayúsculas\nelse:\n print(s.upper())\n \t\t\t \t \t\t \t \t \t \t\t\t\t \t", "def solve(s):\r\n c=l=0\r\n \r\n for ch in s:\r\n if ch.islower():\r\n l+=1\r\n else:\r\n c+=1\r\n \r\n \r\n if l>=c:\r\n s=s.lower()\r\n else:\r\n s=s.upper()\r\n print(s)\r\n\r\n\r\ns = input()\r\nsolve(s)", "m=0\r\nn=0\r\na=input()\r\na1=a.lower()\r\nl=len(a)\r\nfor i in range(l):\r\n if a[i]==a1[i]:\r\n m+=1\r\n else:\r\n n+=1\r\nif m>=n:print(a1)\r\nelse: print(a.upper())", "string=input()\r\nlower=0\r\nupper=0\r\nfor i in range(0,len(string)):\r\n if string[i].islower():\r\n lower+=1\r\n elif string[i].isupper():\r\n upper+=1\r\n else:\r\n continue\r\nif lower>upper:\r\n NewStr=string.lower()\r\nelif upper>lower:\r\n NewStr=string.upper()\r\nelif upper==lower:\r\n NewStr = string.lower()\r\nprint(NewStr)", "a=input()\r\ncount=0\r\nc=0\r\nfor i in a:\r\n if i.islower():\r\n count+=1\r\n elif i.isupper():\r\n c+=1\r\nif count>c or count==c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "n='@'.join(input()).split('@')\r\nprint(''.join(list(map(lambda x:chr(ord(x)+32) if len([n[i] for i in range(len(n)) if n[i].isupper()])<=len(n)/2 and x.isupper() else chr(ord(x)-32) if len([n[i] for i in range(len(n)) if n[i].isupper()])>len(n)/2 and x.islower() else x,n))))", "string=input()\r\ncount=0\r\nfor i in range(len(string)):\r\n if 'A'<=string[i]<='Z':\r\n count+=1\r\ncount2=len(string)-count\r\nif count>count2:\r\n print(string.upper())\r\nelse:print(string.lower())\r\n", "word = list(input())\r\n\r\nupper = 0\r\nlowercase = 0\r\n\r\nfor t in word:\r\n if t.islower():\r\n lowercase += 1\r\n else:\r\n upper += 1\r\n\r\nif lowercase >= upper:\r\n x = \"\".join(word)\r\n print (x.lower())\r\nelse:\r\n y = \"\".join(word)\r\n print (y.upper())\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 29 22:39:01 2021\r\n\r\n@author: Corey.Smith\r\n\"\"\"\r\n\r\n\r\ns = input()\r\ni=0\r\n\r\nfor l in s: \r\n i = [i,i+1][l.upper()==l]\r\n \r\nprint([s.lower(),s.upper()][i>len(s)/2])", "s=input()\r\nc,st=0,0\r\na=['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\nb=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\r\nfor i in s:\r\n if i in a:\r\n c+=1\r\n elif i in b:\r\n st+=1\r\nif c>st:\r\n k=s.upper()\r\n print(k)\r\nelif c<st:\r\n g=s.lower()\r\n print(g)\r\nelse:\r\n g=s.lower()\r\n print(g)", "n=input()\r\nu=0\r\nl=0\r\nans=\"\"\r\nfor i in n:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n for i in n:\r\n ans += i.upper()\r\nelse:\r\n for i in n:\r\n ans += i.lower()\r\nprint(ans)\r\n \r\n", "str1 = input()\r\nlst = list(str1)\r\nsz = len(str1)\r\nup = 0\r\nlo = 0\r\nfor i in range(sz):\r\n if ord(lst[i]) >= 97:\r\n lo += 1\r\n else:\r\n up += 1\r\nif up > lo:\r\n print(str1.upper())\r\nelse:\r\n print(str1.lower())\r\n", "word = input()\r\nsplit = [*word]\r\nchecker = 0\r\n\r\n\r\nfor x in split:\r\n if x.islower() is True:\r\n checker += 1\r\n \r\nif checker >= 0.5*len(word):\r\n print(word.casefold())\r\nelse:\r\n print(word.upper())", "import sys\r\ns1=(sys.stdin.readline().split()[0])\r\nb=False\r\nk=0\r\nkk=0\r\na=len(s1) \r\nwhile b!=True:\r\n a-=1\r\n cc=s1[a]\r\n if cc >= 'A' and cc <= 'Z':\r\n k+=1\r\n elif cc >= 'a' and cc <= 'z':\r\n kk+=1\r\n if a==0:\r\n b=True\r\n \r\nif kk>=k:\r\n print(s1.lower())\r\nelse:\r\n print(s1.upper())", "sq=input()\r\nlq=0\r\nuq=0\r\nfor i in sq:\r\n\tif(i.islower()):\r\n\t\tlq+=1\r\n\telif(i.isupper()):\r\n\t\tuq+=1\r\nif(lq>=uq):\r\n\tsq=sq.lower()\r\nelse:\r\n\tsq=sq.upper()\r\nprint(sq)", "w = input()\r\nlc = 0\r\nuc = 0\r\nfor i in w:\r\n\tif ord(i) >= 97:\r\n\t\tlc += 1\r\n\telse:\r\n\t\tuc += 1\r\nif lc == uc:\r\n\tr = w.lower()\r\nelif lc < uc:\r\n\tr = w.upper()\r\nelif lc > uc:\r\n\tr = w.lower()\r\n\r\nprint(r)\t", "h=input()\r\nuc=0\r\nlc=0\r\nfor i in range(len(h)):\r\n if(h[i].islower()==True):\r\n lc+=1\r\n else:\r\n uc+=1\r\nif(lc>=uc):\r\n j=\"\"\r\n for i in range(len(h)):\r\n if(h[i].islower()==True):\r\n j+=h[i]\r\n else:\r\n j+=h[i].lower()\r\nelse:\r\n j=\"\"\r\n for i in range(len(h)):\r\n if(h[i].islower()==True):\r\n j+=h[i].upper();\r\n else:\r\n j+=h[i]\r\nprint(j)\r\n ", "s = input()\n\nupper_case_letters = 0\nlower_case_letters = 0\n\nfor character in s:\n if character.isupper():\n upper_case_letters +=1\n else:\n lower_case_letters += 1\n\nif upper_case_letters <= lower_case_letters:\n print(s.lower())\nelse:\n print(s.upper())\n \t \t\t \t \t \t\t\t\t \t \t \t \t\t", "from sys import stdin\r\n\r\nmot = stdin.readline().strip()\r\n\r\n# recherche nbre de minuscules\r\nlmot = len(mot)\r\nnbmin = 0\r\nfor carac in mot:\r\n if 97 <= ord(carac) <= 122:\r\n nbmin+= 1\r\nnbmaj = lmot - nbmin\r\n \r\n# transfo en minuscules\r\nif nbmin < nbmaj:\r\n soluce = mot.upper()\r\nelse:\r\n soluce = mot.lower()\r\n\r\nprint(soluce)", "def fix_case(word):\r\n upper_count = sum(1 for char in word if char.isupper())\r\n lower_count = len(word) - upper_count\r\n \r\n if upper_count > lower_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\nword = input()\r\nresult = fix_case(word)\r\nprint(result)", "n = input()\r\nA= [\"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\nB = ['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\nuppercount = 0\r\nlowercount = 0\r\nfor i in range (len(n)):\r\n if n[i] in A:\r\n uppercount += 1\r\n else:\r\n lowercount +=1\r\n\r\nif lowercount>=uppercount:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "s=input()\r\nc=len(s)\r\nm=0\r\nn=0\r\nfor i in range(c):\r\n if(s[i]>='a' and s[i]<='z'):\r\n m=m+1\r\n elif(s[i]>='A' and s[i]<='Z'):\r\n n=n+1\r\nif(m==n):\r\n print(s.lower())\r\nelif(m>n):\r\n print(s.lower())\r\nelif(m<n):\r\n print(s.upper())", "s = input()\r\nlc = 0\r\nuc = 0\r\nl = (len(s))/2\r\nfor i in s:\r\n if(i.islower()):\r\n lc += 1\r\n else:\r\n uc += 1\r\nif(lc>=l):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "text = input(\"\")\r\nupper = lower = 0\r\nfor number in text:\r\n if number.isupper(): upper+=1\r\n else: lower+=1\r\nif upper > lower: print(text.upper())\r\nelse: print(text.lower())", "string = input()\r\nup = 0\r\nlow = 0\r\n\r\nfor i in string:\r\n if i.isupper():\r\n up+=1\r\n elif i.islower():\r\n low += 1\r\n\r\nif up > low:\r\n print(string.upper())\r\nelif low>=up:\r\n print(string.lower())\r\n\r\n", "w = input()\n\nl_num = len([i for i in w if 97 <= ord(i) <= 122])\n\nif (len(w) - l_num) > l_num:\n print(w.upper())\nelse:\n print(w.lower())\n", "# n = int(input())\r\n# lst = list(map(int, input().split()))\r\n# lst.sort()\r\n# print(*lst)\r\ns = input()\r\nl,u = 0,0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif(l>=u):\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)\r\n", "x=list(input())\r\ncl=0\r\ncu=0\r\nfor i in range(len(x)):\r\n y=x[i]\r\n if y.isupper():\r\n cu+=1\r\n else:\r\n cl+=1\r\nans=''.join(x)\r\nif cu>cl:\r\n print(ans.upper())\r\nelif cu<cl:\r\n print(ans.lower())\r\nelse:\r\n print(ans.lower())", "s=input().strip()\r\nlc=0\r\nfor x in s:\r\n if x.islower():\r\n lc+=1\r\nif (lc*2)>=len(s):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nn=len(s)\r\ncap=low=0\r\nfor i in s:\r\n if(65<=ord(i)<=90):\r\n cap+=1\r\n else:\r\n low+=1\r\nif(cap>low):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "s = input()\r\nsm = 0\r\nbg = 0\r\nfor i in range(len(s)):\r\n if ord(s[i]) < 97:\r\n bg = bg + 1\r\n if ord(s[i]) > 96:\r\n sm = sm + 1\r\nif bg <= sm:\r\n print(s.lower())\r\nif bg > sm:\r\n print(s.upper())\r\n", "s = input()\r\nupcnt,lowcnt=0,0\r\nfor x in s:\r\n if x.isupper():\r\n upcnt+=1\r\n else:\r\n lowcnt+=1\r\n\r\nif upcnt > lowcnt:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncountlower=0\r\nfor c in s:\r\n if c in \"qwertyuiopasdfghjklzxcvbnm\":\r\n countlower+=1\r\nif countlower>=len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = str(input())\r\nupper = word.upper()\r\nup,low=0,0\r\nfor i in range(len(word)):\r\n if(upper[i] == word[i]):\r\n up+=1\r\n else:\r\n low+=1\r\nif(up>low):\r\n print(upper)\r\nif(low>=up):\r\n print(word.lower())\r\n", "sm, big = 0, 0\ns = input()\nfor i in s:\n if i.isupper():\n big += 1\n else:\n sm += 1\nprint(s.lower() if sm >= big else s.upper())\n", "s = input()\r\n\r\nr = sum(y.isupper() for y in s)\r\n\r\nif r > len(s) - r:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = list(input())\r\nupper = 0\r\nlower = 0\r\n\r\nfor char in s:\r\n if char.isupper() == True:\r\n upper = upper +1\r\n if char.islower() == True:\r\n lower = lower +1\r\n \r\ns = \"\".join(s)\r\nif upper > lower:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s) ", "x=input()\r\ns=0\r\nl=0\r\nfor i in x:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n s=s+1\r\n if(ord(i)>=65 and ord(i)<=90):\r\n l=l+1\r\nif(s>=l):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n ", "string=str(input())\nupper = 0\nlower = 0\n\nfor i in range(len(string)):\n\n # For lower letters\n if (ord(string[i]) >= 97 and\n ord(string[i]) <= 122):\n lower += 1\n\n # For upper letters\n elif (ord(string[i]) >= 65 and\n ord(string[i]) <= 90):\n upper += 1\nif(upper>lower):\n string=string.upper()\n print(string)\nelif(lower>=upper):\n string=string.lower()\n print(string)\n\t\t\t \t\t\t \t \t \t \t \t\t \t\t\t\t\t", "s=str(input())\r\nq=0\r\nw=0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].upper():\r\n q=q+1\r\n elif s[i]==s[i].lower():\r\n w=w+1\r\nif q>w:\r\n print(s.upper())\r\nelif q<w:\r\n print(s.lower())\r\nelif q==w:\r\n print(s.lower())", "word = str(input())\r\nword_vec = list(word)\r\nupper_count = 0\r\nlower_count = 0\r\n\r\nfor i in range(len(word_vec)):\r\n if word_vec[i].isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\nif(upper_count > lower_count):\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n \r\nprint(word)", "word = input()\r\nupper = [w for w in word if w.isupper()]\r\nlower = [w for w in word if w.islower()]\r\nif len(upper) > len(lower):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "# Word 59A\r\n\r\nMIN_LEN = 1\r\nMAX_LEN = 100\r\n\r\ntxt = input()\r\n\r\ntxt_len = len(txt)\r\nlower_chars = 0\r\nupper_chars = 0\r\n\r\nif(txt_len >= MIN_LEN and txt_len <= MAX_LEN):\r\n for char in txt:\r\n char_ascii_code = ord(char)\r\n if(char_ascii_code >= 65 and char_ascii_code <= 90):\r\n upper_chars += 1\r\n if(char_ascii_code >= 97 and char_ascii_code <= 122):\r\n lower_chars += 1\r\nif(upper_chars > lower_chars):\r\n txt = txt.upper()\r\nelse:\r\n txt = txt.lower()\r\n\r\nprint(txt)\r\n", "s = str(input())\ncount_upper = 0\ncount_lower = 0\n\nfor i in range(len(s)):\n if s[i].isupper():\n count_upper += 1\n else:\n count_lower += 1\n\nif count_upper <= count_lower:\n print(s.lower())\nelse:\n print(s.upper())\n", "def Word(x):\r\n ccount = 0\r\n lcount = 0\r\n for i in x:\r\n if i.isupper():\r\n ccount += 1 \r\n else:\r\n lcount += 1 \r\n if ccount > lcount:\r\n return x.upper()\r\n return x.lower()\r\n \r\n \r\nx = input()\r\nprint(Word(x))", "a = input()\r\ns = list(a)\r\nn = 0\r\nk = 0\r\nfor i in s:\r\n if 65 <= ord(i) <= 90:\r\n n += 1\r\n else:\r\n k += 1\r\nif n > k:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s,c=input(),0\r\nupper,lower=0,0\r\nZ,A=ord('Z'),ord('A')\r\nfor i in s:\r\n if A<=ord(i)<=Z :\r\n upper+=1\r\n else:\r\n lower+=1\r\nprint(s.lower())if lower>=upper else print(s.upper())\r\n", "s = input()\r\nprint([s.lower(), s.upper()][sum(map(str.isupper, s)) > len(s)/2])\r\n", "word = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in range(0, len(word)):\r\n if word[i].upper() == word[i]:\r\n upper = upper + 1\r\n else:\r\n lower = lower + 1\r\n\r\nif upper > lower:\r\n word = word.upper()\r\n print(word)\r\nelse:\r\n word = word.lower()\r\n print(word)", "upcount = 0\nlowcount = 0\ns = input()\n\n\n\nfor i in s:\n\tif(i.isupper()):\n\t\tupcount +=1\n\n\telse:\n\t\tlowcount +=1\n\n\nif(upcount > lowcount):\n\ts = s.upper()\n\nelse:\n\ts = s.lower()\n\nprint(s)", "from sys import stdin, stdout\r\n\r\ns = stdin.readline()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in range(len(s)-1):\r\n if s[i].isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper > lower:\r\n stdout.write(s.upper())\r\nelse:\r\n stdout.write(s.lower())", "s = str(input())\r\nc_u = 0\r\n\r\nfor i in s:\r\n if i.isupper(): \r\n c_u += 1\r\n\r\nif c_u > len(s) / 2: \r\n print(s.upper()) \r\nelse:\r\n print(s.lower()) \r\n", "k=input(\"\")\r\nl=0\r\nu=0\r\nfor i in range(len(k)):\r\n if(k[i]==k[i].lower()):\r\n l=l+1\r\n else:\r\n u=u+1\r\nif u>l:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "n=input()\r\nl1=l2=0\r\nfor i in n:\r\n if i>='a' and i<='z':\r\n l2+=1\r\n else:\r\n l1+=1\r\nif l2>=l1:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n\r\n", "t = input()\r\nu = 0\r\nl = 0\r\nfor i in t:\r\n u += 1 if i.upper() == i else 0\r\n l += 0 if i.upper() == i else 1\r\nprint(t.upper() if u > l else t.lower())", "from tkinter import N\r\n\r\n\r\nn=str(input())\r\nc1=0\r\nc2=0\r\nfor i in n:\r\n if (i.islower()):\r\n c1 = c1 + 1\r\n elif (i.isupper()):\r\n c2= c2 + 1\r\n\r\nif c1>=c2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n\r\n", "def correct_word(word):\r\n uppercase_count = sum(1 for c in word if c.isupper())\r\n lowercase_count = len(word) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\n\r\nword = input() \r\ncorrected_word = correct_word(word)\r\nprint(corrected_word)\r\n", "t=input()\r\nn=len(t)\r\ns,s1=0,0\r\nfor i in range(n):\r\n s+=ord(t[i])\r\n s1+=ord(t[i].lower())\r\nnUp=(s1-s)//32\r\nnLow=n-nUp\r\nif (nLow>nUp) or (nLow==nUp):\r\n print(t.lower())\r\nelse:\r\n print(t.upper())", "s = input()\r\nuc = 0\r\nlc = 0\r\nfor i in range(len(s)):\r\n if ord(s[i]) >= 97 and ord(s[i]) <= 122:\r\n lc += 1\r\n else:\r\n uc += 1\r\n \r\nif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "word = input()\r\nlowercase = 0\r\nuppercase = 0\r\nfor x in word:\r\n if x.lower() == x:\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\nif uppercase > lowercase:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "upper = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\nlower = \"qwertyuiopasdfghjklzxcvbnm\"\nu, l = 0, 0\norig_string = \"\"\n\nfor i in input():\n if i in upper: u += 1\n if i in lower: l += 1\n\n orig_string += i\n\nif u > l: print(orig_string.upper())\nelse: print(orig_string.lower())", "s = input()\nupp = 0\nlow = 0\n\nfor i in s:\n if i.isupper() == True:\n upp += 1\n else:\n low +=1\n\n\nif upp > low:\n print(s.upper())\nelse:\n print(s.lower())\n\n\t \t \t\t \t \t \t \t\t\t\t", "s = input()\r\ncnt_lower = 0\r\ncnt_upper = 0\r\nfor i in s:\r\n if i.isupper() : cnt_upper+=1\r\n elif i.islower() : cnt_lower+=1\r\n\r\nif cnt_upper > cnt_lower : s=s.upper()\r\nelse: s=s.lower()\r\nprint(s)", "word = input()\r\nnumUpper = sum(x.isupper() for x in word)\r\nnumLow = len(word) - numUpper\r\nif numLow < numUpper:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)\r\n", "s=input()\r\nx=sum(1 for i in s if i.islower())\r\nif x>=len(s)-x:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\na=[]\r\nb=[]\r\nfor i in s:\r\n if i>='a'and i<='z':\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)>=len(b):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def solve(stringy):\n upper_letter = ''\n lower_letter = ''\n for i in range(len(stringy)):\n if stringy[i].isupper():\n upper_letter += stringy[i]\n if stringy[i].islower():\n lower_letter += stringy[i]\n\n if len(lower_letter)>=len(upper_letter):\n print(stringy.lower())\n else:\n print(stringy.upper())\n\nsolve(input())", "AL='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ns=input()\r\nup=0\r\nlow=0\r\nfor i in s:\r\n if i in AL: up+=1\r\n else: low+=1\r\nif up>low: print(s.upper())\r\nelse: print(s.lower())\r\n", "# import sys\r\n# sys.stdout = open('C:/Study/codes/output.txt', 'w')\r\n# sys.stdin = open('C:/Study/codes/input.txt', 'r')\r\n\r\nstring = input()\r\ncounth = 0\r\ncountl = 0\r\n\r\nlst = [i for i in string]\r\nfor i in lst:\r\n\tif i == i.upper():\r\n\t\tcounth+=1\r\n\telif i == i.lower():\r\n\t\tcountl+=1\r\n\r\nif counth > countl:\r\n\tprint(string.upper())\r\nelif counth < countl:\r\n\tprint(string.lower())\r\nelif counth == countl:\r\n\tprint(string.lower())\r\n", "x = input()\r\nuc = 0\r\nlc = 0\r\nfor i in x:\r\n if i.islower():\r\n lc = lc + 1\r\n else:\r\n uc = uc + 1\r\nif (lc > len(x)/2) or (lc == len(x)/2):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s=input()\r\nl=s.lower()\r\nu=s.upper()\r\nlow=0\r\nup=0\r\nfor i in range(0,len(s)):\r\n if s[i].islower():\r\n low+=1\r\n else:\r\n up+=1\r\nif low>=up:\r\n print(l)\r\nelse:\r\n print(u)\r\n \r\n ", "s = input()\r\nupp = 0\r\nlow = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n upp += 1\r\n else:\r\n low += 1\r\nif upp > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = str(input())\r\ns = list(s)\r\nlc = 0\r\nuc = 0\r\nn = \"\"\r\n\r\nfor j in s:\r\n if ord(j) >= 65 and ord(j) <= 90:\r\n uc += 1\r\n elif ord(j) >= 97 and ord(j) <= 122:\r\n lc += 1\r\n\r\nif lc >= uc:\r\n for k in range(0,len(s)):\r\n if ord(s[k]) >= 65 and ord(s[k]) <= 90:\r\n s[k] = chr(ord(s[k]) + 32)\r\n else:\r\n continue\r\nelse:\r\n for u in range(0,len(s)):\r\n if ord(s[u]) >= 97 and ord(s[u]) <= 122:\r\n s[u] = chr(ord(s[u]) - 32)\r\n else:\r\n continue\r\n\r\nfor p in s:\r\n n += p\r\n\r\nprint(n)\r\n", "word = input()\r\nlength = len(word)\r\ncount_caps = 0\r\ncount_lows = 0\r\n\r\nfor i in range(0, length):\r\n if word[i].isupper():\r\n count_caps = count_caps + 1\r\n if word[i].islower():\r\n count_lows = count_lows + 1\r\nif count_lows >= count_caps:\r\n print(word.lower())\r\nif count_lows < count_caps:\r\n print(word.upper())", "a=str(input())\r\nuppr=0\r\nlowr=0\r\nfor i in range(len(a)):\r\n if a[i].isupper()==True:\r\n uppr+=1\r\n else:\r\n lowr+=1\r\nif uppr>lowr:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "def main():\n inputStr = input()\n no = 0\n for it in range(len(inputStr)):\n if inputStr[it].islower():\n no = no + 1\n if no >= (len(inputStr) - no):\n print(inputStr.lower())\n else:\n print(inputStr.upper())\n\n\nif __name__ == \"__main__\":\n main()\n", "s=input()\r\nl=len(s)\r\ncount=0\r\ncount1=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n count=count+1\r\n if s[i].islower():\r\n count1=count1+1\r\nif count1>=count:\r\n s1=s.lower()\r\n print(s1)\r\nelse:\r\n s1=s.upper()\r\n print(s1)", "a=input();c=[];s=[];\r\nfor i in a:\r\n if i>='A' and i<='Z':\r\n c.append(i)\r\n else:\r\n s.append(i)\r\nd=len(c);e=len(s)\r\nif e>=d:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "x=input(\"\")\r\nn=0\r\nz=0\r\nfor c in range(len(x)):\r\n if x[c]==x[c].upper():\r\n n+=1\r\n if x[c]==x[c].lower():\r\n z+=1\r\n\r\nif n>z:\r\n x=x.upper()\r\n print(x)\r\nif n<=z:\r\n x=x.lower()\r\n print(x)\r\n\r\n\r\n", "testCase = input(\"\")\r\nupperCase = 0\r\nlowerCase = 0\r\n\r\nfor i in range(len(testCase)):\r\n if testCase[i] == testCase[i].upper():\r\n upperCase += 1\r\n else:\r\n lowerCase += 1\r\n\r\n\r\nif upperCase > lowerCase:\r\n print(testCase.upper())\r\nelse:\r\n print(testCase.lower())", "inp = list(input())\r\nup = 0\r\nlow = 0\r\nfor i in range(len(inp)):\r\n if inp[i].isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\ninp = ''.join(inp)\r\n\r\nif up > low:\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())", "word = input()\r\ncond_upper = sum(map(str.isupper, word)) > len(word) / 2 # Use map function!\r\nif cond_upper:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input();x=0; y=0\r\nfor i in range(0, len(s)):\r\n if(s[i] == s[i].upper()):\r\n x += 1\r\n else:\r\n y += 1;\r\nprint(s.lower() if y >= x else s.upper())", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=input(\"\")\nu,l=0,0\nfor i in range(len(n)):\n if n[i].isupper():\n u+=1\n else:\n l+=1\nif l>=u:\n print(n.lower())\nelse:\n print(n.upper())", "s=str(input())\r\nu=0\r\nl=0\r\nfor x in s:\r\n if(x==x.upper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\na=0\r\nb=0\r\no=0\r\ny=s.lower()\r\nfor x in s:\r\n if x==y[o]:\r\n o+=1\r\n a+=1\r\n else:\r\n o+=1\r\n b+=1\r\nif a>=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\nup = sum(1 for i in n if i.isupper())\r\ndown = len(n) - up\r\nprint(n.upper() if up > down else n.lower())", "s = input()\r\nla = list(s.strip())\r\n\r\niU = 0\r\niL = 0\r\nfor i in range(len(la)):\r\n\r\n if(ord(la[i]) >= 65 and ord(la[i]) <= 90):\r\n iU = iU + 1\r\n else:\r\n iL = iL + 1\r\nif iU >iL:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "x = input()\r\nn = 0\r\nupper = 0\r\nlower = 0\r\nwhile(n < len(x)):\r\n if x[n].isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n n += 1\r\nif upper > lower:\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\nprint(x)", "s=input()\r\nf=0\r\nfor i in s:\r\n if ord(i)>96:\r\n f+=1\r\n else:\r\n f-=1\r\nr=''\r\nif f<0:\r\n for i in range(len(s)):\r\n c=s[i]\r\n if ord(c)>96:\r\n c=chr(ord(c)-32)\r\n r+=c\r\nelse:\r\n for i in range(len(s)):\r\n c=s[i]\r\n if ord(c)<96:\r\n c=chr(ord(c)+32)\r\n r+=c\r\nprint(r)", "word = input()\r\ncl, cu = 0,0\r\nfor i in word:\r\n if( i.islower() ):\r\n cl += 1\r\n else:\r\n cu += 1\r\nif( cl==cu or cl>cu ):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "x=input()\r\na=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nb=\"abcdefghijklmnopqrstuvwxyz\"\r\ncount=0\r\ncount2=0\r\n\r\nfor i in x:\r\n if i in a:\r\n count+=1\r\n else:\r\n count2+=1\r\n \r\nif count2>=count:\r\n v=x.lower()\r\nelif count>count2:\r\n v= x.upper()\r\nprint(v)", "word = input()\r\nup_counter, low_counter = 0, 0\r\n\r\nfor char in word:\r\n if char.isupper():\r\n up_counter += 1\r\n else:\r\n low_counter += 1\r\n\r\nif up_counter > low_counter:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nnum_of_small = 0\r\nnum_of_capital = 0\r\nfor i in range(len(s)):\r\n if 97 <= ord(s[i]) <= 123:\r\n num_of_small += 1\r\n else:\r\n num_of_capital += 1\r\nif num_of_capital <= num_of_small:\r\n s1=s.lower()\r\nelse:\r\n s1=s.upper()\r\nprint(s1)", "st = input()\r\nlo = 0\r\nup = 0\r\nfor i in st:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n lo += 1\r\nif lo >= up:\r\n print(st.lower())\r\nelse:\r\n print(st.upper())", "x = str(input())\r\nu=0\r\nl =0\r\nfor i in x:\r\n if i.islower():\r\n l += 1\r\n else:\r\n u +=1\r\nif u > l:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "a=input(); print( [a.lower(),a.upper()][sum( i<'['for i in a)*2>len(a)] )", "word=input()\r\nlower_count=0\r\nupper_count=0\r\nfor i in word:\r\n if i.islower():\r\n lower_count+=1\r\n elif i.isupper():\r\n upper_count+=1\r\nif upper_count>lower_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\ncup=0\nclo=0\nfor i in range(len(s)):\n\tif s[i]>='a' and s[i]<='z':\n\t\tclo+=1\n\telse:\n\t\tcup+=1\nif(cup>clo):\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n \t \t \t \t \t \t", "a = list(input())\r\ncount=0\r\nfor i in a:\r\n if i==i.lower():\r\n count+=1\r\nz=\"\".join(a)\r\nif count>=len(a)-count:\r\n z=z.lower()\r\nelse:\r\n z=z.upper()\r\nprint(z)", "word = input()\nupperCase = 0\nlowerCase = 0\nfor letter in list(word):\n if(ord(letter)>=97):\n lowerCase+=1\n else:\n upperCase+=1\nif(upperCase > lowerCase):\n print(word.upper())\nelse:\n print(word.lower())", "word = input()\r\nword_l = word.lower()\r\nword_u = word.upper()\r\n\r\nword = list(word)\r\nword_l = list(word_l)\r\nword_u = list(word_u)\r\n\r\ncount_l = 0\r\ncount_u = 0\r\nfor i in range(len(word)):\r\n if word[i] == word_l[i]:\r\n count_l += 1\r\n if word[i] == word_u[i]:\r\n count_u += 1\r\n\r\nif count_l >= count_u:\r\n ans = \"\"\r\n for i in word_l:\r\n ans += i\r\n print(ans)\r\nelse:\r\n ans = \"\"\r\n for i in word_u:\r\n ans += i\r\n print(ans)", "def solve(word):\r\n lower_count = 0\r\n upper_count = 0\r\n\r\n for character in word:\r\n if character.islower():\r\n lower_count += 1\r\n else:\r\n upper_count += 1\r\n\r\n if lower_count < upper_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\n\r\nword = input()\r\nprint(solve(word))\r\n", "string = input()\n\nucnt = 0\nlcnt = 0\n\nupper = ''\nlower = ''\n\nfor ch in string:\n upper += ch.upper()\n lower += ch.lower()\n \n if ch.lower() != ch:\n ucnt+=1\n else:\n lcnt+=1\n \nif ucnt> lcnt:\n print(upper)\nelse:\n print(lower)", "s = input()\r\nup=0\r\nlo=0\r\nfor i in s:\r\n if i.isupper():\r\n up+=1 \r\n else:\r\n lo+=1 \r\nif up>lo:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nb=0\r\nc=0\r\nfor i in a:\r\n if(i.isupper()):\r\n b+=1\r\n else:\r\n c+=1\r\nif(b>c):\r\n a=a.upper()\r\nelse:\r\n a=a.lower()\r\nprint(a)\r\n", "ch=input(\"\")\r\nch1=\"\"\r\nu=0\r\nl=0\r\nfor i in range(len(ch)):\r\n if \"A\"<=ch[i]<=\"Z\":\r\n u=u+1\r\n elif \"a\"<=ch[i]<=\"z\":\r\n l=l+1\r\nif l>=u:\r\n for j in range(len(ch)):\r\n if \"A\"<=ch[j]<=\"Z\":\r\n ch1=ch1+chr(ord(ch[j])+32)\r\n elif \"a\"<=ch[j]<=\"z\":\r\n ch1=ch1+ch[j]\r\nelse:\r\n for j in range(len(ch)):\r\n if \"a\"<=ch[j]<=\"z\":\r\n ch1=ch1+chr(ord(ch[j])-32)\r\n elif \"A\"<=ch[j]<=\"Z\":\r\n ch1=ch1+ch[j]\r\nprint(ch1)", "s=input().strip()\r\nl=0\r\nr=0\r\nfor i in s:\r\n if(i.isupper()):\r\n l+=1\r\n else:\r\n r+=1 \r\nif(l>r):\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "a=input()\r\nx=[]\r\n\r\nfor i in a:\r\n x.append(i)\r\n\r\nu=0\r\nl=0\r\n\r\nfor i in x:\r\n if i.isupper()==True:\r\n u+=1\r\n else:\r\n l+=1\r\n \r\nif u>l:\r\n print(a.upper())\r\nelif l>=u:\r\n print(a.lower())\r\n\r\n", "frase = input()\r\ncountup = 0\r\ncountlower = 0\r\nfor x in frase:\r\n if 65 <= ord(x) <= 90:\r\n countup += 1\r\n else:\r\n countlower += 1\r\nif countup > countlower:\r\n print(frase.upper())\r\nelse:\r\n print(frase.lower())\r\n", "# cook your dish here\r\ns=input()\r\nl,u=0,0\r\n\r\nfor i in s:\r\n if(i>='a' and i<='z'):\r\n l+=1\r\n elif(i>='A' and i<='Z'):\r\n u+=1\r\nif(u>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n# print(u,l)", "n=input()\r\nl,l2=[],[]\r\np=[str(i) for i in n]\r\nfor i in p:\r\n\tif(i.isupper()):\r\n\t\tl.append(i)\r\n\telse:\r\n\t\tl2.append(i)\r\nif(len(l)<=len(l2)):\r\n\tprint(n.lower())\r\nelse:\r\n\tprint(n.upper())", "st=input()\nup=0\nlp=0\nfor i in range(len(st)):\n if ord(st[i])<96:\n up=up+1\n else:\n lp=lp+1\nif up>lp:\n print(st.upper())\nelse:\n print(st.lower())\n\t \t \t \t \t\t\t \t\t\t\t\t \t\t\t \t\t \t", "a=input()\r\nx=0\r\ny=0\r\nfor i in range(len(a)):\r\n if ord(a[i])>=65 and ord(a[i])<=90:\r\n x=x+1\r\n elif ord(a[i])>=97:\r\n y=y+1\r\nif x>y:\r\n print(a.upper())\r\nelif x<y:\r\n print(a.lower())\r\nelse:\r\n print(a.lower())", "a = input().strip();\r\nlc=0;\r\nuc=0;\r\nfor letter in a:\r\n if letter.islower():\r\n lc+=1;\r\n else:\r\n uc+=1;\r\nif lc>=uc:\r\n print(a.lower());\r\nelse:\r\n print(a.upper());", "Text = str(input())\nuppers = 0\nlowers = 0\nfor x in range(len(Text)):\n if(ord(Text[x]) + 32 == ord(Text[x].lower())):\n uppers += 1\n if(ord(Text[x]) - 32 == ord(Text[x].upper())):\n lowers += 1\nif(lowers >= uppers):\n print(Text.lower())\nelse:\n print(Text.upper())\n", "word = input()\r\ncu=0\r\ncl=0\r\nfor i in word:\r\n if(i.isupper()):\r\n cu=cu+1\r\n else:\r\n cl=cl+1\r\nans1=word.upper()\r\nans2=word.lower()\r\nif(cu>cl):\r\n print(ans1)\r\nelif(cu==cl):\r\n print(ans2)\r\nelse:\r\n print(ans2)", "s = input()\r\nu = 0\r\nl = 0\r\nfor f in range(len(s)) :\r\n if s[f].isupper() : u += 1\r\n else : l += 1\r\nif u > l : print(s.upper())\r\nelse : print(s.lower())\r\n", "n = input()\r\n\r\ncountup=0\r\ncountlow=0\r\n\r\nfor char in n:\r\n if(char.isupper()):\r\n countup=countup+1\r\n else:\r\n countlow=countlow+1\r\n \r\nif(countup>countlow):\r\n n = n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n)", "s = str(input())\r\nf, bf = 0, 0\r\nfor x in s:\r\n if ord(x) < 97 :\r\n f+=1\r\n else:\r\n bf+=1\r\nif f > bf:\r\n print(s.upper())\r\nelif f == bf:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n", "name = input()\r\ncou1 = 0\r\ncou2 = 0\r\nfor i in name:\r\n if i.islower():\r\n cou1 += 1\r\n elif i.isupper():\r\n cou2 += 1\r\nif cou1 >= cou2:\r\n print(name.lower())\r\nelif cou2 > cou1:\r\n print(name.upper())", "str=input()\r\ncount=0\r\ncount1=0\r\nfor x in str:\r\n if x.isupper():\r\n count+=1\r\n elif x.islower():\r\n count1+=1\r\nif count>count1:\r\n print(str.upper())\r\nelif count<count1:\r\n print(str.lower())\r\nelse:\r\n print(str.lower())", "string=input()\r\ncu=0\r\ncl=0\r\nfor i in string:\r\n if i.isupper():\r\n cu+=1\r\n elif i.islower():\r\n cl+=1\r\nif(cu>cl):\r\n print(string.upper())\r\nelif(cu==cl):\r\n print(string.lower())\r\nelse:\r\n print(string.lower())\r\n", "n=input()\r\nc=0\r\nfor i in range (len(n)):\r\n if (n[i].isupper()):\r\n c+=1\r\nif (len(n)/2>c):\r\n print(n.lower())\r\nelif (len(n)/2==c):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "t=input()\r\ncap=0\r\nsml=0\r\nfor i in t:\r\n if ord(i)<97:\r\n cap+=1\r\n else:\r\n sml+=1\r\n\r\nif cap>sml:\r\n print(t.upper())\r\n\r\nelse:\r\n print(t.lower())", "x=input()\r\ni=0\r\nupper=0\r\nlower=0\r\nfor i in x:\r\n if i.islower():\r\n lower=lower+1\r\n elif i.isupper():\r\n upper=upper+1\r\nif upper>lower:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n \r\n", "s = input()\r\n\r\nl = 0\r\nu = 0\r\n\r\nfor i in range(0, len(s)):\r\n if s[i] == s[i].upper():\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif l >= u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "str=input(\"\")\r\nlower=0\r\nupper=0\r\nfor i in range(len(str)):\r\n #to lower case letter\r\n if(str[i]>='a' and str[i]<='z'):\r\n lower+= + 1\r\n #to upper case letter\r\n elif(str[i]>='A' and str[i]<='Z'):\r\n upper+= + 1\r\n\r\nif lower == upper:\r\n print(str.lower())\r\nelif lower > upper:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())\r\n ", "s=input()\r\nL='QWERTYUIOPASDFGHJKLZXCVBNM'\r\nl=L.lower()\r\nLL=0\r\nll=0\r\nfor i in L:\r\n LL+=s.count(i)\r\nfor i in l:\r\n ll+=s.count(i)\r\nif LL<=ll:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=input()\r\nup=down=0\r\nfor i in s:\r\n if(i.isupper()):\r\n up+=1\r\n else:\r\n down+=1\r\nif(up>down):\r\n print(s.upper())\r\nelif(up<=down):\r\n print(s.lower())", "word = input()\r\nn = len(word)\r\n\r\nlc = uc = 0\r\nfor c in word:\r\n if c.islower():\r\n lc += 1\r\n else:\r\n uc += 1\r\n\r\nif lc >= uc:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n \r\n", "string=input()\r\ncount1=0\r\ncount2=0\r\nfor i in string:\r\n if(i.islower()):\r\n count1=count1+1\r\n elif(i.isupper()):\r\n count2=count2+1\r\nif count1>=count2:\r\n s=string.lower()\r\nelse:\r\n s=string.upper()\r\nprint(s)", "slave = input()\r\narr = list(slave)\r\nSmall = 0\r\nBig = 0\r\nfor i in arr:\r\n if i.isupper():\r\n Big += 1\r\n else:\r\n Small += 1\r\nif Big > Small:\r\n print(slave.upper())\r\nelse:\r\n print(slave.lower())\r\n", "word = input()\r\ncnt = 0\r\nfor w in word:\r\n if w.isupper():\r\n cnt += 1\r\nif cnt > len(word)-cnt:\r\n print(word.upper())\r\nelse: print(word.lower())", "t=input()\r\np=0\r\ns=0\r\nfor i in range(len(t)):\r\n if t[i]>\"Z\":\r\n s=s+1\r\n else:\r\n p=p+1\r\nif p>s:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "s=input()\r\nupper_count=0\r\nlower_count=0\r\nfor ren in range(len(s)):\r\n if(s[ren].isupper()):\r\n upper_count=upper_count+1\r\n else:\r\n lower_count+=1\r\n \r\nif(upper_count>lower_count):\r\n str1=s.upper()\r\n print(str1)\r\nelse:\r\n print(s.lower())\r\n ", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Dec 12 20:52:14 2018\n\n@author: CXT\n\"\"\"\n\ns=input()\ncount=sum(i.isupper() for i in s)\nprint([s.upper(),s.lower()][(len(s)-count)>=len(s)/2])", "aa=input()\r\na=list(aa)\r\nuc=0\r\nlc=0\r\nfor i in a:\r\n if i.upper()==i:\r\n uc+=1\r\n else:\r\n lc+=1\r\nif lc>=uc:\r\n print(aa.lower())\r\nelse:\r\n print(aa.upper())", "m=input()\r\nc=0\r\nd=0\r\nfor i in m:\r\n if i>='a' and i<='z':\r\n c+=1\r\n elif i>='A' and i<='Z':\r\n d+=1\r\nif d>c:\r\n print(m.upper())\r\nelse:\r\n print(m.lower())", "string = str(input())\r\nlist = [st for st in string]\r\n\r\ncountUpper = 0\r\ncounLower = 0\r\nfor ct in list:\r\n if ct.isupper():\r\n countUpper += 1\r\n else:\r\n counLower += 1\r\nif countUpper > counLower:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "name = input()\r\n\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor i in name:\r\n if i.isupper():\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\n \r\nif uppercase > lowercase:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())\r\n ", "s=input()\nlowerCase, upperCase = 0, 0\nfor ch in s:\n if(ch.islower()):\n lowerCase += 1\n else:\n upperCase += 1\nif(lowerCase>=upperCase):\n print(s.lower())\nelse:\n print(s.upper())\n \t\t \t\t\t\t\t\t\t\t\t \t \t \t\t \t \t", "\"\"\"word = input()\r\n\r\nuppercase_count = sum(1 for char in word if char.isupper())\r\nlowercase_count = len(word) - uppercase_count\r\n\r\nif uppercase_count > lowercase_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n \r\n \"\"\" \r\nw = input()\r\nupc= sum(1 for char in w if char.isupper())\r\nlwc = len(w) - upc\r\nif upc > lwc :\r\n print(w.upper())\r\nelse :\r\n print(w.lower())", "n=input()\r\n\r\nlow=0\r\nup=0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nprint(n.upper() if up>low else n.lower())", "lc=0\r\nuc=0\r\ns=input()\r\nl=list(s)\r\nfor i in l:\r\n j=ord(i)\r\n if(j>=97 and j<=122):\r\n lc+=1\r\n elif(j>=65 and j<=90):\r\n uc+=1\r\n else:\r\n pass\r\nif(lc>=uc):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\ncount= 0\r\nfor i in range(len(s)):\r\n\tif s[i] == s[i].upper():\r\n\t\tcount+=1\r\nif count>len(s)//2:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s=input()\r\ncaps=low=0\r\nfor i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n caps+=1\r\n else:\r\n low+=1\r\nif caps>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "t = input()\r\nupper_c = 0\r\nlower_c = 0\r\nfor c in t:\r\n if c.isupper():\r\n upper_c+=1\r\n elif c.islower():\r\n lower_c+=1\r\nif upper_c>lower_c:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "#Word_59A\r\ns=input()\r\nlower_case=0\r\nupper_case=0\r\nfor i in s:\r\n if 65<=ord(i)<=90:\r\n upper_case+=1\r\n elif 97<=ord(i)<=122:\r\n lower_case+=1\r\nif lower_case==upper_case or lower_case>upper_case:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "word = input()\nlower, upper = 0,0\nfor char in word:\n if char.isupper(): upper += 1\n else: lower += 1\nif upper > lower: print(word.upper())\nelse: print(word.lower())", "str=input()\r\nl=len(str)\r\nc=0\r\nfor i in str:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n c=c+1\r\nif(c>=(l/2)):\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "a=input()\r\nb='QWERTYUIOPASDFGHJKLZXCVBNM'\r\nk=0\r\nn=0\r\nfor x in a:\r\n if x in b: \r\n k=k+1\r\n else:\r\n n=n+1\r\nif n<k:\r\n f=a.upper()\r\n print(f)\r\nelse:\r\n m=a.lower()\r\n print(m)", "u = 0\r\nl = 0\r\ninp = input()\r\nfor i in inp:\r\n if(i == i.upper()):\r\n u += 1\r\n else:\r\n l += 1\r\nif(u > l):\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower())", "s=input()\r\nsmall=0\r\nla=0\r\n\r\n\r\nfor i in range(len(s)):\r\n if ord(s[i])>= 97:\r\n small+=1\r\n else:\r\n la+=1\r\nif la>small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nupcount=0\r\nlocount=0\r\nfor i in s:\r\n if(i.isupper()):\r\n upcount+=1\r\n else:\r\n locount+=1\r\nif(upcount>locount):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "a=input()\r\nprint([a.lower(),a.upper()][sum(map(str.isupper,a))>len(a)/2])", "def word(n):\n count_lower = 0\n count_upper = 0\n for i in n:\n if i.islower():\n count_lower += 1\n else:\n count_upper += 1\n if count_lower > count_upper:\n n = n.lower()\n elif count_lower < count_upper:\n n = n.upper()\n else:\n n = n.lower()\n print(n)\nn = input()\nword(n)", "\r\nstring = input()\r\ncount = 0\r\ncount1 = 0\r\nfor i in range(len(string)):\r\n if ord(string[i])>96:\r\n count +=1\r\n else:\r\n count1+=1\r\n\r\nif count==count1 or count>count1:\r\n string=string.lower()\r\n print(string)\r\nelse:\r\n string = string.upper()\r\n print(string)\r\n\r\n", "word = input()\r\nyes = no = 0\r\nx = len(word)\r\n\r\nif x <= 100:\r\n for i in range(x):\r\n if word[i].isupper() is True:\r\n yes = yes + 1\r\n else:\r\n no = no + 1\r\n\r\nif yes == no:\r\n print(word.lower())\r\nelif yes > no:\r\n print(word.upper())\r\nelif yes < no:\r\n print(word.lower())", "s = input()\r\nn = 0\r\nm = 0\r\nfor i in s:\r\n if i.islower() == True:\r\n n += 1 \r\n else:\r\n m += 1\r\nif n >= m:\r\n s = s.lower()\r\n print(s) \r\nelse:\r\n print(s.upper())\r\n \r\n ", "mot = input()\r\nl=0\r\nu=0\r\nfor lettre in mot:\r\n if lettre.islower():\r\n l+=1\r\n else:\r\n u+=1\r\nif u>l:\r\n print(mot.upper())\r\nelse:\r\n print(mot.lower())\r\n", "n=input()\r\na=0\r\nA=0\r\nfor i in n:\r\n if ord(i) in range(97,123):\r\n a=a+1\r\n elif ord(i) in range(65,91):\r\n A=A+1\r\nif a>A or a==A:\r\n for i in range(0,len(n)):\r\n print(n[i].lower(),end='',sep='')\r\nelse:\r\n for i in range(0,len(n)):\r\n print(n[i].upper(),end='',sep='')\r\n ", "def main():\r\n a = input()\r\n n = len(a)\r\n b = a.upper()\r\n counter = 0\r\n for i in range(n):\r\n if a[i] == b[i]:\r\n counter +=1\r\n if counter > round(n // 2):\r\n print(a.upper())\r\n else:\r\n print(a.lower())\r\n\r\n\r\nmain()", "word = input()\r\n\r\nuppercount = 0\r\nlowercount = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n uppercount += 1\r\n else :\r\n lowercount += 1\r\n\r\nif uppercount > lowercount :\r\n print(word.upper())\r\nelse :\r\n print(word.lower())", "s=input()\nl,u=0,0\nfor i in s:\n if(i>='a' and i<='z'):\n l=l+1\n else:\n u=u+1\nif(l>=u):\n print(s.lower())\nelse:\n print(s.upper())\n \t \t\t \t \t \t \t \t \t \t\t\t\t\t\t \t \t", "s = str(input())\r\n\r\nlower_count = sum(map(str.islower, s))\r\nupper_count = sum(map(str.isupper, s))\r\n\r\nif lower_count > upper_count:\r\n s = s.lower()\r\n print(s)\r\nelif upper_count > lower_count:\r\n s = s.upper()\r\n print(s)\r\nelif lower_count == upper_count:\r\n s = s.lower()\r\n print(s)\r\n\r\n", "n = input()\r\nrecord = 0\r\nfor i in n:\r\n if ord(i) >= 97:\r\n record -= 1\r\n else:\r\n record += 1\r\n\r\nif record > 0:\r\n print (n.upper())\r\nelse:\r\n print (n.lower())\r\n", "str1 = input()\r\nupperCount = 0\r\nlowerCount = 0\r\nfor ch in str1:\r\n if ch.isupper():\r\n upperCount += 1\r\n else:\r\n lowerCount += 1\r\n\r\nif upperCount > lowerCount:\r\n print(str1.upper())\r\nelse:\r\n print(str1.lower())", "name=input()\r\nlow=0\r\nup=0\r\nfor i in name:\r\n if i.islower():\r\n low+=1\r\n elif i.isupper():\r\n up+=1\r\nif low>=up:\r\n print(name.lower())\r\nelif low<up:\r\n print(name.upper())", "a,word=0,input()\r\nfor i in word:\r\n if i.islower():\r\n a+=1\r\nif a>=len(word)/2:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\nl = 0\r\nh = 0\r\nfor i in s:\r\n\tif i.islower():\r\n\t\tl += 1\r\n\telse:\r\n\t\th += 1\r\nif h > l:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "bol=0\r\nmal=0\r\nslovo=input()\r\nfor i in range (len(slovo)):\r\n a=slovo[i]\r\n if a.isupper():\r\n bol=bol+1\r\n else:\r\n mal=mal+1\r\nif bol>mal:\r\n print(slovo.upper())\r\nelse:\r\n print(slovo.lower())", "WoRd = input()\nif sum(map(str.isupper,WoRd)) > sum(map(str.islower,WoRd)):\n print(WoRd.upper())\nelse:\n print(WoRd.lower())\n\t\t\t\t \t \t \t \t\t\t\t\t\t\t \t\t \t", "word = input()\r\n\r\nnewword = \"\"\r\nnumupper = 0\r\nnumlower = 0\r\n\r\nfor i in range(0, len(word)):\r\n if word[i].isupper():\r\n numupper += 1\r\n else:\r\n numlower += 1\r\n\r\nif numupper > numlower:\r\n newword = word.upper()\r\nelse:\r\n newword = word.lower()\r\n\r\nprint(newword)\r\n \r\n", "w=input()\r\nup=0\r\ndown=0\r\nfor i in w:\r\n if i.isupper():\r\n up=up+1\r\n else:\r\n down=down+1\r\nif up>down:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "word = input()\r\ncntl,cntu = 0,0\r\nfor i in word:\r\n if i.islower():\r\n cntl += 1\r\n else:\r\n cntu += 1\r\n\r\nif cntl >= cntu:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "string = input()\r\ncount =0\r\nfor i in string:\r\n if i >= 'A' and i <= 'Z':\r\n count+=1\r\n\r\nif(count <= (len(string)-count)):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "word = input()\r\nword_strip = word.strip()\r\n\r\nuppercase_count, lower_case_count = 0,0\r\n\r\nfor x in word_strip:\r\n if x.isupper() == True:\r\n uppercase_count = uppercase_count + 1\r\n elif x.islower() == True:\r\n lower_case_count = lower_case_count + 1\r\n\r\nif uppercase_count > lower_case_count:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)", "s=input()\r\na=b=0\r\nfor i in s:\r\n if i>='A' and i<='Z':\r\n a += 1\r\n elif i >= 'a' and i <= 'z':\r\n b += 1\r\nif a>b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "up=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndown=\"abcdefghijklmnopqrstuvwxyz\"\r\nw=input()\r\nans=0\r\nfor i in w:\r\n if i in up: ans+=1\r\n if i in down: ans-=1\r\nif ans>0:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "s=input()\r\nlow=0\r\nupper=0\r\nfor i in s:\r\n if i.islower():\r\n low+=1\r\n elif i.isupper():\r\n upper+=1\r\nif low==upper:\r\n print(s.lower())\r\nelif low<upper:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def count(s: str) -> str:\r\n u, l = 0, 0\r\n for letter in s:\r\n if letter.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n if u > l:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n# inputs = list(map(int, input().strip().split()))\r\n# k =int(input())\r\ns1 = str(input())\r\nprint(count(s1))\r\n", "s=input()\r\ncount=0\r\nt=0\r\nfor i in s:\r\n if(i.islower()):\r\n count=count+1\r\n else:\r\n t=t+1\r\nif(count>=t):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "s = input()\r\ns1 = s.lower()\r\ns2 = s.upper()\r\nl = 0\r\nu = 0\r\nx = len(s)\r\nfor i in range(0,x):\r\n if s[i]==s1[i]:\r\n l = l+1\r\nfor i in range(0,x):\r\n if s[i]==s2[i]:\r\n u = u+1\r\nif u>l:\r\n print(s2)\r\nelse:\r\n print(s1)", "t=input()\r\nt=list(t)\r\nc1=0\r\nc2=0\r\nfor i in range(len(t)):\r\n if 65 <= ord(t[i]) <= 90:\r\n c1 += 1\r\n elif 97 <= ord(t[i]) <= 122:\r\n c2 += 1\r\nif c1 <= c2:\r\n for i in range(len(t)):\r\n if 65 <= ord(t[i]) <= 90:\r\n print(chr(ord(t[i])+32),end='')\r\n else:\r\n print(t[i],end='')\r\nif c1 > c2:\r\n for i in range(len(t)):\r\n if 97 <= ord(t[i]) <= 122:\r\n print(chr(ord(t[i])-32),end='')\r\n else:\r\n print(t[i],end='')", "n=input()\r\nucount=0\r\nlcount=0\r\nfor char in(n):\r\n if char.isupper():\r\n ucount+=1\r\n else:\r\n lcount+=1\r\nif ucount>lcount:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "# Problem: A. Word\n# Contest: Codeforces - Codeforces Beta Round 55 (Div. 2)\n# URL: https://codeforces.com/problemset/problem/59/A\n# Memory Limit: 256 MB\n# Time Limit: 2000 ms\n# \n# Powered by CP Editor (https://cpeditor.org)\n\na = input()\nu, l = 0, 0\nfor i in a:\n\tif i.islower(): l += 1\n\telse: u += 1\nprint(a.lower() if u <= l else a.upper())", "a=input()\r\nl=[]\r\nk=[]\r\nfor i in a:\r\n if i==i.lower():\r\n l.append(i)\r\n else:\r\n k.append(i)\r\n\r\nif len(l)>=len(k):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "n=input()\r\nx1=0\r\nx2=0\r\nfor i in n:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n x1+=1\r\n else:\r\n x2+=1\r\nif x1>x2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "def transform_word(word):\r\n uppercase_count = sum(1 for c in word if c.isupper())\r\n lowercase_count = len(word) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n transformed_word = word.upper()\r\n else:\r\n transformed_word = word.lower()\r\n\r\n return transformed_word\r\n\r\n# Example usage:\r\nword = input() # Read the input word\r\ntransformed_word = transform_word(word)\r\nprint(transformed_word)\r\n", "a = input()\r\nct = 0\r\nfor i in a:\r\n\tif i in a.lower():\r\n\t\tct +=1\r\n\t\r\nif ct >= len(a)/2:\r\n\tprint(a.lower())\r\nelse:print(a.upper())", "s = input()\r\nprint(\r\n [s.upper(),s.lower()][sum(i > \"Z\" for i in s) * 2 >= len(s)] \r\n)", "s = input()\nmaju = 0\nmini = 0\nfor i in s:\n if i >=\"A\" and i<=\"Z\":\n maju += 1\n else:\n mini+=1\nif maju > mini:\n print(s.upper())\nelse:\n print(s.lower())", "def transform(text):\r\n lower = 0; upper = 0\r\n for ch in text:\r\n if ch.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n if lower >= upper:\r\n return text.lower()\r\n else:\r\n return text.upper()\r\n\r\ntext = input()\r\nprint(transform(text))\r\n", "word = input()\nlowerz=0 \nupper = 0\ncheck = True\nlength = (len(word))/2\nfor w in word:\n if w.islower():\n lowerz +=1\n if lowerz >= length:\n check = False\n \nif check:\n print(word.upper())\nelse:\n print(word.lower())\n\n \n\t\t \t \t \t\t \t\t\t\t\t\t\t\t\t\t \t", "#problem 59A: Word\r\n\r\ntext = input()\r\n\r\nup = 0\r\nlow = 0\r\nfor i in range(len(text)):\r\n if ord(text[i])>=65 and ord(text[i])<=90:\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(text.upper())\r\nelif up<=low:\r\n print(text.lower())\r\n\r\n", "s=input()\r\nn=len(s)\r\nu=0\r\nl=0\r\nfor i in s:\r\n if (i.islower()):\r\n l+=1\r\n if (i.isupper()):\r\n u+=1\r\nif u>l:\r\n print(s.upper())\r\nelif l>u:\r\n print(s.lower())\r\nelif l==u:\r\n print(s.lower())", "original = input()\r\ncount = 0\r\nfor char in original:\r\n if char < 'a':\r\n count += 1\r\nif 2*count > len(original):\r\n print(original.upper())\r\nelse:\r\n print(original.lower())", "import string\r\na = input()\r\nk1 = 0\r\nk2 = 0\r\nfor i in a:\r\n if i in string.ascii_lowercase:\r\n k1 += 1\r\n else:\r\n k2 += 1\r\nif k1 >= k2:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "n=input()\r\ncount=0\r\nsum=0\r\nfor i in n:\r\n\tif i.isupper():\r\n\t\tcount+=1 \r\n\telse:\r\n\t\tsum+=1 \r\nif(count>sum):\r\n\tprint(n.upper())\r\nelse:\r\n\tprint(n.lower())", "s = input()\r\nlowercount = 0\r\nuppercount = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].islower() == True:\r\n lowercount += 1\r\n else:\r\n uppercount += 1\r\n \r\nif lowercount>=uppercount:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\nlow=0\nup=0\nfor i in s:\n if i.islower():\n low+=1\n else:\n up+=1\nif low==up:\n print(s.lower())\nelif low>up:\n print(s.lower())\nelse:\n print(s.upper())\n", "a = str(input())\r\nflag = 0\r\nfor i in a:\r\n if i.islower() == True:\r\n flag +=1\r\nif (len(a)-flag) <= flag:\r\n a = a.lower()\r\nelse:\r\n a = a.upper()\r\nprint(a)", "word = input()\r\nu = 0\r\nl = 0\r\nfor i in word:\r\n if (i.isupper()):\r\n u += 1\r\n else:\r\n l += 1\r\nresult = ''\r\nif u > l:\r\n for i in word:\r\n if i.islower():\r\n result += i.upper()\r\n else:\r\n result += i\r\nelif u<l:\r\n for i in word:\r\n if i.isupper():\r\n result += i.lower()\r\n else:\r\n result +=i\r\nelse:\r\n result=word.lower()\r\nprint(result)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Feb 26 02:30:05 2022\r\n\r\n@author: ghiti\r\n\"\"\"\r\n\r\nn = input()\r\nup = [i for i in n if i.isupper()]\r\nlow = [i for i in n if i.islower()]\r\nif len(up) > len(low):\r\n print(n.upper())\r\nelse: \r\n print(n.lower())\r\n", "import string\nc= (string.ascii_letters)\n#[26;[ nagybetuk\n\ns= input()\ncap= 0\ndc= 0\nfor j in s:\n if j in c[26:]:\n cap+= 1\n else:\n dc+= 1\nif cap > dc:\n print(s.upper())\nelse:\n print(s.lower())\n", "n=input()\r\nu=0\r\nl=0\r\n\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n u+=1 \r\n else:\r\n l+=1 \r\nif l==u:\r\n print(n.lower())\r\nelif u>l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "a=input()\r\nl=0\r\nu=0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n l+=1\r\n if a[i].isupper():\r\n u=u+1\r\nif l==u:\r\n print(a.lower())\r\nif l>u:\r\n print(a.lower())\r\nelif l<u:\r\n print(a.upper())", "s = input()\r\nl = len(s)\r\ncount = 0\r\nfor i in s:\r\n if i >= \"a\" and i <= \"z\":\r\n count = count+1\r\nif count >= (l/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "seq=input()\r\nl,u=0,0\r\nfor i in seq:\r\n if i.islower():\r\n l+=1\r\n elif i.isupper():\r\n u+=1\r\nif l>=u :\r\n print(seq.lower())\r\nelif l<u:\r\n print(seq.upper())", "word=input()\r\nbig=0\r\nsmall=0\r\nfor i in word:\r\n if i==i.upper():\r\n big+=1\r\n else:\r\n small+=1\r\nif big>small:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "a = str(input())\r\nb = []\r\nc = []\r\nfor i in a :\r\n if i.isupper() :\r\n b.append(i)\r\n else :\r\n c.append(i)\r\nif len(b) > len(c):\r\n print(a.upper())\r\nelse :\r\n print(a.lower())\r\n", "s=input()\r\na=b=0\r\nfor i in s:\r\n c=i.islower()\r\n if c==True:\r\n a=a+1\r\n else:\r\n b=b+1\r\nif a>=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nup=0\r\nlow=0\r\nfor i in s:\r\n if i.isupper()==True:\r\n up+=1\r\n else:\r\n low+=1\r\nprint(s.lower() if low>=up else s.upper())", "word = input()\r\nnum = word.count('a')+word.count('b')+word.count('c')+word.count('d')+word.count('e')+word.count('f')+word.count('g')+word.count('h')+word.count('i')+word.count('j')+word.count('k')+word.count('l')+word.count('m')+word.count('n')+word.count('o')+word.count('p')+word.count('q')+word.count('r')+word.count('s')+word.count('t')+word.count('u')+word.count('v')+word.count('w')+word.count('x')+word.count('y')+word.count('z')\r\nif num*2 >= len(word):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "a = input()\r\nc=0\r\nfor i in a:\r\n if i.islower(): c+=1\r\nif ((len(a)-c)>c):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word = list(input())\r\n\r\nupper = 0\r\nlower = 0\r\nfor char in word:\r\n if char >= 'a' and char <= 'z':\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif lower >= upper:\r\n word = str(''.join(word)).lower()\r\nelse:\r\n word = str(''.join(word)).upper()\r\n\r\nprint(word)", "st = input()\r\ncap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ns,c = 0,0\r\nfor i in range(len(st)):\r\n if st[i] in cap:\r\n c += 1\r\n else:\r\n s += 1\r\nif c>s:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "ss=0\r\nc=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if s[i]>='a' and s[i]<='z':\r\n ss+=1\r\n elif s[i]>='A' and s[i]<='Z':\r\n c+=1\r\nif ss>=c:\r\n print(s.lower())\r\nelif ss<c:\r\n print(s.upper())", "str=input()\r\nn=len(str)\r\nc,d=0,0\r\nASCII=[]\r\nlowercase=[]\r\nuppercase=[]\r\nR=\"\"\r\nfor i in range(0,n):\r\n ASCII.append(ord(str[i]))\r\n if ASCII[i]>=95:\r\n c+=1\r\n lowercase.append(i)\r\n else:\r\n d+=1\r\n uppercase.append(i)\r\nif c<d :\r\n for i in range(0,n):\r\n if i in lowercase:\r\n R+=chr(ASCII[i]-32)\r\n else:\r\n R+=str[i]\r\nelse:\r\n for i in range(0,n):\r\n if i in uppercase:\r\n R+=chr(ASCII[i]+32)\r\n else:\r\n R+=str[i]\r\n\r\nprint(R)", "word = input()\r\n\r\nis_upper = 0\r\nis_lower = 0\r\n\r\nfor i in word :\r\n if i.isupper():\r\n is_upper += 1\r\n else:\r\n is_lower += 1\r\n\r\nif is_upper > is_lower :\r\n print(word.upper())\r\nelif is_lower >= is_upper :\r\n print(word.lower())\r\n", "s=input()\r\nl=len(s)\r\nc1=0\r\nc2=0\r\nfor i in range(l):\r\n if s[i].isupper():\r\n c1+=1\r\n elif s[i].islower():\r\n c2+=1\r\nif c1 == c2:\r\n s=s.lower()\r\n print(s)\r\nelif c1 > c2:\r\n s=s.upper()\r\n print(s)\r\nelif c1 < c2:\r\n s=s.lower()\r\n print(s)\r\n", "s = str(input())\r\nhighlet = sum(map(str.isupper, s))\r\nlillet = sum(map(str.islower, s))\r\nif highlet > lillet:\r\n print(s.upper())\r\nelif lillet > highlet:\r\n print(s.lower())\r\nelif highlet == lillet:\r\n print(s.lower())", "import string\nline = input()\nup = 0\nlow = 0\nfor char in line:\n if char in string.ascii_lowercase:\n low += 1\n elif char in string.ascii_uppercase:\n up += 1\nprint(line.lower()) if low >= up else print(line.upper())\n", "a=input()\r\nb=0\r\nc=0\r\nfor i in a:\r\n if i.isupper():\r\n b+=1\r\n else:\r\n c+=1\r\nif (c>=b):\r\n print (a.lower())\r\nelse:\r\n print (a.upper())", "h = input()\r\nli_bool = [True if i.isupper() else False for i in h]\r\nprint(h.upper() if li_bool.count(True) > li_bool.count(False) else h.lower() )", "s = str(input())\r\n\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor k in s:\r\n\tif k.isupper():\r\n\t\tcount_upper += 1\r\n\telse:\r\n\t\tcount_lower += 1\r\n\r\nif count_lower < count_upper:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n\t\t\r\n", "word = input()\nups = 0\ndowns = 0\nfor c in word :\n if c.isupper():\n ups +=1\n else :\n downs +=1\nif ups > downs :\n print(word.upper())\nelse :\n print(word.lower())", "c=input()\r\nu=1\r\nl=1\r\nfor i in range(len(c)):\r\n if(c[i].isupper()==True):\r\n u+=1\r\n else:\r\n l+=1\r\nif(u>l):\r\n c=c.upper()\r\nelse:\r\n c=c.lower()\r\nprint(c)", "s = str(input())\r\nupper_cnt = 0\r\nfor x in s:\r\n if x.isupper():\r\n upper_cnt += 1\r\n\r\nval = len(s)//2\r\n\r\nif val < upper_cnt:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "s = input()\r\nprint('%s'%(s.upper() if sum(1 for char in s if char.isupper()) > sum(1 for char in s if char.islower()) else s.lower()))", "def main():\r\n from string import ascii_uppercase as upp\r\n s=input()\r\n q=0\r\n q1=0\r\n for i in s:\r\n if i in upp:\r\n q+=1\r\n else:\r\n q1+=1\r\n if q<=q1:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\nmain()", "s=input()\nupper=0\nlower=0\n\nfor i in s:\n if i.isupper():\n upper+=1\n else:\n lower+=1\n\nif(upper>lower):\n print(s.upper())\nelse:\n print(s.lower())\n", "word = input()\r\n\r\nlow, high = 0, 0\r\nfor letter in word:\r\n if letter.islower():\r\n low += 1\r\n else:\r\n high += 1\r\n\r\nprint(word.lower() if low >= high else word.upper())\r\n", "\r\nword = input()\r\nlower_case = sum(1 for c in word if c.islower())\r\n\r\nif lower_case >= len(word) / 2:\r\n conversion_function = str.lower\r\nelse:\r\n conversion_function = str.upper\r\nconverted_word = ''.join(conversion_function(c) for c in word)\r\nprint(converted_word)\r\n", "a = input()\r\nc_lower, c_upper = 0, 0\r\nfor i in range(len(a)):\r\n if a[i].islower() == True:\r\n c_lower += 1\r\n else:\r\n c_upper += 1\r\nif c_lower >= c_upper:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "a=input()\r\nc1=0\r\nc2=0\r\nfor i in a:\r\n if(i.islower()):\r\n c1+=1\r\n else:\r\n c2+=1 \r\n \r\nif(c1>=c2):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n ", "string=input()\r\nup=0\r\nlow=0\r\nfor word in string:\r\n if ord(word)>=65 and ord(word)<=90:\r\n up+=1\r\n else :\r\n low+=1\r\nif up>low:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "s = input()\r\nx=0\r\ny=0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].upper():\r\n x +=1\r\n else:\r\n y +=1\r\nif(x>y):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "palavra = input()\n\nmaiuscula = 0\nminuscula = 0 \n\nfor letra in palavra:\n if letra.islower():\n minuscula = minuscula + 1\n else:\n maiuscula = maiuscula + 1\n \n\nif maiuscula > minuscula:\n print(palavra.upper())\n\nelse:\n print(palavra.lower())\n\n\n\n \t\t \t \t \t\t\t \t\t\t\t \t \t\t \t \t", "a = str(input())\ncount1 = 0\ncount2 = 0\nfor i in a:\n if i.islower():\n count1 = count1 + 1\n else:\n count2 = count2 + 1\n\nif(count1 >= count2):\n print(a.lower())\nelse:\n print(a.upper())\n \n", "a,b=input(),0\r\nfor i in a:\r\n if i.upper()==i:\r\n b+=1\r\nprint(a.upper()) if 2*b>len(a) else print(a.lower())", "s=input()\r\nc=0\r\nsm=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n c+=1\r\n else:\r\n sm+=1\r\nif sm>=c:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)\r\n ", "a = input()\r\ncu = 0\r\ncl = 0\r\nfor i in a:\r\n if i.isupper():\r\n cu += 1\r\n else:\r\n cl += 1\r\nif cu>cl:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "n = input()\r\ncountl = 0\r\ncountu = 0\r\nfor c in n:\r\n if 97 <= ord(c) and ord(c) <= 122:\r\n countl += 1\r\n \r\n countu = len(n) - countl\r\n\r\nif countu <= countl:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n\r\n", "n=input()\r\nlow,upr=0,0\r\nfor each in n:\r\n if each>='A' and each<='Z':\r\n upr+=1\r\n else:\r\n low+=1\r\nif upr>low:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n\r\n\r\n\r\n", "if __name__==\"__main__\":\r\n str1=input()\r\n low=0\r\n up=0\r\n for i in range(len(str1)):\r\n if str1[i].islower()==1:\r\n low+=1\r\n if str1[i].isupper()==1:\r\n up+=1\r\n if(low>up or low==up):\r\n print(str1.lower())\r\n else:\r\n print(str1.upper())\r\n", "s=input()\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u=u+1\r\n elif s[i].islower():\r\n l=l+1\r\nif u>l:\r\n new_s=s.upper()\r\nelif u<=l:\r\n new_s=s.lower()\r\nprint(new_s)", "d=input()\r\nl,u=0,0\r\nfor i in d:\r\n\tif i.islower():l+=1\r\n\telse:u+=1\r\nif l>=u:print(d.lower())\r\nelse:print(d.upper())", "n=input()\r\nc=0\r\nd=0\r\nfor i in range(len(n)):\r\n if ord(n[i])>=65 and ord(n[i])<=91:\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n print(n.upper())\r\nelif c<d:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())", "s=input()\r\nl=list(s)\r\nu=0\r\nlo=0\r\nfor i in l:\r\n if(ord(i)<=91):\r\n u+=1\r\n else:\r\n lo+=1\r\nif(u>lo):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "n = input()\r\nk = 0\r\ns = 0\r\nfor i in n:\r\n if \"a\" <= i <=\"z\":\r\n k += 1\r\n else:\r\n s += 1\r\nif k >= s:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "x=input()\r\nu=l=0\r\nfor i in x:\r\n\tif(i.isupper()):\r\n\t\tu+=1\r\n\telif (i.islower()):\r\n\t\tl+=1\r\nif(u>l):\r\n\tx=x.upper()\r\nelif(l>u):\r\n\tx=x.lower()\r\nelse:\r\n\tx=x.lower()\r\nprint(x)", "s = input()\nlow_cnt,up_cnt=0,0\nfor i in s:\n if i==i.lower():\n low_cnt+=1 \n else:\n up_cnt+=1 \n \nif low_cnt>=up_cnt:\n print(s.lower())\nelse:\n print(s.upper())", "w = input()\r\nu = sum(1 for element in w if element.isupper())\r\nl = sum(1 for element in w if element.islower())\r\nif u > l: print(w.upper())\r\nelse: print(w.lower())", "a = input()\r\nb = a.upper()\r\nc = a.lower()\r\ndef low(word):\r\n u = [x for x in word if x.isupper()]\r\n l = [x for x in word if x.islower()]\r\n\r\n return len(u)>len(l)\r\nif(low(a)):\r\n print(b)\r\nelse:\r\n print(c)\r\n", "s = input()\r\nprint(min(s.lower(),s.upper(),key=lambda x:abs(sum([ord(i) for i in x])-sum([ord(i) for i in s]))))\r\n", "x=input()\r\nc=0\r\nt=0\r\nfor g in x:\r\n if g.islower():\r\n c+=1\r\n elif g.isupper():\r\n t+=1\r\n \r\nif c>=t :\r\n print( x.lower())\r\nelse :\r\n print( x.upper())\r\n", "a = input()\r\nu = l = 0\r\nfor x in a:\r\n if x.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n \r\nif u>l:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "# coding=utf-8 \r\n# Created by TheMisfits \r\nfrom sys import stdin\r\n_input = stdin.readline\r\n_str, _int = str, int\r\ndef solution():\r\n s = _input().rstrip(\"\\n\")\r\n h, l = 0, 0\r\n for i in s:\r\n if ord(i) < 97:\r\n h += 1\r\n else:\r\n l += 1\r\n if h > l:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\nsolution()", "w = input()\r\nm = 0\r\nn = 0\r\nfor i in w:\r\n if i.isupper():\r\n m += 1\r\n else:\r\n n += 1\r\nif m>n:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())\r\n", "def main():\n p=input()\n count_lower=0\n count_upper=0\n for i in p:\n if(i.isupper()==True):\n count_upper+=1\n elif(i.islower()==True):\n count_lower+=1\n \n if(count_upper==count_lower):\n print(p.lower())\n elif(count_upper>count_lower):\n print(p.upper())\n elif(count_upper<count_lower):\n print(p.lower())\n\nif __name__ =='__main__':\n main()\n", "s = input() \nl=0\nu=0\nfor i in s:\n if i.islower() == True:\n l+= 1\n else:\n u +=1\nif l >= u :\n print(s.lower())\nelse:\n print(s.upper())\n \t \t\t\t\t\t \t\t\t \t\t \t\t\t", "a=input()\r\nb=0\r\nc=0\r\nfor i in range(len(a)):\r\n if(a[i].islower()):\r\n b+=1\r\n else:\r\n c+=1\r\nif(b==c):\r\n a=a.lower()\r\n print(a)\r\nelif(b>c):\r\n a=a.lower()\r\n print(a)\r\nelse:\r\n a=a.upper()\r\n print(a)", "word = input().strip()\r\nu = l = 0\r\nfor w in word:\r\n if w.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u > l:\r\n print(word.upper())\r\nelse: \r\n print(word.lower())", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i.islower():\r\n count += 1\r\n\r\nprint(s.lower() if count >= len(s)-count else s.upper())\r\n", "x=input()\r\nc1=0\r\n\r\nfor i in x:\r\n if ord(i)>90:\r\n c1+=1\r\n else:\r\n c1-=1\r\nif c1==0:\r\n print(x.lower())\r\nelif c1>0:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n", "word=input()\r\nu,l=0,0\r\nfor i in word :\r\n\tif i >='a' and i<='z':\r\n\t\tl+=1\r\n\telse:\r\n\t\tu+=1\r\nif u > l:\r\n\tx=word.upper()\r\nelse:\r\n\tx=word.lower()\r\nprint(x)", "string = str(input())\r\n\r\ncount_upper, count_lower = 0, 0\r\nfor letter in string:\r\n if letter == letter.upper(): count_upper += 1\r\n else: count_lower += 1\r\n\r\nif count_upper > count_lower: print(string.upper())\r\nelse: print(string.lower())", "word=list(input())\r\nl=0\r\nu=0\r\nfor i in range(0,len(word)):\r\n if(word[i].islower()):\r\n l+=1 \r\n else:\r\n u+=1 \r\nif(u>l):\r\n for i in range(0,len(word)):\r\n if(word[i].islower()):\r\n word[i]=word[i].upper()\r\nelse:\r\n for i in range(0,len(word)):\r\n if(word[i].isupper()):\r\n word[i]=word[i].lower()\r\nfor i in word:\r\n print(i,end=\"\")", "word = input()\r\nlower=0\r\nfor i in word:\r\n if i.islower():\r\n lower+=1\r\nif lower>=len(word)-lower:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "a=input()\nlowcount=0\nupcount=0\nfor i in range(len(a)):\n if(a[i].islower()):\n lowcount+=1\n elif(a[i].isupper()):\n upcount+=1\nif(lowcount>=upcount):\n a=a.lower()\nelse:\n a=a.upper()\nprint(a)\n\t \t\t\t \t\t\t\t \t \t \t\t\t \t \t \t\t", "def word(s):\r\n u=l=0\r\n for i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n if u==l or l>u:\r\n return s.lower()\r\n return s.upper()\r\na=input()\r\ns=word(a)\r\nprint(s)", "k = input()\r\nup = 0\r\nlow = 0\r\nfor i in k:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up > low:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())\r\n\r\n", "a=input()\r\nx=[]\r\ny=[]\r\nfor i in a:\r\n if ord(i)>=41 and ord(i)<=90:\r\n x.append(i)\r\n elif ord(i)>=61 and ord(i)<=122:\r\n y.append(i)\r\nif len(x)<len(y) or len(x)==len(y):\r\n print (a.lower())\r\nelse:\r\n print (a.upper())", "n = input ()\r\nl = 0\r\nu = 0\r\nfor i in n :\r\n if i . islower ():\r\n l = l + 1\r\n else :\r\n u = u + 1\r\nif l >= u :\r\n print ( n.lower ( ) )\r\nelse:\r\n print ( n.upper ( ) )", "s = input()\r\n\r\nu = 0\r\nl = 0\r\n\r\nfor i in s:\r\n\tif(i.isupper()):\r\n\t\tu+=1\r\n\tif(i.islower()):\r\n\t\tl+=1\r\nif(u>l):\r\n\tprint(s.upper())\r\nelif(l>u or l==u):\r\n\tprint(s.lower())\r\n", "s=input()\r\nc1,c2=0,0\r\nfor i in s:\r\n if(i.islower()):\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\nif(c1>=c2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nupper, lower = 0, 0\r\nfor i in s:\r\n\tif 91 > ord(i) > 64:\r\n\t\tupper += 1\r\n\telse:\r\n\t\tlower += 1\r\nif upper > lower:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "s = input()\r\ni = u = o = 0\r\nfor i in range(0, len(s)):\r\n if s[i].islower():\r\n o += 1\r\n elif s[i].isupper():\r\n u += 1\r\nif u > o:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "str1=input()\r\nc_lower=0\r\nc_upper=0\r\nfor i in range(len(str1)):\r\n if(str1[i].islower()):\r\n c_lower+=1\r\n elif(str1[i].isupper()):\r\n c_upper+=1\r\nif(c_lower>c_upper):\r\n str1=str1.lower()\r\nelif(c_lower<c_upper):\r\n str1=str1.upper()\r\nelse:\r\n str1=str1.lower()\r\nprint(str1)\r\n\r\n", "s = input().strip()\ntu, tl = 0, 0\nfor c in s:\n if c.isupper():\n tl += 1\n else:\n tu += 1\nprint(s.upper() if tl > tu else s.lower())", "upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nlower = \"abcdefghijklmnopqrstuvwxyz\"\r\nu = 0 \r\nl = 0 \r\nn = input('')\r\nfor i in n: \r\n if i in upper : \r\n u = u + 1 \r\n else :\r\n l = l + 1\r\nif l >= u : \r\n print(n.lower())\r\n \r\nelse:\r\n print(n.upper())\r\n ", "s = input()\r\nsSize = len(s)\r\ncnt = 0\r\nfor _ in s:\r\n if _ >= 'a' and _ <= 'z':\r\n cnt += 1\r\nif cnt >= (sSize / 2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = str(input())\r\n\r\nl = 0\r\nu = 0\r\n\r\nfor char in s:\r\n if (char.islower()):\r\n l += 1\r\n else:\r\n u += 1\r\n\r\nif ( l < u):\r\n print(str(s.upper()))\r\nelif(l > u or l == u):\r\n print(str(s.lower()))\r\n\r\n\r\n\r\n", "inp = input()\nupper = len([i for i in inp if i.isupper()])\nlower = len([i for i in inp if i.islower()])\nif upper > lower:\n inp = inp = inp.upper()\nelse:\n inp = inp.lower()\n\nprint(inp)", "s = input()\r\nm = 0\r\nn = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n m += 1\r\n if i.isupper():\r\n n += 1\r\n\r\nif n > m:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=str(input())\r\nsmall=0\r\nlarge=0\r\nfor i in s:\r\n if(i.islower()):\r\n small += 1\r\n elif(i.isupper()):\r\n large += 1\r\nif small >= large:\r\n print(s.lower())\r\nelif small < large:\r\n print(s.upper())", "w = input()\r\nlower = w.lower()\r\ncount = 0\r\nfor i in range(len(w)):\r\n count = count + 1 if w[i] == lower[i] else count\r\nprint(lower if len(w)/2<=count else w.upper())", "w = input()\r\nuc = 0\r\nlc = 0\r\nfor i in w:\r\n if i.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\nif lc >= uc:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "word = input().strip()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in word:\r\n if i.isupper():\r\n upper_count+=1\r\n else:\r\n lower_count+=1\r\nif upper_count > lower_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n", "String = input()\r\nupper = 0\r\nlower = 0\r\nfor t in String:\r\n if t.isupper():\r\n upper+=1\r\n if t.islower():\r\n lower+=1\r\nif upper>lower:\r\n print(String.upper())\r\nelse:\r\n print(String.lower())", "x = 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\nif u <= l:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "\n\n\n\n\n\n\n\n\nw = input()\n\nupc = sum([1 if c.isupper() else 0 for c in w])\nlwc = sum([1 if c.islower() else 0 for c in w])\n\n\nif upc <= lwc :\n print(w.lower())\nelse :\n print(w.upper())\n\n \t\t\t\t \t \t \t\t \t\t\t\t \t \t", "x = input()\r\ny = list(x)\r\nupper = []\r\nlower = []\r\nlist1 = []\r\nfor i in y:\r\n if ord(i) < 91:\r\n upper.append(i)\r\n else:\r\n lower.append(i)\r\nif len(upper)> len(lower):\r\n print(x.upper())\r\nelif len(upper) < len(lower):\r\n print(x.lower())\r\nelse:\r\n print(x.lower())\r\n", "# Read the input word\r\ns = input()\r\n\r\n# Initialize counters for uppercase and lowercase letters\r\nupper_count = 0\r\nlower_count = 0\r\n\r\n# Count uppercase and lowercase letters in the word\r\nfor char in s:\r\n if char.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\n# Based on the counts, convert the word to appropriate case\r\nif upper_count > lower_count:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\n# Print the result\r\nprint(s)\r\n", "s = input();print([s.lower(), s.upper()][sum(int(i.isupper()) for i in list(s)) * 2 > len(s)])", "a=list(input())\nc=0\nd=0\nfor i in range(len(a)):\n if a[i]==a[i].lower():\n c+=1\n else:\n d+=1\nif c>=d:\n for i in range(len(a)):\n print(a[i].lower(),end=\"\")\nelse:\n for i in range(len(a)):\n print(a[i].upper(), end=\"\")\n\t \t\t \t \t \t \t\t\t\t", "s = str(input())\r\ntext = list(s)\r\nc = 0\r\nfor i in text:\r\n if i.islower():\r\n c +=1\r\n else:\r\n c -=1\r\nif c>=0:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nuc=sum(1 for c in s if c.isupper())\r\nlc=len(s)-uc\r\nif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "inp=input()\r\n\r\n\r\ncount=0\r\nlength=len(inp)\r\n\r\nfor i in inp:\r\n if(ord(i)>=97):\r\n count+=1\r\n\r\n\r\nif(length-count>count):\r\n print(inp.upper())\r\nelse:\r\n print(inp.lower()) ", "word = list(input())\r\nup , lo = 0,0\r\nnewword = ''\r\nfor ch in word:\r\n if ord('a') <= ord(ch) <= ord('z'):\r\n lo +=1\r\n else:\r\n up +=1\r\nif up > lo:\r\n for ch in word:\r\n newword += ch.upper()\r\nelse:\r\n for ch in word:\r\n newword += ch.lower()\r\nprint(newword)", "s = input()\nl_count = 0\nu_count = 0\nfor i in range(len(s)):\n\tif s[i] == s[i].lower():\n\t\tl_count += 1\n\telse:\n\t\tu_count += 1\n\nif l_count > u_count or l_count == u_count:\n\ts = s.lower()\n\tprint(s)\nif l_count<u_count:\n\ts = s.upper()\n\tprint(s)\n", "s=str(input())\r\nc=0\r\na=0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n a+=1\r\nif c>a:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s) \r\n ", "x = input()\r\nl = 0\r\nu = 0\r\nfor i in x:\r\n if i.isupper() == True:\r\n u = 1 + u\r\n elif i.islower() == True:\r\n l = l + 1\r\nif u > l :\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\nprint(x)", "string=input()\r\ncountu=0\r\ncountl=0\r\nfor i in string:\r\n if(i.isupper()):\r\n countu+=1\r\n else:\r\n countl+=1\r\n\r\nif(countu>countl):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "str=input()\r\nc1=0\r\nc2=0\r\nfor i in str:\r\n if(i.isupper()):\r\n c1=c1+1\r\n elif(i.islower()):\r\n c2=c2+1\r\nres1=str.upper()\r\nres2=str.lower()\r\nif(c1>c2):\r\n print(res1)\r\nelif(c1==c2):\r\n print(res2)\r\nelse:\r\n print(res2)", "#59A: word\r\na=input()\r\na1=a.lower()\r\ncount=0\r\nfor i in range(len(a)):\r\n if a[i]==a1[i]:\r\n count+=1\r\nif count>=(len(a)/2):\r\n print(a1)\r\nelse:\r\n print(a.upper())", "S=input()\r\ncount1,count2=0,0\r\nfor i in S: \r\n if i.islower(): count1+=1\r\n else : count2+=1\r\nif count1>=count2:\r\n print(S.lower())\r\nelse:print(S.upper())", "U = 0\r\nL = 0\r\ns = input()\r\nfor i in s:\r\n if i.isupper() == True:\r\n U += 1\r\n elif i.islower() == True:\r\n L += 1\r\nif U > L:\r\n print(s.upper())\r\nelif U <= L:\r\n print(s.lower())", "s=input()\r\nCL=0\r\nLC=0\r\nfor i in s:\r\n if i == i.upper():\r\n CL+=1\r\n else:\r\n LC+=1\r\nif CL>LC:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "\r\n\r\n\r\ndef i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\nt = s()\r\nu = 0\r\nd = 0\r\n\r\nfor c in t:\r\n if c.isupper():\r\n u += 1\r\n else:\r\n d += 1\r\nif d >= u:\r\n print(t.lower())\r\nelse:\r\n print(t.upper())", "b=str(input())\r\nt=list(str(b))\r\nn=0\r\nm=0\r\n\r\nfor i in range(0,len(t)):\r\n if(str(t[i]).upper()==str(t[i])):\r\n m=m+1\r\n if(str(t[i]).lower()==str(t[i])):\r\n n=n+1\r\n\r\nif(m>n):\r\n print(b.upper())\r\nif(m<=n):\r\n print(b.lower())\r\n\r\n\r\n", "word = input()\r\nlc = uc = 0\r\nfor letter in word:\r\n if letter.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\nprint((word.lower(), word.upper())[lc < uc])", "s = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(0, len(s)):\r\n if s[i].isupper():\r\n count1 = count1 + 1\r\n else:\r\n count2 = count2 + 1\r\n\r\nif count1>count2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = str(input())\r\ncountupper = 0\r\ncountlower = 0\r\nfor i in s:\r\n if i.isupper():\r\n countupper += 1\r\n else:\r\n countlower += 1\r\nif countupper > countlower:\r\n print(s.upper())\r\nelif countlower > countupper or countupper == countlower:\r\n print(s.lower())", "a = input()\r\nl = 0\r\nu = 0\r\nfor i in range(len(a)):\r\n if (int(ord(a[i]))>=97 and int(ord(a[i]))<=122):\r\n l+=1\r\n if (int(ord(a[i]))>=65 and int(ord(a[i]))<=90):\r\n u+=1\r\nif(l>u):\r\n b = a.lower()\r\n print(b)\r\nif(u>l):\r\n b = a.upper()\r\n print(b)\r\nif(u==l):\r\n b = a.lower()\r\n print(b)", "s = input()\r\nup,low =0,0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up+=1\r\n if s[i].islower():\r\n low+=1\r\n\r\nif up <= low:\r\n print(s.lower())\r\nif up > low:\r\n print(s.upper())", "w = input()\r\nlc = uc = 0\r\nfor c in w:\r\n if c == c.lower():\r\n lc += 1\r\n else:\r\n uc += 1\r\nif lc >= uc:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "string = input()\r\n\r\ndef str_converter(string):\r\n upper = [i for i in string if i.isupper()]\r\n lower = [i for i in string if i.islower()]\r\n if len(lower) >= len(upper):\r\n return ''.join([i.lower() for i in string])\r\n else:\r\n return ''.join([i.upper() for i in string])\r\n\r\n\r\nprint(str_converter(string))", "word = input()\n\nlower_count = sum([1 for char in word if char.islower()])\nupper_count = sum([1 for char in word if char.isupper()])\n\nif lower_count >= upper_count:\n print(word.lower())\nelse:\n print(word.upper())\n", "x=input()\r\nupper,lower=0,0\r\nfor i in range(0,len(x)):\r\n if x[i].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper<=lower:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "def Count(str): \r\n upper, lower, number, special = 0, 0, 0, 0\r\n for i in range(len(str)): \r\n if str[i].isupper(): \r\n upper += 1\r\n elif str[i].islower(): \r\n lower += 1\r\n if (upper>lower):\r\n str=str.upper()\r\n print(str)\r\n else:\r\n print(str.lower())\r\nstr =input()\r\nCount(str) \r\n", "word = input()\r\nlower_counter = 0\r\nupper_counter = 0\r\n\r\nfor letter in word:\r\n if letter.islower():\r\n lower_counter += 1\r\n else:\r\n upper_counter += 1\r\n\r\nif upper_counter > lower_counter:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "def change(str):\r\n count1=0\r\n count2=0\r\n for i in range(0,len(str)):\r\n if str[i].islower():\r\n count1+=1\r\n else:\r\n count2+=1\r\n if count1>=count2:\r\n str1=str.lower()\r\n return str1\r\n else:\r\n str2=str.upper()\r\n return str2\r\n\r\na=input()\r\nchar=change(a)\r\nprint(char)\r\n", "n=input()\r\nlow=0\r\nhigh=0\r\nfor i in n:\r\n if i.islower():\r\n low+=1\r\n elif i.isupper():\r\n high+=1\r\n\r\nif low>high:\r\n print(n.lower())\r\nelif high>low:\r\n print(n.upper())\r\nelif low == high:\r\n print(n.lower())", "sl = input()\r\niloscm = 0\r\niloscd = 0\r\nfor i in sl:\r\n if i.islower():\r\n iloscm += 1\r\n if i.isupper():\r\n iloscd += 1\r\nif iloscm >= iloscd:\r\n print(sl.lower())\r\nelse:\r\n print(sl.upper())", "a=input('')\r\nx=['q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m']\r\ny=['Q','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M']\r\nt=[]\r\nk=[]\r\nz=0\r\nl=0\r\nc=[]\r\np=0\r\nv=0\r\nfor i in range(len(a)):\r\n if(a[p] in x):\r\n t.append(a[p])\r\n elif(a[p] in y):\r\n k.append(a[p])\r\n p=p+1\r\nif(len(k)<len(t)):\r\n for j in range(len(a)):\r\n if(a[z] in y):\r\n l=0\r\n for kl in range(len(y)):\r\n if(a[z]==y[l]):\r\n c.append(x[l])\r\n break\r\n else:\r\n l=l+1\r\n else:\r\n c.append(a[z])\r\n z=z+1\r\nelif(len(k)>len(t)):\r\n for jt in range(len(a)): \r\n if(a[z] in x):\r\n l=0\r\n for klq in range(len(y)):\r\n if(a[z]==x[l]):\r\n c.append(y[l])\r\n break\r\n else:\r\n l=l+1\r\n else:\r\n c.append(a[z])\r\n z=z+1\r\nelif(len(k)==len(t)):\r\n for jp in range(len(a)):\r\n if(a[z] in y):\r\n l=0\r\n for kl in range(len(y)):\r\n if(a[z]==y[l]):\r\n c.append(x[l])\r\n break\r\n else:\r\n l=l+1\r\n else:\r\n c.append(a[z])\r\n z=z+1\r\nfor kjh in range(len(c)):\r\n print(c[v],end='')\r\n v=v+1\r\n\r\n \r\n", "word = input()\nuppercase = 0\nlowercase = 0\nfor letter in word :\n if letter == letter.upper() :\n uppercase += 1\n else :\n lowercase += 1\n\nif uppercase > lowercase :\n print(word.upper())\nelse :\n print( word.lower() )", "st = input();\nlower = 0;\nupper = 0;\n\nfor char in st:\n if ord(char) >= 97 and ord(char) <= 122:\n lower += 1;\n else:\n upper += 1;\n\nif lower >= upper:\n print(st.lower());\nelse:\n print(st.upper());", "r=input()\nd1=0\nd2=0\nif(len(r)>=1 and len(r)<=100):\n for j in r:\n if(j.islower()):\n d1=d1+1\n elif(j.isupper()):\n d2=d2+1\n #print(d1)\n #print(d2)\n if(d1>d2):\n print(r.lower())\n elif(d1<d2):\n print(r.upper())\n else:\n print(r.lower())\n \t \t \t\t \t\t \t\t \t\t \t \t\t \t\t", "d=input()\r\nka=0\r\nfor i in range(len(d)):\r\n if d[i].islower():\r\n ka=ka+1\r\nif (ka<len(d)-ka):\r\n print(d.upper())\r\nelse:\r\n print(d.lower())", "#getting the string from the user.\r\ns=input()\r\n\r\n#flag for lower cases\r\nlw=0\r\n\r\n#flag for upper\r\nup=0\r\n#chekcing how many lower cases in the string\r\nfor i in range(len(s)):\r\n if s[i]==s[i].lower():\r\n lw+=1\r\n up=len(s)-lw\r\n #setting the conditions\r\nif lw>=up:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)\r\n", "n = input()\np = sum(1 for i in n if ord(i)>96)\nif p >= (len(n) + 1) // 2:\n print (n.lower())\nelse:\n print (n.upper())\n", "def word(s : str): \r\n \r\n Upper = len([i for i in s if i.isupper()])\r\n lower = len([i for i in s if i.islower()])\r\n \r\n if lower > Upper: \r\n s = s.lower()\r\n elif lower < Upper : \r\n s = s.upper()\r\n else : \r\n s = s.lower()\r\n \r\n return s\r\n \r\nprint(word(input()))", "#nice problem almost finished https://codeforces.com/contest/771/problem/A\r\n\r\n_str = input()\r\n_str_lower = _str.lower()\r\n_str_upper = _str.upper()\r\n\r\n_str_l = list(map(ord, _str))\r\n_str_lower = list(map(ord, _str_lower))\r\n_str_upper = list(map(ord, _str_upper))\r\n\r\ntotal = 0\r\nfor i in range(len(_str_lower)):\r\n if _str_l[i] == _str_lower[i]:\r\n total += 1\r\nif total >= len(_str_l)/2:\r\n print(_str.lower())\r\nelse:\r\n print(_str.upper())", "n=input()\r\nl=['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\nc=0\r\nc1=0\r\nfor i in n:\r\n if i in l:\r\n c=c+1 \r\n else:\r\n c1=c1+1 \r\nif(c>c1 or c==c1):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "a=input()\r\nc=0\r\nc1=len(a)\r\nfor i in a:\r\n if i.isupper():\r\n c+=1\r\nw=c1-c \r\nif c == w:\r\n print ( a.lower())\r\nelif c > w:\r\n print (a.upper())\r\nelif c < w:\r\n print (a.lower())", "s = input()\r\nup = 0\r\nfor elem in s :\r\n if elem.isupper() :\r\n up +=1\r\n\r\nlow = len(s) - up\r\n\r\nif up > low :\r\n s = s.upper()\r\nelse :\r\n s = s.lower()\r\n\r\nprint(s)", "import string\nword=input()\nlower=[]\nupp=[]\nmin=0\nmay=0\nletrasMinusculas= string.ascii_lowercase\nfor i in range(len(letrasMinusculas)):\n lower.append(letrasMinusculas[i])\n \nletrasMay=string.ascii_uppercase\nfor i in range(len(letrasMay)):\n upp.append(letrasMay[i])\n\nfor i in range(len(word)):\n if (word[i]) in set(lower):\n min+=1\n else:\n may+=1\n\nif(min>may):\n print(word.lower())\nelif (min<may):\n print(word.upper())\nelse:\n print(word.lower()) \n \t\t\t\t \t\t\t \t\t\t \t\t\t\t\t\t \t\t", "word = input()\r\n\r\ncountlow = 0\r\ncountupp = 0\r\nfor i in word:\r\n if i.islower():\r\n countlow += 1\r\n if i.isupper():\r\n countupp += 1\r\n\r\nif countlow >= countupp:\r\n print(word.lower())\r\n\r\n\r\nif countupp > countlow:\r\n print(word.upper())", "word = str(input())\r\nucount = sum(1 for letter in word if letter.isupper())\r\nlcount = sum(1 for letter in word if letter.islower())\r\nif ucount > lcount:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)", "word = input()\r\nlist_word = list(word)\r\nlist_word.sort()\r\nuppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nlist_uppercase = list(uppercase)\r\nlowercase = \"abcdefghijklmnopqrstuvwxyz\"\r\nlist_lowercase = list(lowercase)\r\nuppercase_number = 0\r\nlowercase_number = 0\r\nfor x in list_word:\r\n if list_uppercase.count(x) == 1:\r\n uppercase_number += 1\r\n elif list_lowercase.count(x) == 1:\r\n lowercase_number += 1\r\nif uppercase_number > lowercase_number:\r\n final = word.upper()\r\nelif uppercase_number < lowercase_number:\r\n final = word.lower()\r\nelif uppercase_number == lowercase_number:\r\n final = word.lower()\r\nprint(final)\r\n", "s = input()\r\na = 0\r\nb = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n a += 1\r\n else:\r\n b += 1\r\nif a >= b:\r\n t = s.lower()\r\nelse:\r\n t = s.upper()\r\nprint(t)", "def change(text):\r\n upper = 0\r\n lower = 0\r\n for i in text:\r\n if i == i.upper():\r\n upper +=1\r\n else:\r\n lower +=1\r\n return text.upper() if upper > lower else text.lower()\r\ns = input()\r\nprint(change(s))\r\n", "s=str(input())\r\nlow=0\r\nupp=0\r\n\r\nfor i in range(len(s)):\r\n if(s[i]>='a' and s[i]<='z'):\r\n low+=1\r\n\r\n \r\n elif(s[i]>='A' and s[i]<='Z'):\r\n upp+=1\r\n\r\nif low>=upp:\r\n print(s.lower())\r\n\r\nelif low<upp:\r\n print(s.upper())\r\n", "s=input()\r\nu=l=0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\na=\"\"\r\nif u>l:\r\n a=s.upper()\r\nelse:\r\n a=s.lower()\r\nprint(a)", "n=input()\nc=0\nfor i in n:\n if i.islower():\n c+=1\nif c>=len(n)-c:\n print(n.lower())\nelse:\n print(n.upper())\n", "s=input()\r\nlower=0\r\nupper=0\r\nfor i in s:\r\n if i.isupper():\r\n upper=upper+1\r\n else:\r\n lower=lower+1\r\nif upper>lower:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "slovo = list(input())\r\nBol = 0\r\ndlinna = len(slovo)\r\nrez = ''\r\nfor i in slovo:\r\n if i.isupper():\r\n Bol += 1\r\nMal = dlinna - Bol\r\nfor i in slovo:\r\n rez += i\r\nif Mal >= Bol:\r\n print(rez.lower())\r\nelse:\r\n print(rez.upper())", "phrase= (input())\r\ndef string_test(s):\r\n a=0\r\n b=0\r\n for c in s:\r\n if c.isupper():\r\n a+=1\r\n elif c.islower():\r\n b+=1\r\n else:\r\n pass\r\n if a>b:\r\n print (s.upper())\r\n else:\r\n print (s.lower())\r\nstring_test(phrase)\r\n", "word = input()\nif sum(map(str.islower, word)) < sum(map(str.isupper, word)):\n print(word.upper())\nelse:\n print(word.lower())", "word = input()\r\ndown = 0\r\nup = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n down += 1\r\n\r\nif down > up:\r\n print(word.lower())\r\nelif up > down:\r\n print(word.upper())\r\nelif down == up:\r\n print(word.lower())\r\n ", "s = input()\r\nlow = 0\r\nfor c in s:\r\n if c == c.lower():\r\n low += 1\r\nif low >= len(s) / 2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word=str(input())\r\ncountu=0\r\ncountl=0\r\nfor i in range(len(word)):\r\n if(word[i].isupper()):\r\n countu+=1\r\n else:\r\n countl+=1\r\nif(countu>countl):\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)\r\n \r\n", "s = input()\r\nup = 0\r\nlow = 0\r\nfor i in s:\r\n if i.islower():\r\n low+=1\r\n else:\r\n up+=1\r\nif up>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\n\r\nupper_c = 0\r\nlower_c = 0\r\n\r\n\r\nfor i in s:\r\n if i.isupper():\r\n upper_c += 1\r\n if i.islower():\r\n lower_c += 1\r\n\r\nif upper_c > lower_c:\r\n print (s.upper())\r\nelif upper_c < lower_c:\r\n print (s.lower())\r\nelse:\r\n print(s.lower())\r\n\r\n", "s=input()\r\nn=len(s)\r\ncl=0\r\nfor i in range(0,n):\r\n if(ord(s[i])>=97 and ord(s[i])<=122):\r\n cl+=1 \r\ncu=n-cl\r\nif(cl>=cu):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=input()\r\np=0\r\nfor x in a:\r\n if 'a'<=x<='z':\r\n p+=1\r\nk=len(a)-p\r\nif k>p:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nindex=len(s)\r\nupper=0\r\nlower=0\r\nfor i in s:\r\n if i.isupper():\r\n upper +=1\r\n else:\r\n lower +=1\r\nif upper>lower:\r\n print(s.upper())\r\nelif lower>upper:\r\n print(s.lower())\r\nelif upper==lower:\r\n print(s.lower())\r\n\r\n\r\n", "\r\n\r\ndef main():\r\n\tword = input()\r\n\r\n\tcnt = 0\r\n\tfor char in word:\r\n\t\tif char.isupper():\r\n\t\t\tcnt += 1\r\n\r\n\tif cnt/len(word) > 0.5:\r\n\t\tprint(word.upper())\r\n\telse:\r\n\t\tprint(word.lower())\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "s = input()\r\nls = s.lower()\r\nus = s.upper()\r\ni = 0\r\ncont = 0\r\nwhile i<len(s):\r\n if s[i]!=ls[i]:\r\n cont+=1\r\n i += 1\r\n\r\nif cont>len(s)/2:\r\n print(us)\r\nelse:\r\n print(ls)", "str=input()\r\ns=list(str)\r\nlower=0\r\nupper=0\r\nfor i in s:\r\n if (ord(i)>=ord('a') and ord(i)<=ord('z')):\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper>lower:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())\r\n", "s=input()\r\n#s=list(s)\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n l=l+1\r\n else:\r\n u=u+1\r\n#s=str(s)\r\nif l>=u:\r\n print((s).lower())\r\nelse:\r\n print((s).upper())\r\n ", "word = input()\r\ndiff = 0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n diff += 1\r\n else:\r\n diff -= 1\r\n\r\nprint(word.upper() if diff > 0 else word.lower())", "s = input()\r\nx = 0\r\ny = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n x += 1\r\n elif s[i].islower():\r\n y += 1\r\nif x > y:\r\n print(s.upper())\r\nelse:\r\n y > x\r\n print(s.lower())", "input_string = input()\nup, low = 0, 0\n\nfor i, elem in enumerate(input_string):\n if elem.isupper():\n up += 1\n elif elem.islower():\n low += 1\n\nif up > low:\n print(input_string.upper())\nelif up <= low:\n print(input_string.lower())\n", "s=input()\r\nu='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nlc=0\r\nuc=0\r\nfor i in s:\r\n if i in u:\r\n uc=uc+1\r\n else:\r\n lc=lc+1\r\nif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nc1=0\r\nc2=0\r\nl1=['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\nl2=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\nfor i in s:\r\n if i in l1:\r\n c1=c1+1\r\n elif i in l2:\r\n c2=c2+1\r\nif c1>=c2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=input()\r\nn=0\r\nt=0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n n=n+1\r\n else:\r\n t=t+1\r\nif n>=t:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n ", "s = str(input())\r\nk = 0\r\nm = 0\r\nfor i in range(0, len(s)):\r\n if 'A' <= s[i] <= 'Z':\r\n k += 1\r\n if 'a' <= s[i] <= 'z':\r\n m += 1\r\nif k > m:\r\n print(s.upper())\r\nif k <= m:\r\n print(s.lower())", "s=input()\r\na=0\r\nb=0\r\nfor x in range(len(s)):\r\n\tif 65<=ord(s[x])<=90:\r\n\t\ta+=1\r\n\telse:b+=1\r\nif a>b:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "#!/usr/bin/env python\r\n\r\n\r\ntext = input()\r\nu, l = 0, 0\r\n\r\nfor i in text:\r\n if i.islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif u == l:\r\n res = text.lower()\r\nelif u > l:\r\n res = text.upper()\r\nelse:\r\n res = text.lower()\r\n\r\nprint(res)", "w=input()\r\nsum_l=0\r\nsum_u=0\r\nfor i in w:\r\n if i.islower():\r\n c=1\r\n sum_l=sum_l+c\r\n else:\r\n c=1\r\n sum_u=sum_u+c\r\nif sum_l>sum_u:\r\n w=w.lower()\r\nif sum_l<sum_u:\r\n w=w.upper()\r\nelse:\r\n w=w.lower()\r\nprint(w)\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n", "w=input()\r\na=0\r\nb=0\r\nfor i in w:\r\n if i.islower():\r\n a=a+1\r\n elif i.isupper():\r\n b=b+1\r\nif a >=b:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "def process():\r\n word = input()\r\n \r\n upper = 0\r\n lower = 0\r\n \r\n for w in word:\r\n if 'a' <= w <= 'z':\r\n lower += 1\r\n else:\r\n upper += 1\r\n \r\n if lower >= upper:\r\n print(word.lower())\r\n else:\r\n print(word.upper())\r\n\r\nprocess()", "w=input()\r\nn=0\r\nfor x in w :\r\n if 'a'<=x<='z':\r\n n+=1\r\nif n>=len(w)-n:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "s = input()\r\n\r\ncap = 0\r\nlow = 0\r\nfor let in s :\r\n if let.islower():\r\n low += 1\r\n else :\r\n cap += 1\r\nif low >= cap:\r\n print(s.lower())\r\nelse :\r\n print(s.upper())", "s = input(\"\")\r\n# A-Z: 65-97\r\n# a-z: 90-122\r\n\r\nupper = 0;\r\nlower = 0;\r\n\r\nfor i in range(len(s)):\r\n\tif ord(s[i]) >= 65 and ord(s[i]) <= 90:\r\n\t\tupper = upper + 1;\r\n\telse: \r\n\t\tlower = lower + 1;\r\nif upper > lower:\r\n\tprint(s.upper());\r\nelif upper < lower:\r\n\tprint(s.lower());\r\nelse:\r\n\tprint(s.lower());\r\n\r\n", "word = input()\r\nlower = 0\r\nupper = 0\r\nfor c in word:\r\n lower += c.islower()\r\n upper += c.isupper()\r\n\r\nif upper > lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = str(input())\r\na=0\r\nb=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n a=a+1\r\n else:\r\n b=b+1\r\n \r\nif b>a:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a=input()\r\nc=0\r\nc1=0\r\nfor i in a:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n c1+=1\r\nif c>c1:\r\n d=a.upper()\r\n print(d)\r\nelif c1>=c:\r\n d=a.lower()\r\n print(d)\r\n", "s = input()\r\nupper = 0\r\nlower = 0\r\nfor i in (s):\r\n if (i.islower()):\r\n lower = lower+1\r\n elif (i.isupper()):\r\n upper = upper+1\r\nif(upper>lower):\r\n print( s.upper())\r\nelif(lower>upper):\r\n print( s.lower())\r\nelif(lower==upper):\r\n print(s.lower())", "def f(s):\r\n upp = 0\r\n for i in range(len(s)):\r\n if(s[i].isupper()):\r\n upp += 1\r\n if(upp > len(s) - upp):\r\n print(s.upper(), end = '')\r\n else:\r\n print(s.lower(), end = '')\r\n\r\ns = input()\r\nf(s)", "a=input()\r\nls1=[]\r\nls2=[]\r\nfor i in a:\r\n if i==i.upper():\r\n ls1.append(i)\r\n elif i==i.lower():\r\n ls2.append(i)\r\nif len(ls1)>len(ls2):\r\n print(a.upper())\r\nelif len(ls1)<len(ls2):\r\n print(a.lower())\r\nelse:\r\n print(a.lower())", "class Word:\r\n def solution(self, s: str) -> str:\r\n # If number of upper chars is greater than half the length of string,\r\n # it should return an uppercase string\r\n if sum(1 for chr in s if chr.isupper()) > len(s) // 2:\r\n return s.upper()\r\n return s.lower()\r\n\r\n# Init\r\nw = Word()\r\n\r\n# Input String\r\ns = input()\r\n\r\nprint(w.solution(s))", "# your code goes here\nimport sys \n\ninp = sys.stdin\nout = sys.stdout \n\ns = inp.readline().strip()\nlow,up = 0,0\nfor i in s:\n\tif(i.islower()):\n\t\tlow+=1\n\telse:\n\t\tup+=1\n\t\nif(low < up):\n\tout.write(s.upper())\nelse: \n\tout.write(s.lower())\n\t\t \t\t\t \t \t\t \t \t \t \t \t \t", "s = input()\r\nlcount = 0\r\nucount = 0\r\nfor i in range(len(s)):\r\n if s[i]>='A' and s[i]<='Z':\r\n ucount += 1\r\n else:\r\n lcount += 1\r\nif lcount>=ucount:\r\n print(str.lower(s))\r\nelse:\r\n print(str.upper(s))", "n=input()\r\nlow=0\r\nhigh=0\r\nfor i in n:\r\n if i!=i.upper():\r\n low+=1\r\n else:\r\n high+=1\r\nif low>=high:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "n=input()\r\nup=[]\r\nlow=[]\r\nfor i in n:\r\n if i.isupper():\r\n up.append(i)\r\n else:\r\n low.append(i)\r\nif len(up)==len(low) or len(low)>len(up):\r\n print(n.lower())\r\nelse:\r\n if len(up)>len(low):\r\n print(n.upper())", "import re\r\ns = input()\r\nif len(re.findall(\"[A-Z]\", s)) > len(re.findall(\"[a-z]\", s)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\nl=list(n)\r\ncountu=0\r\ncountl=0\r\nfor i in l:\r\n if(i.isupper()):\r\n countu+=1\r\n elif(i.islower()):\r\n countl+=1\r\nif(countu>countl):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "strin=input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(strin)):\r\n #to lower case letter\r\n if(strin[i]>='a' and strin[i]<='z'):\r\n lower+=1\r\n #to upper case letter\r\n elif(strin[i]>='A' and strin[i]<='Z'):\r\n upper+=1\r\nif upper < lower:\r\n print (strin.lower())\r\nelif lower<upper:\r\n print (strin.upper())\r\nelse:\r\n print (strin.lower())", "s = input()\r\n\r\nupp=0\r\nlow=0\r\n\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n low+=1\r\n \r\n else:\r\n upp+=1\r\n\r\nif low>=upp:\r\n print(s.lower())\r\n \r\nelse:\r\n print(s.upper())", "str = input()\r\nup, low = 0,0\r\nfor i in range(len(str)):\r\n if str[i] == str[i].upper():\r\n up += 1\r\n else:\r\n low +=1\r\n\r\nif up > low:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "word = input()\r\nupp = 0\r\nlow = 0\r\nfor char in word:\r\n if char.isupper():\r\n upp += 1\r\n else:\r\n low += 1\r\nif(upp > low):\r\n cap = word.upper()\r\nelse:\r\n cap = word.lower()\r\nprint(cap)", "s = input()\r\ncountL=0\r\ncountU=0\r\nfor a in s:\r\n if (a.islower())==True:\r\n countL+=1\r\n elif (a.isupper())==True:\r\n countU+=1\r\nif countL>=countU:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nuppercase, lowercase = 0, 0\r\nfor ch in s:\r\n if ord(ch) in range(65, 92):\r\n uppercase += 1\r\n if ord(ch) in range(97, 124):\r\n lowercase += 1\r\n\r\nif uppercase > lowercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nsorted_s = sorted(s)\r\nif sorted_s[0] >= 'a' and sorted_s[0] <= 'z':\r\n print(s.lower())\r\nelif sorted(s, reverse=True)[0] >= 'A' and sorted(s, reverse=True)[0] <= 'Z':\r\n print(s.upper())\r\nelse:\r\n slen = len(s)\r\n uc = 0\r\n for i in sorted_s:\r\n if i >= 'A' and i <= 'Z':\r\n uc += 1\r\n else:\r\n if uc > slen - uc:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n break", "s=str(input())\r\nd={\"UPPER\":0, \"LOWER\":0}\r\nfor i in s:\r\n if i.isupper():\r\n d[\"UPPER\"]+=1\r\n elif i.islower():\r\n d[\"LOWER\"]+=1\r\n else:\r\n pass\r\nif d[\"UPPER\"]> d[\"LOWER\"]:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "\r\ns = input()\r\nl = 0\r\nb = 0\r\nfor i in range(len(s)):\r\n if \"A\" <= s[i] <= \"Z\":\r\n b += 1\r\n else:\r\n l += 1\r\n\r\nif b > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "word = input()\n\nnum_uppercase = sum(1 for c in word if c.isupper())\nnum_lowercase = len(word) - num_uppercase\n\nif num_uppercase > num_lowercase:\n converted_word = word.upper()\nelse:\n converted_word = word.lower()\n\nprint(converted_word)\n\n \t \t\t\t \t \t \t\t \t\t\t\t \t \t", "def correct_words(s):\r\n upper_count = 0\r\n lower_count = 0;\r\n for char in s:\r\n if char.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n if upper_count > lower_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\ns = input()\r\nresult = correct_words(s)\r\nprint(result)", "big = 0\r\nsmall = 0\r\na = input()\r\nfor i in a:\r\n if i.isupper():\r\n big += 1\r\n else:\r\n small += 1\r\nif big > small:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "x = input()\r\nupper_case = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nlower_case = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor ch in x:\r\n if ch in upper_case: count_upper +=1\r\n else : count_lower += 1\r\n\r\nprint(x.upper() if count_upper > count_lower else x.lower())\r\n", "s=input()\nu,l=0,0\nfor i in s:\n if i.isupper()==True:\n u+=1\n else:\n l+=1\nif u>l:\n print(s.upper())\nif u<=l:\n print(s.lower())\n\n ", "s=input()\r\ns1=s.lower()\r\ns2=s.upper()\r\nu=sum(1 for i in s if i.isupper())\r\nl=len(s) - u\r\nif l >= u:print(s1)\r\nelse:print(s2)", "s = input().strip()\r\nlower_case = 0\r\nupper_case = 0\r\nfor char in s:\r\n if ord('a') <= ord(char) <= ord('z'):\r\n lower_case += 1\r\n elif ord('A') <= ord(char) <= ord('Z'):\r\n upper_case += 1\r\n else:\r\n pass\r\nif upper_case > lower_case:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x = input()\r\nU = 0\r\nL = 0\r\nfor i in range(len(x)):\r\n if x[i].upper() == x[i]:\r\n U += 1\r\n elif x[i].lower() == x[i]:\r\n L +=1\r\n\r\nif L >= U:\r\n print(x.lower())\r\nelif L < U:\r\n print(x.upper())\r\n", "word = input()\nnew_word = \"\"\nup = 0\nlow = 0\nfor letter in word:\n if letter.upper() == letter:\n up +=1\n else:\n low += 1\nif low >= up:\n for letter in word:\n new_word += letter.lower()\nelse:\n for letter in word:\n new_word += letter.upper()\nprint(new_word)\n", "def Word(s):\r\n lc,uc=0,0\r\n for i in s:\r\n if i.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\n if uc>lc:\r\n return s.upper()\r\n return s.lower()\r\n \r\n\r\ns=input()\r\nprint(Word(s))\r\n", "s = input()\nc = 0\na = 0\nfor i in range(len(s)):\n if 'a' <= s[i] <= 'z':\n c += 1\n else:\n a += 1\nif c >= a:\n print(s.lower())\nelse:\n print(s.upper())\n", "import re\r\nword = input()\r\nuc, lc = 0,0\r\nfor ch in word:\r\n if ch.isupper(): uc+=1\r\n else: lc +=1\r\nif uc > lc:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nup=0\r\nlow=0\r\nfor i in s:\r\n if i==i.upper():\r\n up=up+1\r\n else:\r\n low=low+1\r\nif(up<=low):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = str(input())\nup = 0\ndown = 0\nfor i in range (len(s)):\n if s[i].isupper():\n up += 1\n else:\n down += 1\nif up > down:\n print(s.upper())\nif down > up or down == up:\n print(s.lower())", "s = input()\r\nup = 0 \r\nlw = 0 \r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up+=1 \r\n if s[i].islower():\r\n lw+=1 \r\nif up > lw:\r\n print(s.upper())\r\nelif up < lw:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s = input()\r\nuc = 0\r\nlc = 0\r\nfor x in s:\r\n if x.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\nif uc > lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "st=input()\r\nc1=0\r\nc2=0\r\nfor s in st:\r\n if (s.isupper())==True:\r\n c1+=1\r\n elif (s.islower())==True:\r\n c2+=1\r\nif c1==c2:\r\n print(st.lower())\r\nelif c1>c2:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "s=input()\r\nc=0\r\nsm=0\r\nfor i in range(len(s)):\r\n if(s[i]>=\"a\" and s[i]<=\"z\"):\r\n sm+=1\r\n else:\r\n c+=1\r\nif(c<=sm):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "st=input()\r\ncs,cu=0,0\r\nfor i in range(len(st)):\r\n if(st[i].islower()):\r\n cs+=1\r\n elif(st[i].isupper()):\r\n cu+=1\r\nif(cs>cu):\r\n print(st.lower())\r\nelif(cs<cu):\r\n print(st.upper())\r\nelif(cs==cu):\r\n print(st.lower())\r\n ", "s = input()\nu = 0\nl = 0\nfor c in s:\n if c <= 'Z':\n u += 1\n else:\n l += 1\nif u > l:\n print(s.upper())\nelse:\n print(s.lower())\n", "s=input()\r\nl=0\r\nu=0\r\nfor i in s:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(l>=u):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "strr = input()\r\ni, cl, cu = 0, 0, 0\r\n\r\nwhile i < len(strr):\r\n if (strr[i].lower() == strr[i]):\r\n cl += 1\r\n elif (strr[i].upper() == strr[i]):\r\n cu += 1\r\n i += 1\r\n\r\nif cl < cu:\r\n print(strr.upper())\r\nelse:\r\n print(strr.lower())\r\n", "a = input()\r\nc=0\r\ns = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n c+=1\r\n if a[i].islower():\r\n s+=1\r\n\r\nif c > s:\r\n a = a.upper()\r\nelif c < s:\r\n a = a.lower()\r\nelse:\r\n a = a.lower()\r\n\r\nprint(a)", "word = input()\r\nuppers = 0\r\n\r\nfor char in word:\r\n if char.isupper():\r\n uppers += 1\r\n\r\nif uppers > len(word) // 2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nn = 0\r\nfor c in s:\r\n n += 1 if ord(c)<97 else -1\r\nprint(s.upper() if n>0 else s.lower())", "st = str(input())\r\ny, z = (0, 0)\r\nfor x in st:\r\n if x.isupper():\r\n y += 1\r\n else:\r\n z += 1\r\nif y > z:\r\n st = st.upper()\r\nelse:\r\n st = st.lower()\r\nprint(st)\r\n", "import math\r\nw = input()\r\nx = len(w)\r\ni = 0\r\nl = 0\r\n\r\nwhile i < x:\r\n \r\n if w[i].islower():\r\n l += 1\r\n i += 1\r\n \r\nif l >= math.ceil(x / 2):\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "words = input()\r\nword = [*words]\r\nuc = 0\r\nlc = 0\r\nfor _ in range(len(word)):\r\n if word[_].isupper() == True:\r\n uc += 1\r\n else:\r\n lc += 1\r\n\r\nif uc > lc:\r\n print(words.upper())\r\nelse:\r\n print(words.lower())", "s = input()\r\nu = 0\r\nl = 0\r\nfor c in s:\r\n if 'a' <= c and 'z' >= c:\r\n l += 1\r\n else:\r\n u += 1\r\nprint(s.upper() if u > l else s.lower())\r\n", "a=input()\r\nb= list(a)\r\nnum=0\r\nfor i in range(len(b)):\r\n if (b[i].isupper()):\r\n num=num+1\r\n\r\nif (num>len(b)-num):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "a = input()\r\nb = 0\r\nm = 0\r\nfor i in a:\r\n if i >= 'a' and i <= 'z':\r\n m += 1\r\n else:\r\n b += 1\r\nif b > m:\r\n print(a.upper())\r\nelif m > b:\r\n print(a.lower())\r\nelse:\r\n print(a.lower())", "s = input()\r\nl, u = 0, 0\r\nfor letter in s:\r\n if(letter == letter.lower()):\r\n l += 1\r\n else:\r\n u += 1\r\nprint(s.lower() if l >= u else s.upper())\r\n", "r=input()\r\nf=0\r\nt=0\r\nfor i in r:\r\n if i.isupper():\r\n f+=1\r\n else:\r\n t+=1\r\nif t>=f:\r\n r=r.lower()\r\nelse:\r\n r=r.upper()\r\nprint(r)\r\n", "l=0\r\no=0;\r\nmessage=input()\r\nfor i in message:\r\n if(i.isupper()):\r\n o=o+1\r\n else :\r\n l=l+1\r\nif(o>l):\r\n print(message.upper())\r\nelse :\r\n print(message.lower())", "m=input()\r\nu=0\r\nl=0\r\nfor i in m:\r\n if(i.isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u<=l):\r\n print(m.lower())\r\nelse:\r\n print(m.upper())", "x = input()\r\nbig = 0\r\nsmall = 0\r\nfor i in x:\r\n if i.upper() == i:\r\n big += 1\r\n else:\r\n small += 1\r\nif big > small:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "mayus = 0\r\ns = input()\r\nfor i in s:\r\n #print(s[i])\r\n if i.isupper():\r\n mayus += 1\r\nx = len(s) - mayus * 2\r\nprint([s.lower(), s.upper()][x < 0])\r\n", "word = input()\r\nuc = 0\r\nlc = 0\r\nlength = len(word)\r\nfor i in word:\r\n if i == i.lower():\r\n lc += 1\r\n if i == i.upper():\r\n uc += 1\r\nif uc > lc:\r\n print(word.upper())\r\nif uc < lc:\r\n print(word.lower())\r\nif uc == lc:\r\n print(word.lower())\r\n", "word = str(input(\"\"))\r\nup = 0\r\nlow = 0\r\nfor i in word:\r\n if i.isupper() == True:\r\n up += 1\r\n elif i.islower() == True:\r\n low += 1\r\nif up > low :\r\n print(word.upper())\r\nelif up < low :\r\n print(word.lower())\r\nelif up == low:\r\n print(word.lower())\r\n", "given = input()\nuppercasels = ['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'] \nlowercasels = ['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']\nuppercount = 0\nlowercount = 0 \nfor i in given:\n if i in uppercasels:\n uppercount = uppercount + 1\n elif i in lowercasels:\n lowercount = lowercount + 1\n else:\n pass\nif uppercount>lowercount:\n var = given.upper()\nelif lowercount>uppercount:\n var = given.lower()\nelse:\n var = given.lower()\nprint(var) \n\n\n\n", "s=input()\r\nli=list(s)\r\nlower=0\r\nupper=0\r\nfor i in li:\r\n if ord(i)>=97 and ord(i)<=122:\r\n lower+=1\r\n if ord(i)>=65 and ord(i)<=90:\r\n upper+=1\r\nif lower>upper:\r\n print(s.lower())\r\nelif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nk = 0\r\nfor x in s:\r\n\tif x < \"a\":\r\n\t\tk += 1\r\nif k > len(s) / 2:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "word = input()\r\n\r\ndef upp(x):\r\n x = x.upper()\r\n return x\r\ndef low(x):\r\n x = x.lower()\r\n return x\r\n\r\ny=0\r\nz=0\r\n\r\n\r\nfor i in range(len(word)):\r\n if word[i].upper() == word[i]:\r\n y+=1\r\n else:\r\n z+=1\r\n\r\nif y>z :\r\n print(upp(word))\r\nelse :\r\n print(low(word))\r\n \r\n \r\n", "a,b=0,0\r\nw = input()\r\nfor i in w:\r\n if i.isupper():a += 1\r\n else:b += 1\r\nif a > b:print(w.upper())\r\nelse:print(w.lower())", "s = input()\n\nlowerC = sum(1 for char in s if char.islower())\nupperC = sum(1 for char in s if char.isupper())\n\nif lowerC == upperC:\n print(s.lower())\nelif lowerC > upperC:\n print(s.lower())\nelse:\n print(s.upper())\n", "st=input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(st)):\r\n if(st[i].islower()):\r\n count1=count1+1\r\ncount2=len(st)-count1\r\nif(count1>=count2):\r\n s=st.lower()\r\nelse:\r\n s=st.upper()\r\nprint(s)", "s = input()\r\nsum1 = sum([1 for x in s if x.isupper()])\r\nif(sum1 > len(s) // 2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input().strip()\r\nlower = [x for x in word if x.islower()]\r\nupper = [y for y in word if y.isupper()]\r\nnew_word = [word.lower() if len(lower) >= len(upper) else word.upper()]\r\nprint(*new_word)", "# import pandas as pd\r\n# import numpy as np\r\n# import sklearn\r\n# from sklearn import linear_model\r\n# from sklearn.utils import shuffle\r\n\r\n# data = pd.read_csv(\"student-mat.csv\", sep=\";\")\r\n# print(data.head())\r\n# data = data[[\"G1\", \"G2\", \"G3\", \"studytime\", \"failures\", \"absences\"]]\r\n\r\nstring=input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(string)):\r\n #to lower case letter\r\n if(string[i]>='a' and string[i]<='z'):\r\n lower+=1\r\n #to upper case letter\r\n elif(string[i]>='A' and string[i]<='Z'):\r\n upper+=1\r\n \r\nif upper == lower or upper < lower:\r\n\tprint(string.lower())\r\nelif upper > lower:\r\n\tprint(string.upper())", "n=input()\r\nlow=0\r\nupp=0\r\nfor i in n:\r\n if 97<=ord(i)<=122:low+=1\r\n else:upp+=1\r\nif upp>low:print(n.upper())\r\nelse:print(n.lower())\r\n", "word=input()\r\na=0#分别记为大小写字母个数#\r\nb=0\r\nfor letter in list(word):\r\n if letter==letter.upper():\r\n a+=1\r\n else:\r\n b+=1\r\nif a<=b:\r\n print(word.lower())\r\nelif a>b:\r\n print(word.upper())", "w = input()\r\nl = 0\r\nfor e in w:\r\n if e.islower():\r\n l+=1\r\nu = len(w)-l\r\nif u>l:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())\r\n", "a = input()\r\nlow = 0\r\nbig = 0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n low += 1\r\n else:\r\n big += 1\r\nif low >= big:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n \r\n \r\n ", "s = [str(i) for i in input()]\r\na = 0\r\nA = 0\r\nfor i in s:\r\n if 96 < ord(i):\r\n a += 1\r\n else:\r\n A += 1\r\nif A > a:\r\n print(''.join(s).upper())\r\nelse:\r\n print(''.join(s).lower())\r\n", "a=input()\r\ncount=0\r\ncount1=0\r\nfor i in a:\r\n if(i.islower()):\r\n count+=1\r\n elif(i.isupper()):\r\n count1+=1\r\nif(count>=count1):\r\n print(a.lower())\r\nelif(count1>count):\r\n print(a.upper())", "n=input()\r\nl=0\r\nu=0\r\nstr=\"\"\r\nfor i in n:\r\n if i.islower():\r\n l=l+1\r\n else:\r\n u=u+1\r\nif l>=u:\r\n for i in n:\r\n i=i.lower()\r\n str=str+i\r\nelse:\r\n for i in n:\r\n i=i.upper()\r\n str=str+i\r\nprint(str)", "x = input()\r\nlower = 0\r\nupper = 0\r\nfor i in x:\r\n if i.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\nif lower < upper:\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\nprint(x)", "s = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in s:\r\n if i == i.lower():\r\n lower += 1\r\n else:\r\n upper += 1\r\nif lower == upper or lower > upper:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)\r\n", "s = input() \r\ncount_u = 0\r\ncount_l = 0 \r\nfor char in s:\r\n if char.isupper():\r\n count_u += 1 \r\n else:\r\n count_l += 1\r\nif count_u > count_l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = str(input().strip())\n\ni = 0\nlower = 0\nupper = 0\nwhile i < len(word):\n if word[i].isupper():\n upper += 1\n else:\n lower += 1\n \n i += 1\n \nif upper > lower:\n print(word.upper())\nelse:\n print(word.lower())\n\n\t \t \t\t\t \t \t \t \t\t\t \t \t\t \t", "s = str(input())\r\nbig_letters = 0\r\nfor i in s:\r\n if 65 <= ord(i) <= 90:\r\n big_letters += 1\r\nsmall_letters = len(s) - big_letters\r\nif big_letters > small_letters:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nm = 0\r\nb = 0\r\nfor i in a:\r\n if i == i.lower():\r\n m += 1\r\n else:\r\n b += 1\r\nif m < b:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s = input()\r\ns_upper = s.upper()\r\ns_lower = s.lower()\r\ni = 0 \r\ncountup = 0\r\ncountdo = 0\r\nfor i in range(0,len(s)):\r\n if s[i] in s_upper:\r\n countup = countup+1\r\n else:\r\n countdo = countdo +1\r\nif countup>countdo:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "t=input()\r\nup=0\r\nlo=0\r\nif(len(t)<=100):\r\n for i in range (0,len(t),1):\r\n if(t[i]>='a' and t[i]<='z'):\r\n lo+=1\r\n else:\r\n up+=1\r\n if(lo==up):\r\n print(t.lower())\r\n elif(lo>up):\r\n print(t.lower())\r\n else:\r\n print(t.upper())\r\nelse:\r\n exit", "S=input()\r\nc=0\r\ns=0\r\nfor i in S:\r\n if ord(i)>=65 and ord(i)<=90:\r\n c+=1\r\n else:\r\n s+=1\r\nprint(S.upper() if c>s else S.lower())", "def webword(s):\r\n n=len(s)\r\n l=0\r\n for i in range(n):\r\n if s[i]>='a' and s[i]<='z':\r\n l=l+1\r\n u=n-l\r\n if u>l:\r\n return s.upper()\r\n return s.lower()\r\ns=input()\r\nprint(webword(s))", "s = input()\r\ncount_u = 0\r\ncount_l = 0\r\nfor i in range(len(s)):\r\n n = ord(s[i])\r\n if 65<= n <= 90:\r\n count_u += 1\r\n elif 97<=n <=122:\r\n count_l += 1\r\nif count_u == count_l:\r\n b = s.lower()\r\nelif count_l> count_u:\r\n b = s.lower()\r\nelif count_u> count_l:\r\n b = s.upper()\r\nprint(b)", "s=input()\r\nlc=0\r\nuc=0\r\nfor t in s:\r\n if t.isupper()==True:\r\n uc+=1\r\n elif t.islower()==True:\r\n lc+=1\r\nif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "x=input()\r\nk=0\r\nk1=0\r\nfor i in range(len(x)):\r\n\tif(x[i]>='A' and x[i]<='Z'):\r\n\t\tk=k+1\r\n\telse:\r\n\t\tk1=k1+1\r\nif(k1>=k):\r\n\tprint(x.lower())\r\nelse:\r\n\tprint(x.upper())\r\n\r\n", "a = input()\r\nlow, up = 0,0\r\n\r\nfor i in a:\r\n if i.islower():\r\n low+=1\r\n else:\r\n up+=1\r\n\r\nif low>= up:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n\r\n \r\n", "s = list(input())\nupper = 0\nfor i in s:\n if i.isupper():\n upper+=1\n\nif upper > len(s)/2:\n print(\"\".join(s).upper())\nelse:\n print(\"\".join(s).lower())", "x = input()\r\nlower = []\r\nupper = []\r\nfor i in x:\r\n if i.islower():\r\n lower.append(i)\r\n elif i.isupper():\r\n upper.append(i)\r\na = len(lower)\r\nb = len(upper)\r\nif a < b:\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\nprint(x) \r\n", "s=input()\r\nk=0\r\nfor i in s:\r\n if i.isupper():\r\n k=k+1\r\nif 2*k>len(s):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input().strip()\r\nu=0\r\nl=0\r\nfor letter in n:\r\n if letter.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n c=n.upper()\r\nelse:\r\n c=n.lower()\r\nprint(c)", "n=str(input())\r\ncount=0\r\ngount=0\r\nfor char in n:\r\n\tif char.isupper():\r\n\t\tcount+=1\r\n\telse:\r\n\t\tgount+=1\r\nif count>gount:\r\n\tp=n.upper()\r\nelif gount>count:\r\n\tp=n.lower()\r\nelse:\r\n\tp=n.lower()\r\nprint(p)", "s=input()\r\nx=0\r\ny=0\r\nfor i in s :\r\n if i.isupper()==True :\r\n x+=1\r\n \r\n elif i.islower()==True :\r\n y+=1\r\n \r\nif y>=x :\r\n print(s.lower())\r\nelse :\r\n print (s.upper())\r\n", "s = input()\n\nup = 0\nlow = 0\nfor c in s:\n\tif c.isupper():\n\t\tup +=1\n\telse:\n\t\tlow +=1\nif up > low:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())", "text=input()\r\nlc_count=0\r\nuc_count=0\r\nfor i in range(len(text)):\r\n if text[i].isupper():\r\n uc_count+=1\r\n elif text[i].islower():\r\n lc_count+=1\r\nif uc_count<lc_count:\r\n print(text.lower())\r\nelif uc_count>lc_count:\r\n print(text.upper())\r\nelse:\r\n print(text.lower())", "s = input()\r\nlc, uc = 0, 0\r\nfor i in s:\r\n if i.islower():\r\n lc += 1\r\n else:\r\n uc += 1\r\nif uc > lc :\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\nLword = []\r\nNOUc = 0\r\nNOLc = 0\r\nwordAC = \"\"\r\nfor i in word:\r\n if ord(i) <= 90:\r\n NOUc += 1\r\n else:\r\n NOLc += 1\r\nfor i in word:\r\n if NOUc > NOLc:\r\n if ord(i) <= 90:\r\n Lword.append(i)\r\n elif ord(i) > 90:\r\n Lword.append(chr(ord(i) - 32))\r\n else:\r\n if ord(i) > 90:\r\n Lword.append(i)\r\n elif ord(i) <= 90:\r\n Lword.append(chr(ord(i) + 32))\r\nfor i in Lword:\r\n wordAC = wordAC + i\r\nprint(wordAC)\r\n", "n,x,c=input(),0,0\r\nfor i in n:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n x+=1\r\nif c>x:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = input()\r\ncu = 0\r\ncl = 0\r\nl = []\r\nfor i in range(len(s)):\r\n l.append(s[i])\r\nfor i in range(len(l)):\r\n if l[i].isupper() == 1:\r\n cu += 1\r\n else:\r\n cl += 1\r\nif cu > cl:\r\n s = s.upper()\r\nelif cu <= cl:\r\n s = s.lower()\r\nprint(s)\r\n", "x=input()\r\nh=l=0\r\nfor i in x:\r\n if i.islower():l+=1\r\n else:h+=1\r\nif h>l:print(x.upper())\r\nelse:print(x.lower())", "n=input()\r\ncnt1=0\r\ncnt2=0\r\nfor i in n:\r\n if(i.isupper()):\r\n cnt1=cnt1+1\r\n else:\r\n cnt2=cnt2+1\r\nif(cnt1>cnt2):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "def solut():\r\n wor = input()\r\n lower = sum(1 for c in wor if c.islower())\r\n\r\n if lower >= len(wor) / 2:\r\n conversion= str.lower\r\n else:\r\n conversion= str.upper\r\n\r\n converted_wor = ''.join(conversion(c) for c in wor)\r\n print(converted_wor)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solut()", "S = input()\r\nU,L = 0,0\r\nfor i in S:\r\n if i.isupper():\r\n U+=1\r\n else:\r\n L+=1\r\nif U>L:\r\n print(S.upper())\r\nelse:\r\n print(S.lower())", "s = str(input())\r\nt = list(s)\r\ncount_lower = 0\r\ncount_upper = 0\r\nfor item in t:\r\n if item.isupper():\r\n count_upper +=1\r\n elif item.islower():\r\n count_lower +=1\r\nif count_lower>=count_upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nlcount, ucount = 0, 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 > lcount:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "m = input()\r\nk = list(m)\r\nup = 0\r\nlow = 0\r\nfor i in k:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif up > low:\r\n print(m.upper())\r\nelif low >= up:\r\n print(m.lower())\r\n", "count = 0\r\nupper = 0\r\nraw = input()\r\nword = list(raw)\r\n\r\nfor i in word:\r\n if i.islower():\r\n count = count + 1\r\nupper = len(word) - count\r\nif upper <= count:\r\n print(raw.lower())\r\nelse:\r\n print(raw.upper())\r\n\r\n\r\n\r\n\r\n\r\n", "a = input()\r\nupc = 0\r\nlowc = 0\r\nfor i in range(len(a)):\r\n if (a[i] == a[i].lower()):\r\n lowc+=1\r\n else:\r\n upc+=1\r\nif (upc > lowc):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "small = []\r\nalpha = 'a'\r\nfor i in range(0, 26): \r\n small.append(alpha) \r\n alpha = chr(ord(alpha) + 1) \r\n\r\ns = input()\r\nsm = 0\r\nfor i in s:\r\n if i in small:\r\n sm = sm + 1 \r\n else:\r\n sm = sm - 1\r\n\r\nif sm < 0:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nk = 0\r\nfor i in a:\r\n if i == i.lower():\r\n k += 1\r\nif k < len(a) - k:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "# https://codeforces.com/problemset/problem/59/A\r\n\r\ndef count_upper_lower(word) -> tuple:\r\n up = 0\r\n lo = 0\r\n for char in word:\r\n if ord(char) < 97:\r\n up += 1\r\n else:\r\n lo += 1\r\n \r\n return (up, lo)\r\n\r\n\r\nword = input()\r\nupper, lower = count_upper_lower(word)\r\nif upper > lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "s=str(input())\r\ncount=0\r\ncount1=0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n count=count+1\r\n else:\r\n count1=count1+1\r\nif(count>count1):\r\n print(s.upper())\r\nelif(count1>=count):\r\n print(s.lower())", "a = input()\r\nk= 0\r\nl= 0\r\n \r\nfor ch in a:\r\n if ch.isupper():\r\n k+= 1\r\n else:\r\n l+= 1\r\nif k>l:\r\n a = a.upper()\r\nelse: \r\n a = a.lower()\r\nprint(a)", "ch=input()\r\nlow=0\r\nup=0\r\nfor i in range(len(ch)):\r\n if ch[i]>=\"a\":\r\n low+=1\r\n else:\r\n up+=1\r\nif low>up:\r\n print(ch.lower())\r\nelif up>low:\r\n print(ch.upper())\r\nelse:\r\n print(ch.lower())\r\n ", "s = input()\r\nst = ''\r\nco = 0\r\nci = 0\r\nfor i in s:\r\n if (i.isupper()) == True:\r\n co += 1\r\n else:\r\n ci += 1\r\n \r\nif co <= ci:\r\n for i in s:\r\n if(i.isupper())== True:\r\n st += (i.lower())\r\n else:\r\n st += i\r\n \r\nelse:\r\n for i in s:\r\n if(i.islower()) == True:\r\n st += (i.upper())\r\n else:\r\n st += i\r\n \r\nprint(st)\r\n \r\n ", "s=input()\r\nl=len(s)\r\ncl=0\r\ncu=0\r\nfor i in range(l):\r\n if(s[i]>=\"a\" and s[i]<=\"z\"):\r\n \r\n cl+=1\r\n elif(s[i]>=\"A\" and s[i]<=\"Z\"):\r\n \r\n cu+=1\r\nif(cl>=cu):\r\n print(s.lower())\r\nelif(cl<cu):\r\n print(s.upper())\r\n ", "s = input()\r\ncap = 0\r\nnotcap = 0\r\nfor i in s:\r\n if i.isupper():\r\n cap+=1\r\n else:\r\n notcap+=1\r\nif cap>notcap:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\r\n \r\nif (sum(map(str.isupper,string))) > len(string) / 2:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "w = input()\r\n\r\nlower = 0\r\nfor letter in w:\r\n if letter.islower(): lower += 1\r\n\r\nprint(w.lower()) if lower >= len(w) / 2 else print(w.upper())\r\n", "n=input()\r\nlt=list(n)\r\nl=0\r\nu=0\r\nfor i in range(len(lt)):\r\n if lt[i].isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s = input()\r\ncount_upp = 0\r\ncount_low = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n count_upp+=1\r\n else:\r\n count_low+=1\r\n\r\nif int(count_upp)>int(count_low):\r\n print(s.upper())\r\nelif int(count_low)>int(count_upp):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "word = input().strip()\r\nuppercaseCount = 0\r\nfor letter in word:\r\n if letter.upper() == letter:\r\n uppercaseCount+=1\r\nif uppercaseCount > len(word) - uppercaseCount:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "w=input()\nc=0\nd=0\nfor x in w:\n if x.isupper():\n c+=1\n else:\n d+=1\nif c>d :\n w = w.upper()\nelse:\n w = w.lower()\nprint(w)", "t=input().strip()\r\nupp_count=sum(1 for c in t if c.isupper())\r\nif upp_count>len(t)/2:\r\n word=t.upper()\r\nelse:\r\n word=t.lower()\r\nprint(word)", "s = input()\r\nl = [int(x) for x in range(ord('a'),ord('z')+1)]\r\nl1 = [int(x) for x in range(ord('A'),ord('Z')+1)]\r\n\r\nc,cn=0,0\r\nfor i in s:\r\n \r\n if ord(i) in l:\r\n c += 1\r\n elif ord(i) in l1:\r\n cn += 1\r\nif c>=cn:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "word = input()\r\nupper_count = 0\r\nlower_count = 0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\nif upper_count == lower_count:\r\n print(word.lower())\r\nelif upper_count > lower_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "a=input()\r\nk=0\r\nc=0\r\ns=str()\r\nfor i in a:\r\n if i==i.upper():\r\n k=k+1\r\n else:\r\n c=c+1\r\nif k>c:\r\n for i in a:\r\n s=s+i.upper()\r\n print(s)\r\nelse:\r\n for i in a:\r\n s=s+i.lower()\r\n print(s)\r\n \r\n ", "word = input().strip()\n\n\nlower_count = 0\nupper_count = 0\n\nfor char in word:\n if char .islower():\n lower_count += 1\n else:\n upper_count += 1\nif upper_count > lower_count:\n print(word.upper())\nelse:\n print(word.lower())\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\nlow = 0\r\nhigh = 0\r\nfor c in s:\r\n if ord(c) >= ord('a'):\r\n low += 1\r\n else:\r\n high += 1\r\n \r\nif max(low, high) == low:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\nif(len([c for c in n if c.islower()])>=len([c for c in n if c.isupper()])):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "n,l,u = input(),0,0\r\nfor i in n:\r\n if i.islower():\r\n l=l+1\r\n else:\r\n u = u+1\r\nif l>u:\r\n print(n.lower())\r\nelif u>l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s = input()\nlow , high = 0 ,0\nfor i in range(len(s)):\n if s[i].islower() == False:\n high = high + 1\n else:\n low = low + 1\n \nif low >= high:\n s = s.lower()\n print(s)\nelse:\n s = s.upper()\n print(s)\n\n\n\t\t\t \t\t\t \t\t \t\t \t\t\t\t\t \t", "def split(s):\r\n return [char for char in s]\r\ns = input()\r\nlst = split(s)\r\na = 0\r\nb = 0\r\nfor i in range(0,len(lst)):\r\n if (lst[i].isupper()):\r\n a = a+1\r\n if (lst[i].islower()):\r\n b = b+1\r\nif (a>b):\r\n print(s.upper())\r\nelif (b>a):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nl = 0\r\nu = 0\r\n\r\nfor c in s:\r\n if c.islower():\r\n l += 1\r\n elif c.isupper():\r\n u += 1\r\n else:\r\n continue\r\n\r\ns = s.upper() if u > l else s.lower()\r\nprint(s)\r\n", "n = input()\r\nup = 0\r\nlow = 0\r\nfor i in n:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n up+=1\r\n else:\r\n low+=1\r\nif(low >= up):\r\n l = [x for x in n]\r\n ans = []\r\n for i in l:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n i = chr(ord(i)+32)\r\n ans.append(i)\r\n else:\r\n ans.append(i)\r\n s = \"\".join(ans)\r\n print(s)\r\nelse: # up>low\r\n l=[x for x in n]\r\n ans = []\r\n for i in l:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n i = chr(ord(i)-32)\r\n ans.append(i)\r\n else:\r\n ans.append(i)\r\n s = \"\".join(ans)\r\n print(s)", "d = \"abcdefghijklmnopqrstuvwxyz\"\r\nword = input(\"\")\r\nl = 0\r\nfor i in word:\r\n\tif i in d:\r\n\t\tl += 1\r\nif l >= len(word)/2:\r\n\tprint(word.lower())\r\nelse:\r\n\tprint(word.upper())", "s=input()\r\ncnt1,cnt2=0,0\r\nfor i in s:\r\n if i.isupper():\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\nif cnt1>cnt2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "from calendar import c\r\n\r\n\r\nif __name__=='__main__':\r\n str = input()\r\n count_upper = count_lower =0\r\n for x in str:\r\n if x.isupper():\r\n count_upper += 1\r\n elif x.islower():\r\n count_lower +=1\r\n if count_upper > count_lower:\r\n print(str.upper())\r\n elif count_lower > count_upper:\r\n print(str.lower())\r\n else:\r\n print(str.lower())", "inp = input()\r\ncount = 0\r\ncount1 = 0\r\nif len(inp) <= 100:\r\n for let in inp:\r\n if let.isupper():\r\n count = count + 1\r\n if let.islower():\r\n count1 = count1 + 1\r\n if count > count1:\r\n print(inp.upper())\r\n elif count1 > count:\r\n print(inp.lower())\r\n elif count == count1:\r\n print(inp.lower())\r\nelse:\r\n print(\"Range exceeded!\")\r\n", "s = input()\nuppercase = int()\nlowercase = int()\n\n\nfor l in s:\n\tif l.islower():\n\t\tlowercase += 1 \n\telse:\n\t\tuppercase += 1\n\n\nif uppercase > lowercase:\n\tprint(s.upper())\nelif uppercase == lowercase:\n\tprint(s.lower())\nelse:\n\tprint(s.lower())\n\n\n# print(s.upper() if uppercase > lowercase else s.lower()) \n", "a=input()\r\ns=0\r\nt=0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n s+=1 \r\n elif a[i].islower() :\r\n t+=1\r\nif s>t:\r\n print(a.upper())\r\nelse :\r\n print(a.lower()) ", "a = input()\r\nb = 0\r\nc = 0\r\nfor i in a:\r\n if i == i.upper():\r\n b+=1\r\n else:\r\n c+=1\r\n \r\nif b > c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nc1, c2 = 0, 0\r\nfor i in s:\r\n if(ord(i)>=97):\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif(c1>=c2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\nupper_counter = 0\r\nlower_counter = 0\r\nfor i in word:\r\n if(i.islower()):\r\n lower_counter += 1\r\n else:\r\n upper_counter += 1\r\nif lower_counter > upper_counter or lower_counter == upper_counter:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "n=list(input())\r\nup=0\r\nlowe=0\r\nk=''\r\nfor i in range(len(n)):\r\n if(n[i].isupper()):\r\n up+=1\r\n elif(n[i].islower()):\r\n lowe+=1\r\nif(up>lowe):\r\n k=''.join(n).lower().upper()\r\nelif(up==lowe):\r\n k=''.join(n).lower()\r\nelif(up<lowe):\r\n k=''.join(n).upper().lower()\r\nprint(k) \r\n", "def WordCase(s):\r\n upper_count = sum(1 for c in s if c.isupper())\r\n lower_count = len(s) - upper_count\r\n if upper_count > lower_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\nword = input().strip()\r\ncword = WordCase(word)\r\nprint(cword)\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\ndef transform_word(word):\r\n uppercase_count = 0\r\n lowercase_count = 0\r\n\r\n transformed_word = ''\r\n for char in word:\r\n if char.isupper():\r\n transformed_word += char.upper()\r\n uppercase_count += 1\r\n else:\r\n transformed_word += char.lower()\r\n lowercase_count += 1\r\n\r\n if uppercase_count > lowercase_count:\r\n transformed_word = transformed_word.upper()\r\n else:\r\n transformed_word = transformed_word.lower()\r\n\r\n return transformed_word\r\n\r\ndef main():\r\n word = sys.stdin.readline().strip()\r\n transformed_word = transform_word(word)\r\n print(transformed_word)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "word=input()\r\nl=0\r\nu=0\r\nfor i in range(len(word)):\r\n if(word[i].islower()):\r\n l+=1\r\n else:\r\n u+=1\r\nif(l>=u):\r\n h=word.lower()\r\nelse:\r\n h=word.upper()\r\nprint(h)", "n=input()\r\ncount_upper=0\r\ncount_lower=0\r\nfor i in n:\r\n if i.islower():\r\n count_lower+=1\r\n else:\r\n count_upper+=1\r\nif count_upper>count_lower:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s = input()\r\nuc = 0\r\nlc = 0\r\nfor ch in s:\r\n if ch.isupper():\r\n uc += 1\r\n else:\r\n lc += 1\r\n\r\nif uc <= lc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "#O(palabra)\npalabra = input()\nx,y=0,0\nfor i in palabra:\n if i.isupper():\n x+=1\n else:\n y+=1\nif x==y:\n print(palabra.lower())\nelif x>y:\n print(palabra.upper())\nelif x<y:\n print(palabra.lower())\n \t\t\t \t \t\t\t\t\t\t\t \t \t \t \t\t", "st = input()\n\nup = 0\nlo = 0\n\nfor i in st:\n if i.islower():\n lo+=1\n elif i.isupper():\n up+=1\n\nif up > lo:\n print(st.upper())\nelse:\n print(st.lower())", "\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n#inp = open(\"lepus.in\", \"r\"); input = inp.readline; out = open(\"lepus.out\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n \r\n \r\ndef solution():\r\n s = input()\r\n n = len(s)\r\n low = 0\r\n up = 0\r\n for i in range(n):\r\n if s[i] == s[i].lower(): low += 1\r\n else: up += 1\r\n if low<up: print(s.upper())\r\n else: print(s.lower())\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n#inp.close()\r\n#out.close()", "s=input()\r\ncountCapital=0\r\nfor i in s:\r\n if i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\" :\r\n countCapital+=1\r\n\r\nif (len(s)-countCapital)>countCapital or countCapital ==(len(s)/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n \r\n", "\r\nstr=input()\r\nupc=0\r\nloc=0\r\nfor i in range(0,len(str)):\r\n if(str[i].isupper()):\r\n upc=upc+1\r\n elif(str[i].islower()):\r\n loc=loc+1\r\nif(loc>=upc):\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "s=[ord(x) for x in input()]\r\ncap=0\r\nfor x in s:\r\n if x<91:\r\n cap+=1\r\nif cap>len(s)/2:\r\n for x in range(len(s)):\r\n if s[x]>91:\r\n s[x]-=32\r\nelse :\r\n for x in range(len(s)):\r\n if s[x]<91:\r\n s[x]+=32\r\nprint(\"\".join([chr(y) for y in s]))\r\n", "input = input()\nuppers = 0\nlowers = 0\nfor c in input:\n if c.isupper():\n uppers += 1\n else:\n lowers += 1\n\nif uppers > lowers:\n print(str.upper(input))\nelse:\n print(str.lower(input))\n", "def get_correct(s) :\r\n upper,lower = 0,0\r\n for char in s :\r\n if 97 <= ord(char) :\r\n lower += 1\r\n else :\r\n upper += 1\r\n res = ''\r\n if upper <= lower :\r\n for char in s :\r\n res += char.lower()\r\n else :\r\n for char in s :\r\n res += char.upper()\r\n return res\r\nword = input()\r\nprint(get_correct(word))", "word = input()\r\nupper = 0\r\nlower = 0\r\nfor x in word:\r\n if x.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)\r\n", "s = input()\r\nupper_count=0\r\nlower_count=0\r\n\r\nfor char in s:\r\n if char.isupper():\r\n upper_count+=1\r\n else: \r\n lower_count+=1\r\n\r\nif upper_count>lower_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "str=input()\r\ncountu=0\r\ncountl=0\r\nfor i in str:\r\n if(i.isupper()):\r\n countu=countu+1\r\n else:\r\n countl=countl+1\r\nif(countu>countl):\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 9 18:08:30 2021\r\n\r\n@author: Aspire\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nlow = 'abcdefghijklmnopqrstuvwxyz'\r\nhigh = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nl = 0\r\nh = 0\r\nfor i in range(0,len(s)):\r\n if s[i] in low:\r\n l = l + 1\r\n else:\r\n h = h + 1\r\nif l>=h:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "n=str(input())\r\nm=n.upper()\r\na=0\r\nb=0\r\nfor i in range(len(n)):\r\n if n[i]==m[i]:\r\n b=b+1\r\n else:\r\n a=a+1\r\nif b>a:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n \r\n", "s= input()\r\ny=len(s)\r\nif 1<=y<=100:\r\n def string_test(s):\r\n d={\"UPPER_CASE\":0, \"LOWER_CASE\":0}\r\n for c in s:\r\n if c.isupper():\r\n d[\"UPPER_CASE\"]+=1\r\n elif c.islower():\r\n d[\"LOWER_CASE\"]+=1\r\n else:\r\n pass\r\n \r\n x = d[\"UPPER_CASE\"]\r\n y = d[\"LOWER_CASE\"]\r\n if x>y:\r\n print(s.upper())\r\n elif y>x:\r\n print(s.lower())\r\n elif x==y:\r\n print(s.lower())\r\n \r\n \r\n string_test(s)", "s = input()\r\ncnt_l = 0\r\ncnt_u = 0\r\nfor i in s:\r\n if i == i.lower():\r\n cnt_l += 1\r\n elif i == i.upper():\r\n cnt_u += 1\r\nif cnt_l >= cnt_u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = input()\r\nlo,up = 0,0\r\n\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n up += 1\r\n if n[i].islower():\r\n lo += 1\r\n\r\nif lo < up :\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n ", "n : str = input()\r\n\r\n\r\ndef solve(n ) :\r\n up = 0\r\n low = 0\r\n for i in range(len(n)) :\r\n if ord(n[i]) >= 97 :\r\n low +=1 \r\n else : up += 1\r\n return n.upper() if up > low else n.lower()\r\n \r\n\r\n\r\nprint(solve(n ))\r\n", "a=input()\r\nup=0\r\nlo=0\r\nfor c in a:\r\n if c.isupper():\r\n up+=1\r\n else:\r\n lo+=1\r\nif lo >= up:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "k=input()\r\nu=0\r\nl=0\r\nfor i in k:\r\n if i.isupper()== True:\r\n u=u+1\r\n else:\r\n l=l+1\r\nif u>l:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "word = input()\r\n\r\ncount_upper = count_lower = 0\r\n\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n count_upper += 1\r\n else:\r\n count_lower += 1\r\n\r\nif count_upper > count_lower:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n \r\nprint(word)", "word=input()\r\nl=len(word)\r\nu=0\r\nd=0\r\nfor i in range(l):\r\n if (word[i]>='A' and word[i]<='Z'):\r\n u=u+1\r\n elif(word[i]>='a' and word[i]<='z'):\r\n d=d+1\r\nif u>d:\r\n print(word.upper())\r\nelif d>u or d==u:\r\n print(word.lower())", "s = str(input())\r\nuou, lou = 0, 0\r\nfor i in range(len(s)):\r\n if s[i] >= 'A' and s[i] <= 'Z':\r\n uou += 1\r\n elif s[i] >= 'a' and s[i] <= 'z':\r\n lou += 1\r\nif uou > lou:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "p = input() ; x = list(p) ; u,l = 0,0\r\nfor i in x:\r\n if i.isupper(): u+=1\r\n else: l+=1\r\nif u > l: print(p.upper())\r\nelse: print(p.lower())", "a = input()\r\nd = 0\r\ne = 0\r\nfor x in a:\r\n if x.islower() == True:\r\n d = d + 1\r\n else:\r\n e = e + 1\r\nif d >= e:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "s = input()\r\nup,lr = 0,0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n lr += 1\r\n\r\nif up>lr:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "k=input()\r\ncount_upper=0\r\nfor i in k:\r\n if i.isupper()==True:\r\n count_upper+=1\r\nif len(k)==1:\r\n print(k)\r\nelif len(k)-count_upper>=count_upper:\r\n print(k.lower())\r\nelse:\r\n print(k.upper())", "s=input()\nl=0\nu=0\nfor i in s:\n if i.islower() == True:\n l +=1\n else:\n u+=1\nif u > l :\n print(s.upper())\nelse:\n print(s.lower())\n\n\n\n\n \t\t\t \t\t\t \t \t \t\t\t \t\t\t\t \t", "s = input()\r\n \r\nu = sum(1 for i in s if i.isupper())\r\nl = len(s) - u\r\n\r\nif u>l:\r\n count = s.upper()\r\nelse :\r\n count = s.lower()\r\n \r\nprint(count)\r\n", "word = input()\r\n\r\nlowercase = word.lower()\r\nuppercase = word.upper()\r\n\r\ntotal_uppers = 0\r\ntotal_lowers = 0\r\n\r\nfor w in word:\r\n if w>=\"A\" and w<=\"Z\":\r\n total_uppers+=1\r\n elif w>=\"a\" and w<=\"z\":\r\n total_lowers+=1\r\n\r\nif total_uppers>total_lowers:\r\n print(uppercase)\r\nelse:\r\n print(lowercase)", "w=input()\r\nup=0\r\nlw=0\r\nfor i in w:\r\n if i.islower():\r\n lw+=1\r\n else:\r\n up+=1\r\nif up==lw:\r\n print(w.lower())\r\nelif up>lw:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())\r\n", "string=input()\r\nc=0\r\nl=0\r\nfor i in string:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n l+=1\r\nprint(string.upper() if c>l else string.lower())\r\n", "import re\r\nst = input()\r\ns = re.findall(\"[a-z]\",st)\r\nlen(st)-len(s)\r\nif len(st)-2*len(s)>0:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())", "t = input()\r\nlow = 0\r\nhigh = 0\r\n\r\nfor i in t:\r\n if \"a\"<=i<=\"z\":\r\n low += 1\r\n else:\r\n high += 1\r\n \r\nif low < high:\r\n print(t.upper())\r\nelse:\r\n print(t.lower())", "s = input()\r\nu,l=0,0\r\nfor c in s:\r\n if ord('a')<=ord(c)<=ord('z'):\r\n l+=1\r\n else:\r\n u+=1\r\nprint(s.upper() if u>l else s.lower())", "s = str(input())\r\nbig = 0\r\nsmall =0\r\nfor i in range (len(s)):\r\n if(s[i].isupper()):\r\n big+=1\r\n else:\r\n small+=1\r\nif(big>small):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "def count_low(string):\r\n letter = string[0]\r\n count = 1 if letter.islower() else 0\r\n if len(string) == 1:\r\n return count\r\n return count + count_low(string[1:])\r\n\r\ndef count_high(string):\r\n letter = string[0]\r\n count = 1 if letter.isupper() else 0\r\n if len(string) == 1:\r\n return count\r\n return count + count_high(string[1:])\r\n\r\nif __name__ == \"__main__\":\r\n word = input()\r\n low = count_low(word)\r\n high = count_high(word)\r\n\r\n if high > low:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n", "a = input()\r\nw = 0\r\nm = 0\r\nfor x in a:\r\n if x == x.lower():\r\n w += 1\r\n else:\r\n m += 1\r\nif w > m:\r\n print(a.lower())\r\nelif w < m:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "x=input(\"\")\r\ny=len(x)\r\ncount=0\r\ncountz=0\r\nfor i in range(0,y):\r\n if(x[i].isupper()):\r\n count+=1\r\n\r\n else:\r\n countz+=1\r\n i+=1\r\nif(count>countz):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\r\nupperCounter = 0\r\nlowerCounter = 0\r\nfor c in s:\r\n if c.isupper():\r\n upperCounter += 1\r\n else:\r\n lowerCounter += 1\r\nif upperCounter > lowerCounter:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)\r\n", "n, n1 = 0, 0\r\ns = str(input())\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n n += 1\r\n else:\r\n n -= 1\r\n\r\nif n <= n1:\r\n a = s.lower()\r\nelse:\r\n a = s.upper()\r\nprint(a)", "s = input(\"\")\r\nu = 0\r\nl = 0\r\nfor i in s:\r\n if i.islower():\r\n l +=1\r\n else:\r\n u +=1\r\nnew = ''\r\nif l>=u:\r\n new = s.lower()\r\nelif l<u:\r\n new = s.upper()\r\n\r\nprint(new)", "word = input()\r\nupperword = word.upper()\r\nupcount =0\r\nlowcount =0\r\nfor i in range(0,len(word)):\r\n if word[i] == upperword[i] :\r\n upcount+=1\r\n else :\r\n lowcount+=1\r\nif upcount > lowcount :\r\n print(upperword)\r\nelse :\r\n print(word.lower())", "s = input()\r\ncount_u = 0\r\ncount_l = 0\r\nfor i in range(0,len(s)):\r\n if s[i].islower():\r\n count_l+=1\r\n else:\r\n count_u+=1\r\nif count_l>=count_u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "w = input()\nl = 0\nu = 0\n \nfor x in w:\n if x.isupper():\n u += 1\n else:\n l += 1\nif u > l:\n w = w.upper()\nelse:\n w = w.lower()\n\nprint(w)", "a=input()\r\nb=len(a)\r\nc=0\r\nd=0\r\nfor i in range(b):\r\n if(a[i]==a[i].lower()):\r\n c=c+1\r\n else:\r\n d=d+1\r\nif(d<=(b//2)):\r\n for i in range(b):\r\n print(a[i].lower(),end=\"\")\r\nelse:\r\n for i in range(b):\r\n print(a[i].upper(),end=\"\")\r\n", "n = input()\r\nf = []\r\nwe = 0\r\nsq = 0\r\nfor i in n:\r\n if str(i).isupper():\r\n we += 1\r\n else:\r\n sq +=1\r\nif we > sq:\r\n s = n.upper()\r\nelif sq > we:\r\n s = n.lower()\r\nelse:\r\n s = n.lower()\r\n\r\nprint(s)\r\n\r\n\r\n\r\n", "a = input()\r\n\r\ns1, s2 = 0, 0\r\n\r\nfor i in a:\r\n if i.islower() == True:\r\n s1 += 1\r\n else:\r\n s2 += 1\r\n\r\nif s1 >= s2:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "word = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor x in word:\r\n if x >= 'A' and x <= 'Z':\r\n upper +=1\r\n else:\r\n lower +=1\r\nif(upper>lower):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "string=input()\r\ni=0\r\ncapital=0\r\nsmall=0\r\n\r\nwhile i<len(string):\r\n x=ord(string[i])\r\n if x>=65 and x<=90:\r\n capital+=1\r\n else:\r\n small+=1\r\n i+=1\r\n\r\nif small==capital or small>capital:\r\n string=string.lower()\r\n print(string)\r\n\r\nelse:\r\n string=string.upper()\r\n print(string)\r\n \r\n", "# https://codeforces.com/problemset/problem/59/A\n\ns = input()\nuc, lc = 0, 0\nfor i in s:\n if i.islower():\n lc += 1\n else:\n uc += 1\nprint(s.lower() if lc >= uc else s.upper())\n", "word = input()\r\n\r\nCOUNT = 0\r\nfor ch in word:\r\n if ch.isupper():\r\n COUNT += 1\r\ncount = len(word) - COUNT\r\n\r\nif COUNT > count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n\r\n", "#use isupper and islower\r\ns = input()\r\ncount_lower=0\r\ncount_upper=0\r\n#counting upper and lower cases in s\r\nfor i in s:\r\n if (i.isupper()) == True:\r\n count_upper+=1\r\n elif (i.islower()) == True:\r\n count_lower+=1\r\n#if uppercase letter > than lowercae\r\nif count_upper>count_lower:\r\n print(s.upper())\r\n#if lower > upper use lower case\r\nelif count_upper<count_lower:\r\n print(s.lower())\r\n#both are same \r\nelif count_upper==count_lower:\r\n print(s.lower())", "\r\nword = input()\r\ntemp=0\r\n\r\nwlength = len(word)\r\n\r\nfor i in range(0,wlength):\r\n if word[i].isupper() is True:\r\n temp=temp+1\r\n else:\r\n temp=temp-1\r\n\r\nif temp > 0:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n", "s=input()\nup=0\nlow=0\nfor i in s:\n if i.isupper():\n up+=1\n else:\n low+=1\nif(up>low):\n print(s.upper())\nelse:\n print(s.lower())\n \t\t\t \t \t \t \t \t\t \t \t \t\t", "\n\ndef function(input_word):\n \n str_length=len(input_word)\n upper_characters=[c for c in input_word if c.isupper()]\n \n \n if str_length-len(upper_characters)>=len(upper_characters):\n print(''.join([c if c.islower() else c.lower() for c in input_word]))\n else:\n print(''.join([c if c.isupper() else c.upper() for c in input_word]))\n \n \n \n \n \n \ndef main():\n \n input_word = input()\n \n \n function(input_word)\n\n\nif __name__ == \"__main__\":\n main()", "word=input()\r\nucount=0\r\nlcount=0\r\nfor letter in word:\r\n if ord(letter)<97 and ord(letter)>=65:\r\n ucount+=1\r\n else:\r\n lcount+=1\r\nif lcount<ucount:\r\n print(word.upper())\r\nif lcount>=ucount:\r\n print(word.lower())\r\n \r\n", "n=input()\nlower_count=0\nupper_count=0\nfor i in range(len(n)) :\n if n[i].islower() :\n lower_count+=1\n else :\n upper_count+=1 \nif lower_count>upper_count or lower_count==upper_count:\n print(n.lower()) \n \nelse :\n print(n.upper()) ", "x=input()\r\nc=0\r\nd=0\r\nfor i in range(0,len(x)):\r\n if x[i].isupper():\r\n c=c+1\r\n else:\r\n \r\n d=d+1\r\nif c>d:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[19]:\n\n\nmasukan = input()\nn=0\nfor i in range(0,len(masukan)):\n if masukan[i]==masukan[i].upper():\n n = n+1\nif n > int(len(masukan)/2):\n output = masukan.upper()\nelse:\n output = masukan.lower()\nprint (output)\n\n\n# In[ ]:\n\n\n\n\n", "str=input()\r\ncount,count1=0,0\r\nfor i in range(len(str)):\r\n if str[i]==str[i].lower():\r\n count=count+1\r\n else:\r\n count1=count1+1\r\nif count==count1:\r\n print(str.lower())\r\nelif count>count1:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "word, ub, lo = input(), 0, 0\r\nfor i in word:\r\n if ord(i) >= 97: lo += 1\r\n else: ub += 1\r\nprint(word.upper() if lo < ub else word.lower())", "count_up = 0\r\ncount_low = 0\r\nfor i in (word := input()):\r\n if i.upper() == i:\r\n count_up += 1\r\n else:\r\n count_low += 1\r\nif count_low >= count_up:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input(\"\")\r\ns_sp = list(s)\r\n\r\ncount = 0\r\ncount1 = 0\r\nfor letter in s_sp:\r\n if letter.isupper():\r\n\r\n count +=1\r\n else:\r\n count1 +=1\r\n\r\nif count > count1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x = str(input())\r\n\r\ncounter = 0\r\nl = len(x)\r\n\r\nfor i in x:\r\n if(i.islower()):\r\n counter += 1\r\nif(counter >= l-counter):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n \r\n", "s=input()\r\nku=0\r\nkl=0\r\nfor x in s:\r\n if x.isupper():\r\n ku+=1\r\n else:\r\n kl+=1\r\nif ku>kl:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n", "s=input()\r\nl=u=0\r\nfor ch in s:\r\n if(ch.islower()): l+=1\r\n else:u+=1\r\nif(l>=u):print(s.lower())\r\nelse:print(s.upper())", "s=input()\ncap=0\nsm=0\nfor c in s :\n if c.isupper():\n cap+=1\n else:\n sm+=1\nif cap>sm:\n print(s.upper())\nelse:\n print(s.lower())\n \n", "p=input()\r\nc=0\r\nfor i in p:\r\n if i.isupper():\r\n c+=1\r\nif c>len(p)//2:\r\n p=p.upper()\r\nelse:\r\n p=p.lower()\r\nprint(p)", "s = input()\r\nl = 0\r\nu = 0\r\nfor i in s:\r\n\tif(i >= \"A\" and i <= \"Z\"):\r\n\t\tu += 1\r\n\telse:\r\n\t\tl += 1\r\nif(u > l):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "s = input()\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor letter in s:\r\n if letter == letter.upper():\r\n count_upper = count_upper + 1\r\n else:\r\n count_lower = count_lower + 1\r\n\r\nif count_upper > count_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "x = input()\r\nupper = []\r\nlower = []\r\nfor i in x:\r\n if i.islower():\r\n lower.append(i)\r\n else:\r\n upper.append(i)\r\nif len(upper) > len(lower):\r\n x = x.upper()\r\nelse:\r\n x = x.lower()\r\nprint(x)", "str = input()\r\nlower = upper =0\r\nfor x in str:\r\n if (ord(x)-90) > 1:\r\n lower+=1\r\n else:\r\n upper+=1\r\nif lower >=upper:\r\n str =str.lower()\r\nelse:\r\n str= str.upper()\r\nprint(str)", "import string\r\n\r\n\r\ndef transform(word):\r\n lower_count = 0\r\n capital_count = 0\r\n for i in word:\r\n if i.islower():\r\n lower_count += 1\r\n else:\r\n capital_count += 1\r\n if lower_count >= capital_count:\r\n return word.lower()\r\n return word.upper()\r\n\r\n\r\na = input()\r\nprint(transform(a))\r\n", "word = input()\r\nwordlist = sorted(list(word))\r\nnum = 0\r\nfor i in range(len(word)):\r\n if word[i] <= 'Z':\r\n num += 1\r\nif num*2 > len(word):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "w = input()\r\nlow = []\r\nbig = []\r\nfor i in w:\r\n if i.islower():\r\n low.append(i)\r\n else:\r\n big.append(i)\r\nif len(low) > len(big) or len(low) == len(big):\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "word=input()\r\npo=0\r\nco=0\r\nfor i in word:\r\n if(i.islower()):\r\n po+=1\r\n elif(i.isupper()):\r\n co+=1\r\nif po==co:\r\n print(word.lower())\r\nelif po>co:\r\n print(word.lower())\r\nelif co>po:\r\n print(word.upper())\r\n ", "k=input()\r\nl=0\r\nu=0\r\nfor char in k:\r\n if char.islower():\r\n l+=1\r\n elif char.isupper():\r\n u+=1\r\nif u >l:\r\n c=k.upper()\r\nelse:\r\n c=k.lower()\r\nprint(c) \r\n\r\n\r\n\r\n\r\n", "a = input()\r\nlow = 0\r\nup = 0\r\nfor i in a:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif up > low:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "string = input()\r\n\r\n\r\ncount_uppercase = 0\r\ncount_lowercase = 0\r\n\r\nfor char in string:\r\n if char.isupper():\r\n count_uppercase += 1\r\n elif char.islower():\r\n count_lowercase += 1\r\n\r\nif count_uppercase > count_lowercase:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "str = input()\r\nl , u = 0, 0\r\nfor i in str:\r\n if i.islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif l < u:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "a=input()\r\nb=0\r\nc=0\r\nfor i in a:\r\n if i in \"abcdefghijklmnopqrstuvwxyz\":\r\n b=b+1\r\n else:\r\n c=c+1\r\nif b>=c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "s=input()\r\nk=p=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n k+=1\r\n else:\r\n p+=1\r\nif k>p:\r\n print(s.lower())\r\nelif k<p:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\n\r\nupcases = 0\r\nlowcases = 0\r\nn = len(word)\r\n\r\nfor i in range(n):\r\n if word[i].isupper() == True:\r\n upcases = upcases + 1\r\n else:\r\n lowcases += 1\r\nif upcases > lowcases:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nup=0\r\nlow=0\r\nfor i in range (len(s)):\r\n if s[i] < 'a':\r\n up+=1\r\n else:\r\n low+=1\r\nif up > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "initial,upper,lower = input(),0,0\r\nfor char in initial:\r\n if char.isupper() == True:upper += 1\r\n else:lower += 1\r\nif upper > lower:print(initial.upper())\r\nelse:print(initial.lower())", "x = input()\r\n\r\nnum_up = 0\r\nnum_low = 0\r\n\r\nfor i in x:\r\n if i == i.upper():\r\n num_up += 1\r\n\r\n else:\r\n num_low += 1\r\n\r\n\r\nif num_up > num_low:\r\n print(x.upper())\r\n\r\nelse:\r\n print(x.lower())\r\n \r\n", "s=input();print([s.lower(),s.upper()][sum(ord(x)<97 for x in s)*2>len(s)])", "word = input()\r\nu=l=0\r\nfor letter in word:\r\n if letter.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n\r\nif u > l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=str(input())\r\nl=0\r\nfor i in s:\r\n if i.islower()==True:\r\n l+=1\r\nu=len(s)-l\r\nif(l>u or l==u):\r\n print(s.lower())\r\nelif(l<u):\r\n print(s.upper())", "s=str(input())\nif sum(map(str.islower,s))>=len(s)/2:\n print(s.lower())\nelse:\n print(s.upper())", "\n\n\ndef solve(word):\n\n\ttotalcnt = len(word)\n\tuppercnt = 0\n\tfor char in word:\n\n\t\tif ord(char) >= 65 and ord(char) <= 90:\n\t\t\tuppercnt += 1\n\n\tlowercnt = totalcnt-uppercnt\n\tif lowercnt == uppercnt or lowercnt > uppercnt:\n\t\treturn word.lower()\n\telse:\n\t\treturn word.upper()\n\n\n\n\n\n\n\nif __name__ == \"__main__\":\n\tword = input()\n\tprint(solve(word))\n", "s = input()\r\nx = 0\r\ny = 0\r\nfor z in s:\r\n if z.isupper() == True:\r\n y += 1\r\n else:\r\n x += 1\r\nif x >= y:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "char = input()\ncount1 = 0\ncount2 = 0\nfor i in char:\n if i.islower():\n count1 +=1\n elif i.isupper:\n count2+=1\nif count1 < count2:\n print(char.upper())\nelse:\n print(char.lower())", "string = input()\r\n\r\nlow = 0\r\nhigh = 0\r\nfor i in string:\r\n\tif i.lower() == i:\r\n\t\tlow+=1\r\n\telse:\r\n\t\thigh+=1\r\n\r\nif low > high or low == high:\r\n\tprint(string.lower())\r\nelif high>low:\r\n\tprint(string.upper())\r\n\r\n\r\n\r\n\r\n", "w = input()\r\nl = 0\r\nu = 0\r\n\r\nfor ch in w:\r\n if ch.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u>l:\r\n w = w.upper()\r\nelse:\r\n w = w.lower()\r\n\r\nprint(w)", "word = input()\r\ncount_of_lower = 0\r\ncount_of_upper = 0\r\nfor i in word:\r\n if i.islower():\r\n count_of_lower += 1\r\n elif i.isupper():\r\n count_of_upper += 1\r\nif count_of_upper > count_of_lower:\r\n print(word.upper())\r\nelif count_of_lower >= count_of_upper:\r\n print(word.lower())", "s = input()\r\nc=0\r\nd=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n c=c+1\r\n if s[i].islower():\r\n d=d+1\r\n\r\nif(c>d):\r\n print(s.upper())\r\nif(d>=c):\r\n print(s.lower())\r\n", "word = input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(word)):\r\n if word[i].islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper>lower:\r\n print(word.upper())\r\nelif upper==lower:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "x=input()\r\na=0\r\nb=0\r\nfor i in x:\r\n if i.islower():\r\n a=a+1\r\n elif i.isupper():\r\n b=b+1\r\nif a >=b:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())\r\n\r\n\r\n", "a=input()\r\na=list(a)\r\nx=0\r\ny=0\r\nfor i in a:\r\n if i.isupper():\r\n x=x+1\r\n else:\r\n y=y+1\r\na=\"\".join(a)\r\nif x>y:\r\n a=a.upper()\r\nelse:\r\n a=a.lower()\r\nprint(a)\r\n", "def solve(n):\r\n l_count = 0\r\n u_count = 0\r\n for i in n:\r\n if (i.islower()):\r\n l_count = l_count + 1\r\n else:\r\n u_count = u_count + 1\r\n if (l_count > u_count):\r\n n = n.lower()\r\n elif (u_count > l_count ):\r\n n = n.upper() \r\n else:\r\n n = n.lower()\r\n return n\r\n\r\n#__main__\r\n\r\nuser = input()\r\nprint(solve(user))\r\n", "word = [i for i in input()]\r\n\r\nuppers = list(filter(lambda x: x.isupper(), word))\r\nlowers = list(filter(lambda x: x.islower(), word))\r\n\r\nif len(uppers) > len(lowers):\r\n print(''.join(word).upper())\r\nelse:\r\n print(''.join(word).lower())\r\n", "s = input()\r\nup = 0\r\nlow = 0\r\n\r\nfor i in s :\r\n if i.islower() :\r\n low += 1\r\n if i.isupper() :\r\n up += 1\r\n\r\nif low >= up :\r\n s = s.lower()\r\nelse :\r\n s = s.upper()\r\n\r\nprint(s)", "st = input()\r\n\r\nCapCount = 0 \r\nLowCount = 0\r\nfor i in st:\r\n if (i.isupper()):\r\n CapCount += 1\r\n elif(i.islower()):\r\n LowCount += 1\r\nif CapCount > LowCount:\r\n print(st.upper())\r\nelse:\r\n print(st.casefold())", "s = input()\r\nc, l = 0, 0\r\nfor i in s:\r\n if(i.isupper()):\r\n c += 1\r\n else:\r\n l += 1\r\nif(c > l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = str(input())\r\nup = sum([1 for x in a if x.isupper()])\r\nlow = len(a)-up\r\nif(up > low):\r\n print(''.join([x.upper() for x in a]))\r\nelse:\r\n print(a.lower())\r\n", "w=input()\r\nu,l=0,0\r\nfor x in range(0,len(w)):\r\n if(w[x].isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(l>u or l==u):\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "name = list(input())\r\n\r\nupper = 0\r\nlower = 0\r\nfor c in name:\r\n if c.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n\r\nx = ''.join(name)\r\nif upper > lower:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "word=input()\r\nupper=0\r\nfor i in range (0,len(word)):\r\n\tif word[i].isupper():\r\n\t\tupper+=1\r\nlower=len(word)-upper\r\nif upper>lower:\r\n\tprint(word.upper())\r\nelse:\r\n\tprint(word.lower())", "word = input()\r\n \r\nlowercase = 0\r\nuppercase = 0\r\n \r\nfor char in word:\r\n if char.isupper():\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\nif uppercase > lowercase:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n \r\nprint(word)", "word = input(\"\")\r\n\r\nuppercase_letters = 0\r\nlowercase_letters = 0\r\n\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n uppercase_letters += 1\r\n else:\r\n lowercase_letters +=1\r\n\r\nif uppercase_letters > lowercase_letters:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "word = input()\r\nc = 0\r\nd = 0\r\nfor i in word:\r\n if i.isupper():\r\n c += 1\r\n else:\r\n d += 1\r\n \r\nif c < d:\r\n print(word.lower())\r\nelif c > d:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "w = input()\r\ncount_c=0\r\ncount_l=0\r\nfor i in range(len(w)):\r\n if ord(w[i])>=65 and ord(w[i])<=92 :\r\n count_c+=1\r\n else:\r\n count_l+=1\r\nif count_c>count_l:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())\r\n ", "s = input()\n\ncap = 0\nmal = 0\nfor i in range(0, len(s)):\n if s[i].isupper() == True:\n cap += 1\n else:\n mal += 1\n\nif cap == mal:\n s = s.lower()\nelif cap > mal:\n s = s.upper()\nelse:\n s = s.lower()\n\nprint(s)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "word = input()\nupper_count = 0\nlower_count = 0\n\nfor letter in word:\n\tif letter.lower() == letter:\n\t\tlower_count += 1\n\telif letter.upper() == letter:\n\t\tupper_count += 1\n\nif upper_count > lower_count:\n\tprint(word.upper())\nelse:\n\tprint(word.lower())", "n=input()\r\nprint([n.lower(),n.upper()][sum(map(str.isupper,n))>len(n)/2])", "strn = input()\r\nif len([1 for i in strn if i.isupper()]) > len([1 for i in strn if i.islower()]):\r\n print(strn.upper())\r\nelse:\r\n print(strn.lower())", "def summy(n) :\r\n l=0\r\n for i in range(len(n)) :\r\n l=l+ord(n[i])\r\n return l\r\nn=input()\r\nn1=n.upper()\r\nn2=n.lower()\r\nif summy(n1)+summy(n2)>summy(n)*2 :\r\n print(n1)\r\nelse :\r\n print(n2)", "x=input()\r\ncu=0\r\ncl=0\r\nfor i in x:\r\n if i.isupper()==True:\r\n cu+=1\r\n elif i.islower()==True:\r\n cl+=1\r\nif cu>cl:\r\n print(x.upper())\r\nelif cu<=cl:\r\n print(x.lower())", "s=input()\r\nl=len(s)\r\nlo=up=0\r\nfor i in range(l):\r\n if s[i].islower():\r\n lo+=1\r\n else:\r\n up+=1\r\n\r\nif lo>=up:\r\n for i in range(l):\r\n print(s[i].lower(),end='')\r\nelse:\r\n for i in range(l):\r\n print(s[i].upper(),end='')\r\nprint()", "s = input()\narr = [[0,0],[1,0]]\nfor i in s:\n if i.islower():\n arr[0][1] += 1\n else:\n arr[1][1] += 1\nif arr[0][1] < arr[1][1]:\n print(s.upper())\nelse:\n print(s.lower())\n", "s=input()\r\ncap=0\r\nlo=0\r\nfor i in s:\r\n if(i.isupper()):\r\n cap+=1\r\n else:\r\n lo+=1\r\nif(lo>=cap):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "word=input()\r\nword=list(word)\r\nupper=0\r\n\r\nfor items in word:\r\n if items.isupper()==True:\r\n upper=upper+1\r\nlower=len(word)-upper\r\n\r\nnew_word=[]\r\n\r\nif lower>=upper:\r\n i=0\r\n while i<len(word):\r\n a=word[i].lower()\r\n new_word.append(a)\r\n i=i+1\r\nelse:\r\n i = 0\r\n while i < len(word):\r\n a = word[i].upper()\r\n new_word.append(a)\r\n i=i+1\r\n\r\ns=\"\"\r\ns=s.join(new_word)\r\nprint(s)\r\n", "a =input ()\nnumber = len(a)\naf=str(a)\nsmall = 0\nfor y in range (number) :\n\tif a[y] >= 'a':\n\t\tsmall += 1\nif (small >= number/2):\n\tprint (af.lower())\nelse:\n\tprint (af.upper ())\n\t \t\t\t\t \t \t\t\t \t \t \t\t\t \t\t\t", "s=str(input())\r\ncount1 = sum(1 for elem in s if elem.isupper())\r\ncount2 = sum(1 for elem in s if elem.islower())\r\nif count1>count2:\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)\r\n", "from collections import Counter\r\nfrom time import sleep\r\n\r\n\r\nraw = input()\r\na,b = 0,0\r\nfor char in raw:\r\n if char.isupper():a+=1\r\n else:b+=1\r\n\r\nif a == b:\r\n print(raw.lower())\r\nelse:\r\n if a>b:raw = raw.upper()\r\n else:raw = raw.lower()\r\n print(raw)\r\n#sleep(100)\r\n", "\r\n# 1978\r\ns = input()\r\nc_lowercase = 0\r\nc_uppercase = 0\r\n\r\nfor str in s:\r\n #uppercase check\r\n if ord(str) <= 90 and ord(str) >= 65:\r\n c_uppercase = c_uppercase + 1\r\n elif ord(str) <=122 and ord(str) >= 97:\r\n c_lowercase = c_lowercase + 1\r\n else:\r\n pass\r\n\r\nif c_uppercase > c_lowercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n \r\n\r\n", "n = str(input())\r\nk = n\r\nli = []\r\nli2 = []\r\nfor i in range(0,len(n)):\r\n if(n[i].isupper()):\r\n li.append(n[i])\r\n else:\r\n li2.append(n[i])\r\nif(len(li)>len(li2)):\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "s = input()\r\nu = list(filter(lambda x: x.isupper(), s))\r\nif 2 * len(u) > len(s):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "from tokenize import String\r\n\r\n\r\nword_input = input()\r\nno_of_upp=0\r\nno_of_low=0\r\nfor x in word_input:\r\n if ord(x)>=65 and ord(x)<=90:\r\n no_of_upp +=1\r\n else:\r\n no_of_low+=1\r\n\r\nif no_of_upp > no_of_low:\r\n print(word_input.upper())\r\nelse:\r\n print(word_input.lower())", "def test():\r\n s = input()\r\n bal = 0\r\n for c in s:\r\n if ord(c) > 96:\r\n bal -= 1\r\n else:\r\n bal += 1\r\n if bal > 0:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n \r\n \r\ntest()", "word=input()\r\nupper=0\r\nlower=0\r\nfor i in word:\r\n if i.isupper() == True:\r\n upper=upper+1\r\n else:\r\n lower=lower+1\r\n\r\nif upper > lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "x = input()\r\nl=0\r\nu=0\r\nfor i in range(len(x)):\r\n if(x[i] == x[i].upper()):\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nif(u>l):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "import re\r\nx=input()\r\nc=len(re.findall('[a-z]',x))\r\na=len(re.findall('[A-Z]',x))\r\n\r\nif(a>c):\r\n print(x.upper())\r\nelse:\r\n \r\n print(x.lower())", "s = input().strip()\r\nu = 0\r\nl = 0\r\nfor i in list(s):\r\n if str.isupper(i):\r\n u += 1\r\n else:\r\n l += 1\r\nif u > l:\r\n print(str.upper(s))\r\nelse:\r\n print(str.lower(s))\r\n", "strs = input()\r\nu,l = 0,0\r\ni = 0\r\nfor i in range(0,len(strs)):\r\n if strs[i].isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif(u>l):\r\n print(strs.upper())\r\nelse:\r\n print(strs.lower())", "a=str(input())\r\na_lower=sum(map(str.islower,a))\r\na_upper=sum(map(str.isupper,a))\r\nif a_upper>a_lower:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "word = input()\r\nsmall=0\r\ncaps=0\r\nfor i in range(0, len(word)):\r\n if(word[i]>='a' and word[i]<='z'):\r\n small = small + 1\r\n if(word[i]>='A' and word[i]<='Z'):\r\n caps = caps + 1\r\nif(small >= caps):\r\n for i in range(0, len(word)):\r\n if(word[i]>='A' and word[i]<='Z'):\r\n temp = ord(word[i])- ord('A')\r\n word = word[:i] + chr(ord('a') + temp) + word[i+1:]\r\nelse:\r\n for i in range(0, len(word)):\r\n if(word[i]>='a' and word[i]<='z'):\r\n temp = ord(word[i])- ord('a')\r\n word = word[:i] + chr(ord('A') + temp) + word[i+1:]\r\nprint(word)", "word = input()\r\nuppers = sum(1 for i in word if i.isupper())\r\nlowers = len(word) - uppers\r\n\r\nif uppers > lowers:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n = input()\r\ncount = 0\r\nfor c in n:\r\n if c.isupper():\r\n count += 1\r\nif count > len(n) - count:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "def converter_string(word:str) -> str:\r\n c = 0\r\n for symb in word:\r\n if symb.islower():\r\n c +=1\r\n elif symb.isupper():\r\n c -= 1\r\n return word.lower() if c >= 0 else word.upper()\r\n\r\nprint(converter_string(input()))", "line = input()\r\nf = t = 0\r\nfor i in line:\r\n if i.islower() == True:\r\n t += 1\r\n else:\r\n f += 1\r\nif t >= f:\r\n print(line.lower())\r\nelse:\r\n print(line.upper())", "x=input()\r\ncaps=0\r\nsmall=0\r\nfor i in x:\r\n if(ord(i)>=35 and ord(i)<=90):\r\n caps+=1\r\n if(ord(i)>=97 and ord(i)<=122):\r\n small+=1\r\nif(caps>small):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "x=input()\r\nu=0\r\nl=0\r\nfor i in x:\r\n if(i.isupper()==True):\r\n u=u+1\r\n if(i.islower()==True):\r\n l=l+1\r\nif(u>l):\r\n x1=x.upper()\r\nelif(l>u):\r\n x1=x.lower()\r\nelse:\r\n x1=x.lower()\r\nprint(x1)", "word_s = input()\nlower = 0\nupper = 0\nfor i in range(0, len(word_s)):\n if word_s[i].islower():\n lower+=1\n else:\n upper+=1\nif lower >= upper:\n print(word_s.lower())\nelse:\n print(word_s.upper())\n\n", "s = input()\r\nl=0 ; p=0\r\nfor i in s :\r\n if ord(i) in range(97 ,123) :\r\n l+=1\r\n else :\r\n p+=1\r\n \r\nif p > l :\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "s = input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n if 65 <= ord(s[i]) <= 90:\r\n c=c+1\r\nif(c <= (int(n/2))):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = str(input())\nc = 0\nfor i in s:\n if i.isupper():\n c += 1\nif float(c) > (len(s) / 2):\n print(s.upper())\nelse:\n print(s.lower())", "#k, n, w = [int(x) for x in input().split()]\r\ns = input()\r\nupper = 0\r\nlower = 0\r\nfor c in s:\r\n if c.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\ncnt=[0,0]\nfor i in s:\n\tcnt[i.isupper()]+=1\nif(cnt[0]>=cnt[1]): print(s.lower())\nelse: print(s.upper())\n", "a = input()\r\nup = 0\r\nlow = 0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n low += 1\r\n else:\r\n up += 1\r\nif low >= up:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "#59a\r\na=input()\r\n\r\ncount_up=0\r\ncount_low=0\r\nfor i in a:\r\n if i.isupper() ==True:\r\n count_up+=1\r\n else:\r\n count_low+=1\r\nif count_low>=count_up:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n#print(count_up,count_low)\r\n \r\n ", "upper_count = 0\r\nlower_count = 0\r\nstr = input() \r\nfor i in str:\r\n if i.isupper():\r\n upper_count += 1\r\n \r\n elif i.islower():\r\n lower_count += 1\r\n\r\nif lower_count >= upper_count:\r\n lowercase = str.lower() \r\n print(lowercase) \r\nelse:\r\n uppercase = str.upper() \r\n print(uppercase) \r\n ", "s=input()\r\nuc=0\r\nlc=0\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=123:\r\n lc+=1\r\n if ord(i)>=65 and ord(i)<=91:\r\n uc+=1\r\nif uc==lc:\r\n print(s.lower())\r\nelif uc>lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\n\nnUpper = 0\nfor c in s:\n\tif c.isupper():\n\t\tnUpper += 1\n\nnLower = len(s) - nUpper;\n\nif nLower > nUpper:\n\tprint(s.lower())\nelif nUpper > nLower:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n", "s=input()\r\nc1=c2=0\r\nfor i in s:\r\n\tif ord(i)>=92 and ord(i)<=122:\r\n\t\tc1+=1\r\n\telse:\r\n\t\tc2+=1\r\nif c1>=c2:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "st = input()\r\n\r\nuc_count = sum(1 for c in st if c.isupper())\r\nlc_count = len(st) - uc_count\r\n\r\nif uc_count > lc_count:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())\r\n", "import re\r\ns=str(input())\r\nprint(s.lower() if len(tuple(re.finditer(r'[a-z]',s)))>=len(tuple(re.finditer(r'[A-Z]',s))) else s.upper())", "a=input()\ncap='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nsmall='abcdefghijklmnopqrstuvwxyz'\n#print(len(cap),len(small))\ncountcap=0\ncountsmall=0\nfor i in a:\n\tif i in cap:\n\t\tcountcap+=1\n\telse:\n\t\tcountsmall+=1\n\nif countcap>countsmall:\n\tprint(a.upper())\nelse:\n\tprint(a.lower())\t\t\t\t", "new_str = input()\r\nlower = 0\r\ngreater = 0\r\nfor letter in new_str:\r\n if letter.islower() :\r\n lower += 1\r\n else:\r\n greater += 1\r\nif lower == greater or lower > greater:\r\n new_str = new_str.lower()\r\nelif lower < greater:\r\n new_str = new_str.upper()\r\n\r\nprint(new_str)", "s = list(input())\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper() == True:\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif lower >= upper:\r\n for i in range(len(s)):\r\n if s[i].isupper() == True:\r\n s[i] = s[i].lower()\r\nelse:\r\n for i in range(len(s)):\r\n if s[i].isupper() == False:\r\n s[i] = s[i].upper()\r\nprint(''.join(s))\r\n", "a=input()\r\nc=0\r\nnc=0\r\nfor i in a:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n nc+=1\r\n\r\nif c>nc:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n\r\n", "s=input()\r\nlc=0\r\nuc=0\r\nif len(s) in range(1,101):\r\n for i in s:\r\n if i.islower():\r\n lc+=1\r\n else:\r\n uc+=1\r\n if lc>=uc:\r\n print(s.lower())\r\n else:\r\n print(s.upper())", "s=input()\r\nx=0\r\nfor i in s :\r\n if i.isupper():\r\n x+=1\r\nif x>len(s)/2 : print(s.upper())\r\nelse : print(s.lower())\r\n\r\n", "s=str(input())\r\nm,n=0,0\r\nfor i in s:\r\n if i.isupper() is True:\r\n m+=1\r\n else:\r\n n+=1\r\nif m>n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "k1=k2=0\r\ns=input()\r\nfor i in range(0,len(s)):\r\n if s[i]==s[i].upper():\r\n k1=k1+1\r\n else:\r\n k2=k2+1\r\nif k1>k2:\r\n print(s.upper())\r\nelif k2>k1:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n", "n = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in n:\r\n if i == i.lower():\r\n count1 += 1\r\n if i != i.lower():\r\n count2 += 1\r\nif count1 >= count2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "# your code goes here\r\ns=input()\r\nx=0\r\ny=0\r\nfor i in range(0,len(s)):\r\n\tif s[i].islower():\r\n\t\tx=x+1\r\n\telse:\r\n\t\ty=y+1\r\n\t\t\r\nif x>=y:\r\n\tans=s.lower()\r\nelse:\r\n\tans=s.upper()\r\n\t\r\nprint(ans)", "s = input()\nlow = up = 0\n\nfor i in s:\n if ord(i) >= 65 and ord(i) <= 90:\n up += 1\n else:\n low += 1\n\nif up > low:\n for i in s:\n if ord(i) >= 97 and ord(i) <= 122:\n print(chr(ord(i)-32),end=\"\")\n else:\n print(i,end=\"\")\nelse:\n for i in s:\n if ord(i) >= 65 and ord(i) <= 90:\n print(chr(ord(i)+32),end=\"\")\n else:\n print(i,end=\"\")\n \t \t \t \t\t\t\t\t \t\t \t\t", "s=input()\r\ns_count=0\r\nu_count=0\r\nfor i in s:\r\n if i>='A' and i<='Z':\r\n u_count+=1\r\n else:\r\n s_count+=1\r\nif u_count>s_count:\r\n s=s.upper()\r\nelif s_count>=u_count:\r\n s=s.lower()\r\nprint(s)\r\n", "def main():\r\n a = input()\r\n \r\n c = 0\r\n for i in range(len(a)):\r\n if a[i] == a[i].upper():\r\n c += 1\r\n if c > (len(a) / 2):\r\n print(a.upper())\r\n else:\r\n print(a.lower())\r\n\r\nmain()\r\n\r\n", "count_upper, count_lower = 0, 0\r\ns = input()\r\nfor ch in s:\r\n if ch.islower():\r\n count_lower += 1\r\n elif ch.isupper():\r\n count_upper += 1\r\n else:\r\n pass\r\n \r\nif count_upper > count_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nc_l=0\r\nc_u=0\r\nfor i in list(s):\r\n if i>i.upper():\r\n c_l+=1\r\n else:\r\n c_u+=1\r\nif c_l>=c_u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def getLowercase(word):\r\n count = 0\r\n for i in word:\r\n if i.islower():\r\n count += 1\r\n return count\r\n\r\ndef getUppercase(word):\r\n count = 0\r\n for i in word:\r\n if i.isupper():\r\n count += 1\r\n return count\r\n\r\ndef main():\r\n word = input()\r\n lower = getLowercase(word)\r\n upper = getUppercase(word)\r\n\r\n if upper < lower:\r\n print(word.lower())\r\n elif upper > lower:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input().strip() \r\n\r\nupper_count = sum(1 for c in s if c.isupper()) \r\nlower_count = sum(1 for c in s if c.islower()) \r\n\r\ncorrected_word = s.upper() if upper_count > lower_count else s.lower() \r\n\r\nprint(corrected_word) \r\n", "word = input()\r\nprint(word.lower() if sum(i.islower() for i in word) >= sum(i.isupper() for i in word) else word.upper())\r\n", "s = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in s:\r\n if i.isupper():\r\n count1 += 1 \r\n else:\r\n count2 +=1 \r\nif count1>count2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\ncnt=0\r\nans=len(a)\r\nfor i in a:\r\n if i>='a':cnt+=1\r\nif 2*cnt>=ans:\r\n print(a.lower())\r\nelse:print(a.upper())", "string = input()\r\n\r\nupper = 0\r\n\r\nfor letter in string:\r\n if letter.isupper():\r\n upper += 1\r\n\r\nlower = len(string) - upper\r\n\r\nif upper <= lower:\r\n string = string.lower()\r\nelse:\r\n string = string.upper()\r\n \r\nprint(string)", "word = input()\r\n\r\nlowers = sum([1 for c in word if c.islower()])\r\nhalf = len(word) // 2 if len(word) % 2 == 0 else (len(word) + 1) // 2\r\n\r\nif half <= lowers:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s=input()\r\ncapc=0\r\nsmac=0\r\nfor i in s:\r\n if((ord(i)>=65) and (ord(i)<=90)):\r\n capc+=1\r\n elif((ord(i)>=97)and(ord(i)<=122)):\r\n smac+=1\r\nif(capc>smac):\r\n print(s.upper())\r\nelif(capc<smac):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "def solve():\r\n s = input()\r\n uc = 0\r\n lc = 0\r\n\r\n for i in range(len(s)):\r\n if s[i].isupper() == True:\r\n uc += 1\r\n else:\r\n lc += 1\r\n\r\n if uc > lc:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n\r\n# T = int(input())\r\nT = 1\r\nfor _ in range(T):\r\n solve()\r\n", "try:\r\n n=input()\r\n u=0\r\n l=0\r\n for i in n:\r\n\r\n if ord(i)>=65 and ord(i)<=90:\r\n \r\n u+=1\r\n else:\r\n \r\n l+=1\r\n if(u>l):\r\n print(n.upper())\r\n else:\r\n print(n.lower())\r\n \r\nexcept:\r\n pass\r\n", "\"\"\"雷德讲 2100014176\"\"\"\r\ns=input()\r\nupperCount=0\r\nlowerCount=0\r\nfor letter in s:\r\n if letter.isupper():\r\n upperCount+=1\r\n elif letter.islower():\r\n lowerCount+=1\r\nif upperCount>lowerCount:\r\n ans=s.upper()\r\nelif lowerCount>upperCount:\r\n ans=s.lower()\r\nelse:\r\n ans=s.lower()\r\nprint(ans)", "def main():\r\n s = input()\r\n print([s.lower(), s.upper()][sum(c < '[' for c in s)*2 > len(s)])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=input()\r\nm=n.lower()\r\nx=0\r\nfor i in range(len(n)):\r\n if n[i]==m[i]:\r\n x+=1\r\nif x>=len(n)/2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word=input()\r\nlist_of_upper=[]\r\nlist_of_lower=[]\r\nfor i in word:\r\n if i.isupper()==True:\r\n # print(i)\r\n list_of_upper.append(i)\r\n else:\r\n list_of_lower.append(i)\r\nif len(list_of_lower)>=len(list_of_upper):\r\n print(word.lower()) \r\nelse:\r\n print(word.upper()) \r\n\r\n", "n=input()\r\nl=0;u=0\r\nfor i in list(n):\r\n if(i>='A' and i<='Z'):\r\n u+=1\r\n else:\r\n l+=1\r\nif(l>=u):\r\n print(n.lower())\r\nelif(u>l):\r\n print(n.upper())", "\"\"\"\n\"\"\"\n\n\nclass Word:\n def solve(self, word):\n upper = 0\n length = len(word)\n\n for char in word:\n if char == char.upper():\n upper += 1\n\n if upper > length / 2:\n return word.upper()\n\n else:\n return word.lower()\n\n\nif __name__ == \"__main__\":\n w = Word()\n word = str(input())\n\n print(w.solve(word))\n", "word = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n count1+= 1\r\n else:\r\n count2+=1\r\nif count1>count2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\nlowerlit = 0\r\nupperlit = 0\r\n\r\nfor i in range(len(word)):\r\n if word[i].isupper():\r\n upperlit += 1\r\n else:\r\n lowerlit += 1\r\n\r\nif lowerlit >= upperlit:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\ncnt_lower = 0\r\ncnt_upper = 0\r\nfor c in s:\r\n if (c.islower()):\r\n cnt_lower += 1;\r\n else: \r\n cnt_upper += 1;\r\n \r\n \r\nif (cnt_lower >= cnt_upper):\r\n s = s.lower()\r\nelse: \r\n s = s.upper()\r\n\r\nprint(s)", "def fix_case(s: str) -> str:\r\n upper_count = sum(1 for c in s if c.isupper())\r\n lower_count = sum(1 for c in s if c.islower())\r\n if upper_count > lower_count:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\ns = input()\r\nprint(fix_case(s))\r\n", "s = input()\r\n\r\nuppercase_count = 0\r\n\r\nfor i in s:\r\n\tif ord(i) >= 65 and ord(i) <= 90:\r\n\t\tuppercase_count += 1\r\n\r\nif uppercase_count > len(s) - uppercase_count:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "import math\r\nri=lambda:map(int,input().split())\r\ndef f():\r\n s=input()\r\n cnt,cnt2=0,0\r\n for i in s:\r\n if ord(i)<97:\r\n cnt+=1\r\n else:\r\n cnt2+=1\r\n if cnt>cnt2:\r\n print(s.upper())\r\n return 0\r\n print(s.lower())\r\nf()\r\n", "import re\r\n\r\ns = input()\r\nl = len(re.findall(\"[a-z]\", s))\r\nu = len(re.findall(\"[A-Z]\", s))\r\nif l >= u:\r\n print(s.casefold())\r\nelse:\r\n print(s.upper())", "word=input()\r\nuppercase=0\r\nfor i in word:\r\n\tif(i.islower()):\r\n\t\tuppercase+=1\r\nlowercase=len(word)-uppercase\r\nif(lowercase<=uppercase):\r\n\tanswer=word.lower()\r\nelse:\r\n\tanswer=word.upper()\r\nprint(answer)\r\n\t\r\n", "x = input()\r\nUpper,Lower = 0,0\r\nfor i in x:\r\n if i.isupper():\r\n Upper += 1\r\n else:\r\n Lower += 1\r\nif Lower >= Upper:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "a = input()\r\n\r\ncount = 0\r\n\r\nfor i in a:\r\n if i.islower():\r\n count +=1\r\n\r\ncount2 = len(a) - count\r\n\r\nif count < count2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "upper_i = lower_i = 0\r\nword_in = input()\r\nfor i in word_in:\r\n if i.islower():\r\n lower_i += 1\r\n else:\r\n upper_i += 1\r\nif lower_i >= upper_i:\r\n print(word_in.lower())\r\nelse:\r\n print(word_in.upper())", "s=input()\r\nn=len(s)\r\nupper_count=0\r\nfor i in s:\r\n if (i>='A' and i<='Z'):\r\n upper_count+=1\r\nif upper_count>(n//2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n = input()\r\nce=0\r\nco=0\r\nfor i in n:\r\n k = ord(i)\r\n if k>=65 and k<=90: ce+=1\r\n else: co+=1\r\nif ce>co: print(n.upper())\r\nelif co>ce: print(n.lower())\r\nelse: print(n.lower())", "\r\n\r\n# Codeforces - Word\r\n\r\ns = input()\r\n\r\nupp = sum([x.isupper() for x in s])\r\n\r\nlow = sum([x.islower() for x in s])\r\n\r\nif low >= upp:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input ()\r\ncount = 0\r\nfor i in range ( len (s) ):\r\n if ord ( s[i] ) < 97: count += 1\r\nif 2*count > len (s): print( s. upper() )\r\nelse: print (s. lower() )", "s, low, up = input(), 0, 0\r\nfor x in s:\r\n if ord(x) <= 90: up += 1\r\n else: low += 1\r\nif up > low: print(s.upper())\r\nelse: print(s.lower())", "s=input()\r\nc,k=0,0\r\nfor i in range(len(s)):\r\n if ord(s[i])>91:\r\n c=c+1\r\n else:\r\n k=k+1\r\nprint(s.lower() if c>=k else s.upper())", "inp = input()\r\namtLower = sum(1 for i in inp if i >= 'a' and i <= 'z')\r\nif amtLower >= (len(inp)+1) // 2:\r\n print(inp.lower())\r\nelse:\r\n print(inp.upper())", "s = input()\r\n\r\nn = len(s)\r\n\r\nupCount = 0\r\nfor i in range(n):\r\n\tif s[i].isupper():\r\n\t\tupCount = upCount+1\r\n\t\t\r\nif upCount*2>n:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s = input()\nlow = 0\nup = 0\n\nfor i in s:\n if i.islower(): low+=1\n else : up+=1\n\nif(low>=up): s = s.lower()\nelse: s = s.upper()\n\nprint(s)\n", "p=str(input())\r\ncountup=0\r\ncountlow=0\r\nfor i in range(len(p)):\r\n if ord(p[i])<97:\r\n countup=countup+1\r\n else:\r\n countlow=countlow+1\r\nif countup>countlow:\r\n print(p.upper())\r\nelse:\r\n print(p.lower())\r\n", "s = input()\r\nans = \"\"\r\nU, L = 0, 0 \r\nfor el in s:\r\n if el.islower():L+=1\r\n else:U+=1\r\n ans += el.capitalize()\r\nif U > L:print(ans)\r\nelse:print(s.casefold())", "s=input()\r\na=0\r\nc=0\r\nm=\"qwertyuiopasdfghjklzxcvbnm\"\r\nb=\"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nm1=[]\r\nfor i in s:\r\n if i in m:\r\n a+=1\r\n for u in range(len(m)):\r\n if i==m[u]:\r\n m1.append(u)\r\n else:\r\n c+=1\r\n for u in range(len(b)):\r\n if i==b[u]:\r\n m1.append(u)\r\nif c>a:\r\n x=str()\r\n for i in m1:\r\n x+=b[i]\r\n print(x)\r\nelse:\r\n x=str()\r\n for i in m1:\r\n x+=m[i]\r\n print(x)", "s = input() \r\ncap=0\r\nsmall = 0\r\nfor i in s:\r\n if i.isupper():\r\n cap+=1\r\n else:\r\n small+=1\r\nif cap <= small:\r\n \r\n print(s.lower())\r\nelse:\r\n \r\n print(s.upper())", "import sys\r\ninput=sys.stdin.readline\r\ntemp=[0]*26\r\nname=input()\r\nuppercase=0\r\nlowercase=0\r\nfor i in range(0,len(name)-1):\r\n if name[i].islower():\r\n lowercase+=1\r\n else:\r\n uppercase+=1\r\nif uppercase>lowercase:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())\r\n", "word = str(input())\r\ncap = len(list(filter(lambda a:a.isupper(),word)))\r\nprint(word.upper() if cap > (len(word)-cap) else word.lower())\r\n", "txt=input()\r\nu=l=0\r\nfor i in txt:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nprint(txt.lower() if l>=u else txt.upper())", "word=input()\r\nu_word=word.upper()\r\nl_word=word.lower()\r\nl=len(word)\r\nx,y=0,0\r\nfor i in range(l):\r\n if word[i]==u_word[i]:\r\n x=x+1\r\n else:\r\n y=y+1\r\nif x>y:\r\n print(u_word)\r\nelse:\r\n print(l_word)\r\n", "word=(input())\r\nn=len(word)\r\nref='abcdefghijklmnopqrstuvwxyz'\r\nbig=0\r\nsmall=0\r\n\r\nfor letter in word:\r\n if letter in ref:\r\n small+=1\r\nbig=n-small\r\n\r\nif(big>small):\r\n print(word.upper())\r\n\r\nelse:\r\n print(word.lower())\r\n\r\n \r\n", "word = input()\r\nc = 0\r\nv = 0\r\nfor i in word:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n v+=1\r\nif v<c:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\ncap, low = 0,0\nfor i in word:\n\tchar = ord(i)\n\tif 65<=char<=90:\n\t\tcap +=1\n\telif 97<=char<=122:\n\t\tlow +=1\nif low>=cap:\n\tprint(word.lower())\nelse:\n\tprint(word.upper())", "s=input()\r\ncount_u=0\r\ncount_l=0\r\nc=''\r\nfor i in range (len(s)):\r\n if 90>=ord(s[i])>=65 :\r\n count_u+=1\r\n else:\r\n count_l+=1\r\nif count_u==count_l:\r\n new_s=s.lower()\r\n print(new_s)\r\nelif count_u>count_l:\r\n for i in range (len(s)):\r\n new_s=s[i].capitalize()\r\n c+=new_s\r\n print(c)\r\nelif count_u<count_l:\r\n new_s=s.lower()\r\n print(new_s)\r\n \r\n", "s = input('')\r\ncap = ['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\nlower = ['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\nUP = []\r\nDN = []\r\nfor ch in s:\r\n if ch in cap:\r\n UP.append(ch)\r\n elif ch in lower:\r\n DN.append(ch)\r\n\r\nif len(UP) > len(DN):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def convertToUpperLower(string):\r\n countUpper = 0\r\n countLower = 0\r\n for i in string:\r\n if (i.islower()):\r\n countLower +=1\r\n else:\r\n countUpper +=1\r\n if countLower > countUpper:\r\n return string.lower()\r\n elif countUpper > countLower:\r\n return string.upper()\r\n else:\r\n return string.lower()\r\nname = input()\r\nprint(convertToUpperLower(name))", "word = input()\r\n\r\nuppers = 0\r\nlowers = 0\r\nfor char in word:\r\n if char.isupper():\r\n uppers += 1\r\n else:\r\n lowers += 1\r\nif uppers == lowers:\r\n print(word.lower())\r\nelif uppers > lowers:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "def countCase(s):\r\n u,l=0,0\r\n for i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n return l>=u\r\ns=input()\r\nif countCase(s):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "word= input()\r\nuppercase_count = sum (1for letter in word if letter.isupper())\r\nlowercase_count = sum (1for letter in word if letter.islower())\r\nif uppercase_count > lowercase_count:\r\n result=word.upper()\r\nelse:\r\n result = word.lower()\r\nprint(result)\r\n", "lulz = input()\r\nl_lulz = len(lulz)\r\n\r\nl = 0\r\nu = 0\r\nfor i in lulz:\r\n if (i.islower()):\r\n l+=1\r\n else:\r\n u+=1\r\n\r\n\r\nif l>u:\r\n print(lulz.lower())\r\nelif l==u:\r\n print(lulz.lower())\r\nelse:\r\n print(lulz.upper())\r\n", "a=input()\r\nc=len(a)\r\nb=0\r\nfor i in a:\r\n if i.isupper():\r\n b=b+1\r\nif ((c-b)>=b):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "x = list(input())\r\nz = 0\r\nfor y in x:\r\n if y.isupper():\r\n z+=1\r\nprint(\"\".join([y.lower() for y in x])) if z<=len(x)/2 else print(\"\".join([y.upper() for y in x]))\r\n", "#If majority letters are lowercase, print lowercase word.Do the same for uppercase\r\n\r\nn=input()\r\nl=u=0\r\nfor i in range(len(n)):\r\n if n[i].islower():\r\n l+=1\r\n elif n[i].isupper():\r\n u+=1\r\nprint(n.upper()) if u>l else print(n.lower()) \r\n \r\n", "s = input()\r\nt = s.lower()\r\nden = 0\r\nfor i in range(len(s)):\r\n if s[i] != t[i]:\r\n den += 1\r\nif den > len(s) - den:\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "s = input()\nlo = 0\nup = 0\nfor i in s:\n if i == i.lower():\n lo += 1\n else:\n up += 1\n\nif lo >= up:\n print(s.lower())\nelse:\n print(s.upper())\n ", "a=input()\r\nx=0\r\ny=0\r\nz=0\r\nwhile x<len(a) and 1<=len(a)<=100:\r\n if a[x] in 'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n y=y+1\r\n else:\r\n z=z+1\r\n x=x+1\r\n\r\nif z>=y:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "def read() -> int:\r\n return int(input())\r\n\r\n\r\ndef read_list() -> list:\r\n return list(map(int, input().split()))\r\n\r\n\r\ns = input()\r\nl = 0\r\nu = 0\r\nfor c in s:\r\n cs = str(c)\r\n if cs.islower():\r\n l += 1\r\n elif cs.isupper():\r\n u += 1\r\nif l >= u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "string = input()\ncount_upper =count_lower = 0\nfor char in string:\n if char.isupper():\n count_upper+=1\n else:\n count_lower+=1\n \nif count_lower == count_upper:\n string = string.lower()\nelif count_lower>count_upper:\n string = string.lower()\nelse:\n string = string.upper()\nprint(string)", "s=input()\r\na,b=[],[]\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n a.append(s[i])\r\n else:\r\n b.append(s[i])\r\nif len(a)>len(b):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = list(input())\r\nif sum(1 for c in word if c.isupper()) > sum(1 for c in word if c.islower()):\r\n print(''.join(word).upper())\r\nelse:\r\n print(''.join(word).lower())\r\n", "word=str(input())\r\nupp=0\r\nlow=0\r\nfor i in word:\r\n if i.isupper():\r\n upp+=1\r\n else:\r\n low+=1\r\nif low>=upp:\r\n word=word.lower()\r\nelse:\r\n word=word.upper()\r\nprint(word)", "ch=input()\r\n\r\ns=0\r\nfor e in ch:\r\n if(e==e.upper()):\r\n s+=1\r\n else:\r\n s-=1\r\n\r\nif(s<=0):\r\n print(ch.lower())\r\nelse:\r\n print(ch.upper()) ", "string = input()\r\n\r\nu = 0\r\nfor char in string:\r\n if char.isupper():\r\n u += 1\r\n\r\nif u > len(string)//2:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "str=input()\r\nx=0\r\ny=0\r\nfor i in str:\r\n if(i.islower()):\r\n x +=1\r\n elif(i.isupper()):\r\n y +=1\r\nif(x>=y):\r\n str=str.lower()\r\nelse:\r\n str=str.upper()\r\nprint(str)", "str=input()\r\ncount=0\r\nl=len(str)//2\r\nfor i in str:\r\n\tif i.isupper():\r\n\t\tcount=count+1\r\nif count>l:\r\n\tprint(str.upper())\r\nelse:\r\n\tprint(str.lower())\r\n", "a= input()\r\na1=0\r\na2=0\r\nfor i in range(len(a)):\r\n if(a[i].islower()):\r\n a1+=1\r\n else:\r\n a2+=1\r\nif a2>a1:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s = input()\r\nl, b = 0, 0\r\nfor c in s:\r\n if c != c.lower():\r\n b += 1\r\n else:\r\n l += 1\r\n\r\nif l >= b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\nsmall = 0\ncapital = 0\nfor i in range(len(s)):\n if s[i].isupper():\n capital = capital+1\n else:\n small = small+1\nif capital>small:\n print(s.upper())\nelse:\n print(s.lower())\n \t \t\t\t \t\t\t\t\t\t\t \t \t\t\t", "def low(x):\n\tbla = 0\n\tfor i in x:\n\t\tif i in \"qwertyuiopasdfghjklzxcvbnm\":\n\t\t\tbla+=1\n\treturn bla\n\na = input()\n\n\nif len(a)-low(a) <= low(a):\n\tprint(a.lower())\nelse:\n\tprint(a.upper())\n# 1506619429259\n", "s = input()\r\na, b = 0, 0\r\nn = len(s)\r\nfor x in s:\r\n if x.isupper():\r\n a += 1\r\nb = n - a\r\nif a > b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(a)):\r\n if ord(a[i]) < ord('a'):\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n for i in range(len(a)):\r\n if ord(a[i]) >= ord('a'):\r\n print(chr(ord(a[i]) - ord('a') + ord('A')) , end = \"\")\r\n else:\r\n print(a[i] , end = \"\")\r\nelse:\r\n for i in range(len(a)):\r\n if ord(a[i]) < ord('a'):\r\n print(chr(ord(a[i]) + ord('a') - ord('A')) , end = \"\")\r\n else:\r\n print(a[i] , end = \"\")", "s = input()\r\nuppercase = lowercase = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n uppercase += 1\r\n elif s[i].islower():\r\n lowercase += 1\r\n\r\nprint(s.lower() if lowercase >= uppercase else s.upper())\r\n", "def leter_replace():\n\n p = str(input())\n\n up = 0\n lo = 0\n\n for i in range(0, len(p)):\n if p[i].isupper():\n up += 1\n else:\n lo += 1\n \n if up > lo:\n p = p.upper()\n \n elif up == lo:\n p = p.lower()\n\n else:\n p = p.lower()\n\n print(p)\n\nleter_replace()\n\t \t \t \t\t\t \t \t \t\t \t \t \t \t", "word = input()\r\nlisted_word = list(word)\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor i in listed_word:\r\n if i.upper() == i:\r\n count_upper += 1\r\n if i.lower() == i:\r\n count_lower += 1\r\n\r\nif count_lower > count_upper or count_upper == count_lower:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "x = input()\r\nif len(x) < 1 or len(x) > 100:\r\n exit()\r\nupper = 0\r\nlower = 0\r\nc = 0\r\nwhile c < len(x):\r\n if ord(x[c]) >= 97 and ord(x[c]) <= 122:\r\n lower += 1\r\n elif ord(x[c]) >= 65 and ord(x[c]) <= 90:\r\n upper += 1\r\n c += 1\r\nif lower > upper:\r\n print(x.lower())\r\nelif upper > lower:\r\n print(x.upper())\r\nelif lower == upper:\r\n print(x.lower())\r\n", "s=input()\r\nss=''\r\ndhoa=0\r\ndthuong=0\r\nfor i in s:\r\n if 'A'<=i<='Z':\r\n dhoa+=1\r\n else:\r\n dthuong+=1\r\nif (dthuong-dhoa>=0):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\ncount = 0\r\nnocount = 0\r\nfor i in s:\r\n if i.isupper() == True:\r\n count += 1\r\n else:\r\n nocount += 1\r\nif count > nocount:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = str(input())\r\nword_list = list(word)\r\ncount_small = 0\r\ncount_capital = 0\r\nfor i in range(len(word)):\r\n a = word[i]\r\n if \"a\" <= a <= \"z\":\r\n count_small += 1\r\n else:\r\n count_capital += 1\r\nif count_small >= count_capital:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "word = input()\r\ncount = 0\r\nCOUNT = 0\r\nfor i in range (0, len(word)):\r\n if 65 <= ord(word[i]) <= 90:\r\n COUNT += 1\r\n else:\r\n count += 1\r\nif count < COUNT :\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n ", "print(s.upper() if len(list(filter(lambda x: x.isupper(), (s := input())))) > len(s) / 2 else s.lower())", "word = input()\r\nlowercase_count = sum(1 for c in word if c.islower())\r\nuppercase_count = len(word) - lowercase_count\r\n\r\nif lowercase_count >= uppercase_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "a=str(input())\r\nt=0\r\nu=0\r\nfor i in range(len(a)):\r\n if ord(a[i]) >=65 and ord(a[i])<=90:\r\n t=t+1\r\n else:\r\n u=u+1\r\nif t>u:\r\n c=a.upper()\r\nelse:\r\n c=a.lower()\r\nprint(c)", "word = input() \r\ncount_1 = 0 \r\ncount_2 = 0\r\nfor char in word:\r\n if char.isupper():\r\n count_2 += 1 \r\n else:\r\n count_1 += 1 \r\nif count_2 > count_1:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n = input()\r\nlower_counter = 0\r\nupper_counter = 0\r\nword = ''\r\n\r\nfor letter in n:\r\n if letter.islower():\r\n lower_counter += 1\r\n elif letter.isupper():\r\n upper_counter += 1\r\nif upper_counter > lower_counter:\r\n word = n.upper()\r\nelse:\r\n word = n.lower()\r\n \r\nprint(word)\r\n", "n=input()\ncount1=0\ncount2=0\nfor i in n:\n if(i.isupper()):\n count1+=1\n else:\n count2+=1 \nif(count1>count2):\n print(n.upper())\nelse:\n print(n.lower())\n\n\n#maTRIx", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\ns = input().rstrip()\r\nn = len(s)\r\nif sum([1 for c in s if 65 <= ord(c) <= 90]) * 2 > n:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\n# print(ord(\"a\"),ord(\"z\"),ord(\"A\"),ord(\"Z\"))\r\nl,h = 0,0\r\nfor i in s:\r\n if ord(i)>=97 and ord(i) <= 122:\r\n l += 1\r\n else:\r\n h += 1\r\n# print(l,h)\r\nif l>=h:\r\n s = s.lower()\r\n print(s)\r\nelse:\r\n s = s.upper()\r\n print(s)", "s = input()\r\ncnt_low = cnt_up = 0\r\nfor i in s:\r\n if i == i.lower():\r\n cnt_low += 1\r\n else:\r\n cnt_up += 1\r\nif cnt_low >= cnt_up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n = list(input())\r\ncount_big = 0\r\ncount_small = 0\r\nfor i in n:\r\n if i == str(i).lower():\r\n count_small += 1\r\n else:\r\n count_big += 1\r\nif count_small >= count_big:\r\n print(str(''.join(n)).lower())\r\nelse:\r\n print(str(''.join(n)).upper())", "s = str(input())\r\nl = list(s)\r\ndef checkString():\r\n n = 0\r\n caps = 0\r\n lows = 0\r\n\r\n while n != len(l):\r\n if l[n].isupper() == True:\r\n caps += 1\r\n else:\r\n lows += 1\r\n n += 1\r\n\r\n if lows >= caps:\r\n final = [x.lower() for x in l]\r\n print(\"\".join(final))\r\n else:\r\n final = [x.upper() for x in l]\r\n print(\"\".join(final))\r\n\r\ncheckString()\r\n", "s = input()\r\nuppercase, lowercase = 0, 0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\nif lowercase >= uppercase:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\nlow = len(list(filter(lambda x: x >= 'a' and x <= 'z', s)))\nprint(s.upper() if low < len(s) - low else s.lower())\n", "s = input()\r\nu_c,u_l = 0,0\r\nfor i in s:\r\n if(i.isupper()):u_c += 1\r\n else:u_l += 1\r\nif(u_c <= u_l):print(s.lower())\r\nelif(u_c > u_l):print(s.upper())", "s=str(input())\r\ncount=0\r\nl=int(len(s)/2)\r\nfor i in range(len(s)):\r\n if s[i].isupper() == True:\r\n count+=1\r\nif count>(l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\nupper = sum(1 for c in word if c.isupper())\r\nlower = len(word)-upper\r\nif upper>lower:\r\n print(word.upper())\r\nelif upper<=lower:\r\n print(word.lower())\r\n ", "s = input()\r\nuppercase = []\r\nlowercase = []\r\n\r\nfor s1 in s:\r\n lowercase.append(s1) if s1.islower() else uppercase.append(s1)\r\n\r\nif len(lowercase) >= len(uppercase):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\ntotal = sum(1 for i in s)\nupper = sum(1 for i in s if i.isupper())\nlower = total - upper\nif upper > lower:\n print(s.upper())\nelse:\n print(s.lower())\n", "k=input()\nl,u=0,0\nfor i in k :\n if(i>='a' and i<='z'):\n l=l+1\n else:\n u=u+1\nif(l>=u):\n print(k.lower())\nelse:\n print(k.upper())\n\t\t\t \t\t \t \t\t \t\t\t\t", "s=input ().strip()\r\nup=0\r\ndown =0\r\nfor n in s :\r\n if n ==n.upper():\r\n up +=1\r\n else:\r\n down+=1\r\nif up>down:\r\n print (s.upper())\r\nelse:\r\n print (s.lower())", "a = list(input())\r\nlow = []\r\nbig = []\r\n\r\nfor i in range(len(a)):\r\n\tif a[i].islower() == True:\r\n\t\tlow.append(a[i])\r\n\telse:\r\n\t\tbig.append(a[i])\r\n\r\nif len(big) > len(low):\t\r\n\tprint(\"\".join(a).upper())\r\nelse:\t\r\n\tprint(\"\".join(a).lower())\t", "s=input()\r\nc= 0 \r\nd=0\r\n\r\nfor i in range(0,len(s)):\r\n if(ord(s[i])>=65 and ord(s[i])<=90):\r\n c=c+1 \r\n elif(ord(s[i])>=97 and ord(s[i])<=122):\r\n d=d+1\r\nif(c>d):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nlower = \"abcdefghijklmnopqrstuvwxyz\"\r\nupper = set(list(upper))\r\nlower = set(list(lower))\r\nst = input()\r\nl = 0\r\nu = 0\r\nfor i in st:\r\n if(i in upper):\r\n u += 1\r\n else:\r\n l += 1\r\nif(l >= u):\r\n print(st.lower())\r\nelse:\r\n print(st.upper())", "string = input()\r\nup_count = sum(1 for letter in string if letter.isupper())\r\nlc_count = len(string) - up_count\r\nif up_count > lc_count:\r\n crct_string = string.upper()\r\nelse:\r\n crct_string = string.lower()\r\nprint(crct_string)", "a = input(\"\")\r\ns =0\r\nss = 0\r\nfor x in a:\r\n if x.islower() == True:\r\n s += 1\r\n elif x.isupper() == True:\r\n ss += 1\r\nif s >= ss:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "str = input()\r\nx = len(str)\r\nu = 0\r\nl = 0\r\nfor i in range(0, x):\r\n if ord(str[i]) >= 65 and ord(str[i]) <= 90:\r\n u = u + 1\r\n elif ord(str[i]) >= 97 and ord(str[i]) <= 122:\r\n l = l + 1\r\nif l >= u:\r\n print(str.lower())\r\nelif l < u:\r\n print(str.upper())", "a=str(input())\r\nlst=list(a)\r\nlst1=[]\r\nlst2=[]\r\nfor i in lst:\r\n\tif i.isupper()==True:\r\n\t\tlst1.append(i)\r\n\telse:\r\n\t\tlst2.append(i)\r\nif len(lst1)>len(lst2):\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "a=input()\r\nb=list(a)\r\ny=0\r\nY=0\r\nx=['a','b','c','d','e','f','g','h','i','j','k','l','m','n',\r\n 'o','p','q','r','s','t','u','v','w','x','y','z']\r\nX=['A','B','C','D','E','F','G','H','I','J','K','L','M','N',\r\n 'O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\nfor c in a:\r\n if c in x:\r\n y+=1\r\n else:\r\n Y+=1\r\nif Y>y:\r\n a=a.upper()\r\nelse:\r\n a=a.lower()\r\nprint(a)\r\n \r\n", "s = input()\nupper = 0\nlower = 0\n\nfor i in range(len(s)):\n if ord(s[i]) >= 65 and 90 >= ord(s[i]):\n upper+=1\n else:\n lower+=1\n\nif upper > lower:\n print(s.upper())\n\nelse:\n print(s.lower())\n\n\n\n", "s = input()\r\nl = len(s)\r\ncap = 0\r\nfor i in s:\r\n if(i < 'a'):\r\n cap += 1\r\nif(cap <= l - cap):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "x = input()\ny = 0\nz = 0\nfor i in x:\n if ord(i) >= 65 and ord(i) <= 90:\n y = y+1\n elif ord(i) >= 97 and ord(i) <= 122:\n z = z+1\nif y > z:\n print(x.upper())\nelse:\n print(x.lower())\n\n\t\t \t \t \t \t \t\t \t \t\t \t \t \t\t \t\t", "x=input()\r\nc=0\r\ny=0\r\nfor i in x:\r\n if(ord(i)>64 and ord(i)<91):\r\n if(ord(i)==ord(i.upper())):\r\n c=c+1\r\n else:\r\n y=y+1\r\nif(c>y):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "entrada = input()\r\nupper=0\r\nlower=0\r\nfor l in entrada:\r\n if l == l.upper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n\r\nif upper>lower:\r\n print(entrada.upper())\r\nelse:\r\n print(entrada.lower())", "a = input()\r\ncl = cu = 0\r\nfor i in a:\r\n if i.islower():\r\n cl += 1\r\n else:\r\n cu += 1\r\n\r\nif cl >= cu:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "s = input()\r\nlow , high = 0 ,0\r\nfor i in range(len(s)):\r\n if s[i].islower() == False:\r\n high = high + 1\r\n else:\r\n low = low + 1\r\n \r\nif low >= high:\r\n s = s.lower()\r\n print(s)\r\nelse:\r\n s = s.upper()\r\n print(s)\r\n\r\n", "s=input()\r\nU=0\r\nL=0\r\nfor i in s:\r\n if i.isupper():\r\n U+=1\r\n if i.islower():\r\n L+=1\r\nif L>=U:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\ndivider = len([char for char in s if char.upper() == char])\r\nif divider > 0 and len(s) // divider == 1: \r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "i = input()\nc1 = 0\nc2 = 0\nfor k in i:\n if(k.isupper()):\n c1 += 1\n else:\n c2 += 1\nif(c1 > c2):\n print(i.upper())\nelse:\n print(i.lower())", "s = input()\r\nc_big = 0\r\nc_small = 0\r\nfor item in s:\r\n if item >= 'a' and item <= 'z':\r\n c_small += 1\r\n else:\r\n c_big += 1\r\nif c_small > c_big:\r\n print(s.lower())\r\nelif c_big > c_small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "x = input()\r\nc = 0\r\nfor i in x:\r\n if(i.isupper()): c+=1\r\n \r\nif(c>len(x)/2): print(x.upper())\r\nelse: print(x.lower())", "s = input()\r\nupper = 0\r\nlower = 0\r\nnew_s = \"\"\r\nfor i in s:\r\n if i.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nif upper > lower:\r\n new_s = s.upper()\r\n\r\nelif lower >= upper:\r\n new_s = s.lower()\r\n\r\nprint(new_s)\r\n\r\n", "n = input()\r\nsm = 0\r\nbg = 0\r\nfor i in range(len(n)):\r\n if n[i].lower() == n[i]:\r\n sm += 1\r\n else:\r\n bg += 1\r\nif bg > sm:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "str1=str(input())\r\ncap=0\r\nsmol=0\r\nfor i in str1:\r\n if ord(i)>=65 and ord(i)<=96:\r\n cap+=1\r\n else:\r\n smol+=1\r\nif smol<cap:\r\n print(str1.upper())\r\nelse:\r\n print(str1.lower())", "cadena=input()\ncontador=0\na=int(len(cadena))\nfor i in cadena:\n if ord(i)<91 and ord(i)>=65:\n contador+=1\nif contador<=(a/2):\n print(cadena.lower())\nelse:\n print(cadena.upper())\n \t \t\t \t \t\t\t\t \t\t \t", "s = input()\r\na, b = 0, 0\r\nfor i in range(len(s)):\r\n if 'a' <= s[i] <= 'z':\r\n a += 1\r\n else:\r\n b += 1\r\nif a > b:\r\n s = s.lower()\r\nelif a == b:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)\r\n", "a = input()\r\nbig = 0\r\nsmall = 0\r\nfor i in a:\r\n if \"A\" <= i <= \"Z\":\r\n big += 1\r\n else:\r\n small +=1\r\nif big > small:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "# My Solution\nword = input()\n\nprint([word.lower(), word.upper()][sum(map(str.isupper, word)) > len(word) / 2])\n", "s = input()\r\nn=len(s)\r\nu=s.upper()\r\ndif=0\r\nfor i in range(n):\r\n if s[i]!=u[i]:\r\n dif+=1\r\nif 2*dif>= n:\r\n res= s.lower()\r\nelse:\r\n res=u\r\nprint(res)", "s = input()\r\na, b = 0, 0\r\nfor i in s:\r\n if i.islower():\r\n a += 1\r\n elif i.isupper():\r\n b += 1\r\nif a >= b:\r\n print(s.lower())\r\nelif a < b:\r\n print(s.upper())", "s=input()\r\nprint([s.lower(),s.upper()][sum(x<'[' for x in s)*2>len(s)])", "a=str(input())\r\nb=[i.lower() for i in a]\r\nc=[j for j in a]\r\nd=0\r\np=[]\r\nfor i in c:\r\n if i not in b:\r\n d=d+1\r\nif d>len(c)//2:\r\n for i in b:\r\n p.append(i.upper())\r\nelse:\r\n for i in b:\r\n p.append(i.lower())\r\nf=''\r\nfor i in p:\r\n f=f+str(i)\r\n \r\nprint(f)", "import string \r\n\r\ns=input()\r\nl,u=0,0\r\nfor i in range(len(s)):\r\n if s[i] in list(string.ascii_lowercase):\r\n l+=1 \r\n if s[i] in list(string.ascii_uppercase):\r\n u+=1 \r\nif l<u:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\nlow_num = 0\nup_num = 0\n\nfor character in word:\n if character < character.lower():\n up_num += 1\n elif character > character.upper():\n low_num += 1\n\nif up_num > low_num:\n print(word.upper())\nelse:\n print(word.lower())", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n s = str_input()\r\n low = 0\r\n up = 0\r\n for ch in s:\r\n if ch.islower():\r\n low += 1\r\n else:\r\n up += 1\r\n if up > low:\r\n print(f\"{s.upper()}\\n\")\r\n else:\r\n print(f\"{s.lower()}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\n word = input()\n uppers = 0\n\n for char in word:\n if 64 < ord(char) < 91:\n uppers+=1\n \n if uppers > len(word)-uppers:\n print(word.upper())\n else:\n print(word.lower())\n\nif __name__ == \"__main__\":\n main()", "s = input()\r\nn = len(s)\r\nlower = 0\r\nupper = 0\r\nfor i in range(n):\r\n if(s[i]>='a' and s[i]<='z'):\r\n lower+=1\r\n elif(s[i]>='A' and s[i]<='Z'):\r\n upper+=1 \r\nif lower >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "string=input()\r\ny,v=[],[]\r\nfor i in string:\r\n if ord(i)>=65 and ord(i)<=90:\r\n v.append(i)\r\n else:\r\n y.append(i)\r\nif len(y)>len(v):\r\n print(string.lower())#converting into lowercase\r\nelif len(v)>len(y):\r\n print(string.upper())#converting into uppercase\r\nelse:\r\n print(string.lower())", "s = input()\nlow = 0\nup = 0\n\nfor i in s:\n if i == i.lower():\n low += 1\n else:\n up += 1\nif low == up:\n print(s.lower())\nelif low > up:\n print(s.lower())\nelse:\n print(s.upper())", "s = input()\n\nlowerCount = sum(map(str.islower, s))\nupperCount = sum(map(str.isupper, s))\n\nif (lowerCount > upperCount or lowerCount >= upperCount):\n print(s.lower())\nelse: \n print(s.upper())", "import re\r\ns=input()\r\nl=re.findall('[a-z]',s)\r\nu=re.findall('[A-Z]',s)\r\nif(len(l)>len(u) or len(l)==len(u)):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "s = input()\r\nku = 0\r\nkl = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n ku += 1\r\n elif s[i].islower():\r\n kl += 1\r\nif ku > kl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word=input()\r\na,b=0,0\r\nfor i in word:\r\n if i.isupper():\r\n a+=1\r\n else:\r\n b+=1\r\nif a==b or b>a:\r\n print(word.lower())\r\nelif a>b:\r\n print(word.upper())", "s=input()\r\ncntu=0\r\ncntl=0\r\nfor i in s:\r\n if i.isupper():\r\n cntu+=1\r\n else:\r\n cntl+=1\r\n\r\nif(cntu>cntl):\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)", "word = input()\r\nif sum(1 for c in word if c.isupper()) > sum(1 for c in word if c.islower()): \r\n print(word.upper())\r\nelse: print(word.lower())", "s=input()\r\np=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',\r\n'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\np1=['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K',\r\n'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\npq=0\r\npq1=0\r\nfor i in s:\r\n if i in p:\r\n pq=pq+1\r\n if i in p1:\r\n pq1=pq1+1\r\nif(pq>=pq1):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "s = input()\r\nl = 0\r\nn = 0\r\nfor c in s:\r\n if c.isupper():\r\n l+=1\r\n elif c.islower():\r\n n+=1\r\n\r\nif(l>n):\r\n print(s.upper())\r\nelif(l == n):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s1 = input()\r\nj = k = 0\r\nfor i in s1:\r\n if (i >= 'a') and i <= 'z':\r\n j += 1\r\n elif (i >= 'A') and i <= 'Z':\r\n k += 1\r\n\r\nif k > j:\r\n print(s1.upper())\r\nelse:\r\n print(s1.lower())", "s = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\nif upper_count > lower_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nsmall, caps = 0, 0\r\nfor i in s:\r\n\tif i == i.upper():\r\n\t\tcaps += 1\r\n\telse:\r\n\t\tsmall += 1\r\nif small >= caps:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "x=input()\r\nlower=0\r\nupper=0\r\nfor i in x:\r\n if i.islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper == lower or lower>upper:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "def transform_word(word):\r\n uppercase_count = sum(1 for c in word if c.isupper())\r\n lowercase_count = len(word) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\nword = input()\r\ntransformed_word = transform_word(word)\r\nprint(transformed_word)\r\n", "s=input()\r\nl=len(s)\r\ncount=0\r\nfor _ in s:\r\n if _>='a' and _<='z':\r\n count+=1\r\nif count>=(l/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "#lllalaooalaafdfqlsokaknw\nx= str(input())\ncontador=0\ncount=0\nfor caracter in x:\n if \"a\"<= caracter <=\"z\":\n contador += 1\n else:\n count+= 1\nif contador >= count:\n x=x.lower()\n print(x)\nelse:\n x=x.upper()\n print(x)\n \t\t \t\t \t \t\t\t\t \t \t\t \t \t\t\t\t\t\t", "word=input()\r\na=word.upper()\r\nb=word.lower()\r\nr=0\r\nfor i in range(len(word)):\r\n if word[i]==a[i]:\r\n r=r+1\r\n else:\r\n r=r-1\r\nif r>0:\r\n print(a)\r\nelse:\r\n print(b)", "s = input()\r\nbig_letter = 0\r\nsmall_letter = 0\r\nfor i in s:\r\n if i.isupper():\r\n big_letter += 1\r\n if i.islower():\r\n small_letter += 1\r\nif big_letter > small_letter:\r\n print(s.upper())\r\nif small_letter >= big_letter:\r\n print(s.lower())\r\n", "def word(w):\r\n c = 0 #count capital letters\r\n s = 0 # count small letters\r\n for i in w:\r\n if i.isupper():\r\n c +=1\r\n else :\r\n s+=1\r\n if c > s:\r\n w = w.upper()\r\n else:\r\n w = w.lower()\r\n return w\r\nw = input()\r\nprint(word(w))", "l=input()\r\nup=0\r\nlow=0\r\nfor i in l:\r\n if(ord(i)<91):\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n l=l.upper()\r\n print(l)\r\nelse:\r\n l=l.lower()\r\n print(l)\r\n ", "s=input()\ncapital=0\nsmall=0\nfor i in s:\n if ord(i)>=65 and ord(i)<=90:\n capital+=1\n elif ord(i)>=97 and ord(i)<=122:\n small+=1\n \nif capital<=small:\n print(s.lower())\nelse:\n print(s.upper())\n#print(s)", "n = input()\r\nc = ''\r\nlc = 0\r\nuc = 0\r\nfor i in n:\r\n if i >= 'a' and i <= 'z':\r\n lc += 1\r\n else:\r\n uc += 1\r\n\r\nif lc >= uc:\r\n for i in n:\r\n if i >= 'a' and i <= 'z':\r\n c += i\r\n else:\r\n c += chr(ord(i) + 32)\r\nelse:\r\n for i in n:\r\n if i >= 'A' and i <= 'Z':\r\n c += i\r\n else:\r\n c += chr(ord(i) - 32)\r\n\r\nprint(c)\r\n# c += i\r\n# c += chr(ord(i) + 32)\r\n", "num = input()\r\nalpha = 0\r\nlower = 0\r\nfor i in num:\r\n if i.isupper():\r\n alpha += 1\r\n else:\r\n lower += 1\r\nprint(num.upper()) if alpha > lower else print(num.lower())", "def fun(s):\r\n l,u=0,0\r\n for i in s:\r\n if i.islower():\r\n l+=1\r\n else:\r\n u+=1\r\n if l>=u:\r\n return s.lower()\r\n return s.upper()\r\n\r\nprint(fun(input()))", "x = input()\r\ns = 0\r\nc = 0\r\nfor i in x:\r\n if i.islower():\r\n s += 1\r\n if i.isupper():\r\n c += 1\r\nif s>= c:\r\n print(x.lower())\r\nif s<c:\r\n print(x.upper())", "s=input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n count1=count1+1\r\n if s[i].isupper():\r\n count2=count2+1\r\nif count1>count2:\r\n r=s.lower()\r\nif count1<count2:\r\n r=s.upper()\r\nif count1==count2:\r\n r=s.lower()\r\nprint(r)\r\n", "a = input()\r\nm = list(a)\r\nb = 0\r\nn = 0\r\nfor i in m:\r\n if i.isupper():\r\n b += 1\r\n else:\r\n n += 1\r\nif b > n:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "a=0\r\nb=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if s[i] in 'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n a+=1\r\n if s[i] in 'qwertyuiopasdfghjklzxcvbnm':\r\n b+=1\r\nif a>b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "string=input()\r\nu=0\r\nl=0\r\nfor a in string:\r\n if (a.isupper() == True):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "a = input()\r\nsum1 = sum2=0\r\nfor i in a:\r\n if i.isupper():\r\n sum1+=1\r\n elif i.islower():\r\n sum2+=1\r\n#print(sum1,sum2)\r\nif sum1 > sum2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "a=0\r\nb=0\r\ns=input()\r\nx=len(s)\r\nfor i in s:\r\n if(i.isupper()):\r\n a+=1\r\n elif(i.islower()):\r\n b+=1\r\nif(a>b):\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)", "str=input()\r\nc1=0\r\nc2=0\r\nfor i in str:\r\n if(i.islower()):\r\n c1=c1+1\r\n elif(i.isupper()):\r\n c2=c2+1\r\n\r\nl=str.lower()\r\nh=str.upper()\r\nif(c1>=c2):\r\n print(l)\r\nelse:\r\n print(h) \r\n", "s=input()\r\ncnt1=0\r\ncnt2=0\r\nfor i in s:\r\n\tif i.isupper():\r\n\t\tcnt1=cnt1+1\r\n\telse:\r\n\t\tcnt2=cnt2+1\r\n\r\nif cnt1>cnt2:\r\n\tprint (s.upper())\r\nelse:\r\n\tprint (s.lower())\r\n", "s = input()\r\ncnt = 0\r\n\r\nfor c in s:\r\n if c.isupper():\r\n cnt += 1\r\n\r\nif cnt > len(s) - cnt:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\ns = list(s)\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(s)):\r\n if s[i] == str.upper(s[i]):\r\n upper += 1\r\n else:\r\n lower += 1\r\ns = ''.join(s)\r\nif upper > lower:\r\n print(str.upper(s))\r\nelse:\r\n print(str.lower(s))", "s=input()\r\nc1,c2=0,0\r\na=\"qwertyuiopasdfghjklzxcvbnm\"\r\nfor i in s:\r\n if(i in a):\r\n c1+=1\r\n else:\r\n c2+=1\r\nif(c1>=c2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "ins = input()\r\ncnu = 0\r\ncnl = 0\r\nfor i in range(len(ins)):\r\n if ins[i].isupper():\r\n cnu+=1\r\n elif ins[i].islower():\r\n cnl+=1\r\nif cnl >= cnu :\r\n print(ins.lower())\r\nelse:\r\n print(ins.upper())", "s=input()\r\nlc,up=0,0\r\nfor i in s:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n lc+=1\r\nprint(s.upper() if up>lc else s.lower())\r\n", "# cook your dish here\r\nst = input()\r\nlc=0\r\nuc=0\r\nfor i in st:\r\n if(i.isupper()):\r\n uc += 1\r\n else:\r\n lc += 1\r\nif(lc >= uc):\r\n print(st.lower());\r\nelif(lc < uc):\r\n print(st.upper())", "import string\r\nn = input()\r\n\r\ncountl = 0\r\ncountu = 0\r\nfor a in n:\r\n if (a.islower()):\r\n countl += 1\r\n else:\r\n countu += 1\r\n\r\nif countl > countu:\r\n print(n.lower())\r\nelif countl < countu:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n \r\n", "n=input()\r\nz=n.upper()\r\nx=0\r\nw=len(n)\r\nfor i in range(w):\r\n if z[i]==n[i]:\r\n x+=1\r\nif w-x<x:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "\r\n\r\ndef solution():\r\n str = input()\r\n n = len(str)\r\n cnt_small = cnt_big = 0\r\n for i in range(n):\r\n if str[i].islower():\r\n cnt_small+=1\r\n else:\r\n cnt_big+=1\r\n if cnt_big > cnt_small:\r\n print(str.upper())\r\n else:\r\n print(str.lower())\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n\r\n\r\n", "import string\r\nword=input()\r\nlower=0\r\nupper=0\r\nfor i in word:\r\n if i in string.ascii_uppercase:\r\n upper+=1\r\n else:\r\n lower+=1\r\nif lower>=upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "s = input()\r\nif sum(map(str.isupper,s)) > sum(map(str.islower,s)):\r\n print(s.upper())\r\nelif sum(map(str.isupper,s)) < sum(map(str.islower,s)):\r\n print(s.lower())\r\nelif sum(map(str.isupper,s)) == sum(map(str.islower,s)):\r\n print(s.lower())", "word=str(input())\r\ncount=0\r\nfor letter in word:\r\n if letter.isupper():\r\n count+=1\r\nif count>len(word)-count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nj = s.lower()\r\nk = s.upper()\r\nn = len(s)\r\nlower = 0\r\nupper = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n lower += 1\r\n else:\r\n upper+=1\r\nif lower>=n/2:\r\n print(j)\r\nelif upper>n/2:\r\n print(k)", "word = input()\r\nn=0\r\nfor x in word:\r\n if x.isupper() == True:\r\n n=n+1\r\n\r\nif n > len(word)/2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "x=input()\r\nl=len(x)\r\nup=x.upper()\r\nc=0\r\nfor i in range(l):\r\n if x[i]==up[i]:\r\n c+=1\r\nif c>(l-c):\r\n print(up)\r\nelse:\r\n print(x.lower())", "s=input()\r\ncu=0\r\ncl=0\r\nfor i in s:\r\n if i.isupper():\r\n cu+=1\r\n else:\r\n cl+=1 \r\nif(cl>=cu):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = input()\r\nc1 = 0\r\nc2 = 0\r\nb = \"\"\r\nn = len(a)\r\nfor i in range(n):\r\n if 65 <= ord(a[i]) <= 90:\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nfor i in range(n):\r\n if c1 > c2:\r\n if 97 <= ord(a[i]) <= 122:\r\n b = b + chr(ord(a[i]) - 32)\r\n else:\r\n b = b + a[i]\r\n else:\r\n if 65 <= ord(a[i]) <= 90:\r\n b = b + chr(ord(a[i]) + 32)\r\n else:\r\n b = b + a[i]\r\nprint(b)\r\n", "s = input()\r\nA = 0\r\na = 0\r\nfor c in s:\r\n if ord(c) < 97:\r\n A+=1\r\n else:\r\n a+=1\r\n\r\nif A > a:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "n=input()\r\nn_capital=n_small=0\r\nfor x in n :\r\n s=ord(x)\r\n if s<=65 or s<=90:n_capital+=1\r\n elif s<=97 or s<=122:n_small+=1\r\nif n_capital>n_small:\r\n print(n.upper())\r\nelif n_capital<=n_small:\r\n print(n.lower())", "word = input()\r\nwordLen= len(word)\r\nuppercaseLen=0\r\nfor i in word:\r\n if i.isupper():\r\n uppercaseLen += 1\r\nsmallLen=wordLen-uppercaseLen\r\n\r\nif uppercaseLen>smallLen:\r\n print(word.upper())\r\nelif smallLen>uppercaseLen:\r\n print(word.lower())\r\nelse:\r\n print(word.lower())", "s = input()\r\nl = len(s)\r\ncount = 0\r\nfor i in s:\r\n if i >= 'A' and i <= 'Z':\r\n count += 1\r\nif count / l > 0.5:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "dee=input()\r\nkl=0\r\nfor dk in dee:\r\n if dk.isupper():\r\n kl+=1\r\n\r\nif kl>len(dee)//2:\r\n dee=dee.upper()\r\nelse:\r\n dee=dee.lower()\r\n\r\nprint(dee)", "a = input()\r\nn = 0 \r\nfor i in range (len(a)):\r\n if a[i].islower(): \r\n n+=1\r\n else: \r\n n-=1\r\nif n>=0: \r\n print(a.lower())\r\nelse: \r\n print(a.upper()) ", "s=input()\r\nupcount=lowcount=0\r\nfor i in s:\r\n if i.isupper():\r\n upcount+=1\r\n elif i.islower():\r\n lowcount+=1\r\nif upcount>lowcount:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "up, lo = 0,0\r\na = input()\r\nfor i in a:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n lo+=1\r\nif up > lo:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "a = input()\r\nb = 0\r\nc = 0\r\n\r\nfor i in a:\r\n if (i.isupper()) == True :\r\n b+=1\r\n else:\r\n c+=1\r\n\r\nif b > c :\r\n print(a.upper())\r\nelse :\r\n print(a.lower())\r\n", "n=input()\r\nsum1=0\r\nsum2=0\r\n\r\nfor i in n:\r\n if i.islower(): # i.islower--> to check whether the character is lower\r\n sum1+=1\r\n else:\r\n sum2+=1\r\n\r\nif sum1>=sum2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 6 16:26:40 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\ns = input()\r\nif len([l for l in s if l.upper() == l]) > len(s) // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\r\nlCount = 0\r\nuCount = 0\r\nfor item in string:\r\n if item.islower():\r\n lCount += 1\r\n else:\r\n uCount += 1\r\nif uCount > lCount:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "st=input()\r\nc1=0\r\nc2=0\r\nfor i in range(0,len(st)):\r\n if st[i].isupper():\r\n c1=c1+1\r\n if st[i].islower():\r\n c2=c2+1\r\n\r\nif c1>c2:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())\r\n", "\"\"\"Слово\"\"\"\r\n\r\n\r\ndef main():\r\n word = input()\r\n up, down = 0, 0\r\n for w in word:\r\n if w.islower():\r\n down += 1\r\n else:\r\n up += 1\r\n print(word.upper()) if up > down else print(word.lower())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x = input()\r\na = 0\r\nb = 0\r\nfor char in x:\r\n if char.isupper():\r\n a+=1\r\n else:\r\n b+=1\r\nif a > b:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\r\nlower = 0\r\nupper = 0\r\nfor x in s:\r\n if ord(x) >= 65 and ord(x)<=90:\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\n\r\nlower_case = s.lower()\r\n\r\nlower_case_count = 0\r\nfor i in range(len(s)):\r\n if s[i] == lower_case[i]:\r\n lower_case_count += 1\r\n\r\n\r\n\r\nif lower_case_count >= (len(s) / 2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n\r\n", "def Word(word: str):\r\n \r\n UpperCases = 0\r\n LowerCases = 0\r\n\r\n for letter in word : \r\n if ord(letter) >= 97 :\r\n LowerCases += 1\r\n else :\r\n UpperCases += 1\r\n\r\n if LowerCases >= UpperCases :\r\n return word.lower()\r\n else:\r\n return word.upper()\r\n\r\nword = str(input())\r\nprint(Word(word)) ", "stri = input()\r\n\r\nd={\"UPPER_CASE\":0, \"LOWER_CASE\":0}\r\n\r\nfor i in stri:\r\n if i.isupper():\r\n d[\"UPPER_CASE\"]+=1\r\n else:\r\n d[\"LOWER_CASE\"]+=1\r\n \r\nif(d[\"UPPER_CASE\"]>d[\"LOWER_CASE\"]):\r\n print(stri.upper())\r\nelse:\r\n print(stri.lower())\r\n \r\n", "w=input()\r\nuppcase_count=sum(1 for char in w if char.isupper())\r\nlocase_count=len(w)-uppcase_count\r\nif uppcase_count>locase_count:\r\n cor_w=w.upper()\r\nelse:\r\n cor_w=w.lower()\r\nprint(cor_w)", "n=input()\nx=[]\ncount=0\ncount1=0\nfor i in n:\n if(i.isupper())==True:\n count+=1\n x.append(i)\n else:\n count1+=1\n x.append(i)\nif(count>count1):\n for i in x:\n print(i.upper(),end=\"\")\nelif(count1>count):\n for i in x:\n print(i.lower(),end=\"\")\nelse:\n for i in x:\n print(i.lower(),end=\"\")\n\t\t\t \t \t\t\t\t\t \t\t\t\t \t \t \t\t\t \t", "c=input()\r\nl,u=0,0\r\nfor i in c :\r\n if i.islower():\r\n l+=1\r\n else :\r\n u+=1\r\n\r\nif(l>=u):\r\n print(c.lower())\r\nelse :\r\n print(c.upper())", "s = input()\r\n\r\nmaj = []\r\nmini = []\r\n\r\n\r\nfor i, v in enumerate(s):\r\n if v >= 'a' and v <= 'z':\r\n mini.append(i)\r\n else:\r\n maj.append(i)\r\n\r\nif (len(mini)>=len(maj)):\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)\r\n \r\n ", "if __name__ == \"__main__\":\r\n s = input()\r\n uppercase_counter = 0\r\n lowercase_counter = 0\r\n for char in s:\r\n if char.isupper():\r\n uppercase_counter += 1\r\n else:\r\n lowercase_counter += 1\r\n if uppercase_counter > lowercase_counter:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\n", "s = input()\r\nupp = s.upper()\r\nupcont = 0\r\nlow = s.lower()\r\nlowcont = 0\r\n\r\nfor i in s:\r\n if i in upp:\r\n upcont += 1\r\n elif i in low:\r\n lowcont += 1\r\n\r\nif upcont > lowcont:\r\n print(upp)\r\nelse:\r\n print(low)", "str = input()\r\nlow = 0\r\nup = 0\r\nfor char in str:\r\n if char.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif up > low:\r\n str = str.upper()\r\nelse:\r\n str = str.lower()\r\nprint(str)", "s = input()\r\ncountl, countu = 0, 0\r\nfor i in range(len(s)):\r\n if s[i].isupper() == True:\r\n countu += 1\r\n else:\r\n countl += 1 \r\nif countu > countl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def solve():\r\n s = input()\r\n strList = []\r\n for ele in s:\r\n strList.append(ele)\r\n\r\n cntUpperCase = 0\r\n cntLowerCase = 0\r\n for i in strList:\r\n if i >= 'A' and i <= 'Z':\r\n cntUpperCase += 1\r\n else:\r\n cntLowerCase += 1\r\n\r\n if cntUpperCase > cntLowerCase:\r\n cntUpperCase = True\r\n else:\r\n cntUpperCase = False\r\n\r\n if cntUpperCase:\r\n for i in range(0, len(strList)):\r\n if strList[i] >= 'a' and strList[i] <= 'z':\r\n strList[i] = chr(ord(strList[i]) - 32)\r\n else:\r\n for i in range(0, len(strList)):\r\n if strList[i] >= 'A' and strList[i] <= 'Z':\r\n strList[i] = chr(ord(strList[i]) + 32)\r\n\r\n\r\n s = ''.join(strList)\r\n print(s)\r\nsolve()", "s=input()\r\nlo=0;up=0;\r\nfor i in s:\r\n if(i.islower()):\r\n lo+=1;\r\n elif(i.isupper()):\r\n up+=1;\r\nif(lo>up):\r\n print(s.lower())\r\nelif(up>lo):\r\n print(s.upper())\r\nelif(up==lo):\r\n print(s.lower())\r\n", "upper=['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']\nlower=['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']\ncountU=0\ncountL=0\ns=input()\nfor l in s:\n if(l in upper):\n countU+=1\n else:\n countL+=1\nif(countU>countL):\n print(s.upper())\nelse:\n print(s.lower())\n", "s = str(input())\r\ni1 = 0\r\ni2 = 0\r\narr_en = ['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\narr_EN = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\nfor i in list(s):\r\n if i in arr_en:\r\n i1 += 1\r\n elif i in arr_EN:\r\n i2 += 1\r\nif i1 > i2:\r\n print(s.lower())\r\nif i1 == i2:\r\n print(s.lower())\r\nif i1 < i2:\r\n print(s.upper())", "t = input()\r\n\r\nc1=0\r\nc2=0\r\n\r\nfor i in t:\r\n if i.isupper():\r\n c1+=1\r\n elif i.islower():\r\n c2+=1\r\n \r\nif c1>c2:\r\n x = [i.upper() for i in t]\r\n \r\nelse:\r\n x = [i.lower() for i in t]\r\n \r\nt = \"\".join(x)\r\n\r\nprint(t)", "a = input()\r\nc = 0\r\nfor item in a:\r\n if item.islower():\r\n c += 1\r\nif len(a) - c <= c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "w = input().split()\r\n\r\nlower_list= []\r\nupper_list= []\r\nfinal_list= []\r\nnew_word = \"\"\r\n\r\n\r\nfor i in range(len(str(w))):\r\n if str(w)[i].islower():\r\n lower_list.append(str(w)[i])\r\n elif str(w)[i].isupper():\r\n upper_list.append(str(w)[i])\r\n else:\r\n pass\r\nif len(lower_list) >= len(upper_list):\r\n for i in w:\r\n final_list.append(i.lower())\r\nelse:\r\n for i in w:\r\n final_list.append(i.upper())\r\n\r\nfor i in final_list:\r\n new_word+=i\r\n\r\nprint(new_word)", "# 8 5\r\n# 10 9 8 7 7 7 5 5\r\n\r\n##x = 0 # NOT COMPETED PROBEM==NEXT ROUND\r\n##y=[] # NOT COMPETED PROBEM==NEXT ROUND\r\n##rks, pos = map(int, input().split()) # NOT COMPETED PROBEM==NEXT ROUND\r\n##for _ in range(rks): # NOT COMPETED PROBEM==NEXT ROUND\r\n## a = int(input()) # NOT COMPETED PROBEM==NEXT ROUND\r\n## y.append(a) # NOT COMPETED PROBEM==NEXT ROUND\r\n## # NOT COMPETED PROBEM==NEXT ROUND\r\n##while y[pos] >= y:\r\n## x += 1\r\n##print(x) \r\n\r\nx, y = 0, 0\r\n\r\nstp = input()\r\nfor i in stp:\r\n if i.isupper():\r\n x += 1\r\n elif i.islower():\r\n y += 1\r\nif x > y:\r\n print(stp.upper())\r\nelif x < y:\r\n print(stp.lower())\r\nelif x == y:\r\n print(stp.lower())\r\n", "s = input()\n\nif sum(1 for c in s if c.isupper()) > len(s) / 2:\n print(s.upper())\nelse:\n print(s.lower())\n \t \t \t\t\t\t \t \t\t\t \t \t \t \t", "n=[str(i) for i in input()]\r\ncount=0\r\nfor x in range(len(n)):\r\n if ord(n[x])<97:\r\n count+=1\r\nf=''.join(n)\r\nif count>(len(n))//2:\r\n print(f.upper())\r\nelse:\r\n print(f.lower())\r\n", "s = input()\r\nl = 0\r\nd = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n l += 1\r\n elif i.isupper():\r\n d += 1\r\n\r\nif l >= d:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\n\r\nprint(s)\r\n", "a = input()\r\nbig = 0\r\nfor i in a:\r\n if i.isupper():\r\n big+=1\r\nif big>len(a)-big:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "n,uc,lc = input(),0,0\r\nfor i in n:\r\n if(i.isupper()):\r\n uc=uc+1\r\n elif(i.islower()):\r\n lc=lc+1\r\nif(uc>lc):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n\r\n", "def dif(str1, str2):\r\n return len(str1) - len(list(filter(lambda a: a[0] == a[1], zip(list(str1), list(str2)))))\r\n\r\n\r\nline = input()\r\nupper = line.upper()\r\nlower = line.lower()\r\ndif_upper = dif(line, upper)\r\ndif_lower = len(line) - dif_upper\r\nprint(lower if dif_lower <= dif_upper else upper)\r\n", "s = input()\r\n\r\nlow = 0\r\nup = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n low += 1\r\n else:\r\n up += 1\r\n\r\nif low > up:\r\n print(s.lower())\r\nelif up > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "k=input()\r\nl=0\r\nu=0\r\nfor i in k:\r\n if ord(i)>96:\r\n l+=1\r\n else:\r\n u+=1\r\nif l>=u:\r\n print(k.lower())\r\nelse:\r\n print(k.upper())", "word = input()\r\n\r\nupper=0\r\nlower=0\r\n\r\n\r\nfor i in range(len(word)):\r\n #to lower case letter\r\n if(word[i]>='a' and word[i]<='z'):\r\n lower+=1\r\n #to upper case letter\r\n elif(word[i]>='A' and word[i]<='Z'):\r\n upper+=1\r\n\r\n \r\nif(upper>lower):\r\n #The upper() method converts all uppercase characters in a string into Uppercase \r\n print(word.upper())\r\nelse:\r\n #The lower() method converts all uppercase characters in a string into lowercase \r\n print(word.lower())\r\n \r\n\r\n\r\n\r\n\r\n", "s=input()\r\nl=len(s)\r\ncountl=0\r\ncountu=0\r\nfor i in range(0,l):\r\n if(s[i].islower()):\r\n countl=countl+1\r\n elif(s[i].isupper()):\r\n countu=countu+1\r\n \r\nif(countl>=countu):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "s = input()\r\nup_count, down_count = 0,0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up_count += 1\r\n else:\r\n down_count += 1\r\n\r\nif up_count > down_count:\r\n print(s.upper())\r\nelif up_count < down_count:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "i,c1,c2 = input(),0,0\r\nfor j in i:\r\n if j.isupper():\r\n c1+=1\r\n elif j.islower():\r\n c2+=1\r\nif c1>c2:\r\n print(i.upper())\r\nelse:\r\n print(i.lower())", "# 0059A. Word\r\n# http://codeforces.com/problemset/problem/59/A\r\ndef main():\r\n S = input().rstrip()\r\n l = sum(i.islower() for i in S)\r\n print(S.lower() if l >= len(S) / 2 else S.upper())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def word(T):\r\n l = 0\r\n for i in T:\r\n if i.islower():\r\n l+=1\r\n u = len(T)-l\r\n if u<=l:\r\n return T.lower()\r\n else:\r\n return T.upper() \r\n\r\nT = str(input())\r\nprint(word(T))", "word = input()\r\nlist = []\r\nup = 0\r\nlow = 0\r\nnod = \"\"\r\n\r\n\r\nfor x in word:\r\n list.append(x)\r\n\r\nle = len(list)\r\n\r\nfor x in range(le):\r\n nod = list[x]\r\n if nod.isupper() == True:\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif up > low:\r\n print(word.upper())\r\nelif low > up:\r\n print(word.lower())\r\nelif low == up:\r\n print(word.lower())\r\nelse:pass\r\n\r\n\r\n", "from collections import deque, defaultdict, Counter, OrderedDict\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left, insort_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, merge\r\nfrom copy import deepcopy # must be used in copying list of list etc..(for multi level)\r\nfrom random import shuffle, randint\r\nimport random\r\nfrom operator import xor, or_\r\nfrom typing import List\r\n\r\ns = input()\r\n\r\nup = sum(1 for char in s if char.isupper())\r\n\r\nlow = sum(1 for char in s if char.islower())\r\n\r\nif up > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n", "inp1 = (input().strip())\r\ninp = list(inp1)\r\nsmall = list('abcdefghijklmnopqrstuvwxyz')\r\ncount_small = 0\r\ncount_large = 0\r\nfor i in inp:\r\n if i in small:\r\n count_small += 1\r\n else:\r\n count_large += 1\r\nif count_large>count_small:\r\n print(inp1.upper())\r\nelse:\r\n print(inp1.lower())\r\n\r\n\r\n", "n=input()\r\nuc=0\r\nlc=0\r\nfor c in n:\r\n if c>='A' and c<='Z':\r\n uc+=1\r\n else:\r\n lc+=1\r\nif uc>lc:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s=input()\r\nc=0\r\nn=0\r\nfor i in range(len(s)):\r\n if s[i]>='A' and s[i]<='Z':\r\n c=c+1 \r\n else:\r\n n=n+1 \r\nif(c>n):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "myStr = input()\r\nlow_count = 0\r\nfor c in myStr:\r\n if ord(c)>90:\r\n low_count+=1\r\nif low_count < (len(myStr)/2):\r\n # upper it\r\n print(myStr.upper())\r\nelse:\r\n print(myStr.lower())\r\n", "s = input()\r\na = 0\r\nb = 0\r\nfor char in s:\r\n if char.islower(): a+=1\r\n else: b+=1\r\nif b>a: print(s.upper())\r\nelse: print(s.lower())", "n=input()\r\nc=0\r\nk=0\r\nfor i in n:\r\n if(i.lower()==i):\r\n c=c+1\r\n else:\r\n k=k+1\r\nif(k>c):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "a = str(input())\r\n\r\nb = \",\".join(a)\r\nc = b.split(\",\")\r\n\r\ncheck1 = 0 #lower\r\ncheck2 = 0 #upper\r\n\r\nfor i in range(len(a)):\r\n if c[i].islower() == True:\r\n check1+=1\r\n else:\r\n check2 +=1\r\n\r\nif check1 > check2:\r\n print(a.lower())\r\nelif check1 < check2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n", "x = input()\r\nc = 0\r\nv = 0\r\nfor i in x:\r\n if(i.isupper()):\r\n c = c + 1\r\n elif(i.islower()):\r\n v = v + 1\r\nif(c > v):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "class word:\r\n def check(a):\r\n sav = len([i for i in a if i.isupper()])\r\n get = len([i for i in a if i.islower()])\r\n if sav == get:\r\n return a.lower()\r\n elif sav > get:\r\n return a.upper()\r\n else:\r\n return a.lower() \r\n \r\n\r\n\r\n\r\n\r\na = str(input())\r\nres = word.check(a)\r\nprint(res) \r\n\r\n\r\n ", "str = input()\r\nlower = 0\r\nfor i in range(0,len(str)):\r\n x = ord(str[i])\r\n if x > 96 and x < 123:\r\n lower += 1\r\nupper = len(str) - lower\r\nif lower >= upper:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "m=input()\r\nl,u=0,0\r\nfor i in m:\r\n\tif i.islower():\r\n\t\tl+=1\r\n\telse:\r\n\t\tu+=1\r\nif l>=u:\r\n\tprint(m.lower())\r\nelse:\r\n\tprint(m.upper())", "word = input()\r\ncount = 0\r\nfor i in word:\r\n if i.upper() == i:\r\n count += 1\r\nif count > len(word) // 2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nl=[0,0]\r\nfor i in s:\r\n if i.isupper():\r\n l[0]=l[0]+1\r\n elif i.islower():\r\n l[1]=l[1]+1\r\nif l[0]<=l[1]:\r\n print(s.lower())\r\nelif l[0]>l[1]:\r\n print(s.upper())", "string = input()\r\nupper = 0\r\nlower = 0\r\nfor char in string:\r\n\tif char.isupper():\r\n\t\tupper+=1\r\n\telse:\r\n\t\tlower+=1\r\n\r\nif upper>lower:\r\n\tprint(string.upper())\r\nelse:\r\n\tprint(string.lower())", "s = input()\r\nl = u = 0\r\nfor i in s:\r\n if i.islower():\r\n l += 1\r\n else:\r\n u += 1\r\nif u > l:\r\n r = s.upper()\r\nelse:\r\n r = s.lower()\r\nprint(r)", "name = input()\r\nuppercase = 0\r\nlowercase = 0\r\nfor i in name :\r\n if i.isupper() :\r\n uppercase = uppercase + 1\r\n else :\r\n lowercase = lowercase + 1\r\nif uppercase > lowercase :\r\n print(name.upper())\r\nelse :\r\n \r\n print(name.lower())", "lowers, uppers = 0, 0\r\nletter = input()\r\nfor i in letter:\r\n if ord(i) in range(ord('a'), ord('z') + 1):\r\n lowers += 1\r\n else:\r\n uppers += 1\r\n\r\nif lowers >= uppers:\r\n print(letter.lower())\r\nelse:\r\n print(letter.upper())\r\n", "s=input()\r\nl = sum([x.islower() for x in list(s) ])\r\nu = sum([x.isupper() for x in list(s) ])\r\nif l>u:\r\n print(s.lower())\r\nelif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import math\r\nfrom decimal import *\r\ngetcontext().prec = 30\r\ns=input()\r\nbig=0\r\nfor val in s:\r\n if ord(val)<=90:\r\n big+=1\r\nsmall=len(s)-big\r\nif big>small:\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "def fix_word_register(word):\r\n uppercase_count = sum(1 for letter in word if letter.isupper())\r\n lowercase_count = len(word) - uppercase_count\r\n \r\n if uppercase_count > lowercase_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\nword = input().strip()\r\nfixed_word = fix_word_register(word)\r\nprint(fixed_word)\r\n", "##################################################\r\n# s = input() #\r\n# upp = s[0].upper() #\r\n# res = s[1:] #\r\n# print(upp+res) #\r\n##################################################\r\n\r\n\r\n# a = s[0].upper()\r\n# print(s.replace(s[0], a))\r\n# for i in range(b-1):\r\n# a = s[0].upper()\r\n# print(s.replace(s[0], a))\r\n# break\r\n\r\n\r\n# print(a)\r\n# s.capitalize()\r\n# print(s)\r\n# print(s.index(\"m\")\r\n# print(s.replace(s[0], a))\r\n# print(s)\r\n# print(s.startswith)\r\n# print(s[0])\r\n# s.replace(s[0], s[0].)\r\n# print(s)\r\n\r\n\r\ns = input()\r\nc = 0\r\nd = 0\r\nfor i in s:\r\n if(ord(i) >= 97 and ord(i) <= 122): # lower\r\n c = c+1\r\n else: # upper\r\n d = d+1\r\nif(c >= d):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "import re\n\na = input()\n\nlowers = len(re.findall('[a-z]', a))\n\nuppers = len(re.findall('[A-Z]', a))\n\n\nif lowers >= uppers:\n\tprint(a.lower())\nelse:\n\tprint(a.upper())\n", "x=input()\r\nm=0\r\nb=0\r\nfor i in range(len(x)):\r\n if 91>ord(x[i])>64:\r\n b+=1\r\n elif 123>ord(x[i])>96:\r\n m+=1\r\nif b>m:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n \r\n \r\n\r\n \r\n \r\n", "s=input()\r\nucc=0\r\nlcc=0\r\nfor i in s:\r\n if i.isupper()==True:\r\n ucc+=1\r\n else:\r\n lcc+=1\r\nif lcc>ucc or lcc==ucc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n=input()\r\na=0\r\nb=0\r\n\r\nfor i in range(len(n)):\r\n if ord(n[i])>92:\r\n a+=1\r\n else:\r\n b+=1\r\n\r\nif a>=b:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "word = input()\r\n\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n uppercase+=1\r\n else:\r\n lowercase+=1\r\n\r\nif uppercase > lowercase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "def upper_in_string(_string):\n\tcount = 0\n\tfor c in _string:\n\t\tif c.isupper(): count += 1\n\t\t\n\treturn count\n\nword = input()\n\nupper = upper_in_string(word)\nlower = len(word) - upper\n\nif upper > lower:\n\tprint(word.upper())\nelse:\n\tprint(word.lower())\n", "s = input()\r\na = 0\r\nb = 0\r\nfor i in range(len(s)):\r\n if ord(s[i])>64 and ord(s[i])<91:\r\n a += 1\r\n else:\r\n b += 1\r\nif a>b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(string)):\r\n if string[i].islower():\r\n lower += 1\r\n elif string[i].isupper():\r\n upper += 1\r\nif lower>=upper:\r\n print (string.lower())\r\nelse:\r\n print (string.upper())", "# take input from user\r\n# if input length is equal to number of charc or less , change all letters to lowercase\r\n# if input length is greater than number of charcs , change all letters to uppercase\r\n# if lowercase < uppercase:\r\n\r\n\r\nword = input()\r\n\r\nlowercase = 0\r\nuppercase = 0\r\n\r\nfor i in word:\r\n\r\n if i.islower():\r\n lowercase += 1\r\n elif i.isupper():\r\n uppercase += 1\r\n\r\n\r\n\r\nif lowercase >= uppercase:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n\r\n", "s=input()\r\np=0\r\nl=len(s)\r\nfor i in s:\r\n if i.isupper():\r\n p+=1\r\nq=l-p\r\nif(p>q):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nn = sum(1 for c in s if c.isupper())\r\nif len(s) / 2 >= n:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "from math import ceil\r\ns = input()\r\ncounter = 0\r\nfor i in range(len(s)):\r\n if ord(s[i]) >= 96:\r\n counter += 1\r\nif counter >= ceil(len(s)/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "# import sys\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ns = str(input())\r\nif sum(map(str.islower, s)) >= len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "# your code goes here\r\n# your code goes here\r\na = input()\r\nc,c1 = 0,0\r\nfor i in a:\r\n\tif(i.isupper()):\r\n\t\tc+=1\r\n\telif(i.islower()):\r\n\t\tc1+=1\r\nif(c>c1):\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "a = input()\r\nq = a.lower()\r\nx = len([0 for i in range(len(a)) if a[i] == q[i]])\r\nprint (q if x > (len(a)-1)//2 else a.upper())", "s = input()\nc1 = 0\nc2 = 0\nfor i in s:\n if i.isupper():\n c1 += 1\n if i.islower():\n c2 += 1\nif c1 > c2:\n s = s.upper()\nelse:\n s = s.lower()\nprint(s)\n\t\t \t\t \t \t\t\t \t \t \t \t\t \t \t \t\t \t", "st=input()\r\nlc=0\r\nl=[]\r\nu=[]\r\nuc=0\r\nfor x in st:\r\n if(x.isupper()):\r\n uc+=1\r\n else:\r\n lc+=1\r\n l.append(x.lower())\r\n u.append(x.upper())\r\n\r\nif(uc>lc):\r\n print(''.join(u))\r\nelse:\r\n print(''.join(l))", "s = input()\r\ncount_lower = count_upper = 0\r\nfor i in range(len(s)):\r\n if s[i]>='a' and s[i]<='z':\r\n count_lower+=1\r\n else:\r\n count_upper+=1\r\nif count_lower>=count_upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = input()\r\nb = a.upper()\r\nlength = len(a)\r\nc = 0\r\nfor i in range(length):\r\n if a[i] == b[i]:\r\n c+=1\r\nif c > length//2:\r\n print(b)\r\nelse:\r\n print(a.lower())", "x=input()\r\nn=0\r\nfor i in x:\r\n if i>='a':\r\n n+=1\r\n else:\r\n n-=1\r\nif n>=0:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "slovo = input()\r\nmale,velke = 0,0\r\nfor i in slovo:\r\n if \"A\" <= i <= \"Z\":\r\n velke += 1\r\n else:\r\n male += 1\r\nif male >= velke:\r\n print(slovo.lower())\r\nelse:\r\n print(slovo.upper())", "s = input()\r\nlow=0\r\nhigh=0\r\nfor i in s:\r\n\tif i.islower():\r\n\t\tlow+=1\r\n\telse:\r\n\t\thigh+=1\r\nif low>=high:\r\n\tprint (s.lower())\r\nelse:\r\n\tprint (s.upper())", "def fc(a): ##寻找字符a对应的ASCLL码\r\n for i in range(0,200):\r\n if(chr(i) == str(a)):\r\n return i\r\n\r\ndef judge(a):\r\n if(65 <= fc(a) <= 90): ##大写字母\r\n return False\r\n elif(97 <= fc(a) <= 122): ##小写字母\r\n return True\r\n\r\nlow = 0\r\nup = 0\r\n\r\nword = input()\r\nword1 = []\r\nfor i in range(len(word)):\r\n if judge(word[i]):\r\n low += 1\r\n else:\r\n up += 1\r\n\r\nif(low >= up):\r\n for i in range(len(word)):\r\n word1.append(word[i].lower())\r\nelse:\r\n for i in range(len(word)):\r\n word1.append(word[i].upper())\r\n\r\nprint(''.join(word1))\r\n", "def fun():\r\n s=input()\r\n up=0\r\n lo=0\r\n for i in s:\r\n if i.islower():\r\n lo+=1\r\n else:\r\n up+=1\r\n if lo>=up:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n \r\nfun()", "x=input()\r\nc=0\r\nfor i in x:\r\n if i.isupper():\r\n c+=1\r\n if i.islower():\r\n c-=1\r\nif c>0:\r\n x=x.upper()\r\n print(x)\r\nif c<=0:\r\n x=x.lower()\r\n print(x)", "s = input()\r\nn = len(s)\r\ncount = 0\r\nfor i in range(n):\r\n if s[i].isupper():\r\n count+=1\r\nif count <= n/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a = input()\r\nh = []\r\nj = []\r\nfor m in a:\r\n if ord(m) > 96:\r\n b = ord(m) - 32\r\n h.append(chr(b))\r\nfor k in a:\r\n if ord(k) < 96:\r\n c = ord(k) + 32\r\n j.append(chr(c))\r\nif len(h) < len(j) :\r\n for v in a:\r\n if ord(v) > 96:\r\n b = ord(v) - 32\r\n print(chr(b),end='')\r\n else:\r\n print(v,end='')\r\nelse:\r\n for t in a:\r\n if ord(t) < 96:\r\n c = ord(t) + 32\r\n print(chr(c),end='')\r\n else:\r\n print(t,end='')", "def main():\r\n s=input()\r\n x=0\r\n y=0\r\n for i in s:\r\n if i==i.lower():\r\n x+=1\r\n else:\r\n y+=1\r\n if y>x:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\nmain()", "import string\r\n\r\ns = input()\r\n\r\ndef word(s):\r\n l = 0\r\n u = 0\r\n for letter in s:\r\n if letter.islower() == True:\r\n l += 1\r\n else:\r\n u += 1\r\n if l >= u:\r\n return s.lower()\r\n else:\r\n return s.upper()\r\n\r\nprint(word(s))", "x = input()\r\ncountu=0\r\ncountl=0\r\n\r\nfor i in x:\r\n if i.isupper():\r\n countu+=1\r\n elif i.islower():\r\n countl+=1\r\nif countu>countl:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "s = input()\nupper = len([x for x in s if x.isupper()])\nlower = len([x for x in s if x.islower()])\nif upper > lower:\n print(s.upper())\nelse:\n print(s.lower())\n", "Str = input()\r\nLst = []\r\nLst1 = []\r\nfor i in range(len(Str)):\r\n if Str[i].isupper():\r\n Lst.append(Str[i])\r\n else:\r\n Lst1.append(Str[i])\r\n \r\nif len(Lst) > len(Lst1):\r\n NStr = Str.upper()\r\n print(NStr)\r\nelse:\r\n NStr1 = Str.lower()\r\n print(NStr1)\r\n ", "message = input()\r\n\r\nfinal1 = sum(1 for c in message if c.isupper())\r\nfinal2 = sum(1 for c in message if c.islower())\r\n\r\nif final1 <= final2:\r\n print(message.lower())\r\nelse:\r\n print(message.upper())", "po = input()\r\n\r\n# Count the number of uppercase and lowercase letters in the word\r\nupper_count = 0\r\nlower_count = 0\r\nfor letter in po:\r\n if letter.isupper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n\r\n# Convert the word to all uppercase or all lowercase, depending on the counts\r\nif upper_count > lower_count:\r\n print(po.upper())\r\nelse:\r\n print(po.lower())\r\n", "s = str(input())\r\nb = 0\r\nm = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n b += 1\r\n else:\r\n m += 1\r\nelse:\r\n if b > m:\r\n print(s.upper())\r\n elif b < m:\r\n print(s.lower())\r\n else:\r\n print(s.lower())", "import sys\r\nimport os\r\nimport math\r\n\r\nfrom io import IOBase, BytesIO\r\nmod=int(1e9+7)\r\n\r\n# for modulus factorial \r\n\r\n#fact=[1]\r\n#for i in range(1,100001):\r\n# fact.append((fact[-1]*i)%mod)\r\n#ifact=[0]*100001\r\n#ifact[100000]=pow(fact[100000],mod-2,mod)\r\n#for i in range(100000,0,-1):\r\n# ifact[i-1]=(i*ifact[i])%mod\r\n# def ncr(n,r,p): \r\n# t=((fact[n])*((ifact[r]*ifact[n-r])%p))%p\r\n # return t\r\n\r\ndef modinv(n,p):\r\n return pow(n,p-2,p)\r\ndef gcd(x,y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\ndef inpia(): #takes array as input\r\n return list(map(int,inps().split()))\r\ndef inpsa(): #takes array as input\r\n return list(map(str,inps().split()))\r\ndef inpi():\r\n\treturn int(input())\r\ndef inps():\r\n return input()\r\n\r\nINF=10**18\r\nMINF=-INF\r\n\r\n\r\n\"\"\"***********************************************\"\"\"\r\n\r\ndef main():\r\n s = inps()\r\n n = len(s)\r\n\r\n upper = 0\r\n lower = 0\r\n for i in s:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n \r\n if upper <= lower:\r\n print(s.lower())\r\n elif upper > lower:\r\n print(s.upper())\r\n\r\n######## Python 2 and 3 footer by Pajenegod and c1729\r\n\r\npy2 = round(0.5)\r\nif py2:\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n range = xrange\r\n\r\nBUFSIZE = 8192\r\nclass FastIO(BytesIO):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.writable = \"x\" in file.mode or \"w\" in file.mode\r\n self.write = super(FastIO, self).write if self.writable else None\r\n \r\n def _fill(self):\r\n s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])\r\n return s\r\n def read(self):\r\n while self._fill(): pass\r\n return super(FastIO,self).read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n s = self._fill(); self.newlines = s.count(b\"\\n\") + (not s)\r\n self.newlines -= 1\r\n return super(FastIO, self).readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.getvalue())\r\n self.truncate(0), self.seek(0)\r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n if py2:\r\n self.write = self.buffer.write\r\n self.read = self.buffer.read\r\n self.readline = self.buffer.readline\r\n else:\r\n self.write = lambda s:self.buffer.write(s.encode('ascii'))\r\n self.read = lambda:self.buffer.read().decode('ascii')\r\n self.readline = lambda:self.buffer.readline().decode('ascii')\r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\nif __name__ == '__main__':\r\n main()\r\n#threading.Thread(target=main).start()\r\n\r\n", "s = input()\nupper_len = len(list(filter(lambda c: ord('A') <= ord(c) <= ord('Z'), s)))\nprint(s.upper() if upper_len > len(s) - upper_len else s.lower())\n\t\t\t\t\t \t \t \t\t \t \t\t \t\t\t \t \t \t\t", "word = input() #HoUse\r\nlength = len(word)\r\nuppercase = 0\r\nlowercase = 0\r\nfor i in range(length):\r\n if word[i-1].islower():\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\nif uppercase > lowercase:\r\n new_uppercase = word.upper()\r\n print(new_uppercase) #string이라서 ().upper이라고 하는 건가요 ?-?\r\nelse:\r\n new_lowercase = word.lower()\r\n print(new_lowercase)", "word = input()\ncount = 0\nfor i in word:\n if (i.isupper()):\n count += 1\nif (count > len(word) - count):\n print(word.upper())\nelse:\n print(word.lower())\n", "s = input()\r\nu = sum([c.isupper() for c in s])\r\nprint(s.upper() if u > len(s)//2 else s.lower())", "#import sys \n#sys.stdin = open('input.txt', 'r')\n#sys.stdout = open('output.txt', 'w')\nup = 0\nlo = 0\ns = input()\nfor i in range(len(s)):\n if ord(s[i])>=65 and ord(s[i])<=90:\n up = up + 1\n else:\n lo = lo + 1\nif(up>lo):\n print(s.upper())\nelse:\n print(s.lower())", "c=input()\r\nb=0\r\na=0\r\nfor i in c:\r\n if i.isupper()== True:\r\n b=b+1\r\n else:\r\n a=a+1\r\nif b>a:\r\n print(c.upper())\r\nelse:\r\n print(c.lower())", "n = input()\r\n\r\nlwr_nmbr = 0\r\nuppr_nmbr = 0\r\n\r\nfor i in list(n):\r\n if i.islower() == True:\r\n lwr_nmbr += 1\r\n else:\r\n uppr_nmbr += 1\r\n \r\nif lwr_nmbr == uppr_nmbr:\r\n print(n.lower())\r\n \r\nelif lwr_nmbr > uppr_nmbr:\r\n print(n.lower())\r\n \r\nelse:\r\n print(n.upper())\r\n ", "word = input()\nup = sum([1 if i.isupper() else -1 for i in word])\n\nprint(word.upper() if up>0 else word.lower())\n", "word = list(input())\r\nu, l = 0, 0\r\nfor i in word:\r\n if i.isupper():\r\n u += 1\r\n elif i.islower():\r\n l += 1\r\nword = ''.join(word)\r\nif u > l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n = input()\r\nupper = 0\r\nlower = 0\r\nfor i in n :\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower +=1\r\nif upper > lower:\r\n n= n.upper()\r\nelse:\r\n n =n.lower()\r\nprint(n)", "\n\"\"\"\nCreated on Fri Jan 8 09:33:24 2021\n\n@author: king\n\"\"\"\n#prog for word\nu,l=0,0\nword=input()\n\nfor i in word:\n if i.isupper():u+=1\n else:l+=1\n \nif u>l:print(word.upper())\nelse:print(word.lower())", "a1=str(input())\r\n\r\nx1=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nX2=\"abcdefjhijklmonpqrstuvwxyz\"\r\ncount1=0\r\ncount2=0\r\ncountt=0\r\ncountt2=0\r\nfor i in a1: \r\n if i in x1:\r\n count1+=1\r\n else:\r\n count2+=1\r\nif count1>count2:\r\n print(a1.upper())\r\nelif count1<count2:\r\n print(a1.lower())\r\nelse:\r\n print(a1.lower())\r\n\r\n\r\n\r\n", "s = input()\r\n\r\ncl, cu, len_str = 0, 0, len(s)\r\n\r\nfor i in range(len_str):\r\n if s[i].islower():\r\n cl += 1\r\n else:\r\n cu += 1\r\n\r\nif cu > len_str/2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)", "def get_num(): return list(map(int, input().rstrip().split()))\r\n\r\n\r\ndef main():\r\n string = input()\r\n\r\n upper = 0\r\n lower = 0\r\n for str in string:\r\n if str.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n if upper>lower:\r\n print(string.upper())\r\n else:\r\n print(string.lower())\r\n\r\nmain()\r\n\r\n", "s = input()\r\nL = [x for x in s]\r\nc = l = 0\r\nfor i in L:\r\n if i == i.lower(): l += 1\r\n else: c += 1\r\nprint(s.lower() if l >= c else s.upper())\r\n", "n = input()\r\n\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n\r\n upper += 1\r\n\r\n else:\r\n lower += 1\r\n\r\nif lower > upper:\r\n a = n.lower()\r\n print(a)\r\nelif lower == upper:\r\n a = n.lower()\r\n print(a)\r\nelif lower < upper:\r\n a = n.upper()\r\n print(a)", "# Input the word\r\ns = input()\r\n\r\n# Count the number of uppercase and lowercase letters\r\nuppercase_count = sum(1 for letter in s if letter.isupper())\r\nlowercase_count = len(s) - uppercase_count\r\n\r\n# Determine whether to convert to uppercase or lowercase\r\nif uppercase_count > lowercase_count:\r\n corrected_word = s.upper()\r\nelse:\r\n corrected_word = s.lower()\r\n\r\n# Output the corrected word\r\nprint(corrected_word)\r\n", "upper,lower=0,0\r\na = input()\r\nfor i in a:\r\n if i.isupper():\r\n upper+=1\r\n if i.islower():\r\n lower+=1\r\nif upper > lower:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n ", "sri=input()\r\nprint([sri.lower(),sri.upper()][sum(i<'['for i in sri)*2>len(sri)])", "string = input()\r\nupperindex=0\r\nlowerindex=0\r\nfor char in string:\r\n if char.isupper():\r\n upperindex+=1\r\n else:\r\n lowerindex+=1\r\nif lowerindex>=upperindex:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "string = input()\r\nu_count, l_count = 0, 0\r\nfor char in string:\r\n if char.islower():\r\n l_count += 1 \r\n else:\r\n u_count += 1 \r\n\r\nif l_count < u_count:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s=input()\r\nb=len(s)\r\nbol=0\r\nmal=0\r\nfor i in s:\r\n if i==i.upper():\r\n bol+=1\r\n else:\r\n mal+=1\r\nif bol==mal:\r\n print(s.lower())\r\nif bol<mal:\r\n print(s.lower())\r\nif bol>mal:\r\n print(s.upper())", "s=input()\r\nlc=0\r\nuc=0\r\nfor i in s:\r\n if i.islower():\r\n lc=lc+1\r\n else:\r\n uc=uc+1\r\n \r\nif lc<uc:\r\n print(s.upper())\r\n \r\nelse:\r\n print(s.lower())\r\n ", "a=input()\r\nb,c=0,0\r\nfor j in a:\r\n if j.islower():\r\n b+=1\r\n else:\r\n c+=1\r\nif(b>=c):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "k = str(input())\r\nup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nlo = 'abcdefghijklmnopqrstuvwxyz'\r\nh = [0,0]\r\nfor i in k:\r\n if i in up:\r\n h[0] += 1\r\n elif i in lo:\r\n h[1] += 1\r\nif h[0] > h[1]:\r\n print(k.upper())\r\nelse:\r\n print(k.lower())", "s1 = input()\r\nlowercase = 0\r\nuppercase = 0\r\n\r\nfor i in s1:\r\n if i.islower():\r\n lowercase += 1\r\n else:\r\n uppercase += 1\r\n\r\nif lowercase >= uppercase:\r\n print(s1.lower())\r\nelse:\r\n print(s1.upper())", "def one_register(str):\r\n count1 = sum(1 for c in str if c.isupper())\r\n count2 = sum(1 for c in str if c.islower())\r\n if count2 >= count1:\r\n return str.lower()\r\n return str.upper()\r\n\r\n\r\ns = input()\r\nprint(one_register(s))\r\n", "a= input()\r\ncnt = 0\r\nd = 0\r\nn = len(a)\r\nfor i in range(n):\r\n if(a[i]>'Z'):\r\n cnt += 1\r\n else:\r\n d += 1\r\n\r\nif(cnt<d):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "palabra = input()\r\nmayusc, minusc = 0, 0\r\nfor i in palabra:\r\n if i.isupper():\r\n mayusc += 1\r\n else:\r\n minusc += 1\r\nif mayusc <= minusc:\r\n print(palabra.lower())\r\nelse:\r\n print(palabra.upper())", "n = input()\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor character in n:\r\n if character.isupper():\r\n uppercase += 1\r\n else:\r\n lowercase += 1\r\n\r\nif uppercase <= lowercase:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "\r\n\r\ns=input()\r\nln=len(s)\r\nc=0\r\nsm=0\r\n\r\nfor i in range(ln):\r\n\r\n if (s[i]<='Z'):\r\n c+=1\r\n else:\r\n sm+=1\r\n\r\n \r\nif(c>sm):\r\n\r\n print(s.upper())\r\nelif(sm<c):\r\n\r\n print(s.lower())\r\n\r\nelse:\r\n print(s.lower())\r\n \r\n", "t= input()\r\ncounta =0\r\ncountA =0\r\nfor i in t:\r\n if i.islower():\r\n counta+=1\r\n else:\r\n countA+=1\r\nif(counta>=countA):\r\n t = t.lower()\r\nelse:\r\n t = t.upper()\r\nprint(t)\r\n", "s=input()\r\nk=0\r\nm=0\r\nfor i in s:\r\n if (i.islower()):\r\n k+=1\r\n else :\r\n m+=1\r\nif m>k:\r\n print (s.upper())\r\nelse:\r\n print(s.lower())\r\n", "ColBig = 0\r\nColLit = 0\r\nS = str(input())\r\nfor i in range(len(S)):\r\n Sr = S[i]\r\n if Sr.isupper():\r\n ColBig += 1\r\n else:\r\n ColLit += 1\r\nif ColLit >= ColBig:\r\n print(S.lower())\r\nelse:\r\n print(S.upper())\r\n", "if __name__ == '__main__':\r\n\ts = input()\r\n\tc = 0\r\n\tl = 0\r\n\tfor i in s:\r\n\t\tif i.isupper():\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tl+=1\r\n\tif l < c:\r\n\t\tprint(s.upper())\r\n\telse:\r\n\t\tprint(s.lower())", "word=input()\r\nlower=0\r\nupper=0\r\nfor char in word:\r\n if char.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper > lower:\r\n word = word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)", "S = input(); print(S.upper() if 2*sum(c.upper() == c for c in S) > len(S) else S.lower())", "s=input()\r\nC=0\r\nS=0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n C+=1\r\n else:\r\n S+=1\r\nif C>S:\r\n print(s.upper())\r\nif C<S:\r\n print(s.lower())\r\nif C==S:\r\n print(s.lower())", "w = input()\r\ncounter = 0\r\nfor i in w:\r\n if i == i.upper():\r\n counter += 1\r\nif counter > len(w)-counter:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "s = str(input())\r\nlength = len(s)\r\nl = 0\r\nu = 0\r\nfor i in range(length):\r\n if s[i].islower():\r\n l += 1\r\n elif s[i].isupper():\r\n u += 1\r\nif u == l:\r\n print(s.lower())\r\nelif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a = input()\r\nh = sum(1 for b in a if b.isupper() )\r\nl = sum(1 for b in a if b.islower()) \r\nif h <= l:\r\n a = a.lower()\r\nelse:\r\n a = a.upper()\r\nprint(a) ", "S = str(input())\r\nif sum(map(str.islower, S)) >= len(S)/2:\r\n print(S.lower())\r\nelse:\r\n print(S.upper())", "s = input()\nu=0\n\nfor i in s:\n if i.isupper():\n u+=1\nm = len(s)\nl = m-u\nif l==u or l>u:\n print(s.lower())\nelse:\n print(s.upper())\n\n\n\n\t \t \t\t\t\t \t \t \t\t \t \t \t\t \t \t", "n=input()\r\ncnt=0\r\ncnt2=0\r\nfor i in n:\r\n if i.islower():\r\n cnt+=1\r\n elif i.isupper():\r\n cnt2+=1\r\nif cnt>=cnt2:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s=input()\r\nl=len(s)\r\nc=0\r\nfor _ in s:\r\n if _ >= 'a' and _ <='z':\r\n c=c+1\r\nif c>=(l/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nl=u=0\r\nfor c in s:\r\n if(c.isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "def change_letter_case(word):\r\n upper_count = sum(1 for c in word if c.isupper())\r\n lower_count = len(word) - upper_count\r\n\r\n if upper_count > lower_count:\r\n return word.upper()\r\n elif lower_count > upper_count:\r\n return word.lower()\r\n else:\r\n return word.lower()\r\n\r\n# Test the function\r\nword = input(\" \")\r\nresult = change_letter_case(word)\r\nprint(result)\r\n", "lcount=0\r\nucount=0\r\nS=input()\r\nfor i in S:\r\n if i.islower()==True:\r\n lcount+=1\r\n else:\r\n ucount+=1\r\nif lcount>=ucount:\r\n print(S.lower())\r\nelse:\r\n print(S.upper())\r\n ", "s = list(input())\r\ncu = 0\r\ncl = 0\r\n\r\nfor x in s:\r\n if ord(x) >= 97:\r\n cl += 1\r\n else:\r\n cu += 1\r\ns =''.join(s)\r\n\r\nif cl >= cu:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "#Word.py\r\nstr1 = input()\r\nlower = upper = 0\r\nfor x in str1:\r\n if x.islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif lower<upper:\r\n str1 = str1.upper()\r\nelse:\r\n str1 = str1.lower()\r\nprint(str1)", "s = input()\r\nlu=0\r\nfor i in s:\r\n\tif i>='A' and i<='Z':\r\n\t\tlu = lu + 1\r\n\telse : \r\n\t\tlu = lu - 1\r\nif(lu>0):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "text=input()\r\nupper=0\r\nlower=0\r\nfor i in text:\r\n if ord(i)>=65 and ord(i)<=90:\r\n upper +=1\r\n else: \r\n lower +=1\r\nif (upper<=lower):\r\n print(text.lower())\r\nelse:\r\n print(text.upper())\r\n\r\n \r\n ", "# 1\r\n# s = input()\r\n# res = s\r\n# for i in range(len(s)):\r\n# if s[i] == \"A\" or s[i] == \"a\" or s[i] == \"O\" or s[i] == \"o\" or s[i] == \"Y\" or s[i] == \"y\" or s[i] == \"I\" or \\\r\n# s[i] == \"i\" or s[i] == \"E\" or s[i] == \"e\" or s[i] == \"U\" or s[i] == \"u\":\r\n# res = res.replace(s[i], '')\r\n# res_new = res\r\n# for i in range(len(res_new)):\r\n# res_new = res_new.replace(res[i], '.' + res[i])\r\n# print(res_new.lower())\r\n\r\n# 2\r\n# s = input()\r\n# arr = s.split(\"+\")\r\n# map_str = map(int, arr)\r\n# list_of_integers = list(sorted(map_str))\r\n# s_upd = \"\"\r\n# for i in range(len(list_of_integers) - 1):\r\n# s_upd += str(list_of_integers[i]) + \"+\"\r\n# print(s_upd + str(list_of_integers[len(list_of_integers) - 1]))\r\n\r\n# 3\r\n# s = input()\r\n# print(s[0].upper() + s[1:])\r\n\r\n# 4\r\n# positions = input()\r\n# if '0000000' in positions or '1111111' in positions:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# 5\r\n# username = input()\r\n# if len(set(username)) % 2 != 0:\r\n# print(\"IGNORE HIM!\")\r\n# else:\r\n# print(\"CHAT WITH HER!\")\r\n\r\n# 6\r\nupper = 0\r\nlower = 0\r\ns = input()\r\nres = \"\"\r\nfor i in range(0, len(s)):\r\n # if s[i] >= 'a':\r\n if 97 <= ord(s[i]) <= 122:\r\n lower = lower + 1\r\n else:\r\n upper = upper + 1\r\n\r\nif upper > lower:\r\n res = s.upper()\r\nelse:\r\n res = s.lower()\r\n\r\nprint(res)\r\n\r\n\r\n# 8\r\n# s = input()\r\n# t = input()\r\n# s = \"\".join(reversed(s))\r\n# s = s[::-1]\r\n# if t == s:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# 10\r\n# s = input()\r\n# if s.isupper():\r\n# print(s.lower())\r\n# elif s.islower():\r\n# print(s.upper())\r\n# elif s[0].lower() and s[1:].isupper():\r\n# print(s[0].capitalize() + s[1:].lower())\r\n# else:\r\n# print(s)\r\n\r\n# 11\r\n# n = int(input())\r\n# s = input()\r\n# res = \"\"\r\n# cnt_z = s.count('z')\r\n# cnt_e = s.count('e')\r\n# cnt_r = s.count('r')\r\n# cnt_o = s.count('o')\r\n# cnt_n = s.count('n')\r\n# while cnt_n > 0 and cnt_o > 0 and cnt_e > 0:\r\n# res += \"1 \"\r\n# cnt_n -= 1\r\n# cnt_o -= 1\r\n# cnt_e -= 1\r\n# while cnt_z > 0 and cnt_o > 0 and cnt_r > 0 and cnt_e > 0:\r\n# res += \"0 \"\r\n# cnt_z -= 1\r\n# cnt_o -= 1\r\n# cnt_e -= 1\r\n# cnt_r -= 1\r\n# print(res[:len(res) - 1])\r\n\r\n# 12\r\n# n = int(input())\r\n# s = input()\r\n# cnt = 0\r\n# for i in range(0, len(s) - 2):\r\n# if s[i] == 'x' and s[i + 1] == 'x' and s[i + 2] == 'x':\r\n# cnt += 1\r\n# print(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nupr = 0; lwr = 0\r\nfor i in s:\r\n if (ord(i) < 97): upr += 1\r\n else: lwr += 1\r\nif (lwr >= upr):\r\n print(s.lower())\r\nelse: print(s.upper())\r\n", "a=input()\r\nu=0\r\nl=0\r\nfor i in a:\r\n if i.islower():\r\n l=l+1\r\n else:\r\n u=u+1\r\nif u>l:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input(\"\")\r\n\r\nc1=0\r\nc2=0\r\n\r\nfor l in s:\r\n\r\n if l.isupper():\r\n c1+=1\r\n else:\r\n c2+=1\r\n\r\nif c1>c2:\r\n s=s.upper()\r\n print(s)\r\nelse:\r\n s=s.lower()\r\n print(s)\r\n", "n =input()\r\nd = len(n)\r\ncount = 0\r\nfor _ in n:\r\n if _>='A' and _ <='Z':\r\n count = count + 1\r\nif count > (d/2):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "\r\nx = input()\r\na = b = 0\r\nfor i in x:\r\n if i == i.upper():\r\n a += 1\r\n else:\r\n b += 1\r\n \r\nif a > b:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "st = input()\r\nlow,up = 0,0\r\nfor i in st:\r\n if i>='a' and i<='z':\r\n low = low+1\r\n elif i>='A' and i<='Z':\r\n up = up+1\r\n'''print(low,up)'''\r\nif up>low:\r\n st=st.upper()\r\nelse:\r\n st=st.lower()\r\nprint(st)", "n=str(input())\r\nsmall=[]\r\ncapital=[]\r\nm=n.lower()\r\nh=0\r\nfor i in n:\r\n if i==m[h]:\r\n small.append(m[h])\r\n h+=1\r\n else:\r\n capital.append(i)\r\n h+=1\r\nif len(capital)>len(small):\r\n print(n.upper())\r\nelif len(capital)<len(small):\r\n print(m)\r\nelse:\r\n print(m)", "def main():\n s = input()\n alphabet = 'qwertyuiopasdfghjklzxcvbnm'\n count_up = 0\n count_down = 0\n for i in s:\n if i in alphabet:\n count_down += 1\n else:\n count_up += 1\n if count_up <= count_down:\n return print(s.lower())\n return print(s.upper())\n\nif __name__ == '__main__':\n main()", "take_inp = str(input())\r\ndef check(words):\r\n upper_word = 0\r\n lower_word = 0\r\n for word in words:\r\n if word.upper() == word:\r\n upper_word += 1\r\n else:\r\n lower_word += 1\r\n if upper_word > lower_word:\r\n final_str = words.upper()\r\n return final_str\r\n else:\r\n final_str = words.lower()\r\n return final_str\r\nprint(check(take_inp))", "k=input()\r\nu=l=0\r\nfor a in k:\r\n\tif a.isupper()==True:\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif u>l:\r\n\tprint(k.upper())\r\nelse:\r\n\tprint(k.lower())", "a=input()\r\nk=0\r\nt=0\r\nfor i in a:\r\n if i.islower():\r\n t+=1\r\n else:\r\n k+=1\r\nif t>=k:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "import re \nstring = input()\nupper_letter = 0\n\nfor char in string:\n if re.match(r'[A-Z]',char):\n upper_letter += 1\nif upper_letter > len(string)/2:\n print(string.upper())\nelse:\n print(string.lower())\n \t\t\t \t \t\t \t\t \t \t\t \t", "s = input()\r\nuppers = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n uppers += 1\r\n\r\nif uppers <= len(s) - uppers:\r\n print(s.lower())\r\nelif uppers > len(s) - uppers:\r\n print(s.upper())", "word = input()\r\nnl = 0\r\nnu = 0\r\nfor each in word:\r\n if each.isupper():\r\n nu += 1\r\n else:\r\n nl += 1\r\nif nl >= nu:\r\n print(word.lower())\r\nelif nl < nu:\r\n print(word.upper())", "a=input()\r\nc=0\r\nl='zxcvbnmlkjhgfdsaqwertyuiop'\r\nfor i in a:\r\n if i in l:\r\n c+=1\r\nif c>=len(a)-c:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n ", "s=str(input())\r\nlower=0\r\nupper=0\r\nfor i in s:\r\n if i.isupper():\r\n upper=upper+1\r\n else:\r\n lower=lower+1\r\n\r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nsmall = 0\r\nfor i in s:\r\n if \"a\" <= i <= \"z\":\r\n small +=1\r\nif small >= (len(s) - small):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nt=list(s)\r\nlength=len(t)\r\nlow=0\r\nfor i in t:\r\n if i.upper() != i:\r\n low=low+1\r\nif low >= length/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "\r\n\r\ndef string():\r\n\treturn(list(input().split()))\r\n\r\ns=string()\r\nl=0\r\nn=len(s[0])\r\nfor x in s[0]:\r\n\tif x.islower():\r\n\t\tl+=1\r\nif l>=(n-l):\r\n\tprint(s[0].lower())\r\nelse:\r\n\tprint(s[0].upper())", "word = [x for x in input()]\r\nupper = 0 \r\n\r\nfor i in word:\r\n if i.isupper():\r\n upper += 1\r\n\r\nif upper > len(word)-upper:\r\n for x in word:\r\n print(x.upper(), end=\"\")\r\nelse:\r\n for x in word:\r\n print(x.lower(), end=\"\")\r\n", "a = input()\r\nb,c = 0,0\r\nfor i in a:\r\n if i.isupper():\r\n b+=1\r\n else:\r\n c+=1\r\nif b > c:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word = input()\r\ncount_upper = 0\r\ncount_lower = 0\r\nfor i in word:\r\n if(i.isupper()):\r\n count_upper += 1 \r\n else:\r\n count_lower += 1 \r\nif(count_lower >= count_upper):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "import re\r\ns = input()\r\nbig = len(re.findall('[A-Z]', s))\r\nlit = len(re.findall('[a-z]', s))\r\nprint(s.lower() if lit >= big else s.upper())", "s=str(input())\r\nn=len(s)\r\ncountl=0\r\ncountu=0\r\nfor i in range(0,n):\r\n if s[i].isupper():\r\n countu+=1\r\n else:\r\n countl+=1\r\nif countu>countl:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n", "initial_str = input()\r\nfinal_str = \"\"\r\nupper_vote = 0\r\nlower_vote = 0\r\n\r\nfor i in range(len(initial_str)):\r\n if ord(initial_str[i])<97:\r\n upper_vote+=1\r\n else:\r\n lower_vote+=1\r\n\r\nfor i in range(len(initial_str)):\r\n if lower_vote<upper_vote:\r\n if 97<=ord(initial_str[i]):\r\n final_str+=chr(ord(initial_str[i])-32)\r\n else:\r\n final_str+=initial_str[i]\r\n else:\r\n if ord(initial_str[i])<97:\r\n final_str+=chr(ord(initial_str[i])+32)\r\n else:\r\n final_str+=initial_str[i]\r\n\r\nprint(final_str)", "s = input()\r\nuppercount = 0\r\nlowercount = 0\r\nfor char in s:\r\n if char.isupper():\r\n uppercount += 1\r\n elif char.islower():\r\n lowercount += 1\r\nif uppercount > lowercount:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "str1=str(input())\r\ncount=0\r\nfor char in str1:\r\n if char.isupper():\r\n count += 1\r\n else:\r\n count -= 1\r\nif count > 0:\r\n print(str1.upper())\r\nelse:\r\n print(str1.lower())", "word = input()\r\nlow = 0\r\nhigh = 0\r\nif len(word) <= 100 and len(word) >= 1:\r\n for element in word:\r\n if element.islower():\r\n low += 1\r\n elif element.isupper():\r\n high += 1\r\n if high > low:\r\n print(' '.join(word.split()).upper())\r\n elif low >= high:\r\n print(' '.join(word.split()).lower())\r\n", "def lower(s):\r\n return sum(1 for letter in s if letter.islower())\r\ns = input()\r\nl = lower(s)\r\nb = len(s) - l\r\nif l >= b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "string = input()\r\ncountUpper = 0\r\ncountLower = 0\r\nfor i in string:\r\n if (i.isupper() != False):\r\n countUpper += 1\r\n else:\r\n countLower += 1\r\n \r\nif (countLower>=countUpper):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n", "word = str(input())\r\n\r\nif len(word) < 1 or len(word) > 100:\r\n pass\r\n\r\nelse:\r\n up = int(sum(map(str.isupper, word)))\r\n down = int(sum(map(str.islower, word)))\r\n\r\n if up > down:\r\n word = word.upper()\r\n print(word)\r\n\r\n elif up < down:\r\n word = word.lower()\r\n print(word)\r\n\r\n elif up == down:\r\n word = word.lower()\r\n print(word)", "word = input()\r\n\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor i in range(len(word)):\r\n if ord(word[i]) >= ord('A') and ord(word[i]) <= ord('Z'):\r\n uppercase += 1\r\n if uppercase >= len(word)//2 + 1:\r\n uppercase = len(word)\r\n break\r\n else:\r\n lowercase += 1\r\n\r\nif uppercase > lowercase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "import string\r\ns = input()\r\nd=e=0\r\n\r\nfor x in range(0,len(s)):\r\n if s[x]<'a':d=d+1\r\n else:e=e+1\r\n \r\nif d>e:print(\"\",s.upper())\r\nelse:print(\"\",s.lower())\r\n", "x = str(input())\r\nuprcount = 0\r\nlwrcount = 0\r\nfor i in range (0, len(x)):\r\n if (x[i]>= 'A' and x[i] <= 'Z'):\r\n uprcount += 1\r\n else:\r\n lwrcount += 1\r\nif lwrcount >= uprcount :\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "n=input()\r\na,c=0,0\r\nfor i in n:\r\n if(i.isupper()):\r\n c=c+1 \r\n else:\r\n a=a+1 \r\nif(c>a):\r\n for i in n:\r\n if(i.islower()):\r\n print(i.swapcase(),end=\"\")\r\n else:\r\n print(i,end=\"\")\r\nelif(c<a):\r\n for i in n:\r\n if(i.isupper()):\r\n print(i.swapcase(),end=\"\")\r\n else:\r\n print(i,end=\"\")\r\nelse:\r\n for i in n:\r\n if(i.isupper()):\r\n print(i.swapcase(),end=\"\")\r\n else:\r\n print(i,end=\"\")\r\n ", "string = input()\r\n\r\ncount = 0\r\nfor x in string:\r\n if x.isupper():\r\n count += 1\r\n\r\nif count > len(string) // 2:\r\n string = string.upper()\r\nelse:\r\n string = string.lower()\r\n\r\nprint(string)", "\n# n, t = input().split(\" \")\n# a = input()\n# n = int(n)\n# t = int(t)\n# s = list(a)\n\n# while(t != 0):\n# for i in range(n-1):\n# if s[i] == 'B' and s[i+1] == 'G':\n# s[i] = 'G'\n# s[i + 1] = 'B'\n# t -= 1\n# break\n\n# print(\"\".join(s))\n\n# t = int(input()[2:])\n# s = input()\n# while t:\n# s = s.replace('BG', 'GB')\n# t -= 1\n# print(s)\n# print(s)\n\n# n = input\n# c = p = 0\n# for i in' '*int(n()):\n# s = n()\n# c += s != p\n# p = s\n# print(c)\n\n# s = input()\n# d = {\".\": \"0\", \"-.\": \"1\", \"--\": \"2\"}\n# s = s.replace(\"--\", \"2\")\n# s = s.replace(\"-.\", \"1\")\n# s = s.replace(\".\", \"0\")\n# print(s)\n\n# y = int(input())\n\n# while(len(set(str(y))) < 4):\n# y += 1\n\n# print(y)\n\n# for i in range(2):\n# o = \"\"\n# r = input().replace(\" \", \"\")\n# for j in r:\n# if int(j) % 2 == 0:\n# o += \"1\"\n# else:\n# o += \"0\"\n# print(o)\n\n# s = [[1]*5 for _ in range(5)]\n# for i in 1, 2, 3:\n# for j, v in zip((1, 2, 3), map(int, input().split())):\n# for k, d in (-1, 0), (1, 0), (0, -1), (0, 1), (0, 0):\n# s[i+k][j+d] += v\n# for i in 1, 2, 3:\n# for j in 1, 2, 3:\n# print(s[i][j] % 2, end='')\n# print()\n\ns = input()\nu = l = 0\nfor i in s:\n if i.lower() == i:\n l += 1\n else:\n u += 1\nif u == l or l > u:\n s = s.lower()\nelif u > l:\n s = s.upper()\n\nprint(s)\n", "word = input()\r\nif len(word)/2 <= sum(1 for char in word if char.islower()):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = input ()\r\nw1 = 0\r\nw2 = 0 \r\nfor x in s :\r\n if x.isupper(): \r\n w1+=1\r\n \r\n else : \r\n w2+=1\r\n \r\nif w1<=w2 : \r\n print(s.lower())\r\n \r\nelif w1>w2 :\r\n print(s.upper())\r\n ", "s = input()\r\nsmall=0\r\nbig=0\r\nfor i in s:\r\n if i in \"abcdefghijklmnopqrstuvwxyz\":\r\n small+=1\r\n else:\r\n big+=1\r\nif small>=big:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "n=input()\r\nm=len(n)\r\ncnt=0\r\ncnt1=0\r\nfor i in range(m):\r\n a=ord(n[i])\r\n\r\n if a < 97:\r\n cnt+=1\r\n else:\r\n cnt1+=1\r\nif cnt > m//2:\r\n a=n.upper()\r\n print(a)\r\nelse:\r\n c=n.lower()\r\n print(c)\r\n\r\n", "s = input()\nn = len(s)\nupper_c = 0\nlower_c = 0\nfor i in range(n):\n if s[i].upper()==s[i]:\n upper_c+=1\n else:\n lower_c+=1\nif upper_c>lower_c:\n print(s.upper())\nelse:\n print(s.lower())\n", "kelime=input()\r\nbuyuk=0\r\n\r\nfor harf in kelime:\r\n if harf.isupper():\r\n buyuk += 1\r\n\r\nif buyuk>len(kelime)//2:\r\n print(kelime.upper())\r\nelse:\r\n print(kelime.lower())", "s = str(input())\n\ncountup=0\ncountlow=0\n\nfor i in range(0, len(s)):\n if(s[i]>='a' and s[i]<='z'):\n countlow+=1\n \n elif (s[i]>='A' and s[i]<='Z'):\n countup+=1\n\n\n\nif(countup>countlow):\n print(s.upper())\n\nelse:\n print(s.lower())", "text = input()\r\nn = len(text)\r\nl_num = 0\r\nu_num = 0\r\n\r\nfor i in range(n):\r\n if text[i].islower():\r\n l_num += 1\r\n else:\r\n u_num += 1 \r\n\r\nif l_num > u_num:\r\n print(text.lower())\r\nif l_num == u_num:\r\n print(text.lower()) \r\nif l_num < u_num: \r\n print(text.upper())", "leters = input()\r\nupperleters = 0\r\nlowerleters = 0\r\n\r\nfor x in leters:\r\n\tif x.islower():\r\n\t\tlowerleters += 1\r\n\telse:\r\n\t\tupperleters += 1\r\nif upperleters>lowerleters:\r\n\tprint(leters.upper())\r\nelse:\r\n\tprint(leters.lower())\r\n\t", "word = input()\r\ncount = 0\r\nfor c in word:\r\n if c == c.lower():\r\n count += 1\r\nif count>=len(word)-count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "word = input()\r\nlower = 0\r\nupper = 0\r\nfor letter in word:\r\n if letter in \"abcdefghijklmnopqrstuvwxyz\":\r\n lower +=1\r\n if letter in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n upper +=1\r\nif lower >= upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n \r\n", "s = input()\r\nletters = 'abcdefghijklmnopqrstuvwxyz'\r\nlower = 0\r\nupper = 0\r\nfor i in s:\r\n if i in letters:\r\n lower += 1\r\n if i not in letters:\r\n upper += 1\r\n\r\nif lower>upper:\r\n print(s.lower())\r\nelif upper>lower:\r\n print(s.upper())\r\nelif upper==lower:\r\n print(s.lower())\r\n \r\n", "a = input()\r\nl = len(a)\r\n\r\nup = 0\r\nlw = 0\r\nfor i in range(l):\r\n if(a[i] >= 'A' and a[i] <= 'Z'):\r\n up += 1\r\n else:\r\n lw += 1\r\n\r\nif(up > lw):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "x=input()\r\nk=0\r\nfor i in x:\r\n if i==i.lower():\r\n k+=1\r\nif k>=len(x)/2:\r\n print(x.lower())\r\nelse :\r\n print(x.upper())", "a = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range (len(a)):\r\n if a[i].isupper():\r\n count1= count1 + 1\r\n elif a[i].lower():\r\n count2 = count2 + 1\r\nif count1==count2:\r\n print (a.lower())\r\nelif count1> count2:\r\n print (a.upper())\r\nelse:\r\n print (a.lower())", "import math, os, sys\r\nimport string, re\r\nimport itertools, functools, operator\r\nfrom collections import Counter\r\n\r\ndef inputint():\r\n return int(input())\r\n\r\ndef inputarray(func=int):\r\n return map(func, input().split())\r\n\r\n\r\ns = input()\r\nmask = map(lambda x: x.isupper(), s)\r\nif sum(mask) <= len(s)//2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=input()\r\nc1=0\r\nc2=0\r\nfor i in s:\r\n if(i.islower()==True):\r\n c1+=1\r\n elif(i.isupper()==True):\r\n c2+=1\r\nif(c1==c2):\r\n print(s.lower())\r\nelif(c1>c2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\ncount = 0\nfor i in s:\n if i.isupper(): count += 1\n\nprint(s.lower()) if count <= len(s) // 2 else print(s.upper())\n", "\"\"\"\r\n TODO: Take a Input String\r\n TODO: Count the upper case and lower case Number\r\n TODO: If Lowercase Number is Big or equal make lowercase else uppercase\r\n\"\"\"\r\n\r\nword = input()\r\nlower = 0 \r\nupper = 0\r\nfor i in word:\r\n if i.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n \r\nif lower >= upper:\r\n print(word.lower()) \r\nelse:\r\n print(word.upper())", "s = input()\r\nsmall = 0\r\nupper = 0\r\nfor i in s:\r\n if ord(i) in range(65,91):\r\n upper += 1\r\n else:\r\n small += 1\r\nif small >= upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a = input()\r\nl = len(a)\r\nupper = 0\r\nlower = 0\r\nfor i in a:\r\n\tif(i.isupper()):\r\n\t\tupper += 1\r\n\telif(i.islower()):\r\n\t\tlower += 1\r\n\r\nif(upper > lower):\r\n\tprint(a.upper())\r\nelse:\r\n\tprint(a.lower())", "s = input(\"\")\nword = \"\"\nuppercase = 0\nlowercase = 0\n\n\nfor i in s:\n\tif i.isupper():\n\t\tuppercase = uppercase + 1\n\telif i.islower():\n\t\tlowercase = lowercase + 1\n\t# elif uppercase == lowercase:\n\t# \ts = i.lower()\n\t# \tprint(s)\n\t# \t# print(i.lower())\n\t# \t# s = s.lower()\n\t# elif len(uppercase) > len(lowercase):\n\t# \tprint(i.upper())\n\t# elif len(uppercase) < len(lowercase):\n\t# \tprint(i.lower())\n\nif uppercase == lowercase:\n\tprint(s.lower())\nelif uppercase > lowercase:\n\tprint(s.upper())\nelif uppercase < lowercase:\n\tprint(s.lower())", "s = input()\r\ns2 = list(s)\r\nlc = 0\r\nuc = 0\r\nfor i in s:\r\n if i==i.lower():\r\n lc+=1\r\n else:\r\n uc+=1\r\n\r\nfor i in range(len(s2)): \r\n if (lc>uc):\r\n if s2[i]==s2[i].upper():\r\n s2[i] = s2[i].lower()\r\n elif (lc<uc):\r\n if s2[i]==s2[i].lower():\r\n s2[i] = s2[i].upper()\r\n else:\r\n s2[i] = s2[i].lower()\r\nprint(''.join(s2))", "x = input()\ny = list(x)\ncounter_lower = 0\ncounter_upper = 0\nfor i in y:\n if i == i.lower():\n counter_lower += 1\n elif i == i.upper():\n counter_upper += 1\nif counter_lower >= counter_upper:\n print(x.lower())\nelif counter_lower < counter_upper:\n print(x.upper())", "word=input()\r\ncountb=0;countl=0;\r\nfor i in word:\r\n if(ord(i)>=65 and ord(i)<=90):\r\n countb+=1\r\n else:\r\n countl+=1\r\nif(countl<countb):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n ", "char = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(char)):\r\n if char[i].isupper() == True:\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n print(char.upper())\r\nelse:\r\n print(char.lower())", "s=input()\r\nn = len(s) \r\nc=0\r\nfor i in s:\r\n\tif(i.isupper()):\r\n\t\tc = c+1\r\nd = n-c\r\nif(d>=c):\r\n\ts = s.lower()\r\nelse:\r\n\ts = s.upper()\r\nprint(s)", "palabra = input()\r\nmin = 0\r\nmay = 0\r\nnew = ''\r\nfor i in palabra:\r\n if i == i.lower():\r\n min += 1\r\n else:\r\n may += 1\r\nif min>= may:\r\n new = palabra.lower()\r\nelse:\r\n new = palabra.upper()\r\nprint(new)", "s = input()\nn = len(s)\nlc = 0\nuc = 0\nfor i in range(n):\n if s[i].islower():\n lc+=1\n else:\n uc+=1\nif lc>=uc:\n print(s.lower())\nelse:\n print(s.upper())\n \t\t\t\t \t \t\t \t \t \t \t\t\t \t \t\t\t", "a = str(input())\r\nlowerc = 0\r\nupperc = 0\r\nfor i in range(len(a)):\r\n\tif a[i].isupper():\r\n\t\tupperc=upperc+1\r\n\telse:\r\n\t\tlowerc=lowerc+1\r\nif(lowerc>=upperc):\r\n\tprint(a.lower())\r\nelse:\r\n\tprint(a.upper())", "string = input()\r\nupsum = 0\r\nlowsum = 0\r\nfor i in string:\r\n if i == i.upper():\r\n upsum+=1\r\n else:\r\n lowsum+=1\r\nif (upsum > lowsum):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s=str(input())\r\nls=0\r\ncs=0\r\n\r\nfor i in range(0,len(s)):\r\n if s[i].islower():\r\n ls+=1\r\n else:\r\n cs+=1\r\n \r\nif ls>cs:\r\n print(s.lower())\r\nelif cs>ls:\r\n print(s.upper())\r\nelif cs==ls:\r\n print(s.lower())\r\n\r\n \r\n \r\n \r\n", "s=input()\r\nl=0\r\nu=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n u+=1\r\n else:\r\n l+=1\r\nans=''\r\nfor i in s:\r\n if u>l:\r\n ans+=i.upper()\r\n else:\r\n ans+=i.lower()\r\nprint(ans)\r\n \r\n", "a = input()\r\nt = 0\r\nc = 0\r\nfor ch in a:\r\n if ch.islower():\r\n t += 1\r\n else:\r\n c += 1\r\nif t < c:\r\n a = a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a)\r\n", "a = input()\ndx = 0\nxx = 0\nfor i in a:\n if i.islower():\n xx += 1\n else:\n dx += 1\nif xx < dx:\n print(a.upper())\nelse:\n print(a.lower())\n", "a=input().strip()\r\ncu=0\r\ncl=0\r\nfor i in a:\r\n if i.isupper():\r\n cu+=1\r\n else:\r\n cl+=1\r\nif cu>cl:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=str(input())\r\ncount=0\r\ncount1=0\r\nfor i in range(0,len(s)):\r\n if s[i]>='a' and s[i]<='z':\r\n count+=1\r\n else:\r\n count1+=1\r\n\r\nif count1<=count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n \r\n", "x=input()\r\nup=0\r\ndown=0\r\nfor i in x:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n down+=1\r\nif up>down:\r\n print(x.upper())\r\nelif up<down or up==down:\r\n print(x.lower())", "string = input()\nliste = list(string)\nupper = 0\nlower = 0\nfor char in liste:\n\tif char.isupper() == True:\n\t\tupper += 1\n\telse:\n\t\tlower += 1\nif upper > lower:\n\tprint(string.upper())\nelse:\n\tprint(string.lower())\n", "s = input()\r\ncntl=0\r\ncntsm=0\r\n\r\nfor i in range(len(s)):\r\n if (ord(s[i]) >=65) and (ord(s[i]) < 97):\r\n cntl+=1\r\n if (ord(s[i])>=97):\r\n cntsm+=1\r\n\r\nif cntsm >= cntl:\r\n for i in range(len(s)):\r\n if (ord(s[i]) >=65) and (ord(s[i]) < 97):\r\n print(chr(ord(s[i])+32),end='')\r\n else:\r\n print(s[i], end='')\r\nelse:\r\n for i in range(len(s)):\r\n if (ord(s[i])>=97):\r\n print(chr(ord(s[i])-32),end='')\r\n else:\r\n print(s[i],end='')", "s = str(input())\r\nln = len(s)\r\nlo = up = 0\r\nfor i in range(ln):\r\n if (s[i] >= 'A') and (s[i] <= 'Z'):\r\n up += 1\r\n elif (s[i] >= 'a') and (s[i] <= 'z'):\r\n lo += 1\r\nif lo >= up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nup = 0\r\nlow = 0\r\nfor i in s:\r\n if i.islower():\r\n low += 1\r\n else:\r\n up += 1\r\nprint(s.upper()) if up > low else print(s.lower())", "s=input()\r\nn=len(s)//2\r\nd=s.upper()\r\nl=0\r\nfor i in range(len(s)):\r\n if d[i]<s[i] :\r\n l=l+1\r\nif len(s)%2==0 :\r\n if l<(len(s)//2) :\r\n s=s.upper()\r\n else :\r\n s=s.lower()\r\nelse :\r\n if l<=(len(s)//2) :\r\n s=s.upper()\r\n else :\r\n s=s.lower() \r\nprint(s)\r\n ", "s=input()\r\nk=len(s)\r\nl_count=0\r\nu_count=0\r\nfor i in range(k):\r\n if s[i].islower():\r\n l_count=l_count+1\r\n else:\r\n u_count=u_count+1\r\nif u_count>l_count:\r\n print(s.upper())\r\nelif l_count>=u_count:\r\n print(s.lower()) ", "input = input()\n\ndef vasya(input):\n uppr, lwr = 0, 0\n for i in range(len(input)):\n if input[i].isupper():\n uppr += 1\n elif input[i].islower():\n lwr += 1\n if uppr > lwr:\n return input.upper()\n else:\n return input.lower()\n\nprint(vasya(input))\n", "s=input()\r\ncnt_upper, cnt_lower =0,0\r\nfor i in range(len(s)):\r\n if (s[i]<'a'):\r\n cnt_upper+=1\r\n else:\r\n cnt_lower += 1\r\nif (cnt_lower>=cnt_upper):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)\r\n\r\n\r\n", "cadena=input()\ncontador=0\nn=len(cadena)\n\nfor i in cadena:\n if ord(i)<97:\n contador+=1\nj=n/2\nif (contador>j):\n print(cadena.upper())\nelif (contador<j):\n print(cadena.lower())\nelse:\n print(cadena.lower())\n\t\t \t \t\t\t\t \t \t\t \t\t \t \t\t \t \t", "# cook your dish here\r\ns=input()\r\nnu=0\r\nsl=s.lower()\r\nsu=s.upper()\r\nfor i in range(len(s)):\r\n if(s[i]==su[i]):\r\n nu=nu+1\r\nif(2*nu>len(s)):\r\n print(su)\r\nelse:\r\n print(sl)", "s = input()\nuc_count = lc_count = 0\nfor char in s:\n if char >= 'A' and char <= 'Z':\n uc_count += 1\n else:\n lc_count += 1\nif uc_count > lc_count: print(s.upper())\nelse: print(s.lower())\n", "s = input()\r\ns_ASCII = list(map(ord, s))\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(s_ASCII)):\r\n if s_ASCII[i]<97:\r\n upper+=1\r\n elif s_ASCII[i]>=97:\r\n lower+=1\r\nif lower>=upper:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def listToString(s):\r\n temp = \"\"\r\n for lst in s:\r\n temp+=lst\r\n return temp\r\nstrlist = input()\r\nstrlist = list(strlist)\r\ni=up=down=0\r\nwhile(i<len(strlist)):\r\n if(strlist[i].isupper()):\r\n up+=1\r\n else: down+=1\r\n i+=1\r\nstrlist = listToString(strlist)\r\nif(up>down):\r\n print(strlist.upper())\r\nelse: print(strlist.lower())", "s=input()\r\nprint([s.lower(),s.upper()][sum(ord(c)<97 for c in s)*2>len(s)])", "n=input()\r\nupp=0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n upp+=1\r\nif upp>len(n)/2:\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n)", "#59A Words\r\n\r\n#check how many upper and lowercase letters then print all as lowercase or uppercase\r\n\r\ns = input()\r\n\r\nuppercase = int(sum(1 for c in s if c.isupper()))\r\nlowercase = int(sum(1 for c in s if c.islower()))\r\n\r\nif (uppercase > lowercase):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nb=0\r\ns=\"\"\r\nfor i in a:\r\n if i.isupper():\r\n b+=1\r\nc=int(len(a)/2)\r\nif b>c:\r\n for i in a:\r\n if i.islower():\r\n s+=i.upper()\r\n else:\r\n s+=i\r\nelse:\r\n for i in a:\r\n if i.isupper():\r\n s+=i.lower()\r\n else:\r\n s+=i\r\nprint(s)", "import re\r\nCadena = str(input())\r\nMayus = re.sub('[^A-Z]','',Cadena)\r\nMinus = re.sub('[^a-z]', '', Cadena)\r\nif(len(Minus)>=len(Mayus)):\r\n print(Cadena.lower())\r\nelse:\r\n print(Cadena.upper())\r\n", "x = input()\r\nu = sum(1 for c in x if c.isupper())\r\nl = sum(1 for c in x if c.islower())\r\nif u > l:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n", "a=input()\r\nc=0\r\ns=0\r\nfor i in a:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n s+=1\r\nif c<=s:\r\n print(a.lower())\r\nelif c>s:\r\n print(a.upper())", "s=input()\r\ncount=0\r\ntimes=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n count=count+1\r\n if s[i].islower():\r\n times=times+1\r\nif count>times:\r\n print(s.upper())\r\nif count<=times:\r\n print(s.lower())", "n = input()\r\nc = 0\r\nfor i in n:\r\n if i.isupper():\r\n c+=1\r\nif c > (len(n) - c):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "Word = input()\r\n\r\nuppers = 0 \r\nlowers = 0\r\n\r\nfor char in Word:\r\n if char.isupper():\r\n uppers+=1 \r\n\r\n else:\r\n lowers+=1\r\n\r\n\r\nif uppers > lowers:\r\n print(Word.upper())\r\n\r\nelse:\r\n print(Word.lower())", "stroke = input()\r\n\r\nupper = 0\r\nlower = 0\r\n\r\nfor el in stroke:\r\n if el.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper > lower:\r\n print(stroke.upper())\r\nelse:\r\n print(stroke.lower())", "str = input()\r\nc1 = c2 = 0\r\nfor i in str:\r\n if i.islower():\r\n c1 +=1\r\n else:\r\n c2 +=1\r\nif c2>c1:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())\r\n ", "a = input()\r\nup = 0\r\ndown = 0\r\nfor i in a:\r\n if i == i.upper():\r\n up += 1\r\n else:\r\n down += 1\r\nif down >= up:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "n=input()\r\nl=[i for i in n]\r\nupper=0\r\nlower=0\r\n\r\nfor i in l:\r\n if i.isupper():\r\n upper=upper+1\r\n else:\r\n lower=lower+1\r\n \r\nif upper>lower:\r\n for i in l:\r\n print(i.upper(),end=\"\")\r\nelif lower>upper:\r\n for i in l:\r\n print(i.lower(),end=\"\")\r\nelse:\r\n for i in l:\r\n print(i.lower(),end=\"\")\r\n ", "s = input()\r\na = s.lower()\r\nb = s.upper()\r\ncnt1, cnt2 = 0, 0\r\nfor i in range(len(s)):\r\n if s[i] != a[i]: cnt1 -= -1\r\n if s[i] != b[i]: cnt2 -= -1\r\nif cnt1 > cnt2: print(b)\r\nelse: print(a)", "def Word(s):\r\n lc=0\r\n for i in range(0,len(s)):\r\n if(ord(s[i])>=97 and ord(s[i])<=122):\r\n lc=lc+1\r\n uc=len(s)-lc\r\n if(uc<=lc):\r\n return s.lower()\r\n else:\r\n return s.upper()\r\ns=input()\r\nprint(Word(s))", "phrase=str(input())\r\nclower=0\r\ncupper=0\r\nfor letter in phrase:\r\n if letter.isupper():\r\n cupper+=1\r\n elif letter.islower():\r\n clower+=1\r\nif clower > cupper:\r\n print(phrase.lower())\r\nelif cupper > clower:\r\n print(phrase.upper())\r\nelif cupper == clower:\r\n print(phrase.lower())", "upper_alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nlower_alphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n\r\ns = input()\r\n#s = \"Hoed\"\r\n\r\ncount = 0 \r\n\r\nfor item in s:\r\n\tif item in lower_alphabet:\r\n\t\tcount += 1\r\n\telse:\r\n\t\tcount -= 1\r\n\r\n#print(\"count\", count)\r\nif count >= 0:\r\n\ts = s.lower()\r\nelse:\r\n\ts = s.upper()\r\n\r\nprint(s)\r\n", "s = input()\r\n\r\nupper = ''\r\nlower = ''\r\nfor i in s:\r\n if i.isupper():\r\n upper += i\r\n else:\r\n lower += i\r\n\r\nif len(upper) > len(lower):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\nc=0\r\nd=0\r\nfor x in n:\r\n\tif x.isupper():\r\n\t\tc+=1\r\n\telse:\r\n\t\td+=1\r\nif c>d:\r\n\t\r\n\tprint(n.upper())\r\n\r\nelse:\r\n\t\r\n\t\r\n\tprint(n.lower())\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Python2\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Y_gvadcJ9SqrMgAYBKxt96WXg5bG2r59\n\"\"\"\n\nx=str(input())\ny=[]\nfor i in x:\n y.append(i.isupper())\nif y.count(True)>y.count(False):\n print(x.upper())\nelse:\n print(x.lower())", "x=input()\r\nl=0\r\nl1=0\r\nfor i in x:\r\n if i.islower() :\r\n l+=1\r\n else:\r\n l1+=1\r\nif l1<=l:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s = input()\r\n\r\nlw = 0\r\nup = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n up += 1\r\n else:\r\n lw += 1 \r\n\r\nif up <= lw:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "a=str(input())\r\nsmall=0\r\nupper=0\r\nfor i in a:\r\n if i.islower()== True:\r\n small+=1\r\n elif i.isupper() == True:\r\n upper+=1\r\n \r\nif small>=upper:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "s = input()\r\na = s.upper()\r\nb = s.lower()\r\nn = 0\r\nm = 0\r\nv = 0\r\nfor i in range(len(a)):\r\n n = n + ord(a[i])\r\nfor i in range(len(b)):\r\n m = m + ord(b[i])\r\nfor i in range(len(s)):\r\n v = v + ord(s[i])\r\nif abs(n-v) < abs(m-v):\r\n print(a)\r\nelse:\r\n print(b)", "word = input()\r\nlw = []\r\nlu = []\r\nfor x in range(len(word)):\r\n if word[x].islower():\r\n lw.append(word[x])\r\n else:\r\n lu.append(word[x])\r\nif len(lw) > len(lu) or len(lw) == len(lu):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s=str(input())\r\nif sum(map(str.isupper,s))>sum(map(str.islower,s)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string = input()\r\nsumm1 = sum(i.isupper() for i in string)\r\nsumm2 = sum(k.islower() for k in string)\r\nif summ2 >= summ1:\r\n print(string.lower())\r\nelif summ1 > summ2:\r\n print(string.upper())", "s=input()\r\nx=0\r\ny=0\r\nfor i in s:\r\n if i.islower():\r\n y+=1\r\n else:\r\n x+=1\r\nif(x>y):\r\n for i in s:\r\n print(i.upper(),end=\"\")\r\nelse:\r\n for i in s:\r\n print(i.lower(),end=\"\")", "s = str(input())\nup, low = [], []\n\nfor char in s:\n\tif char.isupper():\n\t\tup.append(char)\n\tif char.islower():\n\t\tlow.append(char)\n\nif len(up) > len(low):\n\tprint(s.upper())\nelif len(up) < len(low):\n\tprint(s.lower())\nelse:\n\tprint(s.lower())\n", "s = input()\r\nbig = small = 0\r\nfor i in range(len(s)):\r\n if ord(s[i]) < 91:\r\n big += 1\r\n else:\r\n small += 1\r\nif big > small:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=str(input())\r\ns=0\r\nd=0\r\nfor i in a:\r\n if i>='A' and i<='Z':\r\n s+=1\r\n else:\r\n d+=1\r\nif d<s:\r\n print(a.upper())\r\nelif d>=s:\r\n print(a.lower())\r\n \r\n", "n = input()\r\nup = 0\r\nlow = 0\r\nfor i in n:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif up > low:\r\n print(n.upper())\r\nelif low > up:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())\r\n", "h = input()\r\nt = 0\r\nb = 0\r\nfor i in h:\r\n o = i\r\n o1 = i.lower()\r\n o2 = i.upper()\r\n if i == o1:\r\n t += 1\r\n elif i == o2:\r\n b += 1\r\nif t >= b:\r\n print(h.lower())\r\nelse:\r\n print(h.upper())\r\n", "st = input()\r\n\r\nu = 0\r\nl = 0\r\nfor i in st:\r\n if i.isupper():\r\n u +=1\r\n else:\r\n l +=1\r\n\r\nif u>l:\r\n print(st.upper())\r\nelse:\r\n print(st.lower())\r\n", "s=input()\r\nct=0\r\nfor c in s:\r\n if c==c.upper(): ct+=1\r\nprint(s.upper() if ct>(len(s)/2) else s.lower())", "word=input()\r\ncountlow=0\r\ncountup=0\r\nfor i in word:\r\n if i.islower():\r\n countlow=countlow+1\r\n else:\r\n countup=countup+1\r\nif countup<=countlow:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = input()\r\n\r\nuc = 0\r\nlc = 0\r\nfor char in s:\r\n if char >= 'a' and char <= 'z':\r\n lc += 1\r\n elif char >= 'A' and char <= 'Z':\r\n uc += 1\r\nif uc > lc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nlst = [a for a in s]\r\nlower = upper = 0\r\nfor i in lst:\r\n if i.islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nc = 0\r\nd = 0\r\nfor i in range(len(s)):\r\n\tif(s[i] == s[i].upper()):\r\n\t\tc += 1\r\n\telse:\r\n\t\td += 1\r\nif (c > d):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n", "word= input(\" \")\r\n\r\ncount1=0\r\n\r\ncount2=0\r\n\r\nfor i in word:\r\n\r\n\tif i.isupper():\r\n\r\n\t\tcount1=count1+1\r\n\r\n\tif i.islower():\r\n\r\n\t\tcount2=count2+1\r\n\r\nif count1>count2:\r\n\r\n\tprint(word.upper())\r\n\r\nelse:\r\n\r\n\tprint(word.lower())\r\n\r\n", "n=input()\r\nl=len(n)\r\nlc=0\r\nuc=0\r\nfor i in range(l):\r\n if n[i].islower():\r\n lc+=1\r\n elif n[i].isupper():\r\n uc+=1\r\nif lc>uc:\r\n n=n.lower()\r\nelif uc>lc:\r\n n=n.upper()\r\nelif lc==uc:\r\n n=n.lower()\r\nprint(n)", "st = input()\r\nlc = 0\r\nuc = 0\r\nfor c in st:\r\n if(c.islower()):\r\n lc+=1\r\n else:\r\n uc+=1\r\nif(lc >= uc):\r\n print(st.lower())\r\nelse:\r\n print(st.upper())", "s = input()\r\nt = len(s)\r\na = 0\r\nb = 0\r\nfor i in range(0,t):\r\n if s[i] == s[i].lower():\r\n a = a+1\r\n else:b = b+1\r\n\r\nif a >=b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input();i=0\r\nfor e in s:\r\n if e.islower():\r\n i+=1\r\nif i >= (len(s)/2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "st = input()\r\nu=0\r\nl = 0\r\nfor i in st:\r\n\tif i == i.upper():\r\n\t\tu+=1\r\n\telse:\r\n\t\tl+=1\r\nif u>l:\r\n\tprint(st.upper())\r\nelse:\r\n\tprint(st.lower())", "word = input()\r\ncount_uc = 0\r\ncount_lc = 0\r\nfor c in word:\r\n if c.isupper():\r\n count_uc += 1\r\n else:\r\n count_lc += 1\r\nif count_uc > count_lc:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n ", "\r\nfrom sys import stdin, stdout\r\nfrom string import ascii_letters, ascii_lowercase, ascii_uppercase\r\nfrom collections import Counter\r\n\r\n# with open('testcase.txt', 'r') as stdin:\r\n# _ = stdin.readline()\r\nstring = stdin.readline().rstrip()\r\nlower = tuple(i for i in string if i in ascii_lowercase)\r\nif len(lower) >= len(string)-len(lower):\r\n string = string.lower()\r\nelse:\r\n string = string.upper()\r\n\r\nstdout.write(string)\r\n\r\n\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 = input()\r\nl,u = 0,0\r\nfor i in range(len(x)):\r\n if(x[i]>='a' and x[i]<='z'):\r\n l+=1\r\nu = len(x)-l\r\nif(l>=u):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "#!/usr/bin/env python\n\n# Header \nimport re \n\n# Input \nget_INPUT = input()\n\n# Logic for Word \nlower,upper = 0,0\nfor i in get_INPUT:\n\tif i.isupper():\n\t\tupper = upper+1\n\telif i.islower():\n\t\tlower = lower+1\n\nif lower > upper or lower == upper:\n\tprint(get_INPUT.lower())\nelif upper > lower:\n\tprint(get_INPUT.upper())", "s = str(input())\r\nupper = sum(map(str.isupper, s)) \r\nlow = sum(map(str.islower, s))\r\nif upper > low:\r\n t = s.upper()\r\nelse:\r\n t = s.lower()\r\nprint(t)", "s=input()\nl=0\nu=0\nfor i in s:\n if(i==i.lower()):\n l+=1\n elif(i==i.upper()):\n u+=1\nif(l>=u):\n print(s.lower())\nelif(u>l):\n print(s.upper())\n", "s = input()\r\ncount_Up = 0\r\ncount_Lower = 0\r\nfor i in s:\r\n if i.islower():\r\n count_Lower += 1\r\n elif i.isupper():\r\n count_Up += 1\r\nif count_Lower > count_Up:\r\n s = s.lower()\r\nelif count_Lower < count_Up:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "string=input()\r\n\r\ncount1=0\r\ncount2=0\r\n\r\nfor i in string:\r\n if(i.islower()):\r\n count1 += 1\r\n elif(i.isupper()):\r\n count2 += 1\r\n\r\nif count2 > count1:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "n=input()\r\nup=0\r\nlow=0\r\nfor i in n:\r\n if(i.islower()):\r\n low+=1\r\n elif(i.isupper()):\r\n up+=1\r\nif(low==up or low>up):\r\n s=n.lower()\r\n print(s)\r\nelse:\r\n s=n.upper()\r\n print(s)\r\n", "string = input()\r\nlow=0\r\nhigh=0\r\nfor i in string:\r\n if (i.islower()):\r\n low+=1\r\n else :\r\n high+=1\r\nif low >= high:\r\n print(string.lower())\r\nelse :\r\n print(string.upper())\r\n", "k=input()\ncl=0\ncu=0\nfor i in k:\n if i.islower():\n cl=cl+1\n if i.isupper():\n cu=cu+1\nif cl>cu:\n print(k.lower())\nif cl<cu:\n print(k.upper())\nif cl==cu:\n print(k.lower())\n \t\t\t\t\t\t \t\t \t \t \t \t\t\t\t \t\t", "s= input()\r\ncount=0\r\nl = len(s)\r\nfor i in range(len(s)):\r\n if s[i].islower() == True:\r\n count +=1\r\nif count >= l - count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nb = 0\r\nm = 0\r\nfor i in s:\r\n\tif i.isupper():\r\n\t\tb += 1\r\n\telse:\r\n\t\tm += 1\r\nif b > m:\r\n\t\tprint(s.upper())\r\nelif b < m:\r\n\t\tprint(s.lower())\r\nelse:\r\n\t\tprint(s.lower())\r\n\t\t", "string = input()\n\nup = 0\nlow = 0\n\ni = 0\n\nwhile(i<len(string)):\n if ord(string[i])>=65 and ord(string[i])<=90:\n up+=1\n else:\n low+=1\n i+=1\n\nif up>low:\n ok = string.upper()\nelse:\n ok = string.lower()\n\nprint(ok)", "import sys\r\nimport io\r\nimport os\r\n\r\ntotal = 0\r\nfailed = 0\r\ndef run(test,res):\r\n x = io.StringIO()\r\n with io.StringIO(test) as sys.stdin:\r\n with x as sys.stdout:\r\n work()\r\n z = x.getvalue().strip()\r\n sys.stdout = sys.__stdout__\r\n print(\"Passed?\", z == res)\r\n print(\"Expected: \", res)\r\n print(\"Actual : \", z)\r\n global total, failed\r\n total += 1\r\n failed += 1 if (z != res) else 0\r\n\r\ndef work():\r\n s = input()\r\n c = 0\r\n for e in s:\r\n if e>='a' and e<='z':\r\n c += 1\r\n print(s.lower() if (c >= len(s)/2) else s.upper())\r\n\r\ndef test():\r\n run(\"\"\"HoUse\"\"\", \"\"\"house\"\"\")\r\n run(\"\"\"ViP\"\"\", \"\"\"VIP\"\"\")\r\n run(\"\"\"maTRIx\"\"\", \"\"\"matrix\"\"\")\r\n\r\nif('LOCALTEST' in os.environ):\r\n test()\r\n print(\"\\n Result: %s (%d total, %d failed)\" % (\"FAILED\" if (failed>0) else \"PASSED\", total, failed))\r\nelse:\r\n work()\r\n", "import string\n\ns = input()\n\ndef x(s):\n u =0\n l = 0\n for c in s:\n if c in string.ascii_uppercase:\n u+=1\n else:\n l+=1\n if u>l:\n return s.upper()\n else:\n return s.lower()\n\n\nprint(x(s))\n", "a=input()\r\nM=0\r\nfor i in a:\r\n if ord(i)<91:\r\n M=M+1\r\nif 2*M>len(a):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "n=input()\r\nupper=0\r\nlower=0\r\nfor i in n:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper==lower or lower>upper:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "from sys import stdin, stdout\r\n\r\ndef readline():\r\n return stdin.readline().rstrip()\r\n\r\ndef readint():\r\n return int(readline())\r\n\r\ndef readints():\r\n return [int(x) for x in readline().split()]\r\n\r\ndef writeline(s):\r\n stdout.write(str(s)+\"\\n\")\r\n\r\n\r\ns = readline()\r\n\r\nupp = sum(c.isupper() for c in s)\r\nlow = len(s) - upp\r\n\r\nwriteline(s.upper() if upp > low else s.lower())", "s=input()\r\nUC=0\r\nLC=0\r\nfor i in s:\r\n if(i.islower()):\r\n LC=LC+1\r\n elif(i.isupper()):\r\n UC=UC+1\r\nif(UC>LC):\r\n print(s.upper())\r\nelif(LC>UC):\r\n print(s.lower())\r\nelif(LC==UC):\r\n print(s.lower())", "word = input()\r\nbig_letter = 0\r\nsmall_letter = 0\r\nfor i in word:\r\n if ord(i) < 95:\r\n big_letter += 1\r\n else:\r\n small_letter += 1\r\n\r\nprint(word.lower() if small_letter >= big_letter else word.upper())", "import sys\r\ns = sys.stdin.read().strip()\r\nd = sum(i.islower() or -1 for i in s)\r\nprint(d < 0 and s.upper() or s.lower())\r\n", "s = input()\r\nc, m = 0, 0\r\nfor i in s:\r\n if 65<=ord(i)<=90:\r\n c+=1\r\n elif 97<=ord(i)<=122:\r\n m+=1\r\nif c>m:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nsmall = 0\r\nbig = 0\r\nfor i in s:\r\n if i >= 'a' and i <= 'z':\r\n small += 1\r\n else:\r\n big += 1\r\nif small >= big:\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)\r\n", "s = input()\r\nupper_counter = 0\r\nlower_counter = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n upper_counter +=1\r\n elif s[i].islower():\r\n lower_counter +=1\r\n\r\nif upper_counter > lower_counter:\r\n print(s.upper())\r\n\r\nelse:\r\n print(s.lower())", "word = str(input())\r\nlength = len(word)\r\nupper_count = 0\r\nlower_count = 0\r\nfor letter in word:\r\n if letter.isupper():\r\n upper_count += 1\r\n\r\nfor letter in word:\r\n if letter.islower():\r\n lower_count += 1\r\n\r\nif upper_count>lower_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "x = input()\r\nl = 0\r\nu = 0\r\nfor i in x:\r\n if i.islower():\r\n l += 1\r\n elif i.isupper():\r\n u += 1\r\n else:\r\n continue\r\n\r\nif l > u:\r\n print(x.lower())\r\nelif l < u:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n \r\n", "def convert(string):\r\n list1 = []\r\n list1[:0] = string\r\n return list1\r\n\r\na = input()\r\nl1 = convert(a)\r\nlower = 0\r\nupper = 0\r\nfor i in l1:\r\n \r\n if i.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper>lower:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "n = input()\r\ns = 0\r\nfor i in range(len(n)):\r\n if n[i].islower():\r\n s += 1\r\nif s >= len(n)-s:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())\r\n", "word = str(input())\r\nupper = \"\"\r\nlower = \"\"\r\nfor i in word:\r\n if i.islower() == True:\r\n lower += i\r\n elif i.isupper() == True:\r\n upper += i\r\nif len(upper)>len(lower):\r\n print(word.upper())\r\nelif len(lower)>len(upper):\r\n print(word.lower())\r\n\r\nelif len(lower)==len(upper):\r\n print(word.lower())", "strr = input()\r\ncntA,cnta = 0,0\r\nfor ch in strr:\r\n if ch>='A' and ch<='Z':\r\n cntA+=1\r\n else:\r\n cnta+=1\r\nif(cntA>cnta):\r\n print(strr.upper())\r\nelse:\r\n print(strr.lower())\r\n", "str = input()\nletter = list(str)\ntotal_lower = 0\ntotol_upper = 0\nfor i in letter:\n if i.islower():\n total_lower +=1\n else:\n totol_upper +=1\nif total_lower >= totol_upper:\n str = str.lower()\nelse:\n str = str.upper()\nprint(str)", "s=input()\r\nu=0\r\nd=0\r\nfor a in s:\r\n if a.isupper():\r\n u+=1\r\n else:\r\n d+=1\r\nif u>d:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\nlow = 0\r\nhigh = 0\r\nfor i in word:\r\n if(i.isupper()):\r\n high += 1\r\n else:\r\n low += 1\r\nif(high > low):\r\n print(word.upper())\r\nelif(low > high):\r\n print(word.lower())\r\nelse:\r\n print(word.lower())\r\n", "str1 = str(input())\r\ncount_1 = count_2 = 0\r\nfor i in range (len(str1)):\r\n if ord(str1[i]) < ord('a'):\r\n count_1 += 1\r\n else:\r\n count_2 += 1\r\nif (count_1 <= count_2):\r\n str1 = str1.lower()\r\nelse:\r\n str1 = str1.upper()\r\nprint(str1)", "''' Hariom_Pandey\r\n 13.11.2019 '''\r\nimport math as mt\r\nimport sys as sy\r\nclass abc:\r\n def mkl(self,):\r\n li=[]\r\n word = input()\r\n u = [x for x in word if x.isupper()]\r\n l = [x for x in word if x.islower()]\r\n if len(u)<len(l):\r\n print(word.lower())\r\n elif len(l)<len(u):\r\n print(word.upper())\r\n elif len(u)==len(l):\r\n print(word.lower())\r\n\r\nb=abc()\r\nb.mkl()", "s = input()\r\nlo = 'abcdefghijklmnopqrstuvwxyz'\r\nlonum = 0\r\nfor c in s:\r\n if(c in lo) : lonum += 1\r\nif(lonum >= len(s) - lonum) : print(s.lower())\r\nelse : print(s.upper())\r\n", "# author : Leandro\r\n# problem : A. Word\r\n# platform : Codeforces\r\n# date : 2021-05-21\r\n\r\nline = input()\r\n\r\nlower = 0\r\nfor c in line:\r\n lower += int(c.islower())\r\n\r\nsolution = line.upper() if lower < len(line) - lower else line.lower()\r\n\r\nprint(solution)\r\n", "n = input()\nl = [i for i in range(len(n)) if n[i]==n[i].lower()]\nprint(n.lower() if len(l)>=len(n)/2 else n.upper())", "a = input()\r\nl_a = [i for i in a if i.islower()]\r\n\r\n\r\nif len(a) % 2 == 0:\r\n if len(a) // 2 <= len(l_a):\r\n a = a.lower()\r\n else:\r\n a = a.upper()\r\n \r\nelif len (a) % 2 != 0:\r\n if len(a) // 2 ++ 1 <= len(l_a):\r\n a = a.lower()\r\n else:\r\n a = a.upper()\r\n \r\n \r\nprint(a)", "s =input()\nl,u = 0,0\nfor i in s: \n if (i>='a'and i<='z'): \n l=l+1 #counting lower case \n if (i>='A'and i<='Z'): \n u=u+1\nif l>u or l==u:\n print(s.lower())\nelse:\n print(s.upper())\n ", "s = input()\r\np = 0\r\nc = 0\r\n\r\nfor x in s:\r\n if x.islower() == True: c += 1\r\n else: p += 1\r\n\r\nif p > c: print(s.upper())\r\nif p < c or p == c: print(s.lower())", "s=input()\r\nlow=0\r\nhigh=0\r\nfor i in s:\r\n if (i>='a' and i<='z'):\r\n low+=1 \r\n else:\r\n high+=1 \r\nif low>=high:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "w = input()\r\n\r\nup = 0\r\n\r\nlp = 0\r\n\r\nfor i in w:\r\n if i.islower():\r\n lp += 1 \r\n else :\r\n up += 1 \r\n \r\n \r\nif lp >= up:\r\n print(w.lower())\r\nelse :\r\n print(w.upper())", "string=input()\r\ncnt1 = 0\r\ncnt2 = 0\r\nfor i in string:\r\n if(i.islower()):\r\n cnt1=cnt1+1\r\n elif(i.isupper()):\r\n cnt2 = cnt2+1\r\nif cnt1 > cnt2:\r\n print(string.lower())\r\nelif cnt1 < cnt2 :\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "word = input()\ncount = 0\nfor char in word:\n if char != char.lower():\n count += 1\nif count > len(word) // 2:\n print(word.upper())\nelse:\n print(word.lower())\n", "s=input()\r\na=0\r\nl=0\r\nfor i in s:\r\n if i.isupper():\r\n a=a+1 \r\n else:\r\n l=l+1 \r\nif l>a or l==a:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "n = input()\r\nc = 0\r\nl = 0\r\nfor i in n:\r\n if i.isupper() :\r\n c = c + 1\r\n else:\r\n l = l + 1\r\nif c>l:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "i = input()\r\n\r\n\r\nj = sum(map(lambda n: n.isupper(),i))\r\nk = sum(map(lambda n: n.islower(),i))\r\n\r\nif k>= j :\r\n\tprint(i.lower())\r\nelse:\r\n\tprint(i.upper())", "s = input()\r\nk = 0\r\nm = 0\r\nfor i in s:\r\n\tif i.isupper():\r\n\t\tk += 1\r\n\telse:\r\n\t\tm += 1\r\nif k > m:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s=input()\r\nl=[x for x in s if 97<=ord(x)<=122]\r\nu=[x for x in s if 65<=ord(x)<=90]\r\nm=len(l)\r\nn=len(u)\r\nif m==n:\r\n print(s.lower())\r\nelif m>n:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "import math\na=input(\"\")\ncount=0\nfor i in a:\n if(i.isupper()):\n count+=1\nif(count>(len(a)-count)):\n \n print(a.upper())\nelse:\n print(a.lower())\n", "s=input()\r\nc1=c2=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n c1=c1+1\r\n elif s[i].isupper():\r\n c2=c2+1\r\nif c1>c2 or c1==c2:\r\n s=s.lower()\r\nelif c2>c1:\r\n s=s.upper()\r\nprint(s)\r\n\r\n ", "string = input()\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(string)):\r\n if (ord(string[i]) >= 97 and\r\n ord(string[i]) <= 122):\r\n lower += 1\r\n elif (ord(string[i]) >= 65 and\r\n ord(string[i]) <= 90):\r\n upper += 1\r\nif(upper>lower):\r\n print(string.upper())\r\nelif(lower>upper):\r\n print(string.lower())\r\nelif(lower==upper):\r\n print(string.lower())\r\n", "# Input\r\ns = input()\r\n\r\n# Main\r\ncountUpperCases = 0\r\n\r\nfor char in s:\r\n if char.isupper():\r\n countUpperCases += 1\r\n\r\nif countUpperCases > len(s) - countUpperCases:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\nl = [1 if c.islower() else 0 for c in s]\nprint(s.upper() if 2*sum(l)<len(s) else s.lower())\n", "string = input() # get input from judge.\r\n\r\nlist = list(string) # convert string into a list\r\n\r\ncapList = [] # empty list for holding upper letters\r\nlowList = [] # empty list for holding lower letters\r\n\r\nfor i in range(len(string)): \r\n if list[i].isupper(): # if letter is capital, add to cap list.\r\n capList.append(list[i])\r\n else: # else, add letter to low list.\r\n lowList.append(list[i])\r\n\r\nif len(capList) > len(lowList): # if cap list is bigger than low list\r\n output = string.upper() # make the input string all caps.\r\nelse: # otherwise make the string lower case.\r\n output = string.lower()\r\n\r\nprint(output) # print the output.\r\n", "word=input()\nresult=0\nfor x in word:\n if x.isupper():\n result+=1\nif result>(len(word)/2):\n print (word.upper())\nelse:\n print (word.lower())", "s=input()\r\nc=0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1\r\nl=len(s)-c\r\nif c>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[2]:\n\n\np='MaTrix'\np.isupper()\n\n\n# In[10]:\n\n\ns=input()\narr=[]\nfor i in range(len(s)):\n arr.append(s[i])\nu=[]\nl=[]\nfor i in arr:\n if 65<=ord(i)<=90 :\n u.append(i)\n if 97<=ord(i)<=122 :\n l.append(i)\nif len(l)>=len(u) :\n print(s.lower())\nelse :\n print(s.upper())\n \n\n\n# In[ ]:\n\n\n\n\n", "s = input()\r\nset_small = 0\r\nset_BIG = 0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n set_small += 1\r\n elif 'A' <= i <= 'Z':\r\n set_BIG += 1\r\nif set_small >= set_BIG:\r\n s = s.lower()\r\nelif set_BIG > set_small:\r\n s = s.upper()\r\nprint(s)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri May 21 22:17:10 2021\r\n\r\n@author: TSSPDCL\r\n\"\"\"\r\n\r\nstr1=input()\r\nnu=0\r\nnl=0\r\nfor i in str1:\r\n if i.isupper():\r\n nu+=1\r\n elif i.islower():\r\n nl+=1\r\nif nl>=nu:\r\n print(str1.lower())\r\nelif nu>nl:\r\n print(str1.upper())", "s=input()\r\na=0;\r\nb=0;\r\nfor i in range(0, len(s)):\r\n if(s[i:i+1]==s[i:i+1].lower()):\r\n a=a+1\r\n else:\r\n b=b+1\r\nif(b>a):\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "n = input()\r\ncount_up = 0\r\ncount_lo = 0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n count_up += 1\r\n else:\r\n count_lo += 1\r\n\r\nif count_up > count_lo:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri May 21 23:06:38 2021\r\n\r\n@author: kkhan\r\n\"\"\"\r\n\r\ns=str(input(\"\"))\r\nlength=len(s)\r\nc1=c2=0\r\nupper ='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nlower='abcdefghijklmnopqrstuvwxyz'\r\n\r\nfor i in range(length):\r\n if s[i] in upper:\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\n length-=1\r\n \r\nif c1<=c2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "k=input().strip()\r\nup=sum(1 for letter in k if letter.isupper())\r\nlp=len(k)-up\r\nif up>lp:\r\n c=k.upper()\r\nelse:\r\n c=k.lower()\r\nprint(c)", "a=input()\r\nl=0\r\nfor i in a:\r\n if i.islower(): \r\n l+=1\r\nu=len(a)-l\r\nif l>=u:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "word=input()\r\nx=0\r\ny=0\r\nfor i in range(len(word)):\r\n if word[i]==word[i].upper():\r\n x=x+1\r\n else:\r\n y=y+1\r\nif x>y:\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)\r\n", "s=input()\r\nalpha='abcdefghijklmnopqrstuvwxyz'\r\nlcount=0\r\nucount=0\r\nfor x in s:\r\n for i in alpha:\r\n if(x==i):\r\n lcount=lcount+1\r\n\r\nup=alpha.upper()\r\nfor x in s:\r\n for i in up:\r\n if(x==i):\r\n ucount=ucount+1\r\n\r\n# print(lcount,ucount)\r\n\r\nif(ucount>lcount):\r\n print(s.upper())\r\nif(ucount<lcount or ucount==lcount):\r\n print(s.lower())", "s = input()\r\nup, low = 0, 0\r\nfor elem in s:\r\n if 'a' <= elem <= 'z':\r\n low += 1\r\n else:\r\n up += 1\r\nif low >= up:\r\n print(*(elem.lower() for elem in s), sep='')\r\nelse:\r\n print(*(elem.upper() for elem in s), sep='')", "m = 0\r\nl = input()\r\nfor i in l:\r\n if i == i.lower():\r\n m += 1\r\n else:\r\n m -= 1\r\nprint(l.lower() if m >= 0 else l.upper())\r\n", "s = input()\r\ns_list = list(s)\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor x in s_list:\r\n\tif x.isupper():\r\n\t\tuppercase+=1\r\n\telse:\r\n\t\tlowercase+=1\r\n\r\nif uppercase>lowercase:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "s=input()\r\nc=sum(True for i in s if 65<=ord(i)<=90)\r\nprint(s.lower()) if len(s)-c>=c else print(s.upper())", "a = str(input())\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in a:\r\n if i.islower():\r\n count1 = count1 + 1\r\n else:\r\n count2 = count2 + 1\r\n\r\nif(count1 >= count2):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n", "import random\r\nup=0 ; low=0\r\nx=input()\r\nfor letter in x:\r\n if letter.isupper():\r\n up=up+1\r\n else:\r\n low=low+1\r\n\r\nif(up>low):\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\r\ncount=0\r\nfor i in s:\r\n if i.isupper():\r\n count+=1\r\nif len(s)/2>=count:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "word = input()\r\n\r\ncountUppercase = 0\r\n\r\nfor i in word:\r\n if ord(i) > 64 and ord(i) < 91:\r\n countUppercase+=1\r\n \r\nif countUppercase > (len(word)/2):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\n\r\nlower_count = 0\r\nupper_count = 0\r\n\r\nfor item in word:\r\n if item.islower():\r\n lower_count += 1 \r\n else:\r\n upper_count += 1\r\n\r\nif lower_count >= upper_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper()) ", "s1=input()\r\ncountlower=0\r\ncountupper=0\r\nfor i in range(len(s1)):\r\n if(ord(s1[i])<97):\r\n countupper+=1\r\n else:\r\n countlower+=1\r\nif(countupper<=countlower):\r\n print(s1.lower())\r\nelse:\r\n print(s1.upper())", "s=input()\r\nc=0\r\nfor e in s:\r\n if(e.isupper()):\r\n c+=1\r\nlo=len(s)-c\r\nif(c<=lo):\r\n print(s.lower()) \r\nelse:\r\n print(s.upper()) ", "def main():\r\n s = input()\r\n\r\n count = 0\r\n\r\n for i in range(len(s)):\r\n if s[i].isupper(): \r\n count += 1\r\n \r\n if count > (len(s) / 2):\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "\r\ndef word(s:str) -> str:\r\n letters = list(s)\r\n upper_letters = 0\r\n lower_letters = 0\r\n for letter in letters:\r\n if letter.isupper():\r\n upper_letters += 1\r\n else:\r\n lower_letters += 1\r\n if upper_letters == lower_letters or upper_letters < lower_letters:\r\n word = s.lower()\r\n return word\r\n elif upper_letters > lower_letters:\r\n word = s.upper()\r\n return word\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n result = word(s=s)\r\n print(result)\r\n", "a = str(input())\r\nupper_num = 0\r\nfor i in a:\r\n if i.isupper() :\r\n upper_num += 1\r\nlower_num = len(a)-upper_num\r\nprint(a.lower()) if (upper_num <= lower_num) else print(a.upper())\r\n \r\n", "s=input()\r\na=s.lower()\r\nb=s.upper()\r\nk=0\r\nj=0\r\nfor i in s:\r\n if i in a:\r\n j=j+1\r\n elif i in b:\r\n k=k+1\r\nif j<k:\r\n print(b)\r\nelse:\r\n print(a)", "# https://codeforces.com/problemset/problem/59/A\r\n\r\ns=input()\r\nx=0\r\ny=0\r\nl=len(s)\r\nfor i in range(l):\r\n if s[i].isupper():\r\n x+=1\r\n elif s[i].islower():\r\n y+=1\r\nif x>y:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input(\"\")\r\ncap = 0\r\nsmall = 0\r\nfor char in word:\r\n if char.isupper():\r\n cap += 1\r\n else:\r\n small += 1\r\nif cap > small:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "l=input()\r\nnoho=0\r\nnolo=0\r\nfor i in range(len(l)):\r\n if l[i]>='A' and l[i]<='Z':\r\n noho=noho+1\r\n else:\r\n nolo=nolo+1\r\nif noho>nolo:\r\n print(l.upper())\r\nelse:\r\n print(l.lower())\r\n", "x = input()\r\nl = b = 0\r\nfor s in x:\r\n if s.islower():\r\n l += 1\r\n else:\r\n b += 1\r\nif l>=b:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s = input()\r\nuc = 0\r\nfor i in s:\r\n if(i.isupper()):\r\n uc += 1\r\nlc = len(s) - uc\r\nif(uc > lc):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "l,u = 0,0\r\ns = input()\r\n\r\nfor i in s:\r\n if(i.isupper()):\r\n u +=1\r\n elif i.islower():\r\n l +=1\r\nif u > l:\r\n s = s.upper()\r\nelif l > u or l == u:\r\n s = s.lower()\r\nprint(s)", "n=input()\r\na=(len(n)/2)\r\nb=0\r\nfor i in n:\r\n if i.islower():\r\n b+=1\r\nif b>a:\r\n print(n.lower())\r\nelif b==a:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s=input()\r\na1='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\na2='abcdefghijklmnopqrstuvwxyz'\r\ncnt1=0\r\ncnt2=0\r\nfor i in s:\r\n if i in a1:\r\n cnt1=cnt1+1\r\n elif i in a2:\r\n cnt2=cnt2+1\r\nif(cnt1>cnt2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n \r\n \r\n ", "word = input()\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in range(len(word)):\r\n if word[i] in 'qwertyuiopasdfghjklzxcvbnm':\r\n count1 += 1\r\n elif word[i] in 'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n count2 += 1\r\n\r\n\r\n\r\nif count2 > count1:\r\n word = word.upper()\r\nelse:\r\n if count1 > count2:\r\n word = word.lower()\r\n else:\r\n if count1 == count2:\r\n word = word.lower()\r\nprint(word)", "word = input(\"\")\r\nall = len(word)\r\ncap = 0\r\n\r\nfor letter in word:\r\n if ord(letter) < 97:\r\n cap += 1\r\n\r\nsmall = all - cap\r\n\r\nif cap > small:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in range(len(word)):\r\n if word[i].lower() != word[i]:\r\n upper_count += 1\r\n if word[i].upper() != word[i]:\r\n lower_count += 1\r\nif upper_count > lower_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "list1,ans=[str(x) for x in [char for char in input()]],''\r\ndict1={0:[str(x.lower()) for x in list1 ],1:[str(x.upper()) for x in list1]}\r\nif len([str(x) for x in list1 if x.isupper()])==len([str(x) for x in list1 if x.islower()]):\r\n for i in list1:\r\n ans+=i.lower()\r\n print(ans)\r\nelse:\r\n for i in dict1[len([str(x) for x in list1 if x.isupper()])>len([str(x) for x in list1 if x.islower()])]:\r\n ans+=i\r\n print(ans)\r\n", "a = input()\r\ncap = 0\r\nsmall = 0\r\nfor i in range(len(a)):\r\n if a.upper()[i] == a[i]:\r\n cap += 1\r\n else:\r\n small += 1\r\nif cap > small:\r\n a = a.upper()\r\nelif cap <= small:\r\n a = a.lower()\r\nprint(a)", "w=input()\r\nuppercase=0\r\nlowercase=0\r\nfor i in w:\r\n if i.isupper():\r\n uppercase+=1\r\n elif i.islower():\r\n lowercase+=1\r\nif lowercase>=uppercase:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "w=input()\r\nl=len(w)\r\ns=0\r\nfor i in range (len(w)):\r\n shibushi=w[i].islower()\r\n if shibushi==True:\r\n s+=1\r\n \r\nif 2*s>=len(w):\r\n print(w.lower())\r\nelse:\r\n print(w.upper())\r\n", "def solve(str,n):\r\n cl,cu=0,0\r\n for i in range(n):\r\n if str[i].islower():\r\n cl+=1\r\n else:\r\n cu+=1\r\n if cu>cl:\r\n return str.upper()\r\n return str.lower()\r\nif __name__=='__main__':\r\n str=input()\r\n n=len(str)\r\n res=solve(str,n)\r\n print(res)\r\n", "# A. Word\n# time limit per test2 seconds\n# memory limit per test256 megabytes\n# inputstandard input\n# outputstandard output\n\n\n# Vasya is very upset that many people on the Net mix uppercase and \n# lowercase letters in one word. That's why he decided to invent \n# an extension for his favorite browser that would change the letters' \n# register in every word so that it either only consisted of lowercase \n# letters or, vice versa, only of uppercase ones. At that as little as \n# possible letters should be changed in the word. For example, the\n# word HoUse must be replaced with house, and the word ViP — with VIP. \n# If a word contains an equal number of uppercase and lowercase letters, \n# you should replace all the letters with lowercase ones. For example, \n# maTRIx should be replaced by matrix. Your task is to use the given method on one given word.\n\n# Input\n# The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.\n\n# Output\n# Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.\n\n# Examples\n# inputCopy\n# HoUse\n# outputCopy\n# house\n# inputCopy\n# ViP\n# outputCopy\n# VIP\n# inputCopy\n# maTRIx\n# outputCopy\n# matrix\n\n\ns = input().strip()\nss = list(s)\n\nl = 0\nu = 0\n\nfor i in ss:\n\n # print(i.islower())\n if i.islower()==True:\n l+=1\n elif i.isupper()==True:\n u+=1\nif u>l:\n print(s.upper())\nelse:\n print(s.lower())\n\n\n# print(u,l)", "s = input()\nbig = [i for i in s if i.isupper()]\nsmall = [i for i in s if i.islower()]\n\nif len(big) > len(small):\n print(s.upper())\nelif len(big) < len(small):\n print((s.lower()))\nelse:\n print(s.lower())\n", "s = input()\nlower, upper = 0, 0\nfor c in s:\n\tif c>='a' and c<='z':\n\t\tlower += 1\n\telse:\n\t\tupper += 1\nif lower >= upper:\n\tprint(s.lower())\nelse:\n\tprint(s.upper())", "\"\"\"\nSizhang Zhao 1200011770\nSolution for problem 2\nThe other way is applying upper() and lower() functions\n\"\"\"\ns = input()\nresult = ''\nlength = len(s)\nif length > 100:\n\tprint(\"wrong input\")\n\texit()\nupper = 0;\nfor i in range(0, length):\n\tif s[i] >= 'A' and s[i] <= 'Z':\n\t\tupper += 1;\ndif = ord('A') - ord('a')\nif upper > length/2:\n\tfor i in range(0, length):\n\t\tif s[i] >= 'a' and s[i] <= 'z':\n\t\t \ttem = ord(s[i]) + dif\n\t\t \tresult += chr(tem)\n\t\telse: \n\t\t\tresult += s[i]\nif upper <= length/2:\n\tfor i in range(0, length):\n\t\tif s[i] >= 'A' and s[i] <= 'Z':\n\t\t \ttem = ord(s[i]) - dif\n\t\t \tresult += chr(tem)\n\t\telse: \n\t\t\tresult += s[i]\nprint(result)\n", "s = input()\n\nbig = 0\nsmall = 0\n\nfor c in s:\n if c.isupper():\n big += 1\n else:\n small += 1\n \nif small >= big:\n print(s.lower())\nelse:\n print(s.upper())\n ", "\ndef change_case(word):\n uppercase_count = sum(1 for c in word if c.isupper())\n lowercase_count = sum(1 for c in word if c.islower())\n \n if uppercase_count > lowercase_count:\n return word.upper()\n elif lowercase_count >= uppercase_count:\n return word.lower()\ns = input()\nprint(change_case(s))\n\n", "s = input()\r\nupp = 0\r\nlow = 0\r\nfor i in s:\r\n if i.islower() == True:\r\n low += 1\r\n else:\r\n upp += 1\r\nif upp > low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\ncnt1=0\r\ncnt2=0\r\nfor i in s:\r\n if(ord(i)>=97):\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\nif(cnt1>=cnt2):\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)\r\n", "L = str(input())\r\n \r\nu = 0\r\nl = 0\r\nfor i in L :\r\n if i.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\n \r\nif (u>l) :\r\n print(L.upper())\r\nelse :\r\n print(L.lower())", "a=input() \r\nx=0\r\ny=0 \r\nfor i in a:\r\n if i.isupper():\r\n y=y+1\r\n else:\r\n x=x+1\r\nif y>x:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "a=input()\r\nc=0\r\nd=0\r\nfor i in a:\r\n if(i.islower()):\r\n c+=1\r\n else:\r\n d+=1\r\nif(d>c):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "kat=input()\r\nuniv=0\r\nlniv=0\r\nfor i in range(len(kat)):\r\n if(kat[i].isupper()):\r\n univ=univ+1\r\n else:\r\n lniv=lniv+1\r\nif(univ>lniv):\r\n print(kat.upper())\r\nelse:\r\n print(kat.lower())", "x = list(input())\r\ncu = 0\r\ncl = 0\r\nfor i in range(len(x)):\r\n if x[i]==x[i].upper():\r\n cu +=1\r\n else:\r\n cl +=1\r\nx = \"\".join(x)\r\nif cu>cl:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "lower = \"abcdefghijklmnopqrstuvwxyz\"\nupper = lower.upper()\ndef lowerOrUpper():\n\tnumOfLower = 0\n\tnumOfUpper = 0\n\tinp = input()\n\tfor letter in inp:\n\t\tif letter in lower:\n\t\t\tnumOfLower += 1\n\t\telse:\n\t\t\tnumOfUpper += 1\n\tif numOfUpper > numOfLower:\n\t\tprint(inp.upper())\n\telse:\n\t\tprint(inp.lower())\n\nlowerOrUpper()", "word=input()\r\nl=len(word)\r\nlow=0\r\nupp=0\r\nfor i in range(l):\r\n if ord(word[i])>=65 and ord(word[i])<=90:\r\n upp=upp+1\r\n else:\r\n low=low+1\r\nif upp>low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "from math import ceil\r\nimport sys,bisect,copyreg,copy,statistics,os\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef IIX(): return (int(x) for x in sys.stdin.readline().split())\r\ndef II(): return (int(inp()))\r\ndef LI(): return list(map(int, inp().split()))\r\ndef LS(): return list(map(str, inp().split()))\r\ndef L(x):return list(x)\r\ndef out(var): return sys.stdout.write(str(var))\r\n\r\nword=L(inp())\r\n\r\nu,l=0,0\r\n\r\nfor x in word:\r\n if x.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\n\r\nif u>l:\r\n out(''.join(word).upper())\r\nelse:\r\n out(''.join(word).lower())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nup=0 \r\nlow=0\r\nfor i in range(len(s)):\r\n if 65<=ord(s[i])<=90:\r\n up+=1\r\n if 97<=ord(s[i])<=122:\r\n low+=1 \r\nif low>=up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "def main():\n word: str = input()\n up: int = 0\n for letter in word:\n if letter.isupper():\n up += 1\n if (len(word) - up) < up:\n print(word.upper())\n else:\n print(word.lower())\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\r\nlet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nup = 0\r\nlow = 0\r\nfor i in s:\r\n\tif i in let:\r\n\t\tup += 1\r\n\telse:\r\n\t\tlow += 1\r\nif up <= low:\r\n\tprint(s.lower())\r\nelif up > low:\r\n\tprint(s.upper()) \r\n", "s=input()\r\nu=sum(map(str.isupper, s))\r\nl=len(s)-u\r\nif(u>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "import string\r\na=input()\r\nsum1=sum2=0\r\nfor i in a:\r\n if i in string.ascii_lowercase:\r\n sum1=sum1+1\r\n else:\r\n sum2=sum2+1\r\nif sum1>=sum2:\r\n a=a.lower()\r\nelse:\r\n a=a.upper()\r\nprint(a)", "import re\r\n\r\ns = input()\r\nif len(re.findall('[A-Z]', s)) > len(s) // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nl=len(s)\r\ncounter=0\r\nfor i in s:\r\n if i>='A' and i<='Z':\r\n counter=counter+1\r\nif counter >(l/2):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "# cook your dish here\r\nStr = input()\r\nu = 0\r\nl = 0\r\nfor i in Str:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(Str.upper())\r\nelse:\r\n print(Str.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 1 23:05:47 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nupp = 0; lowe = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper() :\r\n upp+=1\r\n else:\r\n lowe+=1\r\nif upp > lowe:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "'''\r\nCreated on ٠٩‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\ns = input()\r\nl = u = 0\r\nfor c in s:\r\n if c == c.upper():\r\n u += 1\r\n else:\r\n l += 1\r\nprint(s.upper() if u > l else s.lower()) \r\n \r\n", "a=input()\r\ncount=0\r\nmaxi=0\r\nb='abcdefghijklmnopqrstuvwxyz'\r\nc='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nfor i in a:\r\n if i in b:\r\n count+=1\r\n else:\r\n maxi+=1\r\nif count>maxi:\r\n print(a.lower())\r\nelif count<maxi:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n", "# Leer la palabra\npalabra = input()\n\n# Contar las letras mayúsculas y minúsculas\nmayusculas = sum(1 for letra in palabra if letra.isupper())\nminusculas = len(palabra) - mayusculas\n\n# Determinar si la palabra debe estar en mayúsculas o minúsculas\nif mayusculas > minusculas:\n palabra_corregida = palabra.upper()\nelse:\n palabra_corregida = palabra.lower()\n\n# Imprimir la palabra corregida\nprint(palabra_corregida)\n\n\n \t \t\t\t \t\t \t\t \t\t\t \t\t \t", "word = input()\r\ncap=0\r\nlower=0\r\nc=\"Q,W,E,R,T,Y,U,I,O,P,A,S,D,F,G,H,J,K,L,M,N,B,V,C,X,Z\"\r\nm=\"q,w,e,r,t,y,u,i,o,p,l,k,j,h,g,f,d,s,a,z,x,c,v,b,n,m\"\r\nfor l in word :\r\n if l in c :\r\n cap+=1\r\n \r\n elif l in m :\r\n lower+=1\r\n \r\nif lower>=cap :\r\n print(word.lower())\r\nelif lower<cap :\r\n print(word.upper())", "if __name__ == \"__main__\" :\r\n s = input()\r\n\r\n upper = 0\r\n for char in s :\r\n if (char.isupper()):\r\n upper += 1\r\n \r\n if(upper > (len(s)-upper)):\r\n print(s.upper())\r\n else:\r\n print(s.lower())", "s = str(input())\r\nup = 0\r\nlow = 0\r\nfullup = ''\r\nfulllow = ''\r\nfor i in s:\r\n if i.isupper():\r\n up += 1\r\n else:\r\n low += 1\r\n fullup += i.upper()\r\n fulllow += i.lower()\r\nif up > low :\r\n print(fullup)\r\nelse:\r\n print(fulllow)\r\n \r\n", "word = input()\r\nup=0\r\nlow=0\r\nfor i in range(len(word)):\r\n if word[i].islower():\r\n low = low + 1\r\n if word[i].isupper():\r\n up = up + 1\r\nif(low >= up):\r\n print(word.lower())\r\nelse :\r\n print(word.upper())\r\n", "n=input()\r\nn=[str(r)for r in n]\r\nc=0\r\nl=0\r\nfor x in range (len(n)):\r\n if n[x]==n[x].capitalize():\r\n c+=1\r\n else:\r\n l+=1\r\n\r\nif c<l:\r\n for x in range(len(n)):\r\n if n[x]==n[x].capitalize():\r\n n[x]=n[x].lower()\r\n print(\"\".join(n))\r\nelif l<c:\r\n for y in range(len(n)):\r\n if n[y]==n[y].lower():\r\n n[y]=n[y].capitalize()\r\n print(\"\".join(n))\r\nelif l==c:\r\n for x in range(len(n)):\r\n n[x]=n[x].lower()\r\n print(\"\".join(n))\r\n ", "word = input();\r\n\r\ncountLower, countUpper = 0, 0\r\nfor i in word:\r\n if i.isupper():\r\n countUpper += 1\r\n\r\n else:\r\n countLower += 1\r\n\r\nif countUpper > countLower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\nlower = 0\r\nupper = 0\r\nfor i in word:\r\n if i.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper>lower:\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word)", "s = input()\r\nnumuppercase = 0\r\nnumlowercase = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n numuppercase += 1\r\nnumlowercase = len(s) - numuppercase\r\n\r\nif numuppercase>numlowercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "s = list(input())\r\ncountUp = 0\r\ncountBot = 0\r\nfor i in s:\r\n if i.isupper() ==1:\r\n countUp +=1\r\n elif i.islower() ==1:\r\n countBot +=1\r\nif countUp > countBot:\r\n print(''.join(s).upper())\r\nelif countUp < countBot:\r\n print(''.join(s).lower())\r\nelse:\r\n print(''.join(s).lower())", "s=str(input())\r\nb=0;s1=0;i=0\r\np=len(s)\r\nwhile i<p:\r\n if ord(s[i])<=96:\r\n b+=1\r\n else:\r\n s1+=1\r\n i+=1\r\nif b>s1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nchoto = int(0)\r\nboro = int(0)\r\nfor i in range(0,len(a)):\r\n if(a[i] >= 'A' and a[i] <= 'Z'):\r\n boro+=1\r\n elif(a[i] >= 'a' and a[i] <= 'z'):\r\n choto+=1\r\nif(boro>choto):\r\n a = a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a)", "word = str(input())\r\n\r\nupercase = 0 \r\nlowercase = float(len(word)/2)\r\n\r\nfor i in word:\r\n if i.isupper():\r\n upercase +=1\r\n\r\nif upercase>lowercase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "ch=input()\r\nl=0\r\ns=0\r\nfor i in range(len(ch)):\r\n if ch[i].islower():\r\n l+=1\r\n else:\r\n s+=1\r\nif (s>l):\r\n ch1=ch.upper()\r\nelse:\r\n ch1=ch.lower()\r\nprint(ch1)", "s=input()\r\nup=0\r\ndown=0\r\nfor each in s:\r\n if each.isupper():\r\n up+=1\r\n else:\r\n down+=1\r\nif up>down:\r\n print(s.upper())\r\nelif up==down:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "upper = 0\r\nlower = 0\r\nstring = str(input())\r\nfor i in string:\r\n if i.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif lower >= upper:\r\n result = string.lower()\r\nelse:\r\n result = string.upper()\r\n\r\nprint(result)", "a=input()\r\ns=b=0\r\nfor i in a:\r\n if i.isupper():s+=1\r\n else:b+=1\r\nif s<=b:print(a.lower())\r\nelse:print(a.upper())\r\n\r\n ", "a=input()\r\nb=len(a)\r\nc=[]\r\nd=0\r\ne=0\r\nfor i in range (0,b):\r\n c.append(ord(a[i]))\r\nfor i in c:\r\n if i>96:\r\n d=d+1\r\n else:\r\n e=e+1\r\nif d<e:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "e=input()\r\nans=[e.lower(),e.upper()][sum(i<'['for i in e)*2>len(e)]\r\nprint(ans)\r\n\r\n ", "n = list(input())\r\nm=\"\".join(n)\r\n\r\n\r\n\r\n\r\ndef Count(m):\r\n upper, lower = 0, 0\r\n\r\n for i in range(len(m)):\r\n if m[i].isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\n if 's' in n or 'S' in n:\r\n \r\n if upper > lower:\r\n print(m.upper())\r\n elif lower > upper:\r\n print(m.lower())\r\n else:\r\n print(m.lower())\r\n else:\r\n if upper > lower:\r\n print(m.upper())\r\n elif upper == lower:\r\n print(m.lower())\r\n else:\r\n print(m.lower())\r\n \r\n\r\n\r\nCount(m)", "def main():\r\n s = input()\r\n lower = 0\r\n upper = 0\r\n\r\n for i in range(len(s)):\r\n if ord(s[i]) >= ord('A') and ord(s[i]) <= ord('Z'):\r\n upper += 1\r\n else:\r\n lower += 1\r\n if upper > lower:\r\n print(s.upper())\r\n else:\r\n print(s.lower())\r\nmain()", "n = input()\ncount1 = 0\ncount2 = 0\nfor e in n:\n if ord(e) <= 90:\n count1 +=1\n else:\n count2 +=1\nif count1 > count2:\n print(n.upper())\nelse:\n print(n.lower())\n\t\t\t\t \t \t\t \t\t\t\t\t \t \t\t\t\t \t", "s=input()\r\nu,l=0,0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif l>u:\r\n s=s.lower()\r\nelif l<u:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "a=input()\r\nminn=0\r\nmaxx=0\r\n\r\nfor i in a:\r\n if ord(i)>=65 and ord(i)<=90:\r\n maxx=maxx+1\r\n if ord(i)>=97 and ord(i)<=122:\r\n minn=minn+1\r\nif maxx>minn:\r\n print(a.upper())\r\nif maxx<minn:\r\n print(a.lower())\r\nif maxx==minn:\r\n print(a.lower())\r\n", "word=input()\r\nch=\"\"\r\ncountl=0\r\ncountu=0\r\nfor i in range(len(word)):\r\n ch=word[i]\r\n if(ch.islower()):\r\n countl+=1\r\n elif(ch.isupper()):\r\n countu+=1\r\nif(countl>countu):\r\n print(word.lower())\r\nelif(countl==countu):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n ", "s = input()\r\nctr1 = 0\r\nctr2 = 0\r\n\r\nfor i in range(len(s)):\r\n if(s[i].islower()):\r\n ctr1 = ctr1+1\r\n else:\r\n ctr2 = ctr2+1\r\n \r\nif(ctr1>=ctr2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\ndic={\"lower\":0,\"upper\":0}\r\nfor i in s:\r\n if(i.islower()):\r\n dic[\"lower\"]+=1\r\n else:\r\n dic[\"upper\"]+=1\r\nif(dic[\"lower\"]>dic[\"upper\"]):\r\n print(s.lower())\r\nelif(dic[\"lower\"]<dic[\"upper\"]):\r\n print(s.upper())\r\nelif(dic[\"lower\"]==dic[\"upper\"]):\r\n print(s.lower())", "s=input('')\r\np=list(s)\r\nu,l=[],[]\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u.append(s[i])\r\n else:\r\n l.append(s[i])\r\nif len(u)>len(l):\r\n for j in s:\r\n print(j.upper(),end='')\r\nelse:\r\n for j in s:\r\n print(j.lower(),end='')\r\n ", "a = input()\r\nu = 0\r\nl = 0\r\nfor i in a:\r\n if i.isupper() == True:\r\n u = u + 1\r\n continue\r\n else:\r\n l = l + 1\r\n continue\r\nif u > l:\r\n a = a.upper()\r\nelse:\r\n a = a.lower()\r\nprint(a)\r\n", "n=input()\r\ns=[]\r\nuc=0\r\nlc=0\r\nfor i in n:\r\n if i.isupper():\r\n uc+=1\r\n else:\r\n lc+=1\r\nif uc>lc:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "#Codeforces\n# A 59 Word\n\nword = input()\n\nuppers = 0\nlowers = 0\n\nfor letter in word:\n if letter == letter.lower():\n lowers += 1\n else:\n uppers +=1\n\nif uppers > lowers:\n print(word.upper())\nelse:\n print(word.lower())\n", "s=input()\r\nu=0;l=0\r\nfor i in s:\r\n\tif(ord(i)>=65 and ord(i)<=90):\r\n\t\tu +=1\r\n\telif(ord(i)>=97 and ord(i)<=122):\r\n\t\tl +=1\r\nif(u>l):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "l_alpha = 'abcdefghijklmnopqrstuvwxyz'\r\nu_alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nword = input()\r\nl_n = 0\r\nu_n = 0\r\nfor i in range(len(word)):\r\n if word[i] in l_alpha:\r\n l_n += 1\r\n elif word[i] in u_alpha:\r\n u_n += 1\r\nif l_n < u_n:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\nc1, c2 = 0, 0\nfor c in s:\n if c.islower():\n c1 += 1\n if c.isupper():\n c2 += 1\nif c2 > c1:\n print(s.upper())\nelse:\n print(s.lower())\n", "def word(string):\r\n l_count=0\r\n u_count=0\r\n for i in string:\r\n if i.islower():\r\n l_count+=1\r\n if i.isupper():\r\n u_count+=1\r\n\r\n if l_count>u_count or l_count==u_count:\r\n return string.lower()\r\n elif l_count<u_count:\r\n return string.upper()\r\n\r\n\r\nstring=input()\r\nprint(word(string))", "s = input()\r\nc = 0\r\nL = len(s)\r\nl = 0\r\nfor i in s:\r\n if i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\r\n c += 1\r\n else:\r\n l += 1\r\nif c > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\n\r\ncount_lower = 0\r\ncount_upper = 0\r\nfor l in word:\r\n if l.islower():\r\n count_lower += 1\r\n else:\r\n count_upper += 1\r\n \r\nprint(word.lower()) if count_lower >= count_upper else print(word.upper())", "n=input()\r\nupper,lower=0,0\r\nfor c in n:\r\n if c.isupper():\r\n upper+=1\r\n elif c.islower():\r\n lower+=1\r\nif upper>lower:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "\r\n\r\ns = input()\r\nprint( s.upper() if( sum (c.isupper() for c in s)*2 > len(s) ) else s.lower() )\r\n", "word = input()\r\n\r\nn_upper = sum([1 for letter in word if letter.isupper()])\r\nn_lower = sum([1 for letter in word if letter.islower()])\r\n\r\nif n_lower >= n_upper:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "A=0\r\na=0\r\nstring = input()\r\nfor i in string:\r\n if(i.isupper()):\r\n A+=1\r\n else:\r\n a+=1\r\nif(A<=a):\r\n print(string.lower())\r\nelse:\r\n print(string.upper())", "s=input()\r\ncu=cl=0\r\nfor i in s:\r\n if i.isupper():\r\n cu+=1\r\n else:\r\n cl+=1\r\nif cu>cl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nupper = 0\r\nlower = 0\r\nfor i in s:\r\n if i.isupper():upper+=1\r\n else:lower+=1\r\nif upper<lower:s=s.lower()\r\nelif lower<upper:s=s.upper()\r\nelse : s=s.lower()\r\nprint(s)", "s=input()\r\nc1=0\r\nc2=0\r\nfor x in s:\r\n if(ord(x) in range(97,123)):\r\n c1=c1+1\r\n elif(ord(x) in range(65,91)):\r\n c2=c2+1\r\nif(c1>=c2):\r\n s=s.lower()\r\n print(s)\r\nelse:\r\n s=s.upper()\r\n print(s)\r\n", "line = input();\r\nbig = int(sum(map(str.isupper, line)))\r\nsmall = int(sum(map(str.islower, line)))\r\nif big>small :\r\n print(line.upper())\r\nelse:\r\n print(line.lower())", "n='@'.join(input()).split('@')\r\n\r\ncount=0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n count+=1\r\nprint(''.join(list(map(lambda x:chr(ord(x)+32) if count<=len(n)/2 and x.isupper() else chr(ord(x)-32) if count>len(n)/2 and x.islower() else x,n))))\r\n", "word = str(input())\r\ncount_U = 0\r\ncount_L = 0\r\nfor i in word:\r\n if i in word.upper():\r\n count_U+=1 \r\n else:\r\n count_L+=1 \r\nif count_U>count_L:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = input()\r\nc = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n c += 1\r\n\r\nif c > len(s) - c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\nl=0\nu=0\nfor i in range(0,len(s)):\n\tif(s[i].islower()):\n\t\tl+=1\n\telif(s[i].isupper()):\n\t\tu+=1\nif(u>l):\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n \t \t \t \t\t\t\t \t \t\t \t\t\t \t \t", "s = input()\r\ncount_upper = 0\r\ncount_lower = 0\r\nfor i in s:\r\n if(i.islower()):\r\n count_lower+=1\r\n elif(i.isupper()):\r\n count_upper+=1\r\nif count_upper>count_lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s=input()\r\nc1=0\r\nc2=0\r\ns1=\"\"\r\nfor i in s:\r\n if i.islower()==True:\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\nfor i in s: \r\n if c1>=c2:\r\n #for i in s:\r\n if i.isupper()==True:\r\n s1=s1+i.lower()\r\n else:\r\n s1=s1+i\r\n else:\r\n #for i in s:\r\n if i.islower()==True:\r\n s1=s1+i.upper()\r\n else:\r\n s1=s1+i\r\nprint(s1)", "n = input()\nl = len(n)\nN = n.upper()\ncount = 0\nfor m,M in zip(n,N):\n if m is M:\n count+=1\nif count>(l//2):\n print(N)\nelse:\n print(n.lower())\n", "s=str(input())\r\ns1=0\r\ns2=0\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n s1+=1\r\n else:\r\n s2+=1\r\nif s1>s2:\r\n print(s.lower())\r\nelif s1<s2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\nupper_more = 0\r\nlower_more = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n upper_more += 1\r\n else:\r\n lower_more += 1\r\n \r\nif upper_more > lower_more:\r\n print(s.upper())\r\n \r\nelse:\r\n print(s.lower())\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Nov 28 22:15:38 2020\r\n\r\n@author: kalya\r\n\"\"\"\r\n\r\na = input()\r\ns = sum(ch.islower() for ch in a)\r\nprint(a.lower() if s >= (len(a) -s ) else a.upper())", "word = input()\r\nuppercase_count = sum(1 for c in word if c.isupper())\r\nlowercase_count = len(word) - uppercase_count\r\nif uppercase_count > lowercase_count:\r\n corrected_word = word.upper()\r\nelse:\r\n corrected_word = word.lower()\r\nprint(corrected_word) \r\n\r\n\r\n\r\n\r\n\r\n", "n=input()\r\nc=0\r\nfor i in range(len(n)):\r\n if 65<=ord(n[i])<=90:\r\n c=c+1\r\nif c>len(n)-c:\r\n print(n.upper())\r\nelse:print(n.lower())", "s=input()\r\na=b=0\r\nfor i in s:\r\n if i in \"qwertyuiopasdfghjklzxcvbnm\":\r\n a+=1\r\n else:\r\n b+=1\r\nif a>=b:\r\n s=s.lower()\r\nelse:\r\n s=s.upper()\r\nprint(s)", "w=input()\r\nn=0\r\no=0\r\nfor f in range(len(w)):\r\n if w[f]>='A' and w[f]<='Z':\r\n n=n+1\r\n else:\r\n o=o+1\r\nif n>o:\r\n print(w.upper())\r\nelse:\r\n print(w.lower())", "s = input()\r\nl, u=0, 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].lower():\r\n l+=1\r\n else:\r\n u+=1\r\nif l > u:\r\n print(s.lower())\r\nelif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n \r\n ", "s = input()\r\n\r\ncap = 0\r\n\r\nfor x in range(len(s)):\r\n if s[x] >= \"A\" and s[x] <= \"Z\":\r\n cap += 1\r\n\r\nsim = len(s) - cap\r\n\r\nif cap > sim:\r\n s = s.upper()\r\n\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)", "s = input()\n\nn_uppercase = sum(1 for c in s if c.isupper())\nn_lowercase = sum(1 for c in s if c.islower())\n\nif n_uppercase > n_lowercase:\n \n s = s.upper()\nelse: \n s = s.lower()\n\nprint(s)\n\nquit()\n \t\t \t \t\t\t \t\t\t \t\t\t\t \t", "s = input()\r\nx=0\r\ny=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n x+=1\r\n else:\r\n y+=1\r\nif(y>=x):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "def main():\n w = input()\n\n w_l = w.lower()\n\n lower = sum([1 if i in w_l else 0 for i in w ]) >= len(w) / 2\n\n if lower:\n print(w.lower())\n else:\n print(w.upper())\n\nif __name__ == \"__main__\":\n main()\n", "list_=input()\r\nlower=0\r\nupper=0\r\nfor i in list_:\r\n if i.islower():\r\n lower+=1\r\n if i.isupper():\r\n upper+=1\r\n\r\nif lower>=upper:\r\n print(list_.lower())\r\nelse:\r\n print(list_.upper())", "import sys\r\ninput = sys.stdin.readline\r\nget_int = lambda: int(input().rstrip())\r\nget_arr = lambda: [int(w) for w in input().split()]\r\nget_str = lambda: input().rstrip()\r\n\r\ns = get_str()\r\nup, low = 0, 0\r\nfor i in s:\r\n if(i.isupper()):\r\n up += 1\r\n elif(i.lower()):\r\n low += 1\r\nif up > low :\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "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 Word():\r\n s1 = insr()\r\n\r\n uppaercase_count = 0\r\n lowercase_count = 0\r\n\r\n for char in s1:\r\n if char.isupper():\r\n uppaercase_count += 1\r\n else:\r\n lowercase_count += 1 \r\n \r\n string = ''.join(x for x in s1)\r\n if uppaercase_count > lowercase_count:\r\n print(string.upper())\r\n else:\r\n print(string.lower())\r\n \r\n return \r\n\r\nWord()", "word = input()\r\ncapital = small = 0\r\nfor i in word:\r\n if ord(i)<96:\r\n capital+=1\r\n else:\r\n small+=1\r\nif capital == small:\r\n word = word.lower()\r\nelif capital>small:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\n\r\nprint(word)", "# Word\r\nstr=input(\" \")\r\nu=0\r\nl=0\r\nfor i in str:\r\n if (i.islower()):\r\n l=l+1\r\n elif (i.isupper()):\r\n u=u+1\r\nif u>l:\r\n\tprint(str.upper())\r\nelif u<l:\r\n\tprint(str.lower())\r\nelse:\r\n\tprint(str.lower())", "if __name__ == '__main__':\r\n x = input()\r\n c1 = 0\r\n c2 = 0\r\n for i in x:\r\n if i.isupper():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\n if (c1 > c2):\r\n x = x.upper()\r\n else:\r\n x = x.lower()\r\n print(x)", "string = input()\r\n\r\nupper = 0\r\nlower = 0\r\nfor k in string:\r\n if k.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif upper > lower:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n \r\n", "def correct(s):\r\n total_lower = 0\r\n total_upper = 0\r\n for i in s:\r\n if i == i.lower():\r\n total_lower += 1\r\n else :\r\n total_upper += 1\r\n if total_lower >= total_upper:\r\n s = s.lower()\r\n else:\r\n s = s.upper()\r\n return s\r\ns = input()\r\nprint(correct(s))\r\n\r\n", "s = input()\r\nupper=0\r\nlower=0\r\nn = len(s)\r\nfor i in s:\r\n if i.isupper():\r\n upper=upper+1\r\n if i.islower():\r\n lower = lower+1\r\nif upper>lower:\r\n print(s.upper())\r\nelif upper<lower:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "import sys \r\n\r\ns= list(sys.stdin.readline())[:-1]\r\n\r\nupper = 0\r\nlower = 0\r\nfor i in s:\r\n\tif str(i).isupper():\r\n\t\tupper +=1\r\n\telse:\r\n\t\tlower +=1\r\n\r\nif upper == lower:\r\n\tprint(\"\".join(s).lower())\r\nelif lower < upper:\r\n\ti = 0\r\n\twhile i <len(s):\r\n\t\tif not str(s[i]).isupper():\r\n\t\t\ts[i] = str(s[i]).upper()\r\n\t\ti +=1\r\n\tprint(\"\".join(s))\r\nelif lower > upper:\r\n\ti = 0\r\n\twhile i < len(s):\r\n\t\tif str(s[i]).isupper():\r\n\t\t\ts[i] = str(s[i]).lower()\r\n\t\ti += 1\r\n\tprint(\"\".join(s))\r\n", "s=input()\nupper=0\nlower=0\nfor i in range(len(s)):\n if s[i].isupper():\n upper+=1\n else:\n lower+=1\nif upper>lower:\n print(s.upper())\nelse:\n print(s.lower()) \n", "t=input()\r\nn=len(t)\r\nu,l=0,0\r\nfor i in range(len(t)):\r\n if 97<=ord(t[i])<=122:\r\n l+=1\r\n elif 65<=ord(t[i])<=90:\r\n u+=1\r\nif u<=l:\r\n print(t.lower())\r\nelif u>l:\r\n print(t.upper())\r\n \r\n", "s = input()\r\na, b = 0, 0\r\nfor ch in s:\r\n a += ch.isupper()\r\n b += ch.islower()\r\n\r\nans = s.lower() if b >= a else s.upper()\r\nprint(ans)\r\n", "n=input()\r\ncount=0\r\nfor i in range(len(n)):\r\n if n[i].islower():\r\n count=count+1\r\ny=len(n)-count\r\nif y>count:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "n=input()\r\nu=l=''\r\nuppercase=lowercase=0\r\nfor i in range(len(n)):\r\n r=w=n[i]\r\n if 65<=ord(n[i])<=90:\r\n uppercase=uppercase+1\r\n r=chr(ord(n[i])+32)\r\n else:\r\n lowercase=lowercase+1\r\n w=chr(ord(n[i])-32)\r\n l=l+r\r\n u=u+w\r\nif lowercase>=uppercase:\r\n print(l)\r\nelse:\r\n print(u)\r\n \r\n", "s=input()\nu=0\nl=0\nfor i in s:\n if(ord(i)>=65 and ord(i)<=90):\n u=u+1\n else:\n l=l+1\nif(l>=u):\n print(s.lower())\nelse:\n print(s.upper())\n\t \t \t\t \t\t\t\t\t\t\t \t\t\t\t \t \t", "s=str(input())\r\nc=d=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n c+=1\r\n else:\r\n d+=1\r\n\r\nif c<d:\r\n l=s.upper()\r\nelse:\r\n l=s.lower()\r\nprint(l)\r\n", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i.isupper():\r\n count += 1\r\nif count > (len(s) - count):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "from itertools import accumulate as ac\nfrom collections import Counter as cc\nfrom bisect import bisect_left as bsl\nfrom bisect import bisect as bs\nfrom math import factorial as f\nfrom collections import *\nfrom itertools import *\nfrom string import *\nfrom bisect import *\nfrom queue import *\nfrom heapq import *\nfrom math import *\nfrom sys import *\nfrom re import *\ndef fast(): return stdin.readline().strip()\ndef zzz(): return [int(i) for i in fast().split()]\n\n\nz, zz = input, lambda: list(map(int, z().split()))\nszz, graph, mod, szzz = lambda: sorted(\n zz()), {}, 10**9+7, lambda: sorted(zzz())\n\n\ndef lcd(xnum1, xnum2): return (xnum1*xnum2//gcd(xnum1, xnum2))\ndef output(answer): stdout.write(str(answer))\n\n\n###########################---Test-Case---#################################\n\"\"\"\n\n If you Know me , Then you probably don't know me !\n\n\n\"\"\"\n###########################---START-CODING---##############################\n\narr=fast()\nu,l=0,0\nfor i in arr:\n if match('[a-z]',i):\n l+=1\n else:\n u+=1\nif u>l:\n print(arr.upper())\nelse:\n print(arr.lower())\n\n\n\n\t \t \t\t \t \t\t\t\t \t \t \t \t\t", "a=input()\r\nc=0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n c+=1\r\nif c>len(a)//2:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n ", "# your code goes here\r\na=input()\r\ns=a.upper()\r\nx=a.lower()\r\ncount=0\r\nfor i in range(len(a)):\r\n\tif(a[i]==s[i]):\r\n\t\tcount+=1\r\nif(count>len(a)/2):\r\n\tprint(s)\r\nelse:\r\n\tprint(x)", "s= input()\r\ncnt1 = 0\r\ncnt2 = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n cnt1 += 1\r\n else:\r\n cnt2 += 1\r\nif cnt1 >= cnt2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\r\nl=[]\r\nm=[]\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n l.append(s[i])\r\n else:\r\n m.append(s[i])\r\nif(len(l)>len(m)):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "word = input()\r\nassert len(word) <= 100\r\nu_counter, l_counter = 0,0\r\nfor letter in word:\r\n if letter.isupper() == True:\r\n u_counter += 1\r\n else:\r\n l_counter += 1\r\nif u_counter > l_counter:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n=input()\r\na=list(n)\r\ns=['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\nc=0\r\nd=0\r\nfor i in a:\r\n if i in s:\r\n c=c+1\r\n else:\r\n d=d+1\r\nif(c>d):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "s=input()\r\n\r\ncount=0\r\nflag=0\r\n\r\nfor i in s:\r\n if i.isalpha():\r\n if i.isupper():\r\n count+=1\r\n elif i.islower():\r\n flag+=1\r\n else:\r\n print(\"error\")\r\n \r\nif count>flag:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\na=list(n)\r\ncount_upper=0\r\ncount_lower=0\r\nfor i in range(0,len(a)):\r\n if a[i].isupper():\r\n count_upper+=1\r\n elif a[i].islower():\r\n count_lower+=1\r\n\r\nif count_upper>count_lower:\r\n n_upper=n.upper()\r\n print(n_upper)\r\nelif count_upper>count_lower:\r\n n_lower=n.lower()\r\n print(n_lower)\r\nelse:\r\n n_upper=n.lower()\r\n print(n_upper)\r\n\r\n\r\n", "n=input()\r\nc=0\r\nfor i in range(0,len(n)):\r\n s=n[i].upper()\r\n if(s==n[i]):\r\n c=c+1\r\nif(len(n)-c<c):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n \r\n \r\n", "i=input()\r\nz=len(i)\r\nk=0\r\nl=0\r\nfor j in range(z):\r\n if i[j].islower() :\r\n k+=1\r\n else:\r\n l+=1\r\nif k>=l:\r\n print(i.lower())\r\nelse:\r\n print(i.upper())", "def count_case(word):\r\n uc, lc = 0, 0\r\n for c in word:\r\n if c.isupper():\r\n uc += 1\r\n elif c.islower():\r\n lc += 1\r\n \r\n return uc, lc\r\n\r\ndef solve():\r\n word = input()\r\n \r\n uc, lc = count_case(word)\r\n \r\n if uc > lc:\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\n \r\n \r\nsolve()", "s = input()\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n a = s[i]\r\n if a <= 'Z' and s[i] >= 'A':\r\n u+=1\r\n elif s[i]<= 'z' and s[i] >= 'a':\r\n l+=1\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\nuppercase = [x for x in range(65,96)]\r\nlowercase = [x for x in range(97,126)]\r\nup = 0\r\nlo = 0\r\nfor ele in s:\r\n if ord(ele) in uppercase:\r\n up+=1\r\n else:\r\n lo+=1\r\nif up>lo:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "name = input()\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor i in range(len(name)):\r\n if name[i].isupper():\r\n count_upper += 1\r\n else:\r\n count_lower += 1\r\nif count_upper > count_lower:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())", "word = input()\r\nlower = 0\r\nupper = 0\r\nfor i in range(len(word)):\r\n if word[i].islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\nif lower >= upper :\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "(lambda a : print(\"\".join(a).upper()) if sum([True for i in a if i.isupper()]) > sum([True for i in a if i.islower()]) else print(\"\".join(a).lower()))([x for x in input()])", "#!/usr/bin/env python3\n\n# Headers\nimport os\n\n# Input\nGet_In = str(input())\n\n# Finding the lower characters as well as upper characters\nCount_Upper = [char for char in Get_In if char.isupper()]\nCount_Small = [char for char in Get_In if char.islower()]\n\nif len(Count_Upper) > len(Count_Small):\n\tprint(Get_In.upper())\nelif len(Count_Small) > len(Count_Upper):\n\tprint(Get_In.lower())\nelse:\n\tprint(Get_In.lower())\n", "x=input(\"\")\r\ncount=0\r\ny=list(map(ord,x))\r\nfor i in y:\r\n if i>=97 and i<=122:\r\n count+=1\r\nif count>=len(x)/2:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "x = input()\r\ncaps =0\r\nfor i in x:\r\n if i.isupper():\r\n caps = caps+1\r\nlow = len(x) - caps\r\nif low > caps or low == caps :\r\n x = x.lower()\r\nelif low < caps:\r\n x = x.upper()\r\nprint(x)\r\n \r\n ", "s = input()\r\nprint(s.lower() if sum([1 if ch.islower() else -1 for ch in s]) >= 0 else s.upper())", "word = input()\r\ns = 0\r\nb = 0\r\nfor i in word:\r\n if i == i.upper():\r\n b+=1\r\n else:\r\n s+=1\r\nif s>b or s==b:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "n= input()\r\ncnt=0\r\nfor c in n:\r\n if(c.isupper()):\r\n cnt+=1\r\nif cnt>len(n)//2:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "word=input()\nlower=0\nupper=0\nfor i in range(len(word)):\n char=word[i].upper()\n if char == word[i]:\n upper+=1\n else:\n lower+=1\n\nif lower>=upper:\n print(word.lower())\nelse:\n print(word.upper())\n\n\t \t\t\t\t \t \t\t\t \t \t\t\t \t\t \t \t", "s = input()\r\nl=0\r\nu=0\r\nns=\"\"\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n ns= s.upper()\r\n\r\nelse:\r\n ns+= s.lower()\r\nprint(ns)\r\n", "name = input()\r\n\r\nupCount = 0\r\nlowCount = 0\r\n\r\nfor i in range(len(name)):\r\n if name[i].islower():\r\n lowCount += 1\r\n elif name[i].isupper():\r\n upCount += 1\r\n\r\nif lowCount > upCount:\r\n print(name.lower())\r\nelif upCount > lowCount:\r\n print(name.upper())\r\nelse:\r\n print(name.lower())", "s = input()\r\nu = 0\r\nl = 0\r\nfor i in range(0, len(s)):\r\n if ord(s[i]) > 96:\r\n l += 1\r\n continue\r\n u +=1\r\n\r\nif u > l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "w = input()\r\nq = w.lower()\r\nx = len([0 for i in range(len(w)) if w[i] == q[i]])\r\nprint (q if x > (len(w)-1)//2 else w.upper())", "word = input()\r\nw = list(word)\r\ncount1 = count2 = 0\r\nfor i in w:\r\n if i.isupper():\r\n count1 += 1\r\n else:\r\n count2 += 1\r\nif count1 >count2:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s=input()\r\nl=0\r\nu=0\r\n\r\nfor i in s:\r\n if i.islower():\r\n l += 1\r\n else:\r\n u += 1\r\n \r\n\r\nif(u>l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "text = input()\n\nlowercase = 0\nuppercase = 0\n\nfor ch in text:\n if \"a\" <= ch <= \"z\":\n lowercase += 1\n else:\n uppercase += 1\n\nif lowercase >= uppercase:\n print(text.lower())\nelse:\n print(text.upper())\n", "word = input()\r\n\r\nuppr = 0\r\nlowr = 0\r\n\r\nfor char in word:\r\n\tif char.lower() == char:\r\n\t\tlowr+=1\r\n\telse:\r\n\t\tuppr+=1\r\n\r\nif uppr > lowr:\r\n\tprint(word.upper())\r\nelse:\r\n\tprint(word.lower())\r\n", "s=input()\r\na=list(s)\r\nlen=len(a)\r\nx=0\r\ny=0\r\nfor i in range(len):\r\n if a[i].islower():\r\n x=x+1\r\n else:\r\n y=y+1\r\nif x<y:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "L = input(); m = 0\r\nfor i in range(len(L)):\r\n if L[i].isupper() == 1:\r\n m += 1\r\nif m * 2 > len(L):\r\n print(L.upper())\r\nelse:\r\n print(L.lower())", "string = input()\r\nuppercase = 0\r\nfor i in string:\r\n if i.isupper():\r\n uppercase += 1\r\nlowercase = len(string) - uppercase\r\nif uppercase == lowercase:\r\n print(string.lower())\r\nelif uppercase > lowercase:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s=list(input())\r\nc_cap=0\r\nc_low=0\r\noutput=\"\"\r\nfor i in s:\r\n \r\n \r\n if i >='A' and i<= 'Z':\r\n c_cap+=1\r\n elif i >='a' and i<= 'z':\r\n c_low+=1\r\n output+=i\r\nif c_cap>c_low:\r\n print(output.upper())\r\nelif c_low>=c_cap:\r\n print(output.lower())\r\nelse:\r\n if s[0] >='A' and s[0]<='Z':\r\n print(output.upper())\r\n else:\r\n print(output.lower())", "a = input()\r\nb = {\"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 = {\"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\ncb = 0\r\nsb = 0\r\nfor i in a:\r\n if i in b:\r\n cb += 1\r\n else:\r\n sb += 1\r\nif cb > sb:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nl = 0\r\nc = 0\r\nfor i in s:\r\n if i == i.lower():\r\n l+=1\r\n else:\r\n c+=1\r\nif l>=c:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "k = input()\r\nn = len(k)\r\nup = 0\r\nlow = 0\r\nfor i in range(n) :\r\n if k[i].isupper() :\r\n up += 1\r\n else:\r\n low += 1\r\nif up >low :\r\n print(k.upper())\r\nelif up<low :\r\n print(k.lower())\r\nelif up == low :\r\n print(k.lower())", "n=input()\nl,u=0,0\nfor i in n:\n if i.islower():l+=1\n else:u+=1\nif l>=u: print(n.lower())\nelse: print(n.upper())\n\t \t\t\t\t\t\t\t \t\t\t\t \t \t \t\t \t\t", "ch=input()\r\n\r\n\r\nupper_case = 0\r\nlower_case = 0\r\n\r\nfor item in ch:\r\n\tif item.upper() == item:\r\n\t\tupper_case+=1\r\n\telse:\r\n\t\tlower_case+=1\r\n\r\nif upper_case <= lower_case:\r\n\tprint(ch.lower())\r\nelse:\r\n\tprint(ch.upper())", "original = input()\r\nhaha = list(original)\r\nupper = 0\r\nlower = 0\r\nfor i in haha:\r\n if i.isupper():\r\n upper += 1\r\n else:\r\n lower += 1 \r\n\r\nif upper == lower or lower > upper:\r\n print(original.lower())\r\nelse:\r\n print(original.upper())\r\n \r\n", "s=list(input())\r\nl=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n l+=1\r\nif l >= (len(s)/2):\r\n print((''.join(s)).lower())\r\nelse:\r\n print((''.join(s)).upper())", "while True:\n s = input()\n if 1 <= len(s) <= 100:\n break\n\n\ndef n_lower_chars(string):\n return sum(c.islower() for c in string)\n\ndef n_upper_chars(string):\n return sum(c.isupper() for c in string)\n\n\ndef compare_and_print(string):\n\n return string.lower() if n_lower_chars(string) >= n_upper_chars(string) else string.upper()\n\n\n\nprint(compare_and_print(s))\n", "word = input()\r\nupper = 0\r\nfor i in word:\r\n if i.isupper():\r\n upper += 1\r\nif 2*upper > len(word):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "s = str(input())\r\nl = list(s)\r\nc1 = 0\r\nc2 = 0\r\nfor i in l:\r\n if i.islower():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif(c1 >= c2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n \r\n", "word = input()\r\nuppercase = 0\r\nfor i in range(len(word)):\r\n if (word[i] >= 'A' and word[i] <= 'Z'): uppercase+=1\r\n\r\nif (uppercase <= len(word)//2) :word = word.lower()\r\nelse: word = word.upper()\r\n\r\nprint(word)", "s=input()\r\na,b=[],[]\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n b.append(i)\r\n else:\r\n a.append(i)\r\nif len(a)>len(b):\r\n print(s.lower())\r\nelif len(a)<len(b):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nc = 0\r\nn = len(s)\r\n\r\nfor i in s:\r\n if(i.isupper()):\r\n c = c+1\r\nif c>n/2 :\r\n print (s.upper())\r\nelse:\r\n print (s.lower())", "# n = int(input())\r\n# a = [1]\r\n# for i in range(n):\r\n# print(*a)\r\n# a = [1] + [a[j] + a[j + 1] for j in range(i)] + [1]\r\n\r\n#a = 1\r\n#n = int(input())\r\n#for i in range(2, n):\r\n# if n % i == 0:\r\n# a = 0\r\n# break\r\n#if a == 0:\r\n# print(\"I am way to dumb to get an answer correctly\")\r\n# print(\"NO\")\r\n#else:\r\n# print(\"YES\")\r\n# print(\"I am way to dumb to get an answer correctly\")\r\n\r\n#a = [int (x) for x in input().split()]\r\n#for i in range(len(a) - 1 , -1, -1):\r\n# print(a[i], end = \" \")\r\n\r\n\r\n#a = [int (x) for x in input().split()]\r\n#if len(a) % 2 == 0 :\r\n# for i in range (len(a) // 2 -1, -1, -1):\r\n# print(a[i], end = \" \")\r\n# for j in range (len(a)//2, len(a)):\r\n# print(a[j], end = \" \")\r\n#else:\r\n# for i in range (len(a) // 2, -1, -1):\r\n# print(a[i], end = \" \")\r\n# for j in range (len(a)//2, len(a)):\r\n# print(a[j], end = \" \")\r\n\r\n#b = []\r\n#c = []\r\n#a = [int (x) for x in input().split()]\r\n#for i in range(len(a)):\r\n# if i % 2 == 0:\r\n# b.append (a[i])\r\n# else:\r\n# c.append (a[i])\r\n#c.reverse()\r\n#print(*b, end = \" \")\r\n#print(*c, end = \" \")\r\n\r\n\r\n\r\n\r\n#b = 1\r\n#n = int(input())\r\n#a = [int(x) for x in input().split()]\r\n#for i in range(len(a)):\r\n# if a[i] == n:\r\n# b = 0\r\n# break\r\n#if b == 0:\r\n# print( i + 1 , sep=\"\\n\")\r\n#else:\r\n# print(-1)\r\n\r\n\r\n\r\n\r\n#left = 0\r\n#k = int(input())\r\n#a = [int(x) for x in input().split()]\r\n#right = len(a)\r\n#while right - left > 1:\r\n# middle = (right + left) // 2\r\n# if k < a[middle]:\r\n# right = middle\r\n# else:\r\n# left = middle\r\n#if a[left] == k:\r\n# print(left + 1)\r\n#else:\r\n# print(-1)\r\n\r\n#a = input()\r\n#for i in range(0, len(a)):\r\n# if (i + 1) % 3 != 0:\r\n# print(a[i], end = \" \")\r\n#a = input()\r\n\r\n#for i in range(0, len(a)):\r\n# if (i + 1) % 3 == 0 or (i + 1) % 2 == 0:\r\n# print(a[i], end = \" \")\r\n\r\n\r\n#print([int(elem) for i, elem in enumerate(input().split()) if i % 3 != 0])\r\n\r\n#class Cat:\r\n# def __init__(self, face, paws, whiskers, belly, what_they_like, pawsonality):\r\n# self.face = face\r\n# self.paws = paws\r\n# self.whiskers = whiskers\r\n# self.belly = belly\r\n# self.what_they_like = what_they_like\r\n# self.pawsonality = pawsonality\r\n# def __str__(self):\r\n# return \"face: {}\\npaws: {}\".format( self.face, self.paws, self.whiskers, self.belly, self.what_they_like, self.pawsonality)\r\n#Tyson = Cat(1, 4, 18, 3.5, [\"water\", \"food\", \"ropes\", \"blankets\"], \"playful, stubborn, sleepy\")\r\n#print(Tyson)\r\n\r\n#a = list(input())\r\n#b = list(reversed(a))\r\n#if a == b:\r\n# print(\"YES\")\r\n#else:\r\n# print(\"NO\")\r\n\r\n#meow\r\n\r\n#countmeow = 0\r\n#a = list(input())\r\n#b = list(reversed(a))\r\n#for i in range(len(a)):\r\n# if a[i] != b[i]:\r\n# countmeow = countmeow + 1\r\n#if countmeow == 0 and len(a) % 2 != 0:\r\n# print(\"YES\")\r\n#elif countmeow == 2:\r\n# print(\"YES\")\r\n#else:\r\n# print(\"NO\")\r\n\r\n#input()\r\n#letmeowchange = 0\r\n#num = input()\r\n#a = dict()\r\n#if len(num) > 26:\r\n# print(-1)\r\n#else:\r\n# for letter in num:\r\n# if letter in a:\r\n# a[letter] += 1\r\n# else:\r\n# a[letter] = 1\r\n# for letter in a:\r\n# letmeowchange += a[letter]-1\r\n# print(letmeowchange)\r\n\r\n#print(round(sum([float(i) for i in input().split()]), 1))\r\n\r\n\r\n#a = [int(i) for i in input().split()]\r\n#b = [int(j) for j in input().split()]\r\n#for i in zip(b, a):\r\n# print(*i, end = \" \")\r\n\r\n#print([int(-i) if i%2==0 else int(i) for i in range(1,int(input()) + 1)])\r\n\r\n#cb = input()\r\n#bc = [int(i) for i in input().split()]\r\n#a = {elem1: elem2 for elem1, elem2 in zip(cb, bc)}\r\n#print(a)\r\n\r\n\r\n#b = 0\r\n#for i in range(10, 100):\r\n# if i % 5 != 0 and i % 7 != 0:\r\n# b = b + 1\r\n#print(b)\r\n\r\n#a = int(input())\r\n#b = \" that I hate\"\r\n#c = \" that I love\"\r\n#print(\"I hate\", end = \"\")\r\n#for i in range(a - 1):\r\n# if i % 2 == 0:\r\n# print(c, end = \"\")\r\n# else:\r\n# print(b, end = \"\")\r\n#print(\" it\")\r\n\r\n#a = int(input())\r\n#b = [int(input()) for i in range(a)]\r\n#c = b[0]\r\n#d = 0\r\n#for i in b[1::]:\r\n# if i != c:\r\n# d = d + 1\r\n# c = i\r\n#print(d + 1)\r\n\r\n#input()\r\n#letmeowchange = 0\r\n#num = input()\r\n#a = dict()\r\n#if len(num) > 26:\r\n# print(-1)\r\n#else:\r\n# for letter in num:\r\n# if letter in a:\r\n# a[letter] += 1\r\n# else:\r\n# a[letter] = 1\r\n# for letter in a:\r\n# letmeowchange += a[letter]-1\r\n# print(letmeowchange)\r\n\r\n#from math import ceil\r\n#a = int(input())\r\n#b = [int(i) for i in input().split()]\r\n#c = sum(b)\r\n#\r\n#d = {1:0, 2:0, 3:0, 4:0}\r\n#total = 0\r\n#r2 = 0\r\n#for i in b:\r\n# if i in d:\r\n# d[i] += 1\r\n# else:\r\n# d[i] = 1\r\n#total = total + d[4]\r\n#total = total + d[3]\r\n#total = total + (d[2] // 2)\r\n#r2 = d[2] % 2\r\n#if r2 != 0:\r\n# d[1] = d[1] - 2\r\n# total = total + 1\r\n#if d[1] > d[3]:\r\n# total += ceil((d[1] - d[3]) / 4)\r\n#print(total)\r\n\r\n#n = int(input())\r\n#a = [int(i) for i in input().split()]\r\n#print(*sorted(a))\r\n\r\n#s = list(input())\r\n#t = list(input())\r\n#a = list(reversed(s))\r\n#if t == a:\r\n# print(\"YES\")\r\n#else:\r\n# print(\"NO\")\r\n\r\n#a = input().split()\r\n#b = 0\r\n#c = 0\r\n#d = dict()\r\n#for letter in a:\r\n# if letter in d:\r\n# d[letter] += 1\r\n# else:\r\n# d[letter] = 1\r\n#for value in d.values():\r\n# if value % 2 != 0:\r\n# c = c + 1\r\n#if c > 1:\r\n# print(\"NO\")\r\n#else:\r\n# print(\"YES\")\r\n\r\n\r\n#n = input()\r\n#a = [int(i) for i in n]\r\n#b = 0\r\n#for i in a:\r\n# if i == 4 or i == 7:\r\n# b = b + 1\r\n#if b == 4 or b == 7:\r\n# print(\"YES\")\r\n#else:\r\n# print(\"NO\")\r\n\r\n\r\n#n = input()\r\n#a = [int(i) for i in n]\r\n\r\nb = 0\r\nc = 0\r\na = \"abcdefgthijklmnopqrstuvwxyz\"\r\ns = input()\r\nfor i in s:\r\n if i in a:\r\n b = b + 1\r\n else:\r\n c = c + 1\r\nif b == c or b > c:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s=input()\np=0\nfor i in s:\n if i>='a':\n p+=1\nif 2*p>=len(s):\n print(s.lower())\nelse:\n print(s.upper())", "s=input()\r\nk=0\r\nfor i in s:\r\n if i.isupper(): k+=1 \r\n else: k-=1\r\nprint(s.upper() if k>0 else s.lower())\r\n", "# -*- coding: utf-8 -*-\r\nword=input()\r\ncharacters=list(word)\r\nupper=0\r\nlower=0\r\nfor character in characters:\r\n character_lower=character.lower()\r\n if character==character_lower:\r\n lower+=1\r\n else:\r\n upper+=1\r\nif upper<=lower:\r\n word=word.lower()\r\nif upper>lower:\r\n word=word.upper()\r\nprint(word)", "s=input()\r\ncountUpper=0\r\ncountSmall=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n countUpper+=1\r\n else:\r\n countSmall+=1\r\nif countUpper > countSmall:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "A = input()\r\nL = []\r\nfor a in A:\r\n \r\n if a.isupper():\r\n L.append(a)\r\n \r\nif len(L) <= len(A) / 2:\r\n print(A.lower())\r\nelse:\r\n print(A.upper())", "s = str(input())\r\nbig =sum(map(str.isupper, s))\r\nsmall = sum(map(str.islower, s))\r\nif big > small:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\nprint(s)", "s=input()\nupper=0\nlower=0\nfor i in s:\n\tif i.isupper():\n\t\tupper+=1\n\telse:\n\t\tlower+=1\nif upper>lower:\n\tprint(s.upper())\nelse:\n\tprint(s.lower())\n \t\t \t \t\t \t \t\t\t \t \t\t\t \t\t\t", "s=input()\r\nsl=s.lower()\r\nsu=s.upper()\r\ncountu=0\r\ncountl=0\r\nfor i in range(len(s)):\r\n\tif s[i] == su[i]:\r\n\t\tcountu+=1\r\n\telse:\r\n\t\tcountl+=1\r\nif countu > countl:\r\n\tprint(su)\r\nelse:\r\n\tprint(sl)", "a = input()\r\nl, u = 0, 0\r\nfor i in a:\r\n\tif i == i.lower():\r\n\t\tl+=1\r\n\telse:\r\n\t\tu+=1\r\n\r\nif u > l:\r\n\ta = a.upper()\r\nelse:\r\n\ta = a.lower()\r\nprint(a)", "s=input()\r\nd,x=0,0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n d+=1\r\n else:\r\n x+=1\r\nif d>x:\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "import re\r\n\r\ns = input()\r\nprint(s.lower() if len(re.findall(r'[A-Z]', s)) <= len(s) // 2 else s.upper())\r\n", "word=input()\r\nm = 0\r\nn = 0\r\nfor i in word:\r\n if i.isupper():\r\n n+=1\r\n else:\r\n m+=1\r\nif n>m:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "n=str(input())\r\nupper=0\r\nlower=0\r\nfor i in n:\r\n if i.islower():\r\n lower+=1\r\n else:\r\n upper+=1\r\nif lower>=upper:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s = input()\r\nt = sum(list(map(str.isupper, s)))\r\nif (2*t > len(s)): print(s.upper())\r\nelse: print(s.lower())", "def n_lower(dato):\r\n lower = 0\r\n upper = 0\r\n for i in dato:\r\n if i.lower() == i:\r\n lower += 1\r\n if i.upper() == i:\r\n upper += 1\r\n\r\n if lower >= upper:\r\n print(dato.lower())\r\n else:\r\n print(dato.upper())\r\n \r\ndef main():\r\n entrada = input()\r\n n_lower(entrada)\r\n \r\nmain()", "s=input()\r\ncap=0\r\nlow=0\r\nfor i in s:\r\n x=ord(i)\r\n if 65<=x<=90:\r\n cap+=1\r\n else:\r\n low+=1\r\nif cap==low:\r\n print(s.lower())\r\nelif cap>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 23 18:19:49 2019\r\n\r\n@author: Tuan\r\n\"\"\"\r\n\r\nimport re \r\na = input()\r\nprint(a.lower() if max(len([i for i in a if i.isupper()]), len([i for i in a if i.islower()])) == len([i for i in a if i.islower()]) else a.upper())\r\n\r\n", "n1 = input()\r\ncountupper = 0\r\ncountlower = 0\r\nfor i in n1:\r\n if i.isupper() == True:\r\n countupper +=1\r\n elif i.islower() == True:\r\n countlower += 1\r\n \r\nif countupper>countlower:\r\n n1 = n1.upper()\r\n print(n1)\r\nelif countlower >countupper:\r\n n1 = n1.lower()\r\n print(n1)\r\nelse:\r\n n1 = n1.lower()\r\n print(n1)", "a=input()\nlist1=[]\nlist2=[]\nfor i in a:\n if i==i.upper():\n list1.append(i)\n elif i==i.lower():\n list2.append(i)\n\nif len(list1)>len(list2):\n a=a.upper()\n print(a)\nelif len(list1)==len(list2):\n a=a.lower()\n print(a)\n\nelse :\n a=a.lower()\n print(a)\n \n \n\n \n", "string = input()\r\nupp = 0\r\nlow = 0\r\nfor i in range(len(string)):\r\n if(string[i].isupper()):\r\n upp += 1\r\n else: \r\n low += 1\r\n\r\nif(upp > low):\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "s = input()\r\na = sum(i.isupper() for i in s)\r\nb = sum(i.islower() for i in s)\r\nif a < b:\r\n print(s.lower())\r\nelif a == b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "a = str(input())\r\ns = 0\r\nq = 0\r\nfor i in range(0 , len(a)):\r\n if a[i] == a[i].lower():\r\n s += 1\r\n else:\r\n q += 1\r\nif s >= q:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "a=str(input())\r\nb=len(a)\r\nc=0\r\nd=0\r\nfor i in range (b):\r\n if a[i].isupper():\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\r\nup=sum(1 for c in s if c.isupper())\r\nlow=len(s)-up\r\nif(up>low):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "ch=input()\r\nL=list(ch)\r\nmaj=0\r\nmin=0\r\nfor i in L : \r\n if ord('a')<=ord(i)<=ord('z') : \r\n min+=1\r\n elif ord('A')<=ord(i)<=ord('Z') :\r\n maj+=1\r\nif maj>min:\r\n print(ch.upper())\r\nelse : \r\n print(ch.lower())\r\n \r\n ", "word=input()\r\nup,low=0,0\r\nl=\"abcdefghijklmnopqrstuvwxyz\"\r\nu=l.upper()\r\nfor i in range(len(word)):\r\n if word[i] in u:\r\n up+=1\r\n if word[i] in l:\r\n low+=1\r\nif up>low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "\ns = str(input())\nu = 0\nfor i in s:\n if(i == i.upper()):u += 1\nif(u > len(s)//2):print(s.upper())\nelse:print(s.lower())\n", "s=input()\ncount1=0\ncount2=0\nfor i in s:\n if(ord(i)>=65 and ord(i)<=91):\n count1+=1\n elif(ord(i)>=97 and ord(i)<=122):\n count2+=1\n else:\n pass\nif(count2>=count1):\n r1=s.lower()\n print(r1)\nelse:\n r2=s.upper()\n print(r2)\n \t\t \t \t \t \t \t\t\t \t\t \t \t\t", "\r\nimport sys\r\n\r\nnative_input = input\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n\r\n\r\n\r\n\r\nimport string\r\n\r\ndef solve():\r\n a = input()\r\n\r\n l = u = 0\r\n\r\n for i in a:\r\n if i in string.ascii_lowercase:\r\n l += 1\r\n else:\r\n u += 1\r\n\r\n if l >= u:\r\n print(a.lower())\r\n else:\r\n print(a.upper())\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "s = str(input())\r\nbig, small = 0, 0\r\nfor c in s:\r\n if ord(c)>91:\r\n small += 1\r\n else:\r\n big += 1\r\nif small>=big:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import re\r\ns=[i for i in input()]\r\nu=0\r\nl=0\r\nfor i in s:\r\n u =u + int(bool(len(re.findall('[A-Z]', i))))\r\n l =l + int(bool(len(re.findall('[a-z]', i))))\r\nif u==l:\r\n print(\"\".join(s).lower())\r\nelif u>l:\r\n print(\"\".join(s).upper())\r\nelse:\r\n print(\"\".join(s).lower())\r\n \r\n\r\n", "s=input()\r\nflag=count=0\r\nx='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ny='abcdefghijklmnopqrstuvwxyz'\r\nfor i in s:\r\n if i in x:\r\n flag=flag+1\r\n else:\r\n pass\r\nfor i in s:\r\n if i in y:\r\n count=count+1\r\n else:\r\n pass\r\nif flag>count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nb= list(a)\r\nc=0\r\nd=0\r\nfor i in b:\r\n if i.isupper():\r\n c+=1\r\n else:\r\n d+=1\r\n\r\n\r\nif c>d:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "a=input()\r\nlow=0\r\nup=0\r\nfor i in a:\r\n s=int(ord(i))\r\n if(s>=97 and s<=122):\r\n low+=1\r\n elif(s>=65 and s<=90):\r\n up+=1\r\nif(low>=up):\r\n print(a.lower())\r\nelif(up>low):\r\n print(a.upper())", "a=input()\ncl=0;cu=0\nfor i in a:\n if i>='a' and i<='z':\n cl+=1\n elif i>='A' and i<='Z':\n cu+=1\nif(cu>cl):\n a=a.upper()\nelse:\n a=a.lower()\nprint(a) \n", "s = input()\r\nhasil1,hasil2 = 0,0\r\n\r\nfor i in s:\r\n if ord(i) >= 97 and ord(i) <= 123:\r\n hasil1 += 1\r\n else:\r\n hasil2 += 1\r\ndb = \"\"\r\nif hasil1 >= hasil2:\r\n for i in s:\r\n if ord(i) >= 97 and ord(i) <= 123:\r\n db += i\r\n else:\r\n db += chr(ord(i)+32)\r\nelse:\r\n for i in s:\r\n if ord(i) >= 97 and ord(i) <= 123:\r\n db += chr(ord(i)-32)\r\n else:\r\n db += i\r\n\r\nprint(db)", "if __name__ == '__main__':\r\n a=input()\r\n up=lw=0\r\n for x in range(0,len(a)):\r\n b=a[x]\r\n c=ord(b)\r\n if(c>=65 and c<=90):\r\n up+=1\r\n else:\r\n lw+=1\r\n\r\n\r\n if(lw>=up):\r\n for x in range(0,len(a)):\r\n b=a[x]\r\n c=ord(b)\r\n if(c>=65 and c<=90):\r\n c+=32\r\n print(chr(c),end=\"\")\r\n else:\r\n print(chr(c),end=\"\")\r\n\r\n else:\r\n for x in range(0, len(a)):\r\n b = a[x]\r\n c = ord(b)\r\n if (c >= 97 and c <= 122):\r\n c -= 32\r\n print(chr(c),end=\"\")\r\n else:\r\n print(chr(c),end=\"\")\r\n\r\n", "word = input()\r\n\r\nx = int(len(word))\r\nlist1 = []\r\nu = 0\r\nl = 0\r\n\r\nfor y in word:\r\n if word[x-1] == word[x-1].upper():\r\n u = u+1\r\n else:\r\n l = l+1\r\n x = x-1\r\n\r\nif u > l:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n\r\n\r\n#list1 = [word[x-1]]\r\n#print(list1)", "x=input()\r\ncnt1=0\r\ncnt2=0\r\nfor i in x:\r\n if(i.islower()):\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\nif(cnt1>cnt2):\r\n print(x.lower())\r\nelif cnt1<cnt2:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())\r\n\r\n", "word = input()\nupper, lower = 0, 0\nfor _ in range(len(word)):\n if word[_].isupper():\n upper += 1\n else:\n lower += 1\nif upper==lower:\n print(word.lower())\nelif upper>lower:\n print(word.upper())\nelse:\n print(word.lower())", "s=input()\r\nu='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nl='abcdefghijklmnopqrstuvwxyz'\r\nuc=0\r\nlc=0\r\nfor i in s:\r\n if i in u:\r\n uc=uc+1\r\n if i in l:\r\n lc=lc+1\r\nif uc==lc or lc>uc:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\nup = 0\nlow = 0\nfor i in s:\n if i.isupper() == True:\n up += 1\n else:\n low += 1\nif up > low:\n print(s.upper())\nelse:\n print(s.lower())\n\n\t \t\t\t \t\t\t\t\t \t \t \t\t\t \t \t \t", "words = input()\r\n\r\ncounter = 0\r\nfor word in list(map(ord, words)):\r\n if word >= 97:\r\n counter += 1\r\n\r\nif counter > len(words) / 2:\r\n print(words.lower())\r\nelif counter < len(words)/2:\r\n print(words.upper())\r\nelse:\r\n print(words.lower())", "str=input()\r\nl=[]\r\nu=[]\r\nfor i in str:\r\n if i.isupper():\r\n u.append(i)\r\n else:\r\n l.append(i)\r\nif len(u)>len(l):\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "s = input()\r\nprint([s.lower(), s.upper()][sum(1 for x in s if x.isupper()) > [(len(s)-1)//2, len(s)//2][len(s) % 2 == 0]])\r\n", "s=str(input())\r\n\r\ncount_upper = 0\r\ncount_lower = 0\r\n\r\nfor i in s:\r\n if (i.isupper()):\r\n count_upper+=1\r\n elif (i.islower()):\r\n count_lower+=1\r\n\r\nif (count_lower>count_upper):\r\n x = s.lower()\r\n print(x)\r\nelif (count_lower<count_upper):\r\n x = s.upper()\r\n print(x)\r\nelif(count_lower==count_upper):\r\n x = s.lower()\r\n print(x)\r\n\r\n", "a=input()\r\nVerh=0\r\nniz=0\r\nfor i in a:\r\n if i==i.upper():\r\n Verh=Verh+1\r\n else:\r\n niz=niz+1\r\nif Verh>niz:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s=input()\r\nc=s.upper()\r\ni=0;cnt=0\r\nwhile i<len(s):\r\n if s[i]==c[i]: cnt+=1\r\n i+=1\r\nif cnt>len(s)/2: print(c)\r\nelse: print(s.lower())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "word = input()\r\nu_count = 0\r\nfor letter in word:\r\n if letter.isupper():\r\n u_count += 1\r\nif u_count > len(word)-u_count:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "str = input()\r\n\r\nupp = sum(1 for i in str if i.isupper())\r\nlow = sum(1 for i in str if i.islower())\r\n\r\nif upp > low :\r\n print(str.upper())\r\nelse :\r\n print(str.lower())\r\n\r\n\r\n\r\n\r\n\r\n", "name=input()\r\nup=0\r\nlow=0\r\na=name.upper()\r\nb=name.lower()\r\nfor i in range(0,len(name)):\r\n if name[i]==name[i].upper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(a)\r\nelse:\r\n print(b)\r\n", "n = input()\nbolshye = 0\nmalenkie = 0\na = []\nfor i in range(len(n)):\n a.append(n[i])\nfor i in range(len(n)):\n if n[i] >= 'A' and n[i] <= 'Z':\n bolshye += 1\n else:\n malenkie += 1\nif bolshye > malenkie:\n for i in range(len(a)):\n if a[i] >= 'a' and a[i] <= 'z':\n a[i] = chr(ord(a[i]) + ord('A') - ord('a'))\n for i in a:\n print(i, end = '')\nelse:\n for i in range(len(n)):\n if a[i] >= 'A' and a[i] <= 'Z':\n a[i] = chr(ord(a[i]) + ord('a') - ord('A'))\n for i in a:\n print(i, end = '')\n\n \n\n", "wrd=input()\r\ncount1,count2=0,0\r\nfor i in wrd:\r\n if ord(i)>=65 and ord(i)<=90:\r\n count1+=1\r\n else:\r\n count2+=1\r\nif count1>count2:\r\n print(wrd.upper())\r\nelse:\r\n print(wrd.lower())\r\n", "a=input()\n\nl=0\nu=0\n\nfor i in range(len(a)):\n if(((ord(a[i]))>=97) and ((ord(a[i]))<=122)):\n l+=1\n else:\n u+=1\n\nif(u>l):\n print(a.upper())\nelse:\n print(a.lower())\n", "a=input()\r\nCount=0\r\ncount=0\r\nb=[]\r\nfor i in a:\r\n\tif ord(i)<123 and ord(i)>96:\r\n\t\tCount+=1\r\n\telse:\r\n\t\tcount+=1\r\nif(count>Count):\r\n\tfor i in a:\r\n\t\tif(ord(i)<123 and ord(i)>96):\r\n\t\t\tb.append(chr(ord(i)-32))\r\n\t\telse:\r\n\t\t\tb.append(i)\r\nelse:\r\n\tfor i in a:\r\n\t\tif(ord(i)<91 and ord(i)>64):\r\n\t\t\tb.append(chr(ord(i)+32))\r\n\t\telse:\r\n\t\t\tb.append(i)\r\nout=\"\"\r\nfor i in b:\r\n\tout+=i\r\nprint(out)", "s=input()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if (i.islower()):\r\n l=l+1\r\n elif (i.isupper()):\r\n u=u+1\r\nif u>l:\r\n print(s.upper())\r\nif l>=u:\r\n print(s.lower())", "n=input()\r\ns=0\r\nk=0\r\nfor i in n:\r\n if(ord(i)>=ord('a') and ord(i)<=ord('z')):\r\n s=s+1\r\n else:\r\n k=k+1\r\nif(s>=k):\r\n m=n.lower()\r\n print(m)\r\nelse:\r\n z=n.upper()\r\n print(z)\r\n", "word = input()\r\nletters=[]\r\nfor i in word:\r\n letters.append(i)\r\nup=0\r\nlow=0\r\nfor i in letters:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif up>low:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n\r\n\r\n", "s = input()\r\ncounter_lower = 0\r\ncounter_upper = 0\r\n\r\nfor elem in s:\r\n if elem.islower():\r\n counter_lower += 1\r\n if elem.isupper():\r\n counter_upper += 1\r\n\r\nif counter_lower > counter_upper or counter_lower == counter_upper:\r\n print(s.lower())\r\nelif counter_upper > counter_lower:\r\n print(s.upper())", "word = input()\r\nlower = sum(1 for c in word if c.islower())\r\nupper = sum(1 for c in word if c.isupper())\r\nprint(word.lower()) if lower >= upper else print(word.upper())", "'''\r\nAuthor : Youssef Abbas \r\nDate : 24/9/2021\r\nLink : https://codeforces.com/problemset/problem/59/A\r\nAbout : Word \r\n'''\r\nword = input()\r\nupper = 0\r\nlower = 0\r\n\r\nfor i in word:\r\n if 65 <= ord(i) <=90:\r\n upper+=1\r\n elif 97 <= ord(i) <= 122:\r\n lower+=1 \r\n else :\r\n continue\r\n\r\nif lower >= upper:\r\n print(word.lower())\r\nelse: \r\n print(word.upper())", "s=input()\r\nsl=0\r\nsu=0\r\nfor i in s:\r\n if (i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'):\r\n su+=1\r\n else:\r\n sl+=1\r\nif(su>sl):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "n=input()\r\nc=0\r\nfor i in n:\r\n if(i.islower()):\r\n c=c+1 \r\nd=len(n)-c\r\nif(c>=d):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "a=input()\r\nb=a.upper()\r\nc=a.lower()\r\nd=0\r\nq=0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n d+=1\r\nfor i in range(len(a)):\r\n if a[i]!=c[i]:\r\n q+=1\r\nif d<q:\r\n print(b)\r\nelse:\r\n print(c)", "s=input()\r\nx=list(s)\r\nu=0\r\nl=0\r\nfor i in range(len(x)):\r\n if(x[i].isupper()==True):\r\n u+=1\r\n else:\r\n l+=1\r\nif(u>len(x)//2):\r\n print(s.upper())\r\nelif(u==l):\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "t=input();print([t.lower(),t.upper()][sum(i<'['for i in t)*2>len(t)])\r\n", "n=input()\r\nlower=0\r\nupper=0\r\nfor i in n:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "word = input()\r\nx = list(word)\r\n\r\ncount=0\r\nfor i in x:\r\n if ord(i) < 91:\r\n count = count+1\r\n\r\nlength = len(x)\r\ny = count/length\r\n\r\nif (y > 0.5):\r\n upper = word.upper()\r\n print(upper)\r\nelse:\r\n lower = word.lower()\r\n print(lower)", "l = input()\r\ns = sum((2 * bool(ord(k) < 91) - 1) for k in l)\r\nprint([l.upper(), l.lower()][s <= 0])", "si=input()\r\nCount=0\r\ncount=0\r\nfor i in si:\r\n if i>='A' and i<='Z':\r\n Count+=1\r\n if i>='a' and i<='z':\r\n count+=1\r\nif count>=Count:\r\n print(si.lower())\r\nelse:\r\n print(si.upper())\r\n", "a = input()\r\nupperCount = 0\r\nlowerCount = 0\r\nfor i in range(len(a)):\r\n if a[i].isupper() == True:\r\n upperCount+=1\r\n if a[i].islower() == True:\r\n lowerCount+=1\r\nif upperCount > lowerCount:\r\n print(a.upper())\r\nif upperCount < lowerCount:\r\n print(a.lower())\r\nif upperCount == lowerCount:\r\n print(a.lower())\r\n ", "n=input()\r\na=[]\r\ncount=0\r\ncount1=0\r\nfor i in n:\r\n a.append(ord(i))\r\n##print(a)\r\nfor j in a:\r\n if j>=97 and j<=122:\r\n count+=1\r\n else:\r\n count1+=1\r\n##print(count)\r\n##print(count1)\r\nif count>count1:\r\n b=n.lower()\r\n print(b)\r\nelif count<count1:\r\n b=n.upper()\r\n print(b)\r\nelse:\r\n b=n.lower()\r\n print(b)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ns=input()\r\nn=list(s)\r\nup=0\r\nlo=0\r\nfor c in n:\r\n if c.isupper():\r\n up=up+1\r\n elif c.islower() :\r\n lo=lo+1\r\n##print(up > lo)\r\nif up>lo:\r\n ans=s.upper()\r\nelse:\r\n ans=s.lower()\r\nprint(ans)", "s = input()\r\n\r\nu = 0\r\nl = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u += 1\r\n elif s[i].islower():\r\n l += 1\r\n\r\nif u > l:\r\n print(s.upper())\r\nelif u <= l:\r\n print(s.lower())", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, functools\r\n#inf = 10**20\r\nimport sys,collections\r\n#defaultdict\r\n# inf = float('inf')\r\n# mod = 10**9+7\r\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\r\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\r\ndef I(): return int(sys.stdin.readline())\r\ndef F(): return float(sys.stdin.readline())\r\ndef S(): return input()\r\ndef endl(): return print('\\n')\r\n\r\ns = S()\r\nup = 0\r\ndown = 0\r\n\r\nfor i in s:\r\n\tif i.upper() == i:\r\n\t\tup += 1\r\n\telse:\r\n\t\tdown += 1\r\n\r\n\r\nif up > down:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\r\n\r\n", "s=input()\nc,d=0,0\nfor k in s:\n if(k.isupper()):\n c+=1\n if(k.islower()):\n d+=1\nif(c>d):\n print(s.upper())\nif(d>=c):\n print(s.lower())\n \t\t \t\t \t\t \t\t\t\t\t \t\t", "w = input();lowercase = sum([1 for l in w if l in 'abcdefghijklmnopqrstuvwxyz']);uppercase = len(w)-lowercase;print(w.lower() if lowercase >= uppercase else w.upper())", "line=list(input())\nalphabet=\"abcdefghijklmnopqrstuvwxyz\"\nAlphabet=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nnum_lower = 0\nnum_upper = 0\nfor i in line:\n\tif i in alphabet:\n\t\tnum_lower +=1\n\telse:\n\t\tnum_upper +=1\nif num_lower >= num_upper:\n\tfor j in range(len(line)):\n\t\tchar = line[j]\n\t\tif char in Alphabet:\n\t\t\tline[j] = alphabet[Alphabet.index(char)]\nelse:\n\tfor j in range(len(line)):\n\t\tchar = line[j]\n\t\tif char in alphabet:\n\t\t\tline[j] = Alphabet[alphabet.index(char)]\nans=\"\"\nfor i in line:\n\tans+=i\nprint(ans)", "s = input()\r\nuc = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n uc += 1\r\n\r\nif uc <= len(s)/2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nc = 0\r\nrs = s.lower()\r\nfor i in s:\r\n if i.isupper():\r\n c+=1\r\n if c > len(s)/2:\r\n print(s.upper())\r\n exit()\r\nprint(rs)\r\n", "s = input()\r\nup=0 \r\nlow = 0\r\nfor i in s:\r\n if(ord(i)>=97):\r\n low+=1 \r\n else:\r\n up+=1 \r\nif(up>low):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "def solve():\n s=input()\n a=0;b=0\n for i in s:\n if ord(i)>=ord('a') and ord(i)<=ord('z'):a+=1\n else :b+=1\n if a>=b: print(s.lower())\n else:print(s.upper())\n\ndef main():\n # t=int(input())\n # for i in range(t):\n # solve()\n solve()\n\nif __name__ == '__main__':\n main()\n \t \t\t\t\t\t \t\t \t\t \t \t \t", "countup=0\r\ncountdo=0\r\nst=input()\r\nfor x in range(0,len(st)):\r\n h=ord(st[x])\r\n if(h>=65 and h<=90 ):\r\n countup+=1\r\n else:\r\n countdo+=1\r\nif(countdo==countup):\r\n print(st.lower())\r\nelif(countdo>countup):\r\n print(st.lower())\r\nelse:\r\n print(st.upper())", "#Word\r\n\r\nn = input()\r\nx = 0\r\ny = 0\r\nfor p in n:\r\n if (ord(p) >= 65 and ord(p) <= 90):\r\n x=x+1\r\n else:\r\n y=y+1\r\nif(x>y):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "word = input()\r\n\r\nlower = upper = 0\r\n\r\nfor char in word:\r\n if char.islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n\r\nprint(word.upper() if upper > lower else word.lower())\r\n", "import re\r\ninn = input()\r\n\r\nupper_count = 0\r\nlower_count = 0\r\nfor i in inn:\r\n x = re.search('[a-z]',i)\r\n if x:\r\n lower_count += 1\r\n else :\r\n upper_count += 1\r\n\r\nif lower_count >= upper_count:\r\n print(inn.lower())\r\nelse :\r\n print(inn.upper())", "s = input()\r\nlower_count = sum(1 for c in s if c.islower())\r\nupper_count = sum(1 for c in s if c.isupper())\r\n\r\nif upper_count > lower_count:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = str(input())\r\nc = 0\r\nh = 0\r\nfor i in s:\r\n if i == i.lower():\r\n c += 1\r\n elif i == i.upper():\r\n h += 1\r\nif c > h:\r\n print(s.lower())\r\nelif h > c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\r\n\r\n", "a = str(input())\r\nup, low = 0, 0\r\nfor i in range(len(a)):\r\n if a[i].isupper():\r\n up += 1\r\n else:\r\n low += 1\r\nif low < up:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "'''\r\nProlem statement:\r\nlower case letters are more than UPPER case letters then return lower case\r\nUPPER case letters are more than lower case letters then return UPPER case\r\nif UPPER case letters and lower case letters are equal then return lower case\r\n'''\r\n\r\n\r\ndef word(s):\r\n upper_count = 0\r\n lower_count = 0\r\n for char in s:\r\n if char == char.upper():\r\n upper_count += 1\r\n else:\r\n lower_count += 1\r\n \r\n if upper_count > lower_count:\r\n return s.upper()\r\n elif upper_count < lower_count:\r\n return s.lower()\r\n else:\r\n return s.lower()\r\n\r\ndef main():\r\n s = input()\r\n result = word(s)\r\n print(result)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "def correctWord(word):\r\n uppercase_count = sum(1 for letter in word if letter.isupper())\r\n lowercase_count = len(word) - uppercase_count\r\n\r\n if uppercase_count > lowercase_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\n# Example usage\r\nword = input().strip()\r\nprint(correctWord(word))\r\n", "# A. Слово\r\ns = input()\r\ncapital = 0\r\nlow = 0\r\nfor i in s:\r\n if \"A\" <= i <= \"Z\":\r\n capital += 1\r\n elif \"a\" <= i <= \"z\":\r\n low += 1\r\nif low >= capital:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "x = input()\r\nif sum(1 for i in x if i.isupper()) > len(x) / 2:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "s = input()\r\na= [i for i in s if i.isupper()]\r\nif len(a)>len(s)//2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\nupper_ = 0\r\nlower_ = 0\r\nfor i in s:\r\n if i.upper() == i:\r\n upper_ += 1\r\n else:\r\n lower_ += 1\r\nif upper_ > lower_:\r\n print(s.upper())\r\nelif lower_ > upper_:\r\n print(s.lower())\r\nelif upper_ == lower_:\r\n print(s.lower())\r\n", "s=input()\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if ord(\"a\")<=ord(s[i])<=ord(\"z\"):\r\n l+=1\r\n else:\r\n u+=1\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "sl=0\r\ncl=0\r\ns=input()\r\nfor i in s:\r\n b=ord(i)\r\n if b>64 and b<91:\r\n cl+=1 \r\n else:\r\n sl+=1 \r\nif sl<cl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "#MahinHossainMunna\r\n#59A-Word\r\n\r\nstr1=str(input())\r\nif sum(map(str.islower, str1)) >= sum(map(str.isupper, str1)):\r\n print(str1.lower())\r\nelse:\r\n print(str1.upper())", "s=input()\r\na,b,c=0,0,0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].upper():\r\n a+=1\r\n else:\r\n b += 1\r\nprint([s.upper(),s.lower()][a<=b])\r\n ", "s=input()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i.isupper():\r\n u=u+1\r\n else:\r\n l=l+1\r\nif u>l:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "def change_case(word):\r\n upper_count=sum(1 for c in word if c.isupper())\r\n lower_count=len(word)-upper_count\r\n if upper_count>lower_count:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n\r\nword=input()\r\nprint(change_case(word))", "lower=0\r\nupper=0\r\na=input()\r\nfor i in a:\r\n if i.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "word = input()\r\n\r\nlowercase_letters = 0\r\n\r\nfor letter in word:\r\n\r\n\tif letter.islower():\r\n\r\n\t\tlowercase_letters += 1\r\n\r\nif len(word) - lowercase_letters > lowercase_letters:\r\n\r\n\tprint(word.upper())\r\n\r\nelse:\r\n\r\n\tprint(word.lower())", "s=input()\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n cnt+=1\r\nif cnt>=len(s)-cnt:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\n\r\nl =0\r\nu = 0\r\nfor x in s:\r\n if x.islower():\r\n l += 1\r\n else:\r\n u += 1\r\n\r\n\r\nif l < u:\r\n print(s.upper())\r\nelif l >= u:\r\n print(s.lower())\r\n", "l,b=0,0\r\ns=input()\r\nfor i in s:\r\n if i.islower():\r\n l+=1\r\n else:\r\n b+=1\r\nif b==l or b<l:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "import sys\r\n\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\n\r\ndef solve() -> None:\r\n s = input().strip()\r\n lower = 0\r\n for x in s:\r\n if ord('a') <= ord(x) <= ord('z'):\r\n lower += 1\r\n if lower >= len(s) - lower:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n \r\n\r\ndef main() -> None:\r\n # t = int(input())\r\n # for _ in range(t):\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "word = input()\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\nlower_count = 0\r\nupper_count = 0\r\nfor letter in word:\r\n if letter in alphabet:\r\n lower_count += 1\r\n else:\r\n upper_count += 1\r\nif lower_count >= upper_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = input()\r\ns2 = \"\"\r\nl = 0\r\nh = 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i].lower():\r\n l += 1\r\n else:\r\n h += 1\r\nif l >= h:\r\n for k in range(len(s)):\r\n s2 += s[k].lower()\r\n print(s2)\r\nelse:\r\n for k in range(len(s)):\r\n s2 += s[k].upper()\r\n print(s2)", "word=input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(word)):\r\n if(word[i].isupper()):\r\n count1+=1\r\n else:\r\n count2+=1\r\nif(count1>count2):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "word = input()\r\n\r\nuppercase_cnt = 0\r\nlowercase_cnt = 0\r\n\r\nfor letter in word:\r\n if letter.isupper():\r\n uppercase_cnt += 1\r\n else:\r\n lowercase_cnt += 1\r\n \r\nif uppercase_cnt <= lowercase_cnt:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s = input()\r\nlower, upper = 0, 0 \r\nfor i in s :\r\n if ord(i) <= 90 :\r\n upper += 1\r\n else :\r\n lower += 1\r\nif upper > lower :\r\n print(s.upper())\r\nelse :\r\n print(s.lower())", "str = input()\r\nl_c = 0\r\nu_c = 0\r\nfor e in str:\r\n if e.islower():\r\n l_c += 1\r\n else:\r\n u_c += 1\r\nif l_c > u_c or l_c == u_c:\r\n print(str.lower())\r\nelse:\r\n print(str.upper())", "s1=input()\r\ns2=s1.lower()\r\nl=len(s1)\r\nres=0\r\nfor i in range(l):\r\n if s1[i]!=s2[i]:\r\n res+=1\r\nprint(s1.upper() if 2*res>l else s2)", "slovo = str(input())\r\ncount = 0\r\nfor i in slovo:\r\n if i.upper() == i:\r\n count += 1\r\nif len(slovo) - count >= count:\r\n print(slovo.lower())\r\nelse:\r\n print(slovo.upper())\r\n", "word = input()\nu = 0\nl = 0\n\nfor i in word:\n\tif i == i.upper():\n\t\tu += 1\n\telse:\n\t\tl += 1\n\t\nif u > l:\n\tprint(word.upper())\nelse:\n\tprint(word.lower())\n", "a = input('')\r\nd = 0\r\nx = 0\r\nfor i in range(len(a)):\r\n if 'a'<=a[i]<='z':\r\n x+=1\r\n else:\r\n d+=1\r\nif d>x:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "import re\r\nstring = input()\r\nupperCase = re.findall('[A-Z]',string)\r\nupperNum = len(upperCase)\r\nlowerCase = re.findall('[a-z]',string)\r\nlowerNum = len(lowerCase)\r\nif lowerNum >= upperNum : \r\n\tprint(string.lower())\r\nelse : \r\n\tprint(string.upper())", "import sys\r\nn = sys.stdin.readline()\r\ncount = 0\r\nfor i in n:\r\n if i.islower():\r\n count += 1\r\nif(len(n)-count-1 <= count):\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "n = input()\r\nc = 0\r\nb = 0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n c = c + 1\r\n if i.islower():\r\n b = b + 1\r\n\r\na = ''\r\n\r\nif c > b:\r\n a = n.upper()\r\nelif b > c:\r\n a = n.lower()\r\nelse:\r\n a = n.lower()\r\n\r\nprint(a)", "s = input()\r\nuc,lc = 0,0 \r\nfor c in s:\r\n\tif c.isupper()== True:\r\n\t\tuc += 1\r\n\telse :\r\n\t\tlc += 1\r\nif uc < lc:\r\n\ts = s.lower()\r\nelif lc < uc:\r\n\ts = s.upper()\r\nelse :\r\n\ts = s.lower()\r\nprint(s)", "word=input()\r\nl=0\r\nu=0\r\nfor i in word:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n word=word.upper()\r\nelse:\r\n word=word.lower()\r\nprint(word) ", "word = input()\r\nfromb = {'A' : 'a', 'B' : 'b', 'C' : 'c', 'D' : 'd', 'E' : 'e', 'F' : 'f', 'G':'g', 'H':'h', 'I':'i', 'J':'j', 'K':'k'}\r\ns = 0\r\nb = 0\r\nfor i in word:\r\n if i.isupper():\r\n b += 1\r\n else:\r\n s += 1\r\nif b > s:\r\n word = word.upper()\r\nelse:\r\n word = word.lower()\r\nprint(word)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jan 12 19:25:47 2023\r\n\r\n@author: Asus\r\n\"\"\"\r\nword = str(input())\r\n\r\nucount=0\r\nlcount=0\r\n\r\nfor i in word:\r\n if i.isupper():\r\n ucount+=1\r\n else:\r\n lcount+=1\r\n \r\nif ucount<lcount:\r\n print(word.lower())\r\nelif lcount<ucount:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "x = str(input())\nLW = 0\nUP = 0\nfor c in x :\n if c.isupper():\n UP=UP+1\n else:\n LW=LW+1\nif UP > LW :\n print(x.upper())\nelse :\n print(x.lower())\n \nquit()\n\t \t\t \t \t\t\t\t\t \t\t \t \t \t \t\t\t \t", "palabra = input()\r\nmin = 0\r\nmay = 0\r\n\r\nfor letra in palabra:\r\n if 64 < ord(letra) and ord(letra) < 91:\r\n may += 1\r\n elif 96 < ord(letra) and ord(letra) < 123:\r\n min += 1\r\n\r\nif may > min:\r\n print(palabra.upper())\r\nelse:\r\n print(palabra.lower())", "x = input()\r\nlen(x)\r\nupper = 0\r\nlower = 0\r\nfor i in x:\r\n\tif(i.islower()):\r\n lower+=1\r\n\telse:\r\n\t\tupper+=1\r\nif(lower < upper):\r\n\tx = x.upper()\r\nelse:\r\n\tx = x.lower()\r\nprint(x) ", "str1 = input(\" \")\r\ncount_lower = 0\r\ncount_upper = 0\r\nfor i in str1:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n count_lower = count_lower +1\r\n if(ord(i)>=65 and ord(i)<=90):\r\n count_upper = count_upper + 1\r\n \r\n#print(count_lower)\r\n#print(count_upper)\r\n\r\nif(count_lower >= count_upper):\r\n str2 = str1.lower()\r\nelif(count_lower < count_upper):\r\n str2 = str1.upper()\r\n \r\nprint(str2)", "z=input()\r\nc=0\r\nfor i in z:\r\n if i.isupper():\r\n c+=1\r\nif c>(len(z)-c):\r\n print(z.upper())\r\nelse:\r\n print(z.lower())\r\n", "word = input()\r\ncount_lowercase = 0\r\ncount_uppercase = 0\r\n\r\nfor i in word:\r\n if i.islower():\r\n count_lowercase+=1\r\n if i.isupper():\r\n count_uppercase+=1\r\n\r\nif count_uppercase>count_lowercase:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "a=input()\r\ncount=0\r\nfor i in range(len(a)):\r\n if (a[i].islower()):\r\n count+=1\r\ncountup=len(a)-count\r\nif countup>count:\r\n a=a.upper()\r\nelse:\r\n a=a.lower()\r\nprint(a)", "import collections\r\nclass solution:\r\n def ps(s):\r\n lower = 0\r\n upper = 0\r\n for i in s:\r\n if str(i).islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n if lower > upper or lower == upper:\r\n return (s.lower())\r\n else:\r\n return (s.upper())\r\n\r\n\r\n\r\ns = str(input())\r\nres = solution.ps(s)\r\nprint(res)", "p=input()\r\ncount_upper=0\r\ncount_lower=0\r\nfor i in range(len(p)):\r\n\tif p[i].upper()==p[i]:\r\n\t\tcount_upper+=1\r\n\telse:\r\n\t\tcount_lower+=1\r\nif count_lower>=count_upper:\r\n\tprint(p.lower())\r\nelse:\r\n\tprint(p.upper())", "s = input()\r\nm,n = 0,0\r\nfor i in range(len(s)):\r\n if 65 <= ord(s[i]) <= 90:\r\n m += 1\r\n else:\r\n n += 1\r\nprint(s.upper()) if m > n else print(s.lower())\r\n", "a=input()\r\ncount=0\r\nfor i in range(len(a)):\r\n if a[i]==a.upper()[i]:\r\n count=count+1\r\n\r\nif count > (len(a)/2):\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "word=input()\r\ncount,number=0,0\r\nfor i in word:\r\n if(i>='a' and i<='z'):\r\n count=count+1\r\n elif(i>='A' and i<='Z'):\r\n number=number+1\r\nif(number>count):\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "word = input()\r\nupper = sum(1 for x in word if ord(x) < 97)\r\n\r\nprint(word.upper() if upper * 2 > len(word) else word.lower())", "line = input()\r\ns = 0\r\nfor _ in line:\r\n if ord('a') <= ord(_) <= ord('z'):\r\n s += 1\r\nprint(line.lower() if s >= len(line)/2 else line.upper())\r\n", "def check(s):\r\n up,low=0,0\r\n for i in s:\r\n if i==i.upper():\r\n up+=1\r\n else:\r\n low+=1\r\n if up>low:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\n \r\ns = input()\r\nprint(check(s))", "x = input()\r\ncmin = 0\r\ncmay = 0\r\nfor i in x:\r\n if i.isupper() == True:\r\n cmay += 1\r\n else:\r\n cmin += 1\r\n\r\nif cmin >= cmay:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "s='qweryiopasdfghjklxcvbnm'\r\nc='QWERTYUIOPASDFGHJKLZXCVBNM'\r\nt=input()\r\ncap=0\r\nsam=0\r\nfor i in t:\r\n if i in c:\r\n cap+=1\r\n else:\r\n sam+=1\r\nif cap>sam:\r\n # print(55555)\r\n print(t.upper())\r\nelse:\r\n \r\n print(t.lower())\r\n", "word = input()\r\nlowerc_count = 0\r\nfor char in word:\r\n if char.islower():\r\n lowerc_count += 1\r\n\r\nif lowerc_count >= len(word) - lowerc_count:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())", "alf = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',\r\n 'w', 'x', 'y', 'z']\r\nup, dow = 0, 0\r\ninp = input()\r\nfor i in inp:\r\n if i in alf:\r\n dow += 1\r\n else:\r\n up += 1\r\n\r\nprint(inp.lower() if dow > up or up == dow else inp.upper())\r\n", "def solve(x):\n\n cu = 0\n cd = 0\n\n for c in x:\n\n if c.upper()==c:\n cu+=1\n else:\n cd +=1\n if cu>cd:\n return x.upper()\n else:\n return x.lower()\n \n \nx = input()\n# x = int(intput())\n\nprint(solve(x))\n\t\t \t\t \t \t \t \t\t\t\t\t \t\t\t \t \t\t", "x=input()\r\nc=0\r\nd=0\r\nfor i in range(0,len(x)):\r\n if(x[i]>='A' and x[i]<='Z'):\r\n c+=1\r\n else:\r\n d+=1\r\n\r\nif(c>d):\r\n for i in range(0,len(x)):\r\n if(ord(x[i])>=97):\r\n s=ord(x[i])-32\r\n print(chr(s),end=\"\")\r\n else:\r\n print(x[i],end=\"\")\r\n\r\nelse:\r\n for i in range(0,len(x)):\r\n if(ord(x[i])<97):\r\n s=ord(x[i])+32\r\n print(chr(s),end=\"\")\r\n else:\r\n print(x[i],end=\"\")", "s=input();cnt = 0\r\nfor ch in s:\r\n if ch == ch.upper(): cnt += 1\r\nprint(s.upper() if cnt > len(s)//2 else s.lower())\r\n", "cnt,cnt2=0,0\r\ns=input()\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n cnt+=1\r\n else:\r\n cnt2+=1\r\nif(cnt>=cnt2):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\nl = ''\r\nu = ''\r\nfor i in s:\r\n if i.islower()==True:\r\n l = l + i\r\n else:\r\n u = u + i\r\nif len(l)>=len(u):\r\n s = s.lower()\r\nelse:\r\n s = s.upper()\r\nprint(s)", "s = input()\r\nUC = 0\r\nLC = 0\r\nfor i in range(len(s)):\r\n if ord(s[i]) >= 65 and ord(s[i]) <=90:\r\n UC += 1\r\n else:\r\n LC += 1\r\nif UC > LC:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "def adjust_word(word):\r\n lowerc = 0\r\n upperc = 0\r\n for char in word :\r\n if char.isupper():\r\n upperc +=1\r\n else:\r\n lowerc += 1\r\n \r\n if upperc > lowerc:\r\n return word.upper()\r\n else:\r\n return word.lower()\r\n \r\nword = input()\r\nres = adjust_word(word)\r\nprint(res)\r\n ", "n=input()\r\ncount=Count=0\r\nfor i in n:\r\n if i.isupper():\r\n count=count+1\r\n elif i.islower():\r\n Count=Count+1\r\nif count>Count:\r\n print(n.upper())\r\nelif Count>=count:\r\n print(n.lower())", "a = input()\r\nsm = 0\r\nkr = 0\r\nfor i in range(len(a)):\r\n if 'a'<=a[i]<='z':\r\n sm = sm + 1\r\n elif 'A'<=a[i]<='Z':\r\n kr = kr + 1\r\nif sm >= kr:\r\n print(a.lower())\r\nelse:\r\n print(a.upper())\r\n\r\n", "string = input()\r\ncnt_l = 0\r\ncnt_u = 0\r\nfor i in string:\r\n if i.islower():\r\n cnt_l += 1\r\n else:\r\n cnt_u += 1\r\nif cnt_l >= cnt_u:\r\n print(string.lower())\r\nelse:\r\n print(string.upper())\r\n", "x = input();\r\nlow = 0;\r\nup = 0;\r\nfor i in x :\r\n if i.islower() :\r\n low = low + 1;\r\n else : \r\n up = up + 1;\r\nif low < up :\r\n x = x.upper();\r\nelif up < low:\r\n x = x.lower();\r\nelse :\r\n x = x.lower();\r\nprint(x);", "n=input()\r\ncount=0\r\ncount1=0\r\nfor i in n:\r\n if(i.isupper()==True):\r\n count+=1\r\n else:\r\n count1+=1\r\nif(count>count1):\r\n print(n.upper())\r\nelif(count1>count):\r\n print(n.lower())\r\nelse:\r\n print(n.lower())", "text = input()\r\n\r\nlower = upper = 0\r\n\r\nfor i in range(len(text)):\r\n if text[i].islower():\r\n lower += 1\r\n else:\r\n upper += 1\r\n \r\nprint(text.lower() if lower>=upper else text.upper())", "import re\r\ndef main():\r\n inp = input()\r\n match = re.findall('[a-z]',inp)\r\n print (inp.upper() if len(match) < len(inp)//2 else inp.lower() if len(inp)%2 == 0 else inp.upper() if len(match) < (len(inp)+1)//2 else inp.lower())\r\nif __name__ == \"__main__\" : main()", "s = input()\r\ncounter1 = counter2 = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n counter1+=1\r\n else:\r\n counter2+=1\r\n\r\nif counter1 > counter2:\r\n print(s.upper())\r\nelif counter1 < counter2:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())", "s = input()\n\nc = 0\nfor i in s :\n if i.isupper():\n c += 1\n else :\n c -= 1\n\nif c>0:\n print(s.upper())\nelse :\n print(s.lower())\n", "def _upper(m):\r\n m=m.upper()\r\n return m\r\n\r\n\r\nn=input()\r\nu=0\r\nl=0\r\nfor i in n:\r\n if i==_upper(i):\r\n u+=1\r\n else:\r\n l+=1\r\n \r\nif(u>l):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "#Word\r\ns=input()\r\nup=0\r\nlow=0\r\nfor ele in s:\r\n if ele.isupper():\r\n up=up+1\r\n elif ele.islower():\r\n low=low+1\r\nif (up>low): print(s.upper())\r\nelse: print(s.lower())", "s=input()\r\nn=len(s)//2\r\na,b=0,0\r\nfor i in s:\r\n if i.isupper():\r\n a+=1\r\n elif i.islower():\r\n b+=1\r\n if a>n or b>n:\r\n break\r\nif max(a,b)==b:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = str(input())\nlowNum = 0\nupNum = 0\nfor i in s:\n if i.islower() :\n lowNum += 1\n else:\n upNum += 1\n\nif lowNum >= upNum:\n print(s.lower())\nelse:\n print(s.upper())\n", "chars = list (input ())\r\nlow = 0\r\nfor c in chars :\r\n if c.islower () :\r\n low += 1\r\n else :\r\n low -= 1\r\nstr = \"\".join (chars)\r\nif low >= 0 :\r\n print (str.lower ())\r\nelse :\r\n print (str.upper ())\r\n", "s = input()\r\ncap, low = 0, 0\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n low += 1\r\n else:\r\n cap += 1\r\nif low < cap:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\n\r\nnum_of_uppers = 0\r\nnum_of_lowers = 0\r\n\r\nfor ch in word:\r\n if ch.isupper():\r\n num_of_uppers += 1\r\n else:\r\n num_of_lowers += 1\r\n\r\nif num_of_lowers >= num_of_uppers:\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "s=input()\r\nl=len(s)\r\na=0\r\nb=0\r\nfor i in range(l):\r\n if ord(s[i])>=65 and ord(s[i])<=91:\r\n a=a+1\r\n else:\r\n b=b+1\r\nif a>b:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)\r\n \r\n ", "s=input()\r\ncnt=0\r\nfor i in s:\r\n\tif ord(i)<=90:\r\n\t\tcnt+=1\r\nif cnt<=len(s)//2:\r\n\tprint(s.lower())\r\nelse:\r\n\tprint(s.upper())", "'''\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'''\nst=input()\nli=list(st)\ncu=0\ncl=0\nfor i in li:\n if i.isupper():\n cu+=1\n elif i.islower():\n cl+=1\nif cu > cl:\n print(st.upper())\nelse:\n print(st.lower())\n ", "s=input()\r\nl=list(s)\r\nc=0;c1=0\r\nfor i in range (0,len(s)):\r\n if(s[i].islower()==True):\r\n c=c+1\r\n if(s[i].isupper()==True):\r\n c1=c1+1\r\nif(c>c1):\r\n print(s.lower())\r\nelif(c<c1):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "a = input()\r\nl = len(a)\r\nbc = 0\r\nsc = 0\r\nfor i in range(l):\r\n if ord(a[i]) <= 90 and ord(a[i]) >= 65:\r\n bc += 1\r\n else:\r\n sc += 1\r\nif bc <= sc:\r\n a = a.lower()\r\nelse:\r\n a = a.upper()\r\nprint(a)", "s = input()\r\na = 0\r\nb = 0\r\nfor i in s:\r\n if str.isupper(i):\r\n a += 1\r\n else:\r\n b += 1\r\n\r\nif a > b:\r\n print(str.upper(s))\r\nelif a <= b:\r\n print(str.lower(s))", "w=input()\r\nuc=0\r\nlc=0\r\nfor i in w:\r\n if i.isupper():\r\n uc+=1\r\n elif i.islower():\r\n lc+=1\r\nif uc==lc:\r\n print(w.lower())\r\nelif uc>lc:\r\n print(w.upper())\r\nelse:print(w.lower())", "entrada=input()\r\nx=0\r\ny=0\r\nfor i in range (0,len(entrada)):\r\n if(entrada[i].islower()):\r\n x+=1\r\n else:\r\n y+=1\r\nif(x>y):\r\n print(entrada.lower()) \r\nelif(x<y):\r\n print(entrada.upper())\r\nelse:\r\n print(entrada.lower()) \r\n\r\n", "i=input()\r\nprint([i.lower(),i.upper()][sum(map(str.isupper,i))>len(i)/2])", "n=input()\r\nc1=0\r\nc2=0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n c1+=1\r\n elif n[i].islower():\r\n c2+=1\r\n else:\r\n c1+=0\r\n \r\nif c1>c2:\r\n print(n.upper())\r\nelif c2>c1:\r\n print(n.lower())\r\nelse:\r\n print(n.lower())\r\n \r\n \r\n \r\n \r\n ", "word = input()\r\nlst = []\r\nupper = 0\r\nlower = 0\r\nfor i in range(len(word)):\r\n lst.append(word [i-1])\r\nfor i in lst:\r\n if i.isupper() == True:\r\n upper +=1\r\n else:\r\n lower +=1\r\nif upper>lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "import sys\r\na = list(sys.stdin.readline())[:-1]\r\nupper = 0\r\nlower = 0\r\nfor i in a:\r\n if str(i).isupper():\r\n upper += 1\r\n elif str(i).islower():\r\n lower += 1\r\n\r\nif upper == lower:\r\n print(\"\".join(a).lower())\r\nelif lower > upper:\r\n k = 0\r\n while k < len(a):\r\n if str(a[k].isupper()):\r\n a[k] = str(a[k].lower())\r\n k += 1\r\n print(\"\".join(a))\r\nelif lower < upper:\r\n x = 0\r\n while x < len(a):\r\n if str(a[x].isupper()):\r\n a[x] = str(a[x].upper())\r\n x += 1\r\n print(\"\".join(a))", "lis = input()\r\nc = 0\r\nt = 0\r\nfor i in lis:\r\n if(i.isupper()):\r\n c += 1\r\n else:\r\n t += 1\r\nif(t>=c):\r\n print(lis.lower())\r\nelse:\r\n print(lis.upper())", "word = input()\r\ncnt = 0\r\nfor i in word:\r\n cnt += i.isupper()\r\nif(cnt > len(word)/2):print(word.upper())\r\nelse: print(word.lower())", "n = input()\r\nlow = 0\r\nhigh = 0\r\nfor i in n:\r\n if i.islower():\r\n low+=1\r\n else:\r\n high+=1\r\nif low>=high:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "s = input()\nr = s.lower() if sum(i.islower() for i in s) >= int(len(s)/2+.5) else s.upper()\nprint(r)\n", "word = input()\r\n\r\n\r\ndef main(word: str):\r\n l_count = 0\r\n c_count = 0\r\n for i in word:\r\n if i.islower():\r\n l_count += 1\r\n else:\r\n c_count += 1\r\n return word.upper() if c_count > l_count else word.lower()\r\n\r\n\r\nprint(main(word))\r\n# print(\"a\".)", "x=str(input())\r\nsmall=0\r\nupper=0\r\nfor i in x:\r\n if(i.islower()):\r\n small+=1\r\n\r\n elif(i.isupper()):\r\n upper+=1\r\n\r\nif (small>=upper) :\r\n print(x.lower())\r\n\r\nelse:\r\n print(x.upper())", "s1 = input()\r\ns1copy = ''\r\nl = 0\r\nm = 0\r\nfor i in s1:\r\n if ord('A') <= ord(i) <= ord('Z'):\r\n l += 1\r\n else:\r\n m += 1\r\nif l > m:\r\n for i in s1:\r\n s1copy += i.upper()\r\nelse:\r\n for i in s1:\r\n s1copy += i.lower()\r\nprint(s1copy)\r\n", "s = input()\r\n\r\nindex=len(s)\r\nupper=0\r\nlower=0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n upper +=1\r\n else:\r\n lower +=1\r\n\r\nif upper>lower:\r\n print(s.upper())\r\n\r\nelif lower>upper:\r\n print(s.lower())\r\n\r\nelif upper==lower:\r\n print(s.lower())\r\n", "s=input()\r\nd={'U':0,'L':0}\r\nfor i in s:\r\n if i.islower():\r\n d['L']+=1\r\n elif i.isupper():\r\n d['U']+=1\r\n else:\r\n pass\r\na=d['L']\r\nb=d['U']\r\nif a<b:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "n = input()\r\nm, b = 0, 0\r\nfor x in n:\r\n if x in 'abcdefghijklmnopqrstuvwxyz':\r\n m += 1\r\n else:\r\n b += 1\r\nif b > m:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "string=input()\r\ncnt1=0\r\ncnt2=0\r\nfor itr in string:\r\n if 65<=ord(itr)<=90:\r\n cnt1=cnt1+1\r\n elif 97<=ord(itr)<=122:\r\n cnt2=cnt2+1\r\nif cnt1>cnt2:\r\n print(string.upper())\r\nelif cnt1==cnt2:\r\n print(string.lower())\r\nelse:\r\n print(string.lower()) \r\n \r\n", "n=str(input())\r\nlw=0\r\nup=0\r\nfor i in n:\r\n if i.islower():\r\n lw+=1\r\n else:\r\n up+=1\r\nif(up>lw):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "flag = 0\r\nword = input()\r\nfor i in range(len(word)):\r\n if ord(word[i]) > 90:\r\n flag += 1\r\nif flag >= (len(word))/2:\r\n print(word.lower())\r\nelse:\r\n print(word.upper()) ", "str1=input()\r\nsmall=0\r\ncap=0\r\nfor i in str1:\r\n if ord(i)>=97 and ord(i)<=122:\r\n small+=1\r\n else:\r\n cap+=1\r\nif small>=cap:\r\n str1=str1.lower()\r\nelse:\r\n str1=str1.upper()\r\n \r\nprint(str1)", "import sys\r\na = sys.stdin.readline()\r\ns = 0\r\nfor char in a.strip():\r\n if char.isupper():\r\n s+=1 \r\n else:\r\n s-=1\r\nif s>0:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n", "s = input()\r\nu = sum(1 for char in s if char.isupper())\r\nl = sum(1 for char in s if char.islower())\r\nif u == l:\r\n print(s.lower())\r\nelif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\ncounter = 0\nfor i in a:\n\tcounter += 1 if i.isupper() else -1\nprint(a.upper() if counter > 0 else a.lower())", "string = input()\r\na = len(string)\r\ncount_of_big = 0\r\ncount_of_mini = 0\r\nfor i in string:\r\n if i.isupper():\r\n count_of_big += 1\r\n else:\r\n count_of_mini += 1\r\nif count_of_big > count_of_mini:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n", "x=input()\nl=0\nu=0\nfor i in x:\n if (i.islower()):\n l=l+1\n else:\n u=u+1\nif(l<u):\n print(x.upper())\nelse:\n print(x.lower())\n \n\t\t\t \t \t\t \t \t \t\t\t \t\t\t \t", "w = input()\r\nuc = 0\r\nfor c in w:\r\n if c.upper() == c: uc += 1\r\nlc = len(w) - uc\r\nif uc > lc: print(w.upper())\r\nelse: print(w.lower())", "n=input()\r\nu=list(n.upper())\r\nt=list(n)\r\nk=0\r\nm=0\r\nfor i in t:\r\n if i in u:\r\n k=k+1\r\n else:\r\n m=m+1\r\nif k>m:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "s=input()\r\n\r\nlo=0\r\nup=0\r\n\r\nfor i in s:\r\n if ord(i) >= 65 and ord(i) <=90:\r\n lo+=1\r\n else:\r\n up+=1\r\n\r\nif lo<=up:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n ", "\r\ns = input()\r\nt1 = 0\r\nt2 = 0\r\nfor i in s:\r\n if i >= 'A' and i <= 'Z':\r\n t1 += 1\r\n elif i >= 'a' and i<= 'z':\r\n t2 += 1\r\n\r\nif t2 >= t1:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s = input()\r\n\r\nc = 0\r\n\r\nfor i in s:\r\n if i>='a' and i<='z':\r\n c+=1\r\n\r\nif c>= (len(s)-c):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\nword = word.strip()\r\nnumber_of_upper = 0\r\nnumber_of_lower = 0\r\ntemp_word = list(word)\r\n\r\nfor char in temp_word:\r\n if char.isupper():\r\n number_of_upper += 1\r\n else:\r\n number_of_lower += 1\r\n\r\nif number_of_upper > number_of_lower:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())\r\n", "def program():\n inputString = input()\n countUpper, countLower = 0, 0\n for c in inputString:\n if c.isupper():\n countUpper += 1\n else:\n countLower += 1\n if countUpper > countLower:\n return inputString.upper()\n else: \n return inputString.lower()\n\n\n\n\nif __name__ == \"__main__\":\n print(program())", "s = input ()\r\ncount = 0\r\nCOUNT = 0\r\nfor i in s :\r\n\tif 'a' <= i <= 'z' :\r\n\t\tcount += 1\r\n\telse :\r\n\t\tCOUNT += 1\r\nif count >= COUNT :\r\n\tprint ( s.lower () )\r\nelse :\r\n\tprint ( s.upper () )\r\n\r\n", "s = input()\r\nl = len(s)\r\ncnt = 0\r\nfor i in range(l):\r\n if s[i].islower():\r\n cnt+=1\r\n\r\nupper=l-cnt\r\nif upper>cnt:\r\n print(s.upper())\r\nelif upper<cnt:\r\n print(s.lower())\r\nelse:\r\n print(s.lower())\r\n", "s=str(input())\r\nc1=c2=0\r\nfor x in s:\r\n if x.isupper():\r\n c1+=1\r\n if x.islower():\r\n c2+=1\r\nif c1>c2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "word = input()\r\nc=0\r\nlength = len(word)\r\nfor i in word:\r\n\tif i.isupper():\r\n\t\tc+=1\r\nif c>(length-c):\r\n\tprint(word.upper())\r\nelif c==(length-c):\r\n\tprint(word.lower())\r\nelse:\r\n\tprint(word.lower())\r\n# print(word)", "s=input()\r\nupp=0\r\nlow=0\r\nfor i in range(0,len(s)):\r\n if s[i].isupper():\r\n upp=upp+1\r\n else:\r\n low=low+1\r\nif upp>low:\r\n s1=s.upper()\r\n print(s1)\r\nelse:\r\n s2=s.lower()\r\n print(s2)", "count = 0\ns = input()\nls = len(s)\n\nfor c in s:\n if c == c.lower():\n count += 1\n\nif count >= ls - count:\n print(s.lower())\nelse:\n print(s.upper())\n", "word = input()\r\nis_upper = 0\r\nis_lower = 0\r\nfor i in range(len(word)):\r\n if word[i].isupper() is True:\r\n is_upper = is_upper + 1\r\n else:\r\n is_lower = is_lower + 1\r\n\r\nif is_upper > is_lower:\r\n print(word.upper())\r\nelif is_upper < is_lower:\r\n print(word.lower())\r\nelse: \r\n print(word.lower())", "x = input()\r\nupper = sum(i.isupper() for i in x)\r\n\r\nif upper > len(x) // 2:\r\n print(x.upper())\r\nelse:\r\n print(x.lower())", "n=input()\r\ncaps=0\r\nsmall=0\r\nfor i in n:\r\n if(ord(i)>=97):\r\n small+=1\r\n else:\r\n caps+=1\r\nif(caps>small):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())", "ch=input()\r\nupcase=0\r\nlowcase=0\r\ni=0\r\nwhile (i < len(ch)):\r\n if (ord(ch[i]) >= 65 and ord(ch[i]) <=90) :\r\n upcase+=1\r\n else : \r\n lowcase+=1\r\n i+=1\r\nif (upcase > lowcase) :\r\n print(ch.upper())\r\nelse :\r\n print(ch.lower())", "word=input()\r\nlst=list(word)\r\ncountC=0\r\ncountS=0\r\nfor i in lst:\r\n if i >='A' and i<='Z':\r\n countC+=1\r\n else:\r\n countS+=1\r\nif countC>countS:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "text = input()\nuppercase = 0\nlowercase = 0\nfor detail in text:\n if detail.isupper():\n uppercase = uppercase + 1\n elif detail.islower():\n lowercase = lowercase + 1\n\nif uppercase > lowercase:\n print(text.upper())\nelse:\n print(text.lower())\nquit()\n\t\t \t \t \t\t\t \t\t \t\t\t\t \t \t\t", "s=input()\r\ns1=[str(i) for i in s]\r\ncountl=0\r\ncountu=0\r\nfor j in s1:\r\n if j.islower():\r\n countl+=1\r\n else:\r\n countu+=1\r\nif countl>=countu:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "word = input()\r\nup = 0\r\nlow = 0\r\n\r\nfor char in word:\r\n if char == char.upper():\r\n up += 1\r\n else:\r\n low += 1\r\n\r\nif up <= low:\r\n print(word.lower())\r\n\r\nelse:\r\n print(word.upper())\r\n", "s=input()\r\nlower=0\r\nupper=0\r\nfor x in s:\r\n if x==x.lower():\r\n lower+=1\r\n elif x==x.upper():\r\n upper+=1\r\nif upper>lower:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s=input()\r\nlower_count=upper_count=0\r\nfor i in s:\r\n if i.isupper():\r\n upper_count+=1\r\n elif i.islower():\r\n lower_count+=1\r\nif lower_count<upper_count:\r\n s=s.upper()\r\nelse:\r\n s=s.lower()\r\nprint(s)", "string = input()\r\nk = sum(i.isupper() for i in string)\r\nl = sum(i.islower() for i in string)\r\nif k >l:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())\r\n \r\n", "s = input()\r\nu = 0\r\nl = 0\r\nfor i in s:\r\n if i.islower():\r\n l+=1\r\n else:\r\n u+=1\r\n\r\nif u > l:\r\n s = s.upper()\r\n\r\nelif u < l:\r\n s = s.lower()\r\n\r\nelif u == l:\r\n s = s.lower()\r\n\r\nprint(s)", "str = input()\r\nupper=0\r\nlower=0\r\nfor char in str:\r\n if char.isupper():\r\n upper+=1\r\n else:\r\n lower+=1\r\nif upper>lower:\r\n print(str.upper()) \r\nelif upper<=lower:\r\n print(str.lower()) \r\n ", "n = input()\r\na = 0\r\nm = n.lower()\r\nk = n.upper()\r\nfor i in n:\r\n if i in 'abcdefghijklmnopqrstuvwxyz':\r\n a += 1\r\nif len(n) / 2 <= a:\r\n print(m)\r\nelse:\r\n print(k)", "word = input()\ncount_upper = 0\ncount_lower = 0\nfor char in word:\n if char.isupper():\n count_upper += 1\nfor char in word:\n if char.islower():\n count_lower+=1\nif count_upper <= count_lower:\n print(word.lower())\nelse:\n print(word.upper())\n\t\t\t\t\t \t \t\t\t \t\t\t \t \t \t\t", "w = input()\r\n \r\nl = 0\r\nu = 0\r\n \r\nfor letter in w:\r\n if letter.isupper():\r\n u += 1\r\n else:\r\n l += 1\r\nif u > l:\r\n w = w.upper()\r\nelse:\r\n w = w.lower()\r\n \r\nprint(w) \r\n", "a = input()\r\nk1 = 0\r\nk2 = 0\r\nfor i in range(len(a)):\r\n if a[i].islower():\r\n k1 += 1\r\n elif a[i].isupper():\r\n k2 += 1\r\nif k1 > k2:\r\n print(a.lower())\r\nelif k1 < k2:\r\n print(a.upper())\r\nelif k1 == k2:\r\n print(a.lower())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 7 15:45:59 2021\r\n\r\n@author: rahimcc\r\n\"\"\"\r\n\r\nstr1 = input()\r\n\r\nlow_count= 0 \r\nup_count= 0 \r\n\r\nfor i in range(len(str1)):\r\n if (str1[i].isupper()):\r\n up_count+=1\r\n else:\r\n low_count+=1 \r\n \r\nif ( up_count> low_count): \r\n print(str1.upper()) \r\nelse:\r\n print(str1.lower())", "s = input()\nflag_true_title = 0\nflag_false_title = 0\nfor x in range(0, len(s)):\n if s[x:x+1].istitle() == True:\n flag_true_title += 1\n else:\n flag_false_title += 1\nif flag_true_title > flag_false_title:\n print(s.upper())\nelif flag_true_title < flag_false_title:\n print(s.lower())\nelse:\n print(s.lower())\n", "word = input().strip()\r\nlower =0\r\nfor letter in word :\r\n if letter.islower():\r\n lower+=1\r\nupper = len(word)- lower\r\nif lower>= upper:\r\n word= word.lower()\r\nelse:\r\n word = word.upper()\r\nprint(word)", "m = input()\r\nl = 0\r\nu = 0 \r\nfor i in m:\r\n if i.islower():\r\n l+=1\r\n elif i.isupper():\r\n u+=1\r\nif l >= u: \r\n m = m.lower()\r\nelif u > l:\r\n m = m.upper()\r\nprint(m)", "a=input()\r\na1 = a.upper()\r\na2 = a.lower()\r\nb=0\r\nl=0\r\nfor x in a:\r\n if 'a'<=x<='z':\r\n l=l+1\r\n else:\r\n b=b+1\r\nif b>l:\r\n print(a1)\r\nelse:\r\n print(a2)\r\n", "s = input()\r\nup_num = 0\r\nlow_num = 0\r\n\r\nfor char in s:\r\n if char.isupper():\r\n up_num += 1\r\n else:\r\n low_num += 1\r\n \r\nprint(s.upper() if (up_num > low_num) else s.lower())", "if __name__ == '__main__':\r\n s = input()\r\n word_lower = s.lower()\r\n number_lower = 0\r\n for i in range(len(s)):\r\n if word_lower[i] != s[i]:\r\n number_lower = number_lower + 1\r\n number_upper = len(s) - number_lower\r\n if number_lower <= number_upper:\r\n sf = s.lower()\r\n else:\r\n sf = s.upper()\r\n print(sf)\r\n", "a=input()\r\nc=0\r\nd=0\r\nfor i in a:\r\n if ord(i) >64 and ord(i)<91:\r\n c+=1\r\n else:\r\n d+=1\r\nif c > d:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\r\n\r\n", "w = input()\r\na1 = 0\r\na2 = 0\r\nword = ''\r\nb = 0\r\nfor i in w:\r\n if ord(i) > 90:\r\n a1 += 1\r\n else:\r\n a2 += 1\r\n\r\nif a1 >= a2:\r\n for i in w:\r\n if ord(i) < 91:\r\n b = ord(i) + 32\r\n word += chr(b)\r\n else:\r\n word += i\r\n b = 0\r\nelse:\r\n for i in w:\r\n if ord(i) < 123 and ord(i) > 90:\r\n b = ord(i) - 32\r\n word += chr(b)\r\n else:\r\n word += i\r\n b = 0\r\nprint(word)\r\n \r\n", "name=input()\r\nc=0\r\nfor i in name:\r\n if i==i.upper():\r\n c+=1\r\n elif i==i.lower():\r\n c-=1\r\nif c>0:\r\n name=name.upper()\r\nelif c<0:\r\n name=name.lower()\r\nelse:\r\n name=name.lower()\r\nprint(name)", "s = input()\r\nc = 0\r\nfor x in s:\r\n if x.isupper():\r\n c += 1\r\n\r\nif c > len(s) // 2:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)", "n=input()\r\ncount1=count2=0\r\nfor i in n:\r\n if i.isupper():\r\n count1+=1\r\n else:\r\n count2+=1\r\nif count1>count2:\r\n print(n.upper())\r\nelif count2>=count1:\r\n print(n.lower())\r\n", "word = input()\r\n\r\n# Count the number of uppercase and lowercase letters in the word\r\nupper_count = sum(1 for c in word if c.isupper())\r\nlower_count = sum(1 for c in word if c.islower())\r\n\r\n# If the word contains an equal number of uppercase and lowercase letters, convert all letters to lowercase\r\nif upper_count == lower_count:\r\n modified_word = word.lower()\r\n# If the word contains more uppercase letters, convert all letters to uppercase\r\nelif upper_count > lower_count:\r\n modified_word = word.upper()\r\n# If the word contains more lowercase letters, convert all letters to lowercase\r\nelse:\r\n modified_word = word.lower()\r\n\r\nprint(modified_word)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 6 12:47:38 2020\r\n\r\n@author: vananh\r\n\"\"\"\r\nd1=0\r\nd2=0\r\nx=input()\r\nfor i in x:\r\n if(ord(i)<=ord('z')and ord(i)>=ord('a')):\r\n d1+=1\r\n else:\r\n d2+=1\r\nif(d1>=d2):\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "x= input()\r\nc=0\r\nd=0\r\nfor i in x:\r\n if i == i.upper():\r\n c+=1\r\n else:\r\n d+=1\r\nif d>=c:\r\n print(x.lower())\r\nelse:\r\n print(x.upper())", "a = list(input())\r\nc = 0\r\nfor n in a:\r\n if n.isupper():\r\n c = c + 1\r\n b = \"\".join(a)\r\nif c > len(a) - c:\r\n print(b.upper())\r\nelse:\r\n print(b.lower())", "word, lowers = input(), 0\r\nfor char in word:\r\n if char.islower():\r\n lowers += 1\r\nprint(word.lower()) if lowers >= len(word) // 2 + len(word) % 2 else print(word.upper())", "# t=int(input())\r\n# for i in range(t):\r\n# n=int(input())\r\n# (ma=listap(int,input().split()))\r\n# w=a[0]\r\n# if(w==0):\r\n# print(0)\r\n# else:\r\n# d=w\r\n# for i in range(1,n):\r\n# d -=1\r\n# d+=a[i]\r\n# w+=a[i]\r\n# if(d==0):\r\n# break\r\n# print(t) \r\n \r\n# t=int(input())\r\n# for i in range(t):\r\n# x,y,n=map(int,input().split())\r\n# count=0\r\n# for i in range(n+1):\r\n# if((x^i)<(y^i)):\r\n# count+=1\r\n# print(count) \r\n# w=int(input())\r\n# flag=0\r\n# for i in range(1,w):\r\n# if((w-i)%2==0 and i%2==0):\r\n# flag=1\r\n# break\r\n# if(flag==1):\r\n# print(\"YES\")\r\n# else:\r\n# # print(\"NO\") \r\n# w=int(input())\r\n# if(w>2 and w%2==0):\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\") \r\n# n=int(input())\r\n# d={}\r\n# b=set()\r\n# for i in range(n):\r\n# c=input()\r\n# if c not in b:\r\n# d[c]=1\r\n# b.add(c)\r\n# print(\"OK\")\r\n# else:\r\n# print(c+str(d[c]))\r\n# d[c]+=1 \r\n# def factorial(N):\r\n# if(N==0 or N==1):\r\n# return 1\r\n# return(N*factorial(N-1))\r\n# N=int(input())\r\n# print(factorial(N)) \r\n# def dist(s): for finding the year which has no repeated element\r\n# s=str(s)\r\n# for i in range(len(s)):\r\n# for j in range(i + 1,len(s)): \r\n# if(s[i] == s[j]):\r\n# return False\r\n# return True\r\n# n=int(input())\r\n\r\n# while(True):\r\n# n=n+1\r\n# if(dist(n)==True):\r\n# print(n)\r\n# break\r\n# t=int(input())\r\n# for i in range(t):\r\n# n,k=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\n# d=max(a)+k\r\n# c=min(a)-k\r\n# e=d-c\r\n# print(e) \r\n# n=int(input())\r\n# for i in range(n):\r\n# n=input()\r\n# a=n[0]\r\n# b=n[-1]\r\n# c=len(n)\r\n# f=(c-2)\r\n# e=a+str(f)+b \r\n# if(c>10):\r\n# print(e)\r\n# else:\r\n# print(n)\r\n# n=int(input())\r\n# c=0\r\n# for i in range(n):\r\n# a=list(map(int,input().split()))\r\n# d=sum(a)\r\n# if(d>=2):\r\n# c+=1\r\n# print(c)\r\n# n,k=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\n# b=0\r\n# for i in range(len(a)):\r\n \r\n# if(a[i]==0):\r\n# # print(0)\r\n# b = b\r\n# elif(a[i]>=a[k-1]):\r\n# b+=1\r\n# # d=len(b) \r\n# print(b) \r\n# t=int(input())\r\n# for i in range(t):\r\n# n=input()\r\n# c=len(n) \r\n# print(c)\r\n# t=int(input())\r\n# for i in range(t):\r\n# x,y=map(int,input().split())\r\n# if(x==y):\r\n# x-=1\r\n# print(x,y)\r\n# elif(x>y):\r\n# x=x-1\r\n# y=y\r\n# print(x,y)\r\n# else:\r\n# y=y\r\n# x=x-1\r\n# print(x,y)\r\n# m,n=map(int,input().split())\r\n# d=m*n//2\r\n# print(d)\r\n# k,n,w=map(int,input().split())\r\n# d=0\r\n# for i in range(1,w+1):\r\n# d+=(k*i)\r\n# e=d-n\r\n# if(e>0):\r\n# print(e)\r\n# else:\r\n# print(0)\r\n# x=int(input())\r\n# d=x//5\r\n# e=x%5 \r\n# if(e==0):\r\n# print(d)\r\n# else:\r\n# print(d+1)\r\n# t=int(input())\r\n# x=0\r\n# for i in range(t):\r\n# a=input()\r\n# m=\"++X\"\r\n# o=\"X++\"\r\n# n=\"--X\"\r\n# p=\"X--\"\r\n# if(m in a or o in a):\r\n# x+=1\r\n# else:\r\n# x-=1\r\n# # print(x)\r\n# import math\r\n# n=int(input())\r\n# sum=0\r\n# for i in range(1,n+1):\r\n# sum=sum+(pow(-1,i)*i)\r\n# print(math.floor(sum)) \r\n# t=int(input())\r\n# for i in range(t):\r\n# a,b=map(int,input().split())\r\n# e=(a//2)*(b//2)\r\n# o=(a-(a//2))*(b-(b//2))\r\n# print(e+o) \r\n# for _ in range(int(input())):\r\n # n,m=map(int,input().split())\r\n # a=set(list(map(int,input().split())))\r\n\r\n# import math\r\n# t=int(input())\r\n# for i in range(t):\r\n# n,d=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\n# risk_count=0\r\n# for i in range(n):\r\n# if(a[i]>=80 or a[i]<=9):\r\n# risk_count+=1\r\n \r\n# print(math.ceil(risk_count/d)+math.ceil((n-risk_count)/d))\r\n# # d=len(a)-count \r\n# n=int(input())\r\n# for i in range(n):\r\n# a=list(map(int,input().split()))\r\n# c=sum(a)/n\r\n# print(format(c,\".12f\"))\r\n# d1,v1,d2,v2,p=map(int,input().split())\r\n# a=0\r\n# c=0\r\n# if(d1==d2 and d1==1):\r\n# while(a<p):\r\n# c+=1\r\n# a+=(v1+v2)\r\n# print(c)\r\n# else:\r\n# c=(min(d1,d2)-1)\r\n# while(a<p):\r\n# if(d1>d2):\r\n# a+=v2\r\n# d2+=1\r\n# elif(d2>d1):\r\n# a+=v1\r\n# d1+=1\r\n# elif(d1==d2):\r\n# a+=(v1+v2)\r\n# c+=1\r\n# print(c)\r\n# t=int(input())\r\n# for i in range(t):\r\n# n,k=map(int,input().split())\r\n# a=[]\r\n# for i in range(1,n+1):\r\n# a.append(i)\r\n# if(n%2==0):\r\n# for i in range(n):\r\n# if(i%2==0):\r\n# a[i]=-a[i]\r\n# else:\r\n# a[i]=+a[i]\r\n# else:\r\n# for i in range(n):\r\n# if(i%2==0):\r\n# a[i]=+a[i]\r\n# else:\r\n# a[i]=-a[i]\r\n# print(a)\r\n# sum=0\r\n# cnt=0\r\n# for i in range(n):\r\n# sum+=a[i]\r\n# if(sum>0):\r\n# cnt+=1\r\n# print(cnt)\r\n# if(cnt>k):\r\n# for i in range(n,-1,-2):\r\n# if(a[i]<0):\r\n# a[i]=-a[i]\r\n# else:\r\n# a[i]=-a[i] \r\n# cnt-=1\r\n# # print(a)\r\n# elif(cnt<k):\r\n# for i in range(n):\r\n# if(a[i]>0):\r\n# a[i]=-a[i]\r\n# else:\r\n# a[i]=-a[i]\r\n# cnt+=1\r\n# elif(cnt==k):\r\n# break \r\n# print(a) \r\n# a=input()\r\n# b=input()\r\n# def solve(a,b):\r\n# a=a.lower()\r\n# b=b.lower()\r\n# c=0\r\n# for i in range(len(a)):\r\n# if(a[i]>b[i]):\r\n# return 1\r\n# elif(a[i]<b[i]):\r\n# return -1\r\n# else:\r\n# c+=1\r\n# if(c==len(a)):\r\n# return 0\r\n# print(solve(a,b))\r\n# n=int(input())\r\n# a=list(map(int,input().split()))\r\n# sum=0\r\n# for i in range(n):\r\n# sum=sum+a[i]\r\n# c=sum/n\r\n# print(c)\r\n# a=int(input())\r\n# if(a%2==0):\r\n# d=a//2\r\n# print(d)\r\n# else:\r\n# e=-((a//2)+1)\r\n# print(e)\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\n# a=input()\r\n# x=\"trygub\"\r\n# b=set(x)\r\n# arr=[0]*256\r\n# i=0\r\n# while(a and i<len(a)):\r\n# if a[i] in b:\r\n# arr[ord(a[i])]+=1\r\n# a=a[:i]+a[i+1:]\r\n# else:\r\n# i+=1\r\n \r\n# y=\"bugryt\"\r\n# for i in y:\r\n# a+=i*arr[ord(i)]\r\n# print(a)\r\n# n=input()\r\n# a=list(n.split('+'))\r\n# # print(a)\r\n# a.sort()\r\n# # print(a)\r\n# print(\"+\".join(a))\r\n# n=input()\r\n# a=n[0]\r\n# a=a.capitalize()\r\n# b=n[1:]\r\n# # print(b)\r\n# c=a+b\r\n# print(c)\r\n# A=list(map(int,input().split()))\r\n# N=len(A)\r\n# def leaders(A,N):\r\n# for i in range(N):\r\n# flag=0\r\n# j=i+1\r\n# for j in range(N):\r\n# if(A[i]<=A[j]):\r\n# flag=1\r\n# break\r\n# if(flag==0):\r\n# print(A[i])\r\n# print(leaders(A,N)) \r\n# a=input()\r\n# b=set(a)\r\n# # print(b)\r\n# if(len(b)%2==0):\r\n# print(\"CHAT WITH HER!\")\r\n# else:\r\n# print(\"IGNORE HIM!\") \r\n# n=int(input())\r\n# s=input()\r\n# c=0\r\n# for i in range(1,n):\r\n# if(s[i]==s[i-1]):\r\n# c+=1\r\n# print(c)\r\n# def kthSmallest(A, n, k): \r\n# A.sort() \r\n# return A[k-1] \r\n# A=list(map(int,input().split()))\r\n# n = len(A) \r\n# k = int(input())\r\n# print(\"K'th smallest element is\",kthSmallest(A, n, k))\r\n# a=[4,3,1,2]\r\n# d=3\r\n# b=list(a) \r\n# c=a[d:]+a[:d]\r\n# print(c)\r\n# t=int(input())\r\n# for i in range(t):\r\n# n=int(input())\r\n# a=list(map(int,input().split()))\r\n # arr=[]\r\n # low=0\r\n # high=n-1\r\n # while(low<=high):\r\n # arr.append(a[low])\r\n # arr.append(a[high])\r\n # low=low+1\r\n # high=high-1\r\n # print(*arr[:n]) \r\n# t=int(input())\r\n# for i in range(t):\r\n# n=int(input())\r\n# a=input()\r\n# if (a[0]=='2'and a[-3:]=='020')or(a[:2]=='20' and a[-2:]=='20'):\r\n# print(\"YES\")\r\n# elif (a[:3]=='202' and a[-1]=='0')or a[:4]=='2020'or a[-4:]=='2020':\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\") \r\n # if(s==2020):\r\n # print(\"YES\")\r\n # elif(s.count(2)>2 and s.count(0)>2):\r\n # print(\"YES\")\r\n # else:\r\n # print(\"NO\")\r\n# temparray=[1,2,3,4,5,6,7,8,9,19,29,39,49,59,69,79,89,189,289,389,489,589,689,789,1789,2789,3789,4789,5789,6789,16789,26789,36789,46789,56789,156789,256789,356789,456789,1456789,2456789,3456789,13456789,23456789,123456789,-1,-1,-1,-1,-1,-1]\r\n# t=int(input())\r\n# for i in range(t):\r\n# n=int(input())\r\n# c=temparray[n-1]\r\n# print(c)\r\n##########-----majority element\r\n \r\n \r\n# def majorityElement(A,N):\r\n# m = -1\r\n# i = 0\r\n# for j in range(N):\r\n# if i == 0:\r\n# m = A[j]\r\n# i = 1\r\n# elif m == A[j]:\r\n# i = i + 1\r\n# else:\r\n# i = i - 1\r\n# return m\r\n# def majorityElement(A,N):\r\n# for i in range(N):\r\n# count = 1\r\n# for j in range(N):\r\n# if (A[j] == A[i]):\r\n# count+=1\r\n# if (count > N//2):\r\n# return A[i]\r\n# return -1 \r\n# N=int(input())\r\n# A=list(map(int,input().split())) \r\n# print(majorityElement(A,N))\r\n\r\n# from collections import Counter\r\n# def majorityElement(a,n):\r\n# x=Counter(a)\r\n# return x\r\n# print(majorityElement([2,3,4,2,1,3],2))\r\n \r\n\r\n\r\n# import itertools\r\n# t=int(input()) \r\n# for _ in range(t):\r\n# n=int(input())\r\n# a=input()\r\n# b=input()\r\n# if a==b:\r\n# print(\"EQUAL\")\r\n# else:\r\n# x=(list(itertools.permutations(a,n)))\r\n# y=(list(itertools.permutations(b,n)))\r\n# cx=cy=0\r\n# # print(len(xx))\r\n# for i in range(len(x)):\r\n# if x[i]>y[i]:\r\n# cx+=1\r\n# else:\r\n# cy+=1\r\n# # print(cx,cy)\r\n# if cx>cy:\r\n# print(\"RED\")\r\n# elif(cx<cy):\r\n# print(\"BLUE\")\r\n# else:\r\n# print(\"EQUAL\")\r\n# t=int(input())\r\n# for i in range(t):\r\n# n=int(input())\r\n# w=input()\r\n# a=0\r\n# for i in range(n-1,-1,-1):\r\n# if(w[i]!=')'):\r\n# break\r\n# a+=1\r\n# if(a>(n-a)):\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n# t=int(input())\r\n# for i in range(t):\r\n# n=int(input())\r\n# while(True):\r\n# a=str(n)\r\n# a=set(a)\r\n# l=len(a)\r\n# c=0\r\n# for i in a:\r\n# if(i!='0' and n%int(i)!=0):\r\n# break\r\n# c+=1\r\n# if(c==l):\r\n# print(n)\r\n# break\r\n# n+=1\r\n# t=int(input())\r\n# for i in range(t):\r\n# n=input()\r\n# a=n.count(\"(\")\r\n# b=n.count(\")\")\r\n# d=n.count(\"?\")\r\n# if(a==b and d==0):\r\n# print(\"YES\")\r\n# elif(n[0]==\")\"):\r\n# print(\"NO\")\r\n# elif((a+b)==d):\r\n# print(\"yes\")\r\n# else:\r\n# print(\"NO\") \r\ns= input()\r\nupper=0\r\nlower=0\r\nfor i in range(len(s)):\r\n #to lower case letter\r\n if(s[i]>='a' and s[i]<='z'):\r\n lower+=1\r\n #to upper case letter\r\n elif(s[i]>='A' and s[i]<='Z'):\r\n upper+=1\r\nif(lower>upper or lower==upper):\r\n s=s.lower()\r\nelif(lower<upper):\r\n s=s.upper()\r\nelse:\r\n s.lower\r\nprint(s) \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\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\nl=list(s)\r\nc=0\r\nd=0\r\nfor i in l:\r\n if(i.islower()):\r\n c=c+1\r\n elif(i.isupper()):\r\n d=d+1\r\nif c>d:\r\n print(s.lower())\r\nelif d>c:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "#59A\r\nstr = input()\r\nn =str.upper()\r\nup=0\r\nfor i in range(len(str)):\r\n if str[i] == n[i]: \r\n up =up+1\r\nif up > len(str) / 2:\r\n print(str.upper())\r\nelse:\r\n print(str.lower())", "s = input()\r\nhc=0\r\nl = len(s)\r\nfor i in range(l):\r\n if s[i].isupper():\r\n hc+=1\r\nif hc>l//2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\nl = 0\nu = 0\nfor i in s:\n if i.isupper():\n u+=1\n else:\n l+=1\n\nif l>=u:\n print(s.casefold())\nelse:\n print(s.upper())", "string = input()\nlower = sum(map(str.islower, string))\nif len(string)-lower > len(string)/2:\n print(string.upper())\nelse:\n print(string.lower())\n", "s = list(str(input()))\r\na = 0 #up\r\nb = 0 #down\r\nfor i in range(len(s)):\r\n if str(s[i]).isupper(): a +=1\r\n else: b +=1\r\nif a > b:\r\n for i in range(len(s)):\r\n print(str(s[i]).upper(), end ='')\r\nelif a < b:\r\n for i in range(len(s)):\r\n print(str(s[i]).lower(), end='')\r\nelse:\r\n for i in range(len(s)):\r\n print(str(s[i]).lower(), end='')", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-09-05 00:06:52\r\n:)\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = input().strip()\r\ncnt1, cnt2 = 0, 0\r\nfor c in s:\r\n if c >= 'A' and c <= 'Z':\r\n cnt1 += 1\r\n else:\r\n cnt2 += 1\r\nprint(s.upper() if cnt1 > cnt2 else s.lower())\r\n", "theWord = input()\r\n \r\nuppercaseCount = sum(1 for char in theWord if char.isupper())\r\nlowercaseCount = len(theWord) - uppercaseCount\r\n \r\nif uppercaseCount > lowercaseCount:\r\n correctedWord = theWord.upper()\r\nelse:\r\n correctedWord = theWord.lower()\r\n \r\nprint(correctedWord)", "s = str(input())\r\nc1 = 0\r\nfor cur in s:\r\n if cur.isupper():\r\n c1 += 1\r\n \r\n \r\nc2 = 0\r\nfor cur in s:\r\n if cur.islower():\r\n c2 += 1\r\n \r\n \r\nif c1 > c2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "string=str(input())\r\ncount=0\r\nsount=0\r\nfor i in range(len(string)):\r\n if ord(string[i])<91:\r\n count+=1\r\n else:\r\n sount+=1\r\nif count>sount:\r\n print(string.upper())\r\nelif count<sount:\r\n print(string.lower())\r\nelif count==sount:\r\n print(string.lower())", "# Nivel de complejidad O(n)\ns = input()\n\nupper_count = sum(1 for char in s if char.isupper())\nlower_count = len(s) - upper_count\n\nif upper_count > lower_count:\n print(s.upper())\nelse:\n print(s.lower())\n \t\t\t \t \t\t \t \t\t \t\t \t\t\t", "\r\nword = input()\r\nl=0\r\nh=0\r\nfor i in word:\r\n if (i.islower()):\r\n l+=1\r\n else:\r\n h+=1\r\nif(l>=h):\r\n print(word.lower())\r\nelse:\r\n print(word.upper())\r\n", "word=input('')\r\nupper=0\r\nlower=0\r\nfor x in word :\r\n if x >= \"A\" and x <= \"Z\":\r\n upper+=1\r\n elif x >=\"a\" and x<=\"z\":\r\n lower+=1\r\nif lower >= upper :\r\n print(word.lower())\r\nelse:\r\n print(word.upper()) \r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nx=input()\r\nb=0\r\ns=0\r\nl=[]\r\nfor i in range(len(x)):\r\n\tl.append(x[i])\t\r\n\t\r\nfor i in l:\r\n\tif (i.isupper()):\r\n\t\tb+=1\r\n\telse:\r\n\t\ts+=1\r\n\r\nfor i in range(len(l)):\r\n\tif(b>s):\r\n\t\tif(l[i].islower()):\r\n\t\t\tp=ord(l[i])-32\r\n\t\t\tl[i]=chr(p)\r\n\telse:\r\n\t\tif(l[i].isupper()):\r\n\t\t\tq=ord(l[i])+32\r\n\t\t\tl[i]=chr(q)\r\ng=''.join(l)\r\nprint(g)\t\t\t\t\t\r\n\r\n\r\n\r\n\t\t\r\n\r\n", "s = input()\n\nlow = len(list(i for i in s if i.islower()))\nup = len(list(i for i in s if i.isupper()))\n\nif low >= up:\n print(s.lower())\nelse:\n print(s.upper())\n", "s = input()\r\nm = 0\r\nfor i in range(len(s)):\r\n if s[i]==s[i].lower():\r\n m+=1\r\nb = len(s)-m\r\nif b>m:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a = input()\r\nword = list(a)\r\ncap_count = 0\r\nsmall_count = 0\r\nfor letter in word:\r\n if letter <= 'Z':\r\n cap_count += 1\r\n else:\r\n small_count += 1\r\n\r\nif cap_count > small_count:\r\n answer = a.upper()\r\nelse:\r\n answer = a.lower()\r\nprint(answer)\r\n", "s = input() # Input word containing uppercase and lowercase letters\r\nuppercase_count = sum(1 for char in s if char.isupper())\r\nlowercase_count = len(s) - uppercase_count\r\nif uppercase_count > lowercase_count:\r\n print(s.upper())\r\nelse:\r\n print( s.lower())\r\n", "z =input()\r\nx=0\r\nc=0\r\nfor i in z:\r\n\tif i.isupper():\r\n\t\tx+=1\r\n\telse:\r\n\t\tc+=1\r\nif x>c:\r\n\tprint(z.upper())\r\nelif c>x:\r\n\tprint(z.lower())\r\nelse:\r\n\tprint(z.lower())\r\n", "net=input();print([net.lower(),net.upper()][sum(x<'[' for x in net)*2>len(net)])", "s = input()\r\ncu = 0\r\ncl = 0\r\nfor i in s:\r\n if i.isupper():\r\n cu+=1\r\n else:\r\n cl+=1 \r\nif cu>cl:\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "ch = input()\r\na = 0\r\nb = 0\r\nfor i in ch:\r\n if i.islower():\r\n a += 1\r\n else:\r\n b += 1\r\n\r\nif a >= b:\r\n print(ch.lower())\r\nelse:\r\n print(ch.upper())\r\n", "elo = input()\r\nmale = 0\r\nduze = 0\r\nfor i in elo:\r\n if i.isupper() is True:duze = duze + 1\r\n elif i.islower() is True:male = male + 1\r\nif male > duze:print(elo.lower())\r\nelif male < duze:print(elo.upper()) \r\nelse:print(elo.lower())", "import re\r\nn = input()\r\ncount = len(re.findall(\"[A-Z]\",n))\r\nif count >len(n)-count:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n", "t=input()\r\nu=0\r\nl=0\r\nfor i in range(len(t)):\r\n if t[i]==t[i].upper():\r\n u+=1\r\n else:\r\n l+=1\r\nif(l>=u):\r\n t=t.lower()\r\nelse:\r\n t=t.upper()\r\nprint(t)", "w=input()\r\nn=list(w)\r\nupper=[]\r\nlower=[]\r\nk=0\r\ny=0\r\nfor i in range(65,91):\r\n upper.append(chr(i))\r\nfor j in range(97,123):\r\n lower.append(chr(j))\r\nfor l in n:\r\n if l in upper:\r\n k+=1\r\n if l in lower:\r\n y+=1\r\nif y>=k:\r\n print(w.lower())\r\nelse:\r\n print(w.upper())", "s = input()\r\nlowers, uppers = 0, 0\r\n\r\nfor letter in s:\r\n\tif(letter.isupper()):\r\n\t\tuppers += 1\r\n\telse:\r\n\t\tlowers += 1\r\n\r\nif(uppers > lowers):\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())", "word = input()\r\nn = len(word)\r\nupper = lower = 0\r\nfor i in range(n):\r\n if word[i].isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n\r\nif lower >= upper:\r\n word = word.lower()\r\nelse:\r\n word = word.upper()\r\n\r\nprint(word)", "s = input()\r\nl = []\r\nsmall = 0\r\nbig = 0\r\nword = \"\"\r\nfor i in s:\r\n l.append(i)\r\nfor i in range(len(l)):\r\n if l[i].islower():\r\n small += 1\r\n else:\r\n big += 1\r\n\r\nif big > small:\r\n for i in range(len(l)):\r\n l[i] = l[i].upper()\r\nelse:\r\n for i in range(len(l)):\r\n l[i] = l[i].lower()\r\nfor i in l:\r\n word += i\r\nprint(word)", "c=(input())\r\ncount=0\r\nfor i in c:\r\n\tif(i.islower()):\r\n\t\tcount+=1\r\nif(2*count>=len(c)):\r\n\tprint(c.lower())\r\nelse:\r\n\tprint(c.upper())", "a = input()\r\ncurr = 0\r\nfor c in a:\r\n if c == c.lower():\r\n curr -= 1\r\n else:\r\n curr += 1\r\nif curr > 0:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())", "s = input()\r\nx = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n x += 1\r\n\r\nif len(s) - x <= len(s) / 2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n", "s=input()\r\nu=0\r\nl=0\r\n\r\nfor i in range(0,len(s)):\r\n if(s[i].isupper()):\r\n u=u+1\r\n else:\r\n l=l+1\r\nif(u>l):\r\n x=s.upper()\r\nelse:\r\n x=s.lower()\r\nprint(x)\r\n ", "#LOWER 65-90\r\n#UPPER 97-122\r\nstring = input()\r\nlowers = int('0')\r\nuppers = int('0')\r\nfor i in string :\r\n if(ord(i) > 96) :\r\n lowers+=1\r\n else :\r\n uppers+=1\r\nif(lowers >= uppers) :\r\n print(string.lower())\r\nelse :\r\n print(string.upper())\r\n", "upper, lower = [0, 0]\r\nstring = input()\r\nfor s in string:\r\n if s.isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\nif upper > lower:\r\n print(string.upper())\r\nelse:\r\n print(string.lower())", "n = input()\r\na= 0\r\nb =0\r\nfor i in n:\r\n if i.islower():\r\n a += 1\r\n else:\r\n b += 1\r\nif a >= b:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "str1=input()\r\ns1=0\r\ns2=0\r\nfor i in str1:\r\n if i>='A' and i<='Z':\r\n s1=s1+1\r\n elif i>='a' and i<='z':\r\n s2=s2+1\r\nif s1>s2:\r\n print(str1.upper())\r\nelse:\r\n print(str1.lower())\r\n ", "s=input()\r\nca=0\r\ncb=0\r\nl=len(s)\r\nfor i in s:\r\n if i.isupper():\r\n ca=ca+1\r\n else:\r\n cb=cb+1\r\nif ca>cb:\r\n y=s.upper()\r\nelse:\r\n y=s.lower()\r\nprint(y)", "f=0;d=0\r\nc=input()\r\nfor i in c:\r\n if i ==i.upper():\r\n f+=1\r\n elif i==i.lower():\r\n d+=1\r\nif (f>d):\r\n print(c.upper())\r\nelse:\r\n print(c.lower())", "s = input()\r\nprint([s.upper(), s.lower()][sum(1 for s in s if s.isupper())<=sum(1 for s in s if s.islower())])", "s = input()\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == s[i].lower():\r\n lowercase += 1\r\n elif s[i] == s[i].upper():\r\n uppercase += 1\r\n \r\nif lowercase >= uppercase:\r\n print(s.lower())\r\nelif uppercase > lowercase:\r\n print(s.upper())", "s = input()\r\nu=[]\r\nl=[]\r\nfor i in range(len(s)):\r\n if s[i].islower()==True:\r\n l.append(s[i])\r\n else:\r\n u.append(s[i])\r\nif len(u)>len(l):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "s = input()\r\ncount = 0\r\ncount1 = 0\r\nfor i in s:\r\n if i.isupper():\r\n count = count + 1\r\nfor i in s:\r\n if i.islower():\r\n count1 = count1 + 1\r\nif count > count1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n", "s = input()\r\na = []\r\nfor char in s:\r\n if char in \"abcdefghijklmnopqrstuvwxyz\":\r\n pass\r\n else:\r\n a.append(char)\r\n\r\nif len(a) > len(s) // 2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "a=input()\r\nc=0\r\ns=\"\"\r\nfor i in a:\r\n if i.isupper():\r\n c+=1\r\nd=int(len(a)/2)\r\nif c>d:\r\n for i in a:\r\n if i.islower():\r\n s+=i.upper()\r\n else:\r\n s+=i\r\nelse:\r\n for i in a:\r\n if i.isupper():\r\n s+=i.lower()\r\n else:\r\n s+=i\r\nprint(s)", "s=input()\r\nc = c1 =0\r\nfor i in s:\r\n if(i.isupper()):\r\n c += 1\r\n else:\r\n c1+=1\r\nif c>c1:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "n=input()\r\ncount=0\r\nsum=0\r\nfor i in n:\r\n if i==i.lower():\r\n count+=1\r\n elif i==i.upper():\r\n sum+=1\r\nif count>=sum:\r\n print(n.lower())\r\nelse:\r\n print(n.upper())", "n = input()\r\nm = 0 \r\nl= 0 \r\nfor i in n :\r\n if i.isupper() : \r\n m+=1 \r\n if i.islower() : \r\n l+=1 \r\nif m > l : \r\n print(n.upper())\r\nelif m == l or l > m : \r\n print(n.lower())", "s=input()\r\nu,l=0,0\r\nfor c in s:\r\n if ord(c)<=90:\r\n u+=1\r\n else:\r\n l+=1\r\nprint(s.lower() if l>=u else s.upper())", "ch=input()\r\nl=['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','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\ni=0;\r\nfor c in ch :\r\n if l.index(c) <26:\r\n i+=1\r\nif i>(len(ch)//2):\r\n ch=ch.upper()\r\nelse :\r\n ch=ch.lower()\r\nprint(ch)\r\n", "def sol():\r\n s = input()\r\n be_small = 0\r\n be_capital = 0\r\n for i in s:\r\n if i.isupper():\r\n be_capital +=1\r\n else:\r\n be_small += 1\r\n if be_capital > be_small:\r\n return s.upper()\r\n else:\r\n return s.lower()\r\nprint(sol())", "s = input()\nsl = s.lower()\nsu = s.upper()\nl = 0\nu = 0\ne = len(s)\nfor i in range(e):\n if sl[i] == s[i]:\n l += 1\n if su[i] == s[i]:\n u += 1\n\nif u > l:\n print(su)\nelse :\n print(sl)", "from string import *\n\nS = input()\n\nl = 0\nfor letter in S:\n if letter.islower():\n l += 1\n\nu = len(S) - l\n\nif l >= u:\n print(S.lower())\nelse:\n print(S.upper())\n", "word = input()\r\nmi=0\r\nma=0\r\nfor i in word:\r\n if i.isupper():\r\n ma = ma + 1\r\n else:\r\n mi = mi + 1\r\nif mi<ma:\r\n print(word.upper())\r\nelse:\r\n print(word.lower())", "input = input()\r\n\r\nlowercase_count = 0\r\nuppercase_count = 0\r\nfor letter in input:\r\n if letter in 'abcdefghijklmnopqrstuvwxyz':\r\n lowercase_count = lowercase_count + 1\r\n else:\r\n uppercase_count = uppercase_count + 1\r\nif uppercase_count > lowercase_count:\r\n print(input.upper())\r\nelse:\r\n print(input.lower())\r\n", "s=input()\r\nlow=0\r\nup=0\r\nfor i in s:\r\n if i.isupper():\r\n up+=1\r\n else:\r\n low+=1\r\nif(up<=low):\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "n=input()\r\nlower,upper=0,0\r\nfor i in range(len(n)):\r\n if n[i].isupper():\r\n upper +=1\r\n else:\r\n if n[i].islower():\r\n lower += 1\r\nif lower>upper:\r\n print(n.lower())\r\nelif upper> lower:\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\r\n ", "s=input()\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nb=a.upper()\r\nd=0\r\nt=0\r\nfor i in range(len(a)):\r\n d=d+s.count(a[i])\r\nfor i in range(len(b)):\r\n t=t+s.count(b[i])\r\nif t>d :\r\n print(s.upper())\r\nelse:\r\n print(s.lower()) ", "s = input()\r\nc1, c2 = 0, 0\r\nfor letter in s:\r\n if letter.islower():\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 >= c2:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "s = input()\r\ncount = 0\r\n\r\nfor c in s:\r\n\tif c == c.upper():\r\n\t\tcount = count + 1\r\n\r\nif count > len(s) - count:\r\n\tprint(s.upper())\r\n\r\nelse:\r\n\tprint(s.lower())\r\n", "s=input()\r\nc=0\r\nfor i in s:\r\n if(i.isupper()):\r\n c=c+1\r\n else:\r\n c=c-1\r\nprint(s.upper()) if(c>0) else print(s.lower())", "user_input = input()\r\n\r\n\r\nlower_case = [x for x in user_input if x.islower()]\r\nupper_case = [x for x in user_input if x.isupper()]\r\n\r\nif len(lower_case) > len(upper_case):\r\n print(user_input.lower())\r\nif len(lower_case) < len(upper_case):\r\n print(user_input.upper())\r\nif len(lower_case) == len(upper_case):\r\n print(user_input.lower())\r\n\r\n", "# Read in a single word\r\nw = input()\r\n\r\n# Count number of upper case letters\r\nupper = 0\r\nfor c in w:\r\n\tif c.isupper():\r\n\t\tupper += 1\r\n\r\n# If number of uppercase letters is more than half of the length of the word, print word in uppercase\r\nif upper > len(w) // 2:\r\n\tprint(w.upper())\r\nelse:\r\n\tprint(w.lower())", "m=input()\r\nn=list(m)\r\nc=0\r\nd=0\r\nfor i in n:\r\n if(i.islower()):\r\n c=c+1\r\n elif(i.isupper()):\r\n d=d+1\r\n\r\nif(c>=d):\r\n print(m.lower())\r\nelse:\r\n print(m.upper())\r\n", "n = input()\r\n\r\ncountU = 0\r\ncountL = 0\r\nfor i in n:\r\n if i.isupper(): countU += 1\r\n elif i.islower(): countL += 1\r\n\r\nif countL > countU:\r\n str = n.lower()\r\nelif countL < countU:\r\n str = n.upper()\r\nelif countL == countU:\r\n str = n.lower()\r\n\r\nprint(str)", "s=str(input())\r\nx,y=0,0\r\nfor i in s:\r\n if i.islower(): x+=1\r\n else: y+=1\r\nif x>=y:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())", "S = input()\r\nL, U = 0, 0\r\nfor j in S:\r\n if j.islower(): L+=1\r\n else: U+=1\r\nif U>L: print(S.upper())\r\nelse: print(S.lower())\r\n", "s=input()\r\ncountc=0\r\ncounts=0\r\nfor i in s:\r\n if(ord(i)>=97 and ord(i)<=122):\r\n counts+=1\r\n elif(ord(i)>=65 and ord(i)<=90):\r\n countc+=1\r\nif(countc>counts):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())", "str1 = input()\r\nupperc = 0\r\nlowerc = 0\r\nfor i in range(len(str1)):\r\n if str1[i].isupper():\r\n upperc += 1\r\n else:\r\n lowerc += 1\r\nif upperc > lowerc:\r\n a = str1.upper()\r\nelif upperc < lowerc:\r\n a = str1.lower()\r\nelif upperc == lowerc:\r\n a = str1.lower()\r\nprint(a)\r\n", "str = input()\n\ndef only_upper(s):\n upper_chars = \"\"\n for char in s:\n if char.isupper():\n upper_chars += char\n return upper_chars\n\nupper_chars = only_upper(str)\n\nif((len(str) - len(upper_chars)) < len(upper_chars)):\n print(str.upper())\nelse:\n print(str.lower())\n\n\t\t\t \t\t \t\t \t \t \t \t\t\t \t\t", "s = input()\r\n\r\nuppercount = 0\r\nlowercount = 0\r\n\r\nfor i in range(len(s)):\r\n if(s[i].isupper() == True):\r\n uppercount = uppercount + 1\r\n else:\r\n lowercount = lowercount + 1\r\n\r\nif(uppercount>lowercount):\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n ", "user = input()\r\ncount_upper = 0\r\ncount_lower = 0\r\nfor i in user:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n count_upper += 1\r\n elif ord(i) >= 97 and ord(i) <= 122:\r\n count_lower += 1\r\nif count_upper > count_lower:\r\n print(user.upper())\r\nelse:\r\n print(user.lower())", "s = input()\r\ncnt_lower = 0\r\nfor el in s:\r\n if el.islower():\r\n cnt_lower += 1\r\nif cnt_lower >= len(s) - cnt_lower:\r\n for el in s:\r\n print(el.lower(), end='')\r\nelse:\r\n for el in s:\r\n print(el.upper(), end='')", "s = str(input())\r\n\r\nlower_case_count = 0\r\nupper_case_count = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n lower_case_count += 1\r\n else:\r\n upper_case_count += 1\r\n\r\nif lower_case_count > upper_case_count:\r\n s = s.lower()\r\nelif lower_case_count < upper_case_count:\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)\r\n", "a=input()\r\nc=0\r\nfor i in a:\r\n if i.isupper():\r\n c+=1\r\ns=abs(len(a)-c)\r\nif(s>=c):\r\n print(a.lower())\r\nelse:\r\n print(a.upper())", "p=input()\r\nu=0;l=0\r\nfor x in p:\r\n if (x.islower()):\r\n l=l+1\r\n else:\r\n u=u+1\r\nprint(p.lower()) if l>=u else print(p.upper())" ]

[ "from collections import deque\r\n\r\n__author__ = 'asmn'\r\n\r\nn = int(input())\r\nend = tuple(sorted(map(lambda x: int(x) - 1, input().split())))\r\nst = (0, 1, 2)\r\nmat = [input() for i in range(n)]\r\nv = set([st])\r\npath = {}\r\ndist = {st: 0}\r\nqueue = deque([st])\r\n\r\nwhile end not in v and len(queue) > 0:\r\n p = queue.popleft()\r\n\r\n for x in range(-2, 1):\r\n p1, p2, p3 = p[x], p[x + 1], p[x + 2]\r\n for i in range(n):\r\n if i not in (p1, p2, p3) and mat[i][p3] == mat[p1][p2]:\r\n np = tuple(sorted((p1, p2, i)))\r\n if np not in v:\r\n v.add(np)\r\n queue.append(np)\r\n path[np] = p\r\n dist[np] = dist[p] + 1\r\n\r\n\r\ndef pathinfo(fr, to):\r\n return str((set(fr) - set(to)).pop() + 1) + ' ' + str((set(to) - set(fr)).pop() + 1)\r\n\r\n\r\nif end not in dist:\r\n print(-1)\r\n exit()\r\n\r\nprint(dist[end])\r\nwhile end in path:\r\n print(pathinfo(end, path[end]))\r\n end = path[end]" ]

[ "import bisect\r\nimport collections\r\nimport math\r\nimport os\r\nimport sys\r\n\r\n# input = sys.stdin.buffer.readline\r\n\r\n# t = int(input())\r\n# n, m = map(int, input().split())\r\n# A = list(map(int, input().split()))\r\n# grid = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nn, d = map(int, input().split())\r\ndp = [[-1]*501 for _ in range(30001)]\r\ngem_cnt = [0] * 30001\r\nfor _ in range(n):\r\n gem_cnt[int(input())] += 1\r\ndp[d][250] = gem_cnt[d]\r\n\r\nret = 0\r\nfor i in range(d, 30001):\r\n for j in range(501):\r\n if dp[i][j] == -1: continue\r\n\r\n for k in [-1, 0, 1]:\r\n jj = j + k\r\n ii = i + jj - 250 + d\r\n if i < ii <= 30000:\r\n dp[ii][jj] = max(dp[i][j] + gem_cnt[ii], dp[ii][jj])\r\n\r\n ret = max(ret, dp[i][j])\r\nprint(ret)", "n,d = map(int,input().split())\r\n\r\nN = 300*100\r\nM = 500\r\nvalue = [0 for i in range(N+1)]\r\nfor i in range(n):\r\n x = input()\r\n x = int(x)\r\n value[x] +=1 \r\nl = [[ -1 for i in range(M+1)] for _ in range(N+1)]\r\n#orig jump = j , index=j-d+250\r\n#index = j , orig = j+d-250\r\n\r\nmaxi = 0\r\nl[d][250] = value[d]\r\nfor i in range(d,N+1):\r\n for j in range(0,M+1):\r\n if l[i][j]==-1:\r\n continue\r\n ii = i+j+d-250\r\n temp = [-1,0,1]\r\n for a in temp:\r\n x = ii+a\r\n jj = j+a\r\n if(x<=N and x>i):\r\n l[x][jj] = max(l[x][jj],l[i][j] + value[x])\r\n maxi = max(maxi,l[i][j])\r\nprint(maxi)\r\n", "from collections import defaultdict, Counter\r\n# import threading\r\n# import sys\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n # think first code later dorime\r\n n, d = rl()\r\n g = [ri() for _ in range(n)]\r\n gem = [0]*(30001)\r\n for i in g:\r\n gem[i] += 1\r\n dp = [[-1]*501 for _ in range(30001)]\r\n dp[d][250] = gem[d]\r\n res = 0\r\n for i in range(d, 30001):\r\n for j in range(501):\r\n if dp[i][j] == -1:\r\n continue\r\n for k in [-1, 0, 1]:\r\n jj = j+k\r\n ii = i+jj-250+d\r\n if i < ii < 30001:\r\n dp[ii][jj] = max(dp[i][j]+gem[ii], dp[ii][jj])\r\n res = max(res, dp[i][j])\r\n print(res)\r\n\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "import sys\r\nimport time\r\nfrom collections import defaultdict\r\nmaxn=30000\r\ninput = lambda: sys.stdin.buffer.readline().strip().decode()\r\nn, d = (int(a) for a in input().split())\r\ngems=defaultdict(int)\r\nfor i in range(n):\r\n island=int(input())\r\n gems[island]+=1\r\n if i==n-1:\r\n maxisland=island\r\noffset=250\r\ndp=[[-1]*(offset*2+1) for _ in range(maxn+1)]\r\ndp[d][offset]=gems[d]\r\nmostgems=0\r\nfor i in range(d, maxn+1):\r\n dp_i=dp[i]\r\n for j in range(offset*2+1):\r\n if dp_i[j]==-1:\r\n continue\r\n for k in range(-1, 2, 1):\r\n y=j+k\r\n x=d+(i+y-250)\r\n if x<=maxn:\r\n dp[x][y]=max(dp[x][y], dp_i[j]+gems[x])\r\n if dp_i[j]>mostgems:\r\n mostgems=dp_i[j]\r\nprint(mostgems)", "import sys\r\ninput=sys.stdin.readline\r\nn,d=map(int,input().split())\r\np=[int(input()) for i in range(n)]\r\nN=30000\r\nM=500\r\ncnt=[0]*(N+1)\r\nfor pp in p:\r\n cnt[pp]+=1\r\ndp=[[-1]*(M+1) for i in range(N+1)]\r\ndp[d][250]=cnt[d]\r\nans=0\r\nfor i in range(d,N+1):\r\n for j in range(M+1):\r\n if dp[i][j]==-1:\r\n continue\r\n idx=i+j+d-250\r\n k=[-1,0,1]\r\n for kk in k:\r\n if i<idx+kk<=N:\r\n dp[idx+kk][j+kk]=max(dp[idx+kk][j+kk],dp[i][j]+cnt[idx+kk])\r\n ans=max(ans,dp[i][j])\r\nprint(ans)", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nimport os\r\nfrom io import BytesIO, IOBase\r\ninput = sys.stdin.readline\r\ndef solve():\r\n \r\n n,d=list(map(int, input().split()))\r\n N=30005;M=501\r\n co=collections.defaultdict(int )\r\n for i in range(n):co[int(input())]+=1\r\n dp=[[-1]*M for _ in range(N)]\r\n dp[d][250]=co[d]\r\n mx=0\r\n for c in range(d,N):\r\n for l in range(M):\r\n if dp[c][l]==-1:continue\r\n for a in [1,0,-1]:\r\n x=c+l-250+a+d\r\n y=l+a\r\n if 0<=x<N and 0<=y<M:\r\n dp[x][y]=max(dp[x][y],dp[c][l]+co[x])\r\n mx=max(dp[c][l],mx)\r\n\r\n print(mx) \r\n\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n solve()\r\n\r\n\r\n" ]

[ "n = int(input())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif 1 in a or 1 in b:\r\n\tprint(-1)\r\nelse:\r\n\tt = m/(b[0]-1)\r\n\tfor i in range(n-1, 0, -1):\r\n\t\tt += (t+m)/(a[i]-1)\r\n\t\tt += (t+m)/(b[i]-1)\r\n\tt += (t+m)/(a[0]-1)\r\n\tprint(t)", "from math import *\r\nfrom collections import *\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\n\r\nn = int(input())\r\ny = int(input())\r\nz = y\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif(1 in a or 1 in b):\r\n\tprint(-1)\r\n\texit(0)\r\nfor i in range(n):\r\n\tx = y/(a[i]-1)\r\n\ty += x\r\nfor i in range(n):\r\n\tx = y/(b[i]-1)\r\n\ty += x\r\nprint(y-z)", "n = int(input())\r\nm = int(input())\r\ntakeoffs = [int(i) for i in input().split(\" \")]\r\nlandings = [int(i) for i in input().split(\" \")]\r\n\r\nflag = 0\r\n\r\ndef calculate_min_fuel(m, takeoffs, landings):\r\n \r\n if landings[0] == 1:\r\n return -1\r\n else:\r\n earth_landing = m / (landings[0]-1)\r\n m += earth_landing\r\n \r\n for i in range(len(landings)-1, 0, -1):\r\n # print(m)\r\n if takeoffs[i] == 1:\r\n return -1\r\n \r\n else:\r\n k = m /(takeoffs[i] - 1)\r\n m += k\r\n \r\n # print(m)\r\n if landings[i] == 1:\r\n return -1\r\n \r\n else:\r\n k = m/(landings[i] - 1)\r\n m += k\r\n \r\n # print(m)\r\n\r\n \r\n if takeoffs[0] == 1:\r\n return -1\r\n else: \r\n k = m /(takeoffs[0] - 1)\r\n m += k\r\n \r\n return m\r\n \r\nr = calculate_min_fuel(m, takeoffs, landings)\r\nif r == -1:\r\n print(-1)\r\nelse:\r\n print(r-m)\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\ndef check(t,m):\r\n\tx=m+t\r\n\tfor i in range(1,n+1):\r\n\t\tx-=x/a[i]\r\n\t\tx-=x/b[i]\r\n\t\tif x<m:\r\n\t\t\treturn False\r\n\treturn True\r\nn=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.append(a[0])\r\nb.append(b[0])\r\nl=0\r\nr=pow(10,10)\r\nfor i in range(n):\r\n\tif a[i]<=1 or b[i]<=1:\r\n\t\tprint(-1)\r\n\t\texit()\r\nfor i in range(500):\r\n\tmid=(l+r)/2\r\n\tif check(mid,m):\r\n\t\tr=mid\r\n\telse:\r\n\t\tl=mid\r\nprint(l)", "import sys\r\nn = int(input())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n if a[i] <= 1:\r\n print(-1)\r\n exit()\r\nb = list(map(int, input().split()))\r\nfor i in range(n):\r\n if b[i] <= 1:\r\n print(-1)\r\n exit()\r\ns = m\r\ns += s/(a[0]-1)\r\nfor i in range(n-1, 0, -1):\r\n s *= b[i]\r\n s /= b[i]-1\r\n s *= a[i]\r\n s /= a[i] - 1\r\ns += s/(b[0] - 1)\r\nprint(s - m)", "\r\nn = int(input())\r\nm = float(input())\r\na = list(map(int, input().strip().split()))\r\nb = list(map(int, input().strip().split()))\r\n\r\nif min(a) == 1 or min(b) == 1:\r\n print(-1)\r\nelse:\r\n C = 1.0\r\n for i in a:\r\n C *= i\r\n C /= (i-1)\r\n for i in b:\r\n C *= i\r\n C /= (i-1)\r\n print(m * (C - 1.0))", "n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nd=0\r\nk=0\r\nfor i in range(len(b)):\r\n t=b[len(b)-i-1]\r\n try:\r\n x=(t*d+m)/(t-1)\r\n except:\r\n k=1\r\n break\r\n d=x\r\n y=a[len(a)-i-1]\r\n try:\r\n p=(y*d+m)/(y-1)\r\n except:\r\n k=1\r\n break\r\n d=p\r\nprint(p if k!=1 else -1) ", "n = int(input())\r\nm = int(input())\r\na = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\nx = n-1\r\nmm = m\r\nc=1\r\nwhile (x>=0):\r\n\ty = (x+1)%n\r\n\ttry:\r\n\t\tm += m/(b[y]-1)\r\n\t\tm+= m/(a[x]-1)\r\n\texcept :\r\n\t\tprint(-1)\r\n\t\tc=0\r\n\t\tbreak\r\n\tx-=1\r\n\r\n\r\nif (c!=0):\r\n\tprint(m - mm)", "n_planet=int(input())\nm_rocket=int(input())\na_i=[int(x) for x in input().split(' ')]\nb_i=[int(x) for x in input().split(' ')]\n\ndef main(n, m, a, b):\n fuel = -1\n try:\n (a+b).index(1)\n except ValueError:\n fuel = m/(b[0]-1)\n l = list(range(1, n))\n l.reverse()\n for i in l:\n fuel = (m + fuel*a[i])/(a[i]-1)\n fuel = (m + fuel*b[i])/(b[i]-1)\n fuel = (m + fuel*a[0])/(a[0]-1)\n return fuel\n\nprint(main(n_planet, m_rocket, a_i, b_i))\n\t\t \t\t\t \t\t \t\t\t\t\t\t\t\t\t \t \t\t \t\t \t", "\r\nmod=10**9+7\r\nimport math\r\nfor _ in range(1):\r\n n=int(input())\r\n load=int(input())\r\n zp=load\r\n load+=0.000000000000001\r\n pk=list(map(int,input().split()))\r\n pk1=list(map(int,input().split()))\r\n d=[]\r\n for i in range(n):\r\n d.append(pk[i])\r\n d.append(pk1[(i+1)%n])\r\n flag=0\r\n for i in range(2*n-1,-1,-1):\r\n if d[i]==1:\r\n flag=1\r\n break\r\n load+=load/(d[i]-1)\r\n if flag==1:\r\n print(-1)\r\n else:\r\n print(load-zp)\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n", "def intake(c):\n for i in input().split():\n x=int(i)\n if x <=1 :\n print(\"-1\")\n quit()\n c.append(x)\n \nn=int(input())\nm=int(input())\na=[]\nintake(a)\nb=[]\nintake(b)\ns=float(m)\ns+=s/(a[0]-1)\nfor i in range(1,n):\n s+=s/(b[i]-1)\n s+=s/(a[i]-1)\ns+=s/(b[0]-1)\nprint(s-m)\n \n\t \t\t \t\t \t \t \t \t \t\t\t \t\t\t \t", "n = int(input())\r\nm = int(input())\r\na = [int(s) for s in input().split()]\r\nb = [int(s) for s in input().split()]\r\nx = m\r\nindex = []\r\nfor i in range(n):\r\n index.append(a[n-1-i])\r\n index.append(b[n-1-i])\r\nindex.insert(0, b[0])\r\nfor i in range(2*n):\r\n if index[i] <= 1:\r\n print(-1)\r\n break\r\n else:\r\n x += x/(index[i]-1)\r\nelse:\r\n print(x-m)", "def is_enough(fuel, n, m, a, b):\r\n fuel -= (fuel + m) / a[0]\r\n for i in range(1, n):\r\n fuel -= (fuel + m) / b[i]\r\n fuel -= (fuel + m) / a[i]\r\n fuel -= (fuel + m) / b[0]\r\n\r\n return True if fuel >= 0 else False\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n m = int(input())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n if 1 in a or 1 in b:\r\n print(-1)\r\n return\r\n\r\n left, right = 0, int(1e10)\r\n for _ in range(100):\r\n mid = (left + right) / 2\r\n if is_enough(mid, n, m, a, b):\r\n right = mid\r\n else:\r\n left = mid\r\n print(\"{0:.7f}\".format(right))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if a[i] == 1 or b[i] == 1:\r\n print(-1)\r\n exit(0)\r\n\r\nsum = m/(b[0] - 1)\r\nfor i in range(n - 1, 0, -1):\r\n sum += (m + sum) / (a[i] - 1)\r\n sum += (m + sum) / (b[i] - 1)\r\nsum += (m + sum) / (a[0] - 1)\r\n\r\nprint(\"%.11f\"%sum)", "n = int(input())\r\nm = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nflag = 1\r\nfor i in range(n):\r\n if a[i] == 1 or b[i] == 1:\r\n print(-1)\r\n flag = 0\r\n break\r\n\r\nif flag:\r\n wt = m\r\n wt += wt/(b[0]-1)\r\n for i in range(n-1,0,-1):\r\n wt += wt/(a[i]-1)\r\n wt += wt/(b[i]-1)\r\n \r\n wt += wt/(a[0]-1)\r\n print(wt-m)", "i=input\r\ni()\r\nm=int(i())\r\nv=m\r\ntry:\r\n for a in map(int, (i()+' '+i()).split()):v*=a/(a-1)\r\nexcept:v=m-1\r\nprint(v-m)", "import sys\r\nimport math\r\nfrom bisect import bisect_right as br\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#sys.stdout = open('fly/output.txt', 'w')\r\n#sys.stdin = open('fly/input.txt', 'r')\r\n\r\nn=int(input())\r\nm=int(input())\r\nf=m\r\na=int_arr()\r\nb=int_arr()\r\n\r\nans=m\r\n\r\nif 1 in set(a) or 1 in set(b):\r\n\tprint(-1)\r\n\texit()\r\n\r\nfor i in a+b:\r\n\tans+=ans/(i-1)\r\n\r\nprint(ans-m)", "n = int(input())\nm = int(input())\na = list(map(int, input().rstrip().split()))\nb = list(map(int, input().rstrip().split()))\nfuel_used = 0\nfor i in range(n-1):\n\tfuel_used += (1-fuel_used)/a[i]\n\tfuel_used += (1-fuel_used)/b[i+1]\nfuel_used += (1-fuel_used)/a[n-1]\nfuel_used += (1-fuel_used)/b[0]\ntry:\n\tfuel_required = m*(fuel_used)/(1-fuel_used)\n\tprint(fuel_required)\nexcept ZeroDivisionError:\n\tprint(-1)", "n=int(input())\r\nr=rr=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ntry:\r\n for i in range(0,-n,-1):\r\n r+=r/(a[i]-1)\r\n r+=r/(b[i-1]-1)\r\n print(r-rr)\r\nexcept ZeroDivisionError:\r\n print(-1)", "from sys import stdin\r\n\r\nn=int(stdin.readline())\r\nm=int(stdin.readline())\r\nA=list(map(int,stdin.readline().split()))\r\nB=list(map(int,stdin.readline().split()))\r\nif 1 in A or 1 in B:\r\n print(-1)\r\nelse:\r\n \r\n ans=(m*B[0])/(B[0]-1)\r\n for i in range(n-1,0,-1):\r\n ans=(ans*A[i])/(A[i]-1)\r\n ans=(ans*B[i])/(B[i]-1)\r\n ans=(ans*A[0])/(A[0]-1)\r\n print(float(str(round(ans-m,10))))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "i=input\r\ni()\r\nm=int(i())\r\nv=m\r\ntry:\r\n for a in map(int, (i()+' '+i()).split()):v*=a/(a-1)\r\n print(v-m)\r\nexcept:\r\n print(-1)", "def gcd(x, y):\n if x < y:\n return gcd(y, x)\n if not x % y:\n return y\n return gcd(y, x % y)\n\n\nif __name__ == '__main__':\n n = int(input())\n m = int(input())\n arr = list(map(int, input().split()))\n brr = list(map(int, input().split()))\n\n if 1 in arr or 1 in brr:\n print(-1)\n else:\n ml = 1\n dv = 1\n\n for x in arr:\n ml *= x\n dv *= x - 1\n d = gcd(ml, dv)\n ml /= d\n dv /= d\n\n for x in brr:\n ml *= x\n dv *= x - 1\n d = gcd(ml, dv)\n ml /= d\n dv /= d\n\n print(ml * m / dv - m)\n", "n=int(input())\r\nm=int(input())\r\na=list(map(int ,input().split()))\r\nb=list(map(int ,input().split()))\r\nif any(i==1 for i in a) or any(i==1 for i in b):\r\n\tprint(\"-1\")\r\nelse:\r\n\tans = 1.0\r\n\tfor i in range(n):\r\n\t\tans -= ans/a[i]\r\n\t\tif i==n-1:\r\n\t\t\tans-=ans/b[0]\r\n\t\telse:\r\n\t\t\tans-=ans/b[i+1]\r\n\tans=m/ans\r\n\tprint(ans-m)\r\n", "n, m = int(input()), int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = 1.0\r\nfor x in a:\r\n ans -= ans / x\r\nfor x in b:\r\n ans -= ans / x\r\n\r\nif ans == 0:\r\n print(-1)\r\nelse:\r\n ans = 1 / ans\r\n ans = ans * m - m\r\n\r\n ans += 0.0000000005\r\n print(\"%.10f\" % ans)\r\n", "x=int(input())\r\ny=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ns=y\r\np=y\r\na=a+b\r\nif 1 in a:\r\n print(-1)\r\n exit()\r\nfor i in a:\r\n s+=s/(i-1)\r\nprint(s-y) ", "n = int(input())\nm = int(input())\n\nx = list(map(int,input().split()))\ny = list(map(int,input().split()))\nz = []\nfor i in range(n-1,-1,-1):\n\tz.append(x[i])\n\tz.append(y[i])\nz = [z[-1]] + z[:-1]\ns = m\nfor i in z:\n\tif i <= 1:\n\t\tprint (-1)\n\t\texit()\n\telse:\n\t\ts += s/(i-1)\nprint (s-m)\n", "n = int(input())\r\nm = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nstart = m\r\n\r\nif b[0]-1 <= 0:\r\n\tprint(-1)\r\nelse:\r\n\tm += m/(b[0]-1)\r\n\tflag = True\r\n\tfor i in range(n-1,0,-1):\r\n\t\tif a[i] - 1 <= 0:\r\n\t\t\tflag = False\r\n\t\t\tprint(-1)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tm += m/(a[i]-1)\r\n\t\tif b[i] - 1 <= 0:\r\n\t\t\tflag = False\r\n\t\t\tprint(-1)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tm += m/(b[i]-1)\r\n\tif flag:\r\n\t\tif a[0] - 1 <= 0:\r\n\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\tm += m/(a[0]-1)\r\n\t\t\tprint(m-start)", "n = int(input())\r\nm = int(input())\r\n\r\na = [int(aa) for aa in input().split()]\r\nb = [int(bb) for bb in input().split()]\r\n\r\nif (1 in a) or (1 in b):\r\n print(-1)\r\n exit(0)\r\n\r\nc = 0\r\n\r\nfor count in range(2*n,0,-1):\r\n id = (count//2+1)%n\r\n if count%2==0: c = (c * b[id] + m) / (b[id]-1)\r\n else: c = (c * a[id] + m) / (a[id] - 1)\r\n\r\nprint(c)\r\n", "i=input\ni()\nm=int(i())\nv=m\ntry:\n for a in map(int, (i()+' '+i()).split()):v*=a/(a-1)\nexcept:v=m-1\nprint(v-m)#hgvjhvutftyiuhutf76gougytf68\n \t\t \t\t \t\t \t\t \t \t\t\t \t \t", "n, m = int(input()), int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nx = 1.0\r\nans = 1\r\ntry:\r\n for i in range(n):\r\n x *= (a[i] * b[i]) / ((a[i] - 1) * (b[i] - 1))\r\nexcept:\r\n ans = 0\r\nx = x - 1.0\r\nx = x * m\r\nif(ans == 1):\r\n print(x)\r\nelse:\r\n print(\"-1\")\r\n", "n = int(input())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.append(b[0])\r\nans = 0\r\nw = m\r\np = 0\r\nfor i in range(2 * n):\r\n if i % 2 == 0:\r\n if a[p] - 1 <= 0:\r\n ans = -1\r\n break\r\n x = w / (a[p] - 1)\r\n ans += x\r\n w += x\r\n p += 1\r\n else:\r\n if b[p] - 1 <= 0:\r\n ans = -1\r\n break\r\n x = w / (b[p] - 1)\r\n ans += x\r\n w += x\r\nprint(ans)\r\n ", "n = int(input())\nm = int(input())\naa = list(map(int, input().split(' ')))\nbb = list(map(int, input().split(' ')))\nvs = list(zip(aa, bb[1:] + [bb[0]]))\nvs = [v for pair in vs for v in pair]\n#print(vs)\n\nif min(vs) <= 1:\n print(-1)\n exit(0)\n\nr = m\n\n#print('loop')\nfor k in reversed(vs):\n # pr / k = pr - r\n # r = pr(1 - 1/k)\n # pr = r / (1 - 1/k)\n # pr = r / ( (k-1)/k )\n # pr = r * k / (k - 1)\n r = r * k / (k - 1)\n\n #print(k, r)\n#print('result:')\n\nprint(r - m)\n", "input()\r\nship = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nforward = [item for tup in zip(b, a) for item in tup]\r\nrevers = [item for tup in zip(a, b) for item in tup][::-1]\r\ntrajectory = forward[1:]\r\ntrajectory.append(forward[0])\r\nfuel = 0\r\nfor co in reversed(trajectory):\r\n if co == 1:\r\n fuel = -1\r\n break\r\n fuel += (ship + fuel) / (co - 1)\r\nprint(fuel)", "n = int(input())\nm = int(input())\narr1 = list(map(int,input().split()))\narr2 = list(map(int,input().split()))\nif arr2[0] > 1 and arr1[0] > 1: \n\tw = m +m/(arr2[0]-1)\n\tflag = 0 \n\tfor i in range(n-1,0,-1):\n\t\tif arr1[i] <= 1 or arr2[i] <= 1:\n\t\t\tprint(-1)\n\t\t\tflag = 1\n\t\t\tbreak\n\t\tw += w/(arr1[i] -1)\n\t\tw += w/(arr2[i] -1)\n\tif(flag == 0):\n\t\tw += w/(arr1[0] - 1)\n\n\t\tprint(w-m)\nelse:\n\tprint(-1)", "def flight_cost(mass, cost):\r\n return mass / (cost - 1)\r\n\r\n\r\nclass CodeforcesTask1010ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.planet_count = 0\r\n self.payload = 0\r\n self.takeoff_costs = []\r\n self.landing_costs = []\r\n\r\n def read_input(self):\r\n self.planet_count = int(input())\r\n self.payload = int(input())\r\n self.takeoff_costs = [int(x) for x in input().split(\" \")]\r\n self.landing_costs = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n try:\r\n payload = self.payload\r\n required_fuel = 0\r\n nf = flight_cost(payload, self.landing_costs[0])\r\n required_fuel += nf\r\n payload += nf\r\n for x in range(1, self.planet_count):\r\n nf = flight_cost(payload, self.takeoff_costs[self.planet_count - x])\r\n required_fuel += nf\r\n payload += nf\r\n nf = flight_cost(payload, self.landing_costs[self.planet_count - x])\r\n required_fuel += nf\r\n payload += nf\r\n # print(self.planet_count - x - 1)\r\n nf = flight_cost(payload, self.takeoff_costs[0])\r\n required_fuel += nf\r\n payload += nf\r\n self.result = str(required_fuel)\r\n except ZeroDivisionError:\r\n self.result = \"-1\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask1010ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans1=1-(1/a[0])\r\nfor i in range(1,n):\r\n ans1*=(1-(1/b[i]))\r\n ans1*=(1-(1/a[i]))\r\nans1*=(1-(1/b[0]))\r\nans=1-ans1\r\nans*=m\r\nif(ans1<=0):\r\n print(-1)\r\nelse:\r\n ans=ans/ans1\r\n if(ans>1000000000):\r\n print(-1)\r\n else:\r\n print(ans)", "n = int(input())\r\nm = int(input())\r\nfly = list(map(int, list(input().split())))\r\nland = list(map(int, list(input().split())))\r\ntemp_list = []\r\ntry:\r\n temp_list.append(land[0])\r\n for i in range(n-1, 0, -1):\r\n temp_list.append(fly[i])\r\n temp_list.append(land[i])\r\n temp_list.append(fly[0])\r\n res = m\r\n for i in temp_list:\r\n res = res + res/(i-1)\r\n #print(i, res)\r\n print(str(res-m))\r\nexcept:\r\n print(\"-1\")\r\n", "n = int(input())\r\nm = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb = b[1:]+b[0:1]\r\nc = m\r\nd = 0\r\nfor i in range(n):\r\n k = n-1-i\r\n if b[k] <= 1 or a[k] <= 1:\r\n d = -1\r\n else:\r\n c = c*(1+1/(b[k]-1))*(1+1/(a[k]-1))\r\nif d == -1:\r\n print(d)\r\nelse:\r\n print(c-m)", "from math import ceil\r\ndef test(f):\r\n for i in range(n):\r\n if (r1+ f) > f * lift[i]:\r\n return 0\r\n f -= (r1 + f) / lift[i]\r\n if (r1+ f) > f * land[i + 1]:\r\n return 0\r\n f -= (r1 + f) / land[i + 1]\r\n return 1\r\np=int(input())\r\ntotal_wgt=int(input());r1=total_wgt\r\nlift=list(map(int,input().split()))\r\nland=list(map(int,input().split()));n=len(land);ans=1e20\r\nlift+=[lift[0]];land+=[land[0]]\r\nl=0.0;r=1e20\r\nfor i in range(1000):\r\n mid=(l+r)/2.0\r\n #print(mid)\r\n if test(mid):r=mid\r\n else:l=mid\r\nif r<1e19:\r\n print('%.17f' %r)\r\nelse:\r\n print(-1)\r\n", "import math as ma\r\nfrom sys import exit\r\nfrom decimal import Decimal as dec\r\ndef li():\r\n\treturn list(map(int , input().split()))\r\n# https://www.geeksforgeeks.org/multiplicative-inverse-under-modulo-m/\r\ndef modInverse(a , m):\r\n\tm0 = m\r\n\ty = 0\r\n\tx = 1\r\n\tif (m == 1):\r\n\t\treturn 0\r\n\twhile (a > 1):\r\n\t\tq = a // m\r\n\t\tt = m\r\n\t\tm = a % m\r\n\t\ta = t\r\n\t\tt = y\r\n\t\ty = x - q * y\r\n\t\tx = t\r\n\tif (x < 0):\r\n\t\tx = x + m0\r\n\treturn x\r\ndef num():\r\n\treturn map(int , input().split())\r\ndef nu():\r\n\treturn int(input())\r\ndef find_gcd(x , y):\r\n\twhile (y):\r\n\t\tx , y = y , x % y\r\n\treturn x\r\nn=nu()\r\nm=nu()\r\nx=1\r\na=li()\r\nb=li()\r\nfor i in range(n):\r\n\tx*=(1-1/a[i])\r\nfor i in range(n):\r\n\tx*=(1-1/b[i])\r\nif(x<=0):\r\n\tprint(-1)\r\nelse:\r\n\tx=m/x-m\r\n\tprint(x)\r\n", "n = int(input())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nt = m\r\nif 1 in set(a) or 1 in set(b):\r\n print(-1)\r\n exit()\r\nfor i in a + b:\r\n m *= i / (i - 1)\r\nprint(m - t)\r\n", "import math\r\n\r\nn = int(input())\r\npayload = int(input())\r\ncoeffs = list(map(int, input().split() + input().split()))\r\n\r\nif 1 in coeffs:\r\n print(-1)\r\nelse:\r\n print(payload*(math.prod([c/(c-1) for c in coeffs])-1))\r\n", "n=int(input())\r\nm=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nz=(a[0]-1)/a[0]\r\nl=0\r\nfor i in range(1,n):\r\n z=z*(b[i]-1)/b[i]\r\n\r\n z=z*(a[i]-1)/a[i]\r\nz=z*(b[0]-1)/b[0]\r\ntry:\r\n print(\"{0:.10f}\".format(m/z-m))\r\nexcept:\r\n print(-1)\r\n", "n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=m\r\n\r\nif b[0]-1==0:\r\n print(-1)\r\nelse:\r\n \r\n m=m+(m/(b[0]-1))\r\n \r\n counter=False\r\n \r\n for i in range(n-1,0,-1):\r\n if a[i]-1 ==0 or b[i]-1 ==0:\r\n counter=True\r\n else:\r\n m=m+(m/(a[i]-1))\r\n m=m+(m/(b[i]-1))\r\n #print(m)\r\n if counter==True or a[0]-1 ==0 :\r\n print(-1)\r\n else:\r\n m=m+(m/(a[0]-1))\r\n\r\n \r\n print(m-ans)\r\n ", "import io, os, sys\ntry:\n\tfin = open('in')\n\tinput = fin.readline\nexcept:\n\tinput = sys.stdin.readline\n\nn=int(input())\ns=int(input())\nS=s\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nif any(t<=1 for t in a+b):print(-1)\nelse:\n\ts+=s/(a[0]-1)\n\tfor i in range(n-1,0,-1):\n\t\ts+=s/(b[i]-1)\n\t\ts+=s/(a[i]-1)\n\ts+=s/(b[0]-1)\n\tprint(s-S)", "# \r\nimport collections, atexit, math, sys\r\nfrom functools import cmp_to_key\r\n#key=cmp_to_key(lambda x,y: 1 if x not in y else -1 )\r\n\r\nsys.setrecursionlimit(1000000)\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\nimport bisect \r\ntry :\r\n #raise ModuleNotFoundError\r\n import numpy\r\n def dprint(*args, **kwargs):\r\n print(*args, **kwargs, file=sys.stderr)\r\n dprint('debug mode')\r\nexcept ModuleNotFoundError:\r\n def dprint(*args, **kwargs):\r\n pass\r\n\r\n\r\ndef memo(func): \r\n cache={} \r\n def wrap(*args): \r\n if args not in cache: \r\n cache[args]=func(*args) \r\n return cache[args] \r\n return wrap\r\n\r\n@memo\r\ndef comb (n,k):\r\n if k==0: return 1\r\n if n==k: return 1\r\n return comb(n-1,k-1) + comb(n-1,k)\r\n\r\ninId = 0\r\noutId = 0\r\nif inId>0:\r\n dprint('use input', inId)\r\n sys.stdin = open('input'+ str(inId) + '.txt', 'r') #标准输出重定向至文件\r\nif outId>0:\r\n dprint('use output', outId)\r\n sys.stdout = open('stdout'+ str(outId) + '.txt', 'w') #标准输出重定向至文件\r\n atexit.register(lambda :sys.stdout.close()) #idle 中不会执行 atexit\r\n \r\nN, = getIntList()\r\nM, = getIntList()\r\nza = getIntList()\r\nzb = getIntList()\r\n\r\nif 1 in za or 1 in zb:\r\n print(-1)\r\n sys.exit()\r\n \r\n\r\ndef trywork(fuel):\r\n for i in range(N):\r\n now = fuel + M\r\n cost = now / za[i]\r\n fuel-=cost\r\n if fuel <0: return False\r\n now = fuel +M\r\n cost = now / zb[ (i+1)%N]\r\n fuel-=cost\r\n if fuel<0: return False\r\n return True\r\n\r\nr0 = 0\r\nr1 = 10**9+1\r\n\r\n\r\nwhile r1-r0 > 1e-7 and (r1-r0) *10000000 >r1:\r\n m = (r1+r0)/2\r\n f = trywork(m)\r\n if f:\r\n r1 = m\r\n else:\r\n r0 = m\r\n\r\nprint(r1)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\nimport itertools\ngetInputList = lambda : list(input().split())\ngetInputIntList = lambda : list(map(int,input().split()))\n\nn = int(input())\nm = int(input())\na = getInputIntList()\nb = getInputIntList()\n\nw = a+b\nleft = 0\nright = (10**9)+2\nbest = -1\n\"\"\"\n2\n12\n11 8\n7 5\n11 5 8 7\n\"\"\"\niteration = 500\nwhile abs(left - right) >= 1/10**9:\n md = (left + right)/2\n iw = md + m\n for i in w:\n iw -= iw/i\n if iw >= m:\n best = md\n right = md -1\n else:\n left = md + 1\n iteration -= 1\n if iteration == 0:\n break\nprint(best)\n", "\"\"\"for p in range(int(input())):\r\n\r\n\tn,k=map(int,input().split(\" \"))\r\n\tnumber=input().split(\" \")\r\n\tchances=[k for i in range(n)]\r\n\r\n\tprev=-1\r\n\tprev_updated=-1\r\n\tlast_used=False\r\n\ttoSub=0\r\n\tstart=0\r\n\r\n\tprevSub=0\r\n\r\n\tif(number[0]=='1'):\r\n\t\tprev=0\r\n\t\tprev_updated=0\r\n\t\tstart=1\r\n\r\n\tfor i in range(start,n):\r\n\t\t\r\n\t\tif(number[i]=='1'):\r\n\t\t#\tprint(\"\\ni\",i,\"\\ntoSub\",toSub,\"\\nprevUpadted\",prev_updated,\"\\nprev\",prev,\"\\nlast_used\",last_used)\r\n\t\t\tf1=False\r\n#\t\t\ttoSub+=1\r\n\t\t\ttoSub=0\r\n\r\n\t\t\tzeros=i - prev_updated - 1\r\n\r\n\t\t\tif(last_used):\r\n\t\t\t\tzeros-=1\r\n\r\n\t\t\t#chances[i]-=toSub\r\n\r\n\t\t\t#print(prevSub,(i - prev - 1 ) +1)\r\n\t\t\tif(i - prev - 1 <= prevSub):\r\n\t\t\t\tchances[i]-= prevSub - (i - prev - 1 ) +1\r\n\t\t\t\tif(chances[i]<zeros):\r\n\t\t\t\t\tchances[i]=zeros\r\n\t\t\t\ttoSub+= prevSub - (i - prev - 1 ) +1\r\n\t\t\t\tf1=True\r\n\r\n\t\t\tif(zeros==0 or chances[i]==0):\r\n\t\t\t\tprev_updated=i\r\n\t\t\t\tprev=i\r\n\t\t\t\tlast_used=False\r\n\t\t\t\tprevSub=toSub\r\n\t\t\t\tcontinue\r\n\t\t#\tprint(\"\\nchances: \",chances[i],\"\\t\\tzeroes : \",zeros,\"\\t\\tprevSub :\",prevSub)\r\n\r\n\t\t\tif(chances[i]>zeros):\r\n\t\t#\t\tprint(\"\\t\\t\\t\\t1\")\r\n\t\t\t\tnumber[i-zeros]='1'\r\n\t\t\t\tnumber[i]='0'\r\n\t\t\t\tprev_updated=i-zeros\r\n\t\t\t\tlast_used=False\r\n\t\t\telif(chances[i]==zeros):\r\n\t\t#\t\tprint(\"\\t\\t\\t\\t2\")\r\n\t\t\t\tnumber[i]='0'\r\n\t\t\t\tnumber[i-chances[i]]='1'\r\n\t\t\t\tprev_updated=i-chances[i]\r\n\t\t\t\tlast_used=True\r\n\t\t\telse:\r\n\t\t#\t\tprint(\"\\t\\t\\t\\t3\")\r\n\t\t\t\tnumber[i]='0'\r\n\t\t\t\tnumber[i-chances[i]]='1'\r\n\t\t\t\tprev_updated=i-chances[i]\r\n\t\t\t\tlast_used=True\r\n\t\t\tprev=i\r\n\r\n\t\t\tprevSub=toSub\r\n\r\n\t\t\tif(prev_updated>2 and f1):\r\n\t\t\t\tif(number[prev_updated]=='1' and number[prev_updated-1]=='0' and number[prev_updated-2]=='1'):\r\n\t\t\t\t\tlast_used=False\r\n\t\t\t\t#if()\r\n\r\n\t\t#\tprint(\"\\ni\",i,\"\\ntoSub\",toSub,\"\\nprevUpadted\",prev_updated,\"\\nprev\",prev,\"\\nlast_used\",last_used)\r\n\t\t#\tprint(number)\r\n\t\telse:\r\n\t\t\ttoSub=0\r\n\r\n\tprint(*number)\r\n#\tprint(chances)\"\"\"\r\n\r\n\"\"\"class offer:\r\n\tdef __init__(self, n, fre):\r\n\t\tself.num = n\r\n\t\tself.free = fre\r\n\t\tself.delta= n-fre\r\n\t\t\r\n\r\nn,m,k=map(int,input().split(\" \"))\r\n\r\nshovel=list(map(int,input().split(\" \")))\r\n\r\n#dicti={}\r\n\r\noffers=[]\r\ntemp_arr=[False for i in range(n)]\r\n\r\nfor i in range(m):\r\n\tp,q=map(int,input().split(\" \"))\r\n\tif(p>k):\r\n\t\tcontinue\r\n\toffers.append(offer(p,q))\r\n#\tdicti[p]=q\r\n\r\n#for i in dicti:\r\n#\tdicti[i].sort()\t\r\n\r\nshovel.sort()\r\nshovel=shovel[:k+1]\r\n\r\noffers.sort(key=lambda x: x.delta/x.num,reverse=True)\r\n\r\nbestoffer=[]\r\n\r\nfor i in offers:\r\n\tif(not temp_arr[i.num]):\r\n\t\ttemp_arr[i.num]=True\r\n\t\tbestoffer.append(i)\r\n\r\ncost=0\r\n\r\nfor i in bestoffer:\r\n\t\r\n\t\r\nfor p in range(int(input())):\r\n\tarr=list(input())\r\n\r\n\tn=len(arr)\r\n\tfor i in range(n):\r\n\t\tarr[i]=ord(arr[i])-96\r\n\r\n\tarr.sort()\r\n\r\n\tarr1=arr[:n//2]\r\n\tarr2=arr[n//2:]\r\n\tarr=[]\r\n\t#print(arr,arr1,arr2)\r\n\ti1=n//2-1\r\n\ti2=n-i1-2\r\n\r\n\twhile (i1!=-1 and i2!=-1):\r\n\t\tarr.append(arr1[i1])\r\n\t\tarr.append(arr2[i2])\r\n\t\ti1-=1\r\n\t\ti2-=1\r\n\tif(i1!=-1):\r\n\t\tarr.append(arr1[i1])\r\n\telif(i2!=-1):\r\n\t\tarr.append(arr2[i2])\r\n\r\n\t#print(arr)\r\n\r\n\ts=\"\"\r\n\tfor i in range(n-1):\r\n\t\tif(abs(arr[i]-arr[i+1])==1):\r\n\t\t\ts=-1\r\n\t\t\tprint(\"No answer\")\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ts+=chr(arr[i]+96)\r\n\r\n\tif(s!=-1):\r\n\t\ts+=chr(arr[-1]+96)\r\n\t\tprint(s)\"\"\"\r\n\r\n\"\"\"\r\nn,m=map(int,input().split(\" \"))\r\n\r\nseti=[]\r\nans=[1 for i in range(n)]\r\n\r\n\r\nfor i in range(m):\r\n\tarr=list(map(int,input().split(\" \")))\r\n\t\r\n\tif(arr[0]>1):\r\n\t\tseti.append(set(arr[1:]))\r\n\telse:\r\n\t\tm-=1\r\n\r\nparent=[-1 for i in range(m)]\r\n#print(seti)\r\nfor i in range(m-1):\r\n\tfor j in range(i+1,m):\r\n\t\tif(parent[j]==-1):\r\n\t\t\tif(len(seti[i].intersection(seti[j]))>0):\r\n\t\t\t\tseti[i]=seti[i].union(seti[j])\r\n\t\t\t\tparent[j]=i\r\n\r\n#print(parent)\r\n\r\nfor i in range(m):\r\n\tif(parent[i]==-1):\r\n\t\ttemp=list(seti[i])\r\n\t\tstore=len(temp)\r\n\t\tfor j in temp:\r\n\t\t\tans[j-1]=store\r\n\r\nprint(*ans)\r\n\r\n\r\nfor p in range(int(input())):\r\n\tarr=list(input())\r\n\r\n\tn=len(arr)\r\n\tfor i in range(n):\r\n\t\tarr[i]=ord(arr[i])-96\r\n\r\n\tarr.sort()\r\n\r\n\tarr1=arr[:n//2]\r\n\tarr2=arr[n//2:]\r\n\tarr=[]\r\n\t#print(arr,arr1,arr2)\r\n\ti1=n//2-1\r\n\ti2=n-i1-2\r\n\r\n\twhile (i1!=-1 and i2!=-1):\r\n\t\tarr.append(arr1[i1])\r\n\t\tarr.append(arr2[i2])\r\n\t\ti1-=1\r\n\t\ti2-=1\r\n\tif(i1!=-1):\r\n\t\tarr.append(arr1[i1])\r\n\telif(i2!=-1):\r\n\t\tarr.append(arr2[i2])\r\n\r\n\ts=\"\"\r\n\tfor i in range(n-1):\r\n\t\tif(abs(arr[i]-arr[i+1])==1):\r\n\t\t\ts=-1\r\n\t\t\tprint(\"No answer\")\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ts+=chr(arr[i]+96)\r\n\r\n\tif(s!=-1):\r\n\t\ts+=chr(arr[-1]+96)\r\n\t\tprint(s)\r\n#n=0\"\"\"\r\n\r\nn=int(input())\r\np=int(input())\r\n\r\narr1=list(map(int,input().split(\" \")))\r\narr2=list(map(int,input().split(\" \")))\r\n\r\na=1\r\nflag=False\r\nfor i in range(n):\r\n\ta*=((arr1[i]-1)*(arr2[i]-1))/(arr1[i]*arr2[i])\r\n\tif(a==0):\r\n\t\tflag=True\r\n\t\tbreak\r\n\r\nif(flag):\r\n\tprint(-1)\t\r\nelse:\r\n\tprint(p*((1-a)/a))", "import sys\r\n\r\nn = int(input())\r\nm = float(input())\r\na = list(map(float,input().split()))\r\nb = list(map(float,input().split()))\r\n\r\nfor i in a:\r\n\tif i <= 1.0:\r\n\t\tprint(str(-1))\r\n\t\tsys.exit()\r\nfor i in b:\r\n\tif i <= 1.0:\r\n\t\tprint(str(-1))\r\n\t\tsys.exit()\r\n\r\ns = m\r\ns += s/(b[0] - 1.0)\r\n\r\nfor i in range(n-1,0,-1):\r\n\ts += s/(a[i] - 1.0)\r\n\ts += s/(b[i] - 1.0)\r\n\r\ns += s/(a[0] - 1.0)\r\nprint(\"{0:.10f}\".format(s - m))", "N = int(input())\r\nM = int(input())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nimp = fuel = 0\r\nfor i in range(N, 0, -1):\r\n if i == N: i = 0\r\n if B[i] == 1:\r\n imp = 1\r\n break\r\n fuel += (M + fuel) / (B[i] - 1)\r\n if A[i - 1] == 1:\r\n imp = 1\r\n break\r\n fuel += (M + fuel) / (A[i - 1] - 1)\r\nprint(-1 if imp else '{:.7f}'.format(fuel))", "import sys\n\nn = int(input())\nm = int(input())\na = [ int(x) for x in input().split() ]\nb = [ int(x) for x in input().split() ]\nif 1 in a or 1 in b:\n print(-1)\n sys.exit(0)\n\nf = m / (b[0] - 1)\nfor i in range(n-1, 0, -1):\n f += (m + f) / (a[i] - 1)\n f += (m + f) / (b[i] - 1)\nf += (m + f) / (a[0] - 1)\nprint(f)\n\n \t\t \t\t \t \t\t\t\t\t \t \t \t\t\t", "n = int(input())\r\nm = int(input())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nS, D = 1, 1\r\nfor i in a:\r\n S *= i\r\n D *= (i - 1)\r\nfor i in b:\r\n S *= i\r\n D *= (i - 1)\r\n\r\nif D == 0:\r\n print(-1)\r\nelse:\r\n print(((S - D) * m) / D)\r\n", "n = int(input())\r\nm = int(input())\r\nmm = m\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif 1 in set(a) or 1 in set(b):\r\n print(-1)\r\nelse:\r\n for i in a + b:\r\n m *= i / (i - 1)\r\n print(m - mm)", "n = int(input())\nm = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\ntmp=1.0\nfor i in range(0,n):\n\ttmp*=((a[i]-1)*(b[i]-1))\n\ttmp/=a[i]\n\ttmp/=b[i]\n\nif tmp == 0:\n\tprint('-1\\n')\n\texit(0)\n\nfuel = m*(1-tmp)/tmp\n\nif fuel >= 1e-7:\n\tprint(fuel)\nelse:\n\tprint('-1\\n')", "#!/usr/bin/python3\r\n\r\nN = int(input())\r\nM = int(input())\r\na = [int(x) for x in input().split(' ')]\r\nb = [int(x) for x in input().split(' ')]\r\n\r\nfor i in range(len(a)):\r\n\tif a[i] == 1 or b[i] == 1:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\r\ndef galima(fuel):\r\n\tfuel -= (M + fuel)/a[0]\r\n\tfor i in range(1, len(a)):\r\n\t\tfuel -= (M + fuel)/a[i]\r\n\t\tfuel -= (M + fuel)/b[i]\r\n\tfuel -= (M + fuel)/b[0]\r\n\r\n\tif(fuel >= 0):\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\nlow = 0.0\r\nhigh = 1e9\r\nfor _ in range(300):\r\n\tmid = (low+high)/2\r\n\tif(galima(mid)):\r\n\t\thigh = mid\r\n\telse:\r\n\t\tlow = mid\r\n\r\nprint(high)", "n = eval(input())\r\nm = eval(input())\r\na = [0] + list(map(int, input().split()))\r\nb = [0] + list(map(int, input().split()))\r\nflag = 0\r\nfor i in range(1, n + 1):\r\n if a[i] <= 1:\r\n flag = 1\r\nfor i in range(1, n + 1):\r\n if b[i] <= 1:\r\n flag = 1\r\nl = 0\r\nr = 1e9\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n m1 = m\r\n l = m1 * b[1] / (b[1] - 1)\r\n for i in range(n, 1, -1):\r\n m1 = l\r\n l = m1 * a[i] / (a[i] - 1)\r\n m1 = l\r\n l = m1 * b[i] / (b[i] - 1)\r\n m1 = l\r\n l = m1 * a[1] / (a[1] - 1)\r\n print(\"%.10f\" % (l - m))\r\n", "n=int(input())\r\nm=int(input())\r\nno_of_tons_lifted=list(map(float,input().split()))\r\nno_of_tons_landed = list(map(float, input().split()))\r\nz=1\r\nfor i in range(len(no_of_tons_lifted)):\r\n z=z*(1-1/(no_of_tons_landed[i]))*(1-1/(no_of_tons_lifted[i]))\r\n\r\nif(z==0):\r\n print(-1)\r\nelse:\r\n print(m*(1-z)/z)", "n = int(input())\nm = int(input())\na = list(map(float, input().split()))\nb = list(map(float, input().split()))\nif 1 in a or 1 in b:\n print(-1)\n exit()\npayload = m\npayload += payload / (a[0] - 1)\nfor i in range(n - 1, 0 , -1):\n payload += payload / (a[i] - 1)\n payload += payload / (b[i] - 1)\npayload += payload / (b[0] - 1)\nprint(payload - m)\n", "n = int(input())\r\nm = int(input())\r\nt = 0\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif (b[0] > 1):\r\n s = m + m / (b[0] - 1)\r\n for i in range(n - 1, -1, -1):\r\n if a[i] == 1 or b[i] == 1:\r\n t = 1\r\n break\r\n s += s / (a[i] - 1)\r\n if (i > 0): s += s / (b[i] - 1)\r\n if t: print('-1', end = '')\r\n else: print(s - m, end = '')\r\nelse: print('-1', end = '')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Jul 26 22:11:21 2018\n\n@author: manish\n\"\"\"\n\np = int(input())\nw = float(input())\na = input().split()\nb = input().split()\n'''\np = 6\nw = 2\n\na = '4 6 3 3 5 6'.split()\nb = '2 6 3 6 5 3'.split()\n'''\nw_a = w\ntakky = [b[0]]\n\nfor i in range(0,len(a)):\n takky.append(a[len(a)-i-1])\n if len(a) != i+1:\n takky.append(b[len(a)-i-1])\n \n\nfor w1 in takky:\n if int(w1)-1 == 0:\n ans = -1\n break\n w2 = float(w_a/(int(w1)-1))\n w_a = w_a+w2\n\n ans = w_a\n if w_a - w == 1000000000:\n ans = -1\n break\n\nif ans == -1:\n print(-1)\nelse:\n print(ans-w)\n", "n = int(input())\r\nm = int(input())\r\na = [int(c) for c in input().split(\" \")]\r\nb = [int(c) for c in input().split(\" \")]\r\nc = 1\r\nfor i in a:\r\n c = c * (1-(1/i))\r\nfor i in b:\r\n c = c * (1-(1/i))\r\nif c > 0:\r\n print(m * ((1/c)-1))\r\nelse:\r\n print(-1)", "n = int(input())\r\nm = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\ns = 0\r\nfor i in range(n):\r\n s += (1 - s) / a[i]\r\n s += (1 - s) / b[(i + 1) % n]\r\nif 0 < s < 1:\r\n print(s * m / (1 - s))\r\nelse:\r\n print(-1)\r\n", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nsw = int(input())\r\nlifts = list(R())\r\nlands = list(R())\r\nl, r = 0, 10 ** 9 + 1\r\nwhile r - l > 10 ** -6:\r\n fuel = (l + r) / 2\r\n rem = fuel\r\n for i in range(n):\r\n rem -= (rem + sw) / lifts[i]\r\n if rem < 0:\r\n break\r\n rem -= (rem + sw) / lands[(i + 1) % n]\r\n if rem < 0:\r\n break\r\n if rem < 0:\r\n l = fuel\r\n else:\r\n r = fuel\r\nprint(l if l <= 10 ** 9 else -1)", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nN = int(readline())\r\nM = float(readline())\r\nA = list(map(int, readline().split()))\r\nB = list(map(int, readline().split()))\r\nB = B[1:] + [B[0]]\r\nC = []\r\nfor a, b in zip(A[::-1], B[::-1]):\r\n C.append(b)\r\n C.append(a)\r\n\r\nif 1 in C:\r\n print(-1)\r\nelse:\r\n M0 = M\r\n for c in C:\r\n M += M/(c-1)\r\n \r\n print(M-M0)", "n = int(input())\r\nm = int(input())\r\ntoff = list(map(int, input().split()))\r\nland = list(map(int, input().split()))\r\ncon = toff + land\r\ncoff = 1\r\nfor i in range(len(con)):\r\n coff *= (1-(1/con[i]))\r\ntry:\r\n print(m*((1/coff)-1))\r\nexcept:\r\n print(-1)", "def chk(fuel,n):\r\n mass = m+fuel\r\n flag = 1\r\n for i in range(n):\r\n # print(fuel)\r\n needed1 = a[i]\r\n needed2 = b[(i+1)%n]\r\n f = mass/needed1\r\n if f > fuel:\r\n flag = 0\r\n # print()\r\n\r\n else:\r\n fuel -= f\r\n mass = m+fuel\r\n\r\n f = mass / needed2\r\n if f > fuel:\r\n flag = 0\r\n\r\n else:\r\n fuel -= f\r\n mass = m + fuel\r\n\r\n return flag\r\n\r\nn = int(input())\r\nm = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nlow = 1\r\nhigh = 10**9\r\nans = -1\r\nitr = 0\r\nwhile itr < 200:\r\n mid = (high+low)/2\r\n # print(mid)\r\n if chk(mid,n):\r\n ans = mid\r\n high = mid-1\r\n\r\n else:\r\n low = mid+1\r\n\r\n itr += 1\r\n\r\nprint(ans)", "INF = 10**20\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\nfrom math import gcd\r\nfrom math import ceil\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\nn, = I()\r\nm, = I()\r\na = I()\r\nb = I()\r\n\r\nlo, hi = 0, INF\r\n\r\nif 1 in a or 1 in b:\r\n print(-1)\r\n exit()\r\n\r\neps = 10 ** -6\r\niter = 1000\r\nwhile iter:\r\n iter -= 1\r\n mid = (lo + hi) / 2\r\n cur = mid\r\n for i in range(n):\r\n land = (cur + m) / b[i]\r\n if i == 0:\r\n land = 0\r\n cur -= land\r\n take_off = (cur + m) / a[i]\r\n cur -= take_off\r\n if cur < 0:\r\n break\r\n cur -= (cur + m) / b[0]\r\n if cur >= 0:\r\n hi = mid\r\n else:\r\n lo = mid\r\n\r\nprint(lo)", "'''input\n6\n2\n4 6 3 3 5 6\n2 6 3 6 5 3\n'''\nn, m = int(input()), int(input())\nm1 = m\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nif 1 in set(a) or 1 in set(b):\n\tprint(-1)\nelse:\n\tfor i in a + b:\n\t\tm *= i/(i-1)\n\tprint(m - m1)\n", "def scanf(obj=list, type=int, sep=' '):\r\n return obj(map(type, input().split(sep)))\r\nn, = scanf()\r\nm, = scanf()\r\na = scanf()\r\nb = scanf()\r\nif a.count(1) or b.count(1):\r\n print(-1)\r\n quit()\r\nl , r = 0, 10**9\r\ndef f(x):\r\n for ai, bi in zip(a, b):\r\n if ai * x < m + x:\r\n return False\r\n x -= (m + x) / ai\r\n if bi * x < m + x:\r\n return False\r\n x -= (m + x) / bi\r\n return True\r\n \r\nwhile r - l > 1e-6:\r\n temp = (r + l) / 2\r\n if f(temp): r = temp\r\n else: l = temp\r\nprint(r)", "n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nr=1\r\nj=0\r\nf=0\r\nwhile(j<n):\r\n if a[j]==1 or b[j]==1:\r\n f=-1\r\n break\r\n r*=((1-(1/a[j]))*(1-(1/b[j])))\r\n j+=1\r\nif f==-1:\r\n print(-1)\r\nelse:\r\n x=m*((1/r)-1)\r\n\r\n if x>0:\r\n print(x)\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "N = int(input())\nM = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\ndef check(m):\n for i in range(N):\n w = m + M\n m -= w / A[i]\n if m < 0:\n return False\n w = m + M\n m -= w / B[(i + 1) % N]\n if m < 0:\n return False\n return True\nl = 0\nr = pow(10, 9) + 1\nwhile l + 0.0000001 < r:\n m = (l + r) / 2\n if check(m):\n r = m\n else:\n l = m\nif r > pow(10, 9) + 0.1:\n r = -1\nprint(r)\n", "#codeforces_1011C\r\nn = int(input())\r\nm = int(input())\r\ngo = [int(e) for e in input().split(\" \")]\r\nland = [int(e) for e in input().split(\" \")]\r\nif 1 in go+land:\r\n print(-1)\r\n exit();\r\nans = m + m/(land[0]-1)\r\nfor k in range(-1,-n,-1):\r\n ans += ans/(go[k]-1);\r\n ans += ans/(land[k]-1);\r\nans += ans/(go[0]-1)\r\nprint(ans-m)", "n = int(input())\r\nm = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif 1 in a or 1 in b:\r\n print(-1)\r\nelse: \r\n rhs = m/(b[0]-1)\r\n for i in range(1,n):\r\n rhs = (rhs*a[i]+m)/(a[i]-1)\r\n rhs = (rhs*b[i]+m)/(b[i]-1)\r\n\r\n rhs = (rhs*a[0]+m)/(a[0]-1)\r\n\r\n print(rhs)", "n = int(input())\r\np = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nif 1 in a or 1 in b:\r\n print(-1)\r\nelse:\r\n transitions = (n-1)*2\r\n coming = [0]*transitions\r\n coming[0] = b[0]\r\n coming[-1] = a[-1]\r\n for i in range(1,n-1):\r\n coming[2*i-1] = a[i] \r\n coming[2*i] = b[i]\r\n going = [0] * transitions\r\n going[0] = b[-1]\r\n going[-1] = a[0]\r\n for i in range(1,n-1):\r\n going[i*2] = b[i] \r\n going[i*2-1] = a[i]\r\n # print(going,coming)\r\n ans = p\r\n ans += ans/(b[0]-1)\r\n ans += ans/(a[-1]-1)\r\n # for i in coming:\r\n # ans += ans/(i-1)\r\n # print(ans)\r\n for i in going:\r\n ans += ans/(i-1)\r\n print(ans-p)\r\n\r\n\r\n\r\n\r\n# if __name__ == '__main__':\r\n# main()\r\n", "n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n c.append(a[i])\r\n c.append(b[(i+1)%n])\r\nc=c[::-1]\r\ns=m\r\ne=0\r\nfor i in range(len(c)):\r\n if c[i]==1:\r\n e=1\r\n else:\r\n s=s+s/(c[i]-1)\r\nif e==1:\r\n print(-1)\r\nelse:\r\n print(s-m)", "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\nm0 = I()\r\nm = m0\r\na = II()\r\nb = II()\r\nb = b[1:] + [b[0]]\r\nif min(b) == 1 or min(a)==1:\r\n p(-1)\r\n exit(0)\r\nfor i in reversed(r(n)):\r\n m *= b[i]/(b[i]-1)\r\n m *= a[i]/(a[i]-1)\r\np(m-m0)\r\n", "import sys\nplanets=int(input())\nM=int(input())\nFuel=0\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nfor x in a:\n\tif x==1:\n\t\tprint(\"-1\")\n\t\tsys.exit();\nfor x in b:\n\tif x==1:\n\t\tprint(\"-1\")\n\t\tsys.exit();\n\noverall=[]\nfor i in range(planets):\n\toverall.append(a[i])\n\toverall.append(b[i])\nfor i in overall:\n\tif Fuel>1000000000:\n\t\tpass\n\tx=(M+Fuel)/(i-1)\n\tFuel+=x\n\nprint(Fuel)", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n = int(input())\n m = int(input())\n s = m\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n def cal(n, m, s, a, b):\n if b[0] <= 1.00:\n return -1\n k = s / (b[0] - 1)\n s += k\n for i in range(n - 1, 0, -1):\n if a[i] <= 1.00:\n return -1\n k = s / (a[i] - 1)\n s += k\n if b[i] <= 1.00:\n return -1\n k = s / (b[i] - 1)\n s += k \n if a[0] <= 1.00:\n return -1\n k = s / (a[0] - 1)\n s += k\n return s - m\n ans = cal(n, m, s, a, b)\n if ans != -1:\n print('{:.8f}'.format(ans))\n else:\n print(-1)\n \nif __name__ == '__main__':\n main()\n\n \t \t \t\t\t\t\t\t\t \t\t\t \t\t \t\t\t \t", "n=int(input())\r\nm=int(input())\r\na=input().split()\r\nb=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n b[i]=int(b[i])\r\nls=[b[0]]\r\nfor i in range(n):\r\n if(i==n-1):\r\n ls.append(a[n-i-1])\r\n else: \r\n ls.append(a[n-i-1])\r\n ls.append(b[n-i-1])\r\nif(1 in ls):\r\n print(-1)\r\nelse: \r\n fuel=0\r\n mass=m\r\n for i in range(2*n):\r\n fuel+=mass/(ls[i]-1)\r\n mass+=mass/(ls[i]-1)\r\n print(fuel) ", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ns = m\r\nfor i in range(n):\r\n if a[i] <= 1 or b[i] <= 1:\r\n print(-1)\r\n exit()\r\ns += s / (a[0] - 1)\r\nfor i in range(n - 1, 0, -1):\r\n s += s / (b[i] - 1)\r\n s += s / (a[i] - 1)\r\ns += s / (b[0] - 1)\r\nprint(\"%.10f\" % (s - m))\r\n", "import sys\r\n \r\np2D = lambda x: print(*x, sep=\"\\n\")\r\ndef II(): return int(sys.stdin.buffer.readline())\r\ndef MI(): return map(int, sys.stdin.buffer.readline().split())\r\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\ndef BI(): return sys.stdin.buffer.readline().rstrip()\r\ndef SI(): return sys.stdin.buffer.readline().rstrip().decode()\r\ndef li(): return [int(i) for i in input().split()]\r\ndef lli(rows): return [li() for _ in range(rows)]\r\ndef si(): return input()\r\ndef ii(): return int(input())\r\ndef ins(): return input().split()\r\n\r\ndef solve():\r\n n=II()\r\n m=II()\r\n a=LI()\r\n b=LI()\r\n c=[]\r\n for i in range(n):\r\n c.append(a[i])\r\n c.append(b[(i+1)%n])\r\n ans,p=0,m\r\n for i in range(2*n-1,-1,-1):\r\n if c[i]==1:\r\n print(\"-1\")\r\n return\r\n f=p/(c[i]-1)\r\n p+=f\r\n print(p-m)\r\nsolve()\r\n\r\n\r\n", "from sys import stdin\r\nfrom math import *\r\n\r\n\r\ndef evaluate(currentFuel, ab, m):\r\n for i in range(len(ab)):\r\n currentFuel -= (currentFuel + m) / ab[i]\r\n if currentFuel <= -0.0000001:\r\n return False\r\n return True\r\n\r\n\r\n\r\n\r\nline = stdin.readline().rstrip().split()\r\nn = int(line[0])\r\nline = stdin.readline().rstrip().split()\r\nm = int(line[0])\r\naFuel = list(map(int, stdin.readline().rstrip().split()))\r\nbFuel = list(map(int, stdin.readline().rstrip().split()))\r\n\r\nab = []\r\nfor i in range(n-1):\r\n ab.append(aFuel[i])\r\n ab.append(bFuel[i+1])\r\nab.append(aFuel[n-1])\r\nab.append(bFuel[0])\r\n\r\nminFuel = 0\r\nmaxFuel = 1000000000\r\n\r\ncurrentFuel = (minFuel + maxFuel)/2\r\n\r\nwhile (maxFuel - minFuel) >= 0.0000005:\r\n if evaluate(currentFuel, ab, m):\r\n maxFuel = currentFuel\r\n else:\r\n minFuel = currentFuel\r\n currentFuel = (minFuel + maxFuel) / 2\r\n\r\nif evaluate(1000000000, ab, m):\r\n print(currentFuel)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nm = int(input())\r\nimport sys\r\n#n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n#a = input()\r\nb.append(b[0])\r\nb.pop(0)\r\nmas = m\r\nfor i in range(len(a) - 1, -1, -1):\r\n if( b[i] <= 1 ):\r\n mas = -1\r\n break\r\n mas += mas / ( b[i] - 1 )\r\n if( a[i] <= 1 ):\r\n mas = -1\r\n break\r\n mas += mas / ( a[i] - 1 )\r\nif mas == -1:\r\n print(-1)\r\nelse:\r\n print(mas - m)", "def fly():\r\n n = int(input())\r\n weight = int(input())\r\n lift = [int(k) for k in input().split()]\r\n land = [int(k) for k in input().split()]\r\n \r\n fuel_to_take = weight\r\n \r\n for i in range(n):\r\n if lift[i] <= 1 or land[i] <= 1: #fuel only can lift itself\r\n return -1\r\n\r\n fuel_to_take += fuel_to_take/(lift[i]-1)\r\n fuel_to_take += fuel_to_take/(land[i]-1)\r\n \r\n return fuel_to_take - weight\r\n \r\nprint(fly())\r\n\r\n", "\"\"\"Prositka\r\n16.10.2022\"\"\"\r\n\r\ndef check(m1):\r\n for i in range(n):\r\n if i == 0:\r\n m1 -= (m + m1) / a[i]\r\n if m1 < 0:\r\n return 0\r\n elif i == n-1:\r\n m1 -= (m + m1) / b[i]\r\n if m1 < 0:\r\n return 0\r\n else:\r\n m1 -= (m + m1) / b[i]\r\n if m1 < 0:\r\n return 0\r\n m1 -= (m + m1) / a[i]\r\n if m1 < 0:\r\n return 0\r\n m1 -= (m + m1) / a[n - 1]\r\n if m1 < 0:\r\n return 0\r\n m1 -= (m + m1) / b[0]\r\n if m1 < 0:\r\n return 0\r\n return 1\r\n\r\n\r\nn = int(input())\r\nm = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nl = 0\r\nr = 1e9+1\r\neps = 1e-6\r\nwhile r - l > eps:\r\n med = (l + r) / 2\r\n if check(med):\r\n r = med\r\n else:\r\n l = med\r\nif check(l):\r\n print(round(l, 6))\r\nelif check(r):\r\n print(round(r, 6))\r\nelse:\r\n print(-1)", "from math import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n\r\ndef can(a, b, mass, fuel):\r\n\r\n\t\t# take off from Earth\r\n\r\n\t\tfuel -= (mass + fuel) / a[0]\r\n\r\n\t\tif fuel < 0.0:\r\n\t\t\treturn False\r\n\r\n\t\tfor i in range(1, len(b)):\r\n\t\t\tfuel -= (mass + fuel) / b[i]\r\n\r\n\r\n\t\t\tif fuel < 0.0:\r\n\t\t\t\treturn False\r\n\r\n\t\t\tfuel -= (mass + fuel) / a[i]\r\n\r\n\t\t\tif fuel < 0.0:\r\n\t\t\t\treturn False\r\n\r\n\t\tfuel -= (mass + fuel) / b[0]\r\n\r\n\t\treturn fuel >= 0.0\r\n\r\n\r\ndef main():\r\n\r\n\tplanets = int(input())\r\n\tmass = int(input())\r\n\r\n\ta = [int(x) for x in input().split(' ')]\r\n\tb = [int(x) for x in input().split(' ')]\r\n\r\n\tif 1 in a or 1 in b:\r\n\t\tprint(-1)\r\n\t\treturn\r\n\r\n\tlow = 0.0\r\n\thigh = 1500000000.0\r\n\r\n\tfor i in range(60):\r\n\t\tmid = (low + high) / 2.0\r\n\r\n\t\tif can(a, b, mass, mid):\r\n\t\t\thigh = mid\r\n\t\telse:\r\n\t\t\tlow = mid\r\n\r\n\tprint(high)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "import sys\r\n\r\ndef bits(n: int):\r\n return list(bin(n)).count('1')\r\n\r\ndef main(test_case = False):\r\n n = int(input()) if test_case else 1\r\n for _ in range(n):\r\n test()\r\n\r\ndef flush():\r\n sys.stdout.flush()\r\n\r\ndef parr(arr):\r\n print(*arr, sep=' ')\r\n\r\ndef gcd(a, b):\r\n while b:\r\n if b % a == 0:\r\n break\r\n tmp = a\r\n a = b % a\r\n b = tmp\r\n return a\r\n\r\ndef solve(m, x):\r\n return m + m / (x - 1)\r\n\r\ndef test():\r\n n = int(input())\r\n m = int(input())\r\n c = m\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n for x in a:\r\n if x == 1:\r\n print(-1)\r\n exit()\r\n\r\n for x in b:\r\n if x == 1:\r\n print(-1)\r\n exit()\r\n\r\n\r\n for i in range(n):\r\n m = solve(m, b[-i])\r\n m = solve(m, a[-i-1])\r\n \r\n ans = m-c\r\n print('{:.9f}'.format(ans))\r\n\r\nmain(False)", "n = int(input())\r\nk = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\n\r\ndef prov(x):\r\n for u in range(n):\r\n ans = (k + x) / a[u]\r\n x -= ans\r\n if x <= 0:\r\n return 0\r\n ans = (k + x) / b[u]\r\n x -= ans\r\n if x <= 0:\r\n return 0\r\n return 1\r\n\r\n\r\nl = 0\r\nr = 1e9 + 1\r\n\r\nfor i in range(1000):\r\n m = (l + r) / 2\r\n if prov(m):\r\n r = m\r\n else:\r\n l = m\r\n\r\nEPS = 1e-6\r\nif abs(1e9 + 1 - l) < EPS:\r\n print(-1)\r\nelse:\r\n print(l)", "n = int(input())\r\nrm = m = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif min(a+b) is 1:\r\n print(-1)\r\nelse:\r\n for i in range(n-1,-1,-1):\r\n m += m / (a[(i + 1) % n] - 1)\r\n m += m / (b[i] - 1)\r\n print(round(m - rm,7))\r\n", "\ndef solve():\n n = int(input())\n a = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n if (1 in A) or (1 in B):\n print(-1)\n return\n z = A[0], A[-1], B[0], B[-1]\n x = 1\n for e in A[1:-1]:\n x *= e/(e-1)\n y = 1\n for e in B[1:-1]:\n y *= e/(e-1)\n p = 1\n for e in z:\n p *= e/(e-1)\n print(a * (p * (x) * (y) - 1))\n\nsolve()\n", "n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=m\r\nfor x in a:\r\n if x<=1:\r\n ans=-1\r\nfor x in b:\r\n if x<=1:\r\n ans=-1\r\nif ans==-1:\r\n print(-1)\r\n exit()\r\nans+=ans/(a[0]-1)\r\nfor i in range(n-1,0,-1):\r\n ans+=ans/(b[i]-1)\r\n ans+=ans/(a[i]-1)\r\nans+=ans/(b[0]-1)\r\nprint(ans-m)\r\n", "from bisect import bisect\r\nfrom collections import defaultdict\r\n# l = list(map(int,input().split()))\r\n# map(int,input().split()))\r\nfrom math import gcd,sqrt,ceil,inf\r\nfrom collections import Counter\r\nimport sys\r\nsys.setrecursionlimit(1000000)\r\nfrom bisect import bisect\r\nfrom collections import defaultdict\r\n# l = list(map(int,input().split()))\r\n# map(int,input().split()))\r\nfrom math import gcd,sqrt,ceil,inf\r\nfrom collections import Counter\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\n\r\ndef check(w,f):\r\n # f = f-((w+f)/l1[0])\r\n\r\n for i in range(n):\r\n\r\n if f>0:\r\n f = f-((w+f)/l1[i])\r\n\r\n if f>0:\r\n f = f-((w+f)/l2[(i+1)%n])\r\n else:\r\n return False\r\n else:\r\n return False\r\n if f<0:\r\n return False\r\n return True\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nw = int(input())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\n\r\n\r\n\r\ndef solve():\r\n l = 0\r\n r = 10**9\r\n while r>=l:\r\n f = l+(r-l)/2\r\n # print(f)\r\n if check(w,f):\r\n r = f-(1/(10**6))\r\n else:\r\n l = f+(1/(10**6))\r\n\r\n if check(w,l-(1/(10**6))):\r\n return l-(1/(10**6))\r\n elif check(w,l):\r\n return l\r\n elif check(w,l+(1/(10**6))):\r\n return l+(1/(10**6))\r\n return -1\r\n\r\n\r\n# print(check(w,9))\r\nprint(solve())\r\n\r\n\r\n\r\n\r\n\r\n", "input()\r\nm=int(input())\r\nv=m\r\ntry:\r\n for a in map(int, input().split() + input().split()):\r\n v*=a\r\n v/=a-1\r\n print(v-m)\r\nexcept ZeroDivisionError:\r\n print(-1)", "N,M=int(input()),int(input())\r\nu,d=[*map(int,input().split())],[*map(int,input().split())]\r\nif d[0] == 1:\r\n print(-1)\r\n exit(0)\r\nneed = M / (d[0] - 1)\r\nif need <= 0:\r\n print(-1)\r\n exit(0)\r\nfor i in range(N - 1, 0, -1):\r\n if u[i] == 1:\r\n print(-1)\r\n exit(0)\r\n need = (M+need*u[i])/(u[i]-1)\r\n if need <= 0:\r\n print(-1)\r\n exit(0)\r\n if d[i] == 1:\r\n print(-1)\r\n exit(0)\r\n need = (M+need*d[i])/(d[i]-1)\r\n if need <= 0:\r\n print(-1)\r\n exit(0)\r\nif u[0] == 1:\r\n print(-1)\r\n exit(0)\r\nneed = (M+need*u[0])/(u[0]-1)\r\nif need <= 0:\r\n print(-1)\r\n exit(0)\r\nprint('%.15f' % need)", "from decimal import *\r\ngetcontext().prec = 28\r\nn,m=int(input()),int(input())\r\nlift=list(map(int,input().split()))\r\ndrop=list(map(int,input().split()))\r\nfuel=0\r\nif drop[0]==1:\r\n exit(print(-1))\r\nelse:\r\n r=Decimal(m)/Decimal(drop[0]-1)\r\n m+=r;fuel+=r\r\nlift=lift[::-1];drop=drop[::-1]\r\nfor i in range(n-1):\r\n if lift[i]==1:\r\n exit(print(-1))\r\n else:\r\n r=Decimal(m)/Decimal(lift[i]-1)\r\n m+=r;fuel+=r\r\n if drop[i]==1:\r\n exit(print(-1))\r\n else:\r\n r=Decimal(m)/Decimal(drop[i]-1)\r\n m+=r;fuel+=r\r\nif lift[n-1]==1:\r\n exit(print(-1))\r\nelse:\r\n r=Decimal(m)/Decimal(lift[n-1]-1)\r\n m+=r;fuel+=r\r\nprint(fuel)", "n = int(input())\nm = int(input())\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\np = 1\nq = 1\nfor i in range(n):\n aa = a[i]\n bb = b[(i+1)%n]\n p *= (aa-1) * (bb-1)\n q *= aa * bb\nprint(-1 if p == 0 else m * q / p - m)\n", "from sys import stdin\ninput = stdin.readline\n\ndef answer(m):\n\n # ans + x = a[i]*x\n # x = (ans / (a[i] - 1))\n\n ans = 0\n for i in range(n):\n\n if(a[i] == 1 or b[(i + 1)%n] == 1):return -1\n\n ans += (m / (a[i] - 1))\n m += (m / (a[i] - 1))\n ans += (m / (b[(i + 1)%n] - 1))\n m += (m / (b[(i + 1)%n] - 1))\n\n return ans\n\nfor T in range(1):\n\n n = int(input())\n m = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n \n print(answer(m))\n\n \t\t\t\t \t\t\t \t\t\t\t \t\t \t\t\t\t\t \t \t", "import sys\r\nfrom itertools import chain\r\n\r\nn = int(input())\r\npayload = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nc = list(chain.from_iterable(zip(a, b)))\r\nc = c[1:] + [c[0]]\r\n\r\nweight = payload\r\nfor i in c:\r\n if i == 1:\r\n print(-1)\r\n sys.exit()\r\n weight *= i/(i-1)\r\n\r\nprint(weight-payload)", "n = int(input())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif min(a) == 1 or min(b) == 1:\r\n print(-1); exit(0)\r\n\r\nans = m\r\nans += ans/(a[0] - 1) # mars\r\nfor i in range(n-1, 0, -1):\r\n ans += ans/(b[i] - 1) # landing\r\n ans += ans/(a[i] - 1) # takeoff\r\nans += ans/(b[0] - 1) # earth\r\n\r\nprint(ans - m)\r\n\r\n", "rd = lambda: list(map(int, input().split()))\nn, m = rd(), rd()[0]\nr = m\nfor x in rd() + rd():\n if x > 1:\n r *= x\n r /= x - 1\n else:\n print(-1)\n exit()\nprint(r - m)\n", "from sys import stdin\r\nn=int(stdin.readline())\r\nm=int(stdin.readline())\r\na=[int(x) for x in stdin.readline().split()]\r\nb=[int(x) for x in stdin.readline().split()]\r\nw = m\r\nfor i in range(n):\r\n ax = a[-i-1]\r\n bx = b[-i]\r\n if ax == 1 or bx == 1:\r\n print(-1)\r\n exit()\r\n w += w/(bx-1.0)\r\n w += w/(ax-1.0)\r\nprint(w-m)", "n = int(input())\r\np = int(input())\r\nR = lambda :map(int,input().split())\r\na = list(R())\r\nb = list(R())\r\n\r\nt = 1 \r\nfor i in range(n) :\r\n\tt *= (1- (1/a[i]))*(1- (1/b[i]))\r\n\r\nif t >= 1 or t == 0 :\r\n\tprint(-1)\r\nelse :\r\n\tprint(p*((1-t)/t))", "n = int(input())\nm = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = m\n\nfor i in range(n):\n if b[-i] != 1:\n e = ans/(b[-i]-1)\n ans += e\n if a[n-i-1] != 1:\n e = ans/(a[n-i-1]-1)\n ans += e\n else:\n print(-1)\n exit()\n else:\n print(-1)\n exit()\nprint(ans-m)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = int(input())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nd = [s[0]]\r\nfor i in range(n-1, -1, -1):\r\n d.append(w[i])\r\n if i == 0:\r\n break\r\n d.append(s[i])\r\n\r\nc = 0\r\nfor i in range(2*n):\r\n if d[i] == 1:\r\n print(-1)\r\n exit()\r\n\r\n a = x/(d[i]-1)\r\n c += a\r\n x += a\r\nprint(c)\r\n", "n = int(input())\r\nrm = int(input())\r\n\r\nt = [int(i) for i in input().split(\" \")]\r\nl = [int(i) for i in input().split(\" \")]\r\n\r\nif 1 in t or 1 in l:\r\n\tprint(-1)\r\nelse:\r\n\tans = rm \r\n\tans += ans / (t[0] - 1)\r\n\tfor i in range(n - 1, 0, -1):\r\n\t\tans += ans / (l[i] - 1)\r\n\t\tans += ans / (t[i] - 1)\r\n\tans += ans / (l[0] - 1)\r\n\tans -= rm\r\n\tprint(ans)\r\n", "from decimal import Decimal, getcontext\r\ngetcontext().prec = 1000\r\nn = int(input())\r\nm = Decimal(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif a.count(1) or b.count(1):\r\n print(-1)\r\n exit(0)\r\na = list(map(Decimal, a))\r\nb = list(map(Decimal, b))\r\nans = Decimal(1)\r\nfor i in range(n):\r\n ans = ans * a[i] / (a[i] - Decimal(1))\r\n ans = ans * b[i] / (b[i] - Decimal(1))\r\nans -= 1\r\nprint('%.100f' % (Decimal(m) * ans))", "n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split(\" \")))\r\nb=list(map(int,input().split(\" \")))\r\nnumerator=m\r\ndenominator=1\r\nfor i in range(n):\r\n\tnumerator*=a[i]\r\n\tnumerator*=b[i]\r\n\tdenominator*=(a[i]-1)\r\n\tdenominator*=(b[i]-1)\r\n\r\nif denominator==0:\r\n\tprint(-1)\r\nelse:\r\n\tans=numerator/denominator-m\r\n\tprint(ans)", "n, m = int(input()), int(input())\r\nm1 = m\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif 1 in set(a) or 1 in set(b):\r\n\tprint(-1)\r\nelse:\r\n\tfor i in a + b:\r\n\t\tm *= i/(i-1)\r\n\tprint(m - m1)", "NPlanetas=int(input())\nMasaCohete=int(input())\nCoeficientesDespegue1=input()\nCoeficientesLanding1=input()\nCoeficientesDespegue = [float(i) for i in CoeficientesDespegue1.split(\" \")]\nCoeficientesLanding = [float(i) for i in CoeficientesLanding1.split(\" \")]\n\nlanding=-1\ntakeoff=1\nNPlanetas=int(NPlanetas)\nMasaCohete=int(MasaCohete)\ntry:\n W=float(MasaCohete)\n W=W*(1/(1-1/float(CoeficientesLanding[0])))\n for i in range(1,NPlanetas):\n if landing==1:\n W=W*(1/(1-1/float(CoeficientesLanding[NPlanetas-i])))\n if takeoff==1:\n W=W*(1/(1-1/float(CoeficientesDespegue[NPlanetas-i])))\n landing=landing*(-1)\n takeoff=takeoff*(-1)\n if landing==1:\n W=W*(1/(1-1/float(CoeficientesLanding[NPlanetas-i])))\n if takeoff==1:\n W=W*(1/(1-1/float(CoeficientesDespegue[NPlanetas-i])))\n landing=landing*(-1)\n takeoff=takeoff*(-1)\n W=W*(1/(1-1/float(CoeficientesDespegue[0])))\n W=W-MasaCohete\n print(W)\nexcept:\n print('-1')\n \t \t\t \t\t \t \t \t \t \t \t \t\t\t\t", "import sys\r\ninput=sys.stdin.readline\r\nimport bisect\r\n\r\nn=int(input())\r\nm=int(input())\r\na=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\n\r\nif 1 in a or 1 in b:\r\n sys.stdout.write(str(-1)+'\\n')\r\nelse:\r\n ans=m\r\n for i in range(n):\r\n ans=ans/(1-(1/a[i]))\r\n ans=ans/(1-(1/b[i]))\r\n if m>=ans:sys.stdout.write(str(-1)+'\\n')\r\n else:\r\n ans=round(ans-m,6)\r\n sys.stdout.write(str(ans)+'\\n')", "n = int(input())\r\nm = int(input())\r\ntoff = list(map(int, input().split()))\r\nland = list(map(int, input().split()))\r\ncoff = 1\r\nfor i in toff + land:\r\n coff *= (1-(1/i))\r\ntry:\r\n print(m*((1/coff)-1))\r\nexcept:\r\n print(-1)", "n = int(input())\r\nm = float(input())\r\na = list(map(float, input().split()))\r\nb = list(map(float, input().split()))\r\na += a[0],\r\nb += b[0],\r\nlo = 0.0\r\nhi = 1e20\r\n\r\ndef test(f):\r\n for i in range(n):\r\n if (m + f) > f * a[i]:\r\n return 0\r\n f -= (m + f) / a[i]\r\n if (m + f) > f * b[i + 1]:\r\n return 0\r\n f -= (m + f) / b[i + 1]\r\n return 1\r\n\r\nfor _ in range(100):\r\n mid = (lo + hi) / 2.0\r\n if test(mid):\r\n hi = mid\r\n else:\r\n lo = mid\r\nif hi < 1e19:\r\n print('%.17f' % hi)\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\nm=int(input())\r\nh=m\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif 1 in a or 1 in b:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n m+=m/(a[i]-1)\r\n m+=m/(b[i]-1)\r\n print(m-h)\r\n", "\r\n\r\nN = int(input())\r\nM = int(input())\r\n\r\n\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\n\r\n\r\nright = 10**9+3\r\nleft = 0\r\ndef works(x):\r\n w = M+x\r\n for i in range(N):\r\n x -= w/A[i]\r\n if x < 0:\r\n return False\r\n w = M+x\r\n x -= w/B[(i+1)%N]\r\n if x < 0:\r\n return False\r\n w = M+x\r\n return x >= 0\r\n\r\nwhile right-left > 10**(-6):\r\n middle = (left+right)/2\r\n if works(middle):\r\n right = middle\r\n else:\r\n left = middle\r\nprint(right if right <= 10**9+0.01 else -1)\r\n", "def getUsefulWeight(coef, uw):\r\n if coef == 1:\r\n print(-1)\r\n exit(0)\r\n uw += (uw/(coef-1))\r\n return uw\r\n\r\nn = int(input().strip())\r\nm = float(input().strip())\r\n\r\na = list(map(int, input().strip().split(\" \")))\r\nb = list(map(int, input().strip().split(\" \")))\r\n\r\nuw = m\r\ncoef = b[0]\r\n\r\nuw = getUsefulWeight(coef, uw)\r\n\r\nfor i in range(len(a)-1, 0, -1):\r\n coef = a[i]\r\n uw = getUsefulWeight(coef, uw)\r\n coef = b[i]\r\n uw = getUsefulWeight(coef, uw)\r\n\r\ncoef = a[0]\r\nuw = getUsefulWeight(coef, uw)\r\nprint(uw-m)\r\n\r\n\r\n", "def I(): return(list(map(int,input().split())))\r\n\r\nn=int(input())\r\nm=int(input())\r\na=I()\r\nb=I()\r\nf=0\r\nfor i in range(n):\r\n\tif a[i]==1 or b[i]==1:\r\n\t\tf=1\r\n\t\tbreak\r\nif f:\r\n\tprint(-1)\r\nelse:\r\n\tminfuel=m\r\n\tfor i in range(1,n-1):\r\n\t\tminfuel/=((1-1/a[i])*(1-1/b[i]))\r\n\tminfuel/=((1-1/a[0])*(1-1/b[0])*(1-1/a[-1])*(1-1/b[-1]))\r\n\tprint(minfuel-m)\r\n\r\n" ]

[ "def main():\r\n n, m = map(int, input().split())\r\n nails = []\r\n for _ in range(n):\r\n nails.append(tuple(map(int, input().split())))\r\n rods = list(map(int, input().split()))\r\n rods_count1, rods_count2 = {}, {}\r\n for i, rod in enumerate(rods):\r\n if rod not in rods_count1:\r\n rods_count1[rod] = [i]\r\n else:\r\n rods_count1[rod].append(i)\r\n if rod not in rods_count2:\r\n rods_count2[rod] = [i]\r\n else:\r\n rods_count2[rod].append(i)\r\n\r\n ans = []\r\n for i in range(0, n, 2):\r\n if i < n - 2:\r\n rod_len = abs(nails[i][0] - nails[i + 2][0]) + abs(nails[i][1] - nails[i + 2][1])\r\n else:\r\n rod_len = abs(nails[i][0] - nails[0][0]) + abs(nails[i][1] - nails[0][1])\r\n if rod_len not in rods_count1:\r\n break\r\n else:\r\n ans.append(-1)\r\n ans.append(rods_count1[rod_len].pop() + 1)\r\n if not rods_count1[rod_len]:\r\n del rods_count1[rod_len]\r\n else:\r\n print(\"YES\")\r\n print(' '.join(map(str, ans)))\r\n return\r\n last_nail = nails.pop()\r\n nails.insert(0, last_nail)\r\n ans = []\r\n for i in range(0, n, 2):\r\n if i < n - 2:\r\n rod_len = abs(nails[i][0] - nails[i + 2][0]) + abs(nails[i][1] - nails[i + 2][1])\r\n else:\r\n rod_len = abs(nails[i][0] - nails[0][0]) + abs(nails[i][1] - nails[0][1])\r\n if rod_len not in rods_count2:\r\n break\r\n else:\r\n ans.append(rods_count2[rod_len].pop() + 1)\r\n ans.append(-1)\r\n if not rods_count2[rod_len]:\r\n del rods_count2[rod_len]\r\n else:\r\n print(\"YES\")\r\n print(' '.join(map(str, ans)))\r\n return\r\n\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#Code by Sounak, IIESTS\r\n#------------------------------warmup----------------------------\r\n\r\nimport os\r\nimport sys\r\nimport math\r\nfrom io import BytesIO, IOBase\r\nfrom fractions import Fraction\r\nimport collections\r\nfrom itertools import permutations\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nimport threading\r\n\r\n\r\n\r\n\r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n#-------------------game starts now-----------------------------------------------------\r\nclass Factorial:\r\n def __init__(self, MOD):\r\n self.MOD = MOD\r\n self.factorials = [1, 1]\r\n self.invModulos = [0, 1]\r\n self.invFactorial_ = [1, 1]\r\n \r\n def calc(self, n):\r\n if n <= -1:\r\n print(\"Invalid argument to calculate n!\")\r\n print(\"n must be non-negative value. But the argument was \" + str(n))\r\n exit()\r\n if n < len(self.factorials):\r\n return self.factorials[n]\r\n nextArr = [0] * (n + 1 - len(self.factorials))\r\n initialI = len(self.factorials)\r\n prev = self.factorials[-1]\r\n m = self.MOD\r\n for i in range(initialI, n + 1):\r\n prev = nextArr[i - initialI] = prev * i % m\r\n self.factorials += nextArr\r\n return self.factorials[n]\r\n \r\n def inv(self, n):\r\n if n <= -1:\r\n print(\"Invalid argument to calculate n^(-1)\")\r\n print(\"n must be non-negative value. But the argument was \" + str(n))\r\n exit()\r\n p = self.MOD\r\n pi = n % p\r\n if pi < len(self.invModulos):\r\n return self.invModulos[pi]\r\n nextArr = [0] * (n + 1 - len(self.invModulos))\r\n initialI = len(self.invModulos)\r\n for i in range(initialI, min(p, n + 1)):\r\n next = -self.invModulos[p % i] * (p // i) % p\r\n self.invModulos.append(next)\r\n return self.invModulos[pi]\r\n \r\n def invFactorial(self, n):\r\n if n <= -1:\r\n print(\"Invalid argument to calculate (n^(-1))!\")\r\n print(\"n must be non-negative value. But the argument was \" + str(n))\r\n exit()\r\n if n < len(self.invFactorial_):\r\n return self.invFactorial_[n]\r\n self.inv(n) # To make sure already calculated n^-1\r\n nextArr = [0] * (n + 1 - len(self.invFactorial_))\r\n initialI = len(self.invFactorial_)\r\n prev = self.invFactorial_[-1]\r\n p = self.MOD\r\n for i in range(initialI, n + 1):\r\n prev = nextArr[i - initialI] = (prev * self.invModulos[i % p]) % p\r\n self.invFactorial_ += nextArr\r\n return self.invFactorial_[n]\r\n \r\n \r\nclass Combination:\r\n def __init__(self, MOD):\r\n self.MOD = MOD\r\n self.factorial = Factorial(MOD)\r\n \r\n def ncr(self, n, k):\r\n if k < 0 or n < k:\r\n return 0\r\n k = min(k, n - k)\r\n f = self.factorial\r\n return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD\r\n#-------------------------------------------------------------------------\r\ndef dist(a, b):\r\n return abs(a[0] - b[0]) + abs(a[1] - b[1])\r\n \r\n \r\ndef get_sorted_required_pruts(dists):\r\n res = [dists[i * 2] + dists[i * 2 + 1] for i in range(len(dists) // 2)]\r\n res = [(i, x) for i, x in enumerate(res)]\r\n return sorted(res, key=lambda x: x[1])\r\n \r\n \r\ndef get_answer(pruts, required_pruts):\r\n i = 0\r\n j = 0\r\n answer = \"YES\"\r\n seq = []\r\n while i < len(required_pruts):\r\n if j == len(pruts):\r\n answer = \"NO\"\r\n return answer, None\r\n if pruts[j][1] > required_pruts[i][1]:\r\n answer = \"NO\"\r\n return answer, None\r\n if pruts[j][1] < required_pruts[i][1]:\r\n j += 1\r\n else:\r\n seq.append((required_pruts[i][0], pruts[j][0] + 1))\r\n i += 1\r\n j += 1\r\n return answer, [x[1] for x in sorted(seq)]\r\n \r\n \r\nn, m = map(int,input().split())\r\n \r\ngvozdi = [None] * n\r\nfor i in range(n):\r\n gvozdi[i] = list(map(int,input().split()))\r\n \r\npruts = list(map(int,input().split()))\r\npruts = [(i, p) for i, p in enumerate(pruts)]\r\npruts = sorted(pruts, key=lambda x: x[1])\r\n \r\ndists = [dist(gvozdi[i], gvozdi[i + 1]) for i in range(len(gvozdi) - 1)]\r\ndists.append(dist(gvozdi[0], gvozdi[-1]))\r\n \r\neven_required_pruts = get_sorted_required_pruts(dists)\r\n# print(dists[-1:] + dists[:-1])\r\nodd_required_pruts = get_sorted_required_pruts(dists[-1:] + dists[:-1])\r\n \r\neven_answer, even_seq = get_answer(pruts, even_required_pruts)\r\nodd_answer, odd_seq = get_answer(pruts, odd_required_pruts)\r\n \r\nif even_answer == \"NO\" and odd_answer == \"NO\":\r\n print(\"NO\")\r\nelif even_answer == \"YES\":\r\n print(\"YES\")\r\n even_seq = [even_seq[i // 2] if i % 2 == 1 else -1 for i in range(n)]\r\n print(\" \".join(map(str, even_seq)))\r\nelse:\r\n print(\"YES\")\r\n # print(odd_seq)\r\n odd_seq = [odd_seq[i // 2] if i % 2 == 0 else -1 for i in range(n)]\r\n print(\" \".join(map(str, odd_seq)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(w, i):\r\n d = []\r\n while i < n:\r\n d.append((ff(w[(i-1)%n], w[i]) + ff(w[i], w[(i+1)%n]), i))\r\n i += 2\r\n d.sort()\r\n i, j, ew, h = 0, 0, 1, []\r\n for i in range(len(d)):\r\n if j == m:\r\n ew = 0\r\n break\r\n while d[i][0] != q[j][0]:\r\n j += 1\r\n if j == m:\r\n ew = 0\r\n break\r\n if j == m:\r\n ew = 0\r\n break\r\n h.append((d[i][1], q[j][1]))\r\n j += 1\r\n\r\n return (ew, h)\r\n\r\n\r\ndef ff(x, y):\r\n return abs(sum(x)-sum(y))\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\nq = sorted([(j, i+1) for i, j in enumerate(map(int, input().split()))])\r\nfor i, j in [f(g, 0), f(g, 1)]:\r\n if i:\r\n print('YES')\r\n d = [-1]*n\r\n for u, v in j:\r\n d[u] = v\r\n print(' '.join(map(str, d)))\r\n break\r\nelse:\r\n print('NO')", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\nfrom collections import Counter\r\n\r\nn,m = S()\r\nif m*2<n: print(\"NO\"); exit()\r\na = [[*S()] for _ in range(n)]\r\na += a[0],\r\nb = [abs(a[i][0]-a[i+1][0])+abs(a[i][1]-a[i+1][1]) for i in range(n)]\r\nr = [*S()]\r\ncr = Counter(r)\r\nfor k in -1,1:\r\n b1 = [b[2*i]+b[2*i+k] for i in range(n//2)]\r\n c1 = Counter(b1)\r\n if all(c1[k]<=cr[k] for k in c1):\r\n print(\"YES\")\r\n w = [-1]*n\r\n d = {}\r\n for i,x in enumerate(r,1):\r\n if x in d: d[x] += i,\r\n else: d[x] = [i]\r\n for j in range(n//2):\r\n w[2*j+(k+1)//2] = d[b1[j]].pop()\r\n print(*w)\r\n exit()\r\nprint(\"NO\")", "import sys\r\n\r\n\r\ndef ff(x, y):\r\n return abs(sum(x)-sum(y))\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\npoints = [tuple(map(int, input().split())) for i in range(n)]\r\npoints.append(points[0])\r\nsegments = []\r\n\r\nfor i in range(n):\r\n segments.append(ff(points[i], points[i + 1]))\r\n\r\nrods = list(map(int, input().split()))\r\nrod_indices = {}\r\nfor index, rod in enumerate(rods):\r\n rod_indices.setdefault(rod, []).append(index + 1)\r\n\r\nfor offset in range(2):\r\n target_indices = rod_indices.copy()\r\n assignment = [-1 for i in range(n)]\r\n for i in range(offset, n, 2):\r\n target = segments[(i - 1) % n] + segments[i]\r\n if target not in target_indices or target_indices[target] == []:\r\n assignment = None\r\n break\r\n assignment[i] = target_indices[target].pop()\r\n if assignment != None:\r\n print('YES')\r\n print(' '.join(map(str, assignment)))\r\n sys.exit()\r\n\r\nprint('NO')", "n, m = map(int,input().split())\r\ndist = [0 for i in range(n)]\r\nnails = []\r\nfor i in range(n):\r\n nails.append(tuple(map(int,input().split())))\r\nrods = list(map(int,input().split()))\r\nrods_d_1 = {}\r\nrods_d_2 = {}\r\nfor i in range(m):\r\n if rods[i] in rods_d_1:\r\n rods_d_1[rods[i]].append(i)\r\n rods_d_2[rods[i]].append(i) \r\n else:\r\n rods_d_1[rods[i]] = [i]\r\n rods_d_2[rods[i]] = [i]\r\n\r\nfor i in range(n):\r\n if i == n-1:\r\n dist[i] = abs(nails[i][0] - nails[0][0]) + abs(nails[i][1] - nails[0][1])\r\n else:\r\n dist[i] = abs(nails[i][0] - nails[i+1][0]) + abs(nails[i][1] - nails[i+1][1])\r\n\r\nif sum(dist) > sum(rods):\r\n print('NO')\r\nelse:\r\n e_nails = []\r\n o_nails = [dist[0]+dist[-1]]\r\n for i in range(n-1):\r\n if i%2 == 0:\r\n e_nails.append(dist[i] + dist[i+1])\r\n else:\r\n o_nails.append(dist[i] + dist[i+1])\r\n e_ind = []\r\n o_ind = []\r\n for seg in e_nails:\r\n if seg not in rods_d_1:\r\n break\r\n else:\r\n e_ind.append(rods_d_1[seg][0])\r\n rods_d_1[seg].remove(rods_d_1[seg][0])\r\n if len(rods_d_1[seg]) == 0:\r\n del rods_d_1[seg]\r\n\r\n for seg in o_nails:\r\n if seg not in rods_d_2:\r\n break\r\n else:\r\n o_ind.append(rods_d_2[seg][0])\r\n rods_d_2[seg].remove(rods_d_2[seg][0])\r\n if len(rods_d_2[seg]) == 0:\r\n del rods_d_2[seg]\r\n\r\n if len(e_ind) == n//2:\r\n print('YES')\r\n print(*[-1 if i%2 != 1 else e_ind[(i-1)//2]+1 for i in range(n)])\r\n elif len(o_ind) == n//2:\r\n print('YES')\r\n print(*[-1 if i%2 == 1 else o_ind[i//2]+1 for i in range(n)])\r\n else: print('NO') \r\n", "from collections import defaultdict\n\n\ndef main():\n n, m = map(int, input().split())\n tmp = list(tuple(map(int, input().split())) for _ in range(n))\n nails = [abs(a - c) + abs(b - d) for (a, b), (c, d) in zip(tmp, tmp[2:] + tmp[:2])]\n segments = defaultdict(list)\n for i, s in enumerate(map(int, input().split()), 1):\n segments[s].append(i)\n for shift in -1, 0:\n res = [-1] * n\n for nailidx in range(shift, n + shift, 2):\n nail = nails[nailidx]\n if nail in segments and segments[nail]:\n res[(nailidx + 1) % n] = segments[nail].pop()\n else:\n break\n else:\n print(\"YES\")\n print(\" \".join(map(str, res)))\n return\n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\n\r\nnum_nails, num_segments = map(int, input().split())\r\nnail_coordinates = [tuple(map(int, input().split())) for _ in range(num_nails)]\r\nnail_distances = [abs(a - c) + abs(b - d) for (a, b), (c, d) in zip(nail_coordinates, nail_coordinates[2:] + nail_coordinates[:2])]\r\n\r\nsegment_indices = defaultdict(list)\r\nfor idx, segment_length in enumerate(map(int, input().split()), 1):\r\n segment_indices[segment_length].append(idx)\r\n\r\nfor shift in -1, 0:\r\n result = [-1] * num_nails\r\n for nail_idx in range(shift, num_nails + shift, 2):\r\n nail_distance = nail_distances[nail_idx]\r\n if nail_distance in segment_indices and segment_indices[nail_distance]:\r\n result[(nail_idx + 1) % num_nails] = segment_indices[nail_distance].pop()\r\n else:\r\n break\r\n else:\r\n print(\"YES\")\r\n print(\" \".join(map(str, result)))\r\n exit(0)\r\n\r\nprint(\"NO\")\r\n", "n,m = map(int,input().split())\r\n \r\ns = []\r\nfor i in range(n):\r\n a = map(int,input().split())\r\n a = list(a)\r\n s.append(a)\r\ns_chet = []\r\nfor i in range(1,n-1,2): #Проход по четным гвоздям\r\n q = abs((s[i][0]-s[i-1][0])+(s[i][1]-s[i-1][1])) + abs((s[i][0]-s[i+1][0])+(s[i][1]-s[i+1][1]))\r\n s_chet.append((i + 1, q))\r\nq = abs((s[-1][0]-s[-2][0])+(s[-1][1]-s[-2][1])) + abs((s[-1][0]-s[0][0])+(s[-1][1]-s[0][1]))\r\ns_chet.append((n, q))\r\n \r\ns_nechet = []\r\nfor i in range(2,n-1,2): #Проход по нечетным гвоздям\r\n q = abs((s[i][0]-s[i-1][0])+(s[i][1]-s[i-1][1])) + abs((s[i][0]-s[i+1][0])+(s[i][1]-s[i+1][1]))\r\n s_nechet.append((i + 1, q))\r\nq = abs((s[-1][0]-s[0][0])+(s[-1][1]-s[0][1])) + abs((s[1][0]-s[0][0])+(s[1][1]-s[0][1]))\r\ns_nechet.append((1, q))\r\n \r\nss = map(int, input().split())\r\nss = [[i + 1, ss_i] for i, ss_i in enumerate(ss)]\r\n\r\ns_chet.sort(key=lambda x: x[1])\r\ns_nechet.sort(key=lambda x: x[1])\r\nss.sort(key=lambda x: x[1])\r\n\r\nprut_chet = [-1] * n\r\nchet = True\r\nj = 0\r\nfor i in range(len(s_chet)):\r\n while j < len(ss) and ss[j][1] < s_chet[i][1]:\r\n j += 1\r\n if j == len(ss) or ss[j][1] > s_chet[i][1]:\r\n chet = False\r\n break\r\n if s_chet[i][1] == ss[j][1]:\r\n prut_chet[s_chet[i][0] - 1] = ss[j][0]\r\n j += 1\r\n continue\r\nif chet:\r\n print('YES')\r\n print(\" \".join(map(str,prut_chet)))\r\n \r\nelse:\r\n prut_nechet = [-1] * n\r\n nechet = True\r\n j = 0\r\n for i in range(len(s_nechet)):\r\n while j < len(ss) and ss[j][1] < s_nechet[i][1]:\r\n j += 1\r\n if j == len(ss) or ss[j][1] > s_nechet[i][1]:\r\n nechet = False\r\n break\r\n if s_nechet[i][1] == ss[j][1]:\r\n prut_nechet[s_nechet[i][0] - 1] = ss[j][0]\r\n j += 1\r\n continue\r\n if nechet:\r\n print('YES')\r\n print(\" \".join(map(str, prut_nechet)))\r\n else:\r\n print('NO')\r\n" ]

[ "x , y = map(int, input().split())\r\na = [x,y,y-x,-x,-y,x-y]\r\nn = int(input())\r\nif n<=6:\r\n print(a[n-1]%1000000007)\r\nelse:\r\n print(a[(n%6)-1] % 1000000007)", "n,m=map(int,input().split())\r\na=int(input())\r\nl=[n,m,m-n,n*-1,m*-1,n-m]\r\nr=l[((a-1)%6)]\r\nprint(r%1000000007)", "def slv(x):\r\n MOD = 1000000007\r\n return x % MOD\r\n\r\n\r\n\r\nx,y=map(int,input().split())\r\nbrute=[x,y,y-x,-x,-y,x-y]\r\nk=int(input())\r\nans=brute[(k%6)-1]\r\nprint(slv(ans))\r\n", "f1,f2 = map(int, input().split())\r\nn = int(input())\r\nmd = 10**9+7\r\nif ((n-1)//3)%2==0:\r\n ans = ([f1, f2, f2-f1][(n-1)%3])%md\r\nelse:\r\n ans = ([-f1, -f2, f1-f2][(n-1)%3])%md\r\nprint(ans)", "x, y = map(int, input().split())\nn = int(input())\nlst = [x, y]\ni = 1\nwhile i < 6:\n p = lst[i] - lst[i-1]\n lst.append(p)\n i += 1\nans = lst[(n-1)%6]\n# print(ans)\nprint(ans%(10**9 + 7))", "\r\ndef solve(x,y,n):\r\n dp=[x,y,0,0,0,0]\r\n for i in range(2,6):\r\n dp[i]=dp[i-1]-dp[i-2]\r\n print(dp[(n-1)%6]%1000000007)\r\n\r\n\r\nx,y=[int(x) for x in input().split()]\r\nn=int(input())\r\nsolve(x,y,n)", "from sys import stdin,stdout\r\n\r\ninput = lambda : stdin.readline().rstrip()\r\nprint = stdout.write\r\n\r\nx, y = map(int, input().split())\r\nn = int(input())\r\nprint(str((x,y,y-x,-x,-y,x-y,x,y,y-x)[(n-1)%6]%1000000007))", "a, b = map(int, input().split())\r\nn = int(input())\r\nm = 1000000007\r\nc = [a - b, a, b, b - a, -a, -b]\r\nprint((c[n % 6] + 2 * m) % m)\r\n", "x, y = list(map(int,input().split()))\r\nn = int(input())\r\nmod = int(1e9 + 7)\r\narr = [x - y, x, y, y - x, -x, -y]\r\nprint(arr[n % 6] % mod)\r\n", "mod = 1000000007\r\nx , y = map(int , input().split())\r\nidx = int(input())\r\nar = []\r\nar.append(x)\r\nar.append(y)\r\nfor i in range(10):\r\n res = y - x\r\n ar.append(res)\r\n x=y\r\n y=res\r\nprint(ar[(idx%6)-1]%mod)\r\n", "x,y=map(int, input().split())\r\nn=int(input())\r\nmod=1000000007\r\nif n%6==0:\r\n print((x-y)%mod)\r\nelif n%6==1:\r\n print((x)%mod)\r\nelif n%6==2:\r\n print((y)%mod)\r\nelif n%6==3:\r\n print((y-x)%mod)\r\nelif n%6==4:\r\n print((-x)%mod)\r\nelif n%6==5:\r\n print((-y)%mod)", "xy = list(map(int, input().split()))\r\nn = int(input())\r\nx, y = xy[0], xy[1]\r\nseq = [x, y, y - x, -x, -y, x - y]\r\nans = seq[(n % 6) - 1] % 1000000007\r\nprint(ans)", "mod=1e9+7\r\n\r\nx,y=map(int,input().split())\r\nn=int(input())\r\na=[x,y,y-x,-x,-y,x-y]\r\nres=int((a[(n-1)%6]+mod)%mod)\r\nprint(res)", "x,y=map(int,input().split())\r\nn=int(input())\r\nn-=1\r\nli=[x,y,y-x,-x,-y,-y+x]\r\nn%=6\r\nprint(li[n]%1000000007)", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n x, y = [int(num) for num in input().split()]\r\n n = int(input())\r\n mod = 10 ** 9 + 7\r\n d = {\r\n 0: lambda x, y: x % mod,\r\n 1: lambda x, y: y % mod,\r\n 2: lambda x, y: (y - x) % mod,\r\n 3: lambda x, y: -x % mod,\r\n 4: lambda x, y: -y % mod,\r\n 5: lambda x, y: (-y + x) % mod,\r\n }\r\n print(d[(n - 1) % 6](x, y))\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", "import math\r\n\r\ndef solve(x, y, n):\r\n n -= 1\r\n a = [x, y, y - x, -x, -y, x - y]\r\n result = a[n % 6] % BASE if a[n % 6] >= 0 else (a[n % 6] % BASE + BASE) % BASE\r\n return result\r\n\r\nBASE = 1000000007\r\n\r\ndef main():\r\n t = 1\r\n for _ in range(t):\r\n x, y = map(int, input().split())\r\n n = int(input())\r\n result = solve(x, y, n)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b = list(map(int, input().split()))\r\nn = int(input())\r\nx = 0\r\ny = 0\r\nmod = int(1e9+7)\r\nif n%6 == 0:\r\n x = 1\r\nelif (n-1)%6 == 0:\r\n x = 1\r\nelif (n+1)%3 == 0:\r\n x = 0\r\nelse:\r\n x = -1\r\n\r\nif (n+2)%3 == 0:\r\n y = 0\r\nelif (n+4)%6 == 0:\r\n y = 1\r\nelif (n+3)%6 == 0:\r\n y = 1\r\nelse:\r\n y = -1\r\n\r\nprint((a*x + y*b)%mod)", "x,y = map(int,input().split())\r\nn = int(input())\r\n\r\na = [x,y,y-x,-x,-y,x-y]\r\n\r\nprint(a[(n-1)%6]%1000000007)", "X, Y = map(int, input().split())\r\nK = int(input())\r\nK %= 6\r\nif K == 1:\r\n\tprint((X + 1000000007) % 1000000007)\r\nelif K == 2:\r\n\tprint((Y + 1000000007) % 1000000007)\r\nelif K == 3:\r\n\tprint((Y - X + 1000000007 + 1000000007) % 1000000007)\r\nelif K == 4:\r\n\tprint((-X + 1000000007) % 1000000007)\r\nelif K == 5:\r\n\tprint((-Y + 1000000007) % 1000000007)\r\nelse:\r\n\tprint((X - Y + 1000000007 + 1000000007) % 1000000007)", "l=[int(x) for x in input().split()]\r\nn=int(input())\r\nx=l[0]\r\ny=l[1]\r\nm=[x,y,y-x,-x,-y,x-y]\r\nprint(m[(n%6)-1]%(10**9+7))", "a,b=map(int,input().split())\r\nn=int(input())\r\narr=[a,b,b-a,-a,-b,a-b]\r\nm=10**9 + 7\r\nprint(arr[(n-1)%6]%m)", "import math\r\n\r\ndef solve():\r\n mod = int(1e9) + 7\r\n x, y = map(int, input().split())\r\n n = int(input())\r\n n -= 1\r\n a = [x, y, y - x, -x, -y, x - y]\r\n n %= len(a)\r\n print(a[n] % mod)\r\n\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nwhile t:\r\n solve()\r\n t -= 1", "mod = int(1e9)+7\r\na,b = map(int,input().split())\r\nn = int(input())\r\nlst = [b-a,a,b]\r\nnum = n%3\r\nres = 1\r\nif ((n-1)//3)%2:\r\n res = -1\r\nprint((res*(lst[num])%mod))", "'''input\r\n2 3\r\n3\r\n\r\n'''\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\nx,y = getints()\r\nz = getint()\r\ndef f(n):\r\n\tif n==0: return x\r\n\tif n==1: return y\r\n\tif n<6: return f(n-1) - f(n-2)\r\n\treturn f(n%6)\r\n\r\n\r\nprint(f(z-1)%1000000007)", "x, y = map(int, input().split())\r\nprint([x, y, y-x, -x, -y, x-y][int(input()) % 6-1] % (10**9 + 7))\r\n", "x,y=map(int,input().split())\r\nn=int(input())\r\nl=[x,y]\r\nfor i in range(2,6):\r\n l.append(l[-1]-l[-2])\r\nprint(l[n%6-1]%1000000007)", "def sequence():\r\n x, y = map(int, input().split())\r\n seq_lst = {0: x-y, 1: x, 2: y, 3: y-x, 4: -x, 5: -y}\r\n n = int(input()) % 6\r\n result = seq_lst[n]\r\n return result % (10**9+7)\r\n\r\n\r\nprint(sequence())", "l = [0] * 7\r\nx, y = map(int, input().split())\r\nl[1], l[2] = x, y \r\nfor i in range(3, 7):\r\n l[i] = l[i - 1] - l[i - 2]\r\nn = int(input()) \r\nr = n % 6 if n % 6 !=0 else 6 \r\nprint(l[r] % (10 ** 9 + 7))", "def getRes(x,y,n):\r\n if n==0:\r\n return x\r\n elif n==1:\r\n return y\r\n elif n==2:\r\n return -x+y\r\n elif n==3:\r\n return -x\r\n elif n==4:\r\n return -y\r\n elif n==5:\r\n return x-y\r\n else:\r\n print('error')\r\n return 0\r\n\r\nx,y = list(map(int, input().split()))\r\nn = int(input())\r\n\r\nN = 1000000007\r\n\r\nn = (n-1)%6;\r\n\r\nres = 0\r\nres = getRes(x,y,n)\r\n\r\nres = res%N\r\n\r\nprint(res)\r\n", "x, y = map(int, input().split())\nn = int(input())\nn = n%6\nif n ==1:\n print(x%1000000007)\n exit()\nif n == 2:\n print(y%1000000007)\n exit()\nif n == 3:\n print((y-x)%1000000007)\n exit()\nif n == 4:\n print(-x%1000000007)\n exit()\nif n == 5:\n print(-y%1000000007)\n exit()\nif n == 0:\n print((x-y)%1000000007)\n exit()", "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\nx0,x1=map(int, input().split()) ; num=int(input()) ; arr=[x0,x1]\r\nfor i in range(4):\r\n arr.append(arr[-1]-arr[-2])\r\nprint(arr[num%6-1]%1000000007)", "x,y=map(int,input().split())\r\nlst=[x,y,y-x,-x,-y,x-y]\r\nn=int(input())\r\na=n%6\r\nprint(lst[a-1]%(((10**9)+7 )))", "x,y=map(int,input().split())\r\nn=int(input())\r\ns=n%6\r\nif(s==0):\r\n print((x-y)%1000000007)\r\nelif(s==1):\r\n print((x)%1000000007)\r\nelif(s==2):\r\n print((y)%1000000007)\r\nelif(s==3):\r\n print((y-x)%1000000007)\r\nelif(s==4):\r\n print((-x)%1000000007)\r\nelif(s==5):\r\n print((-y)%1000000007)", "x,y=map(int,input().split())\r\nn=int(input())\r\nif n%6==0:\r\n print((x-y)%(10**9+7))\r\nelif n%6==1:\r\n print(x%(10**9+7))\r\nelif n%6==2:\r\n print(y%(10**9+7))\r\nelif n%6==3:\r\n print((y-x)%(10**9+7))\r\nelif n%6==4:\r\n print(-x%(10**9+7))\r\nelif n%6==5:\r\n print(-y%(10**9+7))", "if __name__ == '__main__':\r\n x, y = list(map(int, input().strip().split()))\r\n n = int(input())\r\n MOD = 10 ** 9 + 7\r\n f = [0] * 6; f[0], f[1] = (x + MOD) % MOD, (y + MOD) % MOD\r\n for i in range(2, 6):\r\n f[i] = (f[i - 1] - f[i - 2] + MOD) % MOD\r\n print(f[(n - 1) % 6])", "x,y=map(int,input().split())\r\na=int(input())\r\nz=[x,y,y-x,-x,-y,x-y]\r\nprint(z[a%6-1]%(10**9+7))\r\n", "# cook your dish here\r\nif __name__ == '__main__':\r\n x,y = map(int,input().split())\r\n n = int(input())\r\n n-=1\r\n modulo = 1000000007\r\n z = y-x\r\n pattern = [x,y,z,-x,-y,-z]\r\n print(pattern[n%6]%modulo)", "x, y = map(int, input().split())\r\nn = int(input())\r\nlis = [x, y]\r\nfor _ in range(2, 6):\r\n x, y = y, (y - x)\r\n lis.append(y)\r\nprint(lis[n % 6 - 1] % ((10 ** 9) + 7))\r\n", "\r\nx, y = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nif n%6 == 0:\r\n ans = -y+x\r\nelif n%6 == 1:\r\n ans = x\r\nelif n%6 == 2:\r\n ans = y\r\nelif n%6 == 3:\r\n ans = y-x\r\nelif n%6 == 4:\r\n ans = -x\r\nelif n%6 == 5:\r\n ans = -y\r\nprint(ans%(10**9+7))", "x,y=list(map(int,input().split()))\r\nn=int(input())\r\nz=10**9+7\r\nif (n//3)%2!=0 and n%3==0:\r\n print((y-x)%z)\r\nelif (n//3)%2!=0 and n%3==1:\r\n print(-x%z)\r\nelif (n//3)%2!=0 and n%3==2:\r\n print(-y%z)\r\nelif (n//3)%2==0 and n%3==0:\r\n print((x-y)%z)\r\nelif (n//3)%2==0 and n%3==1:\r\n print(x%z)\r\nelif (n//3)%2==0 and n%3==2:\r\n print(y%z)", "def main():\r\n x, y = list(map(int, input().split()))\r\n ans = [x, y, y - x, -x, -y, -y + x]\r\n n = int(input())\r\n mod = 10 ** 9 + 7\r\n p = ans[n % 6 - 1]\r\n print(p % mod)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys, collections\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\n# ------------ TEMPLATE ENDS HERE -------------- #\r\nINF = 10**18\r\nMOD = 10**9 + 7\r\n\r\n \r\ndef solve(x,y,n):\r\n n -= 1\r\n F = [x,y,y-x,-x,-y,x-y]\r\n return F[n%6] % MOD\r\n \r\ntest_case = 1\r\nfor _ in range(test_case):\r\n x, y = rmi()\r\n n = ri()\r\n print(solve(x,y,n))\r\n ", "x,y=map(int,input().split())\r\nn=int(input())\r\nl=[x,y,y-x,-x,-y,x-y]\r\nprint(l[(n-1)%6]%1000000007)\r\n", "n=[int(i) for i in input().split()]\r\nm=int(input())\r\nx=n[0]\r\ny=n[1]\r\ns=m//3\r\nr=m%3\r\nif(s%2!=0):\r\n if(r==1):\r\n print(-x%(1000000007))\r\n elif(r==2):\r\n print(-y%(1000000007))\r\n else:\r\n print((y-x)%1000000007)\r\nelse:\r\n if(r==1):\r\n print(x%1000000007)\r\n elif(r==2):\r\n print(y%1000000007)\r\n else:\r\n print((x-y)%1000000007)\r\n\r\n\r\n", "x,y = [int(x) for x in input().split()]\r\nn = int(input())\r\nmod = 10**9+7\r\nx %= mod\r\ny %= mod\r\nif n == 1:\r\n print(x)\r\nelif n == 2:\r\n print(y)\r\nelse:\r\n for i in range((n-2) % 6):\r\n # print(i, x,y)\r\n x,y = y, (y-x) % mod\r\n print(y)", "x, y = map(int, input().split())\r\nn = int(input())\r\nli = [x, y, y - x, -x, -y, -y + x]\r\nMOD = 10**9 + 7\r\nprint(li[n % 6 - 1] % MOD)", "import sys\r\n# sys.stdin=open(\"input.txt\",\"r\")\r\n# sys.stdout=open(\"output.txt\",\"w\")\r\n\r\nx,y=map(int,input().split())\r\nn=int(input())\r\n\r\nlst=[-1,x,y,y-x,-x,-y,x-y]\r\n\r\nrem=n%6\r\nif(rem==0):\r\n rem=6\r\n\r\nprint((lst[rem])%(10**9+7))", "x, y = map(int, input().split())\r\narr = [x-y, x, y, y-x, -x, -y]\r\nprint(arr[int(input())%6]%1000000007)", "X, Y = [int(x) for x in input().split()]\r\n\r\nN = int(input()) % 6\r\n\r\nanswers = [-Y+X, X, Y, Y-X, -X, -Y]\r\n\r\nprint(answers[N] % ((10**9) + 7))\r\n", "(f1, f2) = map(int, input().split(' '))\nn = int(input())\nf = [f1, f2, f2 - f1, -f1, -f2, f1 - f2]\nresult = f[(n - 1) % 6]\n\nprint(result % (10 ** 9 + 7))\n", "n,m=map(int,input().split()); o=int(input())%6;l=[n-m,n,m,m-n,0-n,0-m];print(l[o]%1000000007)", "x, y = map(int, input().split())\nn = (int(input()) - 2) % 6\nfor _ in range(n):\n x, y = y, y - x\nprint(y % 1_000_000_007)\n", "x, y = map(int, input().split())\r\nn = int(input())\r\nif (n % 6 == 1):\r\n print(x % 1000000007)\r\nif (n % 6 == 2):\r\n print(y % 1000000007)\r\nif (n % 6 == 3):\r\n print((y - x) % 1000000007)\r\nif (n % 6 == 4):\r\n print(-x % 1000000007)\r\nif (n % 6 == 5):\r\n print(-y % 1000000007)\r\nif (n % 6 == 0):\r\n print((x - y) % 1000000007)\r\n", "x,y=map(int, input().split())\r\nn=int(input())\r\nm=1000000007\r\nif n%6==1:\r\n print(x%m)\r\nelif n%6==2:\r\n print(y%m)\r\nelif n%6==3:\r\n print((y-x)%m)\r\nelif n%6==4:\r\n print((-x)%m)\r\nelif n%6 ==5:\r\n print((-y)%m)\r\nelse:\r\n print((-y+x)%m)", "x,y=map(int,input().split())\r\na=int(input())\r\nl=a%6\r\np=[x,y,y-x,-x,-y,-y+x]\r\nprint((p[l-1])%((10**9)+7))\r\n", "x,y = list(map(int,input().split()))\r\nn = int(input())\r\nMOD = 1000000007\r\ns = [x,y,y-x,-x,-y,x-y]\r\nprint((s[(n - 1) % 6] % MOD + MOD) % MOD)", "x, y = input().split()\r\nx, y = int(x), int(y)\r\nn = int(input())\r\nn = (n - 1) % 6 + 1\r\nans = 0\r\nif n == 1:\r\n ans = x\r\nif n == 2:\r\n ans = y\r\nif n == 3:\r\n ans = y - x\r\nif n == 4:\r\n ans = -x\r\nif n == 5:\r\n ans = -y\r\nif n == 6:\r\n ans = x - y\r\nprint(ans % 1000000007)\r\n", "x, y = map(int, input().split())\r\nn = int(input())\r\ns = n % 6;\r\n\r\nif s == 1:\r\n print(x % 1000000007)\r\nif s == 2:\r\n print(y % 1000000007)\r\nif s == 3:\r\n print((y-x) % 1000000007)\r\nif s == 4:\r\n print((0-x) % 1000000007)\r\nif s == 5:\r\n print((0-y) % 1000000007)\r\nif s == 0:\r\n print((0-y+x) % 1000000007)\r\n", "x,y=map(int,input().split())\r\na=[x,y,y-x,-x,-y,x-y]\r\nn=int(input())\r\nprint(a[(n-1)%6]%1000000007)", "\"\"\"\r\nObservation:\r\n\r\nFormula : f[n] = f[n-1] - f[n-2]\r\n\r\nf1 = 2\r\nf2 = 3\r\nf3 = 1\r\nf4 =-2\r\nf5 =-3\r\nf6 =-1\r\n\r\nValues repeat after every six iterations\r\n\r\nf7 = 2\r\nf8 = 3\r\nf9 = 1\r\nf10=-2\r\nf11=-3\r\nf12=-1\r\n\r\nf13= 2\r\nf14= 3 ....\r\n\r\nPattern => [x, y, y-x, -x, -y, x-y]\r\n\r\nTo detect at which iteration we are we can use MOD\r\n\"\"\"\r\n\r\nx, y = map(int, input().split())\r\nn = int(input())\r\n\r\nf = [x, y, y-x, -x, -y, x-y]\r\n\r\nprint(f[(n-1) % 6] % 1000000007)", "X, Y = map(int ,input().split())\r\nN = int(input())\r\n\r\nArr = [None] * 6\r\nArr[1], Arr[2], Arr[3] = X, Y, Y - X\r\nArr[4] , Arr[5] , Arr[0] = -1 * Arr[1], -1 * Arr[2], -1 * Arr[3]\r\nprint(Arr[N % 6] % 1000000007)", "\n\n[x,y] = list(map(int,input().split(\" \")))\n\nn = int(input())\nans = 0\nk = (n-1)%3\nif k ==0:\n ans = x\nelif k==1:\n ans = y\nelse:\n ans = y - x\nk = (n-1)//3\n\nif k%2!=0:\n ans = -ans\nprint(ans%1000000007)\n", "x,y=map(int, input().split())\nn = int(input())\nMOD =1000000007 \n# print(x,y,n)\na = [x,y,0,0,0,0]\nfor i in range(2,6):\n a[i] = a[i-1]-a[i-2]\nans = (a[(n % 6) - 1]) % MOD\nif (ans >= 0):\n print(ans)\nelse:\n print(MOD + ans)\n", "\r\n\r\ndef matMult(mat1, mat2, mod):\r\n n1, m1 = len(mat1), len(mat1[0])\r\n n2, m2 = len(mat2), len(mat2[0])\r\n\r\n ans = [[0 for i in range(m2)] for j in range(n1)]\r\n for i in range(n1):\r\n for j in range(m2):\r\n for k in range(m1):\r\n ans[i][j] += mat1[i][k]*mat2[k][j]\r\n ans[i][j] %= mod\r\n\r\n return ans\r\n\r\ndef matExp(mat, k, mod):\r\n '''returns mat power of k with mod'''\r\n n,m = len(mat), len(mat[0])\r\n if k == 0:\r\n ans = [[0 for i in range(m)] for j in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n if i == j:\r\n ans[i][j] = 1\r\n else:\r\n ans[i][j] = 0\r\n return ans\r\n \r\n if k%2 == 0:\r\n ans = matExp(matMult(mat, mat, mod), k//2, mod)\r\n else:\r\n ans = matMult(mat, matExp(mat, k-1, mod), mod)\r\n \r\n return ans\r\n\r\na,b = list(map(int, input().split()))\r\nn = int(input())\r\nmod = int(1e9+7)\r\nif n == 1:\r\n print(a%mod)\r\nelif n == 2:\r\n print(b%mod)\r\nelse:\r\n mat = matExp([[1, -1], [1, 0]], n-2, mod)\r\n # print(mat)\r\n print((b*mat[0][0] + a*mat[0][1])%mod)", "# Jzzhu and Sequences\r\nx,y = map(int,input().split(\" \"))\r\nn = int(input())\r\nans = 0\r\nif n % 6 == 1:\r\n ans = x\r\nelif n % 6 == 2:\r\n ans = y\r\nelif n % 6 == 3:\r\n ans = y - x\r\nelif n % 6 == 4:\r\n ans = -x\r\nelif n % 6 == 5:\r\n ans = -y\r\nelif n % 6 == 0:\r\n ans = -y + x\r\nprint(ans % 1000000007)", "MOD = 1000000007\r\n\r\n# Input\r\nx, y = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nif n%3 == 1:\r\n if (n//3)% 2 == 1:\r\n ans = -x\r\n else:\r\n ans = x\r\nelif n%3 == 2:\r\n if (n//3) %2 == 1:\r\n ans = -y\r\n else:\r\n ans = y\r\nelse:\r\n if (n//3)%2 == 1:\r\n ans = y-x\r\n else:\r\n ans = x-y\r\n\r\n# Output the result\r\nprint(ans % MOD)\r\n", "def main() :\r\n x,y = map(int,input().split())\r\n n = int(input())\r\n l = [x,y,y-x,-x,-y,x-y]\r\n print(l[(n%6)-1]%1000000007) \r\n\r\nmain()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = 10**9 + 7\r\nx, y = map(int, input().split())\r\n\r\nn = int(input())\r\n\r\nans = x\r\nif n % 3 == 2:\r\n\tans = y\r\nelif n % 3 == 0:\r\n\tans = y - x\r\n\r\nif n % 6 > 3 or n % 6 == 0:\r\n\tans *= -1\r\nprint(ans % M)", "a, b = map(int, input().split())\r\nn = int(input())\r\n\r\narr = [a-b, a, b, b-a, -a, -b]\r\n\r\nprint(arr[n%6]%int(1e9+7))", "a,b = map(int,input().split())\r\nk = int(input())\r\n\r\nif ((k-1)//3)%2:\r\n\tsign = 1\r\nelse:\r\n\tsign = 0\r\n\r\nprint((((-1)**sign)*[a,b,b-a][((k-1)%3)])%1000000007)", "a,b=map(int,input().split())\r\nl=[a,b,b-a,-a,-b,a-b]\r\nn=int(input())\r\nsol=(n-1)%6\r\nprint(l[sol]%((10**9)+7))", "num=list(input().split());\nx=int(num[0])\ny=int(num[1])\nn=int(input())\nmod=1000000007\nn=n%6\nans1=(x%mod+mod)%mod\nans2=(y%mod+mod)%mod\nans3=((y-x+mod)%mod+mod)%mod\nif n==1:\n print(ans1)\nif n==2:\n print(ans2)\nif n==3:\n print(ans3)\nif n==4:\n print((mod-ans1)%mod)\nif n==5:\n print((mod-ans2)%mod)\nif n==0:\n print((mod-ans3)%mod)\n\n \t \t \t\t\t \t\t \t \t\t \t\t\t \t", "x,y=map(int,input().split())\r\nn=int(input())\r\nm=10**9+7\r\nb=[x,y,y-x,-x,-y,x-y]\r\nprint(b[n%6-1]%m)", "x, y = map(int, input().split())\r\nn = int(input())-1\r\nl = [x, y, y-x, -x, -y, -y+x]\r\nprint(l[n % 6] % 1000000007)\r\n", "x, y = list(map(int, input().split()))\r\nn = int(input())\r\n\r\nsequence = [x, y]\r\n\r\nfor i in range(4):\r\n sequence.append(sequence[-1] - sequence[-2])\r\n\r\nprint(sequence[n - (6*(n // 6))-1] % (10**9 + 7))\r\n", "f1,f2 = map(int,input().split())\r\nn = int(input())\r\nl = [f1,f2,f2-f1,-f1,-f2,f1-f2]\r\nprint(l[n%6-1]%1000000007)", "x,y=map(int,input().split())\r\nl=[x,y,y-x,-x,-y,x-y]\r\nn=int(input())%6\r\nprint(l[n-1]%1000000007)", "x,y=map(int,input().split())\r\nn=int(input())\r\nm=pow(10,9)+7\r\nz=y-x\r\nif n>3:\r\n l=[x,y,z]\r\n i=n%3\r\n j=n//3\r\n if i!=0:\r\n print(((l[i - 1]) * ((-1) ** (j)))%m)\r\n else:\r\n print(((l[i - 1]) * ((-1) ** (j-1)))%m)\r\nelse:\r\n if n==1:\r\n print(x%m)\r\n elif n==2:\r\n print(y%m)\r\n elif n==3:\r\n print(z%m)\r\n", "x,y = map(int,input().split())\r\nn = int(input())\r\nmod = 1000000007\r\nif n%6 == 0 :\r\n print((x-y)%mod)\r\nelif n%6 == 1 :\r\n print(x%mod)\r\nelif n%6 == 2 :\r\n print(y%mod)\r\nelif n%6 == 3 :\r\n print((y-x)%mod)\r\nelif n%6 == 4 :\r\n print((-x)%mod)\r\nelif n%6 == 5 :\r\n print((-y)%mod)", "x,y=map(int,input().split())\r\nn=int(input(\"\"))\r\n \r\nlis=[x,y,y-x,x*-1,y*-1,(y-x)*-1]\r\n \r\nif n==2:\r\n print(y%1000000007)\r\nelse:\r\n print(lis[(n%6)-1]%1000000007)", "x, y = map(int, input().split(' '))\r\nn = int(input())\r\nMOD = int(1e9 + 7)\r\nf = [0 for i in range(6)]\r\nf[0] = x % MOD\r\nf[1] = y % MOD\r\nfor i in range(1, 5):\r\n f[i + 1] = (f[i] - f[i - 1]) % MOD\r\nprint(f[(n - 1) % 6])", "MOD = 10 ** 9 + 7\n\na, b = list(map(int, input().split()))\nn = int(input()) - 1\n\nresults = [a, b]\nfor i in range(3, 7):\n b, a = b - a, b\n results.append(b)\n\n# print(results, n % 6)\nprint(results[(n % 6)] % MOD)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import ceil\r\nfrom collections import Counter\r\nmod = 1000000007\r\n #X,Y,Z = list(map(int,input().strip().split()))\r\nx,y = list(map(int,input().strip().split()))\r\n#arr = list(map(int,input().strip().split()))\r\nn = int(input())\r\narr = [x,y]\r\nfor i in range(2,6):\r\n arr.append(arr[i-1]-arr[i-2])\r\nans = n%6\r\nif ans == 0:\r\n print(arr[-1]%mod)\r\nelse:\r\n print(arr[ans-1]%mod)", "from sys import stdin, stdout, setrecursionlimit\r\n# from Multiset import update, remove\r\n\r\nstring = lambda: stdin.readline().strip()\r\nget = lambda: int(stdin.readline().strip())\r\narray = lambda: list(map(int, stdin.readline().strip().split()))\r\ncharar = lambda: list(map(str, stdin.readline().strip()))\r\nwrite = lambda *args: [stdout.write(str(i) +\" \") for i in args]\r\n\r\nmod, inf = int(1e9 + 7), int(1e18)\r\n\r\ndef solve():\r\n\tx,y = array()\r\n\tn = get()\r\n\tn -= 1\r\n\r\n\ta = (x, y, y - x, -x, -y, x - y)\r\n\twrite(a[n % 6] % mod)\r\n\r\nsolve()", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nMOD = 1000000007\r\n\r\nf1, f2 = inl()\r\nn = int(input())\r\n\r\nf = [f1, f2]\r\nfor i in range(1, 5):\r\n f.append(f[i] - f[i - 1])\r\n\r\nans = f[n % 6 - 1]\r\nprint(ans % MOD)\r\n", "import sys\r\nfrom math import sqrt\r\nfrom collections import Counter\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)+\"\\n\")\r\ndef outa(*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\n\r\n\r\nx, y = sp()\r\nn = int(data())\r\nanswer = {\r\n 0: x - y,\r\n 1: x,\r\n 2: y,\r\n 3: y - x,\r\n 4: -x,\r\n 5: -y\r\n}\r\nout(answer[n % 6] % mod)\r\n", "a,b = map(int,input().split())\r\nn = int(input())\r\np = [a,b]\r\nfor i in range(4):\r\n c = p[-1] - p[-2]\r\n p.append(c)\r\nn = n%6\r\nprint(p[n-1] % 1000000007)\r\n\r\n", "x,y=[int(x) for x in input().split()]\r\nn=int(input())\r\nnums=[x,y,y-x,-x,-y,x-y]\r\ntemp=(n-1)%6\r\ntemp=nums[temp]\r\nprint(temp%1000000007)", "x,y = map(int,input().split())\r\nn = int(input())\r\nz = y-x\r\nif n%3==0:\r\n k = n/3\r\n if k%2!=0:\r\n m = z\r\n else:\r\n m = -z\r\nelif n%3==1:\r\n k = n//3\r\n if k%2!=0:\r\n m = -x\r\n else:\r\n m = x\r\nelse:\r\n k = n//3\r\n if k%2!=0:\r\n m = -y\r\n else:\r\n m = y\r\nprint(m%1000000007)", "import math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n\r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\na,b = inum()\r\nn = int(input())\r\n\r\n\r\nd = {0:a%1000000007,1:b%1000000007}\r\n \r\nif n <= 2:\r\n print(d[n-1])\r\nelse:\r\n for i in range(2,6):\r\n d[i] = (d[i-1]-d[i-2])%1000000007\r\n print(d[(n-1)%6])", "def solve(x, y, n):\r\n if n%6 == 1: return x\r\n if n%6 == 2: return y\r\n if n%6 == 3: return y-x\r\n if n%6 == 4: return -x\r\n if n%6 == 5: return -y\r\n if n%6 == 0: return x-y\r\n\r\nx, y = map(int, input().split())\r\nn = int(input())\r\nprint(solve(x, y, n) % (10**9 + 7))", "MOD = 1000000007\r\n\r\nx, y = list(map(int, input().split()))\r\nn = int(input())\r\nl = [x, y, y-x, -x, -y, x-y]\r\nprint(l[(n-1)%6]%MOD)", "x,y=map(int,input().split())\r\nn=int(input())\r\nz=y-x\r\na=[x,y,z,-x,-y,-z]\r\n#print(a[n%6-1]% )\r\nprint(a[n%6-1]%1000000007)", "wah = list(map(int, input().split(' ')))\r\nx, y, n = wah[0], wah[1], int(input())\r\nall = [x, y, y - x, -x, -y, x - y]\r\nres = (n - 1) % 6\r\nprint(all[res] % 1000000007)\r\n", "x, y = list(map(int, input().split()))\nf3 = y - x\nnums = [x, y, f3, -x, -y, -f3]\nn = int(input())\nn -= 1\nres = nums[n % 6]\nmodulo = pow(10, 9) + 7\nres %= modulo\nprint(res);", "x,y=map(int,input().split())\r\nn=int(input())\r\nmod=(10**9)+7\r\nn=n%6\r\nif n==0:a=x-y\r\nelif n==1:a=x\r\nelif n==2:a=y\r\nelif n==3:a=y-x\r\nelif n==4:a=-x\r\nelif n==5:a=-y\r\nprint(a%mod)\r\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\nx,y = ([int(x) for x in input().split()])\r\nn=int(input())\r\nz=y-x\r\np=10**9 +7\r\nif n%3==1:\r\n if ((n-1)//3)%2==0:\r\n print(x%p)\r\n else:\r\n print(-x%p)\r\nelif n%3==2:\r\n if ((n-2)//3)%2==0:\r\n print(y%p)\r\n else:\r\n print(-y%p)\r\nelse:\r\n if ((n-3)//3)%2==0:\r\n print(z%p)\r\n else:\r\n print(-z%p)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin,stdout\ninput=stdin.readline\n\ndef inp(): return map(int,input().split())\n\nmod=10**9+7\ndef multiply(a, b):\n cc = 2 #initialise as per M\n mul = [[0 for x in range(cc)] for y in range(cc)]\n for i in range(cc):\n for j in range(cc):\n mul[i][j] = 0\n for k in range(cc):\n mul[i][j] += (a[i][k] * b[k][j]) % mod\n mul[i][j] %= mod\n for i in range(cc):\n for j in range(cc):\n a[i][j] = mul[i][j]\n return a\n\ndef power(F, n, inti):\n M = [[1,-1], [1,0]]\n if (n == 1):\n return inti[0]-inti[1]\n power(F, int(n // 2),inti)\n F = multiply(F, F)\n if n&1:\n F = multiply(F, M)\n res=0\n for i in range(2):\n res += (F[0][i]*inti[i]) % mod\n res %= mod\n return res\n\ndef f(x,y,n):\n inti=[y,x] #V[k] to be initialised\n if n<3:\n return inti[2-n]\n F = [[1,-1], [1,0]] \n return power(F, n - 2, inti)\n\nx,y=inp()\nn=int(input())\nprint(f(x,y,n)%mod)", "f=list(map(int,input().split()))+[0]*4\r\nd=int(input())\r\nfor i in range(2,6):\r\n f[i]=(f[i-2]-f[i-1])*-1\r\nprint(f[(d-1)%6]%(10**9+7))", "m=1000000007\r\nx,y=map(int,input().split())\r\nz=x-y\r\nn=int(input())\r\nt=n//3\r\nif n%3==0:\r\n print((z*(-1)**t+m)%m)\r\nelif n%3==1:\r\n print((x*(-1)**t+m)%m)\r\nelse:\r\n print((y*(-1)**t+m)%m)", "x, y = map(int,input().split())\r\nn = int(input())\r\n\r\na = [x, y, y-x, -x, -y, x-y]\r\nprint(a[n % 6 - 1] % 1000000007)", "inp = input().split(\" \")\r\nf1 = int(inp[0])\r\nf2 = int(inp[1])\r\nf3 = f2 - f1\r\nn = int(input())\r\nans = 0\r\npos = 1\r\nif((n-1)%6 > 2):\r\n pos = -1\r\nf = (n-1)%3\r\nif(f == 0):\r\n ans = (f1 * pos) % ((10**9)+7)\r\nelif(f == 1):\r\n ans = f2 * pos % ((10**9)+7)\r\nelse:\r\n ans = f3 * pos % ((10**9)+7)\r\n\r\nprint(ans)\r\n\r\n", "x,y=map(int,input().strip().split())\r\nn = int(input().strip())\r\nmod = 10**9+7\r\nn = n%6\r\nmp =[x,y,y-x,-x,-y,-y+x]\r\nsoln = mp[n-1]\r\nsoln%=mod\r\nprint(soln)\r\n\"\"\"\r\nx,y,y-x,-x,-y,-y+x,\r\n\r\n\r\n\"\"\"\r\n", "x,y= map(int,input().strip().split())\r\nn = int(input())\r\nk = (n-1)%6\r\n\r\nA = [1,0,-1,-1,0,1]\r\nB = [0,1,1,0,-1,-1]\r\n\r\nprint(\r\n (x*A[k] + y * B[k]) % (1_000_000_007)\r\n )", "x, y = map(int, input().split())\r\nn = int(input())\r\n\r\nf = [x, y, 0, 0, 0, 0]\r\nfor i in range(2, 6): f[i] = f[i - 1] - f[i - 2]\r\n\r\nprint(f[(n - 1) % 6] % 1000000007)\r\n", "m=1000000007\r\n\r\nx,y=map(int,input().split())\r\nn=int(input())\r\n\r\nz=[x,y,y-x,-x,-y,x-y]\r\nn%=6\r\n\r\nprint(z[n-1]%m)", "x, y = map(int,input().split())\r\na = [x, y, y - x, - x, - y, x - y]\r\nn = int(input())\r\nprint(a[(n - 1) % 6] % 1000000007)", "import math\r\nimport bisect\r\nimport collections\r\n\r\nMOD = 1000000007\r\n\r\ndef main():\r\n x, y = (map(int, input().split()))\r\n n = int(input())\r\n\r\n n -= 1\r\n n = n % 6\r\n answer = None\r\n\r\n if n == 0:\r\n answer = x % MOD \r\n elif n == 1:\r\n answer = y % MOD \r\n elif n == 2:\r\n answer = (y - x) % MOD\r\n elif n == 3:\r\n answer = (-x) % MOD\r\n elif n == 4:\r\n answer = (-y) % MOD\r\n elif n == 5:\r\n answer = (x - y) % MOD\r\n\r\n print(answer)\r\n\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x,y=map(int,input().split())\r\nn=int(input())\r\np=1000000000+7\r\nmod=n%6\r\nif mod==1:\r\n print(int(x%p))\r\nelif mod==2:\r\n print(int(y%p))\r\nelif mod==3:\r\n print(int((y-x)%p))\r\nelif mod==4:\r\n print(int((-x)%p))\r\nelif mod==5:\r\n print(int((-y)%p))\r\nelse:\r\n print(int((x-y)%p))", "a,b=map(int,input().split())\r\nl=[a-b,a,b,b-a,-a,-b]\r\n\r\nprint(l[int(input())%6]%(10**9+7))", "x,y=map(int,input().split())\r\nA=[x-y,x,y,y-x,-x,-y]\r\nprint(A[int(input())%6]%1000000007)\r\n", "import math\r\n\r\nx,y=[int(i) for i in input().split()]\r\nn=int(input())\r\n\r\n\r\nMOD=1000000007\r\nremainder=n%6\r\n\r\nif(remainder==1):\r\n a=(x)%MOD\r\n print(a)\r\nelif(remainder==2):\r\n a=(y)%MOD\r\n print(a)\r\n\r\nelif(remainder==3):\r\n a=(y-x)%MOD\r\n print(a)\r\n\r\nelif(remainder==4):\r\n a=(-x)%MOD\r\n print(a)\r\nelif(remainder==5):\r\n a=(-y)%MOD\r\n print(a)\r\n\r\nelse:\r\n a=(-y+x)%MOD\r\n print(a)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# from math import gcd as gcd\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound)\r\n\r\nx, y = map(int, input().split())\r\nn = int(input())\r\nif (n == 1):\r\n print(x%1000000007)\r\nelif(n == 2):\r\n print(y%1000000007)\r\nelse:\r\n z = n%2\r\n if (n%3 == 0):\r\n z = ((-1)**z)*(x - y)\r\n elif (n%3 == 1):\r\n z = ((-1)**(z+1))*(x)\r\n else:\r\n z = ((-1)**z)*y\r\n print(z%1000000007)", "x,y=map(int,input().strip().split())\r\nn=int(input())\r\nl=[x-y,x,y,y-x,-x,-y]\r\nprint(l[n%6]%1000000007)", "x, y = map(int, input().split())\r\nn = int(input())\r\ndic = {1: x, 2: y, 3: y - x, 4: -x, 5: -y, 0: x - y}\r\nprint(dic[n % 6] % (10 ** 9 + 7))\r\n", "# for aa in range(int(input())):\r\nx,y=map(int,input().split())\r\nn=int(input())\r\nli=[]\r\nif(n==1):\r\n print(x%1000000007)\r\n quit()\r\nif(n==2):\r\n print(y%1000000007)\r\n quit()\r\nfor i in range(6):\r\n t=y-x\r\n li.append(t)\r\n x=y\r\n y=t\r\n# print(li)\r\nh=li[((n-2)%6)-1]\r\nprint(h%1000000007)\r\n\r\n", "def out(a):\r\n m = 10**9+7\r\n # print(a)\r\n print(a % m)\r\n\r\n\r\nx, y = map(int, input().split())\r\nn = int(input())\r\n# print(n % 6)\r\n\r\nif n % 6 == 0:\r\n out(x-y)\r\nelif n % 6 == 1:\r\n out(x)\r\nelif n % 6 == 2:\r\n out(y)\r\nelif n % 6 == 3:\r\n out(y-x)\r\nelif n % 6 == 4:\r\n out(-x)\r\nelse:\r\n out(-y)\r\n", "n=1000000007\r\nx,y=map(int,input().split())\r\nm=int(input())\r\nz=[x,y,y-x,-x,-y,x-y]\r\nm%=6\r\nprint(z[m-1]%n)", "x,y=map(int,input().split())\r\nn,f=int(input()),[x,y,y-x,-x,-y,x-y]\r\nprint(f[(n-1)%6]%1000000007)", "mod = 10**9 + 7\r\nx, y = map(int, input().split())\r\nn = int(input())\r\ntemp = [x, y, y - x, -x, -y, -y + x]\r\nn -= 1\r\nn %= 6\r\nprint(temp[n] % mod)\r\n", "a = [int(i) for i in input().split()]\r\nn = int(input())\r\n\r\nfor i in range(2, 6):\r\n a.append(a[i-1]-a[i-2])\r\n\r\nprint(pow(a[n%6-1], 1, 1000000007))\r\n", "def solve():\r\n x, y = map(int, input().split())\r\n n = int(input())\r\n\r\n ans = [x, y]\r\n\r\n for i in range(4):\r\n tmp = y\r\n y -= x\r\n x = tmp\r\n ans.append(y)\r\n\r\n print(ans[n % 6 - 1] % (10 ** 9 + 7))\r\n\r\n\r\nsolve()\r\n", "x, y = map(int, input().split())\r\nn = int(input())\r\n\r\nans = [x- y , x, y, y - x, -x, -y]\r\nmod = 10**9 + 7\r\nprint(ans[n%6]%mod)\r\n", "x,y=map(int,input().split())\r\nn=int(input())-1\r\nz=y-x\r\ns=n//3\r\nif s%2==0:print([x,y,z][n%3]%int(1e9+7))\r\nif s%2==1:print([-x,-y,-z][n%3]%int(1e9+7))\r\n", "f1,f2=map(int,input().split( ))\r\nf3=f2-f1\r\nn=int(input())\r\nif n%3==0:\r\n if n%2==0:\r\n print((-f3)%(10**9+7))\r\n else:\r\n print(f3%(10**9+7))\r\nelif n%3==1:\r\n if n%2==0:\r\n print((-f1)%(10**9+7))\r\n else:\r\n print(f1%(10**9+7))\r\nelse:\r\n if n%2==0:\r\n print(f2%(10**9+7))\r\n else:\r\n print(-f2%(10**9+7))", "class Solution:\r\n def solve(self, a, b, c):\r\n mod = 1000000007\r\n answer = (a, b, b-a)\r\n y = c // 3\r\n x = c % 3\r\n if x == 0:\r\n if y % 2:\r\n print(answer[2] % mod)\r\n else:\r\n print(-answer[2] % mod)\r\n else:\r\n if y % 2:\r\n print(-answer[x-1] % mod)\r\n else:\r\n print(answer[x-1] % mod)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n f1, f2 = tuple(map(int, input().split()))\r\n n = int(input())\r\n obj = Solution()\r\n obj.solve(f1, f2, n)\r\n", "a=list(map(int,input().split()))\r\nx,y=a\r\nn=int(input())\r\nl=[x,y,y-x,-x,-y,x-y]\r\nprint(l[(n%6)-1]%1000000007)", "x, y = map(int,input().split())\r\nx = [x-y,x,y,y-x,-x,-y]\r\nprint(x[int(input())%6]%1000000007)", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\n#f(1)=x\r\n#f(2)=y\r\n#f(3)=y-x\r\n#f(3)=f(4)+f(2). f(4)=y-x-y=-x\r\n#f(4)=f(5)+f(3). f(5)=-x-y+x=-y\r\n#f(5)=f(6)+f(4). f(6)=-y+x=x-y\r\nmod=int((10**9)+7)\r\nn1,n2=map(int,input().split())\r\nn=int(input())\r\nif n%6==1:\r\n print(n1%mod)\r\nelif n%6==2:\r\n print(n2%mod)\r\nelif n%6==3: \r\n print((n2-n1)%mod)\r\nelif n%6==4:\r\n print((-n1)%mod)\r\nelif n%6==5:\r\n print((-n2)%mod)\r\nelif n%6==0:\r\n print((n1-n2)%mod)\r\n\r\n", "from sys import stdin, stdout\nrd = lambda: list(map(int, stdin.readline().split()))\nrds = lambda: stdin.readline().rstrip()\nii = lambda: int(stdin.readline())\n\nmod = 10**9 + 7\n\nx, y = rd()\nn = ii() - 1\n\na = [x, y, y-x, -x, -y, -y+x]\n\nm = n % 6\n\nprint(a[m] % mod)\n\n \n\n", "x,y=map(int,input().split())\r\nc=int(input())\r\nc=c%6\r\nif c==0:\r\n print((x-y)%1000000007)\r\nif c==1:\r\n print(x%1000000007)\r\nif c==2:\r\n print(y%1000000007)\r\nif c==3:\r\n print((y-x)%1000000007)\r\nif c==4:\r\n print((-x)%1000000007)\r\nif c==5:\r\n print((-y)%1000000007)", "#https://codeforces.com/problemset/problem/450/B\r\n\r\n\r\n\r\nfrom collections import defaultdict\r\nx, y=map(int,input().split())\r\nn=int(input())\r\nmod=n%6 \r\nl=[x-y,x,y,y-x,-x,-y]\r\n\r\nprint(l[mod]%(10**9+7))", "[x,y]=[int(i) for i in input().split()]\r\nn=(int(input())-1)%6\r\n\r\nif(n==0):\r\n print(x%1000000007)\r\nelif(n==1):\r\n print(y%1000000007)\r\nelif(n==2):\r\n print((y-x)%1000000007)\r\nelif(n==3):\r\n print(-x%1000000007)\r\nelif(n==4):\r\n print(-y%1000000007)\r\nelif(n==5):\r\n print((-y+x)%1000000007)\r\n", "x,y=map(int,input().split())\r\nn=int(input())\r\n# arr=list(map(int,input().split()))\r\nf3=y-x;f4=-x;f5=-y;f6=x-y\r\nif n%6==0:\r\n print(f6%1000000007 )\r\nelif n%6==1:\r\n print(x%1000000007)\r\nelif n%6==2:\r\n print(y%1000000007)\r\nelif n%6==3:\r\n print(f3%1000000007)\r\nelif n%6==4:\r\n print(f4%1000000007)\r\nelif n%6==5:\r\n print(f5%1000000007)\r\n", "x,y=map(int,input().split())\r\nn=int(input())\r\na=[x,y,y-x,-x,-y,x-y]\r\nprint(a[n%6-1]%(10**9+7))", "\r\nm=10**9+7\r\nx,y=map(int,input().split())\r\n\r\nn=int(input())\r\nl=[x,y,y-x,-x,-y,x-y]\r\n# print(l)\r\np=n%6\r\nprint(l[p-1]%m)\r\n", "mod=1000000007\r\nx,y=[int(i) for i in input().split()]\r\nn=int(input())\r\nl=[x%mod,y%mod,(y%mod-x%mod)%mod,(-x)%mod,(-y)%mod,(x%mod-y%mod)%mod]\r\nprint(l[(n-1)%6])", "aa = list(map(int, input().split()))\r\ni = int(input()) % 6\r\nfor _ in range(4):\r\n aa.append(aa[-1] - aa[-2])\r\nprint(aa[i-1] % 1000000007)", "x,y=map(int,input().split())\r\nl=[x-y,x,y,y-x,-x,-y]\r\nprint(l[(int(input())%6)]%(10**9+7))", "a, b = map(int, input().split())\r\nf = [0 for i in range(10)]\r\nf[1] = a\r\nf[2] = b\r\nfor i in range(3, 7):\r\n f[i] = f[i - 1] - f[i - 2]\r\nf[0] = f[6]\r\nmod = 1e9 + 7 \r\n\r\nfor i in range(6):\r\n while f[i] < 0:\r\n f[i] += mod \r\n while f[i] >= mod:\r\n f[i] -= mod\r\n\r\nn = int(input())\r\nn %= 6 \r\nprint(int(f[n]))\r\n", "x,y=map(int,input().split())\r\nn=int(input())\r\nmod=1000000007\r\n\r\nans=[x,y,y-x,-x,-y,x-y]\r\nn%=6\r\nprint(ans[n-1]%mod)\r\n ", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\n\r\nx, y = [int(i) for i in input().split()]\r\nn = int(input())\r\nif (x < 0):\r\n x += mod\r\nif (y < 0):\r\n y += mod\r\nv = [0]*7\r\nv[1] = x\r\nv[2] = y\r\nv[3] = y-x\r\nif (v[3] < 0):\r\n v[3] += mod\r\n\r\nv[4] = (mod - x) % mod\r\nv[5] = (mod - y) % mod\r\nv[0] = (mod - v[3]) % mod\r\nprint(v[n % 6])\r\n", "x,y = map(int,input().split())\r\nn = int(input())\r\nl =[x,y,y-x,-x,-y,x-y]\r\nt = n%6\r\nfn=l[t-1]\r\nprint(fn%1000000007)", "# cook your dish here\r\nx, y = map(int, input().split())\r\nn = int(input())\r\nz = y-x\r\nm = 1000000007\r\nif(n == 1):\r\n print(x%m)\r\nelif(n == 2):\r\n print(y%m)\r\nelif(n == 3):\r\n print(z%m)\r\nelse:\r\n if((n//3)%2 == 0):\r\n if(n%3 ==0):\r\n print(-z%m)\r\n elif(n%3 == 1):\r\n print(x%m)\r\n else:\r\n print(y%m)\r\n elif((n//3)%2 != 0):\r\n if(n%3 == 1):\r\n print(-x%m)\r\n elif(n%3 == 2):\r\n print(-y%m)\r\n else:\r\n print(z%m)", "x, y = map(int, input().split())\r\nn = int(input()) - 1\r\na = [x, y, y - x, -x, -y, x - y]\r\nn = n % 6\r\ns = a[n] % (1000000007)\r\nprint(s)", "x,y= map(int, input().split())\r\narr,n=[x,y,y-x,-x,-y,x-y],int(input())\r\nn= (n-1)%6\r\nprint(arr[n]%1000000007)\r\n", "from collections import Counter\r\n\r\n\r\ndef solve(x, y, n):\r\n return [x, y, y-x, -x, -y, x-y][(n-1) % 6] % 1000000007\r\n\r\n\r\nx, y = [int(i) for i in input().split()]\r\nn = int(input())\r\nprint(solve(x, y, n))\r\n", "a, b = map(int, input().split())\r\nn = int(input())\r\nif(n%6==1):\r\n val = a\r\nelif(n%6==2):\r\n val = b\r\nelif(n%6==3):\r\n val = b-a\r\nelif(n%6==4):\r\n val = -a\r\nelif(n%6==5):\r\n val = -b\r\nelse:\r\n val = a-b\r\nif(val<0):\r\n val += 1000000007\r\nprint(val%1000000007)\r\n", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nmod = 1000000007\r\ndef solve () :\r\n x, y = map(int, inpu().split())\r\n n = int(inpu())\r\n # f3 = f2 - f1\r\n # f4 = f3 - f2 f4 = -f1\r\n # f5 = f4 - f3 f5 = -f1 - f3 = -f2\r\n # f6 = f5 - f4 = -f3\r\n # f7 = f6 -f5 = f1\r\n # f8 = f2\r\n # f9 = f3\r\n # f10 = -f1\r\n if n == 1:\r\n prin(str(x%mod) + '\\n')\r\n return\r\n if n == 2:\r\n prin(str(y%mod) + '\\n')\r\n return\r\n f3 = y - x\r\n if n == 3:\r\n prin(str(f3%mod) + '\\n')\r\n return\r\n k = n%6\r\n if k == 1:\r\n prin(str(x%mod) + '\\n')\r\n return\r\n if k == 2:\r\n prin(str(y%mod) + '\\n')\r\n return\r\n if k == 3:\r\n prin(str(f3%mod) + '\\n')\r\n return\r\n if k == 4:\r\n prin(str((-x%mod)) + '\\n')\r\n return\r\n if k == 5:\r\n prin(str((-y%mod)) + '\\n')\r\n return\r\n if k == 6 or k == 0:\r\n prin(str((-f3%mod)) + '\\n')\r\n return\r\nsolve()", "MOD = 1000000007\r\n\r\ndef solve(n, x, y):\r\n s = [x, y, y-x, -x, -y, x-y]\r\n print(s[(n-1)%6]%MOD)\r\n\r\nif __name__ == \"__main__\":\r\n x, y = map(int, input().split(\" \"))\r\n n = int(input())\r\n\r\n solve(n, x, y)", "mod=(10**9)+7\r\n\r\nx,y=map(int,input().split())\r\nn=int(input())\r\nans=[x,y,y-x,-x,-y,x-y]\r\nprint(ans[(n-1)%6]%mod)", "x,y = (int(i) for i in input().split(\" \"))\r\n\r\nn = int(input())\r\ndef mod(k):\r\n return k%1000000007\r\nif n%6==1:\r\n print(mod(x))\r\nelif n%6==2:\r\n print(mod(y))\r\nelif n%6==3:\r\n print(mod(y-x))\r\nelif n%6==4:\r\n print(mod(-x))\r\nelif n%6==5:\r\n print(mod(-y))\r\nelse:\r\n print(mod(x-y))", "s = input().split()\r\na = [int(i) for i in s]\r\nn = int(input())\r\nnum = 1000000007\r\nif(n==1):\r\n\tprint(a[0]%(num))\r\nelif(n==2):\r\n\tprint(a[1]%(num))\r\nelse:\r\n\ta.append(a[-1]-a[-2])\r\n\t#print(a)\r\n\tif(n%3 == 1):\r\n\t\tif((n//3)%2 == 0):\r\n\t\t\tprint(a[0]%num)\r\n\t\telse:\r\n\t\t\tprint((-1*a[0])%num)\r\n\telif(n%3 == 2):\r\n\t\tif((n//3)%2 == 0):\r\n\t\t\tprint(a[1]%num)\r\n\t\telse:\r\n\t\t\tprint((-1*a[1])%num)\r\n\telse:\r\n\t\tif((n//3)%2 == 1):\r\n\t\t\tprint(a[2]%num)\r\n\t\telse:\r\n\t\t\tprint((-1*a[2])%num)\r\n\t\r\n", "x,y=map(int,input().split())\r\nn=int(input())\r\nif n%6==0:\r\n print(int((x-y)%(1e9+7)))\r\nelif n%6==1:\r\n print(int((x)%(1e9+7)))\r\nelif n%6==2:\r\n print(int((y)%(1e9+7)))\r\nelif n%6==3:\r\n print(int((y-x)%(1e9+7)))\r\nelif n%6==4:\r\n print(int((-x)%(1e9+7)))\r\nelif n%6==5:\r\n print(int((-y)%(1e9+7)))\r\n", "l=list(map(int,input().split()))\r\n\r\nfor i in range(4):\r\n l.append(l[-1]-l[-2])\r\n \r\nn=int(input())\r\nprint(l[(n-1)%6]%1000000007)", "x1 = input().split()\r\nx = int(x1[0])\r\ny = int(x1[1])\r\nlist1 = [x,y]\r\nb1 = False\r\nf1 = x\r\nf2 = y\r\nwhile b1==False:\r\n list1.append(f2-f1)\r\n a = f2-f1\r\n b = f2\r\n f2 = a\r\n f1 = b\r\n if len(list1) == 6:\r\n break\r\n\r\nn1 = int(input())\r\npos = n1 % 6\r\nif pos == 0:\r\n fn = list1[-1]\r\n print(fn % 1000000007)\r\nelse:\r\n fn = list1[pos-1]\r\n print(fn % 1000000007)\r\n \r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef 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 Jzzhu_and_Sequences():\r\n x,y = invr()\r\n n = inp()\r\n\r\n if n%3 == 0:\r\n if (n//3) % 2 == 0:\r\n ans = -(y-x)\r\n else:\r\n ans = (y-x)\r\n else:\r\n if (n//3) % 2 == 0:\r\n if n%3 == 1:\r\n ans = x \r\n else:\r\n ans = y \r\n else:\r\n if n%3 == 1:\r\n ans = -x \r\n else:\r\n ans = -y \r\n\r\n modulo = (10**9) + 7 \r\n print(ans%modulo)\r\n return\r\n\r\nJzzhu_and_Sequences()", "x=input()\nx=x.split(' ')\nn=eval(input())\nlist1=[eval(x[0]),eval(x[1])]\nlist1.append(list1[1]-list1[0])\nflag=(n-1)%3\ntemp=int((n-1)/3)\nif(temp%2==0):\n t=list1[flag]\nelse:\n t=-list1[flag]\nprint(t%1000000007,end='')\n\t \t\t\t\t \t\t\t\t\t \t\t \t\t\t \t \t", "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\nx,y = M()\r\nn = I()\r\nsixTerms = [x,y,y-x,-x,-y,x-y]\r\n# print(sixTerms)\r\nindex = (n-1)%6\r\nprint(sixTerms[index]%mod1)", "f1,f2=map(int,input().split())\r\nn=int(input())\r\nd={1:f1,2:f2,3:f2-f1,4:-f1,5:-f2,0:f1-f2}\r\nprint(d[n%6]%1000000007)", "x,y = map(int, input().split())\r\nn = int(input())\r\ncase = n%6\r\ncases = [x-y, x, y, y-x, -x, -y]\r\nprint(cases[case]%1000000007)", "a,b=list(map(int,input().split())),int(input())%6\r\nprint(int((a[0]*(b-2)*(b-5)*(5*b*(b-3)*(2*b-5)-(11*b-3)*(b-1)*(b-4))+a[1]*(b-1)*(b-4)*((11*b-3)*(b-2)*(b-5)-b*(b-3)*(11*b-52)))/120)%(10**9+7))", "a = list(map(int, input().split()))\r\nn = int(input())\r\na.append(a[1] - a[0])\r\na.append(-a[0])\r\na.append(-a[1])\r\na.append(-a[2])\r\nprint(a[n % 6 - 1] % 1000000007)", "x, y = list(map(int, input().split()))\r\nn = int(input())\r\na = (x, y, y-x, -x, -y, x-y)\r\nprint(a[(n-1)%6] % 1000000007)", "x, y = map(int,input().split())\r\nn = int(input())\r\n\r\na = [x, y]\r\nfor i in range(2,6):\r\n a.append(a[i-1] - a[i-2])\r\nprint(a[n % 6 - 1] % 1000000007)", "import math\nimport sys\n# from xmlrpc.client import MININT\n\nx,y=map(int,input().split())\n\n# t=True\n# s=input()\n# ans=0\n# for i in range(int(input())):\nn=int(input())\n \n # st=input()\n # n,k=map(int,input().split())f() \n# arr=list(map(int,input().split()))\nif(n%6==1):\n print(x%1000000007)\nif(n%6==2):\n print(y%1000000007)\nif(n%6==3):\n print((y-x)%1000000007)\nif(n%6==4):\n print((-x)%1000000007)\nif(n%6==5):\n print((-y)%1000000007)\nif(n%6==0):\n print((x-y)%1000000007)\n\n\t\t\t\t \t\t \t \t\t\t\t \t \t \t\t\t \t\t" ]

[ "y,k,n=map(int,input().split())\r\nx=k*(1+y//k)-y\r\nflag=0\r\nwhile x+y<=n:\r\n flag=1\r\n print(x,end=\" \")\r\n x+=k\r\nif flag==0:\r\n print(-1)", "y,k,n = map(int,input().split())\r\nx = k - y%k\r\nf = 0\r\nwhile x+y <= n:\r\n print(x,end=\" \")\r\n x += k\r\n f = 1\r\nif f==0:\r\n print(-1)", "a,b,c = list(map(int,input().split()))\r\np = (c-1)//b + (c%b==0)\r\nstring = []\r\nfor i in range(1,p+1):\r\n if(i*b-a>0):\r\n string.append(i*b-a)\r\nif(len(string)==0):\r\n print(-1)\r\nelse:\r\n for l in string:\r\n print(l,end=\" \")", "y, k, n = map(int, input().strip().split())\nx = k - (y % k)\n\nif y + x > n:\n print(-1)\nelse:\n print(*range(x, n - y + 1, k))\n", "def solve():\r\n y,k,n = map(int, input().split())\r\n if n<=y:\r\n print(-1)\r\n return\r\n else:\r\n x = 1\r\n z = []\r\n x = k-(y%k)\r\n while (x+y)%k==0 and (x+y) <= n:\r\n z.append(x)\r\n x+=k\r\n if len(z) == 0:\r\n print(-1)\r\n return\r\n print(*z)\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "a,b,c=map(int,input().split())\r\nk=a%b\r\np=a\r\nif k:\r\n p+=b-k\r\nexist=False\r\nfor i in range(p,c+1,b):\r\n if i-a>0:\r\n exist=True\r\n print(\"%d \" % (i-a),end=\"\")\r\nif exist==False:\r\n print(\"-1\")", "y, k, n = map(int, input().split())\n\ni = y//k+1\nif k*i > n:\n print(-1)\nelse:\n while k*i <= n:\n print(k*i-y, end=' ')\n i += 1\n", "y, k, n = map(int,input().split())\r\n\r\ns = 1\r\n\r\nl = []\r\n\r\nwhile k*s <= n :\r\n if k*s-y > 0 :\r\n l.append(k*s-y)\r\n s += 1\r\n \r\n\r\nif l :\r\n print(*l)\r\nelse : \r\n print(-1)", "y,k,n = map(int, input().split())\r\n'''\r\nx + y <= n\r\n(x + y) % k == 0\r\n'''\r\n\r\ndef sim(x):\r\n return (x + y) % k == 0\r\n\r\nval = 0\r\nworks = []\r\ndef check(i):\r\n if(i > y):\r\n works.append(str(i - y))\r\n\r\n\r\nwhile(val <= n):\r\n check(val)\r\n val += k\r\nif(len(works) == 0):\r\n print(-1)\r\nelse:\r\n print(\" \".join(works))\r\n", "import math\r\n\r\ndef main():\r\n y,k,n = map(int,input().split())\r\n r = []\r\n for i in range(1, n//k + 1):\r\n if i*k > y:\r\n r.append(i*k-y)\r\n if len(r) == 0:\r\n print(-1)\r\n else:\r\n print(' '.join(map(str,r)))\r\n\r\n\r\nmain()", "y,k,n=map(int,input().split())\r\nif y==n:\r\n\tprint(-1)\r\nelse:\r\n\ta=((y//k)+1)*k-y\r\n\tif a+y>n:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\twhile a<=n-y:\r\n\t\t\tprint(a,end=\" \")\r\n\t\t\ta+=k\r\n", "y, k, n = list(map(int, input().split()))\n\nans = []\nx = 1\nwhile True:\n a = x*k - y\n if a + y > n:\n break\n if a > 0:\n ans.append(a)\n x += 1\n\nif ans == []:\n print(-1)\nelse:\n print(' '.join(map(str, ans)))\n\n", "y,k,n=map(int,input().split())\r\nlund=[]\r\nchut=[]\r\ni=1\r\nwhile k*i<=n:\r\n lund.append(k*i)\r\n i+=1\r\nfor i in lund:\r\n if i-y<=0:\r\n pass\r\n else:\r\n chut.append(i-y)\r\nif len(chut)==0:\r\n print(-1)\r\nelse:\r\n print(*chut)", "y, k, n = map(int, input().split())\r\nx = k - y%k\r\ncount = 0\r\nwhile(x+y<=n):\r\n print(x, end = \" \")\r\n count += 1\r\n x += k\r\nif count == 0:\r\n print(\"-1\")\r\n", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nsetrecursionlimit(10**7)\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\ny,k,n=RI()\nst=k-y%k\nif st+y>n:\n\tprint(-1)\nelse:\n\twhile 1:\n\t\tif st+y>n:\n\t\t\tbreak\n\t\tprint(st,end=\" \")\n\t\tst+=k\n", "#from collections import Counter\r\n#n = int(input())\r\ny,k,n = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n#t = list(map(int,input().split()))\r\n\r\nt = y//k\r\nl = []\r\ni = t+1\r\nwhile i*k <= n:\r\n l.append(i*k-y)\r\n i += 1\r\n\r\nif l:\r\n for i in l:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "y, k, n = [int(x) for x in input().split()]\r\nans = []\r\nfor x in range(k - y, n - y + 1, k):\r\n if x > 0:\r\n ans.append(str(x))\r\nif len(ans) > 0:\r\n print(\" \".join(ans))\r\nelse:\r\n print(-1)", "y, k, n = map(int, input().split())\r\nx = k-y % k\r\nif x+y > n:\r\n print('-1')\r\nwhile x+y <= n:\r\n print(x, end=' ')\r\n x += k\r\n", "y,k,n=[int(i) for i in input().split()]\r\n\r\narr=[]\r\nx=1\r\ni=0\r\n\r\nwhile(x+y<=n):\r\n x=(i*k)-y\r\n if((x+y)>n):\r\n break\r\n if(x>=1):\r\n arr.append(x)\r\n i+=1\r\n\r\nif(len(arr)==0):\r\n print('-1')\r\nelse:\r\n print(*arr)", "y, k, n = map(int, input().split())\r\n\r\nfirst = (((y // k) + 1) * k) - y\r\nif n <= y or first + y > n:\r\n print(-1)\r\nelse:\r\n for i in range(first, n - y + 1, k):\r\n print(i, end=\" \")\r\n print()\r\n", "# It's all about what U BELIEVE\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n###############################################################################\n############################ SOLUTION IS COMING ###############################\n###############################################################################\ny, k, n = gint_arr()\nx = k - y % k\nfound = False\nwhile x + y <= n:\n print(x, end=\" \")\n x += k\n found = True\n\nif not found:\n print(-1)", "from sys import stdin as sin\ndef gint():return int(sin.readline())\ndef gmap():return map(int,sin.readline().split())\ndef glist():return list(map(int,sin.readline().split()))\ndef gstr():return sin.readline()\n\nfrom math import ceil\ny,k,n=gmap()\ni=int(ceil(y/k))\nf=True\nfor j in range(i*k-y,n,k):\n if j+y>n:break\n if j!=0 :\n f=False\n print(j,end=\" \")\nif f:print(-1)", "y,k,n=map(int,input().split())\r\nans=[]\r\nstart=k*(y//k+1)\r\nfor i in range(n//k):\r\n if start<=n:\r\n ans.append(start-y)\r\n start+=k\r\nif len(ans)==0:\r\n print(\"-1\")\r\nelse:\r\n print(*ans)\r\n ", "y, k, n = list(map(int, input().split()))\nmx = n - y + 1\nfx = (((y // k) + 1) * k) - y\nif fx < mx :\n for x in range(fx, mx, k) :\n print(x, end = ' ')\n print()\nelse :\n print(-1)", "def getX(y,k,a):\r\n return (a*k)-y\r\n\r\ny,k,n=map(int,input().split())\r\na=n//k\r\nls=[]\r\nfg=True\r\nfor i in range(a,-1,-1):\r\n if getX(y,k,i)>=1:\r\n ls.append(getX(y,k,i))\r\n else:\r\n break\r\nls.reverse()\r\nif(len(ls)!=0):\r\n for i in range(len(ls)):\r\n print(ls[i],end=\"\")\r\n if i!=len(ls)-1:\r\n print(\" \",end=\"\") \r\nelse :\r\n print(-1) ", "y,k,n=map(int,input().split());c=1\r\nfor i in range(1,n//k+1):\r\n\tif k*i>y:c=0;print(k*i-y)\r\nif c:print(-1)", "y,k,n=map(int,input().split())\r\na=[]\r\nz=n//k\r\nb=0\r\nfor i in range(1,z+1):\r\n if k*i>y:\r\n a.append(k*i-y)\r\n b=1\r\na.sort()\r\nfor i in a:\r\n print(i,end=\" \")\r\nif b==0:\r\n print(\"-1\")\r\n", "y,k,n=map(int,input().split())\r\nprinted=False\r\nstart=k-(y%k)\r\nif (start+y)>n:\r\n print(-1)\r\nelse:\r\n for i in range(start,n,k):\r\n if i+y<=n:\r\n print(i,end=' ')", "y, k, n = map(int, input().split())\r\nmult = []\r\nfor i in range(k,n+1, k):\r\n mult.append(i)\r\nans = []\r\nfor x in mult:\r\n if x > y:\r\n ans.append(x-y)\r\nif ans == []:\r\n print(-1)\r\nelse:\r\n print(*ans)", "y,k,n=map(int,input().split())\r\nt=y;\r\nt=t-(t%k)\r\nt=t+k\r\nc=0\r\nwhile(t<=n):\r\n c=1\r\n print(t-y,end=\" \")\r\n t=t+k\r\nif(c==0):\r\n print(-1)", "y, k, n = map(int, input().split())\r\nx = 0\r\nif(y == k):\r\n x = k;\r\nelif(y > k):\r\n if(y%k == 0):\r\n x = k;\r\n else:\r\n x = k - y%k;\r\nelse:\r\n x = k - y;\r\nflag = True\r\nwhile(x <= n-y):\r\n print(x, end = \" \")\r\n flag = False\r\n x += k;\r\nif(flag):\r\n print(-1)", "y, k, n = map(int, input().split())\r\n# nums = [k - y%k + k*i for i in range(0, (n)//k-y//k)]\r\n\r\n\r\ndistToK = k - y%k\r\nnumXs = n//k - y//k\r\nif numXs > 0:\r\n for i in range(numXs):\r\n print(distToK + k*i, end=\" \")\r\nelse:\r\n print(-1)\r\n\r\n# if len(nums) == 0 :\r\n# print(-1)\r\n# else:\r\n# print(*nums, sep=\" \")", "y,k,n=map(int,input().split())\r\ncc=k\r\nans=[]\r\nwhile 1:\r\n\tif cc>n:\r\n\t\tbreak\r\n\tx=cc-y \r\n\tif x>0:\r\n\t\tans.append(x)\r\n\tcc+=k\r\nif len(ans)==0:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in ans:\r\n\t\tprint(i,end=\" \")\r\n\tprint()", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n y, k, n = [int(i) for i in input().split(\" \")]\r\n starting_y = (y // k) * k\r\n ending_n = (n // k) * k\r\n if starting_y + k > n:\r\n print(-1)\r\n else:\r\n z = starting_y + k\r\n while z <= n:\r\n if z + k > n:\r\n print(z - y)\r\n else:\r\n print(z - y, end=\" \")\r\n z += k\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "y, k, n = (int(x) for x in input().split())\r\n\r\nss = []\r\nfor a in range(1,n//k + 1):\r\n x = a*k - y\r\n if x > 0 and x + y <=n: \r\n ss.append(x)\r\nif len(ss) > 0: print(*ss)\r\nelse: print(-1)\r\n ", "y,k,n=map(int,input().split())\r\nsum=y+k-y%k\r\nif sum>n:\r\n print(-1)\r\nwhile sum<=n:\r\n print(sum-y,end=' ')\r\n sum+=k\r\n", "y, k, n = map(int, input().split())\r\nmul = y//k + 1\r\nval = False\r\nwhile k*mul <= n :\r\n print(k*mul-y, end=\" \")\r\n mul += 1\r\n val = True\r\nif not val:\r\n print(-1)", "if __name__ == '__main__':\r\n y, k, n = str(input()).split()\r\n y = int(y)\r\n k = int(k)\r\n n = int(n)\r\n res = list()\r\n head = y // k\r\n tail = n // k\r\n for i in range(head, tail + 1):\r\n v = i * k\r\n if y < v <= n:\r\n res.append(str(v - y))\r\n if len(res) > 0:\r\n print(' '.join(res))\r\n else:\r\n print(-1)\r\n", "y,k,n= map(int,input().split())\r\nl=[]\r\ni=1\r\nwhile (k*i<=n):\r\n if (k*i-y>0):\r\n l.append(str(k*i-y))\r\n i=i+1\r\n#print(l)\r\nif (len(l)>0):\r\n print(' '.join(l))\r\nelse:\r\n print('-1')", "y,k,n = map(int, input().split())\r\nx_min = (k - y%k)%k\r\nif x_min==0:\r\n x_min += k\r\n \r\nif x_min + y > n:\r\n print(-1)\r\nelse:\r\n while (x_min + y <= n):\r\n print(x_min, end=\" \")\r\n x_min+=k", "y,k,n=map(int, input().split())\r\nflg=0\r\nfor i in range(k,n+1,k):\r\n\tif i>y:\r\n\t\tprint(i-y, end=' ')\r\n\t\tflg=1\r\nif flg==0:\r\n\tprint(-1)", "y,k,n=map(int,input().split())\r\nval=n-y\r\na=(k-y%k)\r\nb=False\r\nwhile(a<=val):\r\n if(val==0):\r\n break\r\n print(a,end=\" \")\r\n a+=k\r\n b=True\r\nif b==False:\r\n print(\"-1\")\r\n", "y,k,n = map(int,input().split())\nx = n-y\nif x<1:\n print(-1)\n quit()\ndiff = k-(y%k)\nans = []\nwhile True:\n if diff<=x:\n ans.append(diff)\n else:\n break\n diff += k\nif len(ans)==0:\n print(-1)\nelse:\n print(*ans)", "ykn=input().split()\r\ny=int(ykn[0])\r\nk=int(ykn[1])\r\nn=int(ykn[2])\r\nc=k-y%k\r\nli=[]\r\nfor i in range(c,n-y+1,k):\r\n li.append(i)\r\nif len(li)==0:\r\n print(-1)\r\nelse:\r\n for i in li:\r\n print(i,end=' ')\r\n", "s=[int(n) for n in input().split()]\r\nn=1\r\nl=0\r\nwhile 1:\r\n\tif s[1]*n-s[0]>0 and s[1]*n<=s[2]:\r\n\t\tprint(s[1]*n-s[0],end=' ')\r\n\t\tl=1\r\n\telif s[1]*n>s[2]:\r\n\t\t\r\n\t\tbreak\r\n\tn+=1\r\nif l==0:\r\n\tprint(-1)\r\n\t\r\n", "y,k,n=map(int,input().split())\r\nx=k-(y%k)\r\nif (x+y)>n:\r\n\tprint(-1)\r\nelse:\r\n\tprint(*range(x,n-y+1,k))", "y,k,n=map(int,input().split())\r\nl=[];i=1;t=k*i\r\nwhile t<=n:\r\n if t>y:\r\n l.append(t-y)\r\n i+=1\r\n t=k*i\r\n\r\nif len(l)==0:\r\n print(-1)\r\nelse:\r\n for i in l:\r\n print(i,end=' ')\r\nprint()", "import sys, math, itertools, random, bisect\r\nfrom collections import defaultdict\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 10**9 + 7\r\n\r\n\r\nfor _ in range(1):\r\n y,k,n = get_ints()\r\n if k>y: z = k-y\r\n elif k==y: z = k\r\n else: z = k - (y%k)\r\n if z+y > n: print(-1)\r\n else:\r\n while z+y<=n:\r\n print(z,end=\" \")\r\n z += k\r\n print()\r\n\r\n", "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\n\r\ndef main():\r\n #n=int(input())\r\n #arr=list(map(int,input().split()))\r\n y,k,n=map(int,input().split())\r\n flag=0\r\n beg=y+(k-y%k)\r\n end=n\r\n for i in range(beg,end+1,k):\r\n print(i-y,end=\" \")\r\n flag=1\r\n if flag==0:\r\n print(-1)\r\n\r\n\r\n\r\n\r\nmain()\r\n\r\n", "y, k, n = map(int, input().split())\r\n\r\na = k - y % k\r\n\r\nif y + a <= n:\r\n if a == 0:\r\n print(\" \".join(str(x) for x in [(t + 1) * k for t in range((n - y) // k)]))\r\n else:\r\n print(\" \".join(str(x) for x in [a + t * k for t in range((n - y) // k + 1) if a + t * k + y <= n]))\r\nelse:\r\n print(-1)", "#!/usr/bin/pypy3\n# import sys\n# sys.stdin = open(\"/home/vaibhav/python/input.txt\", \"r\")\n# sys.stdout = open(\"/home/vaibhav/python/output.txt\", \"w\")\ny, k, n = map(int, input().split())\nt = (y // k + 1) * k\nal = []\nwhile t <= n:\n al.append(t - y)\n t += k\nif len(al) > 0:\n print(*al)\nelse:\n print(-1)\n", "data = input().split()\r\n\r\nY, K, N = int(data[0]), int(data[1]), int(data[2])\r\n\r\nanswer = []\r\n## So simple solution we just start count from K to N\r\n## and when we found i greater than Y value we just get one of answers will be\r\n## i - Y\r\n## and then increase i by K\r\ni = K\r\nwhile i <= N:\r\n if i > Y:\r\n answer.append(i - Y)\r\n i += K\r\n\r\nif len(answer) == 0:\r\n print('-1')\r\nelse:\r\n print(\" \".join(map(str, answer)))", "y,k,n=map(int, input().split())\r\nm =list(range(k-y%k, n-y+1, k))\r\nif len(m)!=0:\r\n print(*m)\r\nelse:\r\n print(-1)", "y,k,n=[int(e) for e in input().split()]\r\nr=(k-(y%k))%k\r\na=[r if r else k+r]\r\nif a[-1]+y>n:\r\n print(-1)\r\nelse:\r\n while a[-1]+k+y<=n:\r\n a.append(a[-1]+k)\r\n print(*a)", "y, k, n = list(map(int, input().split()))\r\nA = n // k * [0]\r\npos = 0\r\nfor i in range(1, n // k + 1):\r\n x = i * k - y\r\n if (1 <= x):\r\n A[pos] = x\r\n pos += 1\r\nif (pos == 0):\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str, A[:pos])))", "y,k,n=map(int,input().split())\r\na=[]\r\nx=k-y%k\r\nif(x+y > n):\r\n print(-1)\r\n \r\nelse:\r\n for i in range(x+y,n+1,k):\r\n print(i-y,end=\" \")\r\n \r\n", "def main():\r\n from sys import stdin, stdout\r\n\r\n y, k, n = map(int,stdin.readline().split())\r\n maxfact = n//k\r\n ans = []\r\n for fact in range(1,maxfact+1):\r\n if k*fact-y > 0:\r\n ans.append(k*fact-y)\r\n if len(ans)==0:\r\n stdout.write('-1\\n')\r\n return\r\n for x in ans:\r\n stdout.write(str(x)+' ')\r\n stdout.write('\\n')\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "x,y,z=[int(x) for x in input(\"\").split()]\r\nz=(z-(z%y)-x)\r\nl=[]\r\nif(z>0):\r\n l.append(z)\r\n while(z>y):\r\n z=z-y\r\n l.append(z)\r\n l.reverse()\r\n print(*l)\r\nelse:\r\n print(-1)", "y, k, n = [int(i) for i in input().split()]\r\ns = y\r\ns += k - (s % k)\r\nans = False\r\nwhile s <= n:\r\n print(s - y, end = \" \")\r\n s += k\r\n ans = True\r\nif(not ans):\r\n print(-1)", "# Problem Link: https://codeforces.com/problemset/problem/239/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\ny, k, n = map(int, input().split())\r\n\r\nans = []\r\nstart = k - (y%k)\r\n\r\nif start == 0:\r\n start += k\r\n\r\nwhile (y + start <= n):\r\n ans.append(start)\r\n start += k\r\n\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n for pot in ans:\r\n print(pot, end = \" \")\r\n print(\"\")", "y, k, n = map(int, input().split())\r\nprint(' '.join(map(str, range(y//k*k+k-y, n-y+1, k))) if n//k>y//k else -1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"a,b,c=map(int,input().split())\r\nd=0\r\nfor x in range(1,c):\r\n a+=x\r\n if a%b==0 and a<c:\r\n d+=x\r\n break\r\n a-=x\r\nif c-a<b: print(-1)\r\nelse:\r\n for x in range(d,c-a+1,b):\r\n print(x,end=\" \")\r\n\"\"\"\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n\r\na,b,c=map(int,input().split())\r\nd=0\r\nfor x in range(1,c+1,b):\r\n a+=x\r\n if a%b==0 and a<=c:\r\n print(x,end=\" \")\r\n a-=x\r\n\r\nif c-a<b: print(-1)\r\n\"\"\"\r\n", "b, k, n = map(int, input().split())\r\nu = k - b % k\r\nif u + b > n:\r\n print(-1)\r\nelse:\r\n for x in range(u, n - b + 1, k):\r\n print(f\"{x} \", end = \"\")\r\n", "y,k,n=map(int,input().split())\r\nr=k-y%k\r\nm=n-y\r\nif (r<=m):\r\n print (r,end=' ')\r\n r=r+k\r\n while (r<=m):\r\n print (r,end=' ')\r\n r+=k\r\nelse:\r\n print (-1)\r\n \r\n", "y,k,n=map(int,input().split())\r\nr=n%k\r\nu=n-r-y\r\nq=[]\r\nwhile(u>0):\r\n q.append(u)\r\n u=u-k\r\nif(len(q)==0):\r\n print(-1)\r\nelse:\r\n s=q[::-1]\r\n print(*s)", "y,k,n=map(int,input().split())\r\ndef findsol(y,k,n): \r\n lt=n-y\r\n jum=k-(y%k)\r\n ans=[]\r\n for i in range(jum,lt+1,k):\r\n ans.append(i)\r\n if not ans:\r\n print(-1)\r\n return\r\n print(*ans)\r\nfindsol(y,k,n)\r\n", "\"\"\"import sys\r\nsys.stdin=open('in.txt','r')\r\nsys.stdout=open('out.txt','w')\"\"\"\r\n\r\n# start code........\r\nb,k,n=map(int,input().split())\r\ntot=(int(b/k)+1)*k;a=1\r\nfor i in range (tot,n+1,k):\r\n\tprint(i-b,end=\" \");a=0\r\nif(a==1):\r\n\tprint(-1)\r\n", "y,k,n=map(int, input().split())\r\nans=k-(y%k)\r\nif ans+y<=n:\r\n while(ans<=n-y):\r\n print(ans, end=\" \")\r\n ans+=k\r\nelse:\r\n print(-1)", "y, k, n = map(int, input().split())\r\na = 1\r\nsol = False\r\nwhile (a*k) <= n:\r\n if (a*k) > y:\r\n x = (a*k) - y\r\n print(x, end = \" \")\r\n sol = True\r\n a+=1\r\n\r\nif not sol:\r\n print(-1, end=\" \")\r\n", "import operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\ny, k, n = invr()\r\n\r\nres = 0\r\n\r\nl = int(ceil((y+1)/k)) * k\r\nwhile l <= n:\r\n print(l-y, end=\" \")\r\n l += k\r\n res += 1\r\nif res == 0:\r\n print(-1)\r\n", "y,k,n=map(int,input().split())\r\nx=int(n/k)\r\npotato=[k*i-y for i in range(1,x+1) if k*i>y and k*i<=n]\r\nif(len(potato)>0):\r\n print(*potato)\r\nelse:\r\n print(-1)", "y, k, n = [int(e) for e in input().split()]\r\n# (x+y) <= n, (x+y) % k == 0\r\ncur = y//k+1\r\nif cur*k > n:\r\n print(-1)\r\nelse:\r\n while cur*k <= n:\r\n print(cur*k-y, end=\" \")\r\n cur += 1 \r\n", "y, k, n = map(int, input().strip().split(\" \"))\r\ni = int(y/k + 1)\r\nl = []\r\nx = int(n/k)\r\nwhile i <= x:\r\n l.append(i*k - y)\r\n i += 1\r\n\r\nif len(l) == 0:\r\n print(-1)\r\nelse:\r\n for i in l:\r\n print(i, end=\" \")", "from math import ceil; y, k, n = map(int,input().split()); ans = [ ]; i = (ceil(y/k) * k) - y; i += k * (not i)\r\nwhile i <= n - y :ans.append(i); i += k \r\nif ans :print(*ans)\r\nelse : print(-1)\r\n\r\n", "y,k,n=map(int,input().split())\r\nctr=y+k-y%k\r\nif ctr>n:\r\n print(-1)\r\nwhile ctr<=n:\r\n print(ctr-y,end=' ')\r\n ctr+=k", "y,k,n=[int(x) for x in input().split(' ')]\r\nx=k-y%k\r\nflag=0\r\nwhile(x+y <= n):\r\n\tprint(x)\r\n\tflag=1\r\n\tx+=k\r\nif not flag:\r\n\tprint(-1)", "y,k,n=map(int,input().split(\" \"))\r\nx=k-(y%k);t=\"\"\r\nwhile(x+y<=n):\r\n t+=str(x)+\" \"\r\n x+=k\r\nif(len(t)==0):\r\n print(-1)\r\nelse:\r\n print(t[0:len(t)-1])", "import math\ny, k, n = map(int, input().split())\n# x+y<n k|x+y x+y=ka ka<n a<n/k a= 0 to floor(n/k)\n# ki-y>=1 i>=(y+1)/k\nl = [k * i - y for i in range(math.ceil((y + 1) / k), n // k+1)]\nif len(l) is 0:\n print(-1)\nelse:\n print(' '.join(map(str, l)))\n", "y,k,n = map(int,input().split())\r\nl = []\r\nx = y + k - y%k\r\nfor i in range(x,n+1,k):\r\n l.append(i-y)\r\nif len(l)==0:\r\n print('-1')\r\nelse:\r\n print(*l)\r\n", "# LUOGU_RID: 101472631\ny, k, n = map(int, input().split())\r\nx = k - y % k\r\nif x + y > n:\r\n exit(print(-1))\r\nans = []\r\nwhile x + y <= n:\r\n ans += x,\r\n x += k\r\nprint(*ans)", "y, k, n = map(int, input().split())\r\n\r\nf = (n-y-n%k)%k\r\nif f == 0:\r\n f = k\r\nif n-y < f:\r\n print(-1)\r\nelse:\r\n for i in range(f, n-y+1, k):\r\n print(i)\r\n", "y,k,n=map(int,input().split())\r\ni=1\r\nf=0\r\nwhile i<=(n-y):\r\n\tz=(i+y)%k\r\n\tif z==0:\r\n\t\tf=1\r\n\t\tprint(i,end=\" \")\r\n\ti=i+(k-z)\r\nif f==0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(\"\") \r\n", "y, k, n = map(int, input().split())\n\nif ((k-y)%k or k) < n-y+1: \n print(*range((k-y)%k or k, n-y+1, k))\nelse:\n print(-1)", "def run():\r\n\timport sys\r\n\tsys.stdin = open('/home/puneet/Documents/Cpp Programs/input.txt', 'r')\r\n\tsys.stdout = open('/home/puneet/Documents/Cpp Programs/output.txt', 'w') \r\n\tfrom math import ceil,sqrt,floor\r\n\r\n# run()\r\ny,k,n = map(int,input().split())\r\ns = set()\r\nif(y>=n):\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(k,n+1,k):\r\n\t\tif(i-y>0):\r\n\t\t\ts.add(i-y)\r\n\tif(len(s)==0):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\ts = list(s)\r\n\t\ts.sort()\r\n\t\tprint(*s)", "y,k,n=map(int,input().split())\r\nans=[]\r\nr=k-y%k\r\nm=n-y\r\nif r<=m:\r\n ans.append(r)\r\n r=r+k\r\n while r<=m:\r\n ans.append(r)\r\n r=r+k\r\nif ans:\r\n print(*ans,sep=\" \")\r\nelse:\r\n print(-1)\r\n \r\n\r\n", "\r\ny,k,n = map(int, input().split())\r\nif(y>=n):\r\n print(-1)\r\nelse:\r\n i=1\r\n x=[]\r\n while(k*i<=n):\r\n t = k*i\r\n if(y<t):\r\n x.append(t-y)\r\n i=i+1\r\n if(len(x)>0):\r\n print(' '.join(str(i) for i in x))\r\n else:\r\n print(-1)\r\n", "y, k, n = map(int, input().split())\n\nli = []\nstart = k - (y % k)\n\nif (start + y > n or start <= 0):\n\tprint(-1)\n\nelif (start > 0 and start + y <= n):\n\tfor x in range(start, n + 1, k):\n\t\tend = x + y \n\t\tif (end <= n):\n\t\t\tli.append(x)\n\tprint(*li)\n", "y, k, n = map(int, input().split())\r\nr = ''\r\n\r\nd = abs(y%k-k)\r\n\r\nfor i in range(d, n-y+1, k):\r\n r += str(i) + ' '\r\n\r\nif r == '':\r\n print('-1')\r\nelse:\r\n print(r)", "y,k,n = map(int,input().split())\r\nn = n-n%k\r\nif n<=y:\r\n print(-1)\r\nelse:\r\n ans = []\r\n while n>y:\r\n ans.append(n-y)\r\n n-=k\r\n print(*sorted(ans))", "y, k, n = map(int,input().split())\r\ns = ' '.join(map(str, range(k-y%k, n-y+1, k)))\r\nprint(s if s else -1)", "y, k, n = map(int, input().split())\r\nvals = []\r\nfor x in range(((y//k)+1)*k-y, n+1, k):\r\n if x+y>n:\r\n break\r\n vals.append(str(x))\r\nif not vals:\r\n print(-1)\r\nelse:\r\n print(*vals)\r\n", "y, k, n = list(map(int, input().split(' ')))\r\nx = y + k - y%k\r\nans = []\r\nfor i in range(x, n + 1, k):\r\n\tans.append(i - y)\r\nif len(ans) == 0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(*ans)", "y, k, n = [int(x) for x in input().split(\" \")]\r\nanswer = []\r\nx = k - y % k\r\n\r\nwhile x < n - y + 1:\r\n answer.append(str(x))\r\n x += k\r\n \r\nif len(answer):\r\n print(' '.join(answer))\r\nelse:\r\n print('-1')", "y, k, n = map(int, input().split())\r\nans = []\r\nx = (-y) % k\r\nwhile x <= n - y:\r\n if x:\r\n ans.append(x)\r\n x += k\r\nif ans:\r\n print(*ans)\r\nelse:\r\n print(-1)\r\n", "y,k,n=map(int,input().split())\r\nlist1=[]\r\nkk=k\r\nfor i in range(k,n+1,kk):\r\n list1.append(i)\r\nfor i in range(len(list1)):\r\n list1[i]=list1[i]-y\r\nf=0\r\nfor i in range(len(list1)):\r\n if(list1[i]>=1):\r\n print(list1[i],end=\" \")\r\n f=1\r\nif(f==0):\r\n print(-1)", "# http://codeforces.com/problemset/problem/239/A\ny, k, n = map(int, input().split())\nx = list(range(k-y%k, n-y+1, k))\nprint(' '.join(str(i) for i in x)if x else -1)\n'''\ny, k, n = map(int, raw_input().split())\nL = [xy - y for xy in range(0, n + 1, k) if xy > y]\nif L : print ' '.join(map(str, L))\nelse : print -1\n'''\n", "y,k,n=list(map(int,input().split()))\r\nans=[]\r\nx=k-y%k\r\nif x+y>n:\r\n print(-1)\r\nwhile x+y<=n:\r\n print(x,end=' ')\r\n x+=k\r\n#for x in range(1,n+1):\r\n# amt=x+y\r\n# if amt<=n and amt%k==0:\r\n# ans.append(x)\r\n#if ans==[]:print(-1)\r\n#else:print(*ans)\r\n", "y,k,n=map(int,input().split())\r\nans=\"\"; mul=1\r\nwhile k*mul<=n:\r\n x=k*mul-y\r\n if x<1: mul+=1; continue\r\n ans+=str(x)+\" \"\r\n mul+=1\r\nif len(ans)==0: print(-1)\r\nelse: print(ans)", "y,k,n = map(int,input().split())\r\nf=[]\r\nx=k-y%k\r\nwhile(x<n-y+1):\r\n\tf.append(str(x))\r\n\tx+=k\r\nif len(f):\r\n\tprint(' '.join(f))\r\nelse:\r\n\tprint('-1')", "s=input('')\r\ny,k,n=s.split(' ')\r\ny=int(y)\r\nk=int(k)\r\nn=int(n)\r\nval=n-y\r\nl=[]\r\ntemp=val\r\nz=y//k\r\nwhile(True):\r\n z+=1\r\n temp1=k*z\r\n x=temp1-y\r\n #print(x)\r\n if(x<=temp and x>=1):\r\n l.append(x)\r\n else:\r\n break\r\nif(len(l)==0):\r\n print('-1')\r\nelse:\r\n for i in l:\r\n print(i,end=' ')\r\n\r\n \r\n ", "y,k,n = map(int,input().split())\r\n\r\n# x<=n-y and x+y divisible by k\r\n\r\nj = 1\r\nres = []\r\nwhile k*j<=n:\r\n if k*j-y>0:\r\n res.append(k*j-y)\r\n j+=1\r\n\r\nif len(res)==0:\r\n print(-1)\r\nelse:\r\n print(*res)", "y, k, n=[int(i) for i in input().split()]\r\nt=y//k+1\r\nx=k*t-y\r\ncnt=0\r\nwhile(x+y<=n):\r\n cnt+=1\r\n print(x,end=\" \")\r\n t+=1\r\n x=k*t-y\r\nif(cnt==0):\r\n print(-1)", "import sys\r\ninput=sys.stdin.readline\r\ny,k,n=map(int,input().split())\r\nz=-1\r\ni=1\r\nx=n-y\r\nans='k'\r\nwhile z<=n:\r\n z=k*i\r\n i+=1\r\n x=z-y\r\n if x>=1 and x<=n-y:\r\n print(x,end=' ')\r\n ans='something'\r\nif ans!='something':\r\n print(-1)\r\n\r\n", "from math import ceil\r\ny, k, n = map(int, input().split())\r\nm = ceil(y / k)\r\nres = []\r\nwhile 1:\r\n\tx = m * k - y\r\n\tif x+y > n:\r\n\t\tbreak\r\n\tif x >= 1:\r\n\t\tres.append(x)\r\n\tm+= 1\r\n\r\nif len(res) == 0:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(*res)", "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 = \"./code/input.txt\"\r\n OUTPUT_FILE_PATH = \"./code/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(Y, K, N):\r\n rem = K - (Y % K)\r\n X = K if rem == 0 else rem\r\n ans = []\r\n\r\n while X+Y <= N:\r\n ans.append(X)\r\n X += K\r\n\r\n return -1 if not ans else \" \".join(map(str, ans))\r\n\r\n\r\nY, K, N = read_numeric_list()\r\n\r\nprint(solve(Y, K, N))\r\n", "y,k,n=input().split()\r\ny,k,n=int(y),int(k),int(n)\r\nc=0\r\nif(y<k):\r\n x=k-y\r\nelse:\r\n x=k-y%k\r\nif(x==0):\r\n x=k\r\nwhile(x<=n-y):\r\n c+=1\r\n print(x,end=' ')\r\n x+=k\r\nif(c==0):\r\n print(-1)\r\n\r\n ", "l = input().split(' ')\r\ny, k, n = int(l[0]), int(l[1]), int(l[2])\r\nx = k - y % k\r\nprinted = False\r\nt = n - y\r\nwhile x <= t:\r\n if (x+y) % k == 0:\r\n printed = True\r\n print(x, end=\" \")\r\n x += k\r\nif not printed: print(-1)", "from math import ceil\r\ny,k,n=map(int,input().split())\r\nx=[]\r\nfor i in range(ceil((y+1)/k),ceil((n+1)/k)):\r\n x.append(k*i-y)\r\nif(x):\r\n print(*x)\r\nelse:\r\n print(-1)", "y,k,n=list(map(int,input().split()))\r\nx= k-y%k\r\nl=n-y\r\nif (x<=l):\r\n print(x,end=' ')\r\n x+=k\r\n while x<=l:\r\n print(x,end=' ')\r\n x+=k\r\nelse:\r\n print(\"-1\")", "y,k,n=map(int,input().split())\r\na=[]\r\nfor i in range(k,n+1,k):\r\n if i<=y:continue\r\n if (i)%k==0:a.append(str(i-y))\r\nprint(-1 if len(a)==0 else ' '.join(a))", "import math as m\r\ny,k,n=map(int,input().split())\r\nif y==n:\r\n print(-1)\r\nelse:\r\n res=[]\r\n temp=(int(m.floor(y/k))+1)*k\r\n while temp<=n:\r\n res.append(temp)\r\n print(temp-y,end=\" \")\r\n temp+=k\r\n if len(res)==0:\r\n print(-1)", "y, k, n = map(int, input().split())\nx = (y//k + 1)*k - y\nans = True\nfor i in range(x, n-y+1, k):\n print(i, end = \" \")\n ans = False\nif ans == True:\n print(-1)\n", "y,k,n=list(map(int,input().split()))\nans=[]\nx=k-(y%k)\n\nif x+y<=n:\n\twhile x+y<=n:\n\t\tans.append(x)\n\t\tx+=k\n\tprint(*ans)\nelse:\n\tprint(-1)\n", "(y, k, n) = map(int, input().split(' '))\n\nlst = []\n\nx = k - y % k\nwhile x + y <= n:\n if (x + y) % k == 0:\n lst.append(x)\n x += k\n \n\nif len(lst) == 0:\n print(-1)\nelse:\n print(' '.join(list(map(str,lst))))\n", "(y,k,n)=list(map(int,input().split()))\r\nif n<=y:\r\n print(\"-1\")\r\nelse:\r\n count=1\r\n mulcount=0\r\n product=k\r\n while product<=y:\r\n count+=1\r\n product=k*count\r\n while product>y and product<=n:\r\n print(product-y,end=\" \")\r\n mulcount+=1\r\n count+=1\r\n product=k*count\r\n if mulcount==0:\r\n print('-1')", "\r\n(y,k,n)=(input().split(\" \"))\r\ny=int(y)\r\nk=int(k)\r\nn=int(n)\r\n\r\n# (x+y)<=n\r\n# x\r\n# (x+y)%k==0\r\n# (x+y)/k =1\r\n# x+y= k\r\n# x= k-y\r\n# print(y,n,k)\r\n\r\na=[]\r\na.append(k-y)\r\n# print(a[0])\r\n\r\nx=a[0]\r\nres=\"\"\r\nwhile (x+y)<=n:\r\n if x>0:\r\n res+= str(x)+\" \"\r\n x+=k\r\nif res ==\"\":\r\n print(-1)\r\nelse:\r\n print(res)\r\n\r\n", "inp=list(map(int,input().split()))\r\ny,k,n=inp\r\nn-=(n%k)\r\nend=n\r\nstart=y+(k-y%k)\r\nif start>end:\r\n print (-1)\r\nfor i in range(start,end+1,k):\r\n print (i-y,end=\" \")", "# python 3\n\"\"\"\n\"\"\"\n\n\ndef two_bags_of_potatoes(y_int: int, k_int: int, n_int: int) -> None:\n start_pos = max(2, k_int)\n x_plus_y_list = list(range(start_pos, n_int + 1, k_int))\n # print(x_plus_y_list)\n x_list = []\n for each in x_plus_y_list:\n x = each - y_int\n if x >= 1:\n x_list.append(x)\n if len(x_list) == 0:\n x_list.append(-1)\n print(*x_list)\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n y, k, n = list(map(int, input().split()))\n (two_bags_of_potatoes(y, k, n))\n", "y,k,n=map(int,input().split())\r\nl=[]\r\naa=True\r\nd=(-y)%k\r\nif d==0:d+=k\r\nfor x in range(d,n-y+1, k):\r\n aa=False\r\n print(x,end=' ')\r\nif aa: print(-1)\r\nelse:print()\r\n\r\n", "y, k, n = [int(i) for i in input().split()]\n\nborder = n//k\nflag = 0\nfor q in range(1, border + 1):\n x = k*q - y\n if x >= 1:\n print(x, end=\" \")\n flag = 1\n\nif not flag:\n print(-1)", "# https://codeforces.com/problemset/problem/239/A\r\n\r\n\"\"\"\r\nFirst bag contains x potatoes and second has y\r\n\r\nLost the first bag of potatoes. However Valera remembers the total x+y\r\nWe know that x+y is:\r\n * less than or equal to n\r\n * divisible by k\r\n\r\nSo answers are going to be of the form x+y = pk <= n\r\nSo first 1 <= x <= k - y\r\n\"\"\"\r\n\r\ny, k, n = map(int, input().split())\r\n\r\ncandidates = [str(x) for x in range(k-y, (n//k)*k - y + 1, k) if x > 0]\r\n\r\nif candidates:\r\n print(\" \".join(candidates))\r\nelse:\r\n print(-1)\r\n", "y, k, n = [int(item) for item in input().split(\" \")]\r\nm = []\r\nsum = 0\r\nwhile sum <= n:\r\n if sum > y:\r\n l = (sum - y)\r\n m.append(l)\r\n sum = sum + k\r\nif m == []:\r\n print(-1)\r\nprint(\" \".join(map(str, m)))", "y,k,n=map(int,input().split())\r\nres = 0\r\nfor i in range(k,n+1,k):\r\n q = i-y\r\n if (q)<=n and q>0:\r\n res=1\r\n print(q,end=\" \")\r\nif not res:\r\n print(-1)", "X = list(map(int, input().split()))\r\nAnswer = []\r\nRemainder = X[1] - X[0] % X[1]\r\nDiff = X[2] // X[1] - X[0] // X[1]\r\nfor i in range(Diff):\r\n Answer.append(str(Remainder+ i * X[1]))\r\nif len(Answer)==0:\r\n print(-1)\r\nelse:\r\n print(\" \".join(Answer))\r\n", "y, k, n = [int(i) for i in input().split()]\n\nl1 = k - (y%k)\nl2 = (n - n%k) - y\n\noutput = [i for i in range(l1, l2+1, k)]\n\nif output == []:\n\tprint(-1)\nelse:\n\tprint(*output)\n", "y, k, n = map(int, input().split())\r\nflag = 'none'\r\nfor total in range(0, n+1, k):\r\n x = total - y\r\n if x > 0:\r\n print(x, end=' ')\r\n flag = 'found'\r\nif flag == 'none':\r\n print(-1)\r\n", "y, k, n = [int(i) for i in input().split()]\r\nx = []\r\n\r\nfor i in range(k, n+1, k):\r\n if i-y > 0:\r\n x.append(i-y)\r\n\r\nif not x:\r\n print(-1)\r\nelse:\r\n for i in x:\r\n print(i, end=' ')\r\n", "def getX():\r\n y , k , n = [int(x) for x in input().split()]\r\n rFF = k - y % k\r\n ON = rFF\r\n lst = []\r\n while y + ON <= n:\r\n lst.append(str(ON))\r\n ON += k\r\n if lst != []:\r\n return \" \".join(lst)\r\n return \"-1\"\r\nprint(getX())", "y,k,n=map(int,input().split())\r\n\r\nif(y+k-(y%k)<n+1):\r\n\r\n for i in range(y+k-(y%k),n+1,k):\r\n print(i-y,end=\" \")\r\nelse:\r\n print(-1)", "y,k,n=map(int,input().split())\r\nflag=0\r\njav=[]\r\nif n <k :\r\n flag=-1\r\nelse:\r\n if n%k!=0:\r\n n=n-(n%k)\r\n if n<y+1:\r\n flag=-1\r\n else:\r\n while n-y>0:\r\n jav.append(n-y)\r\n n-=k\r\nif flag==-1:\r\n print(-1)\r\nelse:\r\n for i in range(len(jav)-1,-1,-1):\r\n print(jav[i],end=\" \")", "y, k, n = map(int, input().split())\r\nx = k - y % k\r\ntop = n - y\r\nif (x <= top):\r\n print(x,end=\" \")\r\n x += k\r\n while (x <= top):\r\n print(x,end=\" \")\r\n x += k\r\n print()\r\nelse:\r\n print(\"-1\")", "data = input().split()\n\nY, K, N = int(data[0]), int(data[1]), int(data[2])\n\nanswer = []\ni = K\nwhile i <= N:\n if i > Y:\n answer.append(i - Y)\n i += K\n\n\nif len(answer) == 0:\n print('-1')\nelse:\n print(\" \".join(map(str, answer)))\n", "y,k,n=map(int,input().split())\r\nx=k-y%k\r\nf=0\r\nwhile x+y<=n:\r\n print(x,end=' ')\r\n x=x+k\r\n f=1\r\nif f==0:\r\n print(-1)", "def two_bags_of_potatoes():\r\n y,k,n = map(int,input().split())\r\n x = k - (y % k)\r\n \r\n maxi = n-y\r\n \r\n if x <= maxi:\r\n print(x,end = \" \")\r\n x = x + k\r\n while(x <= maxi):\r\n print(x,end=' ')\r\n x= x + k \r\n else:\r\n print(-1)\r\n\r\n\r\ntwo_bags_of_potatoes()", "y,k,n=list(map(int,input().split()));s=(y//k*k)+k;flg=True\r\nwhile s<=n:print(abs(y-s),end=\" \");s+=k;flg=False\r\nif flg==True:print(-1)", "y,k,n=map(int,input().split())\r\nx=k-y%k\r\nif x+y>n:\r\n print(-1)\r\nelse:\r\n print(*range(x,n-y+1,k))", "y, k, n = map(int, input().split())\n\nx = list(range(k - y % k, n - y + 1, k))\n\nprint(' '.join(str(i) for i in x) if x else -1)", "y,k,n=map(int,input().split())\r\nl=range((k-y)%k or k,n-y+1,k) or (-1,)\r\nprint(*l)", "from math import ceil\r\ny,k,n = [int(i) for i in input().split()]\r\npos = []\r\nif y==n:\r\n print(\"-1\")\r\nelse:\r\n for i in range(ceil(y/k)*k,n+1,k):\r\n if i-y!=0:\r\n pos.append(i-y)\r\n if pos:\r\n print(*pos)\r\n else:\r\n print(-1)", "y, k, n = list(map(int,input().split()))\r\nX_es = []\r\nfor i in range(k, n+1, k):\r\n if i - y >= 1:\r\n X_es.append(i-y)\r\nif len(X_es)!=0:\r\n for x in X_es:\r\n print (x)\r\nelse:\r\n print (-1)", "y,k,n = map(int,input().split())\nf=[]\nx=k-y%k\nwhile(x<n-y+1):\n\tf.append(str(x))\n\tx+=k\nif len(f):\n\tprint(' '.join(f))\nelse:\n\tprint('-1')\n", "import math\r\nimport sys\r\nimport collections\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\n\r\ny, k, n = mi()\r\nr = []\r\nfor i in range(cdiv(y + 1, k), cdiv(n + 1, k)):\r\n r.append(k * i - y)\r\nprint(' '.join([str(x) for x in r])) if r else print(-1)\r\n", "from sys import stdin, stdout\r\n\r\nif not __debug__:\r\n stdin = open(\"input.txt\", \"r\")\r\n\r\ntcs = int(stdin.readline()) if not __debug__ else 1\r\nt = 1\r\nwhile t<=tcs:\r\n y, k, n = map(int, stdin.readline().split())\r\n \r\n b = y//k + 1\r\n e = n//k + 1\r\n if b<e:\r\n for i in range((y//k)+1, (n//k)):\r\n print((k*i)-y, end=' ')\r\n print(k*(n//k)-y)\r\n else:\r\n print(-1)\r\n t += 1\r\n", "y,k,n = list(map(int, input().split()))\r\nx = k-y%k\r\nt = n-y\r\n\r\nif x<=t:\r\n print(x, end=' ')\r\n x+=k\r\n \r\n while x<=t:\r\n print(x, end=' ')\r\n x+=k\r\nelse:\r\n print(-1)\r\n ", "Y, K, N = map(int, input().split())\n\nmod = Y % K\nstart = K - mod\nA = [str(x) for x in range(start, N - Y + 1, K)]\nprint(' '.join(A) if A else -1)", "import math\r\nykn = input().split()\r\ny = int(ykn[0])\r\nk = int(ykn[1])\r\nn = int(ykn[2])\r\nx = n//k\r\nmin = y//k + 1\r\nif x*k <= y:\r\n print(-1)\r\nelse:\r\n for i in range(min,x+1):\r\n print(k*i- y, end =' ' )\r\n\r\n\r\n", "y,k,n=[int(x) for x in input().split(' ')]\nx=k-y%k\nflag=0\nwhile(x+y <= n):\n\tprint(x)\n\tflag=1\n\tx+=k\nif not flag:\n\tprint(-1)", "# y, k, n = a[0], a[1], a[2]\r\ns = input()\r\na = []\r\na = s.split()\r\n\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\t\r\nb = []\r\ni = 1\r\nwhile a[1]*i <= a[2]:\r\n\tif (a[1]*i > a[0]):\r\n\t\tb.append(a[1]*i-a[0])\r\n\ti += 1\r\n\r\nif len(b) == 0:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(len(b)):\r\n\t\tprint(b[i], end = ' ')", "def twoPotatoes():\r\n y,k,n=map(int,input().split())\r\n i=1\r\n l=[]\r\n while k*i <= n:\r\n if k*i > y:\r\n break\r\n i=i+1\r\n while k*i <= n:\r\n l.append(k*i-y)\r\n i += 1\r\n if len(l)==0:\r\n print(-1)\r\n return\r\n else:\r\n print(*l)\r\n\r\ntwoPotatoes()\r\n", "y,k,n = map(int,input().split())\r\ntr=True\r\nfor i in range(k-y%k,n-y+1,k):\r\n print(i)\r\n tr=False\r\nif tr:\r\n print(-1)", "y, k, n = [int(j) for j in input().split()]\r\n\r\ndef pot(y, k, n):\r\n res = []\r\n mod = y % k\r\n start = y + (k - mod)\r\n\r\n while start <= n:\r\n res.append(start - y)\r\n start += k\r\n\r\n return res if len(res) else -1\r\n\r\nres = pot(y, k, n)\r\n\r\nif res == -1:\r\n print(-1)\r\nelse:\r\n print(' '.join([str(j) for j in res]))", "y,k,n=map(int,input().split())\r\nx=1\r\nc=0\r\ni=0\r\nwhile i+k<=n:\r\n\r\n i+=k\r\n if i-y>0:\r\n c=1\r\n print(i-y,end=\" \")\r\nif c==0:\r\n print(-1)", "import sys\r\ny,k,n = map(int, input().split())\r\n\r\nstart = k - y % k\r\nmaxi = n - y\r\nans = \"\"\r\nif start <= maxi:\r\n ans += str(start) + \" \"\r\n start += k\r\n while start <= maxi:\r\n ans += str(start) + \" \"\r\n start += k\r\n\r\nelse:\r\n print(\"-1\")\r\nprint(ans)", "y, k, n = map(int,input().split())\r\nx=k-y%k\r\nif x+y>n:\r\n print('-1')\r\nwhile x+y<=n:\r\n print(x)\r\n x+=k", "y,k,n=[int(e) for e in input().split()]\ng=''\nfor i in range(n//k+1):\n u=k*i-y\n if u>0:\n g+=str(u)+' '\nif len(g)==0:\n print('-1')\nelse:\n print(g)\n \n", "def potatoes_bags(y,k,n):\r\n s=' '.join(map(str,range(k-y%k,n-y+1,k)))\r\n return s if s else -1\r\n\r\n\r\n\r\ny,k,n=map(int,input().split())\r\nprint(potatoes_bags(y,k,n))", "y,k,n=map(int,input().split())\r\ns=''\r\nfor i in range(y//k +1, n//k +1):\r\n\ts+=str(k*i - y)+' '\r\nif(s==''):\r\n\tprint(-1)\r\nelse:\r\n\tprint(s)", "y, k, n = map(int, input().split())\r\nans = []\r\ntot = (y // k + 1) * k\r\nwhile tot <= n:\r\n ans.append(tot - y)\r\n tot += k\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n if ans[0] == 0:\r\n ans = ans[1:]\r\n print(\" \".join(map(str, ans)))\r\n", "from math import *\r\n\r\n\r\ndef main():\r\n y, k, n = map(int, input().split())\r\n z = k - y % k\r\n if y + z > n:\r\n print(-1)\r\n return\r\n arr = []\r\n x = k - y % k\r\n while x + y <= n:\r\n arr.append(x)\r\n x += k\r\n print(' '.join(map(str, arr)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "i = input().split()\r\ny,k,n = int(i[0]),int(i[1]),int(i[2])\r\nans = \"\"\r\nstart = k - y % k\r\nfor i in range(start,n-y+1,k):\r\n ans += str(i)+\" \"\r\nif len(ans) > 0:\r\n print(ans)\r\nelse:\r\n print(-1)", "def Two_Bags_of_Potatoes2():\r\n y,k,n = map(int , input().split())\r\n\r\n count = 1\r\n multiple = k * count #multiple is x+y candidate\r\n numPossible = []\r\n while multiple <= n:\r\n\r\n x = multiple - y\r\n if x >= 1:\r\n numPossible.append(x)\r\n count += 1\r\n multiple = k * count\r\n\r\n\r\n if len(numPossible) == 0:\r\n print(-1)\r\n else:\r\n print(' '.join(str(i) for i in numPossible))\r\n\r\n\r\n\r\n\r\n\r\nTwo_Bags_of_Potatoes2()", "'''input\r\n3 3\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom copy import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom array import array\r\nINF = 2147483647\r\nINF64 = 9223372036854775807\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n \r\ndef solve():\r\n\ty,k,n = getints()\r\n\tx = k*(y//k+1)\r\n\tx -= y\r\n\tans = []\r\n\tif x+y>n:\r\n\t print(-1)\r\n\t exit(0)\r\n\twhile x+y<=n:\r\n\t ans.append(x)\r\n\t x+=k\r\n\tprint(*ans)\r\n \r\nif __name__==\"__main__\":\r\n\tt = 1\r\n\tfor i in range(t):\r\n\t\tsolve()", "def solve(y,k,n):\n\ts=''\n\tfor sm in range(k,n+1,k):\n\t\tif sm >y:\n\t\t\ts+= str(sm-y) +' '\n\tif s=='':\n\t\treturn -1\n\treturn s.strip()\n\n\n\t\n\n\n\n\n\t\n\n\n\n\n\t\t\n\t\n\n#n=int(input())\nl3=input()\n\nl3=[int(x) for x in l3.split(' ')]\n\t\n\n\n\nprint(solve(l3[0],l3[1],l3[2]) )", "y,k,n = map(int,input().split())\r\nimpossible=True\r\nfor i in range(k-y%k,n-y+1,k):\r\n print(i)\r\n impossible=False\r\nif impossible:\r\n print(-1)", "import math\r\ny, k, n = map(int, input().split())\r\nx = k * math.ceil(y / k) - y\r\nif x == 0:\r\n x = k\r\ni = 0\r\nif y + x > n:\r\n print(-1)\r\nelse:\r\n while y + i * k + x <= n:\r\n print(i * k + x, end=' ')\r\n i += 1\r\n", "y, k, n = [int(i) for i in input().split()]\r\nfor i in range(y // k + 1, n // k + 1):\r\n print(k * i - y, end=' ')\r\nif y // k + 1 >= n // k + 1:\r\n print(-1)\r\n", "# import sys\r\n# input=sys.stdin.readline\r\nimport math\r\nimport bisect\r\n\r\n\r\n\r\ny,k,n=[int(i) for i in input().split(\" \")]\r\nd=n-y\r\na=(y//k)+1\r\nx=a*k-y\r\nif(x>d):\r\n print(-1)\r\nelse:\r\n ans=[i for i in range(x,d+1,k)]\r\n print(*ans)\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n", "y,k,n=map(int,input().split())\r\na=k-y%k\r\nc=0\r\nfor i in range(a,n-y+1,k):\r\n if i>=1:\r\n print(i,end=' ')\r\n c+=1\r\nif c==0:\r\n print(-1)\r\n", "y,k,n=map(int,input().split())\r\nf=1\r\nfor i in range(y+(k-y%k),n+1,k):\r\n print(i-y,end=\" \")\r\n f=0\r\nif(f):\r\n print(\"-1\")", "def solve():\n y, k, n = map(int, input().split())\n\n\n res = []\n \n\n start = y//k\n\n if (k*start)-y <=0: start+=1\n\n end = n//k\n\n if (k *end)-y > n: end-=1\n\n if start > end:\n print(-1)\n return\n \n\n for x in range(start, end+1):\n res.append((k*x)-y)\n print(*res)\n\n\n\nsolve()", "y,k,n=map(int,input().split())\r\nx=k-y%k\r\nmaxm=n-y\r\nl=[]\r\nif x<=maxm:\r\n while x<=maxm:\r\n l.append(x)\r\n x+=k\r\n print(*l)\r\nelse:\r\n print(-1)", "y,k,n=map(int,input().split())\r\nstart = y+(k-y%k)\r\nl=[]\r\nfor i in range(start,n+1,k):\r\n l.append(i)\r\n\r\nif len(l):\r\n for x in l :\r\n print(x-y,end=\" \")\r\n print()\r\nelse:\r\n print(-1)\r\n \r\n ", "y, k, n = map(int, input().split())\r\nran = False\r\nfor i in range(max(2,k), n+1, k):\r\n if i-y >= 1:\r\n print(i-y, end=\" \")\r\n ran = True\r\nif not ran:\r\n print(-1)\r\nelse:\r\n print()", "y, k, n = (map(int,input().strip().split()))\r\n\r\nval = n % k\r\n\r\nlist1 = []\r\n\r\nfor i in range(n - y - val, 0, -k):\r\n list1.append(i)\r\n\r\nif list1:\r\n list1.sort()\r\n for i in list1:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)", "y, k, n = list(map(int,input().strip().split()))\r\nans = []\r\ncur = y+(k-y%k)\r\nwhile cur <= n:\r\n if cur-y > 0:\r\n ans.append(cur - y)\r\n cur += k\r\nif ans:\r\n print(*ans)\r\nelse:\r\n print(-1)", "y,k,n=map(int,input().split())\r\nflag=False\r\nfor i in range(k-y%k, n-y+1, k):\r\n print(i,end=' ')\r\n flag=True\r\nif not flag:\r\n print(-1)", "y,k,n=list(map(int,input().split()))\r\nok=False\r\nfor i in range(k,n+1,k):\r\n if(y<i):\r\n print(i-y)\r\n ok=True\r\nif(not ok):\r\n print(-1)", "y, k, n = map(int, input().split())\r\nx = k - (y % k)\r\n\r\nif y + x > n:\r\n print(-1)\r\nelse:\r\n print(*range(x, n - y + 1, k))", "y,k,n=[int(i) for i in input().split()]\r\nx=k-(y%k)\r\nif x+y>n:\r\n print(-1)\r\nwhile x+y<=n:\r\n print(x,end=' ')\r\n x+=k", "from math import ceil\r\ny, k, n = map(int, input().split())\r\ndata = [i for i in range(k-y%k, n-y+1, k)]\r\nif data:\r\n for i in data:\r\n print(i, end=\" \")\r\nelse:\r\n print(-1)", "def solve():\r\n y, k, n = map(int, input().split())\r\n L = [xy - y for xy in range(0, n + 1, k) if xy > y]\r\n if L : print(' '.join(map(str, L)))\r\n else : print(-1)\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline()\r\nnumbers = input.split(' ')\r\n\r\ny = int(numbers[0])\r\nk = int(numbers[1])\r\nn = int(numbers[2])\r\n\r\ndivider = (int) (y / k)\r\n\r\nx = k * (divider + 1) - y\r\n\r\nif x + y > n:\r\n print(-1)\r\n exit(0)\r\n\r\nwhile (x + y) <= n:\r\n print(x, end=' ')\r\n x += k", "y,k,n=map(int, input().split())\nb=y//k\ne=n//k\nsw=1\nfor i in range(b, e+1):\n t = (k * i) - y\n if t > 0 and t < n:\n sw=0\n print(t, end=' ')\nif sw:\n print(-1,end='')\nprint()\n", "y, k, n = map(int, input().split())\r\n\r\nif y >= n:\r\n print(\"-1\")\r\nelse:\r\n p = k - (y % k)\r\n result = []\r\n for i in range(p, n - y + 1, k):\r\n result.append(str(i))\r\n if result:\r\n print(\" \".join(result))\r\n else:\r\n print(\"-1\")\r\n", "y,k,n = input().split()\ny = int(y)\nk = int(k)\nn = int(n)\nl = []\nt = k*int(n/k)\nx = t-y\nwhile(x>0):\n\tl.append(x)\n\tx-=k\nif(len(l) == 0):\n\tprint(-1,end = \"\")\nfor i in range(len(l)-1,-1,-1):\n\tprint(l[i],end = \" \")\nprint()", "y, k, n = map(int, input().split())\r\nif n <= y: print(-1)\r\nelse:\r\n if y % k == 0: x = [y+k]\r\n elif y % k > 0: x = [y+k-(y%k)]\r\n \r\n if x[-1] > n: print(-1)\r\n else:\r\n while x[-1] <= n: x += [x[-1] + k]\r\n for i in range(len(x)-1):\r\n print(x[i]-y, end = ' ')\r\n print()", "y,k,n=map(int,input().split())\r\nx=[str((k*l)-y) for l in range(1,(n//k)+1) if ((k*l)>y)]\r\nprint(\" \".join(x) if len(x)>0 else -1)", "y, k, n = map(int, input().split())\r\nnew = []\r\nif k > y:\r\n init = k\r\nelif k < y:\r\n init = (y//k+1)*k\r\nelse:\r\n init = y\r\nfor i in range(init, n+1, k):\r\n if i-y == 0:\r\n continue\r\n new.append(i-y)\r\nif len(new) == 0:\r\n print(-1)\r\nelse:\r\n print(*new)", "y,k,n=map(int,input().split())\r\nc = int(y // k) + 1\r\nif y>=n or c*k not in range(y,n+1):\r\n print(-1)\r\nelse:\r\n c=int(y//k)+1\r\n arr=[x-y for x in range(c*k,n+1,k)]\r\n print(*arr)", "\n[y,k,n] = list(map(int,input().split(' ')))\n\nr = y//k\ns = r*k - y\nif s<=0:\n s+=k\n\nif s > n - y:\n print(-1)\nelse:\n for i in range(s,n - y + 1, k):\n print(i , end=' ')\n print()\n\n\n\n\n \n\n\n\n\n\n ", "y, k, n = map(int, input().split())\r\ntemp = int(y / k)\r\ntemp += 1\r\ntemp = temp * k\r\n#print (temp)\r\nif temp > n:\r\n\tprint (-1)\r\nwhile temp <= n:\r\n\tprint (temp - y, end = ' ')\r\n\ttemp += k\r\nprint ()\r\n\r\n", "y, k, n = map(int, input().split())\n\ni = y//k*k+k\nif i > n:\n print(-1)\nelse:\n while i <= n:\n print(i-y, end=' ')\n i += k\n\n", "def solve():\r\n (Y, K, N) = map(int, input().split())\r\n\r\n i = 0\r\n i = Y//K\r\n out = []\r\n while True:\r\n T = (i+1)*K\r\n if not (T > Y and T <= N):\r\n break\r\n \r\n out.append(T-Y)\r\n i += 1\r\n \r\n if out == []:\r\n return [-1]\r\n return out\r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(*solve())", "y,k,n=map(int,input().split())\nans=[]\nqaq=-y\nwhile 1:\n if qaq>n-y:\n break\n if qaq>=1:\n ans.append(qaq)\n qaq+=k\nif len(ans)==0:\n print(-1)\nans=[str(i) for i in ans]\nprint(\" \".join(ans))\n \t \t \t\t \t \t \t \t\t \t\t \t", "y, k, n = map(int, input().split())\r\nx = k - y % k\r\ntop = n - y\r\n\r\nif x <= top:\r\n print(x, end='')\r\n x += k\r\n while x <= top:\r\n print(' ' + str(x), end='')\r\n x += k\r\n print()\r\nelse:\r\n print('-1')\r\n", "y,k,n = map(int,input().split())\r\na = (k-(y%k))%k\r\n#print(y%k)\r\n#print((k-(y%k)))\r\n#print((k-(y%k))%k)\r\nif a == 0:\r\n a += k\r\nflag = False\r\nwhile(a+y <= n):\r\n print(a,end = \" \")\r\n flag = True\r\n a += k\r\nif not flag:\r\n print(-1)\r\n", "# your code goes here\r\nimport math\r\ny,k,n = map(int,input().split())\r\nnumber = k*(int(y/k)+1) - y\r\nif number < n-y+1:\r\n\tfor i in range(number,n-y+1,k):\r\n\t\tprint(i,end=\" \")\r\nelse:\r\n\tprint(\"-1\")\r\n", "y,k,n=map(int,input().split())\r\nl=[x*k-y for x in range(1,n//k+1) if x*k>y]\r\nif len(l)>0:print(*l)\r\nelse:print(-1)", "# your code goes here\r\nimport math\r\ninputLine = input().split()\r\ny = int(inputLine[0])\r\nk = int(inputLine[1])\r\nn = int(inputLine[2])\r\n\r\nsumOfPotatoes = n - n%k\r\nx = sumOfPotatoes - y\r\nif x < 1:\r\n\tprint(-1)\r\nelse:\r\n\toutputArray = []\r\n\twhile x >= 1:\r\n\t\toutputArray.append(x)\r\n\t\tx -= k\r\n\tfor x in reversed(outputArray):\r\n\t\tprint(x , end = \" \")\r\n", "y,k,n=map(int,input().split())\r\nif n//k<=y//k:print(-1)\r\nelse:\r\n base_value=y//k*k+k-y;ans=[]\r\n for i in range(base_value,n-y+1,k):\r\n ans.append(i)\r\n print(*ans)\r\n", "def solve():\r\n y,k,n=map(int,input().split())\r\n l=[]\r\n rem=y%k\r\n div=y//k\r\n x=k-rem\r\n while x+y<=n:\r\n l.append(x)\r\n x+=k\r\n if len(l)==0 or (len(l)==1 and l[0]==0):\r\n print(-1)\r\n return\r\n print(*l)\r\n\r\n\r\n\r\nsolve()", "import math\r\ny, k, n = map(int, input().split())\r\nlit = list()\r\nfor i in range(math.ceil(y / k) * k, n + 1, k) :\r\n if((i-y)!=0):lit.append(str(i - y))\r\nprint(\"-1\" if len(lit)==0 else ' '.join(lit))\r\n", "y, k, n = map(int, input().split())\r\nsolution = []\r\nmin_quotient = (y+1)//k\r\nmax_quotient = n//k\r\nfor quotient in range(min_quotient, max_quotient + 1):\r\n x = quotient*k-y\r\n if x >= 1:\r\n solution.append(repr(x))\r\n\r\nif solution:\r\n print(' '.join(solution))\r\nelse:\r\n print(-1)\r\n", "y,k,n=map(int,input().split())\r\nx=(y//k+1)*k-y\r\nans=False\r\nfor x in range(x,n-y+1,k):\r\n print(x)\r\n ans=True\r\n\r\nif not ans:\r\n print(-1)\r\n", "y, k, n = [int(i) for i in input().split()]\r\n\r\nf = True\r\n\r\nfor i in range( (1+ y//k)*k -y,n-y+1,k):\r\n print(i, end = \" \")\r\n f = False\r\n \r\nif f:\r\n print(-1)", "y,k,n=list(map(int,input().split()))\r\ntemp=n//k\r\narr=[]\r\nt=temp\r\nfor i in range(1,temp+1):\r\n x=(k*i-y)\r\n if(x>0):\r\n arr.append(x)\r\n\r\nif(y>=n or len(arr)==0):\r\n print(-1)\r\nelse:\r\n for i in arr:\r\n print(i,end=\" \")\r\n\r\n print()\r\n", "y,k,n = map(int, input(). strip(). split())\r\narray = []\r\nbravo = []\r\nfor i in range(1,int(n/k)+1):\r\n array.append(k*i)\r\n\r\nfor num in array:\r\n if num - y >= 1:\r\n bravo.append(num-y)\r\n\r\nif len(bravo) == 0:\r\n print(-1)\r\nelse:\r\n print(*bravo)\r\n", "y, k, n = map(int, input().split())\r\nx = k-y\r\nr = 0\r\nf = True\r\nwhile x+y <= n:\r\n if 1 <= x:\r\n print(x, end=' ')\r\n f = False\r\n x += k\r\nif f: print(-1, end=' ')\r\nprint()", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return map(int, stdin.readline().split())\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n \r\nP = 1000000007\r\ndef main():\r\n y, k, n = In()\r\n arr = []\r\n for i in range(((y//k)+1)*k, n+1, k):\r\n arr.append(i-y)\r\n if len(arr):\r\n print(*arr)\r\n else:\r\n print(-1)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "y,k,n = map(int,input().split(' '))\n\nr = y % k\nnxt = k - (y % k)\n\nans = []\nfor i in range(y + nxt, n + 1, k):\n ans.append(str(i - y))\n\nif len(ans) == 0:\n print(-1)\nelse:\n print(' '.join(ans))\n\n", "def find_first_bag_potato_count():\r\n\tsecond_bag_count, diviser, max_total = map(int, input().split())\r\n\r\n\tfirst_total_value = second_bag_count+diviser - second_bag_count%diviser\r\n\tif first_total_value > max_total:\r\n\t\tprint(-1)\r\n\t\treturn\r\n\r\n\r\n\tfor number in range(first_total_value-second_bag_count, max_total-second_bag_count+1, diviser):\r\n\t\tprint(number, end=\" \")\r\n\r\n\r\nfind_first_bag_potato_count()", "from math import ceil\ny, k, n = (int(x) for x in input().split())\na = ceil(y / k)\nif y % k == 0:\n a += 1\nif a * k <= n:\n for j in range(a * k, n + 1, k):\n print(j - y, end=' ')\nelse:\n print(-1)\n", "y, k, n = map(int, input().split())\r\nprint(' '.join(map(str, range(y//k*k+k-y, n-y+1, k))) if n//k>y//k else -1)\r\n", "[y, k, n] = [int(x) for x in input().split()]\r\nif k > n:\r\n print(\"-1\")\r\nelse:\r\n ans = k\r\n c = -1\r\n while ans <= n:\r\n if ans - y >= 1:\r\n print(str(ans - y), end = ' ')\r\n c = 1\r\n ans += k\r\n if c == -1:\r\n print(c)\r\n ", "y,k,n =map(int,input().split())\r\n\r\nl=[]\r\nq = y//k\r\nrem = (q+1)*k-y\r\nx=rem\r\nwhile (x+y<=n):\r\n l.append(x)\r\n x+=k\r\ntry:\r\n p=l[0]\r\n for i in l:\r\n print(i,end=\" \")\r\nexcept Exception as e:\r\n print(-1)\r\n", "y,k,n=map(int,input().split())\r\nz=n//k\r\nif(n>y and k*z-y>0):\r\n l=[]\r\n for i in range(1,z+1):\r\n if(k*i-y>0):\r\n l.append((str(k*i-y)))\r\n print(' '.join(l))\r\nelse:\r\n print(-1)", "import math\n\ny,k,n = map(int,input().split())\nres = []\n\nstart = math.ceil((1+y)/k)\nend = math.floor(n/k)\nfor i in range(start,end+1):\n res.append(i*k-y)\n\nif len(res) == 0:\n print('-1')\nelse:\n for num in res:\n print(num,end=' ')\n", "y, k, n = map(int, input().split())\r\ns = n - y\r\nx = k - y % k\r\na = 0\r\nwhile x <= s:\r\n print(x, end = ' ')\r\n x = x + k\r\n a = 1\r\nif a == 0:\r\n print(-1)", "y,k,n=map(int,input().split())\r\nx=y%k\r\nx=k-x\r\nif x<=n-y:\r\n for i in range(x,n-y+1,k):\r\n print(i)\r\nelse:\r\n print(-1)", "y, k, n = map(int, input().split())\r\nsum = (y//k+1)*k\r\nif sum > n:\r\n\tprint(-1)\r\nelse:\r\n\twhile sum <= n:\r\n\t\tprint(sum-y, end=' ')\r\n\t\tsum += k", "import io\nimport os\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n\ndef main():\n y, k, n = map(int, input().split())\n x = k - (y % k)\n res = []\n while x+y <= n:\n res.append(x)\n x += k\n print(' '.join(map(str, res)) if res else -1)\n\n\nif __name__ == '__main__':\n main()\n", "y,k,n=list(map(int,input().split()))\r\nans=[]\r\nx=k-y%k\r\nif x+y>n:\r\n print(-1)\r\nwhile x+y<=n:\r\n print(x,end=' ')\r\n x+=k", "y,k,n = [int(x) for x in input().split()]\r\nx = k - (y %k)\r\nmx = n - y;\r\nif x<=mx:\r\n while x<=mx:\r\n print(x)\r\n x+=k\r\nelse:\r\n print(\"-1\")", "y,k,n = map(int,input().split())\nnoAnswer = False\nif(y%k==0):\n s=y+k\nelse:\n s=y+k-y%k\nwhile(s<=n):\n noAnswer=True\n print(s-y,end=\" \")\n s+=k\nif(not noAnswer):\n print(-1)", "def _input(): return map(int, input().split())\r\n\r\ny, k, n = _input()\r\nres= (y//k+1)*k-y\r\nif res + y > n: \r\n print(-1)\r\nelse:\r\n while res + y<=n:\r\n print(res, end = ' ')\r\n res+=k\r\n ", "y, k, n = map(int, input().split())\r\nm = 1\r\nflag = 0\r\nwhile(m<=n//k):\r\n if(k*m-y >= 1):\r\n flag = 1\r\n print(k*m-y, end=' ')\r\n m+=1\r\nif(flag == 0):\r\n print(-1)", "y, k, n = [int(i) for i in input().split()]\r\n\r\nt = k\r\nflag = False\r\nwhile k <= n:\r\n if k - y > 0:\r\n print(k - y, end = \" \")\r\n flag = True\r\n k += t\r\n\r\nif not flag:\r\n print(-1)\r\nprint()", "y, k, n = map(int, input().split())\r\ncnt = 0\r\nfor i in range(1, pow(10, 5)+1):\r\n if i*k > n:\r\n break\r\n if i*k-y <= 0:\r\n continue\r\n print(i*k-y, end=\" \")\r\n cnt += 1\r\nif cnt == 0:\r\n print(-1)", "y, k, n = list(map(int, input().split()))\r\nar = [k * x - y for x in range(y // k + 1, n // k + 1)]\r\nif len(ar) == 0: print(-1)\r\nelse: print(*ar)", "y,k,n=map(int,input().split())\r\na=[]\r\nfor i in range(k-y%k,n-y+1,k):\r\n a.append(i)\r\nif len(a)>0:\r\n print(*a)\r\nelse:\r\n print(-1)", "y,k,n = map(int, input().split())\r\n\r\nstart = y + k-(y%k)\r\nans = []\r\n\r\nfor num in range(start, n+1, k):\r\n ans.append(str(num-y))\r\n\r\nif ans:\r\n print(\" \".join(ans))\r\nelse:\r\n print(-1)", "y, k, n = map(int, input().split())\r\nx = k - y % k\r\nif x + y > n:\r\n print(-1)\r\nelse:\r\n while x + y <= n:\r\n print(x, end=' ')\r\n x += k\r\n", "y,k,n=map(int,input().split())\r\nif(y>=n):\r\n print(\"-1\")\r\nelse:\r\n s=set()\r\n e=[]\r\n x=k-(y%k)\r\n while(True):\r\n if((x+y)<=n):\r\n s.add(x)\r\n x=x+k\r\n else:\r\n break\r\n for ele in s:\r\n e.append(ele)\r\n e.sort()\r\n if(len(e)>0):\r\n print(*e)\r\n else:\r\n print(\"-1\")", "y,k,n=map(int,input().split())\r\nx=k-(y%k)\r\nif (x+y)>n:\r\n print(-1)\r\nelse:\r\n for i in range(x,n,k):\r\n if (i+y)>n:\r\n break\r\n print(i,end=\" \")\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\ndef main() : \r\n y,k,n = map(int,input().strip().split())\r\n test = True\r\n if n>y :\r\n for i in range(k-y%k,n-y+1,k):\r\n print(str(i)+' ')\r\n test = False\r\n \r\n if test :\r\n print(str(-1)) \r\n \r\nmain()", "y,k,n=map(int,input().split())\nprint(' '.join(map(str,range(y//k*k+k-y,n-y+1,k)))if n//k>y//k else-1)\n", "y,k,n = map(int,input().split())\r\ndef printNum(y,k,n):\r\n num = y//k\r\n num+=1\r\n num*=k\r\n t= False\r\n while(num<=n):\r\n t= True\r\n print(num-y,end=\" \")\r\n num+=k\r\n if(not t):\r\n print(-1)\r\n \r\n \r\nprintNum(y,k,n)", "y,k,n=map(int,input().split())\r\nt=k-(y%k)\r\nif n-y<t:\r\n print(-1)\r\nelse:\r\n s=0\r\n while y+t+s*k<=n:\r\n print(t+s*k,end=\" \")\r\n s+=1\r\n\r\n\r\n", "#\n\ny, k, n = map(int, input().split())\nx = k - y % k\ncount = 0\nwhile(x + y <= n):\n print(x, end=\" \")\n count += 1\n x += k\nif count == 0:\n print(\"-1\")\n", "y, k, n = map(int, input().split())\ntemp = int(y / k)\ntemp += 1\ntemp = temp * k\n#print (temp)\nif temp > n:\n\tprint (-1)\n\texit()\nwhile temp <= n:\n\tprint (temp - y, end = ' ')\n\ttemp += k\nprint ()\n", "y, k, n = map(int, input().split())\n\ni = y//k+1\nfound = False\nwhile True:\n m = k*i\n if m > n:\n break\n print(m-y, end=' ')\n i += 1\n found = True\n\nif not found:\n print(-1)\n", "import math\r\ny, k, n = list(map(int, input().strip().split()))\r\n\r\nx = k-y%k\r\n\r\nif x+y<=n:\r\n while x+y<=n:\r\n print(x, end= \" \")\r\n x+=k\r\nelse:\r\n print(-1)\r\n \r\n", "y,k,n = map(int,input().split())\r\nr = 0\r\nfst = k-(y%k)\r\nif y>=n:\r\n print(-1)\r\n exit()\r\n \r\nwhile fst+y <= n:\r\n print(fst,end=\" \")\r\n fst += k\r\n r = 1\r\nif r == 0:\r\n print(-1)", "ar = []\r\nfor i in input().split(' '):\r\n ar.append(int(i))\r\nres = []\r\ntemp = ar[0]//ar[1] + 1\r\ntemp = temp * ar[1]\r\nif temp > ar[2]:\r\n print(-1)\r\nelse:\r\n while temp <= ar[2]:\r\n res.append(temp-ar[0])\r\n temp = temp + ar[1]\r\n print(*res)\r\n", "import math\r\n\r\na,b,c=map(int,input().split())\r\nx=c-a\r\nr=a%b\r\ny=b-r\r\nsum=2\r\nl=[]\r\ncount=0\r\ns=' '\r\nif(y>x):\r\n print(-1)\r\n \r\nelse:\r\n while(y<=x):\r\n print(y,end=' ')\r\n y+=b\r\n print()\r\n \r\n", "\r\ny,k,n=list(map(int,input().split()))\r\nans=\"\"\r\nif n-y<=0: \r\n print(-1)\r\nelse:\r\n g=0\r\n for i in range(k-(y%k),n-y+1,k):\r\n print(i)\r\n g=1 \r\n if g==0:\r\n print(-1)", "a,b,c=map(int,input().split(' '))\r\ni=a//b+1\r\nif(i*b>c):\r\n print(-1)\r\n exit()\r\nwhile(i*b<=c):\r\n print(b*i-a)\r\n i+=1", "def findX(y, k, n):\r\n if y >= n: return [-1]\r\n res = []\r\n factor = k\r\n while factor <= n:\r\n if factor - y > 0: res.append(factor - y)\r\n factor += k\r\n return res if res else [-1]\r\n\r\nif __name__ == '__main__':\r\n y, k, n = map(int, input().split())\r\n ret = findX(y, k, n)\r\n print(*ret)\r\n", "y, k, n = [int(inp) for inp in input().split(\" \")]\r\nans = [i for i in range(n-y+1)[k-(y%k)::k]]\r\nprint(\"-1\", end=\"\") if len(ans) == 0 else [print(i, end=\" \") for i in ans]", "y,k,n=map(int,input().split())\r\nl=[]\r\nnum=1\r\nwhile((k*num)<=n):\r\n check=k*num\r\n if(check>y):\r\n nu=str(check-y)\r\n l.append(nu)\r\n\r\n num+=1\r\n \r\nif(len(l)==0):\r\n print(-1)\r\nelse:\r\n print(\" \".join(l))\r\n", "y, k, n = [int(x) for x in input().split()]\nx = k - (y % k)\nif x + y > n:\n print(-1)\nwhile x + y <= n:\n print(x, end=' ')\n x += k\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\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\ny , k , n = MAP()\r\n\r\nx = k\r\nd = [x]\r\nwhile x <= n:\r\n x+=k\r\n d.append(x)\r\n\r\n#print(x)\r\n#print(d)\r\nans = []\r\nfor i in d :\r\n if i > y and i <= n :\r\n z = i - y\r\n ans.append(z)\r\n\r\nif len(ans) == 0 :\r\n print('-1')\r\n exit(0)\r\n \r\nans.sort()\r\nprint(*ans)\r\n\r\n", "y, k, n = map(int, input().split())\r\nx = k - y\r\nl = []\r\nwhile((x + y) <= n):\r\n if(x >= 1):\r\n l.append(x)\r\n x += k \r\nif(l == []):\r\n print(-1)\r\nelse:\r\n print(*l)", "'''\r\nCreated on Apr 27, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\n'''\r\nCreated on Apr 27, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nimport sys\r\nf = sys.stdin\r\n# f = open(\"input.txt\", \"r\")\r\ny, k, n = map(int, f.readline().strip().split())\r\n\r\nif y >= n:\r\n first = -1\r\nelse:\r\n t = k\r\n while t <= y:\r\n t += k\r\n first = t-y\r\nif first == -1:\r\n print(-1)\r\nelse:\r\n if first+y > n:\r\n print(-1)\r\n else:\r\n res = []\r\n for i in range(first, n+1-y, k):\r\n res.append(i)\r\n print(*res)", "y,k,n=map(int,input().split())\r\nboo=False\r\nans=[]\r\nfor i in range(k,n+1,k):\r\n if i>y:\r\n ans.append(i-y)\r\n boo=True\r\nif boo:\r\n for i in ans:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)\r\n", "s=input().split(\" \")\nnum=[]\nfor i in s:\n num.append(int(i))\nans=''\nk=0\nwhile k <= num[2]:\n if k-num[0] > 0: #WA??? TENTA POR >= AQUI\n ans+=str(k-num[0])\n ans+=\" \"\n k+=num[1]\n\nif len(ans)== 0:\n print(-1)\nelse:\n print(ans[:-1])\n\n\t \t\t \t\t \t\t\t\t \t\t \t\t\t\t \t \t \t\t", "y, k, n = map(int,input().split())\r\ncount = 0\r\nx1 = (n // k) * k - y\r\nx2 = k - (y % k)\r\nwhile x2 <= x1:\r\n print(x2, end=\" \")\r\n x2 += k\r\n count = 1\r\nif count == 0:\r\n print(-1)\r\n", "y, k, n = map(int,input().split())\r\n\r\nflag = False\r\n\r\nx = k - (y%k)\r\n\r\nwhile x+y <= n:\r\n flag = True\r\n print(x, end=' ')\r\n x += k\r\n \r\nif not flag:\r\n print(-1)", "y,k,n = map(int,input().split())\r\n\r\nif n/k < 1 or n <= y:\r\n\tprint(-1)\r\n\texit()\r\nlim2 = n//k\r\nlim1 = y//k\r\nflag = 0\r\nfor i in range(lim1+1,lim2+1,1):\r\n\tflag = 1\r\n\tprint(k*(i)-y,end=\" \")\r\nif flag == 0:\r\n\tprint(-1)", "def main():\r\n y, k, n = map(int, input().split())\r\n ret = []\r\n for i in range(n // k + 1):\r\n x = k * i - y\r\n if x > 0 and y > 0:\r\n ret.append(x)\r\n\r\n return ' '.join(str(i) for i in ret) if ret else '-1'\r\n\r\nprint(main())", "def readInput():\n s = input().split()\n return list(map(int, s))\n\ndef solve(x,n,k):\n while x<= n:\n print(str(x), end= \" \")\n x+=k\n\ndef solution2(y,k,n):\n x = k - y % k\n n -= y\n if x>n:\n print(-1)\n else:\n solve(x,n,k)\n \na = readInput()\nsolution2(a[0],a[1],a[2])\n\n\n\t \t\t\t\t \t\t\t \t\t \t", "y, k, n = [int(i) for i in input().split()]\r\n\r\nbs = n - y\r\n\r\ndone = False\r\n\r\nfor i in range(y//k+1, n//k+1):\r\n x = i*k-y\r\n #if x>0:\r\n done = True\r\n print(x, end=' ')\r\n \r\nif not done:\r\n print(-1)\r\n", "y,k,n=list(map(int,input().split()))\r\nx=1\r\nfor i in range(k-y%k,n-y+1,k):\r\n x=0\r\n print(i,end=' ')\r\nif x:\r\n print(-1)", "y, k, n = map(int, input().split())\r\nfirst = 0\r\nif y%k:\r\n first = k-y%k\r\nelse:\r\n first = k\r\na = []\r\nfor i in range(first, n-y+1, k):\r\n a.append(i)\r\nif a:\r\n print(*a)\r\nelse:\r\n print(-1)", "y,k,n=[int(x) for x in input().split()]\r\nx=k-y%k\r\nupper=n-y\r\nif x<=upper:\r\n print(x,end=\" \")\r\n x+=k\r\n while(x<=upper):\r\n print(x,end=\" \")\r\n x+=k\r\nelse:\r\n print(\"-1\")\r\n", "y,k,n=map(int,input().split())\r\n\r\nt=(((y//k)+ 1)*k)-y\r\n\r\nif n<=y or t+y>n:\r\n print(-1)\r\nelse:\r\n for i in range(t,n-y+1,k):\r\n print(i,end=\" \")\r\n print()", "y, k, n = map(int, input().strip().split())\r\n\r\nr = n - y\r\nlis = []\r\nt = 0\r\nif y % k == 0:\r\n t = k\r\nelse:\r\n t = k - (y % k)\r\n\r\nwhile t+y <= n:\r\n lis.append(t)\r\n t += k\r\nif len(lis) == 0:\r\n print(\"-1\")\r\nelse:\r\n print(*lis)\r\n ", "\r\na = input().split()\r\ny = int(a[0])\r\nk = int(a[1])\r\nn = int(a[2])\r\n\r\nxl = []\r\nxf = -1\r\n\r\ndiv = n//k\r\nmul = div*k\r\nxmax = mul - y\r\n\r\nif xmax <1:\r\n print(-1)\r\nelse:\r\n xl.append(xmax)\r\n while True:\r\n xmax -= k\r\n if xmax<1:\r\n break\r\n xl.append(xmax)\r\n\r\n xl.sort()\r\n ans = \"\"\r\n for k in xl:\r\n ans+= str(k)+\" \"\r\n print(ans)", "y, k, n = [int(x) for x in input().split(' ')]\n\nres = \"\"\nfor i in range(k-y%k, n-y+1, k):\n\tres += str(i) + \" \"\n\nif res.strip() == \"\":\n\tprint(-1)\nelse:\n\tprint(res[:-1])", "y,k,n=[int(i) for i in input().split()]\r\n\r\ni=1\r\nl=[]\r\nfl=0\r\na=k\r\nwhile(a<=n):\r\n i+=1\r\n if(a>y):\r\n print(a-y,\" \",end=\"\")\r\n fl=1\r\n a=k*i\r\nif(fl==0):\r\n print(-1)\r\n ", "y,k,n=map(int,input().split(\" \"))\r\nl=[i*k-y for i in range(1,n//k+1) if i*k>y and i*k<=n]\r\nif len(l)==0:\r\n print(-1)\r\nelse:\r\n for i in l:\r\n print(i,end=\" \")", "y,k,n=map(int,input().split())\r\n\r\nif(((y//k)+1)*k>n):\r\n print(-1)\r\nelse:\r\n a=((y//k)+1)*k\r\n dif=a-y\r\n while(y+dif<=n):\r\n print(dif,end=\" \")\r\n dif+=k", "y, k, n = [int(x) for x in input().split()] \nb = False\n\nfor i in range(1,n + 1):\n if (i * k > n) :\n break\n else : \n\n x = i * k - y\n\n if x >= 1:\n b = True\n print (x,end = ' ' )\n\n\nif (b == False) :\n print (-1)\nelse :\n print()\n", "y, k, n = map(int, input().split())\n\ni = y//k*k+k\nfound = False\nwhile True:\n if i > n:\n break\n print(i-y, end=' ')\n found = True\n i += k\n\nif not found:\n print(-1)\n", "y,k,n=map(int,input().split())\nx=k-y%k\nmaxx=n-y\nif x<=maxx:\n while(x<=maxx):\n print(x,end=\" \")\n x+=k\n print()\nelse:\n print(-1)", "from collections import defaultdict\r\nfrom math import floor\r\ny,k,n=map(int,input().split())\r\nstart=k-y%k\r\nif(start+y>n):\r\n print(-1)\r\nelse:\r\n while(y+start<=n):\r\n print(start,end=' ')\r\n start+=k\r\n\r\n", "y,k,n=map(int,input().split())\r\nif (n-y)<=0:print(-1)\r\nelif n//k==y//k:\r\n if n%k:print(-1)\r\n else:print(n-y)\r\nelse:\r\n for i in range(k-(y%k),n-y+1,k):print(i,end=' ')\r\n", "y,k,n= map(int, input().split())\r\nx= k- y%k\r\nif x+y>n:\r\n print(-1)\r\nelse:\r\n print(*range(x, n-y+1, k))", "\r\ny, k, n = map(int, input().split())\r\n\r\nans = []\r\n\r\nfrom math import ceil\r\nx = (ceil(y / k) * k) - y\r\nif (x < 1):\r\n x += k\r\n\r\nwhile x + y <= n:\r\n ans.append(x)\r\n x += k\r\nif (not ans):\r\n print (-1)\r\nelse:\r\n print (' '.join([str(i) for i in ans]))" ]

[ "t=int(input())\r\nimport math\r\nan=[]\r\nep=10**-16\r\nfor _ in range (t):\r\n x,y=list(map(int,input().split()))\r\n if(x>0 and y>0):\r\n an.append(180*math.atan(abs(y)/((abs(x))+ep))/math.pi)\r\n elif(x<0 and y>0):\r\n an.append(180-180*math.atan(abs(y)/((abs(x))+ep))/math.pi)\r\n elif(x<0 and y<0):\r\n an.append(180+180*math.atan(abs(y)/((abs(x))+ep))/math.pi)\r\n elif(x>0 and y<0):\r\n an.append(360-180*math.atan(abs(y)/((abs(x))+ep))/math.pi)\r\n elif(x==0 and y>0):\r\n an.append(90.0)\r\n elif(x==0 and y<0):\r\n an.append(270.0)\r\n elif(x>0 and y==0):\r\n an.append(0.0)\r\n elif(x<0 and y==0):\r\n an.append(180.0)\r\n else:\r\n print(\"yah na shit\")\r\n\r\nan.sort()\r\n# print(an)\r\nan=[-360.0+an[-1]]+an\r\n# print(an)\r\ndif=[]\r\nfor i in range(t):\r\n dif.append(an[i+1]-an[i])\r\n\r\nprint(360.0-max(dif))\r\n\r\n", "import bisect\r\nimport collections\r\nimport math\r\nimport os\r\nimport sys\r\n\r\n\r\n# input = sys.stdin.buffer.readline\r\n\r\n# t = int(input())\r\n# n, m = map(int, input().split())\r\n# A = list(map(int, input().split()))\r\n# grid = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nn = int(input())\r\nangles = [math.degrees(math.atan2(*map(int, input().split()))) for _ in range(n)]\r\nangles.sort()\r\n\r\nret = angles[-1] - angles[0]\r\nfor i in range(1, n):\r\n ret = min(ret, 360 + angles[i-1] - angles[i])\r\nprint(ret)\r\n", "from math import *\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n deg = atan2(y, x)*180/pi\r\n if deg < 0:\r\n deg = 360+deg\r\n l.append(deg)\r\nl.sort()\r\nmx = l[0]+360-l[-1]\r\nfor i in range(1, n):\r\n mx = max(mx, l[i]-l[i-1])\r\nprint(360-mx)\r\n", "def angle(v):\n x, y = v\n return atan2(x, y)\n\ndef main(): \n n = int(input())\n import sys\n\n if n == 1:\n input()\n print(0)\n else:\n l = sorted(atan2(*(int(i)for i in line.split())) for line in sys.stdin)\n print(360 - 180 * max(max(j - i for i, j in zip(l[:-1], l[1:])), 2 *pi +l[0] - l[-1]) / pi)\n \nif __name__ == \"__main__\":\n from math import pi, atan2\n import doctest\n main()\n", "import fileinput,math\r\n\r\nlines = fileinput.input()\r\nmanneq = int(lines.readline().strip())\r\npos = list()\r\nfor _ in range(manneq):\r\n\tpos.append(tuple(int(x) for x in lines.readline().strip().split()))\r\nangles = list()\r\n\r\nfor i in range(manneq):\r\n\tangle = math.degrees(math.atan2(pos[i][1],pos[i][0]))\r\n\tif angle < 0:\r\n\t\tangle += 360\r\n\tangles.append(angle)\r\nangles.sort()\r\n\t\r\nmax_angle = 0\r\n\r\nfor i in range(manneq-1):\r\n\tmax_angle = max(max_angle, angles[i+1] - angles[i])\r\n\t\r\nmax_angle = max(max_angle,angles[0] + 360 - angles[-1])\r\nprint(360 - max_angle)", "import math\n\nn = int(input())\n\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append(math.degrees(math.atan2(y, x)))\na.sort()\na.append(a[0] + 360)\nmx = 0\nfor i in range(n):\n mx = max(mx, a[i + 1] - a[i])\nprint(360 - mx)# 1697839335.5317822", "def angle(x, y):\n if x == 0:\n if y > 0:\n return pi / 2\n else:\n return 3 * pi / 2\n elif x > 0:\n if y >= 0:\n return atan(y/x)\n else:\n return 2 * pi + atan(y/x)\n else:\n return pi + atan(y/x)\n\ndef main(): \n n = int(input())\n import sys\n\n if n == 1:\n input()\n print(0)\n else:\n l = sorted(angle(*(int(i) for i in line.split())) for line in sys.stdin)\n print(360 - 180 * max(max(j - i for i, j in zip(l[:-1], l[1:])), 2 *pi +l[0] - l[-1]) / pi)\n \nif __name__ == \"__main__\":\n from math import pi, atan\n import doctest\n main()\n", "import math\n\nn = int(input())\n\ncoors = [[int(item) for item in input().split(' ')] for i in range(n)]\n\n\ndef get_pos(item):\n (x, y) = item\n\n deg = math.degrees(math.atan(abs(math.inf if x == 0 else y / x)))\n\n if y < 0:\n if x >= 0:\n return 360 - deg\n else:\n return 180 + deg\n else:\n if x >= 0:\n return deg\n else:\n return 180 - deg\n\n\nangles = [get_pos(item) for item in coors]\n\nangles.sort()\n\nt = [angles[0] + 360 - angles[-1]]\n\nfor i in range(1, n):\n t.append(angles[i] - angles[i - 1])\n\nprint(360 - max(t))\n", "#!/usr/bin/python3\n\nimport math\n\nn = int(input())\npoints = [tuple(map(int, input().split())) for _ in range(n)]\nangles = sorted([math.atan2(x, y) for x, y in points])\nangles.append(angles[0] + 2 * math.pi)\nmax_angle = max([abs(a - b) for a, b in zip(angles[:-1], angles[1:])] + [])\nprint('%0.9f' % (180 * (2 * math.pi - max_angle) / math.pi))\n", "import math\r\n\r\nN = int(input())\r\nangles = []\r\nfor _ in range(N):\r\n x, y = map(int, input().split())\r\n angles.append(math.atan2(y, x))\r\n \r\nangles.sort()\r\n\r\nmax_angle = 0\r\n\r\nfor i in range(N):\r\n angle = abs(angles[i] - angles[(i+1)%N])\r\n if i == N-1:\r\n angle = 2*math.pi - angle\r\n max_angle = max(max_angle, angle)\r\n \r\nprint(360.0 - (max_angle * 180) / math.pi)", "from math import pi, atan2\n \nn = int(input())\n \nif n == 1:\n input()\n print(0)\nelse:\n l = sorted([atan2(*(int(x) for x in input().split())) for i in range(n)])\n print(360 - 180 * max(max(j - i for i, j in zip(l[:-1], l[1:])), 2 *pi +l[0] - l[-1]) / pi)\n", "import math\r\nn,a=int(input()),[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append(math.atan2(y,x)*180/math.pi)\r\na.sort()\r\nans=a[-1]-a[0]\r\nfor i in range(n-1):\r\n ans=min(ans,360-a[i+1]+a[i])\r\nprint(ans)\r\n", "import sys; input = sys.stdin.readline\r\nfrom math import atan2, degrees\r\n\r\nn = int(input())\r\nangles = sorted(degrees(atan2(*tuple(map(int, input().split())))) for _ in range(n))\r\n\r\nresult = 0\r\nfor i in range(n - 1):\r\n result = max(result, angles[i + 1] - angles[i])\r\nresult = max(result, 360 + angles[0] - angles[-1])\r\nprint(360 - result)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nfrom math import atan2, pi\r\nn = int(input())\r\na = [map(int, input().split()) for i in range(n)]\r\na = sorted(atan2(y, x) for x, y in a)\r\nd = [a[i + 1] - a[i] for i in range(n - 1)]\r\nd.append(2 * pi - a[n - 1] + a[0])\r\nprint(360 - 180 * max(d) / pi)\t\t \t\t\t\t \t", "from math import pi, atan2\r\n\r\nnumMannequins = int(input())\r\n\r\ncoordinates = []\r\nfor i in range(numMannequins):\r\n coordinates.append(map(int, input().split()))\r\n\r\ncoordinates = sorted(atan2(y, x) for x, y in coordinates)\r\n\r\ndistance = [(coordinates[i + 1] - coordinates[i]) for i in range(numMannequins - 1)]\r\ndistance.append(2 * pi - coordinates[numMannequins - 1] + coordinates[0])\r\n\r\nprint(360 - (180 * (max(distance) / pi)))", "import math\r\nn = int(input())\r\narr = []\r\npnts = list(tuple(map(int, input().split()) for _ in range(n)))\r\nfor x, y in pnts:\r\n arr.append (math.atan2(y, x) % (2*math.pi))\r\narr.sort()\r\n \r\nif abs(arr[0] - arr[-1]) < 1e-9:\r\n print (0)\r\n exit()\r\n\r\nres = 0\r\nfor i in range(n):\r\n res = max(res, arr[i] - arr[i-1])\r\nres = max(res, 2*math.pi - (arr[-1] - arr[0]))\r\nprint(360 - res / math.pi * 180)\r\n", "from sys import stdin\nimport math\n\nN = int(stdin.readline())\n\nangles = []\n\nfor n in range(N):\n x, y = map(int, stdin.readline().split())\n\n angles.append((math.atan2(y, x) + 2 * math.pi) % (2 * math.pi))\n\nangles.sort()\nangles.append(angles[0] + 2 * math.pi)\n\nmax_gap = max(angles[i] - angles[i - 1] for i in range(1, len(angles)))\nprint(360 - 180 * max_gap / math.pi)\n", "from math import *\r\nn = int(input())\r\npts = [ map(float,input().split()) for _ in range(n) ]\r\na = sorted([ atan2(y,x) for x,y in pts])\r\nd = [ a[i]-a[i-1] for i in range(1,len(a)) ]\r\nd.append( 2*pi+a[0]-a[-1] )\r\nprint(degrees(2*pi-max(d)))\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "import bisect\r\nimport collections\r\nimport math\r\nimport os\r\nimport sys\r\n\r\nn = int(input())\r\nangles = [math.degrees(math.atan2(*map(int, input().split()))) for _ in range(n)]\r\nangles.sort()\r\n \r\nret = angles[-1] - angles[0]\r\nfor i in range(1, n):\r\n ret = min(ret, 360 + angles[i-1] - angles[i])\r\nprint(ret)", "from math import asin, pi\r\n\r\ndef asinnew(x):\r\n return asin(x)*(180/pi)\r\n\r\nn=int(input())\r\nw, res=[], []\r\nfor j in range(n):\r\n x=[int(k) for k in input().split()]\r\n w.append(x)\r\n if x[0]>=0 and x[1]>=0:\r\n res.append(asinnew(x[1]/(x[0]**2+x[1]**2)**0.5))\r\n elif x[0]<0 and x[1]>=0:\r\n x[0]=-x[0]\r\n res.append(180-asinnew(x[1]/(x[0]**2+x[1]**2)**0.5))\r\n elif x[0]<0 and x[1]<0:\r\n x[0], x[1]=-x[0], -x[1]\r\n res.append(180+asinnew(x[1]/(x[0]**2+x[1]**2)**0.5))\r\n else:\r\n x[1]=-x[1]\r\n res.append(360-asinnew(x[1]/(x[0]**2+x[1]**2)**0.5))\r\nres.sort()\r\nc=[res[j]-res[j-1] for j in range(1, n)]\r\nc.append(360-max(res)+min(res))\r\nprint(360-max(c))\r\n#print(res)", "import math\r\ndef Q(x,y):\r\n if(x==0):\r\n if(y>0):\r\n return math.pi/2\r\n if(y<0):\r\n return (math.pi/2)*3\r\n #y=mx\r\n m=abs(y/x)\r\n theta=math.atan(m)\r\n if(y>=0 and x>=0):\r\n return theta\r\n if(y>=0 and x<=0):\r\n return math.pi-theta\r\n if(y<=0 and x<=0):\r\n return math.pi+theta\r\n else:\r\n return 2*math.pi-theta\r\n \r\n\r\nn=int(input())\r\nP=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n P.append(Q(x,y))\r\n\r\nP.sort()\r\nans=360\r\nfor i in range(1,n):\r\n ans=min(ans,(math.pi*2)-(P[i]-P[i-1]))\r\nans=min(ans,P[n-1]-P[0])\r\nprint((ans*360)/(2*math.pi))\r\n", "from math import atan2, pi\n\ndef solve():\n n = int(input().rstrip())\n angles = []\n for _ in range(n):\n a, b = map(int, input().rstrip().split())\n angles.append(atan2(b, a))\n angles.sort()\n maxangle = 2 * pi - (angles[n - 1] - angles[0])\n for i in range(n - 1):\n maxangle = max(angles[i + 1] - angles[i], maxangle)\n return 360 - maxangle * 180 / pi\n\nif __name__ == '__main__':\n print(solve())\n", "import sys\r\nfrom math import atan2, pi\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\ndef solve():\r\n\tn = mint()\r\n\tif n == 1:\r\n\t\tprint(0)\r\n\t\treturn\r\n\tp = [0]*n\r\n\tfor i in range(n):\r\n\t\tx, y = mints()\r\n\t\tp[i] = atan2(y, x)\r\n\tp.sort()\r\n\tp.append(p[0]+2*pi)\r\n\tr = 0\r\n\tfor i in range(n):\r\n\t\tr = max(r, p[i+1]-p[i])\r\n\tprint(360-r*180/pi)\r\n\r\nsolve()\r\n", "from math import atan2, degrees\r\n\r\n\r\nn = int(input())\r\narr = [ degrees(atan2(*list(map(int, input().split())))) for i in range(n)]\r\narr.sort()\r\nans = arr[-1] - arr[0]\r\nfor i in range(len(arr)-1):\r\n ans=min(ans,360-arr[i+1]+arr[i])\r\nprint(ans)", "import sys\ninput = sys.stdin.readline\nfrom math import atan2\nfrom math import pi\n\nn = int(input())\npos = []\nfor _ in range(n):\n x, y = map(int, input().split())\n pos.append(atan2(x, y))\nif n == 1:\n print(0)\nelse:\n pos.sort()\n best = pos[-1] - pos[0]\n for i in range(n - 1):\n best = min(best, 2*pi - (pos[i + 1] - pos[i]))\n print(best*180/pi)\n\n", "import math\r\n\r\nout = []\r\n\r\nfor i in range(int(input())):\r\n x, y = map(int,input().split())\r\n out.append(180 * (math.atan2(y,x) / math.pi))\r\n \r\nout.sort()\r\n\r\nres = out[-1] - out[0]\r\n\r\nfor i in range(len(out)-1):\r\n res = min(res, 360 - out[i+1] + out[i])\r\n \r\nprint(res)", "import math\r\ns=[]\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x==0:\r\n if y>0:\r\n s.append(90)\r\n else:\r\n s.append(-90)\r\n elif y==0:\r\n if x>0:\r\n s.append(0)\r\n else:\r\n s.append(180)\r\n else:\r\n if x<0 and y<0:\r\n s.append(180+math.degrees(math.atan(y/x)))\r\n elif y<0:\r\n s.append(-math.degrees(math.atan(-1*y/x)))\r\n elif x<0:\r\n s.append(180-math.degrees(math.atan(-1*y/x)))\r\n else:\r\n s.append(math.degrees(math.atan(y/x)))\r\ns.sort()\r\nm=abs(s[-1]-s[0])\r\nfor i in range (1,n):\r\n d=360-abs(s[i]-s[i-1])\r\n m=min(m,d)\r\nprint(m)", "from math import atan2\nfrom math import pi\nfrom math import degrees\n\nn = int(input())\nif n == 1:\n print(0)\n exit()\n\narr = []\nfor _ in range(n):\n x, y = map(int, input().split())\n arr.append(degrees(atan2(y, x)))\n\narr.sort()\narr.append(arr[0]+360)\n\nprint(360-max([arr[i+1] - arr[i] for i in range(n)]))\n", "import math\r\nt=0.0000000001\r\ndef angle_with_positive_x_axis(x,y):\r\n\tif(y==0):\r\n\t\tif(x>0):\r\n\t\t\treturn 0\r\n\t\telse:\r\n\t\t\treturn math.pi\r\n\telif(y>0):\r\n\t\treturn(math.acos((x)/abs(math.sqrt(x**2+y**2))))\r\n\telif(y<0):\r\n\t\treturn(2*math.pi-math.acos((x)/abs(math.sqrt(x**2+y**2))))\r\n\telse:\r\n\t\tprint('TNP')\r\ndef angle(x1,y1,x2,y2):\r\n\tif(x1*x2+y1*y2==0):\r\n\t\treturn 90\r\n\telse:\r\n\t\to1=angle_with_positive_x_axis(x1,y1)\r\n\t\to2=angle_with_positive_x_axis(x2,y2)\r\n\t\to=(abs(o1-o2)*(180))/math.pi\r\n\t\tif(o>=180):\r\n\t\t\treturn(360-o)\r\n\t\telse:\r\n\t\t\treturn(o)\r\n\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(list(map(int,input().split(' '))))\r\nangles=[]\r\nfor i in range(n):\r\n\tangles.append((angle_with_positive_x_axis(a[i][0],a[i][1])*180)/math.pi)\r\nangles.sort()\r\ndiff=[]\r\ndiff.append(angles[0]+(360-angles[-1]))\r\nfor i in range(n-1):\r\n\tdiff.append(angles[i+1]-angles[i])\r\nprint(360-max(diff)+t)\r\n", "from math import *\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n deg = atan2(y, x)*180/pi\r\n if deg < 0: deg = 360+deg\r\n l.append(deg)\r\nl.sort()\r\nmx = l[0]+360-l[-1]\r\nfor i in range(1,n):\r\n mx = max(mx,l[i]-l[i-1])\r\nprint(\"{:.15f}\".format(360-mx))", "import math\r\na=-400\r\nm=400\r\nn=int(input())\r\nang=[]\r\nfor _ in ' '*n:\r\n x,y=map(int,input().split())\r\n theta =(180*math.atan2(y, x)/math.pi)\r\n ang.append(theta)\r\nang.sort()\r\nans=ang[-1]-ang[0]\r\nfor i in range(n-1):\r\n ans=min(ans,360-(ang[i+1]-ang[i]))\r\nprint(ans)", "import sys, math\r\n\r\nn = int(sys.stdin.readline())\r\npoints = []\r\nfor i in range(n):\r\n [a, b] = list(map(int, sys.stdin.readline().split()))\r\n points.append(math.atan2(a,b))\r\npoints = sorted(points)\r\ndiffs = []\r\nfor i in range(n):\r\n if (i == n-1):\r\n diffs.append(points[0]-points[n-1] + 2 * math.pi)\r\n else:\r\n diffs.append(points[i+1]-points[i])\r\nprint(360-180*max(diffs)/math.pi)", "from sys import stdin\r\nimport math\r\n\r\nN = int(stdin.readline())\r\n\r\na = []\r\n\r\nfor n in range(N):\r\n x, y = map(int, stdin.readline().split())\r\n\r\n a.append((math.atan2(y, x) + 2 * math.pi) % (2 * math.pi))\r\n\r\na.sort()\r\na.append(a[0] + 2 * math.pi)\r\n\r\nmax_gap = max(a[i] - a[i - 1] for i in range(1, len(a)))\r\nprint(360 - 180 * max_gap / math.pi)", "import math\r\n\r\ndef angle(x,y):\r\n a = math.asin(y/math.sqrt(x*x+y*y))\r\n return a if x>=0 else math.pi-a\r\n\r\ndef solv(L,n):\r\n if n==1: return 0\r\n L.sort()\r\n maxd = max([L[i+1]-L[i] for i in range(n-1)])\r\n maxd = max(maxd, L[0]+(math.pi*2)-L[-1])\r\n return 180*((math.pi*2)-maxd)/math.pi\r\n\r\nn = int(input())\r\nL = [angle(*map(int,input().split())) for _ in range(n)]\r\nprint(solv(L,n))\r\n", "import math\r\nfrom math import atan2 as t\r\na=[]\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n a.append(180*t(y,x)/math.pi)\r\na.sort()\r\nans=a[-1]-a[0]\r\nfor i in range(len(a)-1):\r\n ans=min(ans,360-a[i+1]+a[i])\r\nprint(ans)", "from sys import stdin\r\nimport functools\r\nimport math\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\nn, = read()\r\na = [ ]\r\nfor i in range(n):\r\n x,y = read()\r\n a.append ( math.atan2(y,x)%(2*math.pi) )\r\na = sorted(a)\r\n\r\nif abs(a[0]-a[-1]) < 1e-9:\r\n print ( 0 )\r\n exit()\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans = max ( ans, a[i]-a[i-1] )\r\nans = max ( ans, 2*math.pi - (a[-1] - a[0]) )\r\n\r\nprint(360.0 - ans/math.pi*180.0)\r\n", "import math\nar=[]\nmanq=int(input())\nfor i in range(manq):\n\n coor = list(map(int, input().strip().split()))[:2]\n\n ang = math.atan2(coor[1],coor[0])*180/math.pi\n\n if ang<0:\n ang=360+ang\n ar.append(ang)\nar = sorted(ar)\n\nmax = ar[-1]-ar[0]\nfor u in range(len(ar)-1):\n max =min(max,360-ar[u+1]+ar[u])\nprint(\"{:.10f}\".format(max))\n\n\n \t \t \t \t\t \t\t \t \t\t \t \t\t", "import math\r\n\r\ndef angle(x, y):\r\n a = (x**2+y**2)**0.5\r\n x1, y1 = x/a, y/a\r\n my_angle = math.asin(y1)\r\n my_angle = 180*my_angle/math.pi\r\n if x < 0:\r\n my_angle = 180-my_angle\r\n if my_angle < 0:\r\n my_angle = 360+my_angle\r\n return my_angle\r\n \r\n\r\ndef process(M):\r\n angles = []\r\n for x, y in M:\r\n angles.append(angle(x, y))\r\n answer = max(angles)-min(angles)\r\n angles = sorted(angles)\r\n for i in range(len(angles)-1):\r\n a1 = angles[i]\r\n a2 = angles[i+1]\r\n answer = min(answer, 360-(a2-a1))\r\n return answer\r\n \r\n\r\nn = int(input())\r\nM = []\r\nfor i in range(n):\r\n x, y = [int(c) for c in input().split()]\r\n M.append([x, y])\r\nprint(process(M))", "from math import atan2, degrees, pi\n\ndef main():\n\tnum_man = int(input())\n\tangles = []\n\tfor n in range(num_man):\n\t\tx, y = input().strip().split(' ')\n\t\tx, y = int(x), int(y)\n\t\tangles.append(atan2(y, x))\n\tangles.sort()\n\tmax_diff = 0\n\tfor i in range(len(angles) - 1):\n\t\tmax_diff = max(max_diff, angles[i + 1] - angles[i])\n\tdiff = angles[0] - angles[num_man - 1]\n\tif diff < 1e-7:\n\t\tdiff += 360 * pi / 180\n\tmax_diff = max(max_diff, diff)\n\tres = 360 - (max_diff * 180 / pi)\n\tprint(res)\n\nmain()", "import math\r\n\r\nn, max_diff = int(input()), 0\r\nvalues = [[int(i) for i in input().split()] for j in range(n)]\r\nvalues = sorted([math.atan2(values[i][1], values[i][0]) for i in range(n)])\r\nfor i in range(n - 1):\r\n max_diff = max(max_diff, values[i + 1] - values[i])\r\nmax_diff = max(max_diff, 2 * math.pi - (values[-1] - values[0]))\r\nprint(360 - max_diff * 180 / math.pi)\r\n", "import math\r\nn = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nmat =[]\r\n\r\nfor i in range(n):\r\n if a[i][1]==0 and a[i][0] > 0:\r\n mat.append(0)\r\n if a[i][0]==0 and a[i][1] > 0:\r\n mat.append(90)\r\n if a[i][1]==0 and a[i][0] < 0:\r\n mat.append(180)\r\n if a[i][0]==0 and a[i][1] < 0:\r\n mat.append(270)\r\n\r\n if a[i][0] > 0 and a[i][1] > 0:\r\n k = a[i][1] / a[i][0]\r\n k = math.atan(k)\r\n k = math.degrees(k)\r\n mat.append(k)\r\n \r\n if a[i][0] > 0 and a[i][1] < 0:\r\n k = a[i][1] / a[i][0]\r\n k = math.atan(k)\r\n k = math.degrees(k)\r\n k = 360 + k\r\n mat.append(k)\r\n\r\n if a[i][0] < 0 and a[i][1] > 0:\r\n k = a[i][1] / a[i][0]\r\n k = math.atan(k)\r\n k = math.degrees(k)\r\n k = 180 + k\r\n mat.append(k)\r\n\r\n if a[i][0] < 0 and a[i][1] < 0:\r\n k = a[i][1] / a[i][0]\r\n k = math.atan(k)\r\n k = math.degrees(k)\r\n k = 180 + k\r\n mat.append(k)\r\n\r\n \r\n\r\nans = []\r\nmat.sort()\r\n\r\nfor i in range(n-1):\r\n x = mat[i+1] - mat[i]\r\n ans.append(x)\r\n\r\nx = mat[0] + (360 - mat[-1])\r\nans.append(x)\r\n\r\notv = 360 - max(ans)\r\n\r\n\r\nprint(otv)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 = []\r\nb = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(sorted(list(set(s))))\r\n b.append(len(s))\r\nv = 0\r\nfor i in range(97,97+25):\r\n for j in range(98,97+26):\r\n u = 0\r\n for k in range(n):\r\n for c in a[k]:\r\n if ord(c) != i and ord(c) != j:\r\n break\r\n else:\r\n u += b[k]\r\n v = max(u, v)\r\nprint(v)\r\n", "n = int(input())\r\nwords = [input().strip() for _ in range(n)]\r\n\r\nmax_length = 0\r\n\r\nfor char1 in 'abcdefghijklmnopqrstuvwxyz':\r\n for char2 in 'abcdefghijklmnopqrstuvwxyz':\r\n current_length = 0\r\n for word in words:\r\n valid = True\r\n for letter in word:\r\n if letter != char1 and letter != char2:\r\n valid = False\r\n break\r\n if valid:\r\n current_length += len(word)\r\n max_length = max(max_length, current_length)\r\n\r\nprint(max_length)\r\n", "n = int(input())\nw = []\nfor i in range(n):\n wd = input()\n w.append(wd)\n\nlength = 0\nfor i in range(26):\n for j in range(i+1, 26):\n c1, c2 = chr(i+97), chr(j+97)\n total_len = 0\n for wd in w:\n v = True\n for ch in wd:\n if ch != c1 and ch != c2:\n v = False\n break\n if v:\n total_len += len(wd)\n length = max(length, total_len)\n\nprint(length)\n\n\t\t \t \t\t \t\t \t \t\t \t \t \t \t", "def valid(w,a,b):\r\n for i in w:\r\n if i not in [a,b]:\r\n return False\r\n return True\r\nn=int(input())\r\nwords=[]\r\nfor i in range(n):\r\n s=input()\r\n words.append(s)\r\nmaxi=0\r\nfor i in range(26):\r\n for j in range(26):\r\n a,b=chr(97+i),chr(97+j)\r\n cur=0\r\n for w in words:\r\n if valid(w,a,b):\r\n cur+=len(w)\r\n if cur>maxi:\r\n maxi=cur\r\n \r\nprint(maxi) ", "# import sys\r\n# sys.stdin = open(\"cf593a.in\")\r\n\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\nn = int(input())\r\nwords = [input().strip() for _ in range(n)]\r\nwords = [(word, set(word)) for word in words]\r\nwords = [(word, s) for word, s in words if len(s) <= 2]\r\n\r\nbest = 0\r\nfor c1 in alphabet:\r\n\tfor c2 in alphabet:\r\n\t\tshere = set([c1, c2])\r\n\t\tbest = max(best, sum(len(word) for word, s in words if not (s - shere)))\r\n\r\nprint(best)", "dc, ma, ones = dict(), 0, []\r\n\r\nfor _ in range(int(input())):\r\n word = input()\r\n s = set(list(word))\r\n if len(s) <= 2:\r\n L = list(s)\r\n L.sort()\r\n k = ''.join(L)\r\n if k in dc:\r\n dc[k] += len(word)\r\n else:\r\n dc[k] = len(word)\r\n\r\nfor k, v in dc.items():\r\n if len(k) == 2:\r\n tmp = v\r\n if k[0] in dc: tmp += dc[k[0]]\r\n if k[1] in dc: tmp += dc[k[1]]\r\n ma = max(ma, tmp)\r\n else:\r\n ones.append(v)\r\n\r\nones.sort(reverse=True)\r\nprint(max(ma, sum(ones[0:2])))", "n = int(input())\r\nletters = 'qwertyuiopasdfghjklzxcvbnm'\r\nwords=[]\r\nfor i in range (n):\r\n words += [input()]\r\n\r\nmaxL=0\r\nfor i in range (25):\r\n for j in range (i+1, 26):\r\n letter1 = letters[i]\r\n letter2 = letters[j]\r\n currentL=0\r\n for word in words:\r\n good=True\r\n for letter in word:\r\n if letter!=letter1 and letter!=letter2:\r\n good=False\r\n if good:\r\n currentL += len(word)\r\n if currentL > maxL:\r\n maxL = currentL\r\nprint(maxL)\r\n", "n=int(input())\r\nword=[]\r\nval=[]\r\nalpha=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\r\nfor i in range(n):\r\n a=input()\r\n if len(set(a))>2:\r\n pass\r\n else:\r\n word.append(set(a))\r\n val.append(len(a))\r\nm=0\r\nfor i in alpha:\r\n for j in alpha:\r\n s=0\r\n for k in range(len(word)):\r\n if word[k].issubset({i,j}):\r\n s+=val[k]\r\n m=max(m,s)\r\nprint(m)", "n = int(input())\r\nstrings = []\r\nfor i in range(n):\r\n strings.append(input())\r\n\r\ndata = [[] for i in range(n)]\r\n\r\n\r\nfor i in range(n):\r\n data[i].append(len(strings[i]))\r\n data[i].append('')\r\n for j in range(len(strings[i])):\r\n if strings[i][j] not in data[i][1]:\r\n data[i][1] += strings[i][j]\r\n data[i][1] = ''.join(sorted(data[i][1]))\r\n\r\nalph = 'abcdefghijklmnopqrstuvwxyz'\r\nmax_summ = 0\r\nfor i in range(len(alph)-1):\r\n for j in range(i+1, len(alph)):\r\n summ = 0\r\n for c in range(n):\r\n #print(summ, data[c])\r\n if (data[c][1] == alph[i] or data[c][1] == alph[j]\r\n or data[c][1] == alph[i] + alph[j]):\r\n summ += data[c][0]\r\n if summ > max_summ:\r\n max_summ = summ\r\nprint(max_summ)\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\tx = input()\r\n\tif len(set(x)) < 3:\r\n\t\ta.append(x)\r\nmx = 0\r\nfor i in range(26):\r\n\tfor j in range(26):\r\n\t\tx = 0\r\n\t\tfor k in a:\r\n\t\t\tif k.count(chr(ord('a') + i)) + k.count(chr(ord('a') + j)) == len(k):\r\n\t\t\t\tx += len(k)\r\n\t\tmx = max(mx, x)\r\nprint(mx)\r\n", "n = int(input())\nwords = []\nfor i in range(n):\n word = input()\n words.append(word)\n\nlength = 0\nfor i in range(26):\n for j in range(i+1, 26):\n char1, char2 = chr(i+97), chr(j+97)\n total_len = 0\n for word in words:\n valid = True\n for ch in word:\n if ch != char1 and ch != char2:\n valid = False\n break\n if valid:\n total_len += len(word)\n length = max(length, total_len)\n\nprint(length)\n", "n = int(input())\n\nwords = [input() for i in range(n)]\nmaxL = 0\nfor c1 in range(26):\n for c2 in range(c1 + 1, 26):\n letter1 = chr(c1 + ord('a'))\n letter2 = chr(c2 + ord('a'))\n count = 0\n for word in words:\n if set(word) <= {letter1, letter2}:\n count += len(word)\n maxL = max(maxL, count)\n \nprint(maxL)\n \t\t \t\t \t \t\t \t\t\t \t \t\t \t \t\t \t", "alpha=[[0]*26 for _ in range(26)]\r\nfor _ in range(int(input())):\r\n s=input()\r\n st=set(s)\r\n if len(st)==1:\r\n m=ord(st.pop())-ord('a')\r\n for i in range(26):\r\n alpha[m][i]+=len(s)\r\n alpha[i][m]+=len(s)\r\n alpha[m][m]-=len(s)\r\n elif len(st)==2:\r\n m=ord(st.pop())-ord('a')\r\n n=ord(st.pop())-ord('a')\r\n alpha[m][n]+=len(s)\r\n alpha[n][m]+=len(s)\r\nprint(max([max(alpha[i]) for i in range(26)]))", "t=int(input())\nl=[input() for i in range(t)]\nc=0\nfor i in range(26):\n for j in range(i+1,26):\n a1 = chr(i + ord('a'))\n a2 = chr(j + ord('a'))\n k=0\n for x in l:\n if set(x)<={a1,a2}:\n k+=len(x)\n c=max(k,c)\nprint(c)\n \t \t \t\t\t \t\t\t\t \t\t \t \t\t", "s = 'abcdefghijklmnopqrstuvwxyz'\r\nlenth = 0\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n a = input()\r\n lenth += len(a)\r\n l.append(a)\r\nmaxes = [lenth for i in range(26 * 26)]\r\nfor l1 in s:\r\n for l2 in s:\r\n if l1 == l2:\r\n i = s.index(l1)\r\n maxes[i * 26 + i] = 0\r\n continue\r\n for i in range(n):\r\n bad = 0\r\n for let in l[i]:\r\n #print(let, l1, l2)\r\n \r\n \r\n if let != l1 and let != l2:\r\n bad = 1\r\n if bad:\r\n maxes[26 * s.index(l1) + s.index(l2)] -= len(l[i])\r\n \r\nprint(max(maxes))", "a2 = [[0 for i in range(26)] for i in range(26)]\r\na1 = [0 for i in range(26)]\r\nmx = 0\r\nn = int(input())\r\ns_l = set()\r\nfor i in range(n):\r\n string = input()\r\n for i in range(len(string)):\r\n s_l.add(string[i])\r\n if len(s_l) == 2:\r\n s_ll = list(s_l)\r\n a2[ord(s_ll[0])-97][ord(s_ll[1])-97] += len(string)\r\n a2[ord(s_ll[1])-97][ord(s_ll[0])-97] += len(string)\r\n elif len(s_l) == 1:\r\n s_ll = list(s_l)\r\n a1[ord(s_ll[0])-97] += len(string)\r\n s_l = set()\r\nfor i in range(26):\r\n for j in range(i+1,26):\r\n if a2[i][j]+a1[i]+a1[j] > mx:\r\n mx = a2[i][j]+a1[i]+a1[j]\r\nprint(mx)\r\n\r\n\r\n \r\n", "n=int(input())\r\nt=[[0 for i in range(26)] for j in range(26)]\r\nfor i in range(n):\r\n\ts=input()\r\n\tg=[0 for j in range(26)]\r\n\tfor j in s:\r\n\t\tg[ord(j)-ord('a')]+=1\r\n\tnb=0\r\n\tfor j in g:\r\n\t\tif j>0:nb+=1\r\n\tif nb==1:\r\n\t\tl=0\r\n\t\tfor j in range(26):\r\n\t\t\tif g[j]>0:l=j\r\n\t\tfor j in range(26):\r\n\t\t\tif l!=j:\r\n\t\t\t\tt[l][j]+=len(s)\r\n\t\t\t\tt[j][l]+=len(s)\r\n\telif nb==2:\r\n\t\tl1=-1\r\n\t\tl2=-1\r\n\t\tfor j in range(26):\r\n\t\t\tif g[j]>0:\r\n\t\t\t\tif l1==-1:l1=j\r\n\t\t\t\telse:l2=j\r\n\t\tt[l1][l2]+=len(s)\r\n\t\tt[l2][l1]+=len(s)\r\nnb=0\r\nfor i in range(26):\r\n\tfor j in range(26):\r\n\t\tnb=max(t[i][j],nb)\r\nprint(nb)", "words=[]\nn=int(input().strip())\nfor i in range(n):\n words.append(input().strip())\n \nlet=[chr(i) for i in range(ord('a'),ord('z')+1)]\nmax_tot_len=0\nfor i in range(len(let)):\n for j in range(i+1,len(let)):\n a=let[i]\n b=let[j]\n tot_len=0\n for w in words:\n if all([c in [a,b] for c in w]):\n tot_len+=len(w)\n if tot_len>max_tot_len:\n max_tot_len=tot_len\nprint(max_tot_len)\n", "orda = ord('a')\r\ncounts = {}\r\nfor a in range(26):\r\n for b in range(a):\r\n counts[(b, a)] = 0\r\n\r\ndef process_word(word):\r\n letters = {}\r\n for ch in word:\r\n if ch in letters:\r\n letters[ch] += 1\r\n else:\r\n letters[ch] = 1\r\n if len(letters) > 2:\r\n return\r\n k = [ord(c)-orda for c in letters.keys()]\r\n if len(k) == 2:\r\n counts[( min(k), max(k) )] += sum(letters.values())\r\n else:\r\n for i in range(26):\r\n if i == k[0]: continue\r\n l = [k[0], i]\r\n counts[( min(l), max(l) )] += sum(letters.values())\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n process_word(input())\r\n\r\nm = 0;\r\nfor v in counts.values():\r\n m = max(m, v)\r\n \r\nprint (m)\r\n", "# week 1 \r\n# 2 CHAR\r\n\r\nstring = [input() for _ in range(int(input()))]\r\nalphabets = 'abcdefghijklmnopqrstuvwxyz'\r\nmaximum = 0\r\nfor c in alphabets:\r\n for c1 in alphabets:\r\n s = 0\r\n for w in string:\r\n if set([i for i in w]) <= {c, c1}:\r\n s += len(w)\r\n maximum = max(maximum, s)\r\nprint(maximum)", "t = int(input())\nw = [input() for i in range(t)]\nl = 0\nfor i in range(26):\n for j in range(i+1, 26):\n a1 = chr(i + ord('a'))\n a2 = chr(j + ord('a'))\n j = 0\n for k in w:\n if set(k) <= {a1, a2}: j += len(k)\n l = max(j, l)\nprint(l)\n \t\t\t\t\t \t\t\t\t \t \t \t\t\t \t\t \t\t", "n = int(input())\nw = []\nfor i in range(n):\n z= input()\n w.append(z)\nleng = 0\nfor i in range(26):\n for j in range(i+1, 26):\n c1, c2 = chr(i+97), chr(j+97)\n total_len = 0\n for word in w:\n v = True\n for ch in word:\n if ch != c1 and ch != c2:\n v = False\n break\n if v:\n total_len += len(word)\n leng = max(leng, total_len)\n\nprint(leng)\n\n\t\t \t \t \t \t\t\t\t \t\t \t \t\t\t", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\nfrom itertools import combinations\r\n\r\nn = int(input())\r\nlines = [input() for i in range(0,n)]\r\nans = 0\r\n\r\nfor a,b in combinations([chr(i) for i in range(ord('a'),ord('z')+1)], 2):\r\n hoge = 0\r\n for l in lines:\r\n sets = set(l)\r\n if len(sets) > 2 or (a not in sets and b not in sets): continue\r\n if len(sets) == 2 and not (a in sets and b in sets): continue\r\n hoge += len(l)\r\n ans = max(ans, hoge)\r\nprint(ans)\r\n \r\n \r\n", "z=input\r\nr=range\r\nd=[s for s in (z() for _ in r(int(z()))) if len(set(s))<=2]\r\nprint(max((sum(len(s) for s in d if set(s)<={chr(i),chr(j)}) for i in r(97,123) for j in r(i,123))))", "n = int(input())\r\nwords = [input() for _ in range(n)]\r\n\r\nmax_count = 0\r\n\r\n# iterate over all possible pairs of distinct characters\r\nfor i in range(26):\r\n for j in range(i + 1, 26):\r\n count = 0\r\n for word in words:\r\n # check if word is composed only of the two characters\r\n if all(ch in [chr(i + ord('a')), chr(j + ord('a'))] for ch in word):\r\n count += len(word)\r\n # update max_count if current pair of characters gives more distinct characters\r\n max_count = max(max_count, count)\r\n\r\nprint(max_count)\r\n", "from string import ascii_lowercase as lower\nimport re\n\nn = int(input())\nwords = [input() for _ in range(n)]\n\ncur_max = -1\nfor first in lower:\n\tfor second in lower:\n\t\tif second >= first:\n\t\t\tbreak\n\t\tregex = '^[%s%s]+$' % (first, second)\n\t\tcount = 0\n\t\tfor word in words:\n\t\t\tif re.match(regex, word):\n\t\t\t\tcount += len(word)\n\t\tcur_max = max(cur_max, count)\nprint(cur_max)\n", "z=int(input())\r\nmatrix=[]\r\nfor i in range(26):matrix+=[[0]*26]\r\nfor i in range(z):\r\n x=input()\r\n y=list(set(x))\r\n lenght=len(y)\r\n if lenght>2:continue\r\n elif lenght==1:matrix[ord(y[0])-97][ord(y[0])-97]+=len(x)\r\n else:\r\n matrix[ord(y[0])-97][ord(y[1])-97]+=len(x)\r\n matrix[ord(y[1])-97][ord(y[0])-97]+=len(x)\r\nans=0\r\nfor i in range(26):\r\n for j in range(26):\r\n if i!=j:\r\n ans=max(ans,matrix[i][i]+matrix[j][j]+matrix[i][j])\r\nprint(ans)", "n = int(input())\nwords = [input() for i in range(n)]\n\nmax_length = 0\nfor c1 in range(26):\n for c2 in range(c1 + 1, 26):\n letter1 = chr(c1 + ord('a'))\n letter2 = chr(c2 + ord('a'))\n count = 0\n for word in words:\n if set(word) <= {letter1, letter2}:\n count += len(word)\n max_length = max(max_length, count)\n\nprint(max_length)\n\n \t \t\t \t \t \t \t\t\t\t\t", "# word, article = [], []\n# length = 0\n# for i in range(int(input())):\n# temp = input(\"\")\n# if (len(set(temp)) <= 2): word.append(temp)\n# while (len(article) < 1): \n# for j in temp: \n# if j not in article: \n# article.append(j)\n# print(article)\n# for i in word:\n# for j in i:\n# if (j not in article):\n# word.remove(i)\n# break\n# for i in word: length += len(i)\n# print(length)\n\nt = int(input())\nword = [input() for i in range(t)]\nlength = 0\nfor i in range(26):\n for j in range(i+1, 26):\n a1 = chr(i + ord('a'))\n a2 = chr(j + ord('a'))\n j = 0\n for k in word:\n if set(k) <= {a1, a2}: j += len(k)\n length = max(j, length)\nprint(length)\n\t\t\t\t\t \t \t \t\t\t \t\t\t\t \t\t \t\t\t", "n = int(input())\r\nwords = []\r\nfor i in range(n):\r\n\tword = input()\r\n\tcnt_letters = len(set(word))\r\n\tif cnt_letters > 2:\r\n\t\tcontinue\r\n\twords.append(word.lower())\r\n\r\nres = 0\r\nfor i in range(26):\r\n\tfor j in range(i+1,26):\r\n\t\ttmp = 0\r\n\t\tfor w in words:\r\n\t\t\tif chr(i+97) in w and chr(j+97) in w:\r\n\t\t\t\ttmp += len(w)\r\n\t\t\tif chr(i+97) in w and len(set(w)) == 1:\r\n\t\t\t\ttmp += len(w)\r\n\t\t\tif chr(j+97) in w and len(set(w)) == 1:\r\n\t\t\t\ttmp += len(w)\r\n\t\tres = max(res, tmp)\r\n\r\nprint(res)\r\n", "n = int(input())\nwords = [input() for i in range(n)]\n\nmax_len = 0\nfor i in range(26):\n for j in range(i+1, 26):\n letters = set([chr(i+ord('a')), chr(j+ord('a'))])\n length = sum([len(w) for w in words if set(w).issubset(letters)])\n max_len = max(max_len, length)\n\nprint(max_len)\n\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\ndef main():\n c = [[0]*30 for i in range(30)]\n n = int(input())\n for i in range(n):\n a = input().strip()\n l = len(a)\n s = set(a)\n if len(s) == 2:\n x, y = sorted(s)\n x = ord(x) - ord('a')\n y = ord(y) - ord('a')\n c[x][y] += l\n c[y][x] += l\n elif len(s) == 1:\n x = ord(a[0]) - ord('a')\n for k in range(26):\n c[x][k] += l\n if k != x:\n c[k][x] += l\n mx = 0\n for i in range(26):\n for j in range(26):\n mx = max(c[i][j], mx)\n print(mx)\n\nmain()\n\t\t \t \t\t \t \t\t \t \t\t \t\t \t \t\t\t", "n = int(input())\r\nc = [[0] * 26 for i in range(26)]\r\nfor w in range(n):\r\n word = input()\r\n wset = list(set(word))\r\n wset[0] = ord(wset[0]) - ord('a')\r\n if len(wset) > 1:\r\n wset[1] = ord(wset[1]) - ord('a')\r\n if len(wset) == 2:\r\n c[wset[0]][wset[1]] += len(word)\r\n c[wset[1]][wset[0]] += len(word)\r\n if len(wset) == 1:\r\n for i in range(26):\r\n c[i][wset[0]] += len(word)\r\n c[wset[0]][i] += len(word)\r\n c[wset[0]][wset[0]] -= len(word)\r\nprint(max([max(c[i]) for i in range(26)])) \r\n ", "import string\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nans = 0\r\nsmall = string.ascii_lowercase\r\nfor i in small:\r\n for j in small:\r\n tmp = 0\r\n for s in a:\r\n cnt = 0\r\n for c in s:\r\n if c == i or c == j:\r\n cnt += 1\r\n if cnt == len(s):\r\n tmp += len(s)\r\n ans = max(ans, tmp)\r\nprint(ans)\r\n", "import math\n\n\ndef main():\n n = int(input())\n ls = [\"\"] * n\n for i in range(n):\n ls[i] = input()\n mx = 0\n for i in range(26):\n for j in range(26):\n if i == j:\n continue\n c1 = chr(i+ord('a'))\n c2 = chr(j+ord('a'))\n c = 0\n for x in ls:\n ok = True\n for e in x:\n ok &= e in [c1, c2]\n if ok:\n c += len(x)\n mx = max(mx, c)\n\n print(mx)\n\n\n\n\n\n\nmain()\n", "n = int(input())\r\na = []\r\nd = {}\r\nans = -1\r\nfor i in range(n):\r\n se = set()\r\n s = input()\r\n kol = 0\r\n for i in range(len(s)):\r\n if s[i] not in se:\r\n kol += 1\r\n se.add(s[i])\r\n if kol <= 2:\r\n a.append(s)\r\nfor i in range(ord('a'), ord('z') + 1):\r\n s = 0\r\n for j in a:\r\n s += j.count(chr(i))\r\n ans = max(ans, s) \r\n \r\nfor i in range(ord('a'), ord('z') + 1):\r\n for j in range(i + 1, ord('z') + 1):\r\n s = 0\r\n for k in a:\r\n k1 = k.count(chr(i))\r\n k2 = k.count(chr(j))\r\n if k1 + k2 == len(k): \r\n s += (k1 + k2)\r\n ans = max(ans, s)\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nstr = []\r\nfor i in range(n):\r\n str.append(input())\r\ns1, ans = ord('a'), 0\r\nwhile(s1 <= ord('z')):\r\n s2 = ord('a')\r\n while(s2 <= ord('z')):\r\n tmp = 0\r\n if(s1 == s2):\r\n s2 += 1\r\n continue\r\n for s in str:\r\n if(s.count(chr(s1)) + s.count(chr(s2)) == len(s)):\r\n tmp += len(s)\r\n ans = max(ans, tmp)\r\n s2 += 1\r\n s1 += 1\r\nprint(ans)\r\n", "###################\r\n# 5th October 2019.\r\n###################\r\n\r\n##########################################################\r\n# Generating all pairs of the english alphabet.\r\nimport itertools\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\npairs = list(itertools.combinations(alphabet,2))\r\n# Method to determine if word is valid for pair.\r\ndef isValidForPair(wordSet,pair):\r\n # Are Pair letters in wordSet.\r\n hyp = False\r\n for i in range(len(pair)):\r\n hyp = hyp or pair[i] in wordSet\r\n # No other characters are in wordSet.\r\n return hyp and len(wordSet-set(pair)) is 0\r\n# Collecting lengths and distinct chars for words.\r\nwords,wordCount = [],int(input())\r\nfor i in range(wordCount):\r\n word = input(); words.append([len(word),set(word)])\r\n# Computing article lengths for each pair.\r\narticleLengths = [0]*len(pairs)\r\nfor i in range(len(pairs)):\r\n for j in range(len(words)):\r\n if isValidForPair(words[j][1],pairs[i]):\r\n articleLengths[i]+=words[j][0]\r\n# Solution.\r\nprint(max(articleLengths))\r\n##########################################################\r\n\r\n ########################################\r\n # Programming-Credits atifcppprogrammer.\r\n ########################################", "N = int(input())\nwords = [input() for i in range(N)]\n\nabc = 'abcdefghijklmnopqrstuvwxyz'\ndef countf(a, b):\n c = a + b\n s = 0\n for w in words:\n if w.strip(c) is '':\n s += len(w)\n\n return s\n\nm = 0\nfor a in abc:\n for b in abc:\n if a == b:\n continue\n\n m = max(countf(a, b), m)\n\nprint(m)\n", "import math\r\nimport sys\r\ninput=sys.stdin\r\nwrite=sys.stdout.write\r\nn=int(input.readline())\r\nstore=[[0 for i in range(26)] for j in range(26)]\r\nA=[]\r\nfor i in range(n):\r\n s=input.readline().split()\r\n b=[ord(a)-ord('a') for a in s[0]]\r\n L=len(b)\r\n t=set(b)\r\n b=list(t)\r\n b.sort()\r\n M=len(b)\r\n if M==1:\r\n for i in range(26):\r\n store[b[0]][i]+=L\r\n store[i][b[0]]+=L\r\n store[b[0]][b[0]]-=L\r\n elif M==2:\r\n store[b[0]][b[1]]+=L\r\nm=0\r\nfor i in range(26):\r\n for j in range(26):\r\n m=max(m,store[i][j])\r\nwrite(str(m))\r\n", "data = [s for s in (input() for _ in range(int(input()))) if len(set(s))<=2]\r\na = 0\r\nfor i in range( ord('a'),ord('z')+1 ):\r\n for j in range(i,ord('z')+1):\r\n a = max(a, sum(len(s) for s in data if set(s)<={chr(i),chr(j)}))\r\nprint(a)", "n1 = int(input())\nword = [input() for i in range(n1)]\n\nmlength = 0\nfor i in range(26):\n for j in range(i+1, 26):\n lett = set([chr(i+ord('a')), chr(j+ord('a'))])\n length = sum([len(w) for w in word if set(w).issubset(lett)])\n mlength = max(mlength, length)\n\nprint(mlength)\n \t \t\t\t\t \t \t \t\t \t\t\t\t \t \t \t\t", "n=int(input())\na={}\nfor i in range(n):\n w={}\n word=input()\n for j in word:\n if w.get(j)==None:\n w[j]=1\n if len(w)<=2:\n ans=\"\"\n for i,j in w.items():\n ans+=i\n s=list(ans)\n s.sort()\n l=len(word)\n if len(w)==1:\n if a.get(s[0])==None:a[s[0]]=l\n else:a[s[0]]+=l\n else:\n if a.get(s[0]+s[1])==None:a[s[0]+s[1]]=l\n else:a[s[0]+s[1]]+=l\nans=0\n# print(a)\nfor i in range(97,123):\n for j in range(i+1,123):\n tmp=0\n \n c=chr(i)+chr(j)\n if a.get(c)!=None:\n tmp+=a[c]\n if i!=j:\n if a.get(chr(i))!=None:\n tmp+=a[chr(i)]\n if a.get(chr(j))!=None:\n tmp+=a[chr(j)]\n ans=max(tmp,ans)\n \n\n \n\nprint(ans)\n\t \t \t\t \t\t \t\t\t \t \t\t \t \t\t \t", "n = int(input())\r\nli = [s for s in ( input() for _ in range(n) ) if len(set(s))<=2 ]\r\n#print(li)\r\nprint(max( sum( len(s) for s in li if set(s)<={chr(i),chr(j)} )for i in range(97,123) for j in range(i,123) ) )\r\n\r\n ", "import math\r\nimport string\r\n\r\n\r\n\r\ndef main_function():\r\n hash_real = [[0 for i in range(125)] for j in range(125)]\r\n n = int(input())\r\n for i in range(n):\r\n s = input()\r\n new_hash = {}\r\n for i in s:\r\n if i in new_hash:\r\n new_hash[i] += 1\r\n else:\r\n new_hash[i] = 1\r\n\r\n if len(new_hash) > 2:\r\n pass\r\n\r\n elif len(new_hash) == 1:\r\n targ = ord(list(new_hash)[0])\r\n #print(targ)\r\n for u in range(len(hash_real)):\r\n hash_real[targ][u] += len(s)\r\n for u in range(len(hash_real)):\r\n if u != targ:\r\n hash_real[u][targ] += len(s)\r\n elif len(new_hash) == 2:\r\n l = list(new_hash)\r\n #print(l)\r\n hash_real[ord(l[0])][ord(l[1])] += len(s)\r\n hash_real[ord(l[1])][ord(l[0])] += len(s)\r\n # for o in hash_real:\r\n # print(o)\r\n # print()\r\n # print()\r\n\r\n m = 0\r\n for i in range(len(hash_real)):\r\n for j in range(len(hash_real)):\r\n if hash_real[i][j] > m:\r\n m = hash_real[i][j]\r\n print(m)\r\n # for i in hash_real:\r\n # print(i)\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\n\n\ninp = [input() for i in range(n)]\n\ngets = []\n\nfor line in inp:\n dt = {}\n for c in line:\n if c == ' ':\n continue\n if c in dt:\n dt[c] += 1\n else:\n dt[c] = 1\n ans = -1\n if len(dt) > 2:\n continue\n gets.append(dt)\n\nlets = 'abcdefghijklmnopqrstuvwxyz'\n\nans = -1\nfor c1 in lets:\n for c2 in lets:\n if c2 <= c1:\n continue\n cans = 0\n for l in gets:\n failed = False\n for ch in l:\n if ch not in (c1, c2):\n failed = True\n if failed:\n continue\n cans += sum(l.values())\n if cans > ans:\n ans = cans\n\nprint(ans)\n", "a=int(input())\r\nb = []\r\ne = 0\r\nf =0\r\nfor i in range(a):\r\n b.append(input())\r\nfor i in range(97,123):\r\n c = chr(i)\r\n for j in range(97,123):\r\n d = chr(j)\r\n f = 0\r\n for k in b:\r\n ture = True\r\n for g in k:\r\n if g not in [c,d]:\r\n ture = False\r\n if ture:\r\n f += len(k)\r\n if f>e:\r\n e = f\r\nprint(e)\r\n", "n = int(input())\r\nwords = [input() for _ in range(n)]\r\n\r\nabc = list('qwertyuiopasdfghjklzxcvbnm')\r\nans = 0\r\nfor i in range(len(abc)):\r\n for j in range(i+1,len(abc)):\r\n preAns = 0\r\n for word in words:\r\n canAdd = True\r\n for char in word:\r\n if char != abc[i] and char != abc[j]:\r\n canAdd = False\r\n break\r\n if canAdd:\r\n preAns += len(word)\r\n ans = max(ans, preAns)\r\nprint(ans)\r\n", "from sys import stdin\r\nls = 'abcdefghijklmnopqrstuvwxyz'\r\nd = {}\r\n[d.setdefault(i+j, 0) for i in ls for j in ls]\r\nfor w in stdin.read().strip().splitlines()[1:]:\r\n for k in d:\r\n if set(k) >= set(w):\r\n d[k] += len(w)\r\nprint(max(d.values()))\r\n", "n = int(input())\r\narr = [\".\"] * n\r\nd = dict()\r\nfor i in range(n):\r\n arr[i] = input().strip()\r\n s = set()\r\n for j in range(len(arr[i])):\r\n s.add(arr[i][j])\r\n if len(s) <= 2: \r\n try:\r\n d[arr[i]][0] += 1\r\n except:\r\n d[arr[i]] = [1, s]\r\n#print(d) \r\nans = 0\r\nfor i in range(97, 97+26):\r\n for j in range(97, 97+26):\r\n c = 0\r\n a, b = chr(i), chr(j)\r\n q = set([a, b])\r\n for k in d.keys():\r\n if q >= d[k][1]:\r\n c += d[k][0] * len(k)\r\n ans = max(ans, c)\r\nprint(ans)\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\nx, y = [], []\r\nfor _ in range(n):\r\n s = list(input().rstrip())\r\n cnt = [0] * 26\r\n for i in s:\r\n cnt[i - 97] += 1\r\n x.append(cnt)\r\n y.append(len(s))\r\nans = 0\r\nfor i in range(26):\r\n for j in range(i + 1, 26):\r\n ans0 = 0\r\n for c, k in zip(x, y):\r\n if c[i] + c[j] == k:\r\n ans0 += k\r\n ans = max(ans, ans0)\r\nprint(ans)", "n = int(input())\r\narr = dict()\r\nfor i in range(n):\r\n inp = input()\r\n s = set(inp)\r\n if len(s) < 3:\r\n arr[inp] = [arr.get(inp, [s, 0])[0], arr.get(inp, [s, 0])[1] + 1]\r\nmx = 0\r\nfor i in range(97, 123):\r\n for j in range(i+1, 123):\r\n cnt = 0\r\n for elem in arr:\r\n t = True\r\n for q in arr[elem][0]:\r\n if ord(q) not in [i, j]:\r\n t = False\r\n break\r\n if t:\r\n cnt += len(elem) * arr[elem][1]\r\n if mx < cnt:\r\n mx = cnt\r\nprint(mx)", "import string\r\n\r\ndef main():\r\n buf = input()\r\n n = int(buf)\r\n w = []\r\n for i in range(n):\r\n buf = input()\r\n w.append(str(buf))\r\n char_count_list = []\r\n for i, word in enumerate(w):\r\n char_dict = {}\r\n for char in word:\r\n if char in char_dict:\r\n char_dict[char] += 1\r\n else:\r\n char_dict[char] = 1\r\n char_count_list.append(char_dict)\r\n max_char_length = 0\r\n for i, c1 in enumerate(string.ascii_lowercase):\r\n for c2 in string.ascii_lowercase[i+1:]:\r\n char_length = 0\r\n for char_dict in char_count_list:\r\n if len(char_dict) > 2:\r\n continue\r\n elif len(char_dict) == 2:\r\n if c1 in char_dict and c2 in char_dict:\r\n char_length += char_dict[c1] + char_dict[c2]\r\n elif len(char_dict) == 1:\r\n if c1 in char_dict:\r\n char_length += char_dict[c1]\r\n elif c2 in char_dict:\r\n char_length += char_dict[c2]\r\n if char_length > max_char_length:\r\n max_char_length = char_length\r\n print(max_char_length)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ns = []\r\nfor _ in range(n):\r\n s.append(input().strip())\r\nmaxx = 0\r\nfor i in range(26):\r\n for j in range(26):\r\n cur = 0\r\n for k in range(n):\r\n l = len(s[k])\r\n ok = all(char == chr(ord('a') + i) or char == chr(ord('a') + j) for char in s[k])\r\n if ok:\r\n cur += l\r\n maxx = max(maxx, cur)\r\nprint(maxx)# 1698236418.4290104", "import itertools\nimport os\nimport sys\nfrom io import BytesIO, IOBase\nimport collections\nimport math\nimport string\nimport time\nimport statistics\nmod = 1000000007\n\nsys.setrecursionlimit(100000000)\n\ndef gcd(a,b): # To find GCD of two numbers\n if(a==0):\n return b\n else:\n return gcd(b%a, a)\n\ndef phi(n): # Count primenumber between 1 to n\n result = 1\n for i in range(2, n):\n if (gcd(i, n) == 1):\n result+=1\n return result\n\ndef factors(x): # To find factors of a number O(n)\n l = []\n for i in range(1, x): # except number itself\n if x % i == 0:\n l.append(i)\n return l\n\ndef e_factors(n): # To find factors of a number O(sqrt(n))\n l = []\n while i <= math.sqrt(num):\n if (num % i == 0) :\n if (num / i == i) :\n l.append(i)\n else :\n l.append(i)\n if(int(num/i)!=num): # except number itself\n l.append(int(num/i))\n i = i + 1\n return l\n\ndef singleOccurence(x): #to find single occurence in a array with o(n) time complexity\n xor = 0\n for i in range(len(x)): xor ^= x[i]\n return 0\n\ndef smallfact(x): # To find smallest factor of a number\n l = 1\n for i in range(2, x):\n if x % i == 0:\n l = i\n break\n return l\n\ndef fact(n): # To Find Divisor of number n\n i = 1\n c = 0\n while i <= math.sqrt(n):\n if (n % i == 0) :\n if (n / i == i) :\n c+=1\n else:\n c+=1\n i = i + 1\n return c\n\ndef prime(n): # Prime Number Algo with time complexity O(n)\n if n <= 1:\n return False\n if n == 2:\n return True\n if n > 2 and n % 2 == 0:\n return False\n max_div = math.floor(math.sqrt(n))\n for i in range(3, 1 + max_div, 2):\n if n % i == 0:\n return False\n return True\ndef chars(word):\n return tuple(sorted(set(word)))\n\ndef is_prime(n): # Prime Number Algo with time complexity O(1)\n return n > 1 and all(n % i for i in range(2, int(n**0.5) + 1))\n\ndef divSum(n) : # Sum of factors\n if(n == 1):\n return 1\n result = 0\n for i in range(2,(int)(math.sqrt(n))+1) :\n if (n % i == 0) :\n if (i == (n/i)) :\n result = result + i\n else :\n result = result + (i + n//i)\n return (result+1) #add n to add number itself\n\ndef soe(n): # SieveOfEratosthenes to count prime number less than n\n prime = [True for i in range(n+1)]\n p = 2\n c = 0\n while (p * p <= n):\n if (prime[p] == True):\n for i in range(p * p, n+1, p):\n prime[i] = False\n p += 1\n for p in range(2, n+1):\n if prime[p]:\n c+=1\n return c\n\ndef binarySearch(): # Binary Search Algo with time complexity O(log(n))\n l = 0\n r = len(x)-1\n while(l<=r):\n mid = (l+r)//2\n if(x[mid]==n):\n return mid\n break\n elif(x[mid]<n):\n l = mid+1\n else:\n r = mid-1\n return -1\n\ndef median(data):\n data = sorted(data)\n n = len(data)\n if n%2 == 1:\n return data[n//2]\n else:\n i = n//2\n return (data[i - 1] + data[i])/2\n\ndef solve():\n n = int(input())\n cout = collections.Counter()\n for j in range(n):\n x = input()\n cout[chars(x)] += len(x)\n \n c = 0\n for a, b in itertools.product(string.ascii_lowercase, string.ascii_lowercase):\n r = cout[tuple(a)]\n if a != b:\n r += cout[tuple(b)] + cout[(a, b)]\n c = max(c, r)\n print(c)\n \nclass outcout(IOBase):\n newlines = 0\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\nclass wrapp(IOBase):\n def __init__(self, file):\n self.buffer = outcout(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\nsys.stdin, sys.stdout = wrapp(sys.stdin), wrapp(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\nif __name__ == '__main__':\n solve()\n \t \t \t\t\t \t\t\t \t\t\t\t\t\t \t \t\t\t \t\t\t\t", "s=\"qwertyuiopasdfghjklzxcvbnm\"\r\nn=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n ss=input()\r\n lst2=list(set(list(ss)))\r\n if len(lst2)<=2:\r\n lst.append(ss)\r\nmmax=0\r\nfor i in range(26):\r\n cnt=0\r\n for j in lst:\r\n if j.count(chr(97+i))==len(j):\r\n cnt=cnt+len(j)\r\n mmax=max(cnt,mmax)\r\nfor i in range(26):\r\n for j in range(i,26):\r\n cnt=0\r\n for k in lst:\r\n if k.count(chr(97+i))+k.count(chr(97+j))==len(k):\r\n cnt=cnt+len(k)\r\n mmax=max(cnt,mmax)\r\nprint(mmax)\r\n", "# n = int(input())\r\n# s = input().strip()\r\n# a = [int(tmp) for tmp in input().split()]\r\nn = int(input())\r\ns = [[0] * 26 for i in range(26)]\r\nfor i in range(n):\r\n tmp = input().strip()\r\n lel = [0] * 26\r\n lens = len(tmp)\r\n for j in tmp:\r\n lel[ord(j) - ord('a')] = lens\r\n if lel.count(0) == 24:\r\n tmp = 0\r\n for j in range(26):\r\n if tmp == 0 and lel[j] != 0:\r\n tmp += 1\r\n a = j\r\n if tmp == 1 and lel[j] != 0:\r\n b = j\r\n s[a][b] += lens\r\n s[b][a] += lens\r\n if lel.count(0) == 25:\r\n for j in range(26):\r\n if lel[j] != 0:\r\n a = j\r\n for j in range(26):\r\n s[a][j] += lens\r\n if j != a:\r\n s[j][a] += lens\r\nmx = 0\r\nfor i in range(26):\r\n for j in range(26):\r\n mx = max(mx, s[i][j])\r\nprint(mx)", "# LUOGU_RID: 101606381\ns = [input() for _ in range(int(input()))]\r\nans = []\r\nfor c1 in 'abcdefghijklmnopqrstuvwxyz':\r\n for c2 in 'abcdefghijklmnopqrstuvwxyz':\r\n ans += sum(len(t) for t in s if set(t) <= set(c1 + c2)),\r\nprint(max(ans))\r\n", "n = int(input())\nwords = [input() for i in range(n)]\n\nmax_len = 0\n\n# Iterate through all pairs of distinct letters\nfor c1 in range(26):\n for c2 in range(c1 + 1, 26):\n letters = [chr(c1 + ord('a')), chr(c2 + ord('a'))]\n # Filter the words that contain only the selected letters\n selected_words = list(filter(lambda w: set(w) <= set(letters), words))\n # Calculate the sum of lengths of the selected words\n sum_len = sum(len(w) for w in selected_words)\n # Update the maximum length if necessary\n max_len = max(max_len, sum_len)\n\nprint(max_len)\n\n \t \t\t \t\t \t\t \t \t \t \t \t\t \t \t", "N = int(input())\ntbl = [[0]*26 for x in range(26)]\nfor n in range(N):\n\tword = input()\n\tchrs = [0]*26\n\tfor c in word: chrs[ord(c)-97] += 1\n\tstuff = [(i, x) for i, x in enumerate(chrs) if x > 0]\n\tif len(stuff) == 1:\n\t\tfor a in range(26):\n\t\t\tif a != stuff[0][0]:\n\t\t\t\ttbl[a][stuff[0][0]] += stuff[0][1]\n\t\t\t\ttbl[stuff[0][0]][a] += stuff[0][1]\n\telif len(stuff) == 2:\n\t\ttbl[stuff[0][0]][stuff[1][0]] += stuff[0][1] + stuff[1][1]\n\t\ttbl[stuff[1][0]][stuff[0][0]] += stuff[0][1] + stuff[1][1]\n\nans = 0\nfor a in range(26):\n\tfor b in range(26):\n\t\tans = max(ans, tbl[a][b])\n\nprint(ans)\n", "n = int(input()) \r\n\r\ndata = [] \r\nfor i in range(n): \r\n data.append(input()) \r\n\r\nres = -1 \r\ncur_res = 0 \r\n\r\nfor i in range(ord('a'), ord('z') + 1): \r\n for j in range(i + 1, ord('z') + 1): \r\n for k in range(n): \r\n if data[k].count(chr(i)) + data[k].count(chr(j)) == len(data[k]): \r\n cur_res += len(data[k]) \r\n res = max(res, cur_res) \r\n cur_res = 0 \r\n\r\nprint(res) \r\n", "n = int(input())\nwords = [input() for i in range(n)]\n\nmax_length = 0\nfor i in range(26):\n for j in range(i+1, 26):\n letters = set([chr(i+ord('a')), chr(j+ord('a'))])\n length = sum([len(w) for w in words if set(w).issubset(letters)])\n max_length = max(max_length, length)\n\nprint(max_length)\n\n \t \t\t\t\t \t\t \t \t \t\t\t \t", "def main():\r\n n = int(input())\r\n a = [input() for i in range(n)]\r\n \r\n result = 0\r\n for i in range(26):\r\n for j in range(i + 1, 26):\r\n t = 0\r\n ci = chr(i + ord('a'))\r\n cj = chr(j + ord('a'))\r\n for s in a:\r\n if s.count(ci) + s.count(cj) == len(s):\r\n t += len(s)\r\n result = max(result, t)\r\n \r\n print(result)\r\n \r\n \r\n \r\nmain()", "n = int(input())\ns = []\nfor i in range(n):\n k = input()\n s.append(k)\nmaxans = -1\nfor i in range(26):\n for j in range(26):\n ans = 0\n for k in s:\n for p in range(len(k)):\n if k[p] != chr(ord('a') + i) and k[p] != chr(ord('a') + j):\n break\n if k[p] == chr(ord('a') + i) or k[p] == chr(ord('a') + j):\n ans += len(k)\n if ans > maxans:\n maxans = ans\nprint(maxans)\n", "import math\r\nfrom decimal import *\r\nimport sys\r\nfrom fractions import Fraction\r\n\r\n\r\nn=int(input())\r\n\r\nS=set()\r\nM=dict()\r\nma=0\r\nalf = \"abcdefghijklmnopqrstuvwxyz\"\r\nfor c in range(0,n):\r\n s=input()\r\n L=len(s)\r\n co=len(set(s))\r\n if co == 1:\r\n ch=s[0]\r\n for j in alf:\r\n if ch+j not in S:\r\n S.add(ch+j)\r\n M[ch+j] = L\r\n else:\r\n M[ch+j] += L\r\n if ch != j:\r\n if j+ch not in S:\r\n S.add(j+ch)\r\n M[j+ch] = L\r\n else:\r\n M[j+ch] += L\r\n if co == 2:\r\n ch1 = s[0]\r\n for j in range(0,L):\r\n if s[j] != ch1:\r\n ch2 = s[j]\r\n if ch1+ch2 not in S:\r\n S.add(ch1+ch2)\r\n M[ch1+ch2] = L\r\n else:\r\n M[ch1+ch2] += L\r\n if ch2+ch1 not in S:\r\n S.add(ch2+ch1)\r\n M[ch2+ch1] = L\r\n else:\r\n M[ch2+ch1] += L\r\nfor i in alf:\r\n for j in alf:\r\n if i+j in S:\r\n if M[i+j]>ma:\r\n ma=M[i+j]\r\nprint(ma)\r\n \r\n \r\n", "n = int(input())\nwords = [input() for i in range(n)]\n\nmax_len = 0\n\nfor c1 in range(26):\n for c2 in range(c1 + 1, 26):\n letters = set([chr(c1 + ord('a')), chr(c2 + ord('a'))])\n length = sum([len(word) for word in words if set(word) <= letters])\n max_len = max(max_len, length)\n\nprint(max_len)\n\n\t \t\t \t\t\t\t \t\t \t \t \t \t \t\t", "import itertools\r\nimport functools\r\n\r\nN = int(input())\r\nwords = [ input() for i in range(N) ]\r\nwords_bit = [[functools.reduce(lambda x, y : x | y, [0] + [ 1 << ord(ch) - ord('a') for ch in words[i]])][0] for i in range(N)]\r\nprint(max([sum([ len(words[k]) for k in range(N) if not words_bit[k] & ~(1 << i | 1 << j)]) for i in range(26) for j in range(26)]))\r\n", "data=[s for s in (input() for _ in range(int(input()))) if len(set(s))<=2]\r\nprint(max((sum(len(s) for s in data if set(s)<={chr(i),chr(j)}) for i in range(ord('a'),ord('z')+1) for j in range(i,ord('z')+1))))", "n = int(input())\r\nd = dict()\r\nd1 = dict()\r\nfor i in range(n):\r\n x = input()\r\n s = set(x)\r\n if len(s) == 2:\r\n a = s.pop()\r\n b = s.pop()\r\n if (a, b) in d:\r\n d[(a, b)] += len(x)\r\n else:\r\n d[(a, b)] = len(x)\r\n elif len(s) == 1:\r\n a = s.pop()\r\n if a in d1:\r\n d1[a] += len(x)\r\n else:\r\n d1[a] = len(x) \r\n\r\nm = 0 \r\nif len(d) != 0:\r\n for k, v in d.items():\r\n count = v\r\n if k[0] in d1:\r\n count += d1[k[0]]\r\n if k[1] in d1:\r\n count += d1[k[1]] \r\n m = max(m, count)\r\n \r\nm2 = 0\r\nm3 = 0\r\nif len(d1) != 0:\r\n for x in d1.values():\r\n if x > m2:\r\n m3 = m2\r\n m2 = x\r\n elif x > m3:\r\n m3 = x\r\n\r\n \r\nprint(max(m, (m2 + m3)))\r\n \r\n ", "from string import ascii_lowercase\r\nn = int(input())\r\nwords = [input() for _ in range(n)]\r\nwords = [word for word in words if len(set(word)) <= 2]\r\nbest = -1\r\nfor i1 in range(25):\r\n for i2 in range(i1 + 1, 26):\r\n cs = {ascii_lowercase[i1], ascii_lowercase[i2]}\r\n cw = [word for word in words if set(word) <= cs]\r\n cl = sum(len(word) for word in cw)\r\n if cl > best:\r\n best = cl\r\nprint(best)\r\n", "#!/usr/bin/env python3\n\nfrom collections import defaultdict\nfrom itertools import combinations\n\ndef main():\n n = int(input())\n d = defaultdict(lambda: 0)\n for i in range(n):\n s = input()\n c1 = c2 = None\n for c in s:\n if c not in (c1, c2):\n if c1 is None:\n c1 = c\n elif c2 is None:\n c2 = c\n else:\n break\n else:\n if c2 is not None:\n a = ord(c1) - 97\n b = ord(c2) - 97\n d[(min(a, b), max(a, b))] += len(s)\n else:\n a = ord(c1) - 97\n for j in range(26):\n d[(min(a, j), max(a, j))] += len(s)\n result = 0\n for a, b in combinations(range(26), 2):\n result = max(result, d[(a, b)])\n print(result)\n\ntry:\n while True:\n main()\nexcept EOFError:\n pass\n", "n = int(input())\nw = [input() for i in range(n)]\nMAX = 0\nfor j in range(26):\n for k in range (j+1, 26):\n l1 = chr(j + ord('a'))\n l2 = chr(k + ord('a'))\n count = 0\n for words in w:\n if set(words) <= {l1,l2}:\n count += len(words)\n MAX = max(MAX, count)\nprint(MAX)\n \t\t\t\t \t\t \t\t \t\t \t\t \t\t\t \t \t \t", "n=int(input())\na,c,t1=[],[],[]\nfor i in range(0,n):\n b=[]\n x=input()\n for i in range(0,len(x)):\n b.append(x[i])\n if(x[i] not in t1):\n t1.append(x[i])\n if(len(set(b))<=2):\n c.append(b)\n a.append(x)\nl=(len(t1))\nt2=t1\nif(len(t1)>=2):\n for i in range(0,l):\n for j in range(0,l):\n if(t1[i]!=t1[j]):\n temp=t1[i]+t1[j]\n if(temp not in t2) :\n t2.append(temp)\nword_len=[]\nfor x in t1:\n count=0\n if(len(x)==1):\n for word in a:\n if set(word) == set(x):\n count+=len(word)\n else:\n for word in a:\n if (set(word) == set(x[0]) or set (word) == set(x[1]) or set (word) == set(x)):\n count+=len(word)\n word_len.append(count)\nprint(max(word_len))\n\n\n \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(ord('a'),ord('z')+1):\r\n a[chr(i)]=0\r\nb={}\r\nfor i in range(ord('a'),ord('z')):\r\n for j in range(i+1,ord('z')+1):\r\n b[(chr(i),chr(j))]=0\r\nfor _ in range(N):\r\n x=input()\r\n p=set(x)\r\n if(len(p)==1):\r\n a[x[0]]+=len(x)\r\n elif(len(p)==2):\r\n p=sorted(p)\r\n b[(p[0],p[1])]+=len(x)\r\nx=sorted(b,key=lambda x:b[x],reverse=True)\r\nmaxa=0\r\nfor i in range(len(x)):\r\n t=b[x[i]]+a[x[i][0]]+a[x[i][1]]\r\n if t>maxa:\r\n maxa=t\r\nprint(maxa)\r\n", "n=int(input())\r\nN=[]\r\nd={}\r\nc=0\r\nM={}\r\nfor i in range(n):\r\n s=input()\r\n p=set(s)\r\n if len(p)>2:\r\n continue\r\n else:\r\n N.append(len(s))\r\n d.update({c:p})\r\n c+=1\r\n if len(p)==1:\r\n if s[0] not in M.keys():\r\n M.update({s[0]: len(s)})\r\n else:\r\n M[s[0]]+=len(s)\r\nbest=0\r\ndone=[]\r\nfor i in d:\r\n if d[i] not in done:\r\n p=d[i]\r\n c_sum=0\r\n for j in d:\r\n if d[j].issubset(p)==True:\r\n c_sum+=N[j]\r\n done.append(d[i])\r\n best=max(c_sum,best)\r\nbest_single=0\r\nfor i in M:\r\n for j in M:\r\n if i!=j:\r\n best_single=max(best_single,M[i]+M[j])\r\nprint(max(best,best_single))\r\n\r\n\r\n \r\n", "n = int(input())\nlista = []\nfor i in range(n):\n lista.append(input())\nmayor = 0\nfor i in range(97,123):\n for x in range(97,123):\n contar = 0\n pair = [chr(i),chr(x)]\n for palabra in lista:\n esta = False\n for caracter in palabra:\n if caracter in pair:\n esta = True\n else:\n esta = False\n break\n if not esta:\n continue\n else:\n if i != x:\n contar += palabra.count(pair[1])\n contar += palabra.count(pair[0])\n else:\n contar += palabra.count(pair[0])\n if contar > mayor:\n mejor_pareja = pair\n mayor = contar\nprint(mayor)\n\t\t\t \t\t \t\t \t \t\t \t\t \t \t\t", "from typing import List\ndef find(x,s):\n l1=[]\n for i in x:\n c=0\n for j in i:\n if j not in s:\n break\n else:\n c+=1\n if(c==len(i)):\n l1.append(len(i))\n return sum(l1)\nn = int(input())\nl,s=[],''\nfor i in range(n):\n x=input()\n l.append(x)\n s+=x\nl1=[]\nfor i in s:\n if(i not in l1):\n l1.append(i)\nle=len(l1)\nfor i in range(le):\n s1=''\n for j in range(i+1,le):\n s1=l1[i]+l1[j]\n l1.append(s1)\nl2=[]\nfor i in l1:\n l2.append(find(l,i))\nprint(max(l2))\n\t\t \t \t \t\t\t\t\t\t \t \t \t\t\t \t \t", "I=input\r\nd={}\r\nS='abcdefghijklmnopqrstuvwxyz'\r\nfor i in S:\r\n\tfor j in S:d[i+j]=0\r\nfor _ in '1'*int(I()):\r\n\ts=I();t=set(s)\r\n\tfor k in d:\r\n\t\tif set(k)>=t:d[k]+=len(s)\r\nprint(max(d.values()))", "import string\r\nn = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n word = input()\r\n chars = set(word)\r\n if len(chars) < 3:\r\n dc = ''.join(sorted(chars))\r\n d[dc] = d.get(dc, 0) + len(word)\r\nbest = 0\r\nfor c1 in string.ascii_lowercase:\r\n for c2 in string.ascii_lowercase:\r\n curscore = 0\r\n for dc in d:\r\n if set(dc) <= set(c1+c2):\r\n curscore += d[dc]\r\n if curscore > best:\r\n best = curscore\r\nprint(best)", "t=int(input())\narr=[input() for i in range(t)]\nc=0\nfor i in range(26):\n for k in range(i+1,26):\n a1 = chr(i + ord('a'))\n a2 = chr(k + ord('a'))\n k=0\n for x in arr:\n if set(x)<={a1,a2}:\n k+=len(x)\n c=max(k,c)\nprint(c)\n \t\t\t \t\t\t\t\t \t \t\t\t \t \t\t \t \t\t", "n=int(input())\r\ns=[input() for i in range(n)]\r\nl=[(set(x),len(x)) for x in s if len(set(x))<3]\r\nans=0\r\nn=len(l)\r\nt=[\"\"]+list(\"qwertyuiopasdfghjklzxcvbnm\")\r\nfor i in range(27):\r\n for j in range(27):\r\n if i==j: continue \r\n r=0\r\n for k in range(n):\r\n if len(l[k][0]|{t[i]}|{t[j]})<3: r+=l[k][1]\r\n if r>ans: ans=r\r\nprint(ans)", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import *\r\nfrom itertools import accumulate\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\nen = lambda x: list(enumerate(x))\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn = ii()\r\narr = [ip() for _ in range(n)]\r\nans = 0\r\nc = 0\r\n\r\nfor i in string.ascii_lowercase:\r\n for j in string.ascii_lowercase:\r\n if i == j:\r\n continue\r\n ans = 0\r\n base = set([i, j])\r\n for k in arr:\r\n x = set(k)\r\n if x <= base:\r\n ans += len(k)\r\n\r\n c = max(ans, c)\r\nprint(c)\r\n", "n=int(input())\r\ni=0\r\nx=[]\r\nwhile i<n:\r\n\tx.append(str(input()))\r\n\ti+=1\r\ni=25\r\nr=0\r\nwhile i:\r\n\tj=i\r\n\twhile j:\r\n\t\tj-=1\r\n\t\tt=0\r\n\t\tk=n\r\n\t\twhile k:\r\n\t\t\tk-=1\r\n\t\t\ty=x[k]\r\n\t\t\tz=len(y)\r\n\t\t\tok=1\r\n\t\t\twhile z:\r\n\t\t\t\tz-=1\r\n\t\t\t\tif ord(y[z])-ord('a')!=i:\r\n\t\t\t\t\tif ord(y[z])-ord('a')!=j:ok=0\r\n\t\t\tif ok:t+=len(y)\r\n\t\tif r<t:r=t\r\n\ti-=1\r\nprint(r)\r\n", "def f(c):\r\n if type(c) == int:\r\n return chr(c + 97)\r\n if type(c) == str:\r\n return ord(c) - 97\r\n\r\n\r\ndef g(s):\r\n r = []\r\n for i in s:\r\n if i not in r:\r\n r.append(i)\r\n if len(r) > 2:\r\n return r\r\n return r\r\n\r\n\r\nm = [[0] * 26 for i in range(26)]\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n a = g(s)\r\n if len(a) == 1:\r\n m[f(a[0])][f(a[0])] += len(s)\r\n elif len(a) == 2:\r\n m[f(a[0])][f(a[1])] += len(s)\r\n m[f(a[1])][f(a[0])] += len(s)\r\n\r\ncnt = 0\r\nfor i in range(26):\r\n for j in range(26):\r\n if i == j:\r\n cnt = max(cnt, m[i][j])\r\n else:\r\n cnt = max(cnt, m[i][i] + m[i][j] + m[j][j])\r\nprint(cnt)\r\n", "from collections import defaultdict, Counter\n\n\nif __name__ == '__main__':\n n = int(input())\n data = [input() for i in range(n)]\n\n m = 0\n\n for a in range(ord('a'), ord('z') + 1):\n for b in range(ord('a'), ord('z') + 1):\n curr = 0\n for i, x in enumerate(data):\n c = Counter(x)\n if (len(c.keys()) == 2 and (chr(a) in c) and (chr(b) in c) and len(set(c.keys()) - set([chr(a), chr(b)])) == 0) or (len(c.keys()) == 1 and (chr(a) in c.keys() or chr(b) in c.keys())):\n curr += len(x)\n if curr > m:\n m = curr\n\n print(m)\n", "#!/usr/bin/env python3\nimport collections\nimport itertools\nimport string\n\ndef chars(word):\n \"\"\"Unique characters in word.\"\"\"\n return tuple(sorted(set(word)))\n\nif __name__ == '__main__':\n N = int(input())\n cnt = collections.Counter()\n for _ in range(N):\n word = input()\n cnt[chars(word)] += len(word)\n\n res = 0\n for a, b in itertools.product(\n string.ascii_lowercase, string.ascii_lowercase):\n r = cnt[tuple(a)]\n if a != b:\n r += cnt[tuple(b)] + cnt[(a, b)]\n res = max(res, r)\n print(res)\n", "import itertools\r\n\r\nN = int(input())\r\ncounter = itertools.repeat([0 for i in range(26)], 26)\r\nwords = [ input() for i in range(N) ]\r\n\r\nwords_bit = [0 for i in range(N)]\r\nfor i in range(N):\r\n for ch in words[i]:\r\n words_bit[i] |= 1 << ord(ch) - ord('a')\r\n\r\nans = 0\r\nfor i in range(26):\r\n for j in range(26):\r\n x = (1 << i) | (1 << j)\r\n sol = 0\r\n for k in range(N):\r\n if not words_bit[k] & ~x:\r\n sol += len(words[k])\r\n ans = ans if ans > sol else sol\r\nprint(ans)\r\n", "I=input\nd={}\nS='abcdefghijklmnopqrstuvwxyz'\nfor i in S:\n\tfor j in S:d[i+j]=0\nfor _ in '1'*int(I()):\n\ts=I();t=set(s)\n\tfor k in d:\n\t\tif set(k)>=t:d[k]+=len(s)\nprint(max(d.values()))\n\t\t \t \t \t \t\t\t \t \t \t \t \t \t\t", "from itertools import combinations\nn = int(input())\na = [input() for _ in range(n)]\nans = 0\nfor (c, d) in combinations('abcdefghijklmnopqrstuvwxyz', 2):\n t = 0\n for s in a:\n if len(s) == s.count(c) + s.count(d):\n t += len(s)\n ans = max(ans, t)\nprint(ans)\n \n", "def main():\n letters = set()\n for c in range(ord('a'), ord('z') + 1):\n letters.add(chr(c))\n n = int(input())\n r = 0\n g = []\n for i in range(n):\n o = list(input())\n x = set(o)\n if len(x) <= 2:\n g.append((x, len(o)))\n for a in range(ord('a'), ord('z') + 1):\n for b in range(ord('a'), ord('z') + 1):\n ret = 0\n for gg in g:\n if len(gg[0].difference(set([chr(a), chr(b)]))) == 0:\n ret += gg[1]\n r = max(ret, r)\n return r\n\nprint(main())\n", "n = int(input())\nw = [input() for i in range(n)]\nc = 0\nfor j in range(26):\n for k in range (j+1, 26):\n l1 = chr(j + ord('a'))\n l2 = chr(k + ord('a'))\n count = 0\n for s in w:\n if set(s) <= {l1,l2}:\n count += len(s)\n c = max(c, count)\nprint(c)\n \t\t\t\t \t\t \t\t \t\t \t\t \t\t\t \t \t \t\n\t\t \t\t\t \t\t \t \t \t\t\t \t \t\t \t \t", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n x = input()\r\n a.append(x)\r\nres = 0\r\nfor i in range(26):\r\n for j in range(26):\r\n s = 0\r\n for x in a:\r\n for z in x:\r\n if ord(z) - ord('a') != i and ord(z) - ord('a') != j:\r\n break\r\n else :\r\n s += len(x)\r\n res = max(s,res)\r\nprint(res)\r\n", "from sys import stdin\nls = 'abcdefghijklmnopqrstuvwxyz'\nd = {}\n[d.setdefault(i+j, 0) for i in ls for j in ls]\nfor w in stdin.read().strip().splitlines()[1:]:\n for k in d:\n if set(k) >= set(w):\n d[k] += len(w)\nprint(max(d.values()))\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = input()\r\n c = {}\r\n count = 0\r\n for j in b:\r\n if j in c:\r\n c[j] += 1\r\n else:\r\n c[j] = 1\r\n count += 1\r\n if count > 2:\r\n break\r\n if 1 <= count <= 2:\r\n a.append(c)\r\neng = \"abcdefghijklmnopqrstuvwxyz\"\r\nmaxs = 0\r\nfor i in range(26):\r\n for j in range(i+1, 26):\r\n sum = 0\r\n for k in a:\r\n if eng[i] in k and eng[j] in k:\r\n sum += k[eng[i]] + k[eng[j]]\r\n elif eng[i] in k and len(list(k.keys())) == 1:\r\n sum += k[eng[i]]\r\n elif eng[j] in k and len(list(k.keys())) == 1:\r\n sum += k[eng[j]]\r\n maxs = max(sum, maxs)\r\nprint(maxs)\r\n \r\n", "import string\n\nalphabet = string.ascii_lowercase\n\nclass Breakdown:\n def __init__(self, word):\n self.word = word\n self.length = len(word)\n self.count = { ch: word.count(ch) for ch in alphabet }\n\nn = int(input())\nbreakdowns = [ Breakdown(input().strip()) for i in range(n) ]\nbest = 0\n\nfor i, a in enumerate(alphabet):\n for j in range(i + 1, len(alphabet)):\n b = alphabet[j]\n count = 0\n for breakdown in breakdowns:\n if breakdown.count[a] + breakdown.count[b] == breakdown.length:\n count += breakdown.length\n best = max(best, count)\n\nprint(best)\n", "w=[c for c in(input()for _ in range(int(input())))if len(set(c))<3]\r\nb=0\r\nfor i in range(97,122):\r\n for j in range(i,123):\r\n b=max(b,sum(len(c)for c in w if set(c)<={chr(i),chr(j)}))\r\nprint(b)", "n = int(input())\r\ninp =[]\r\nfor p in range(n):\r\n inp.append(input())\r\nans = 0\r\nfor i in range(0, 26):\r\n for j in range(i + 1, 26):\r\n curans = 0;\r\n for o in range(n):\r\n fail = False\r\n for k in range(len(inp[o])):\r\n if inp[o][k] != chr(ord('a') + i) and inp[o][k] != chr(ord('a') + j):\r\n fail = True\r\n break\r\n if not fail:\r\n curans += len(inp[o])\r\n ans = max(ans, curans)\r\nprint(ans)", "import itertools\r\n\r\nnr_lines = int(input())\r\nlengths = []\r\nmapping = {}\r\nsolo_maps = {}\r\nresult = 0\r\n\r\nfor i in range(nr_lines):\r\n raw = input()\r\n\r\n input_length = len(raw)\r\n distinct_letters = ''.join(set(raw))\r\n\r\n if len(distinct_letters) > 2:\r\n continue\r\n\r\n distinct_letters = ''.join(sorted(distinct_letters))\r\n index = len(lengths)\r\n lengths.append(input_length)\r\n\r\n if len(distinct_letters) == 1:\r\n entry = solo_maps.setdefault(distinct_letters, [])\r\n entry.append(index)\r\n else:\r\n entry = mapping.setdefault(distinct_letters, [])\r\n entry.append(index)\r\n\r\nresults = {}\r\n\r\nfor chars, indices in mapping.items():\r\n extra_one = solo_maps.get(chars[0], [])\r\n extra_two = solo_maps.get(chars[1], [])\r\n all_indices = list(set(extra_one + extra_two + indices))\r\n results[chars] = all_indices\r\n\r\nfor char, indices in solo_maps.items():\r\n results[char] = indices\r\n\r\ncombos = itertools.combinations(solo_maps.keys(), 2)\r\nfor x in combos:\r\n extra_one = solo_maps.get(x[0], [])\r\n extra_two = solo_maps.get(x[1], [])\r\n all_indices = list(set(extra_one + extra_two))\r\n results[x] = all_indices\r\n\r\nfor indices in results.values():\r\n bert = sum([lengths[x] for x in indices])\r\n result = max(bert, result)\r\n\r\nprint(result)\r\n", "from sys import stdin\nls = 'abcdefghijklmnopqrstuvwxyz'\nd = {}\nfor k in (i+j for i in ls for j in ls):\n d[k] = 0\nfor w in stdin.read().strip().splitlines()[1:]:\n for k in d:\n if set(k) >= set(w):\n d[k] += len(w)\nprint(max(d.values()))\n", "letras = 'abcdefghijklmnopqrstuvwxyz'\n\nn = int(input())\ntext = []\ntamanhos = []\n\nfor i in range(n):\n\taux = input()\n\n\ttext.append(aux)\n\nresp = 0\nfor i in range(26):\n\tfor j in range(i+1,26):\n\t\tcont = 0\n\t\t\n\t\tfor k in text:\n\t\t\tc = k.count(letras[i]) + k.count(letras[j])\n\n\t\t\tif c==len(k):\n\t\t\t\tcont += c\n\n\t\tif cont>resp:\n\t\t\tresp = cont\n\n\nprint(resp) ", "t = int(input())\nword = [input() for i in range(t)]\nlength = 0\nfor i in range(26):\n for k in range(i+1, 26):\n a1 = chr(i + ord('a'))\n a2 = chr(k + ord('a'))\n k = 0\n for j in word:\n if set(j) <= {a1, a2}: k += len(j)\n length = max(k, length)\nprint(length)\n \t \t \t \t \t \t\t\t\t \t\t \t\t\t \t\t \t", "w=[input() for _ in range(int(input()))]\r\nw=[c for c in w if len(set(c))<=2]\r\nb=-1\r\nfor i in range(25):\r\n for j in range(i+1, 26):\r\n b = max(b,sum(len(c) for c in w if set(c)<={chr(97+i),chr(97+j)}))\r\nprint(b)\r\n", "n = int(input())\r\ndict={}\r\nfor _ in range(n):\r\n s = input()\r\n k = ''.join(sorted(set(s)))\r\n if len(set(s))<=2:\r\n dict[k] = dict.get(k,0) + len(s)\r\n \r\n#print(dict) \r\nprint(max(dict.get(chr(i)+chr(j),0) + dict.get(chr(i),0) + dict.get(chr(j),0) for i in range(97,123) for j in range(97,123) if i<j ))\r\n\r\n ", "n = int(input())\r\na = [input() for i in range(n)]\r\nalp = 'qwertyuiopasdfghjklzxcvbnm'\r\nans = 0\r\nfor i in range(26):\r\n for j in range(i + 1, 26):\r\n c1, c2 = alp[i], alp[j]\r\n cur = 0\r\n for s in a:\r\n if set(s) in ({c1, c2}, {c1}, {c2}):\r\n cur += len(s)\r\n ans = max(ans, cur)\r\nprint(ans)\r\n" ]

[ "import math\r\n\r\nn,h,k=map(int,input().split())\r\n\r\nx=list(map(int,input().split()))\r\n\r\nsec=0\r\ns=0\r\nind=0\r\nwhile(1):\r\n if ind>=n:\r\n break\r\n while(ind<n and s+x[ind]<=h):\r\n s+=x[ind]\r\n ind+=1\r\n sec+=s//k\r\n s=s%k\r\n\r\n if ind<n and s+x[ind]>h and s<k:\r\n sec+=1\r\n s=0\r\n\r\n if ind>=n and s>0:\r\n sec+=math.ceil(s/k)\r\n # print(x[ind])\r\n\r\nprint(sec)", "n,h,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsec=0\r\nrem=0\r\nfor i in l:\r\n if i+rem<k:\r\n rem+=i\r\n continue\r\n if i+rem>h:\r\n sec+=1\r\n b=(i)//k\r\n sec+=b\r\n rem=(i)%k\r\n\r\n else: \r\n b=(i+rem)//k\r\n sec+=b\r\n rem=(i+rem)%k\r\nif rem>0:\r\n sec+=1\r\nprint(sec)\r\n ", "l = input().split()\nn, h, k = list(map(int, l))\n\nl = input().split()\npieces = list(map(int, l))\n\nres = 0\ncapacity = 0 \ni = 0\n\nfor i in range(len(pieces)):\n # piece too large, let the blender work\n if capacity + pieces[i] > h:\n res += capacity // k # number of seconds to reduce capacity to be < k\n capacity %= k # remaining capacity after res seconds\n if capacity + pieces[i] > h: # remainder + new piece is still too large, reduce remainder to 0 in 1 second\n res += 1\n capacity = pieces[i]\n else: # place new piece into blender on top of what's remaining\n capacity += pieces[i]\n # insert new piece into blender\n else:\n capacity += pieces[i]\n\n# seconds to reduce capacity to some value < k for whatever is remaining after all pieces have been placed\nres += capacity // k\n# after division we get a non-zero remainder, one more second is required to blend it down to 0\nif capacity % k > 0:\n res += 1\n\nprint(res)", "# https://codeforces.com/contest/677\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\ndef ceil_div(a, b):\n return - (-a // b)\n\n\nn, h, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfilled = 0\ni = 0\nwhile True:\n while i < n and filled + a[i] <= h:\n filled += a[i]\n i += 1\n if i >= n:\n ans += ceil_div(filled, k)\n break\n x = min(ceil_div(a[i] - (h - filled), k), ceil_div(filled, k))\n ans += x\n filled = max(filled - x * k, 0)\n\nprint(ans)\n", "# https://codeforces.com/contest/677\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, h, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\n\nfilled = 0\nfor v in a:\n if filled + v > h:\n ans += 1\n filled = v\n else:\n filled += v\n x = filled // k\n ans += x\n filled -= x * k\nans += int(filled > 0)\n\nprint(ans)\n", "# https://codeforces.com/contest/677\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, h, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfilled = 0\ni = 0\nwhile i < n:\n while i < n and filled + a[i] <= h:\n filled += a[i]\n i += 1\n if filled <= k:\n ans += 1\n filled = 0\n else:\n x = filled // k\n ans += x\n filled -= x * k\nans += (filled + k - 1) // k\n\nprint(ans)\n", "import sys\r\nn, h, k = map(int, sys.stdin.readline().strip().split())\r\na = list(map(int, sys.stdin.readline().strip().split()))\r\ncurr = 0\r\nans = 0\r\nfor i in range(0, n):\r\n\tif(curr + a[i] <= h):\r\n\t\tcurr += a[i]\r\n\telse:\r\n\t\tans += 1\r\n\t\tcurr -= min(k, curr)\r\n\t\tcurr += a[i]\r\n\t\r\n\tans += (curr // k)\r\n\tcurr %= k\r\n\r\nif(curr > 0): ans += 1\r\nprint(ans)\r\n\r\n" ]

[ "x,y=map(int,input().split(' '))\r\nans=0\r\nA=[y]*3\r\nwhile(sum(A)<x*3):\r\n\tA.sort()\r\n\tA[0]=min(x,A[1]+A[2]-1)\r\n\tans+=1\r\nprint(ans)\r\n", "from math import sqrt\nimport sys\n\nx, y = [int(i) for i in input().split()]\na = y\nb = y\nc = y\ncount = 0\nwhile a != x or b != x or c != x:\n min_side = min(min(a, b), c)\n max_side = max(max(a, b), c)\n mid_side = a+b+c-max_side-min_side\n new_side = min(max_side + mid_side - 1, x)\n a = mid_side\n b = max_side\n c = new_side\n# print(a, b, c)\n count += 1\nprint(count)\n", "x, y = map(int, input().split())\r\n\r\na, b, c = y, y, y\r\ncnt = 0\r\nwhile True:\r\n\r\n if a >= x and b >= x and c >= x:\r\n break\r\n\r\n cnt += 1\r\n if cnt % 3 == 0:\r\n a = b+c - 1\r\n elif cnt % 3 == 1:\r\n b = c + a - 1\r\n elif cnt % 3 == 2:\r\n c = b+a - 1\r\n\r\nprint(cnt)", "eKnBQaHTzrUcYtwjiVCG = map\r\neKnBQaHTzrUcYtwjiVCo = int\r\neKnBQaHTzrUcYtwjiVCX = input\r\neKnBQaHTzrUcYtwjiVCA = sorted\r\neKnBQaHTzrUcYtwjiVCN = min\r\neKnBQaHTzrUcYtwjiVCF = print\r\nx, y = eKnBQaHTzrUcYtwjiVCG(\r\n eKnBQaHTzrUcYtwjiVCo, eKnBQaHTzrUcYtwjiVCX().split())\r\na, b, c = y, y, y\r\nk = 0\r\nwhile a != x:\r\n a, b, c = eKnBQaHTzrUcYtwjiVCA([eKnBQaHTzrUcYtwjiVCN(x, b+c-1), b, c])\r\n k += 1\r\neKnBQaHTzrUcYtwjiVCF(k)\r\n", "x, y = map(int,input().split())\r\na = [y,y,y]\r\ncnt = 0\r\nwhile True:\r\n if a[0] == a[1] == a[2] == x:\r\n break\r\n if a[1] + a[2] > x:\r\n a[0] = x\r\n else:\r\n a[0] = a[1] + a[2] - 1\r\n cnt+=1\r\n a.sort()\r\nprint(cnt)", "import sys\r\n\r\nfin = sys.stdin\r\n# fin = open('tri.in', 'r')\r\nwhile True:\r\n s = fin.readline().strip()\r\n if s == '':\r\n break\r\n x, y = [int(x) for x in s.split()]\r\n a, b, c = y, y, y\r\n time = 0\r\n while a < x:\r\n time += 1\r\n a, b, c = b, c, b + c - 1\r\n print(time)\r\n", "import math\r\n\r\nx, y = map(int, input().split())\r\nres = 0\r\nnow = [y, y, y]\r\nwhile min(now) < x:\r\n res += 1\r\n ind = now.index(min(now))\r\n o1, o2 = (ind + 1) % 3, (ind + 2) % 3\r\n now[ind] = now[o1] + now[o2] - 1\r\nprint(res)\r\n\r\n", "x=input().split()\nx[0], x[1]=int(x[0]), int(x[1])\ny = [x[1]]*3\nc = 0;\nwhile (y[2]<x[0]):\n y[0],y[1],y[2] = y[1],y[2],y[1]+y[2]-1\n c+=1\nc+=2\nprint(c)\n\n\t \t\t \t \t\t \t \t \t\t\t\t\t \t \t\t", "ini, fin = sorted(map(int, input().split()))\r\nsides = [ini]*3\r\ncount = 0\r\nwhile not(sides[0]==fin and sides[1]==fin and sides[2]==fin):\r\n sides[0] = min(fin, sides[1]+sides[2]-1)\r\n sides = sorted(sides)\r\n count = count + 1\r\nprint(count)", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n n,m = map(int,input().split())\r\n a = [m,m,m]\r\n ans = 0\r\n while a != [n,n,n]:\r\n for i in range(3):\r\n if a[i] != n:\r\n a[i] = min(n , a[(i+1)%3] + a[(i+2)%3] - 1)\r\n ans += 1\r\n print(ans)\r\n", "x, y = map(int, input().split())\r\narr, res = [y, y, y], 0\r\nwhile arr[0] < x:\r\n res += 1\r\n arr[0] = min(arr[1] + arr[2] - 1, x)\r\n arr.sort()\r\nprint(res)\r\n", "x, y = map(int, input().split())\r\nper = 0 if x !=y else 3\r\nans = 0\r\nper1 = y\r\nper2 = y\r\nper3 = y\r\nwhile per < 3:\r\n if per1 <= per2 and per1 <= per3:\r\n if per3 + per2 - 1 >= x:\r\n per += 1\r\n per1 = x\r\n else:\r\n per1 = per3 + per2 - 1\r\n elif per2 <= per1 and per2 <= per3:\r\n if per3 + per1 - 1 >= x:\r\n per += 1\r\n per2 = x\r\n else:\r\n per2 = per3 + per1 - 1 \r\n elif per3 <= per2 and per3 <= per1:\r\n if per1 + per2 - 1 >= x:\r\n per += 1\r\n per3 = x\r\n else:\r\n per3 = per1 + per2 - 1 \r\n ans += 1\r\nprint(ans)", "x,y=map(int,input().split())\r\n\r\na,b,c=y,y,y\r\nans=0\r\n\r\nwhile (a,b,c)<(x,x,x,):\r\n new=b+c-1\r\n a,b,c=b,c,new\r\n ans+=1\r\n \r\nprint(ans)\r\n", "x, y = map(int, input().split())\r\na, v = [y] * 3, 0\r\nwhile a[0] < x:\r\n a[0] = min(x, a[1] + a[2] - 1)\r\n a.sort()\r\n v += 1\r\nprint(v)", "lst=list(map(int,input().split()))\r\ny=lst[1]\r\nx=lst[0]\r\nres=0\r\nba,bc,bd=y,y,y\r\nwhile True:\r\n\tif ba>=x and bb>=x and bc>=x:\r\n\t\tprint(res)\r\n\t\tbreak\r\n\tres+=1\r\n\tif res%3==0:\r\n\t\tba=bb+bc-1\r\n\tif res%3==1:\r\n\t\tbb=ba+bc-1\r\n\tif res%3==2:\r\n\t\tbc=bb+ba-1\r\n\r\n", "x,y=map(int,input().split())\r\na,b,c=y,y,y\r\nk=0\r\nwhile a!=x:a,b,c=sorted([min(x,b+c-1),b,c]);k+=1\r\nprint(k)", "x, y = map(int, input().split())\n\ncur = [y, y, y]\n\ncount = 0\nwhile cur[0] < x:\n cur[0] = cur[1] + cur[2] - 1\n cur.sort()\n count += 1\nprint(count)\n", "x, y = map(int, input().split())\na = [y, y, y]\ncount = 0\nwhile not all(map(lambda _: _ == x, a)):\n a[0] = min(a[1] + a[2] - 1, x)\n a.sort()\n count += 1\nprint(count)\n", "x,y=map(int,input().split())\na=b=c=y\nturn=0\nwhile(1):\n\tif(a>=x and b>=x and c>=x):\n\t\tprint(turn)\n\t\tbreak\n\telif(turn%3==0):\n\t\tc=a+b-1\n\telif(turn%3==1):\n\t\tb=a+c-1\n\telse:\n\t\ta=b+c-1\n\tturn+=1\n\n\t\t\n", "x, y = map(int, input().split())\n\na = [y]*3\nans = 0\n\nwhile True:\n a.sort()\n if a[0] >= x:\n break\n a[0] = a[1]+a[2]-1\n ans += 1\n\nprint(ans)", "x, y = map(int, input().split())\r\ncur = y, y, y\r\ncnt = 0\r\nwhile cur < (x, x, x):\r\n new = cur[1] + cur[2] - 1\r\n cur = cur[1], cur[2], new\r\n cnt += 1\r\nprint(cnt)\r\n", "n,m = map(int,input().split())\r\ns = [m,m,m]\r\nans = 0\r\nwhile s[0] < n:\r\n val = min(n,s[1]+s[2]-1)\r\n s[0] = s[1]\r\n s[1] = s[2]\r\n s[2] = val\r\n ans+=1\r\nprint(ans)\r\n\r\n", "a, b = map(int, input().split())\r\nif(a> b):\r\n a, b =b, a\r\n \r\nl = [a, a, a]\r\n# print(l)\r\nans = 0\r\nwhile(True):\r\n if(sum(l) == 3*b):\r\n break\r\n for i in range(3):\r\n if(l[i]<b):\r\n temp = sum(l)-l[i]\r\n l[i] = min(b, temp-1)\r\n ans +=1\r\n if(sum(l) == 3*b):\r\n break\r\n \r\n if(sum(l) == 3*b):\r\n break\r\n \r\nprint(ans)", "x,y=list(map(int,input().split()))\r\na,b,c,d=y,y,y,0\r\nwhile a!=x or b!=x or c!=x:\r\n if a<=b and a<=c:\r\n a=min(x,b+c-1)\r\n elif b<=a and b<=c:\r\n b=min(x,a+c-1)\r\n else:\r\n c=min(x,a+b-1)\r\n d+=1\r\nprint(d)", "s=input().split()\r\ntr=int(s[0])\r\ngl=int(s[1])\r\nlist=list(range(3))\r\nlist[0]=gl\r\nlist[1]=gl\r\nlist[2]=gl\r\nb=0\r\nwhile list[0]!=tr or list[1]!=tr or list[2]!=tr:\r\n if (list[1]+list[2]-1)>tr:\r\n if list[0]!=tr:\r\n list[0]=tr\r\n b+=1\r\n else:\r\n if list[0]!=tr:\r\n list[0]=list[1]+list[2]-1\r\n b+=1\r\n if (list[0]+list[2]-1)>tr:\r\n if list[1]!=tr:\r\n list[1]=tr\r\n b+=1\r\n else:\r\n if list[1]!=tr:\r\n list[1]=list[0]+list[2]-1\r\n b+=1\r\n if (list[0]+list[1]-1)>tr:\r\n if list[2]!=tr:\r\n list[2]=tr\r\n b+=1\r\n else:\r\n if list[2]!=tr:\r\n list[2]=list[0]+list[1]-1\r\n b+=1\r\nprint(b)\r\n", "x, y = [int(x) for x in input().split()]\r\n\r\nels = [y, y, y]\r\nans = 0\r\nwhile els != [x, x, x]:\r\n if els[0] + els[1] - 1 >= x:\r\n ans += 3\r\n break\r\n else:\r\n els[2] = els[0] + els[1] - 1\r\n ans += 1\r\n els.sort(reverse=True)\r\n\r\nprint(ans)\r\n", "a,b=input().strip().split(' ')\r\na,b=(int(a),int(b))\r\nl=[b,b,b]\r\nans=0\r\nwhile l!=[a,a,a]:\r\n l.sort()\r\n #print(l)\r\n l[0]=min(l[1]+l[2]-1,a)\r\n ans+=1\r\nprint(ans)", "x, y = list(map(int, input().split()))\r\nx, y = min(x, y), max(x, y)\r\na, b, c = x, x, x\r\nans = 0\r\nwhile (not a == b == c == y):\r\n a = min(b + c - 1, y)\r\n ans += 1\r\n if (not a == b == c == y):\r\n b = min(a + c - 1, y)\r\n ans += 1\r\n if (not a == b == c == y):\r\n c = min(a + b - 1, y)\r\n ans += 1\r\n else:\r\n break\r\n else:\r\n break\r\n \r\nprint(ans)", "def get_next(T):\r\n [a,b,c] = sorted(T)\r\n return [b,c,b+c-1]\r\n\r\nif __name__ == '__main__':\r\n y,x = [int(a) for a in input().split()]\r\n T = [x,x,x]\r\n # print(T)\r\n i = 0\r\n while max(T) < y:\r\n T = get_next(T)\r\n # print(T)\r\n i+=1\r\n\r\n print(2+i)", "# import math\nfrom collections import Counter, deque, defaultdict\nfrom math import *\n\nfrom bisect import bisect_right\nmod = 1000000007\n\n\n# from functools import reduce\n# from itertools import permutations\n# import queue\n\n\n\ndef solve():\n x, y = map(int, input().split())\n l = [y, y, y]\n l.sort()\n ans = 0\n while l[0] != x:\n l.pop(0)\n l.append(min(x, l[0] + l[1] - 1))\n l.sort()\n ans += 1\n print(ans)\n\n\n\n\n\n\n\n\n\n\n# t = int(input())\nt = 1\nfor num in range(t):\n # print(\"Case #{}: \".format(num + 1), end=\"\")\n solve()\n\t \t \t\t\t \t \t\t \t\t\t\t\t\t \t \t", "n, m=map(int, input().split())\r\nans=0\r\nt=[m]*3\r\nwhile t!=[n]*3:\r\n t=sorted(t[1:]+[min(t[1]+t[2]-1, n)])\r\n ans+=1\r\nprint(ans)", "n ,m = map(int,input().split())\r\ns = [m, m, m]\r\nans = 0\r\n\r\nwhile s[0] < n:\r\n temp = min(n, s[1] + s[2] - 1)\r\n s[0] = s[1]\r\n s[1] = s[2]\r\n s[2] = temp\r\n ans += 1\r\n \r\nprint(ans)", "x,y=map(int,input().split())\r\na=y\r\nb=y\r\nc=y\r\nst=0\r\nwhile(a!=x or b!=x or c!=x):\r\n if(st%3==0):\r\n a=min(x,b+c-1)\r\n st+=1\r\n elif(st%3==1):\r\n b=min(x,a+c-1)\r\n st+=1\r\n else:\r\n c=min(x,b+a-1)\r\n st+=1\r\nprint(st)", "s=input().split()\r\na=int(s[0])\r\nb=int(s[1])\r\ncount=0\r\ng=0\r\nC=list(range(3))\r\nC[0]=b\r\nC[1]=b\r\nC[2]=b\r\nwhile C[0]!=a or C[1]!=a or C[2]!=a:\r\n if C[1]+C[2]>a:\r\n C[0]=a\r\n count+=1\r\n g=C[2]\r\n C[2]=C[1]\r\n C[1]=C[0]\r\n C[0]=g\r\n else:\r\n C[0]=C[1]+C[2]-1\r\n count+=1\r\n g=C[2]\r\n C[2]=C[1]\r\n C[1]=C[0]\r\n C[0]=g\r\nprint(count) \r\n \r\n", "y, x = map(int, input().split())\r\narr = [x, x, x]\r\ncount = 0\r\nwhile True:\r\n if arr[0] >= y:\r\n break\r\n count += 1\r\n arr[0] = min(y, arr[1] + arr[2] - 1)\r\n arr.sort()\r\nprint(count) ", "\r\n\r\n\r\na,b=map(int,input().split())\r\nl1=[a,a,a]\r\nl2=[b,b,b]\r\nct=0\r\nif a==b:\r\n print(0)\r\nelse:\r\n while max(l2)!=a:\r\n l2.remove(min(l2))\r\n s=sum(l2)\r\n d=abs(l2[0]-l2[1])\r\n if d<a<s:\r\n l2.append(a)\r\n else:\r\n l2.append(s-1)\r\n ct+=1\r\n \r\n print(ct+2)", "x,y=[int(x) for x in input().split()]\r\na,b,c=y,y,y\r\nans=0\r\nwhile a<x and b<x and c<x:\r\n mini=min(a,b,c)\r\n if mini==a:\r\n a=b+c-1\r\n elif mini==b:\r\n b=a+c-1\r\n else:\r\n c=a+b-1\r\n ans+=1\r\nprint(ans+2)", "initial, final = map(int, input().split())\r\narr = [final] * 3\r\nans = 0\r\nwhile sum(arr) < 3*initial:\r\n\tarr.sort()\r\n\tarr[0] = min(initial, arr[1]+arr[2] - 1)\r\n\tans += 1\r\nprint(ans)", "x, y = map(int, input().split())\r\na = b = c = y\r\n\r\nans = 0\r\n\r\nwhile min(a, b, c) != x:\r\n arr = list(sorted([a, b, c]))\r\n arr[0] = min(x, arr[1] + arr[2] - 1)\r\n a, b, c = arr\r\n ans += 1\r\n\r\nprint(ans)\r\n", "#!/usr/bin/env python3.5\r\nimport sys\r\n\r\ndef read_data():\r\n return map(int, next(sys.stdin).split())\r\n\r\n\r\ndef solve(f, t):\r\n if f > t:\r\n f, t = t, f\r\n if f == t:\r\n return 0\r\n a, b, c = f, f, f \r\n count = 0\r\n while a < t:\r\n c = min(a + b - 1, t)\r\n c, b, a = sorted((a, b, c))\r\n count += 1\r\n #print(a, b, c)\r\n if b < t:\r\n #print(t, t, c)\r\n count += 1\r\n if c < t:\r\n #print(t, t, t)\r\n count += 1\r\n return count\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n f, t = read_data()\r\n print(solve(f, t))\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nx, y = [int(x) for x in input().split()]\r\n\r\na = b = c = y\r\ncnt = 0\r\nwhile a < x:\r\n a, b, c = b, c, b+c-1\r\n cnt += 1\r\nprint(cnt)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nx,a=map(int,input().split())\nb=c=a\ns=0\nwhile x>a:\n\ta,b,c=b,c,b-1+c\n\ts+=1\nprint(s)\n", "x,y = map(int,input().split())\r\nans = 0\r\na=b=c=y\r\nwhile not (a>=x and b>=x and c>=x):\r\n if ans%3==0:\r\n a = b+c-1\r\n elif ans%3==1:\r\n b = a+c-1\r\n else:\r\n c = a+b-1\r\n ans += 1\r\nprint(ans)", "x=input().split()\r\nx[0], x[1]=int(x[0]), int(x[1])\r\ny = [x[1]]*3\r\nc = 0;\r\nwhile (y[2]<x[0]):\r\n y[0],y[1],y[2] = y[1],y[2],y[1]+y[2]-1\r\n c+=1\r\nc+=2\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nl=[b,b,b]\r\nk=0\r\nwhile l[0]!=a or l[1]!=a or l[2]!=a :\r\n l[0]=min(a,l[2]+l[1]-1)\r\n \r\n l=sorted(l)\r\n k+=1\r\n\r\nprint(k)\r\n", "x, y = map(int, input().split())\r\nx, y = y, x\r\nA = x\r\nB = x\r\ncurr = x\r\ncount = 0\r\nwhile curr < y:\r\n\tcurr = B + A - 1\r\n\tA, B = B, curr\r\n\tcount += 1\r\ncount += 2\r\nprint(count)\r\n", "x, y = map(int, input().split())\nassert y < x\n\nit = 0\n\na, b, c = y, y, y\nwhile True:\n assert a >= c >= b\n assert a + b > c\n assert a + c > b\n assert b + c > a\n\n b = a + c - 1\n\n assert a + b > c\n assert a + c > b\n assert b + c > a\n\n it += 1\n if b >= x:\n b = x\n break\n a, b, c = b, c, a\n\nb = x\nit += 1\nassert a + b > c\nassert a + c > b\nassert b + c > a\n\nc = x\nit += 1\nassert a + b > c\nassert a + c > b\nassert b + c > a\n\nprint(it)\n", "n,k=map(int,input().split())\r\nx=k \r\ny=k \r\nz=k \r\nturns=0 \r\nwhile True:\r\n if x>=n and y>=n and z>=n:\r\n print(turns)\r\n break \r\n turns+=1 \r\n if turns%3==1:\r\n x=y+z-1 \r\n if turns%3==2:\r\n y=z+x-1 \r\n if turns%3==0:\r\n z=x+y-1 \r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx, y = map(int, input().split())\r\nu = [y] * 3\r\nans = 0\r\nwhile not u[0] == u[1] == u[2] == x:\r\n ans += 1\r\n i = u.index(min(u))\r\n u[i] = min(x, u[i - 1] + u[i - 2] - 1)\r\nprint(ans)", "read=input()\nread=read.split(\" \")\na=[0]*4\nn=int(read[0])\nm=int(read[1])\na[1]=m\na[2]=m\na[3]=m\ndef mysort():\n\tfor i in range(1,4):\n\t\tfor j in range(i,4):\n\t\t\tif a[i]>a[j]:\n\t\t\t\ta[i],a[j]=a[j],a[i]\n\treturn\ndef getans():\n\tt=0\n\tif n==m:\n\t\treturn 0\n\twhile 0==0:\n\t\tmysort();\n\t\tt=t+1;\n\t\tif a[2]+a[3]-1<=n :\n\t\t\ta[1]=a[2]+a[3]-1\n\t\telse:\n\t\t\ta[1]=n\n\t\tif a[1]==n and a[2]==n and a[3]==n:\n\t\t\treturn t\n\treturn 0;\nprint(getans())", "x, a = map(int, input().split())\nb = c = a\nres = 0\nwhile a < x:\n a, b, c = b, c, b + c - 1\n res += 1\nprint(res)\n", "def get_next(T):\n [a,b,c] = sorted(T)\n return [b,c,b+c-1]\n\ndef main():\n y,x = [int(s) for s in input().split()]\n T = [x,x,x]\n i = 0\n while max(T) < y:\n T = get_next(T)\n i += 1\n print(2+i)\n\nmain()\n", "x,y=map(int,input().split())\r\na,b,c,r=y,y,y,0\r\nwhile c<x: a,b,c,r=b,c,b+c-1,r+1\r\nprint(r+2)", "from math import *\r\n\r\ndef solve(a,b):\r\n\tif(a[0]==b):\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn solve([a[1],a[2],min(b,a[1]+a[2]-1)],b)+1\r\n\r\na,b=(int(z) for z in input().split())\r\nif a>b:\r\n\ta,b=b,a\r\nprint(solve([a,a,a],b))", "x,y = map(int,input().split())\r\nif x//2<y:\r\n print(3)\r\nelse:\r\n lis=[y]*3\r\n c=0\r\n while max(lis)<x:\r\n a=lis[1]+lis[2]\r\n lis.sort()\r\n lis[0]=a-1\r\n lis.sort()\r\n# print(lis)\r\n c+=1\r\n print(c+2)\r\n\r\n\r\n", "import sys,os,io\r\nfrom sys import stdin\r\nfrom functools import cmp_to_key\r\nfrom bisect import bisect_left , bisect_right\r\nfrom collections import defaultdict\r\ndef ii():\r\n return int(input())\r\ndef li():\r\n return list(map(int,input().split()))\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\n# else:\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef fun(a,x):\r\n if min(a)>=x:\r\n return 1\r\n return 0\r\nfor _ in range(1):\r\n x,y = li()\r\n a=[y,y,y]\r\n f = 0\r\n cnt=0\r\n while(fun(a,x)==0):\r\n if f==0:\r\n # y+a,y,y \r\n # y+a<y+y \r\n sum2 = a[1]+a[2]-a[0]\r\n a[0]+=sum2-1\r\n elif f==1: \r\n sum2 = a[0]+a[2]-a[1]\r\n a[1]+=sum2-1\r\n else:\r\n sum2 = a[1]+a[0]-a[2]\r\n a[2]+=sum2-1\r\n f+=1\r\n f%=3\r\n cnt+=1\r\n print(cnt)", "\r\n \r\nline1=input().split()\r\nx=int(line1[0])\r\ny=int(line1[1])\r\n\r\n\r\na,b,c=y,y,y\r\nsteps=0\r\nwhile (a<x or b<x or c<x):\r\n a=b+c-1\r\n steps+=1\r\n a,b,c=min(a,b,c), a+b+c-max(a,b,c)-min(a,b,c), max(a,b,c)\r\n \r\nprint (steps)\r\n", "\"\"\"\n@author: wangquaxiu\n@time: 2020/2/23 18:04\n\"\"\"\n\nx,y = input().split()\n\nx = int(x)\ny = int(y)\na = [y,y,y]\ncount = 0\nr = 2\nwhile(True):\n a[r] = a[r-1]+a[r-2]-1\n count+=1\n if(min(a) >= x):\n break\n r = (r+1)%3\n\nprint(count)\n\n\n \t \t \t\t \t\t\t \t\t \t \t \t\t\t", "s, e = map(int,input().split())\r\na = [e] * 3\r\nans = 0\r\nsum = 0\r\nwhile sum != 2:\r\n temp = a[1] + a[2]\r\n if temp - 1 >= s:\r\n a[0] = s\r\n sum += 1\r\n else:\r\n a[0] = temp - 1\r\n a.sort()\r\n ans += 1\r\nprint(ans + 1)", "t, f = map(int, input().split())\r\ns = [f] * 3\r\ncount = 0\r\nwhile sum(s) < 3*t:\r\n\ts.sort()\r\n\ts[0] = min(t, s[1]+s[2] - 1)\r\n\tcount += 1\r\nprint(count)\r\n", "s = input()\r\nx = int(s.split()[0])\r\ny = int(s.split()[1])\r\na = [0] * 25\r\na[0] = y\r\na[1] = 2 * y - 1\r\nans = 0\r\nfor i in range(2, 25):\r\n if x <= a[i - 1]:\r\n ans = i + 1\r\n break\r\n a[i] = a[i - 1] + a[i - 2] - 1\r\nprint(ans)\r\n", "def solve(x: int, y: int) -> int:\r\n s1 = s2 = s3 = y\r\n time = 0\r\n while s1 < x:\r\n s1 = min(s2 + s3 - 1, x)\r\n s1, s2, s3 = sorted([s1, s2, s3])\r\n time += 1\r\n return time\r\n \r\nx, y = list(map(int, input().split()))\r\nprint(solve(x, y))", "x, y = map(int, input().split())\r\na, b, c, r = y, y, y, 0\r\nwhile c < x: a, b, c, r = b, c, b + c - 1, r + 1\r\nprint(r + 2)", "x, y = list(map(int, input().split()))\r\nar = [y, y, y]\r\ni = 0\r\nwhile ar[0] < x or ar[1] < x or ar[2] < x:\r\n if ar[0] >= ar[1] <= ar[2]:\r\n ar[1] = ar[0] + ar[2] - 1\r\n elif ar[0] >= ar[2] <= ar[1]:\r\n ar[2] = ar[0] + ar[1] - 1\r\n elif ar[1] >= ar[0] <= ar[2]:\r\n ar[0] = ar[1] + ar[2] - 1\r\n i += 1\r\nprint(i)", "x,y = map(int,input().split())\r\na = [y, y, y]\r\nans = 0\r\nwhile True:\r\n a.sort()\r\n # print(a)\r\n # print()\r\n if a[0] == x and a[2] == x:\r\n break\r\n ans+=1\r\n maxVal = a[1] + a[2] - 1\r\n minVal = a[2] - a[1] + 1\r\n if x >= maxVal:\r\n a[0] = maxVal\r\n else:\r\n a[0] = x\r\n \r\nprint(ans)", "x, y = map(int, input().split())\r\ntemp = [y]*3\r\nk = y\r\ncnt = 0\r\nwhile k != x:\r\n temp.sort()\r\n temp[0] = min(temp[1]+temp[2]-1, x)\r\n k = min(temp)\r\n cnt += 1\r\nprint(cnt)\r\n", "def solve(n,m):\r\n a=[m,m,m];c=0\r\n while a[-1]+a[-2]-1<n:\r\n a[0]=a[-1]+a[-2]-1;c+=1;a.sort()\r\n return c+3\r\nn,m=map(int,input().split());print(solve(n,m))\r\n", "x,y=map(int,input().split())\r\na,b,c=y,y,y\r\nturn=0\r\nwhile True:\r\n if a>=x and b>=x and c>=x:\r\n print(turn)\r\n break\r\n if turn%3==0:\r\n a=b+c-1\r\n elif turn%3==1:\r\n b=c+a-1\r\n else:\r\n c=a+b-1\r\n turn+=1", "\r\nif __name__ == '__main__':\r\n\tx, y = map(int, input().split())\r\n\ta, b, c = y, y, y\r\n\tsteps = 0\r\n\twhile(a < x):\r\n\t\t#print(a, b, c)\r\n\t\ta, b, c = b, c, min(x, b+c-1)\r\n\t\tsteps += 1\r\n\tprint(steps)", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\na=y\r\nb=y\r\nc=y\r\nz=1\r\nans=0\r\nwhile True:\r\n if z==1:\r\n a=b+c-1\r\n z+=1\r\n ans+=1\r\n if a>=x:\r\n break\r\n elif z==2:\r\n b=c+a-1\r\n z+=1\r\n ans+=1\r\n if b>=x:\r\n break\r\n else:\r\n c=a+b-1\r\n z=1\r\n ans+=1\r\n if c>=x:\r\n break\r\nprint(ans+2)\r\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\n# from bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\n\r\nl = gil()\r\nl.sort()\r\nt = [l[0]]*3\r\nans = 0\r\nwhile t[0] != l[1]:\r\n t[0] = min(l[1], sum(t[1:])-1)\r\n t.sort()\r\n ans += 1\r\n\r\n\r\nprint(ans)\r\n", "x, y = [int(i) for i in input().split()]\r\nif x > y:\r\n t = x\r\n x = y\r\n y = t\r\na = [x, x, x]\r\nans = 0\r\nwhile a[0] != y or a[1] != y or a[2] != y:\r\n a[0] = min(a[1] + a[2] - 1, y)\r\n a.sort()\r\n ans += 1\r\nprint(ans)", "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\nINF = 10**20\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\nfrom math import gcd\r\nfrom math import ceil\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\nr, l = I()\r\na = [l, l, l]\r\nans = 0\r\nwhile a[-1] != r or a[0] != r:\r\n x = a[1] + a[2]\r\n a[0] = min(r, x - 1) \r\n a.sort()\r\n ans += 1\r\nprint(ans)", "from sys import stdin\r\nn,m=map(int,stdin.readline().strip().split())\r\nx=[m,m,m]\r\nans=0\r\nwhile not (x[0]>=n and x[1]>=n and x[2]>=n):\r\n ans+=1\r\n x.sort()\r\n y=x[1]+x[2]-1\r\n x[0]=y\r\n \r\nprint(ans)\r\n", "def miis():\r\n return map(int, input().split())\r\n\r\ny, x = miis()\r\nhave = [x, x, x]\r\nans = 0\r\nwhile have != [y, y, y]:\r\n have[0] = min(have[1]+have[2]-1, y)\r\n ans += 1\r\n have.sort()\r\nprint(ans)\r\n", "def exists(a, b, c):\r\n return a < b + c and b < a + c and c < a + b\r\n\r\nx, y = [int(i) for i in input().split()]\r\na, b, c = y, y, y\r\ncount = 0\r\nwhile a != x or b != x or c != x:\r\n a, b, c = sorted([a, b, c])\r\n a = x if exists(x, b, c) else b + c - 1\r\n count += 1\r\n \r\nprint(count)", "from sys import stdin\n\nif __name__ == '__main__':\n x, y = map(int, stdin.readline().rstrip().split())\n a = b = c = y\n count = 0\n while a < x:\n temp = b + c -1\n a = b\n b = c\n c = temp\n count += 1\n print(count)", "x,y=map(int,input().split())\r\nt=0\r\nba=y\r\nbb=y\r\nbc=y\r\nwhile True:\r\n if (ba >= x and bb >= x and bc >= x):\r\n print(t)\r\n break\r\n t+=1\r\n if t%3==1:\r\n ba = bb + bc - 1\r\n if t % 3 == 2:\r\n bb = ba + bc - 1\r\n if t%3==0:\r\n bc = ba + bb - 1\r\n", "\r\n# (a[0], a[1], a[2]) => (y, y, y)\r\ndef triangle(a, y, prt=False):\r\n if min(a) >= y:\r\n return 0\r\n elif a[1] + a[2] - 1 >= y:\r\n return triangle([a[1], a[2], y], y) + 1\r\n else:\r\n return triangle([a[1], a[2], a[1] + a[2] - 1], y) + 1\r\n\r\ndef main():\r\n x, y = list(map(int, input().split(' ')))\r\n print(triangle([y, y, y], x))\r\n\r\nif __name__ == '__main__':\r\n main()", "a = input().split()\r\ns = 0\r\ni = j = k = int(a[1])\r\nwhile i <= int(a[0]):\r\n s += 1\r\n k = j\r\n j = i\r\n i = i + k - 1\r\nprint(s + 2)", "y, x = map(int, input(). split())\r\na = x; b = x; c = x; k = 0\r\nwhile a < y or b < y or c < y:\r\n if a < c+b-1:\r\n a = c+b-1\r\n k += 1\r\n if a >= y and b >= y and c >= y:\r\n break\r\n if b < a+c-1:\r\n b = a+c-1\r\n k += 1\r\n if a >= y and b >= y and c >= y:\r\n break\r\n if c < a+b-1:\r\n c = a+b-1\r\n k += 1\r\n if a >= y and b >= y and c >= y:\r\n break\r\nprint(k)\r\n", "def solve(a,b):\r\n v=[b,b,b]\r\n ans=0\r\n while v[0]!=a:\r\n ans+=1\r\n v.sort()\r\n v[0]=v[1]+v[2]-1\r\n v[0]=min(v[0],a)\r\n ans+=2\r\n return ans\r\n\r\na,b=map(int,input().split())\r\nprint(solve(a,b))\r\n", "def main():\n x, y = map(int, input().split())\n if x > y:\n x, y = y, x\n a = b = c = x\n res = 0\n while a < y:\n a, b, c = b, c, b + c - 1\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "x, y = map(int, input().split())\r\n\r\nans = 1\r\n\r\nsides = [y]*3\r\n\r\nwhile sides[-1] < x:\r\n ans += 1\r\n sides[2] = min(sides[0] + sides[1] - 1, x)\r\n sides = sorted(sides, reverse=True)\r\n\r\nprint(ans-1)", "x,y=map(int,input().split())\r\nbesta=y\r\nbestb=y\r\nbestc=y\r\ntime=0\r\nwhile True:\r\n if besta>=x and bestb>=x and bestc>=x:\r\n print(time)\r\n break\r\n time+=1\r\n if time%3==1:\r\n besta=bestb+bestc-1\r\n elif time%3==2:\r\n bestb=besta+bestc-1\r\n elif time%3==0:\r\n bestc=besta+bestb-1\r\n #print(\"Status \"+str(besta)+\" \"+str(bestb)+\" \"+str(bestc))", "x, y = map(int, input().split())\na, b, c = y, y, y\nans = 0\nwhile a < x:\n a, b, c = b, c, b + c - 1\n ans += 1\nprint(ans)", "def increase_triangle_side(first_side, second_side, third_side, count_increas_times, ending_length):\n count_increas_times += 1\n if first_side > second_side:\n first_side, second_side = second_side, first_side\n if first_side > third_side:\n first_side, third_side = third_side, first_side\n\n first_side = second_side + third_side - 1\n\n # print(first_side, second_side, third_side)\n\n if first_side > ending_length and second_side > ending_length and third_side > ending_length:\n return count_increas_times\n else:\n return increase_triangle_side(first_side, second_side, third_side, count_increas_times, ending_length)\n\n\ndef counting_changing_times():\n x, y = map(int, input().split())\n changing_times = increase_triangle_side(y, y, y, 0, x)\n print(changing_times)\n\n\ncounting_changing_times()\n", "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\nx,y = map(int,input().split())\r\nsp = [y,y,y]\r\nsp.sort()\r\nans = 0\r\nwhile sp[0]!=x:\r\n k = sp.pop(0)\r\n sp.append(min(x,sp[0]+sp[1]-1))\r\n sp.sort()\r\n ans+=1\r\nprint(ans)\r\n", "def solve(x, y):\n A = [y]*3\n k = 0\n while A[0] != x:\n k += 1\n A[0] = min(A[1] + A[2] - 1, x)\n A.sort()\n\n return k\n\nx, y = map(int, input().split())\nprint(solve(x, y))\n", "[x, y] = [int(x) for x in input().split()]\na, b, c = y, y, y\n\nres = 0\nwhile a != x or b != x or c != x:\n res += 1\n minimum = min(a, b, c)\n if a == minimum:\n a = min(b+c-1, x)\n elif b == minimum:\n b = min(a+c-1, x)\n else:\n c = min(a+b-1, x)\n\nprint(res)", "x, y = list(map(int, input().split(' ')))\r\na = b = y\r\nans = 0\r\nwhile b < x:\r\n a, b = b, a + b - 1\r\n ans += 1\r\nprint(ans + 2)", "a, b = input().split()\r\nx = int(a)\r\ny = int(b)\r\nx_v = [y, y, y]\r\nresult = 0\r\nwhile (x_v[0] != x) or (x != x_v[1] ) or (x != x_v[2]):\r\n x_v.sort()\r\n x_v[0] = min(x, x_v[1] + x_v[2] - 1)\r\n result += 1\r\nprint(result)\r\n ", "def f(n, m):\r\n ans=0\r\n t=[m]*3\r\n while t!=[n]*3:\r\n t=sorted(t[1:]+[min(t[1]+t[2]-1, n)])\r\n ans+=1\r\n return ans\r\ndef g(n, m):\r\n ans=0\r\n t=[n]*3\r\n while t!=[m]*3:\r\n t=sorted(t[:2]+[max(t[1]-t[0]+1, m)])\r\n ans+=1\r\n return ans\r\nn, m=map(int, input().split())\r\nprint(min(f(n, m), g(n, m)))", "n ,m=map(int,input().split())\r\na,b,c= m,m,m\r\ncou =0\r\nif(n==m):\r\n print(0)\r\n exit()\r\nwhile(True):\r\n if(a<b):\r\n if(a<c):\r\n a = min(b+c-1,n)\r\n else:\r\n c= min(a+b-1,n)\r\n else:\r\n if(b<c):\r\n b=min(a+c-1,n)\r\n else:\r\n c= min(a+b-1,n)\r\n cou+=1\r\n if(a==n and b==n and c==n):\r\n break\r\nprint(cou)\r\n", "x,y=[int(x) for x in input().split()]\r\na=[y,y,y]\r\nc=0\r\nwhile(True):\r\n a.sort()\r\n if(a[2]+a[1]>x):\r\n break\r\n a[0]=a[1]+a[2]-1\r\n c+=1\r\nprint(c+3)", "import sys\r\ninput = sys.stdin.readline \r\n\r\nx, y = map(int, input().split()) \r\na = b = c = y\r\nans = 0\r\nwhile(x > a):\r\n a, b, c = b, c, b + c - 1\r\n ans += 1 \r\nprint(ans)", "# import functools\r\n# import math\r\n# import random\r\n# from collections import defaultdict,deque\r\n# from heapq import heapify,heappop,heappush\r\n# import bisect\r\n# from collections import Counter\r\n# import collections\r\n# from functools import lru_cache\r\n# import time\r\n# from typing import List\r\n# from math import log\r\n# from random import randint,seed\r\n# from time import time\r\n# import os,sys\r\n# from io import BytesIO, IOBase\r\n# \r\n# # Fast IO Region\r\n# BUFSIZE = 8192\r\n# class FastIO(IOBase):\r\n# newlines = 0\r\n# def __init__(self, file):\r\n# self._fd = file.fileno()\r\n# self.buffer = BytesIO()\r\n# self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n# self.write = self.buffer.write if self.writable else None\r\n# def read(self):\r\n# while True:\r\n# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n# if not b:\r\n# break\r\n# ptr = self.buffer.tell()\r\n# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n# self.newlines = 0\r\n# return self.buffer.read()\r\n# def readline(self):\r\n# while self.newlines == 0:\r\n# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n# self.newlines = b.count(b\"\\n\") + (not b)\r\n# ptr = self.buffer.tell()\r\n# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n# self.newlines -= 1\r\n# return self.buffer.readline()\r\n# def flush(self):\r\n# if self.writable:\r\n# os.write(self._fd, self.buffer.getvalue())\r\n# self.buffer.truncate(0), self.buffer.seek(0)\r\n# class 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# sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n# input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n[x,y]=list(map(int,input().split()))\r\ncur=[y]*3\r\nans=[x]*3\r\ncnt=0\r\nwhile cur!=ans:\r\n #low=max(cur[1]-cur[0]+1,y)\r\n cur=cur[1:]+[min(cur[1]+cur[2]-1,x)]\r\n cnt+=1\r\nprint(cnt)", "y, x = map(int, input().split())\ndef f(a):\n a = sorted(a)\n if a[0] == y:\n return 0\n a[0] = min(sum(a[1:]) - 1, y)\n return 1 + f(a)\nprint(f([x, x, x]))\n", "s, t = map(int, input().split())\r\n\r\ns = [s, s, s]\r\nt = [t, t, t]\r\n\r\nit = 0\r\ni = 0\r\n\r\nwhile s[i] != t[i]:\r\n t[i] = min(s[i], t[(i+1)%3] + t[(i+2)%3] - 1)\r\n it += 1\r\n i = (i+1)%3\r\n\r\nprint(it)\r\n", "x, y = map(int, input().split())\nl = [y, y, y]\n\n\ndef arg():\n argmax = 0\n argmin = 0\n for i in range(1, 3):\n if l[i] > l[argmax]:\n argmax = i\n if l[i] < l[argmin]:\n argmin = i\n if argmax == argmin:\n argmax = 0\n argmin = 1\n tmp = [0, 1, 2]\n tmp.remove(argmax)\n tmp.remove(argmin)\n return (argmin, tmp[0], argmax)\n\ncnt = 0\nwhile l[0] != x or l[1] != x or l[2] != x:\n args = arg()\n l[args[0]] = min(x, l[args[2]] + l[args[1]] - 1)\n cnt += 1\nprint(cnt)\n", "y,x = list(map(int,input().split()))\r\n\r\na = [x,x,x]\r\nres = 0\r\n\r\nwhile a[0] < y:\r\n\ta[0] = a[1] + a[2] - 1\r\n\ta.sort()\r\n\tres += 1\r\nprint(res)", "def devolution(a, b):\r\n lst, result = [b] * 3, 0\r\n while lst != [a] * 3:\r\n lst.sort()\r\n lst[0] = min(lst[1] + lst[2] - 1, a)\r\n result += 1\r\n return result\r\n\r\n\r\nx, y = [int(i) for i in input().split()]\r\nprint(devolution(x, y))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y = map(int, input().split())\r\nc = 0\r\na = [y, y, y]\r\nwhile a[1] + a[2] <= x:\r\n a[0] = a[1] + a[2] - 1\r\n a = a[1:] + [a[0]]\r\n c += 1\r\nprint(c+3)", "m, n = map(int, input().split())\r\nif m < n:\r\n m, n = n, m\r\n## x x x\r\n## y x x\r\n## y x - y + 1 x\r\nans = 0\r\na, b, c = n, n, n\r\nwhile a != m or b != m or c != m:\r\n a = min(b + c - 1,m)\r\n s = sorted([a,b,c])\r\n a,b,c = s[0],s[1],s[2]\r\n ans += 1\r\nprint(ans)", "x,y=list(map(int,input().split()))\r\na=[y,y,y]\r\nc=0\r\nwhile 1>0:\r\n if x<=(a[0]+a[1]-1):\r\n print(c+3)\r\n break\r\n else:\r\n a[-1]=a[0]+a[1]-1\r\n c+=1\r\n a.sort(reverse=True)", "x, a = map(int, input().split())\r\nc = b = a\r\ni = 0\r\nwhile a < x:\r\n [a,b,c] = sorted([b,c,c+b-1])\r\n i+=1\r\nprint(i)" ]

[ "ans = 1\nn = int(input())\n\nfor i in range(5,0,-1):\n ans*=n\n n-=1\n\nans = (ans**2)//120\nprint(ans)\n\n\n\t \t \t \t\t \t\t \t \t \t", "from math import comb\n\nfac_5 = 120\nn = int(input())\n\nplacement_possib = n * (n - 1) * (n - 2) * (n - 3) * (n - 4)\ntotal = comb(n, 5) * placement_possib\n\nprint(total)\n\n\t \t\t\t \t \t\t\t\t\t\t\t \t\t \t\t\t", "def factorial(n):\r\n if n==0:return 1\r\n res=1\r\n for i in range(1,n+1):res*=i\r\n return res\r\ndef comb(n,r):\r\n return factorial(n)//(factorial(n-r)*120)\r\nn=int(input())\r\nval1=comb(n,5)\r\nval2=factorial(n)//factorial(n-5)\r\nprint(val1*val2)", "import math\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n ans = (n * (n - 1) * (n - 2) * (n - 3) * (n - 4)) // 120\r\n ans = ans * (n * (n - 1) * (n - 2) * (n - 3) * (n - 4))\r\n print(ans)", "import math\r\nn = int(input())\r\n \r\nprint(math.comb(n, 5) * math.comb(n, 5) * 120)", "from math import factorial\r\n\r\n\r\nn = int(input())\r\na = n*(n-1)*(n-2)*(n-3)*(n-4)\r\nprint(a*a//120)", "n = int(input())\nprint(((n * (n - 1) * (n - 2) * (n - 3) * (n - 4))**2)//120)\n \t\t\t\t \t \t\t\t \t\t\t \t \t\t\t\t", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\nans=1\r\nfor i in range(n-4,n+1):\r\n ans*=i\r\nprint(ans*ans//120)", "fact5 = 120\n\nn = int(input())\nans = n*(n-1)*(n-2)*(n-3)*(n-4)\nprint(ans*ans//fact5)\n \t\t \t\t \t \t \t\t\t\t\t\t\t \t\t\t", "from math import comb\r\n\r\nfac_5 = 120\r\nn = int(input())\r\n\r\nplacement_possib = n * (n - 1) * (n - 2) * (n - 3) * (n - 4)\r\ntotal = comb(n, 5) * placement_possib\r\n\r\nprint(total)\r\n", "import math\r\n\r\nn = int(input())\r\n\r\nseen = dict()\r\ndef poss(remaining, column):\r\n if (remaining, column) in seen:\r\n return seen[(remaining, column)]\r\n global n\r\n if remaining == 0:\r\n seen[(remaining, column)] = 1\r\n return 1\r\n if column == n and remaining != 0:\r\n seen[(remaining, column)] = 0\r\n return 0\r\n seen[(remaining, column)] = poss(remaining - 1, column + 1) * (n + remaining - 5) + poss(remaining, column + 1)\r\n return poss(remaining - 1, column + 1) * (n + remaining - 5) + poss(remaining, column + 1)\r\n\r\n\r\nprint(poss(5, 0)) ", "n = int(input())\r\nresult = 1\r\n\r\nresult= n*n*(n-1)*(n-1)*(n-2)*(n-2)*(n-3)*(n-3)*(n-4)*(n-4)//120\r\n\r\nprint(result)\r\n", "n = int(input())\r\n\r\nprint(((n * (n - 1) * (n - 2) * (n- 3) * (n - 4)) ** 2) // 120)", "\r\nans = 1\r\nn = int(input())\r\n\r\nfor i in range(5,0,-1):\r\n ans*=n\r\n n-=1\r\n\r\nans = (ans**2)//120\r\nprint(ans)\r\n\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 16/08/2023 16:02:56 Hanoi, Vietnam\r\n# **/\r\n\r\nsq = lambda x : x**2\r\n\r\nn = int(input())\r\n\r\nprint(sq(n) * sq(n-1) * sq(n-2) * sq(n-3) * sq(n-4) // 120)", "n = int(input())\nbancos = 5\nvalor = n\nfor i in range(1, bancos):\n valor *= n - i\n\nprint(valor**2 // 120)\n\t\t\t \t\t\t\t \t\t\t\t \t\t \t\t\t\t \t\t\t\t", "from decimal import Decimal\n\nn = int(input())\n\nres = n * n\nfor num in range(n - 1, n - 5, -1):\n res *= num * num\n\nprint(int(Decimal(f\"{res}\") / Decimal(\"120\")))\n\n\n402852449038723328\n402852449038723320\n", "imported_math = __import__(\"math\")\r\nresult = imported_math.perm(int(input()), 5) ** 2 // 120\r\nprint(result)\r\n", "import math\r\n\r\nn = int(input())\r\nbancos = 5\r\nvalor = n\r\nfor i in range(1, bancos):\r\n valor *= n - i\r\n\r\nprint(valor**2 // 120)\r\n", "from math import comb, factorial\r\nn = int(input())\r\nd = n * n\r\nans = 1\r\nfor i in range(5):\r\n ans *= d\r\n d -= 2 * n - 1\r\n n -= 1\r\nprint(ans // factorial(5))", "n = int(input())\r\nprint(n**2*(n-1)**2*(n-2)**2*(n-3)**2*(n-4)**2//120)", "def C(u, d) -> int:\r\n\tret, i, j = 1, u, 1\r\n\twhile j <= d:\r\n\t\tret = ret * i // j\r\n\t\ti -= 1; j += 1\r\n\treturn ret\r\n\r\nn = int(input())\r\n\r\nprint(C(n, 5) * n * (n - 1) * (n - 2) * (n - 3) * (n - 4))", "def fact(n):\r\n f = [1,1]\r\n for i in range(2,n+1):\r\n last = f[i-1]\r\n f.append((i*last))\r\n return f\r\n\r\ndef C(n,k,f):\r\n fn = f[n]\r\n fk = f[k]\r\n fnk = f[n-k]\r\n return fn // (fk * fnk)\r\n\r\ndef P(n,r,f):\r\n fn = f[n]\r\n fnr = f[n-r]\r\n return fn // fnr\r\n\r\nn = int(input())\r\nnumBenches = 5\r\nf = fact(5)\r\ncount = 1\r\nfor i in range(n,n-numBenches,-1):\r\n count *= i ** 2\r\ncount = count // f[numBenches]\r\nprint(count)" ]

[ "def number_sum(number):\r\n number = str(number)\r\n num_sum = 0\r\n for elem in number:\r\n num_sum += int(elem)\r\n return num_sum\r\n\r\ndef main():\r\n a,b,c = map(int,input().split())\r\n answers = []\r\n for i in range(1,82):\r\n if 0<b*i**a+c<10**9 and number_sum(b*i**a+c) == i:\r\n answers.append(b*i**a+c)\r\n print(len(answers))\r\n print(*answers)\r\nif __name__ == '__main__':\r\n main()", "import sys\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n a, b, c = ac.read_ints()\r\n ans = []\r\n for s in range(1, 82):\r\n x = b * s**a + c\r\n if 0 < x < 10**9 and sum(int(w) for w in str(x)) == s:\r\n ans.append(x)\r\n ac.st(len(ans))\r\n ans.sort()\r\n ac.lst(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "from sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\na,b,c=inp()\r\narr=[]\r\nfor i in range(1,82):\r\n x=b*(i**a)+c\r\n n=0\r\n w=x\r\n while w >0:\r\n n+=w%10\r\n w//=10\r\n if i==n and x<10**9:\r\n arr.append(x)\r\nprint(len(arr))\r\nprint(*arr)\r\n\r\n\r\n ", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, 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 def get_num(num):\r\n res = 0\r\n while num > 0:\r\n res += num % 10\r\n num = num // 10\r\n return res\r\n\r\n a, b, c = map(int, input().split())\r\n ans = []\r\n for i in range(1, 82):\r\n res = b * i**a + c\r\n if res > 0 and res < 10**9 and get_num(res) == i:\r\n ans.append(res)\r\n print(len(ans))\r\n if len(ans) > 0:\r\n print(*ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# 460/B\r\ndef sum_digits(x):\r\n return sum(map(int, str(x)))\r\n\r\ndef find_x():\r\n a, b, c = map(int, input().split())\r\n lst = []\r\n for sum_x in range(1, 82):\r\n x = b * (sum_x**a) + c\r\n if 0 < x < 1000_000_000 and sum_digits(x) == sum_x: \r\n lst.append(x)\r\n \r\n print(len(lst))\r\n if lst:\r\n print(' '.join(map(str, lst)))\r\nfind_x()", "def sum_digits(x):\r\n return sum(map(int, str(x)))\r\n\r\ndef find_x():\r\n a, b, c = map(int, input().split())\r\n lst = [x for sum_x in range(1, 82) if \r\n 0 < (x := b * (sum_x**a) + c) < 10**9 and sum_digits(x) == sum_x]\r\n print(len(lst))\r\n if lst:\r\n print(*lst)\r\n\r\nif __name__ == '__main__':\r\n find_x()\r\n", "a, b, c= map(int,input().split())\r\n\r\nsolutions= 0\r\nx=''\r\nfor s in range(1,81+1):\r\n equation= s**a*b+c\r\n if equation> 0 and equation< 10**9 and s== sum(d for d in map(int,str(equation))):\r\n x+=str(equation)+' '\r\n solutions+=1\r\n\r\nprint(solutions)\r\n\r\nif x!='': print(x)", "a, b, c = map(int, input().split())\r\nsol = []\r\nfor s in range(82):\r\n x = b * s ** a + c\r\n if 0 < x < 10**9 and sum(map(int, str(x))) == s:\r\n sol.append(x)\r\nprint(len(sol))\r\nprint(*sol)", "def sum_of_digits(x: str):\r\n ans = 0\r\n for digit in x:\r\n ans += int(digit)\r\n return ans\r\n\r\na, b, c = map(int, input().split())\r\nans = []\r\n\r\nfor sx in range(1, 82):\r\n x = b * pow(sx, a) + c\r\n if x < 0: continue\r\n if x >= 1000000000: break\r\n if sum_of_digits(str(x)) == sx: ans.append(x)\r\n\r\nprint(len(ans))\r\nfor num in ans: print(num, end=\" \")", "def sum_of_digits(x: str):\n ans = 0\n for digit in x:\n ans += int(digit)\n return ans\n\na, b, c = map(int, input().split())\nans = []\n\nfor sx in range(1, 82):\n x = b * pow(sx, a) + c\n if x < 0: continue\n if x >= 1000000000: break\n if sum_of_digits(str(x)) == sx: ans.append(x)\n\nprint(len(ans))\nfor num in ans: print(num, end=\" \")\n \t\t\t\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t\t \t", "a, b, c = list(map(int, input().split()))\n\nall_ans = []\nfor x in range(1, 82):\n ans_eq = (x ** a) * b + c\n if ans_eq <= 0:\n continue\n if ans_eq >= 10 ** 9:\n break\n if sum(map(int, str(ans_eq))) == x:\n all_ans.append(ans_eq)\n\nprint(len(all_ans))\nif len(all_ans):\n print(*all_ans)\n", "def s(x):\r\n s = 0\r\n for i in str(x):\r\n s += int(i)\r\n return s\r\na,b,c=map(int, input().split())\r\nk = []\r\n\r\nfor i in range(1,81 + 1):\r\n\tx = b*(i) ** a + c\r\n\tif 0<x<10**9 and s(x) == i:\r\n\t k.append(x)\r\nprint(len(k))\r\nprint(*k)", "a,b,c=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(1,82):\r\n x=b*(i)**a+c\r\n if 0<x<10**9 and sum(map(int,str(x)))==i:\r\n k.append(x)\r\nprint(len(k))\r\nprint(*k)", "def int_power(x, n):\r\n power = 1\r\n for i in range(1, n+1):\r\n power *= x\r\n return power\r\n\r\ndef sum_of_digits(x):\r\n base = 10\r\n digit_sum = 0\r\n\r\n while x > 0:\r\n digit_sum += x % base\r\n x = x // base\r\n return digit_sum\r\n\r\na, b, c = map(int, input().split())\r\n\r\nsolutions = []\r\n\r\nfor digit_sum in range(1, 82):\r\n x = b * int_power(digit_sum, a) + c\r\n if sum_of_digits(x) == digit_sum and x > 0 and x < 1e9:\r\n solutions.append(x)\r\n\r\nprint(len(solutions))\r\nprint(*solutions)\r\n", "\r\nif __name__ == \"__main__\":\r\n a, b, c = map(int, input().split())\r\n ans = []\r\n for i in range(1, 82):\r\n x = b\r\n for j in range(a):\r\n x = x * i\r\n x += c\r\n if x >= 1e9:\r\n break\r\n if x > 0:\r\n sum, tmp = i, x\r\n while tmp > 0:\r\n sum -= tmp % 10\r\n tmp //= 10\r\n if sum == 0:\r\n ans.append(x)\r\n print(len(ans))\r\n for v in ans:\r\n print(v, end = \" \")\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\na,b,c=(int(i) for i in input().split())\r\nc1=0\r\nl=[]\r\nfor i in range(1,82):\r\n x=b*pow(i,a)+c\r\n s=0\r\n if(x>0 and x<1000000000):\r\n x=str(x)\r\n for j in x:\r\n s+=int(j)\r\n if(s==i):\r\n c1+=1\r\n l.append(x)\r\nprint(c1)\r\nprint(*l)", "a, b, c = map(int, input().split())\n\n\ndef S(x: int) -> int:\n if x < 0:\n return -1\n s = 0\n while x:\n s += x % 10\n x //= 10\n return s\n\n\nanswers = []\nfor s in range(1, 82):\n x = b*(s**a)+c\n if S(x) == s and x < 1000000000 and x > 0:\n answers.append(x)\n\n\nprint(len(answers))\nprint(*sorted(answers))\n", "a, b, c=map(int, input().split(\" \"))\r\nans=[]\r\nfor i in range(1, 81+1):\r\n x=b*(i**a)+c\r\n s=0; t=x\r\n while t>0: s=s+t%10; t=t//10\r\n if s==i and x<int(1e9): ans.append(x)\r\nprint(len(ans))\r\nprint(*ans)", "from functools import lru_cache\r\n\r\na, b, c = map(int, input().split())\r\n\r\nans = []\r\n\r\n\r\ndef check(sum: int) -> int:\r\n s = b * pow(sum, a) + c\r\n res = s\r\n total = 0\r\n while s > 0:\r\n total += s % 10\r\n s //= 10\r\n if total == sum and res < 10 ** 9:\r\n ans.append(res)\r\n\r\n\r\nfor i in range(1, 82):\r\n check(i)\r\nans.sort()\r\nprint(len(ans))\r\nfor v in ans:\r\n print(v)\r\n", "def fsx(x):\r\n return sum([int(i) for i in str(x)])\r\na,b,c = list(map(int, input().split()))\r\ncount = 0\r\nans = []\r\nfor length in range(1,10):\r\n for sx in range(1,9*length + 1):\r\n r = b * (sx**a) + c\r\n if(r<1):\r\n continue\r\n if(len(str(r))==length)and(fsx(r)==sx):\r\n count+=1\r\n ans.append(r)\r\nprint(count)\r\nif(len(ans)!=0):\r\n print(*ans)", "def sum(x):\r\n s=0;\r\n while x>0:\r\n s+=(int(x%10));\r\n x/=10;\r\n return s;\r\na,b,c=list(map(int,input().split()));\r\nans=[];\r\nfor i in range(0,100):\r\n x=b*pow(i,a)+c;\r\n # print(sum(x),\" \",i);\r\n if x<=1e9 and sum(x)==i and x>0:\r\n ans.append(x);\r\nprint(ans.__len__());\r\nfor x in ans:\r\n print(x,end=' ');", "# cook your dish here\na,b,c=map(int,input().split())\n\nl=[]\nfor n in range(1,82):\n k = b*pow(n,a)+c\n if k>=0 and sum(map(int,str(k))) == n and k<1000000000:\n l.append(k)\n\nprint(len(l))\nfor k in l:\n print(k,end=' ')", "def getdigitsum(n):\r\n total=0\r\n while n!=0:\r\n total+=n%10\r\n n//=10\r\n return total\r\nres=[]\r\na,b,c=map(int,input().split())\r\nfor i in range(1,82):\r\n xpred=b*(i**a)+c\r\n if xpred>=0:\r\n if getdigitsum(abs(xpred))==i and 0<xpred<1000000000:\r\n res.append(xpred)\r\nprint(len(res))\r\nprint(*res)", "a,b,c=map(int,input().split())\r\nsol=[]\r\nfor s in range(1,82):\r\n number=b*(s**a)+c\r\n if number<0:\r\n continue\r\n n=number\r\n Sum=0\r\n while n>0:\r\n Sum+=n%10\r\n n//=10\r\n if Sum==s and number>0 and number<10**9:\r\n sol.append(number)\r\n# print(a,b,c)\r\n# print('----')\r\nprint(len(sol))\r\nprint(*sol)", "a,b,c=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(1,81+1):\r\n x=b*(i)**a+c\r\n if 0<x<10**9 and sum(map(int,str(x)))==i:\r\n ans.append(x)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "def sum(n):\r\n s=0\r\n while n>0:\r\n r=n%10\r\n n=n//10\r\n\r\n s+=r\r\n\r\n return s\r\n\r\na,b,c=map(int,input().split())\r\n\r\nf=[]\r\nfor i in range(1,81):\r\n x=b*pow(i,a)+c\r\n\r\n if x>1000000000:\r\n break\r\n\r\n if sum(x)==i:\r\n f.append(x)\r\n\r\nprint(len(f))\r\nfor i in range(len(f)):\r\n print(f[i],end=' ')", "# Wadea #\r\n\r\na,b,c = map(int,input().split())\r\narr = []\r\nfor i in range(1,81):\r\n x = b*(i**a)+c\r\n n = 0\r\n w = x\r\n while w > 0:\r\n n += (w % 10)\r\n w //= 10\r\n if i == n and x < 10**9:\r\n arr.append(x)\r\nprint(len(arr)) \r\nprint(*arr) \r\n ", "def digitsum(x):\r\n ans = 0\r\n for c in str(x):\r\n ans += int(c)\r\n return ans\r\n\r\na, b, c = map(int, input().split())\r\n\r\nsols = []\r\n\r\nfor i in range(1, 81):\r\n x = b * pow(i, a) + c\r\n if x > 0 and digitsum(x) == i and x < pow(10, 9):\r\n sols.append(x)\r\n\r\nprint(len(sols))\r\nprint(*sols)\r\n", "def S(x):\r\n if x < 0:\r\n return -1\r\n s = 0\r\n while x:\r\n s += x % 10\r\n x //= 10\r\n return s\r\n\r\na,b,c=map(int,input().split())\r\nL=[]\r\nfor s in range(1,82):\r\n x=b*(s**a)+c\r\n if S(x)==s and x<10**9:\r\n L.append(x)\r\nif len(L)==0:\r\n print(0)\r\nelse:\r\n print(len(L))\r\n print(*L)", "\r\na, b, c = map(int, input().split())\r\nmx = int(1e9)\r\nans = []\r\nfor s in range(1, 101):\r\n r = b\r\n for i in range(a):\r\n r *= s\r\n r += c\r\n if r > 0 and sum([int(v) for v in str(r)]) == s and r < mx:\r\n ans.append(r)\r\n\r\nans.sort()\r\nprint(len(ans))\r\nprint(*ans)" ]

[ "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\npow2 = [1]\r\nfor _ in range(6):\r\n pow2.append(2 * pow2[-1])\r\np = pow2[6]\r\ncnt = [0] * p\r\nfor i in s:\r\n cnt[pow2[i - 97]] += 1\r\nsp = set(pow2)\r\nu = [[pow2[i]] for i in range(6)]\r\nfor i in range(1, p):\r\n if i in sp:\r\n continue\r\n for j in range(6):\r\n pj = pow2[j]\r\n if i & pj:\r\n cnt[i] += cnt[pj]\r\n u[j].append(i)\r\nn = len(s)\r\ny = [p - 1] * n\r\nm = int(input())\r\nfor _ in range(m):\r\n pos, s = input().rstrip().split()\r\n x = 0\r\n for i in s:\r\n x ^= pow2[i - 97]\r\n y[int(pos) - 1] = x\r\nc = [0] * p\r\nfor i in y:\r\n c[i] += 1\r\nv = [[i] for i in range(p)]\r\nfor i in range(p - 1, -1, -1):\r\n ci = c[i]\r\n for j in range(i + 1, p):\r\n if i & j == i:\r\n c[j] += ci\r\n v[i].append(j)\r\nans = []\r\nfor i in y:\r\n for j in v[i]:\r\n c[j] -= 1\r\n ok = 0\r\n for j in range(6):\r\n pj = pow2[j]\r\n if not i & pj or not cnt[pj]:\r\n continue\r\n f = 1\r\n for k in range(1, p):\r\n if c[k] > cnt[k] - min(1, k & pj):\r\n f = 0\r\n break\r\n if f:\r\n ok = 1\r\n ans.append(chr(97 + j))\r\n for k in u[j]:\r\n cnt[k] -= 1\r\n break\r\n if not ok:\r\n ans = [\"Impossible\"]\r\n break\r\nsys.stdout.write(\"\".join(ans))" ]

[ "n,k,p=map(int,input().split())\r\nif n%2:n,k=n-1,k-1\r\nfor i in range(p):\r\n x=int(input())\r\n z=((k<=n//2 and x%2==0 and x>n-2*k) or (k>n//2 and(x%2==0 or (x>n-2*(k-n//2)))) or (x>n and k>=0))\r\n print(['.','X'][z],end='')", "n,k,p=map(int,input().split())\r\nif n%2:n,k=n-1,k-1\r\nfor i in range(p):\r\n x=int(input())\r\n print(['.','X'][((k<=n//2 and x%2==0 and x>n-2*k)or(k>n//2 and(x%2==0 or(x>n-2*(k-n//2))))or(x>n and k>=0))],end='')", "n, k, p = map(int, input().split())\n\nfor i in range(p):\n pos = int(input())\n if n % 2:\n if pos == n:\n print('X' if k > 0 else '.', end='')\n else:\n if k * 2 > n + 1:\n print('X' if (pos & 1) == 0 or (n - pos) // 2 \\\n + n // 2 + 1<= k else '.', end='')\n else:\n print('X' if (pos & 1) == 0 and \\\n (n + 1 - pos) // 2 < k else '.', end='')\n else:\n if k * 2 > n:\n print('X' if (pos & 1) == 0 or (n - pos + 1) // 2 + \\\n n // 2 <= k else '.', end='')\n else:\n print('X' if (pos & 1) == 0 and (n - pos + 2) // 2 <= k \\\n else '.', end='')\n\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "n, m = map(int, input().split())\nswapped = False\nif n < m:\n n, m = m, n\n swapped = True\nans = '' \nif n == 1 and m == 1:\n\tans = '''0\n.'''\nif n == 2 and m == 1:\n\tans = '''0\n.\n.'''\nif n == 2 and m == 2:\n\tans = '''0\n..\n..'''\nif n == 3 and m == 1:\n\tans = '''0\n.\n.\n.'''\nif n == 3 and m == 2:\n\tans = '''0\n..\n..\n..'''\nif n == 3 and m == 3:\n\tans = '''1\n.A.\n.A.\nAAA'''\nif n == 4 and m == 1:\n\tans = '''0\n.\n.\n.\n.'''\nif n == 4 and m == 2:\n\tans = '''0\n..\n..\n..\n..'''\nif n == 4 and m == 3:\n\tans = '''1\n.A.\n.A.\nAAA\n...'''\nif n == 4 and m == 4:\n\tans = '''2\n...A\nBAAA\nBBBA\nB...'''\nif n == 5 and m == 1:\n\tans = '''0\n.\n.\n.\n.\n.'''\nif n == 5 and m == 2:\n\tans = '''0\n..\n..\n..\n..\n..'''\nif n == 5 and m == 3:\n\tans = '''2\n..A\nAAA\n.BA\n.B.\nBBB'''\nif n == 5 and m == 4:\n\tans = '''2\n.A..\n.A..\nAAAB\n.BBB\n...B'''\nif n == 5 and m == 5:\n\tans = '''4\nBBB.A\n.BAAA\nDB.CA\nDDDC.\nD.CCC'''\nif n == 6 and m == 1:\n\tans = '''0\n.\n.\n.\n.\n.\n.'''\nif n == 6 and m == 2:\n\tans = '''0\n..\n..\n..\n..\n..\n..'''\nif n == 6 and m == 3:\n\tans = '''2\n.A.\n.A.\nAAA\n.B.\n.B.\nBBB'''\nif n == 6 and m == 4:\n\tans = '''3\n.A..\n.A..\nAAAB\nCBBB\nCCCB\nC...'''\nif n == 6 and m == 5:\n\tans = '''4\n.A..B\n.ABBB\nAAACB\n.D.C.\n.DCCC\nDDD..'''\nif n == 6 and m == 6:\n\tans = '''5\n.A..B.\n.ABBB.\nAAACB.\nECCCD.\nEEECD.\nE..DDD'''\nif n == 7 and m == 1:\n\tans = '''0\n.\n.\n.\n.\n.\n.\n.'''\nif n == 7 and m == 2:\n\tans = '''0\n..\n..\n..\n..\n..\n..\n..'''\nif n == 7 and m == 3:\n\tans = '''3\n..A\nAAA\nB.A\nBBB\nBC.\n.C.\nCCC'''\nif n == 7 and m == 4:\n\tans = '''4\n...A\nBAAA\nBBBA\nB..C\nDCCC\nDDDC\nD...'''\nif n == 7 and m == 5:\n\tans = '''5\n.A..B\n.ABBB\nAAACB\n.CCC.\n.D.CE\n.DEEE\nDDD.E'''\nif n == 7 and m == 6:\n\tans = '''6\n.A..B.\n.ABBB.\nAAACB.\nEEECCC\n.EDC.F\n.EDFFF\n.DDD.F'''\nif n == 7 and m == 7:\n\tans = '''8\nB..ACCC\nBBBA.C.\nBDAAACE\n.DDDEEE\nGDHHHFE\nGGGH.F.\nG..HFFF'''\nif n == 8 and m == 1:\n\tans = '''0\n.\n.\n.\n.\n.\n.\n.\n.'''\nif n == 8 and m == 2:\n\tans = '''0\n..\n..\n..\n..\n..\n..\n..\n..'''\nif n == 8 and m == 3:\n\tans = '''3\n.A.\n.A.\nAAA\n..B\nBBB\n.CB\n.C.\nCCC'''\nif n == 8 and m == 4:\n\tans = '''4\n.A..\n.A..\nAAAB\nCBBB\nCCCB\nCD..\n.D..\nDDD.'''\nif n == 8 and m == 5:\n\tans = '''6\n.A..B\n.ABBB\nAAACB\nDDDC.\n.DCCC\nFD.E.\nFFFE.\nF.EEE'''\nif n == 8 and m == 6:\n\tans = '''7\n.A..B.\n.ABBB.\nAAA.BC\nDDDCCC\n.DGGGC\n.DFGE.\nFFFGE.\n..FEEE'''\nif n == 8 and m == 7:\n\tans = '''9\nB..ACCC\nBBBA.C.\nBDAAACE\n.DDDEEE\nFD.IIIE\nFFFHIG.\nFHHHIG.\n...HGGG'''\nif n == 9 and m == 8:\n ans = '''12\n.A..BDDD\n.ABBBCD.\nAAAEBCD.\nFEEECCCG\nFFFEHGGG\nFKKKHHHG\n.IKLH.J.\n.IKLLLJ.\nIIIL.JJJ'''\nif n == 8 and m == 8:\n ans = '''10\n.A..BCCC\n.A..B.C.\nAAABBBCD\nE.GGGDDD\nEEEGJJJD\nEF.GIJH.\n.FIIIJH.\nFFF.IHHH'''\nif n == 9 and m == 9:\n ans = '''13\nAAA.BCCC.\n.ABBB.CD.\n.AE.BFCD.\nEEEFFFDDD\nG.E.HFIII\nGGGJHHHI.\nGK.JHL.IM\n.KJJJLMMM\nKKK.LLL.M'''\nif n == 9 and m == 1:\n\tans = '''0\n.\n.\n.\n.\n.\n.\n.\n.\n.'''\nif n == 9 and m == 2:\n\tans = '''0\n..\n..\n..\n..\n..\n..\n..\n..\n..'''\nif n == 9 and m == 3:\n\tans = '''4\n..A\nAAA\nB.A\nBBB\nB.C\nCCC\n.DC\n.D.\nDDD'''\nif n == 9 and m == 4:\n\tans = '''5\n.A..\n.A..\nAAAB\nCBBB\nCCCB\nC..D\nEDDD\nEEED\nE...'''\nif n == 9 and m == 5:\n\tans = '''7\n.A..B\n.ABBB\nAAACB\nDCCC.\nDDDCF\nDEFFF\n.E.GF\nEEEG.\n..GGG'''\nif n == 9 and m == 6:\n\tans = '''8\n.A..B.\n.ABBB.\nAAACB.\nECCCD.\nEEECD.\nE.GDDD\n.FGGGH\n.FGHHH\nFFF..H'''\nif n == 9 and m == 7:\n\tans = '''10\n.ACCC.B\n.A.CBBB\nAAACD.B\n...EDDD\nFEEED.G\nFFFEGGG\nFHJJJIG\n.H.J.I.\nHHHJIII'''\nif swapped:\n cnt = ans.split('\\n')[0]\n lst = ans.split('\\n')[1:]\n ans = ''\n for j in range(m):\n for i in range(n):\n ans = ans + lst[i][j]\n ans += '\\n'\n ans = cnt + '\\n' + ans\nprint(ans)\n\n\n\n\n# Made By Mostafa_Khaled", "r={}\r\nr[(1,1)]='''0\r\n.\r\n'''\r\nr[(1,2)]='''0\r\n..\r\n'''\r\nr[(1,3)]='''0\r\n...\r\n'''\r\nr[(1,4)]='''0\r\n....\r\n'''\r\nr[(1,5)]='''0\r\n.....\r\n'''\r\nr[(1,6)]='''0\r\n......\r\n'''\r\nr[(1,7)]='''0\r\n.......\r\n'''\r\nr[(1,8)]='''0\r\n........\r\n'''\r\nr[(1,9)]='''0\r\n.........\r\n'''\r\nr[(2,2)]='''0\r\n..\r\n..\r\n'''\r\nr[(2,3)]='''0\r\n...\r\n...\r\n'''\r\nr[(2,4)]='''0\r\n....\r\n....\r\n'''\r\nr[(2,5)]='''0\r\n.....\r\n.....\r\n'''\r\nr[(2,6)]='''0\r\n......\r\n......\r\n'''\r\nr[(2,7)]='''0\r\n.......\r\n.......\r\n'''\r\nr[(2,8)]='''0\r\n........\r\n........\r\n'''\r\nr[(2,9)]='''0\r\n.........\r\n.........\r\n'''\r\nr[(3,3)]='''1\r\n.A.\r\n.A.\r\nAAA\r\n'''\r\nr[(3,4)]='''1\r\n.A..\r\n.A..\r\nAAA.\r\n'''\r\nr[(3,5)]='''2\r\nBBBA.\r\n.B.A.\r\n.BAAA\r\n'''\r\nr[(3,6)]='''2\r\n.B.A..\r\n.B.AAA\r\nBBBA..\r\n'''\r\nr[(3,7)]='''3\r\nA.BBBC.\r\nAAAB.C.\r\nA..BCCC\r\n'''\r\nr[(3,8)]='''3\r\n.BCCC.A.\r\n.B.CAAA.\r\nBBBC..A.\r\n'''\r\nr[(3,9)]='''4\r\nBBBDAAA.C\r\n.B.D.ACCC\r\n.BDDDA..C\r\n'''\r\nr[(4,4)]='''2\r\nBBB.\r\n.BA.\r\n.BA.\r\n.AAA\r\n'''\r\nr[(4,5)]='''2\r\n....A\r\n.BAAA\r\n.BBBA\r\n.B...\r\n'''\r\nr[(4,6)]='''3\r\n..A...\r\n.CAAAB\r\n.CABBB\r\nCCC..B\r\n'''\r\nr[(4,7)]='''4\r\n...ACCC\r\nBAAADC.\r\nBBBADC.\r\nB..DDD.\r\n'''\r\nr[(4,8)]='''4\r\nBBB.A...\r\n.BD.AAAC\r\n.BD.ACCC\r\n.DDD...C\r\n'''\r\nr[(4,9)]='''5\r\n...ACCC..\r\nDAAAECBBB\r\nDDDAEC.B.\r\nD..EEE.B.\r\n'''\r\nr[(5,5)]='''4\r\nD.BBB\r\nDDDB.\r\nDA.BC\r\n.ACCC\r\nAAA.C\r\n'''\r\nr[(5,6)]='''4\r\nA..DDD\r\nAAA.D.\r\nABBBDC\r\n..BCCC\r\n..B..C\r\n'''\r\nr[(5,7)]='''5\r\n.A.EEE.\r\n.AAAEB.\r\nCA.DEB.\r\nCCCDBBB\r\nC.DDD..\r\n'''\r\nr[(5,8)]='''6\r\nA..D.FFF\r\nAAADDDF.\r\nAB.DECF.\r\n.BEEECCC\r\nBBB.EC..\r\n'''\r\nr[(5,9)]='''7\r\n..CAAAB..\r\nCCC.AGBBB\r\nF.CDAGBE.\r\nFFFDGGGE.\r\nF.DDD.EEE\r\n'''\r\nr[(6,6)]='''5\r\nAAA...\r\n.ABCCC\r\n.AB.C.\r\nDBBBCE\r\nDDDEEE\r\nD....E\r\n'''\r\nr[(6,7)]='''6\r\n..A...B\r\nAAA.BBB\r\nE.ADDDB\r\nEEECDF.\r\nECCCDF.\r\n...CFFF\r\n'''\r\nr[(6,8)]='''7\r\nF.DDD..G\r\nFFFDBGGG\r\nF.ADBBBG\r\nAAAEBC..\r\n..AE.CCC\r\n..EEEC..\r\n'''\r\nr[(6,9)]='''8\r\nF..AAAGGG\r\nFFFCA.BG.\r\nFCCCA.BG.\r\nHHHCDBBBE\r\n.HDDD.EEE\r\n.H..D...E\r\n'''\r\nr[(7,7)]='''8\r\nH..AEEE\r\nHHHA.E.\r\nHDAAAEC\r\n.DDDCCC\r\nBDFFFGC\r\nBBBF.G.\r\nB..FGGG\r\n'''\r\nr[(7,8)]='''9\r\nF.III..G\r\nFFFIAGGG\r\nFH.IAAAG\r\n.HHHADDD\r\nEHBBBCD.\r\nEEEB.CD.\r\nE..BCCC.\r\n'''\r\nr[(7,9)]='''10\r\n...BJJJ.A\r\n.BBBGJAAA\r\nE..BGJC.A\r\nEEEGGGCCC\r\nEHDDDFC.I\r\n.H.D.FIII\r\nHHHDFFF.I\r\n'''\r\nr[(8,8)]='''10\r\nA..BBB..\r\nAAAJBIII\r\nAH.JB.I.\r\n.HJJJGI.\r\nHHHC.GGG\r\nECCCDG.F\r\nEEECDFFF\r\nE..DDD.F\r\n'''\r\nr[(8,9)]='''12\r\nDDDLLL..H\r\n.DC.LGHHH\r\n.DC.LGGGH\r\nECCCBGKKK\r\nEEEABBBK.\r\nEI.ABJ.KF\r\n.IAAAJFFF\r\nIII.JJJ.F\r\n'''\r\nr[(9,9)]='''13\r\nK.DDDEMMM\r\nKKKD.E.M.\r\nKA.DEEEMF\r\n.AAALGFFF\r\nHALLLGGGF\r\nHHHBLGCCC\r\nHI.B..JC.\r\n.IBBB.JC.\r\nIII..JJJ.\r\n'''\r\n\r\nn,m=map(int,input().split())\r\nif n<m:\r\n\tprint(r[(n,m)]),\r\nelse:\r\n\ts=r[(m,n)].strip().split('\\n')\r\n\tprint(s[0])\r\n\ts=s[1:]\r\n\ts=zip(*s)\r\n\tfor t in s:\r\n\t\tprint(''.join(t))\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, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm = 555\r\nm0 = n // m + min(n % m, 1)\r\ns = [set() for _ in range(m0)]\r\nfor i in range(m0):\r\n for j in range(i * m, min((i + 1) * m, n)):\r\n s[i].add(a[j])\r\nlazy = [0] * m0\r\nans = []\r\ninf = pow(10, 9) + 1\r\nfor _ in range(q):\r\n t = list(map(int, input().split()))\r\n if t[0] == 1:\r\n l, r, x = t[1:]\r\n l, r = l - 1, r - 1\r\n l0, r0 = l // m, r // m\r\n if l0 == r0:\r\n u, v = lazy[l0] + x, lazy[l0]\r\n for i in range(l0 * m, min((l0 + 1) * m, n)):\r\n a[i] += u if l <= i <= r else v\r\n lazy[l0] = 0\r\n s[l0] = set([a[i] for i in range(l0 * m, min((l0 + 1) * m, n))])\r\n continue\r\n for j in [l0, r0]:\r\n u, v = lazy[j] + x, lazy[j]\r\n for i in range(j * m, min((j + 1) * m, n)):\r\n a[i] += u if l <= i <= r else v\r\n lazy[j] = 0\r\n s[j] = set([a[i] for i in range(j * m, min((j + 1) * m, n))])\r\n for i in range(l0 + 1, r0):\r\n lazy[i] += x\r\n else:\r\n y = t[1]\r\n l = -1\r\n for i in range(m0):\r\n if y - lazy[i] in s[i]:\r\n l = i\r\n break\r\n if l == -1:\r\n ans0 = -1\r\n ans.append(ans0)\r\n continue\r\n for i in range(m0 - 1, -1, -1):\r\n if y - lazy[i] in s[i]:\r\n r = i\r\n break\r\n mi, ma = inf, -inf\r\n for i in set([l, r]):\r\n for j in range(i * m, min((i + 1) * m, n)):\r\n if a[j] == y - lazy[i]:\r\n mi, ma = min(mi, j), max(ma, j)\r\n ans0 = ma - mi\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "mass = input().split()\r\n\r\nn = int(mass[0])\r\nk = int(mass[1])\r\nt = int(mass[2])\r\n\r\n\r\n'''for i in range(1, t + 1):\r\n if i <= k:\r\n result = result + 1\r\n elif i <= n:\r\n result = result\r\n else:\r\n result = result - 1\r\n'''\r\n\r\nif t <= k:\r\n print(t)\r\nelif t <= n:\r\n print(k)\r\nelse:\r\n print(k - (t % n))\r\n\r\n\r\n\r\n", "n, k ,t = map(int, input().split())\nif 0<=t<=k:\n print(t)\nelif k<t<=n:\n print(k)\nelif t<=n+k-1:\n print(n+k-t)\nelse:\n print(0) \n#116557440\n#230150037\n#966696824 346707476 1196846860\n#0 k-1\n#n-k s stay \n#n+k-1", "n,k,t=map(int,input().split())\r\n\r\nif t<=k:\r\n print(t)\r\nelif t >= k+1 and t<=n:\r\n print(k)\r\nelse:\r\n u= t -n\r\n print( k -u )\r\n", "n, k, t = map(int, input().split())\r\n\r\nprint(t if t <= k else k if k < t < n else n+k-t)\r\n", "#http://codeforces.com/problemset/problem/851/A\nn,k,t = map(int, input().split() )\nprint (min(t,k,n+k-t))", "a = input().split()\ni = int(a[0])\nj = int(a[1])\nk = int(a[2])\nif k < j:\n print(k)\nelif k < i:\n print(j)\nelse:\n print(i + j - k)", "#!/usr/bin/env python\n\nimport sys\n\ndef main():\n n, k, t = map(int, input().split())\n if t < k:\n print(t)\n elif t <= n:\n print(k)\n elif n + k >= t:\n print(k + n - t)\n else:\n print(0)\n\nmain()\n", "n, k ,t = [int(i) for i in input().split()]\rprint(min(t, k, n + k - t))", "s=input()\r\nss=s.split()\r\nn=int(ss[0])\r\nk=int(ss[1])\r\nt=int(ss[2])\r\nb=0\r\nif(t-k>0):\r\n b=t-k\r\nc=0\r\nif(t-n>0):\r\n c=t-n\r\nprint(t-b-c)", "n,k,t = list(map(int, input().split()))\r\ncaunt = 0\r\nif t <= k:\r\n caunt = t\r\nelif t <= n:\r\n caunt = k\r\nelif t <= n + k:\r\n caunt = k - (t - n)\r\nelse:\r\n caunt = 0\r\nprint(caunt)\r\n", "n, k, t = map(int, input().split())\r\n\r\nprint(min([k, t, k - t + n]))", "(n, k, t) = map(int, input().split())\r\nif t < k:\r\n print(t)\r\nelif t-n>0 and t - n <= k:\r\n print(n+k-t)\r\nelse:\r\n print(k)", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k, t] = list(map(int, input().split()))\r\nif t <= k:\r\n print(t)\r\nelif k < t and t <= n:\r\n print(k)\r\nelse:\r\n print(n+k-t)", "n,k,t=map(int, input().split())\r\n\r\nif t<=k: print(t)\r\nelif t>k and t<=n: print(k)\r\nelse: print(k-(t-n))", "numbers = input()\r\n\r\nnumbers_list = []\r\n\r\nauxiliar_number = \"\"\r\n\r\nfor i in range(0, len(numbers)):\r\n\r\n\tif numbers[i] != \" \":\r\n\r\n\t\tauxiliar_number = auxiliar_number + numbers[i]\r\n\r\n\t\tif i == len(numbers) - 1:\r\n\r\n\t\t\tnumbers_list.append(int(auxiliar_number))\r\n\r\n\telse:\r\n\r\n\t\tnumbers_list.append(int(auxiliar_number))\r\n\r\n\t\tauxiliar_number = \"\"\r\n\r\nif numbers_list[2] <= numbers_list[1]:\r\n\r\n\tprint(numbers_list[2])\r\n\r\nelif numbers_list[2] <= numbers_list[0]:\r\n\r\n\tprint(numbers_list[1])\r\n\r\nelse:\r\n\r\n\tprint(numbers_list[1] - (numbers_list[2] - numbers_list[0]))", "n = list(map(int, input().split()))\r\nif n[2] < n[1] :\r\n print (n[2])\r\nelif n[2] >= n[1] and n[2] <= n[0]:\r\n print(n[1])\r\nelse:\r\n print((n[0] + n[1]) - n[2])", "f=input()\r\nf1=f.split(' ')\r\nn=int(f1[0])\r\nk=int(f1[1])\r\nt=int(f1[2])\r\nif (t<k):\r\n print(t)\r\nelse:\r\n print(min(k,k-(t-n)))\r\n\r\n", "def ret(n,k,t):\r\n\tif t<k:\r\n\t\treturn t\r\n\telif t>=k and t<=n:\r\n\t\treturn k\r\n\telse:\r\n\t\treturn n+k-t\r\nn,k,t=map(int,input().split())\r\nprint(ret(n,k,t))", "n, k , t = map(int, input().split())\nif t <= k:\n\tprint(t)\nelif t<=n:\n\tprint(k)\nelse:\n\tprint(n+k - t)\n", "n, k, t = map(int, input().split())\nprint(min(k, t, (n + k) - t))\n", "n,m,k=map(int,input().split())\r\nif k<=n and k<=m:\r\n print(k)\r\nelif k<=n and k>=m:\r\n print(m)\r\nelif k>n:\r\n k=k-n\r\n print(m-k)\r\n \r\n \r\n ", "import sys\n\ndef num_spectators_standing(n,k,t):\n #print(n,k,t)\n if n>=t>=k: return k\n if t<k: return t\n if t>n: return k-(t-n)\n\ndef main():\n n,k,t = map(int, sys.stdin.readline().strip().split(' '))\n print(num_spectators_standing(n,k,t))\n assert num_spectators_standing(10,5,3) == 3\n assert num_spectators_standing(10,5,7) == 5\n assert num_spectators_standing(10,5,12) == 3\n\nif __name__ == '__main__':\n main()\n", "n,k,t=map(int,input().split())\r\ncount=0\r\nti=t+0\r\nif t>k:\r\n\tcount+=k\r\n\tt-=k\r\n\tif t>0:\r\n\t\tt-=n-k-1\r\n\tif t>0:\r\n\t\tcount-=(ti-n)\r\n\r\nelse:\r\n\tcount+=t\r\n\r\n\r\nprint(count)", "a,b,c = input().split()\r\nn = int(a)\r\nk = int(b)\r\nt = int(c)\r\nif t>=k and t<=n:\r\n print(k)\r\nelif t<k:\r\n print(t)\r\nelse:\r\n print(n+k-t)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,k,t=(int(i) for i in input().split())\r\nif(t<=k):\r\n print(t)\r\nelif(t>=n):\r\n print(n+k-t)\r\nelse:\r\n print(k)", "n, k, t = map(int, input().split())\n\nif t <= k:\n\tprint(t)\nelif t <= n:\n\tprint(k)\nelse:\n\tprint(n + k - t)", "n,k,t=input().split()\r\nn=int(n)\r\nk=int(k)\r\nt=int(t)\r\nif t <n+1:\r\n if t<k:\r\n print(t)\r\n else:\r\n print(k)\r\nelse:\r\n if t<n+k+1:\r\n print(k+n-t)\r\n else:\r\n print(0)", "def main():\n n, k, t = tuple(map(int, input().split()))\n if 1 <= t <= k:\n print(t)\n elif (k + 1) <= t <= n:\n print(k)\n elif (n + 1) <= t <= (n + k):\n print(k - t + n)\n\nif __name__ == '__main__':\n main()", "c = list(map(int,input().split()))\r\nif c[2]-c[1]<=0: print(c[2])\r\nelif c[2]>c[0]: print(c[1]-(c[2]-c[0]))\r\nelse: print(c[1])", "n,k,t=map(int,input().split())\r\nt-=1\r\nstart=t-k+1\r\nif t-k<0:\r\n start=0\r\nend=t \r\nif start<n:\r\n if end<n:\r\n print(end-start+1)\r\n else:\r\n print(n-start)\r\nelse:\r\n print(0)\r\n", "n, k, t = [int(s) for s in input().split(' ')]\r\nprint(min(t, k, n + k - t))", "a,b,c=map(int,input().split());print(c if b>=c else b if a>=c+1 else (b-(c-a)) )", "n,k,t=map(int,input().split())\r\n\r\nif t<=n:\r\n print(min(t,k))\r\nelse:\r\n print(k+n-t)\r\n\r\n\r\n\r\n\r\n", "n,k,t=map(int,input().split())\r\n#t<=k ans=t\r\n#k<t<=n ans=k\r\n#t>n ans=k-(t-n)\r\nif t<=k:\r\n print(t)\r\nelif k<t<=n:\r\n print(k)\r\nelse:\r\n print(k-t+n)\r\n", "n,k,t = map(int, input().split())\r\nprint(t if t<=k else k if t<=n else k-(t%n))", "x,y,z = map(int,input().split())\r\nif z<y:print(z)\r\nelif z>=y and z<=x:print(y)\r\nelse: print(y-(z-x))\r\n", "import math\r\nimport sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn,k,t=minput()\r\nif k>=t and t<n:\r\n print(t)\r\nelif (t>=k and t<n) or t==n:\r\n print(k)\r\nelse:\r\n t=t%n\r\n print(k-t)\r\n\r\n\r\n \r\n", "def solution851a():\n n, k, t = map(int, input().split())\n if t < k:\n ans = t\n elif k <= t <= n:\n ans = k\n else:\n ans = n + k - t\n\n print(ans)\n\n\nif __name__ == '__main__':\n solution851a()\n", "n,k,t=[int(x) for x in input().split()]\r\nres=0\r\nif t<=k:\r\n res=t\r\nelif t>=n:\r\n res=k-(t-n)\r\nelse:\r\n res=k\r\nprint(res)\r\n", "n,k,t=map(int,input().split())\r\nif t<=k:print(t)\r\nelif k<t<=n:print(k)\r\nelif n<t<=n+k:print(k-t+n)", "def reversed_list(l, start, end):\r\n if start >= end:\r\n return l\r\n l[start], l[end] = l[end], l[start]\r\n return reversed_list(l, start + 1, end - 1)\r\n\r\n\r\n\r\ndef main_function():\r\n n, k, t = [int(i) for i in input().split(\" \")]\r\n if k >= t:\r\n return t\r\n elif k < t and t <= n:\r\n return k\r\n else:\r\n return k - (t - n)\r\n\r\n\r\nprint(main_function())", "# LUOGU_RID: 101672838\nn, k, t = map(int, input().split())\r\nprint(min(k, t, n + k - t))\r\n", "n, k, i = list(map(int, input().split()))\r\n\r\nif i <k:\r\n print(i)\r\nelif i > n:\r\n print(k+n-i)\r\nelse:\r\n print(k)", "n, k, t = map(int, input().split())\r\nif t <= n:\r\n print(min(t, k))\r\nelse:\r\n print(k - t + n)", "\nimport sys\nimport os\nimport math\nimport re\n\n\nn,k,t = map(int, input().split())\n\nprint(min(min(n+k-t,k),t))\n", "n, k, t = (int(i) for i in input().split())\nres = min(t, n) - max(0, t - k)\nprint(res)\n", "#problem35\r\nn,k,t = map(int,input().split())\r\nprint(min(t,k,(n+k-t)))\r\n", "import sys\r\n\r\ndef main():\r\n n, k, t = map(int, sys.stdin.read().strip().split())\r\n if t > n: return n + k - t\r\n if t < k: return t\r\n return k\r\n \r\nprint(main())\r\n", "n, k, t = map(int, input().split())\r\nprint(min(t,k,n+k-t))\r\n", "n,k,t=map(int,input().split())\nif t<k:\n\tprint(t)\nelif t>n:\n\tprint(k-(t-n))\nelse:\n\tprint(k)\n", "n,k,t=map(int,input().split())\r\nif t<=k:print(t)\r\nelif t<=n:print(k)\r\nelse: print(k-t+n)", "N, K, T = map(int, input().split())\n\nif T < K:\n print(T)\nelif N < T:\n print(N+K-T)\nelse:\n print(K)\n", "n,k,t=map(int,input().split())\r\nif t<k:\r\n print(t)\r\nelif k<=t<=n:\r\n print(k)\r\nelse:\r\n s=t-n\r\n print(max(0,k-s))\r\n", "arr = list(map(int,input().strip().split()))[:3]\nn = arr[0]\nk = arr[1]\nt = arr[2]\nif(t <= k):\n print(t)\nelif(t > k and t <= n):\n print(k)\nelse:\n print(k - (t - n))\n\n\t\t \t \t \t \t\t\t\t \t \t\t\t \t", "n,k,t=input().strip().split(' ')\nn,k,t=[int(n),int(k),int(t)]\nif(t<=k):\n ans=t\nelif(t>=k+1 and t<=n):\n ans=k\nelse:\n ans=n+k-t\nprint(ans)\n", "n,k,t=map(int,input().split(' '))\r\nstd=0\r\nif t<=k:\r\n std+=t\r\nif t>k:\r\n std+=k\r\n if t>n:\r\n std-=(t-n)\r\nprint(std)", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn, k, t = IL()\r\nif t<=k:\r\n print(t)\r\nelif t>n:\r\n print(n+k-t)\r\nelse:\r\n print(k)", "n,k,t=map(int,input().split())\r\nif t in range(1,k+1):\r\n print(t)\r\nelif t in range(n+1,n+k+1):\r\n print(n+k-t)\r\nelse:\r\n print(k)", "n,k,t=map(int,input().split())\r\nif t<=n:print(min(t,k))\r\nelse:print(k-(t-n))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "n, k, t = [int(i) for i in input().split()]\nif (t<k):\n print(t)\n exit()\nif (t > n):\n print(n+k-t)\n exit()\nprint(k)", "import sys\r\nimport math\r\n\r\nlines = sys.stdin.read().splitlines()\r\nn, k, t = [int(x) for x in lines[0].split()]\r\nif t > n:\r\n print(max(0, k-(t-n)))\r\nelse:\r\n print(min(k, t))\r\n ", "\r\nn,k,t = map(int,input().split()) \r\nif( t < k+1):\r\n print(t)\r\nelif(t >= k+1 and t<= n):\r\n sit = t - k \r\n print( t - sit )\r\nelse:\r\n print(n-t+k)\r\n\r\n\r\n\r\n\r\n\r\n", "n,k,t=list(map(int,input().split()))\r\nif t<=k:\r\n print(t)\r\nelif t>k and t<=n:\r\n print(k)\r\nelse:\r\n tod=n+k\r\n print(tod-t)", "n, k, t=map(int,input().split())\r\nif(t<k):\r\n print(t)\r\nelif((k<=t) and (t<=n)):\r\n print(k)\r\nelse:\r\n print(n-t+k)\r\n \r\n\r\n\r\n", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,k,t=q()\r\nif t<=k:\r\n print(t)\r\nelif k<t<=n:\r\n print(k)\r\nelif t>n:\r\n print(k-(t-n))", "def solve(n, k, t):\n if t <= k:\n return t\n elif k < t < n:\n return k\n else:\n return k - (t - n)\n\n\ndef main():\n n, k, t = list(map(int, input().split()))\n print(solve(n, k, t))\n\n\nmain()\n", "[n, k, t] = [int(x) for x in input().split()]\r\nif t <= k: print(t)\r\nelif k <= t <= n: print(k)\r\nelse: print(k+n-t)\r\n", "n,k,t=input().strip().split(' ')\r\nn,k,t=[int(n),int(k),int(t)]\r\nif(t<=k):\r\n ans=t\r\nelif(t<=n and t>k):\r\n ans=k\r\nelse:\r\n ans=k-(t-n)\r\nprint(ans)\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[32]:\n\n\nn,k,t = map(int,input().split())\nprint(min(t,k,n+k-t))\n\n", "n, k, t = map(int, input().split())\nprint(min(t, n) - max(t - k, 0))\n\t \t\t\t \t\t \t \t \t \t\t \t \t \t", "n,k,t=list(map(int,input().split()))\r\nprint(t-max(0,t-k)if t<=n else max(0, n-t+k))", "n,k,t = [int(i) for i in input().split()]\nif t < k:\n print(t)\nelif t > n:\n print(k-t+n)\nelse:\n print(k)", "n,k,t=map(int,input().split());print([t,k,n+k-t][(t>k)+(t>n)])", "n,k,t=map(int,input().split())\r\nz=0\r\nif t<=k:\r\n\tz=t\r\nelif t>k and t<=n:\r\n\tz=k\r\nelif t>n:\r\n\tz=abs(t-n-k)\t\r\nprint(z)", "def solution(n, k, t):\r\n if t < k:\r\n return t\r\n elif t <= n:\r\n return k\r\n else:\r\n return k - (t - n)\r\n\r\nn, k, t = [int(x) for x in input().strip().split(\" \")]\r\nprint(solution(n, k, t))\r\n", "def spec(n, k, t):\r\n if t <= k:\r\n return t\r\n elif t <= n:\r\n return k\r\n else:\r\n return n + k - t\r\n\r\nn, k, t = map(int, input().split())\r\nprint(spec(n, k, t))\r\n", "def wave(n, k, t):\r\n if t <= k:\r\n return t\r\n if k < t <= n:\r\n return k\r\n if t > n + k:\r\n return 0\r\n if t > n:\r\n return n + k - t\r\n\r\n\r\nN, K, T = [int(i) for i in input().split()]\r\nprint(wave(N, K, T))\r\n", "n, k, t, = map(int, input().split())\r\nif 0 < t <= k:\r\n print(t)\r\nelif k < t <= n:\r\n print(k)\r\nelse:\r\n print((n+k)-t)", "# Problem Name : Arpa and a research in Mexican wave\r\n# Problem Link : https://codeforces.com/problemset/problem/851/A\r\n# Input Operation \r\nimport sys\r\nn,k,t=map(int,sys.stdin.readline().split())\r\n# Input Operation End\r\n# Solution Start\r\nif k>t:\r\n print(t)\r\nelif t>=k and t<=n:\r\n print(k)\r\nelif t>n:\r\n out=t-n\r\n out2=k-out\r\n if k<=0:\r\n print(0)\r\n else:print(out2)", "n,k,t=map(int,input().split())\r\nif(t>n):\r\n print(n+k-t)\r\nelif(t<k):\r\n print(t)\r\nelse:\r\n print(k)\r\n\r\n\r\n", "n, k, t = map(int,input().split())\r\nif t<=k:\r\n\tans = t\r\nelif t<=n:\r\n\tans = k\r\nelse:\r\n\tans = k-(t-n)\r\nprint(ans)", "a,b,c=input().split()\r\na,b,c=int(a),int(b),int(c)\r\nif c<b:\r\n print(c)\r\nelif c>a+b:\r\n print(0)\r\nelif c>=a:\r\n print(b-(c%a))\r\nelse:\r\n print(b)", "m,n,o=map(int,input().split())\r\nif(o<n):\r\n print(o)\r\nelif(o>=n and o<=m):\r\n print(n)\r\nelse:\r\n print((n+m)-o) \r\n", "n, k, t = list(map(int, input().split()))\r\n\r\nif t < k:\r\n print(t)\r\nelif n+k-t<k:\r\n print(n+k-t)\r\nelse:\r\n print(k)", "n , k , t = list(map(int,input().split()))\r\nif t<=k:\r\n\tprint(t)\r\nelif k<=t<=n:\r\n\tprint(k)\r\nelif n<=t<n+k:\r\n\tprint(n+k-t)\t\t", "n, k, t = [int(x) for x in input().split(' ')]\nif 0 <= t < k:\n print(t)\nelif k <= t < n:\n print(k)\nelse:\n print(n + k - t)\n", "n,k,t=map(int,input().split())\r\nif t>n:\r\n print(max(n-(t-k),0))\r\nelse:\r\n if t>=k:\r\n print(k)\r\n else:\r\n print(t)", "import sys\n\nn, k, t = [int(d) for d in sys.stdin.readline().split()]\nif t < k:\n print(t)\nelif t > n:\n print(n+k-t)\nelse:\n print(k)\n", "n, k, t=[int(i) for i in input().split()]\r\nif t<k:\r\n print(t)\r\nelif k<=t<=n:\r\n print(k)\r\nelse:\r\n print(n+k-t)", "n,k,t = map(int, input().split())\n\nfirst = max(1, min(n, t))\nlast = max(1, min(n, t-k+1))\n\nprint(first -last + 1)\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output1.out\",'w')\r\nn,k,t=map(int,input().split())\r\nif t<=k:\r\n\tprint(t)\r\nelif t>k and t<=n:\r\n\tprint(k)\r\nelse:\r\n\tprint(n+k-t)", "n,k,t=list(map(int,input().split()))\r\ni=0\r\nif t<k:\r\n print(t)\r\nelif t>=k and t<=n:\r\n print(k)\r\nelse:\r\n s=t-n\r\n print(k-s)\r\n", "n,k,t=[int(i) for i in input().split()]\r\nif t<=k:\r\n print(t)\r\nelse:\r\n if t>k and t<=n:\r\n print(k)\r\n else:\r\n print(k-(t-n))", "n,k,l=map(int,input().split())\r\nprint(min(l,k,n+k-l))", "n, k, t = [int(i) for i in input().split()]\nif t < k:\n print(t)\n exit(0)\nif n + 1 <= t:\n print(n + k - t)\n exit(0)\nprint(k)", "def solve():\r\n n, k, t = map(int, input().split())\r\n \r\n print(min(t, k, n + k - t))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n,k,t = map(int,input().split())\r\nsitting = max(0, t-k)\r\nif t>n:\r\n standing = n \r\nelse:\r\n standing = t\r\nprint(standing-sitting)", "n, k, t = map(int, input().split())\r\nif k<=t<=n:\r\n\tprint(k)\r\nelif t<k:\r\n\tprint(t)\r\nelse:\r\n\tprint(n+k-t)", "print((lambda a: min(a[1],a[2]) if a[2]<=a[0] else a[1]-a[2]+a[0])(list(map(int,input().split()))))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "def process2(in_list):\n\tn = in_list[0]\n\tk = in_list[1]\n\tt = in_list[2]\n\tif t <= k:\n\t\tprint(t)\n\telif t <= n:\n\t\tprint(k)\n\telse:\n\t\tprint(k - (t - n))\nin_list = list(map(int, input().split()))\nprocess2(in_list)\n", "n,k,t = [ int(x) for x in input().split() ]\n\nif t <= k:\n print(t)\nelif t >= n+1:\n print(k - t + n)\nelse:\n print(k)\n", "n,t,x = map(int,input().split())\r\n\r\nif x<=t:\r\n\tprint(x)\r\nelif x>t and x<=n:\r\n\tprint(t)\r\nelse:\r\n\tprint(t-x%n)", "n,k,t=map(int,input().split())\r\n\r\n\r\nres = min(k,t,n+k-t)\r\nprint(res)\r\n", "n,k,t=map(int,input().split())\r\nif(t<=k):\r\n print(t)\r\nelif(t<=n):\r\n print(t-(t-k))\r\nelse:\r\n print(n-(t-k))\r\n", "n,k,t=map(int,input().split())\nf=n+k-t\nif t<=k:\n print(t)\nelif k<=t and t<=n:\n print(k)\nelif n<=t and t<n+k:\n print(f)\n\n", "a = list(map(int,input().split()))\r\nn = a[0]\r\nk = a[1]\r\nt = a[2]\r\n#print(n,k,t)\r\nif (t<=k):\r\n print(t)\r\nelif t in range(k,n):\r\n print(k)\r\nelse:\r\n print(k-t+n)", "n,k,t=map(int,input().split())\nif t <= k:\n\tprint(t)\nelif t<=n:\n\tprint(k)\nelse:\n\tprint(k-t+n)", "n, k, t = [int(x) for x in input().split()]\r\n\r\nif k <= t <= n:\r\n print(k)\r\nelif t < k:\r\n print(t)\r\nelse:\r\n print(n + k - t)\r\n", "def main():\r\n n, k,t = [int(v) for v in input().split()]\r\n if t<k:\r\n print(t)\r\n elif t>n:\r\n print(k-(t-n))\r\n else:\r\n print(k)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main(n, k, t):\n if t == 0 or t == n + k:\n return 0\n if t <= n:\n return min(t, k)\n return k - (t - n)\n\n(n, k, t) = map(int, input().split(' '))\nprint(main(n, k, t))\n", "n,k,t=map(int,input().split())\r\nif 1<=n and n<=pow(10,9) and 1<=k and k<=n and 1<=t and t<=n+k:\r\n\tif t<=n:\r\n\t\tif t<=k:\r\n\t\t\tprint(t)\r\n\t\telse:\r\n\t\t\tprint(k)\r\n\telse:\r\n\t\tif t<=n+k:\r\n\t\t\tprint((n+k)-t)", "n, k, t = map(int, input().split())\r\nans = 0\r\nif t <= k:\r\n ans = t\r\nelif k < t <= n:\r\n ans = k\r\nelif t > n and t > k:\r\n ans = k - (t - n)\r\nprint(ans)\r\n", "import sys\r\nn,k,t=map(int,input().split())\r\nif t<=k:\r\n print (t)\r\nelif t>n+k:\r\n print (0)\r\nelif t<=n:\r\n print (k)\r\nelse:\r\n print (k-(t-(n)))", "import sys,math\ninput=sys.stdin.readline\n\nL=lambda : list(map(int,input().split()))\nM=lambda : map(int,input().split())\n\nl=L()\nif(l[2]<=l[1]):\n print(l[2])\nelif(l[2]>l[0]):\n print(l[1]-(l[2]%l[0]))\nelse:\n print(l[1])\n", "n, k, t = map(int, input().split())\r\n\r\nans = k\r\nans -= [0,k-t][t<k]\r\nans -= [0,t-n][t>n]\r\n\r\nprint(ans)", "def solve():\r\n a = input().split()\r\n n = int(a[0])\r\n k = int(a[1])\r\n t = int(a[2])\r\n\r\n if t <= k:\r\n return t\r\n elif t <= n:\r\n return k\r\n else:\r\n return (n + k - t)\r\n\r\nprint(solve())", "n,k,t = map(int, input().split())\r\nprint(min((n+k-t), k, t))", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\na,b,c= list(map(int, input().split()))\r\nif c<=b:\r\n print(c)\r\nelif c<=a:\r\n print(b)\r\nelse:\r\n print(a-c+b)", "n,k,t = map(int,input().split())\r\nif t <=k:\r\n print (t)\r\nelif t<=n:\r\n print (k)\r\nelse:\r\n print (k - (t-n))", "n,k,t = [int(x) for x in input().strip().split()]\n\nprint(k if k < t < n else t if t <= k else k-t+n)", "n,k,t=map(int,input().split())\r\nif(t<=k):\r\n print(t)\r\nelif(k<t<=n):\r\n print(k) \r\nelse:\r\n ans=k-(t-n)\r\n if(ans>0) :\r\n print(ans) \r\n else:\r\n print(0) ", "# coding: utf-8\n\nif __name__ == \"__main__\":\n n, k, t = map(int, input().split())\n\n standing = 0\n if (t < k):\n standing = t\n elif (t < n):\n standing = k\n else:\n standing = k + n - t\n\n print(standing)\n\n\n", "n,k,t=list(map(int,input().split()))\r\nif t>n:\r\n print(k-(t-n))\r\nelif t<k:\r\n print(t)\r\nelse:\r\n print(k)", "import math\r\nimport re\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef ri():\r\n return int(input())\r\n\r\n\r\ndef rfa():\r\n return [float(i) for i in input().split()]\r\n\r\nn,k,t= ria()\r\n\r\nt%=k+n\r\nif t<=k:\r\n print(t)\r\nelif t<=n:\r\n print(k)\r\nelse:\r\n print(k+n-t)\r\n", "\n# coding: utf-8\n\n# In[19]:\n\nx = list(map(int,input().split(' ')))\nif x[2] < x[1]:\n print(x[2])\nelif x[2] < x[0]:\n print(x[1])\nelse:\n print(x[0]+x[1]-x[2])\n \n\n\n# In[ ]:\n\n\n\n", "n, k, t = map(int, input().split())\r\nprint(min(t, k, n+k-t))", "n,k,t=list(map(int,input().split()))\r\nif (t<k):\r\n print(t)\r\nelif ((k<=t) and (t<=n)):\r\n print(k)\r\nelse:\r\n print(n-t+k)", "#Arpa and a research in Mexican wave (851A)\r\ninp = input().split()\r\nn = int(inp[0])\r\nk = int(inp[1])\r\nt = int(inp[2])\r\n#print(n,k,t)\r\nans = 0\r\nif (t<=k):\r\n ans = t\r\nelse:\r\n if t<=n:\r\n ans = k\r\n else:\r\n ans = k-(t-n)\r\nprint(ans)", "n, k, t = [int(s) for s in input().split(\" \")]\r\nif t <= k:\r\n print(t)\r\nelif t <= n:\r\n print(k)\r\nelse:\r\n print(k - (t-n))", "n,k,t=map(int,input().split())\r\na=n+k\r\nif t<=k:\r\n print(t)\r\nelif k<=t<=n:\r\n print(k)\r\nelif n<=t<a:\r\n print(n+k-t)\r\n", "X=list(map(int,input().split()))\r\nif X[2]<X[1]:\r\n print(X[2])\r\nelif X[2]>=X[1] and X[2]<X[0]:\r\n print(X[1])\r\nelse:\r\n print(X[1]-(X[2]-X[0]))", "n, k, t=map(int, input().split())\r\n\r\nif k<=t<=n:\r\n\tprint(k)\r\nelse:\r\n\tif t>n:\r\n\t\tprint(k-(t%n))\r\n\telse:\r\n\t\tprint(t%k)", "n, o, t = map(int, input().split())\r\nif t <= o:\r\n print(t)\r\nelif t <= n:\r\n print(o)\r\nelse:\r\n print(o - t + n)", "n,k,t=map(int,input().split())\r\nif(k>=t):\r\n print(t)\r\nelif(k<t and t<=n):\r\n print(k)\r\nelse:\r\n print(k+n-t)", "n, k, t = map(int,input().split())\r\nif t<=k:\r\n print(t)\r\nelif t>n:\r\n print(n+k-t)\r\nelse:\r\n print(k)", "n, k, t = map(int, input().split(\" \"))\r\nans = min(k, t, n + k - t)\r\nprint(ans)", "n,k,t = list(map(int,input().split()))\r\nif t<=k:\r\n print(t)\r\nelif t>k and t<=n:\r\n print(k)\r\nelse:\r\n stand = k-(t-n)\r\n print(stand)\r\n\r\n\r\n", "def count(n, k, t):\r\n if t <= k:\r\n return t\r\n elif t <= n:\r\n return k\r\n elif t <= n + k:\r\n return k - t + n\r\n else:\r\n return 0\r\n\r\nn, k, t = map(int, input().split())\r\nprint(count(n, k, t))\r\n", "l1 = input().split()\nn = int(l1[0])\nk = int(l1[1])\nt = int(l1[2])\n\nif t <= k:\n print(t)\n exit()\nif (t > k) and (t <= n):\n print(k)\n exit()\nif t > n:\n print(k-(t-n))\n exit()\n \t\t\t \t \t\t \t \t\t\t\t \t \t\t", "n,k,t=map(int,input().strip().split())\r\n#print(n,k,t)\r\n\r\nk2=k+k\r\nif t<k:\r\n ans=t\r\nelif t>n:\r\n # print(\"here\")\r\n ans=n+k-t\r\nelse:\r\n ans=k\r\n \r\nprint(ans)\r\n \r\n", "def solution():\n\tn, k, t = map(int, input().split())\n\tif t <= k:\n\t\treturn t\n\tif t <= n:\n\t\treturn k\n\treturn n + k - t\n\nif __name__ == '__main__':\n\tprint(solution())", "n, k, t = map(int, input().split())\r\nif n > t:\r\n print(min(n, k, t))\r\n exit(0)\r\nprint(n+k-t)", "def solution(l1):\r\n t=l1[2]\r\n k = l1[1]\r\n n = l1[0]\r\n if t<=k:\r\n return t\r\n elif t<=n:\r\n return k\r\n else:\r\n return n+k-t\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n print(solution(l1))\r\nanswer()", "import sys\r\n\r\n[n,k,t] = list(map(int,sys.stdin.readline().split()))\r\n\r\ndef ans(n,k,t):\r\n if t <= k:\r\n print(t)\r\n elif t >= n and t-n <= k:\r\n print(n+k-t)\r\n else:\r\n print(k)\r\n\r\nans(n,k,t)", "a,b,c=map(int,input().split())\r\nif c<=b:\r\n print(c)\r\nelif c>b and c<=a:\r\n print(b)\r\nelse:\r\n d=c-a\r\n print(b-d if b-d>=0 else 0)", "n, k, t = list(map(int, input().split()))\n\nif t < k:\n\tans = t\nelif t > n:\n\tans = n + k - t\nelse:\n\tans = k\n\nprint(ans)", "n,k,t = map(int, input().split())\nif t <=k:\n print(t)\nelif t<=n:\n print(k)\nelse:\n print(k-t+n)\n", "n,k,t = list(map(int, input().split()))\r\n \r\nif t<=k:\r\n print(t)\r\nelif t>=k and t<=n:\r\n print(k)\r\nelse:\r\n print(n+k-t)", "n,k,t=map(int,input().split())\r\nif t<k:\r\n\tprint(t)\r\nelif k<=t and t<=n:\r\n\tprint(k)\r\nelse:\r\n\tprint(n+k-t)", "a, b, c = map(int, input().split())\r\nif(c <= a):\r\n print(min(b, c))\r\nelse:\r\n print(a + b - c)\r\n", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nt = int(a[2])\r\nif t < k:\r\n print(t)\r\nelif t > n:\r\n print(k - t + n)\r\nelse:\r\n print(k)\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\na, b, c = list(map(int, input().split()))\r\nif c <= b:\r\n\tprint(c)\r\nelif c > a:\r\n\tprint(b - (c - a))\r\nelse:\r\n\tprint(b)\r\n\t\r\n", "n, k, t = map(int, input().split())\r\nanswer = 0\r\nif t <= k:\r\n answer = t\r\nelif t <= n:\r\n answer = k\r\nelse:\r\n answer = k + n - t\r\nprint(answer)\r\n", "from sys import stdin, stdout\nfrom collections import defaultdict\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\tn,k,t=read_ints()\n\tprint(min(t,n)-max(1,t-k+1)+1)\n\nsolve()\n", "n,k,t = list(map(int,input().split()))\r\nprint(min(t,k,n-t+k))\r\n", "x=str(input(\"\"))\narr1=[]\narr2=[]\narr1=x.split()\nfor i in range(3):\n arr2.append(int(arr1[i]))\ntime=0\nif(arr2[2]<=arr2[1]):\n time=arr2[2]\nif(arr2[2]>arr2[1] and arr2[2]<=arr2[0]):\n time=arr2[1]\nif(arr2[2]>arr2[0]):\n time=arr2[0]+arr2[1]-arr2[2]\nprint(time)\n\t \t\t\t\t \t \t\t\t \t\t \t \t \t\t", "n,k,t=map(int,input().split())\r\na=0\r\nif(t<=k):\r\n\ta=t\r\nif(k<t<=n):\r\n\ta=k\r\nif(t>n):\r\n\ta=k+(n-t)\r\nprint(a)", "def inp(a,n):\r\n s = '';\r\n j = 1;\r\n for i in a:\r\n if (i != ' ' and j <= n):\r\n s += i\r\n else:\r\n j += 1\r\n if (j>n):\r\n break\r\n else:\r\n s = ''\r\n if (s != ''):\r\n c = int(s)\r\n else:\r\n c = 0;\r\n return c;\r\n\r\n\r\na = input()\r\nn = int(inp(a,1))\r\nk = int(inp(a,2))\r\nt = int(inp(a,3))\r\nif k>t:\r\n print(t)\r\nelif t > n:\r\n print(n+k-t)\r\nelse:\r\n print(k)\r\n", "\r\nn,k,t = map(int, input().split())\r\n \r\nprint(min(n,t) - max(0, t-k) )", "n,k,t = map(int,input().split())\r\nif t <= k:\r\n\tprint(t)\r\nelif t > k and t <= n:\r\n\tprint(k)\r\nelif t == n+k :\r\n\tprint(0)\r\nelse:\r\n\tprint(k-(t-n))", "a,b,c=map(int,input().split());print(min(b,c,a+b-c))", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/19 17:14\r\n\r\n\"\"\"\r\n\r\nN, K, T = map(int, input().split())\r\n\r\nif T <= K:\r\n print(T)\r\nelif T <= N:\r\n print(K)\r\nelif T <= N+K:\r\n print(N+K-T)\r\nelse:\r\n print(0)", "n, k, t = [int(x) for x in input().split()]\r\nif k>=t:\r\n print(t)\r\nelif t>k and t<n:\r\n print(k)\r\nelif t>k and t>=n:\r\n print(n+k-t)", "a, b, c = [int(i) for i in input().split()]\r\nif(c<=b):\r\n print(c)\r\nelif(c>a):\r\n print(b+a-c)\r\nelse:\r\n print(b)", "def solution():\r\n n, k, t = map(int, input().split())\r\n if t <= k:\r\n print(t)\r\n return\r\n if t <= n:\r\n print(k)\r\n return\r\n print(k - (t - n))\r\n return\r\n \r\nsolution()", "\r\n\r\nn,k,t= [int(x) for x in input().split()]\r\n\r\nif t<=k:\r\n print(t)\r\nelif t>=n:\r\n print(n+k-t)\r\nelse:\r\n print(k)\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n, k, t = tuple(map(int, input().split()))\r\n\r\ndef s():\r\n if t <= k:\r\n return t\r\n if t <= n:\r\n return k\r\n return n + k - t\r\n\r\nprint(s())\r\n", "n,k,t=map(int,input().split())\r\nif t<=k:\r\n print(t)\r\nelif t>k and t<=n:\r\n print(k)\r\nelse:\r\n t=t-n\r\n if k-t>0:\r\n print(k-t)\r\n else:\r\n print('0')", "# http://codeforces.com/contest/851/problem/A\r\nget=lambda:list(map(int,input().split()))\r\nn,k,t=get()\r\nif t<=k:\r\n ans=t\r\nelif t<=n:\r\n ans=k\r\nelse: \r\n ans=n-t+k\r\nprint(max(ans,0))\r\n", "n, k, t = map(int, input().split())\nif (t<=k):\n stand = t\nelif (t<=n):\n stand = k\nelse:\n stand = n+k-t\nprint(stand)\n\t \t\t\t \t\t\t\t \t \t\t \t \t \t\t\t \t", "\nn, k, t = map(int, input().strip().split(' '))\n\nif t <= n:\n if k>t:\n print(t)\n else:\n print(k)\nelse:\n print(k - t + n)\n", "read = list(map(int, input().split()))\r\nn, k, t = read[0], read[1], read[2]\r\nprint(min(t, k, k - t + n))", "# n=int(input())\r\n# while(n>0):\r\nl=list(map(int,input().split()))\r\nif l[2]<=l[1]:\r\n print(l[2])\r\nelif l[2]>l[1] and l[2]<=l[0]:\r\n print(l[1])\r\nelse:\r\n print(l[1]-l[2]+l[0])\r\n \r\n\r\n\r\n# n-=1", "from math import *\r\n\r\nn,k,t = map(int,input().split())\r\nif (t>=k and t <=n):\r\n print(k)\r\nelse:\r\n print(min(t,n+k-t))", "n,k,t = map(int,input().split())\r\nif t >= n :\r\n t = t % n \r\n print(k-t)\r\nelse :\r\n print(t) if (t< k) else print(k)\r\n\r\n", "n,k,t=map(int,input().split())\r\n\r\ns=0\r\nif t<=k:\r\n \r\n print(t)\r\nelif t>k and t<=n:\r\n print(k)\r\nelse:\r\n \r\n s=(t-n)\r\n print(k-s)\r\n\r\n#used for refernce:-\r\n# l=[]\r\n# # sit=0\r\n# # stand=1\r\n# for i in range(n):\r\n# l.append(0)\r\n\r\n# for i in range(t):\r\n# if i<k and i<n:\r\n# l[i]=1\r\n# elif i>=k and i<n:\r\n# l[i]=1\r\n# l[i-k]=0\r\n# elif i>n:\r\n# l[i-k-1]=0\r\n# l[i-k]=0\r\n \r\n# # print(l)\r\n# stand=0\r\n# for j in l:\r\n# if j==1:\r\n# stand+=1\r\n# print(stand)\r\n\r\n\r\n \r\n", "n,k,t = map(int,input().split())\r\n\r\nres = 0\r\n\r\nif t <= k:\r\n res = t\r\nelif t > n:\r\n res = k - (t-n)\r\nelse:\r\n res = k\r\n\r\nprint(str(res))\r\n", "n,k,t=list(map(int,input().split()))\r\nif t<k:\r\n\tprint(t)\r\nelif t<n:\r\n\tprint(k)\r\nelse:\r\n\tprint(max((n-(t-k)),0))\r\n", "n, k, t = input().split()\r\nn, k, t = int(n), int(k), int(t)\r\n\r\nif t <= k:\r\n print(t)\r\nelif t > n:\r\n print(max(n + k - t, 0))\r\nelse:\r\n print(k)\r\n", "n,k,t = map(int,input().split())\r\n\r\nif t<=k:\r\n\tprint(t)\r\nelif k<t<n:\r\n\tprint(k)\r\nelse:\r\n\tprint(k-(t-n))", "n,k,t = map(int, input().split())\r\n\r\nif t <= k :\r\n print (t)\r\nelif t > k and t<=n:\r\n print (k)\r\nelse:\r\n print (k- (t-n))", "\r\nfrom sys import stdin, stdout\r\n\r\ndef main():\r\n t = stdin.readline().split()\r\n n = int(t[0])\r\n k = int(t[1])\r\n t = int(t[2])\r\n if t > n :\r\n print(abs(n-(t-k)))\r\n else:\r\n if t > k :\r\n print(k)\r\n else:\r\n print(t)\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "a,b,c = map(int,input().split())\r\nif c<=b:\r\n\tprint(c)\r\nelif c>b and c<a:\r\n\tprint(b)\r\nelif c>=a:\r\n\tprint(b+a-c)", "n,k,t=map(int,input().split())\r\nif k>t:\r\n print(t)\r\nelif t>=k and n>t:\r\n print(k)\r\nelse:\r\n num=abs(n-t)\r\n print(k-num)\r\n ", "n,k,t=map(int,input().split())\r\nif t<k:print(t)\r\nelif k<=t<=n:print(k)\r\nelse:print(k-(t-n))\r\n", "n,k,t=map(int,input().split())\r\nif (t<=n):\r\n if (t<=k):\r\n print(t)\r\n else:\r\n print(k)\r\nelse:\r\n print(k-(abs(n-t)))\r\n", "\r\nn,k,t=map(int,input().split())\r\nprint(min(t,k,n+k-t))", "n,k,t=map(int,input().split());\r\nif t in range(0,k):\r\n print(t)\r\nelif t in range(k,n+1):\r\n print(k)\r\nelse :\r\n print(k-t%n)", "n,k,t = list(map(int,input().split()))\r\n\r\nif t <= k:\r\n\tprint(t)\r\nelif t <= n:\r\n\tprint(k)\r\nelse:\r\n\tprint(n+k-t)", "n, k, t=tuple(int(x) for x in input().strip().split())\r\nif t < k:\r\n print(t)\r\nelse:\r\n if t > n:\r\n print(k - (t - n))\r\n else:\r\n print(k)\r\n", "n, k, t = map(int, input().split())\r\nv = min(k, t, n+k-t)\r\nprint(v)\r\n", "n,k,t=map(int,input().split())\r\nif t<k:\r\n print(t)\r\nelif t>n:\r\n t=n-(t-k)\r\n print(t) \r\nelse:\r\n sitting=(n-t)+(t-k)\r\n print(n-sitting)\r\n\r\n", "n,k,t=[int(i) for i in input().split()]\r\nif t<=k:\r\n print(t)\r\nelif t<=n:\r\n print(k)\r\nelse :\r\n x=t-n\r\n print(k-x)", "n, k, t = [int(x) for x in input().split()]\n\nif t < k:\n\tprint(t)\nelif t > n:\n\tprint(n + k - t)\nelse:\n\tprint(k)\n\t", "s=input().split()\r\nn,k,t=int(s[0]),int(s[1]),int(s[2])\r\nprint (min(t,k,n+k-t))\r\n", "n,k,t = map(int,input().split())\nif k >= t : print(t)\nelif k < t <= n : print(k)\nelse : print(k-t+n)", "def main():\n N, K, T = map(int, input().split())\n\n ans = min(K, T, N, K - (T - N))\n print(ans)\n\nmain()\n", "def list_input():\r\n return list(map(int,input().split()))\r\ndef map_input():\r\n return map(int,input().split())\r\ndef map_string():\r\n return input().split()\r\n \r\nn,k,t = map_input()\r\nif t <= k:\r\n print(t)\r\nelif t <= n:\r\n print(k)\r\nelse:\r\n print(k+n-t)", "a, b, c = map(int,input().split())\nif c >= b and c <= a:\n\tprint(b)\nelif c < b:\n\tprint(c)\nelif c > a:\n\tprint(b -(c - a))\n", "Input = input().split()\r\n\r\nn = int(Input[0])\r\nk = int(Input[1])\r\nt = int(Input[2])\r\n\r\nif t <= k:\r\n print(t)\r\n\r\nelif t <= n:\r\n print(k)\r\nelif t > n:\r\n print(k-(t-n))", "x,y,z = map(int,input().split())\r\nprint(min(z,min(y,y-(z-x))))\r\n", "n,k, t= map(int, input().split())\r\n\r\nif t<=k:\r\n print(t)\r\nelif k<=t<=n:\r\n print(k)\r\nelif n<=t<n+k:\r\n print(n+k-t)", "p = list(map(int, input().split()))\nprint(p[2] if (p[1] >= p[2]) else p[1] if p[2] > p[1] and p[2] <= p[0] else (p[1] - (p[2] - p[0])))\n", "n, k, t = map(int, input().split())\nans = None\nif t < k:\n ans = t\nelif t > n:\n ans = n + k - t\nelse:\n ans = k\nprint(ans)", "n,k,t = map(int,input().strip().split())\r\nprint(min(t,k,n+k-t))", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,k,t = map(int, wtf[0].split())\r\n if n-t >=0:\r\n if t<k:\r\n print(t)\r\n else:\r\n print(k)\r\n else:\r\n print(k-(t-n))\r\n", "inp = input().split(\" \")\nn = int(inp[0])\nk = int(inp[1])\nt = int(inp[2])\n\nif t > (k - 1) and t < (n + 1):\n ans = k\nelse:\n if t <= (k - 1):\n ans = t\n else:\n ans = abs(n + k - t)\n\nprint(ans)\n", "nkt=input().split()\r\nn=int(nkt[0])\r\nk=int(nkt[1])\r\nt=int(nkt[2])\r\nif(t<=k):\r\n\tprint(t)\r\nelif(k<t<n):\r\n\tprint(k)\r\nelse:\r\n\tprint(n+k-t)", "n, k, t = map(int, input().split())\r\n\r\nif n < t:\r\n print(k - (t-n))\r\nelse:\r\n if k < t: print(k)\r\n else: print(t)", "n, k, t = map(int, input().split())\r\nprint(min(t, k, n + k - t))", "def main():\n\tfrom sys import stdin,stdout\n\tn,k,t = map(int,stdin.readline().split())\n\tif t == 0:\n\t\tstdout.write('0')\n\telse:\n\t\tif t>k:\n\t\t\tif t>n:\n\t\t\t\tstdout.write(str(n-(t-k)))\n\t\t\telse:\n\t\t\t\tstdout.write(str(k))\n\t\telse:\n\t\t\tstdout.write(str(t))\nif __name__=='__main__':\n\tmain()\n", "# cf 851 A 800\nn, k, t = map(int, input().split())\n\nstanding = min(k, n)\nstanding = min(t, k) # at start\nif t > n:\n # 5 - (12 - 10) = 5 - 2\n visible = max(0, k - (t - n))\n standing = min(standing, visible)\nprint(standing)\n", "n,k,t=list(map(int,input().split()))\r\nif(k>=t):\r\n print(t)\r\nelif(n>=t):\r\n print(k)\r\nelse:\r\n print(n+k-t)", "n,k,t = map(int,input().split())\r\n\r\nif t<=k:\r\n\tprint(t)\r\nelse:\r\n\tif t<=n:\r\n\t\tprint(k)\r\n\telse:\r\n\t\tprint(k-(t-n))\r\n", "n, k, t = map(int, input().split())\r\nprint(t if t <= k else k if t <= n else k+n-t)\r\n", "\r\nl = list(map(int, input().split()))\r\nt = l[2]\r\nn = l[0]\r\nk = l[1]\r\nif t < k + 1:\r\n\tprint(t)\r\n\texit()\r\nelif t < n + 1:\r\n\tprint(k)\r\n\texit()\r\nelse:\r\n\tprint(n + k - t)\r\n\t", "import sys\r\ninput = sys.stdin.readline\r\nn,k,t = map(int,input().split())\r\nif k<=t<=n:\r\n print(k)\r\nelse:\r\n print(min(t,abs(n+k-t)))\r\n", "n, k, t = map(int,input().split(\" \"))\r\nv = min(t,k,n+k-t)\r\nprint(v)", "n,k,t=map(int, input().split())\r\n\r\nif t<k:\r\n print(t)\r\n\r\nelif t<=n:\r\n print(k)\r\n\r\nelse:\r\n print(n+k-t)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,k,t=map(int,input().split())\r\nif t<=k:print(t)\r\nelif t>=n:print(n+k-t)\r\nelse:\r\n print(k)", "n,k,t= input().split()\r\nn= int(n)\r\nk= int(k)\r\nt= int(t)\r\n\r\nif t<=k:\r\n print(t)\r\nelif t>k and t<n:\r\n print(k)\r\nelse:\r\n print(k-t+n)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 19 16:14:03 2019\r\n\r\n@author: sihan\r\n\"\"\"\r\n\r\nn,k,t=map(int,input().split())\r\nprint(min(t,n)-max(0,t-k))", "n,t,k = map(int,input().split())\r\n\r\nif(t>k):\r\n print(k)\r\nelif(k>n):\r\n print(t-(k-n))\r\nelse:\r\n print(t)", "import sys\r\n\r\nn, k, t = (int(el) for el in input().split())\r\n\r\nif t <= k:\r\n print(t)\r\n sys.exit()\r\n \r\nif t >= k and t <= n:\r\n print(k)\r\n sys.exit()\r\n \r\nprint(k - (t - n))", "n, k, t=map(int, input().split())\nif t<=k:\n\tprint(t)\nelif t>=k and t<=n:\n\tprint(k)\nelse:\n\tprint(n+k-t)", "n, k, t = map(int, input().split())\r\nif t <= k: print(t)\r\nelif t <= n: print(k)\r\nelse: print(k - t + n)", "n,k,t=map(int,input().split())\r\nprint(min(k,t,((n+k)-t)))", "n,k,t=list(map(int,input().split()))\r\nprint(min(t,k,n+k-t))", "l = input().split()\r\nn = int(l[0])\r\nk = int(l[1])\r\nt = int(l[2])\r\n\r\nstand = 0\r\n\r\nif t <= k:\r\n stand = t\r\nelif t > k and t <= n:\r\n stand = k\r\nelse:\r\n stand = k - (t - n)\r\n\r\nprint(stand)", "n, k ,t = map(int, input().split())\r\n\r\nif t <= k:\r\n print(t)\r\n\r\nelif t>k and t<=n:\r\n print(k)\r\n\r\nelse:\r\n time = t-n\r\n print(k-time)", "n, k, t = list(map(int, input().split(' ')))\n\ndef main():\n if t < k:\n return t\n elif k <= t <= n:\n return k\n else:\n return n + k - t\n\nprint(main())\n", "n, k, t=map(int, input().split())\nprint(min(t, k, n+k-t))\n", "n,k,t=map(int,input().split())\r\nif t<k:\r\n print(t)\r\nelif t<n+1:\r\n print(k)\r\nelif t>n:\r\n print(n+k-t)\r\n \r\n\r\n", "n, k, t = map(int, input().split())\r\n\r\n\r\ndef f():\r\n if t <= k:\r\n return t\r\n elif t > k and t <= n:\r\n return k\r\n elif t > n:\r\n return k - (t - n)\r\n\r\n\r\nprint(f())", "n, k, t = map(int, input().split())\r\nprint(min([t,k,n+k-t]))", "from sys import stdin\r\ninput = lambda :stdin.readline().strip()\r\n\r\nn, k, t = map(int, input().split())\r\nif t <= k:\r\n\tprint(t)\r\nelif k < t <= n:\r\n\tprint(k)\r\nelse:\r\n\tprint(n + k - t)\r\n", "take = input().split(' ')\r\ntotal = int(take[0])\r\nk = int(take[1])\r\ntime = int(take[2])\r\nif (time<=k):\r\n print (time)\r\nelif (time>k and time<=total):\r\n print (k)\r\nelif (time> k and time > total):\r\n diff = time - total\r\n print (k - diff)", "L = input()\r\nL = L.split()\r\nn = int(L[0])\r\nk = int(L[1])\r\nt = int(L[2])\r\nb = True\r\np = k\r\nif t < k +1 :\r\n print (t)\r\n\r\nif t > k and t <= n:\r\n print (k)\r\nj = t - n\r\nwhile t > n and j <= p:\r\n k -= j\r\n print (k)\r\n break\r\n", "q,w,e=map(int,input().split())\r\na=q+w\r\na=e%a\r\nif a<w:\r\n print(a)\r\nelif w<=a<=q:\r\n print(w)\r\nelse:\r\n print((q+w)-a)\r\n", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN,K,T=map(int,input().split())\r\nif T<N:\r\n\tif T<=K:\r\n\t\tprint(T)\r\n\telse:\r\n\t\tprint(K)\r\nelse:\r\n\tprint(K-(T%N))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\n\r\nn,k,t=map(int,input().split())\r\nif t<=k:\r\n\tprint(t)\r\nelif (t<n and t>=k):\r\n\tprint(k)\r\nelse:\r\n\tprint(n+k-t)", "a, b, c = map(int, input().split())\r\nif c <= b: print(c, end = '')\r\nelif c <= a: print(b, end = '')\r\nelse: print(a + b - c, end = '')", "n, k, t = map(int, input().split())\r\nprint(min(k, t, n+k-t))", "from sys import stdin, stdout\n\nn,k,t = map(int,stdin.readline().rstrip().split())\n\nprint(max([min([n,t])-max([0,t-k]),0]))\n", "n,k,t=map(int,input().split())\nif(0<t<=k):\n print(t)\nelif(k<t<=n):\n print(k)\nelif(n<t<=n+k):\n print(n+k-t)\nelse:\n print(0)\n\t\t \t \t\t \t\t \t \t\t\t \t\t\t \t", "a,k,t = map(int,input().split())\r\nif(t<=k):\r\n print(t)\r\nelif(t>=a):\r\n print(a+k-t)\r\nelse:\r\n print(k)" ]

[ "fact = [0 for _ in range(35)]\r\nfact[0] = 1\r\nfor q in range(1,35):\r\n fact[q] = fact[q-1]*q\r\namts = []\r\nans = 0\r\ndef multinom():\r\n tot = 0\r\n for i in amts:\r\n tot = tot + i\r\n ret = fact[tot]\r\n for i in amts:\r\n ret = ret / fact[i]\r\n return ret\r\n\r\nt = int(input())\r\ndigct = []\r\nfor i in range(10):\r\n digct.append(0)\r\ntcpy = t\r\nwhile tcpy > 0:\r\n digct[int(tcpy%10)] = digct[int(tcpy%10)]+1\r\n tcpy = tcpy // 10\r\ndef dfs(place):\r\n global ans\r\n if place == 10:\r\n ans = ans + multinom()\r\n if amts[0] > 0:\r\n amts[0] = amts[0]-1\r\n ans = ans - multinom()\r\n amts[0] = amts[0]+1\r\n return\r\n if digct[place] == 0:\r\n amts.append(0)\r\n dfs(place+1)\r\n amts.pop()\r\n else:\r\n for q in range(1, digct[place]+1):\r\n amts.append(q)\r\n dfs(place+1)\r\n amts.pop()\r\n\r\ndfs(0)\r\nprint(int(ans))\r\n", "from math import factorial as f\r\nfrom itertools import permutations\r\n\r\ns = input()\r\nc = [s.count(str(i)) for i in range(10)]\r\nans = 0\r\nfor d0 in range(c[0] != 0, c[0] + 1):\r\n for d1 in range(c[1] != 0, c[1] + 1):\r\n for d2 in range(c[2] != 0, c[2] + 1):\r\n for d3 in range(c[3] != 0, c[3] + 1):\r\n for d4 in range(c[4] != 0, c[4] + 1):\r\n for d5 in range(c[5] != 0, c[5] + 1):\r\n for d6 in range(c[6] != 0, c[6] + 1):\r\n for d7 in range(c[7] != 0, c[7] + 1):\r\n for d8 in range(c[8] != 0, c[8] + 1):\r\n for d9 in range(c[9] != 0, c[9] + 1):\r\n scnt = [d0, d1, d2, d3,\r\n d4, d5, d6, d7, d8, d9]\r\n li = []\r\n for i in range(10):\r\n li += [i] * scnt[i]\r\n for i in range(1, 10):\r\n if not scnt[i]:\r\n continue\r\n k = scnt[:]\r\n k[i] -= 1\r\n x = f(sum(k))\r\n for j in range(10):\r\n x //= f(k[j])\r\n ans += x\r\nprint(ans)\r\n", "def P(a):\r\n k = 1\r\n c = 0\r\n for i in range(0, 10):\r\n k *= fact[a[i]]\r\n if a[i] != 0:\r\n c += a[i]\r\n return fact[c] // k\r\n\r\n\r\ndef P_0(a):\r\n k = 1\r\n c = 0\r\n for i in range(0, 10):\r\n if i == 0 and a[0] >= 0:\r\n k *= fact[a[0] - 1]\r\n c += a[0]-1\r\n else:\r\n k *= fact[a[i]]\r\n c += a[i]\r\n return fact[c] // k\r\n\r\ndef solve (i,a):\r\n if i >= 10:\r\n global sol\r\n sol += P(a)\r\n if a[0] > 0:\r\n sol = sol - P_0(a)\r\n return\r\n if rep[i] == 0:\r\n solve (i+1,a)\r\n for x in range(1,rep[i]+1):\r\n a[i] = a[i]+x\r\n solve (i+1,a)\r\n a[i] -= x\r\n\r\nsol = 0\r\nfact = [1]\r\nfor i in range(1,20): # Crearemos un array con los factoriales de 1 hasta 20 que usaremos en los calculos\r\n fact.append(fact[i-1]*i)\r\nn = str(input()) # Se introduce el valos de entrada\r\nrep = [0 for i in range(10)] # cremos un array que usaremos para saber las repeticiones de los digitos\r\nfor c in n:\r\n rep[int(c)] += 1\r\na = [0,0,0,0,0,0,0,0,0,0]\r\nsolve(0,a)\r\nprint (sol)\r\n", "n = input()\r\n\r\nfact=[1]\r\n\r\nfor i in range(len(n)):\r\n fact.append((i+1)*fact[-1])\r\n\r\ntimes=[0 for i in range(10)]\r\n\r\nfor val in n:\r\n times[int(val)]+=1\r\n\r\n#print(times)\r\n\r\ndef yoyo(vect):\r\n l=sum(vect)\r\n temp=fact[l-1]*(l-vect[0])\r\n for j in range(10):\r\n temp/=fact[vect[j]]\r\n# print(vect,\"ans == \",temp)\r\n return temp\r\n\r\ndef recursive(a,pos):\r\n# print(a,pos)\r\n if pos==10:\r\n# print(a)\r\n return yoyo(a)\r\n temp_ans=0\r\n if times[pos]==0:\r\n temp_ans+=recursive(a,pos+1)\r\n for i in range(times[pos]):\r\n a[pos]+=1\r\n temp_ans+=recursive(a,pos+1)\r\n# a[pos]+=1\r\n# print(i,\"==i\")\r\n a[pos]=0\r\n return temp_ans\r\n\r\nans=0\r\n\r\nprint(int(recursive([0 for i in range(10)],0)))\r\n", "fact_dict = [1, 1]\r\nfor i in range(2, 21):\r\n fact_dict.append(fact_dict[-1]*i)\r\n\r\ndef find_tuples(d):\r\n start = [[]]\r\n for i in range(10):\r\n next_s = []\r\n if d[i]==0:\r\n for x in start:\r\n x2 = [y for y in x]\r\n next_s.append(x2+[0])\r\n else:\r\n for x in start:\r\n for j in range(1, d[i]+1):\r\n x2 = [y for y in x]\r\n next_s.append(x2+[j])\r\n start = next_s \r\n return start\r\n\r\ndef counter1(d):\r\n S1 = fact_dict[sum(d)]\r\n for i in range(10):\r\n S1 = S1//fact_dict[d[i]]\r\n return S1 \r\n\r\ndef counter(d):\r\n S1 = counter1(d)\r\n if d[0] > 0:\r\n d2 = [x for x in d]\r\n d2[0]-=1\r\n S1-=counter1(d2)\r\n return S1\r\n \r\ndef process(n):\r\n d = [0 for i in range(10)]\r\n for x in str(n):\r\n d[int(x)]+=1\r\n answer = 0\r\n for d1 in find_tuples(d):\r\n answer+=counter(d1)\r\n print(answer)\r\n return\r\n\r\nn = int(input())\r\nprocess(n)", "import sys\r\nsys.setrecursionlimit(10**5)\r\n\r\nn = str(input())\r\nC = [0]*10\r\nfor c in n:\r\n C[int(c)] += 1\r\n\r\nimport copy\r\n\r\nmemo = {}\r\ndef dfs(state):\r\n res = 0\r\n if tuple(state) in memo:\r\n return memo[tuple(state)]\r\n for i in range(10):\r\n if C[i] != 0 and state[i] == 0:\r\n break\r\n else:\r\n res += 1\r\n for i in range(10):\r\n if C[i]-state[i] >= 1:\r\n state[i] += 1\r\n res += dfs(state)\r\n state[i] -= 1\r\n memo[tuple(state)] = res\r\n return res\r\n\r\nans = 0\r\nfor i in range(1, 10):\r\n if C[i] >= 1:\r\n state = [0]*10\r\n state[i] += 1\r\n ans += dfs(state)\r\nprint(ans)\r\n", "from collections import Counter as Cnt;G=range;n=input();m,d,z=len(n),set(),0\r\nc0=Cnt(n);fact=[1,1]+[0]*(m-1)\r\nfor i in G(2,m+1):fact[i]=fact[i-1]*i\r\ndef Am(c):\r\n z=fact[sum(c.values())]\r\n for k in c:z//=fact[c[k]]\r\n return z\r\nfor i in G(1,1<<m):\r\n s=''.join(sorted([n[j] for j in G(m)if i>>j&1]))\r\n if len(s)<len(c0) or s in d:continue\r\n d.add(s);c=Cnt(s)\r\n if any(c[k]==0 and c0[k] for k in c0):continue\r\n z+=Am(c)\r\n if c['0']:c['0']-=1;z-=Am(c)\r\nprint(z)", "import sys\r\ninput=sys.stdin.readline\r\nn=input().rstrip()\r\nc=[0]*10\r\nfor i in range(len(n)):\r\n c[int(n[i])]+=1\r\nf=[0]*20\r\nf[0]=f[1]=1\r\nfor i in range(2,20):\r\n f[i]=f[i-1]*i\r\nans=0\r\nfor i in range(1,10):\r\n e=c[:]\r\n if e[i]:\r\n e[i]-=1\r\n else:\r\n continue\r\n s=sum(e)\r\n for e0 in range(e[0]+1):\r\n for e1 in range(e[1]+1):\r\n for e2 in range(e[2]+1):\r\n for e3 in range(e[3]+1):\r\n for e4 in range(e[4]+1):\r\n for e5 in range(e[5]+1):\r\n for e6 in range(e[6]+1):\r\n for e7 in range(e[7]+1):\r\n for e8 in range(e[8]+1):\r\n for e9 in range(e[9]+1):\r\n arr=[e0,e1,e2,e3,e4,e5,e6,e7,e8,e9]\r\n m=sum(arr)\r\n flg=False\r\n for z in range(10):\r\n if (i!=z and arr[z]==0 and e[z]>0):\r\n flg=True\r\n if flg:\r\n continue\r\n #print(arr)\r\n r=f[m]\r\n for x in arr:\r\n r//=f[x]\r\n ans+=r\r\nprint(ans)", "# Index es el índice que usamos para recorrer el array de repeticiones. \r\n# El taken es la cantidad de números que tenemos que usamos \r\n# para calcular el número de permutaciones. El invalids calcula la cantidad de \r\n# permutaciones repetidas en un primer momento, es decir\r\n# los números que poseen los dígitos repetidos en igual posición, luego se usa\r\n# para quitar de las respuesta los valores que tienen al \r\n# cero como valor inicial. Zeros es un contador de la cantidad de ceros que \r\n# tiene el número, usado para quitar de la repuesta los valores\r\n# que tienen al cero como valor inicial. \r\ndef solve (index,taken,invalids,zeros):\r\n\t# Cuando este construido el número, llegamos a su décimo \r\n\t# índice pasaremos a calcular los valores válidos.\r\n\tif index >= 10: \r\n\t\tglobal sol \r\n\t\t # Se agregan todas las permutaciones de los dígitos quitando todas las\r\n\t\t # que sean números repetidos.\r\n\t\tsol += fact[taken]//invalids\r\n\t\t# verificamos si tenemos valores de cero pare quitar de las respuestas \r\n\t\t# los valores que tienen a 0 en la primera posición.\r\n\t\tif zeros > 0: \r\n\t\t\t # Quitamos de invalids todas las permutaciones del cero\r\n\t\t\tinvalids = invalids//fact[zeros]\r\n\t\t\t # Annadimos todas las repeticiones del cero excepto las que posean\r\n\t\t\t # al cero en la primera posición, que quitaremos de sol más tarde\r\n\t\t\tinvalids = invalids*fact[zeros-1]\r\n\t\t\t # de solución restaremos todas las combinacinoes de dígitos\r\n\t\t\t # inválidas que tienen al cero en la primera posición.\r\n\t\t\tsol = sol - (fact[taken-1])//invalids\r\n\t\treturn\r\n\t # Se verifica si el dígito esta presente en el número.\r\n\tif rep[index] == 0:\r\n\t\t# Si el número n no posee al dígito se pasa a el próximo\r\n\t\t# llamado con valores similares.\r\n\t\tsolve (index+1,taken,invalids,zeros) \r\n\t # En este for se repiten los valores de cada dígito para asegurar que se \r\n\t # calculan todos los números que posean todos los dígitos con al menos una\r\n\t # aparición.\r\n\tfor x in range(1,rep[index]+1):\r\n\t\t# Se verifica si el dígito que se esta verificando es el 0\r\n\t\tif index != 0: \r\n\t\t\t# Si no es el 0 se llama en el próximo dígito, con la cantidad de\r\n\t\t\t# valores tomados: taken segun la cantidad de repeticiones\r\n\t\t\t# x, y aumentamos la cantidad de valores no válidos en x!\r\n\t\t\t# sin agregar ceros.\r\n\t\t\tsolve (index+1,taken+x,invalids*fact[x],zeros) \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t \r\n\t\telse:\r\n\t\t\t# Se llama en el próximo dígito, con la cantidad de valores\r\n\t\t\t# tomados: taken según la cantidad de repeticiones\r\n\t\t\t# x, y aumentamos la\r\n\t\t\t# cantidad de valores no válidos en x!, sin agregar ceros.\r\n\t\t\tsolve(index+1,taken+x,invalids*fact[x],x) \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t \r\n\r\nsol = 0\r\nfact = [1] \r\nfor i in range(1,20): \r\n\tfact.append(fact[i-1]*i)\r\nn = str(input()) \r\nrep = [0 for i in range(10)] \r\nfor c in n:\r\n\trep[int(c)] += 1 \r\nsolve(0,0,1,0) \r\nprint (sol)\r\n\r\n\r\n", "from sys import stdin\r\nfrom math import factorial as fac\r\ns=list(stdin.readline().strip())\r\ntop=2**len(s)\r\nfor i in range(len(s)):\r\n s[i]=int(s[i])\r\ns.sort()\r\ndef can(s1):\r\n dp=[False for i in range(10)]\r\n for i in range(len(s1)):\r\n dp[s1[i]]=True\r\n for i in s:\r\n if dp[i]==False:\r\n return False\r\n return True\r\ndef countf(y):\r\n d={0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0}\r\n tot=len(y)\r\n for i in y:\r\n d[i]+=1\r\n ans=0\r\n a=fac(tot-1)\r\n for i in range(1,10):\r\n if d[i]>0:\r\n b=1\r\n for j in range(10):\r\n if i==j:\r\n b*=fac(d[j]-1)\r\n else:\r\n b*=fac(d[j])\r\n ans+=a//b\r\n return ans\r\nr=0\r\nst=set()\r\nfor i in range(1,top):\r\n x=i\r\n y=[]\r\n z=0\r\n z1=0\r\n for j in range(len(s)):\r\n if x&1:\r\n z1+=s[j]*10**z\r\n y.append(s[j])\r\n z+=1\r\n x>>=1\r\n if can(y) and z1 not in st:\r\n st.add(z1)\r\n r+=countf(y)\r\nprint(r)\r\n \r\n", "import itertools\nfrom collections import defaultdict\n\nn = input()\ndigits = [0] * 10\nfor i in n:\n digits[int(i)] += 1\n \ndef fact(n):\n ans = 1\n for i in range(1, n + 1):\n ans *= i\n return ans\n \n \ndef nchoosek(n, k):\n k = max([k, n - k])\n ans = 1\n for i in range(k + 1, n + 1):\n ans *= i\n ans //= fact(n - k)\n return ans\n \nans = 0\n \nfor amounts in itertools.product(*[[0] if x == 0 else range(1, x + 1) for x in digits]):\n not_zero = sum(amounts[1:])\n if not_zero == 0:\n continue\n tmp = fact(not_zero)\n for j in amounts[1:]:\n tmp //= fact(j) # multinomial\n tmp *= nchoosek(not_zero -1 + amounts[0], amounts[0])\n ans += tmp\n \nprint(ans)\n \t \t\t\t\t\t \t \t\t \t \t\t \t\t\t", "n=input()\r\n#print(len(n))\r\nhsh=[0]*10\r\nfor i in n:\r\n hsh[ord(i)-ord('0')]+=1\r\n#print(hsh)\r\ndef f(n):\r\n if(n<2):\r\n return 1\r\n else:\r\n return n*f(n-1)\r\nans=0\r\nsea=[]\r\ndef rec(table):\r\n val=int(\"\".join(list(map(str,table))))\r\n if(val not in sea):\r\n global ans\r\n #print(table,ans)\r\n s=1\r\n t=sum(table)\r\n for i in range(10):\r\n s*=f(table[i])\r\n minus=1\r\n if(table[0]>0):\r\n table[0]-=1\r\n for i in range(10):\r\n minus*=f(table[i])\r\n ans+=(f(t)//s-f(t-1)//minus)\r\n table[0]+=1\r\n else:\r\n ans+=(f(t)//s)\r\n sea.append(val)\r\n #print(table,ans,s,f(t))\r\n for i in range(10):\r\n if(table[i]>1):\r\n table[i]-=1\r\n rec(table)\r\n table[i]+=1\r\nrec(hsh)\r\nprint(ans)\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 1000000007\r\nMAX = 10**18\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef array():\r\n return list(map(int, input().split()))\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\ndef fact(lim):\r\n ary = vector(lim + 1, 1)\r\n for i in range(2, lim + 1):\r\n ary[i] = ary[i - 1] * i\r\n return ary\r\n\r\n\r\ndef pascle(lim):\r\n p = matrix(lim, lim)\r\n for i in range(lim):\r\n p[i][i] = p[i][0] = 1\r\n for i in range(1, lim):\r\n for j in range(1, lim):\r\n p[i][j] = (p[i - 1][j - 1] + p[i - 1][j])\r\n return p\r\n\r\n\r\nn = input()\r\nd = {}\r\nf = fact(25)\r\np = pascle(25)\r\nfor i in range(10):\r\n d[i] = 0\r\nfor i in range(len(n)):\r\n d[ord(n[i]) - ord('0')] += 1\r\nnow = vector(10)\r\nans = 0\r\n\r\n\r\ndef fun(x):\r\n global ans\r\n if x == 10:\r\n cnt = 0\r\n for i in range(1, 10):\r\n cnt += now[i]\r\n temp = f[cnt]\r\n for i in range(1, 10):\r\n temp //= f[now[i]]\r\n if now[0] > 0 and cnt >= 1:\r\n temp *= p[now[0] + cnt - 1][cnt - 1]\r\n ans += temp\r\n elif d[x] == 0:\r\n now[x] = 0\r\n fun(x + 1)\r\n else:\r\n for i in range(1, d[x] + 1):\r\n now[x] = i\r\n fun(x + 1)\r\n\r\n\r\nfun(0)\r\nprint(ans)\r\n", "n = int(input())\r\nk = len(str(n))\r\na = []\r\nfactorials = [1]\r\nfor i in range(1, 20):\r\n factorials.append(factorials[i - 1] * i)\r\nfor i in range(2 ** k):\r\n s = ''\r\n for j in range(k):\r\n if i & 2 ** j != 0:\r\n s += str(n)[j]\r\n fl = True\r\n for j in str(n):\r\n if j not in s:\r\n fl = False\r\n break\r\n if fl and sorted(list(s)) not in a:\r\n a.append(sorted(list(s)))\r\notv = 0\r\nfor i in a:\r\n ans = factorials[len(i)]\r\n for j in list(set(i)):\r\n ans //= factorials[i.count(j)]\r\n if '0' in i:\r\n del i[i.index('0')]\r\n ans2 = factorials[len(i)]\r\n for j in list(set(i)):\r\n ans2 //= factorials[i.count(j)]\r\n ans -= ans2\r\n otv += ans\r\nprint(otv)\r\n", "n=int(input())\r\n# n=987654320023456789\r\nlen_s=len(str(n))\r\n\r\n# print(len_s)\r\n\r\ndif=[0,0,0,0,0,0,0,0,0,0]\r\np=[0,0,0,0,0,0,0,0,0,0]\r\n\r\nwhile n>0:\r\n i=n%10\r\n n//=10\r\n dif[i]+=1\r\n p[i]=1\r\n\r\n# print(dif)\r\n# print(p)\r\n\r\nfac=[1]\r\n\r\nfor i in range(1,20):\r\n fac.append(fac[-1]*i)\r\n\r\n# print(fac)\r\n\r\nq=[p]\r\nres=0\r\n\r\nccc=20\r\n_set=[]\r\n\r\nwhile q:\r\n \r\n # print()\r\n ccc-=1\r\n v=q.pop()[:]\r\n if v in _set:\r\n continue\r\n else:\r\n _set.append(v)\r\n op=sum(v)\r\n tot=fac[op]\r\n for i in v:\r\n tot//=fac[i]\r\n\r\n res+=tot*(op-v[0])//op;\r\n\r\n # print(dif)\r\n # print(v)\r\n # print(res)\r\n # print(op, res, fac[op], fac[i])\r\n\r\n for i in range(0,10):\r\n if v[i]<dif[i]:\r\n v[i]+=1\r\n q.append(v[:])\r\n v[i]-=1\r\n\r\n\r\nprint(res)", "s = input()\r\n\r\n\r\nfactors = [1,1]\r\nfor i in range(2, 20):\r\n factors.append(i * factors[-1])\r\n\r\n\r\nused = set()\r\n\r\ntotal = 0\r\n\r\nuniq_numbers = set(s)\r\ns = sorted(s)\r\n\r\nfor i in range(1, 2**len(s)):\r\n idxs = str(bin(i))[2:]\r\n idxs = '0' * (len(s)-len(idxs)) + idxs\r\n \r\n number = ''.join([x for x, y in zip(s, idxs) if y == '1'])\r\n \r\n\r\n if number in used or set(number) != set(uniq_numbers):\r\n continue\r\n else:\r\n used.add(number)\r\n # print(idxs, number)\r\n \r\n \r\n d = {}\r\n for el in number:\r\n if el in d:\r\n d[el] += 1\r\n else:\r\n d[el] = 1\r\n\r\n cnk = factors[len(number)]\r\n for key, value in d.items():\r\n cnk /= factors[value]\r\n\r\n if '0' in d:\r\n d['0'] -= 1\r\n delta = factors[len(number) - 1]\r\n for key, value in d.items():\r\n delta /= factors[value]\r\n\r\n cnk -= delta\r\n \r\n total += cnk\r\n \r\ntotal = int(total)\r\nprint(total)\r\n\r\n \r\n \r\n ", "from collections import Counter\r\nfrom itertools import product\r\n \r\ns = input()\r\n \r\nds = Counter(s)\r\n \r\n \r\nfac = [1 for i in range(100)]\r\nfor i in range(1, 100):\r\n fac[i] = fac[i-1] * i\r\n \r\nres = 0\r\nfor possib in product(*[zip([k] * n, range(1, n+1)) for k, n in ds.items()]):\r\n possib = list(possib)\r\n non_zero_sum = sum(v for k, v in possib if k != '0')\r\n total = sum(v for _, v in possib)\r\n \r\n value = non_zero_sum * fac[total-1]\r\n for _, v in possib:\r\n value //= fac[v]\r\n \r\n res += value\r\nprint(res)", "# Index es el indice que usamos para recorrer el array de repeticions. El taken es la cantidad de numeros que tenemos que usamos \r\n# para calcular el numero de permutacions. El invalids calcula la cantidad de valores repetidos en un primer momento, es decir\r\n# los numeros que poseen los digitos repetidos en igual posicion, luego se usa para quitar de las respuesta los valores que tienen al \r\n# cero como valor inicial. Zeros es un contados de la cantidad de ceros que tiene el numero, usado para quitar de la repuesta los valores\r\n# que tienen al cero como valor inicial. \r\ndef solve (index,taken,invalids,zeros): \r\n\tif index >= 10: # Cuando este construido el numero, llegamos a su decimo indice pasaremos a calcular los valores validos.\r\n\t\tglobal sol \r\n\t\tsol += fact[taken]//invalids # Se agregan todas las permutaciones de los digitos quitando todas las que sean numeros repetidos.\r\n\t\t# verificamos si tenemos valores de cero pare quitar de las respuestas los valores que tienen a 0 en la primera posicion.\r\n\t\tinvalids = invalids//fact[zeros] # Quitamos de invalids todas las permutaciones del cero\r\n\t\tinvalids = invalids*fact[zeros-1] # Annadimos todas las repeticiones del cero excepto las que posean al cero en la primera posicion, que quitaremos de sol mas tarde\r\n\t\tsol = sol - (fact[taken-1])//invalids # de solucion restaremos todas las combinacinoes de digitos invalidas que tienen al cero en la primera posicion.\r\n\t\treturn\r\n\tif rep[index] == 0: # Se verifica si el digito esta presente en el numero.\r\n\t\tsolve (index+1,taken,invalids,zeros) # Si el numero n no posee al digito se pasa a el proximo llamado con valores similares.\r\n\tfor x in range(1,rep[index]+1): # En este for se repiten los valores de cada digito para asegurar que se calculan todos los numeros que posean todos los digitos con al menos una aparicion.\r\n\t\tif index != 0: # Se verifica si el digito que se esta verificando es el 0\r\n\t\t\tsolve (index+1,taken+x,invalids*fact[x],zeros) # Si no es el 0 se llama en el proximo digito, con la cantidad de valores tomados: taken segun la cantidad de repeticiones\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t # x, y aumentamos la cantidad de valores no validos en x!, sin agregar ceros.\r\n\t\telse:\r\n\t\t\tsolve(index+1,taken+x,invalids*fact[x],x) # Se llama en el proximo digito, con la cantidad de valores tomados: taken segun la cantidad de repeticiones x, y aumentamos la\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t # cantidad de valores no validos en x!, sin agregar ceros.\r\n\r\nsol = 0\r\nfact = [1] \r\nfor i in range(1,20): # Crearemos un array con los factoriales de 1 hasta 20 que usaremos en los calculos\r\n\tfact.append(fact[i-1]*i)\r\nn = str(input()) # Se introduce el valos de entrada\r\nrep = [0 for i in range(10)] # cremos un array que usaremos para saber las repeticiones de los digitos\r\nfor c in n:\r\n\trep[int(c)] += 1 \r\nsolve(0,0,1,0) \r\nprint (sol)\r\n\r\n\r\n" ]

[ "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nfrom collections import defaultdict\r\n\r\nclass SparseTable:\r\n def __init__(self, A, F):\r\n self.A = A\r\n self.F = F\r\n\r\n self.buildLG()\r\n self.buildST()\r\n\r\n def buildLG(self):\r\n self.LG = []\r\n lg, V = 0, 1\r\n for e in range(len(self.A) + 1):\r\n if V * 2 <= e:\r\n V *= 2\r\n lg += 1\r\n self.LG.append(lg)\r\n\r\n def buildST(self):\r\n n = len(self.A)\r\n self.ST = []\r\n length = 1\r\n while length <= n:\r\n if length == 1:\r\n self.ST.append(self.A)\r\n else:\r\n self.ST.append([self.F(self.ST[-1][s], self.ST[-1][s + length//2]) for s in range(n - length + 1)])\r\n\r\n length <<= 1\r\n\r\n def query(self, l, r):\r\n if l == r:\r\n return self.ST[0][l]\r\n\r\n if l > r:\r\n l, r = r, l\r\n \r\n e = self.LG[r - l + 1]\r\n return self.F(self.ST[e][l], self.ST[e][r - 2**e + 1])\r\n\r\n\r\ndef dfs(G, root, dst, H):\r\n Q = [(root, root, 0)]\r\n while Q:\r\n e, parent, h = Q.pop()\r\n\r\n if e not in H:\r\n H[e] = h\r\n dst.append(e)\r\n dst.append(parent) \r\n\r\n for x in G[e]:\r\n if x != parent:\r\n Q.append((x, e, h + 1))\r\n\r\nn = int(input())\r\n\r\nG = defaultdict(set)\r\nfor i in range(2, n + 1):\r\n e = int(input())\r\n G[e].add(i)\r\n\r\nH = {}\r\nlcaDfs = []\r\ndfs(G, 1, lcaDfs, H)\r\n\r\nlcaFirst = [-1] * (n + 1)\r\nfor i in range(len(lcaDfs)):\r\n if lcaFirst[lcaDfs[i]] == -1:\r\n lcaFirst[lcaDfs[i]] = i\r\n\r\nST = SparseTable([(H[e], e) for e in lcaDfs], min)\r\n\r\nlatency, u, v = 1, 1, 2\r\n\r\nL = [latency]\r\n\r\nfor e in range(3, n + 1):\r\n h1, v1 = ST.query(lcaFirst[u], lcaFirst[e])\r\n latency1 = H[e] + H[u] - 2*h1\r\n if latency1 > latency:\r\n latency = latency1\r\n u, v = u, e\r\n else:\r\n h2, v2 = ST.query(lcaFirst[v], lcaFirst[e])\r\n latency2 = H[e] + H[v] - 2*h2\r\n if latency2 > latency:\r\n latency = latency2\r\n u, v = e, v\r\n \r\n L.append(latency)\r\n\r\nprint(\" \".join(str(l) for l in L))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]

[ "import sys\r\ninput=sys.stdin.readline\r\nimport heapq\r\nif __name__==\"__main__\":\r\n n,m=map(int,input().split())\r\n arr=[]\r\n for i in range(n):\r\n h,t=map(int,input().split())\r\n arr.append([h,t,i+1])\r\n arr.sort()\r\n q,res,idx,poped,areas=[],0,0,[],set()\r\n for i in range(n):\r\n heapq.heappush(q,(arr[i][1],i))\r\n if len(q)<m:continue\r\n intersection=arr[q[0][1]][1]-arr[i][0]+1\r\n if intersection>res:\r\n res=intersection\r\n areas|={arr[j][2] for j in range(idx,i+1)}\r\n idx=i+1\r\n areas-=set(poped)\r\n poped.clear()\r\n poped.append(arr[heapq.heappop(q)[1]][2])\r\n print(res)\r\n print(*areas) if res>0 else print(*list(range(1,m+1)))", "import sys\r\nfrom heapq import *\r\n\r\ninput = sys.stdin.readline\r\nn, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n a.append((l, r, i))\r\na.sort(key=lambda p: p[0])\r\n\r\nans = ll = 0\r\nh = [p[1] for p in a[:k]]\r\nheapify(h)\r\nd = h[0] - a[k - 1][0] + 1\r\nif d > ans:\r\n ans = d\r\n ll = a[k - 1][0]\r\nfor l, r, _ in a[k:]:\r\n if r > h[0]:\r\n heapreplace(h, r)\r\n d = h[0] - l + 1\r\n if d > ans:\r\n ans = d\r\n ll = l\r\n\r\nprint(ans)\r\nids = []\r\nfor l, r, i in a:\r\n if ans == 0 or l <= ll and r >= ll + ans - 1:\r\n ids.append(i + 1)\r\n k -= 1\r\n if k == 0:\r\n break\r\nprint(*ids)\r\n", "import os, sys\r\nfrom io import BytesIO, IOBase\r\n\r\nfrom collections import defaultdict, deque, Counter\r\nfrom bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop\r\nfrom functools import lru_cache\r\nfrom itertools import accumulate\r\nimport math\r\nimport sys\r\nfrom sys import stdout\r\n\r\n# sys.setrecursionlimit(10 ** 6)\r\n# Fast IO Region\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# sys.setrecursionlimit(2000)\r\n\r\nii = lambda: int(input())\r\nmii = lambda: map(int, input().split())\r\nlmii = lambda: list(map(int, input().split()))\r\n\r\nmod = 998244353\r\nc2i = lambda c: ord(c) - ord('a')\r\ni2c = lambda i: chr(ord('a') + i)\r\n\r\n\r\ndef solve():\r\n n, m = mii()\r\n itv = []\r\n for i in range(n):\r\n l, r = mii()\r\n itv.append([l, r, i])\r\n itv.sort()\r\n length = -1\r\n u = -1\r\n hr = []\r\n for i in range(len(itv)):\r\n l, r, j = itv[i]\r\n heappush(hr, [r, l, j])\r\n if len(hr) > m:\r\n heappop(hr)\r\n v = hr[0][0] - l\r\n if v > length and len(hr) == m:\r\n length = v\r\n u = i\r\n if u == -1:\r\n print(0)\r\n print(*list(range(1, m + 1)))\r\n else:\r\n hr = []\r\n for i in range(len(itv)):\r\n l, r, j = itv[i]\r\n heappush(hr, [r, l, j])\r\n if len(hr) > m:\r\n heappop(hr)\r\n if i == u:\r\n print(length + 1)\r\n print(*[hr[k][2] + 1 for k in range(len(hr))])\r\n\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "import sys\r\nfrom heapq import heappush,heappop\r\nn,m=map(int,input().split())\r\narr=sorted([*map(int,sys.stdin.readline().split()),i] for i in range(1,n+1))\r\nq,res,idx,poped,areas=[],0,0,[],set()\r\nfor i in range(n):\r\n heappush(q,(arr[i][1],i))\r\n if len(q)<m:continue\r\n lr=arr[q[0][1]][1]-arr[i][0]+1\r\n if lr>res:\r\n res=lr\r\n areas|={arr[j][2] for j in range(idx,i+1)}\r\n idx=i+1\r\n areas-=set(poped)\r\n poped.clear()\r\n poped.append(arr[heappop(q)[1]][2])\r\nprint(res)\r\nprint(*areas) if res>0 else print(*list(range(1,m+1)))" ]

[ "import sys\ninput=sys.stdin.readline\nprint=sys.stdout.write\nn,a,b,c=map(int,input().split())\nn*=2\nans=0\nfor i in range(b+1):\n\tfor j in range(c+1):\n\t\tif i*2+j*4<=n and i*2+j*4+a>=n:\n\t\t\tans+=1\nprint(str(ans))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,a,b,c=(int(i) for i in input().split())\r\nc1=0\r\nfor i in range(a+1):\r\n for j in range(b+1):\r\n k=(n-0.5*i-j)/2\r\n if(k>=0 and k<=c and k==int(k)):\r\n c1+=1\r\nprint(c1)", "n, a, b, c = map(int, input().split())\ncount = 0\nfor ci in range(c + 1):\n x = n - 2 * ci\n if x < 0:\n break\n high = min(b, x)\n low = max(0, x - a // 2)\n if high >= low:\n count += high - low + 1\n\nprint(count)\n", "def get_int_map(input_string):\r\n return map(int, input_string.split())\r\n\r\ndef cola_catastrophe(inputs):\r\n data = list(get_int_map(inputs))\r\n count = 0\r\n\r\n for i in range(min(data[0]//2, data[3]),-1,-1):\r\n current = data[0]-i*2\r\n if current > data[2] and 2*(current-data[2]) > data[1]:\r\n return count\r\n high = min(current, data[2])\r\n low = max(0, current-data[1]//2)\r\n if high >= low:\r\n count+=high-low+1\r\n #print(f\"{i*2}: (current = {current}; high = {high}; low = {low}) :{count}\")\r\n\r\n return count\r\n\r\ndata = input()\r\nprint(cola_catastrophe(data))", "#https://codeforces.com/problemset/problem/44/B\r\n\r\n\r\nn,a,b,c=map(int,input().split())\r\nr=0\r\nfor i in range(c+1):\r\n e=n-2*i\r\n if(e<0):break\r\n d1=( e - min(b,e) )\r\n d2=min(e,a//2)\r\n r+=(d2-d1+1)*(d2-d1>=0)\r\nprint(r)\r\n", "n, c, b, a = map(int, input().split())\r\nres = 0\r\nfor a_x in range(a + 1):\r\n for b_x in range(b + 1):\r\n amount = n - a_x * 2 - b_x\r\n if 0 <= amount <= c * 0.5:\r\n res += 1\r\nprint(res)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b, c = map(int, input().split())\r\n\r\nM = 2 << 30\r\nx = min(c, n//2)\r\ny = min(b, a//2)\r\ny1 = max(b, a//2)\r\nz = b + a//2\r\new = 0\r\nwhile x >= 0:\r\n s = n - x*2\r\n if s > z:\r\n break\r\n\r\n ew += min(s, y, z - s) + 1\r\n x -= 1\r\n\r\nprint(ew)", "n,halfs,ones,twos=map(int,input().split())\r\ncount=0\r\nones_total=ones\r\nhalfs_total=halfs//2\r\nboth=min(halfs_total,ones_total)\r\ntwo_max=min(twos,n//2)\r\nfor two in range(two_max,-1,-1):\r\n rem=n-two*2\r\n x=rem-ones_total-halfs_total\r\n if x>0:\r\n break\r\n count+=min(abs(x),both,rem)+1\r\n\r\n \r\nprint(count)\r\n", "n,a,b,c=map(int,input().split())\nr=0\nfor i in range(c+1):\n e=n-2*i\n if(e<0):break\n d1=( e - min(b,e) )\n d2=min(e,a//2)\n r+=(d2-d1+1)*(d2-d1>=0)\nprint(r)\n\n\t\t \t \t\t\t\t \t \t \t\t\t \t\t \t\t\t\t", "n,a,b,c = map(int,input().split())\r\nans = 0\r\nn*=2\r\nfor i in range(c+1):\r\n for j in range(b+1):\r\n if(n-j*2-i*4<=a and n-j*2-i*4>=0):\r\n ans+=1\r\nprint(ans)", "total, a,b,c = map(int, input().split())\r\ntotal*=2\r\nsols=0\r\n\r\ndef twosnfours(target, x,y):\r\n if target%4==2:\r\n x-=1\r\n target-=2\r\n if x<0:\r\n return 0\r\n count=0\r\n fours=target//4\r\n for j in range(fours,-1,-1):\r\n if y >= j:\r\n if x >= (target-4*j)//2:\r\n count += 1\r\n return count\r\n\r\n\r\nif total%1 != 0:\r\n total-=1\r\n a-=1\r\n sols+=1\r\nif total%2 != 0:\r\n total-=2\r\n sols+=1\r\n b-=1\r\nif a<0 or b<0:\r\n print(\"0\")\r\n quit()\r\n\r\nfor i in range(0,a+1,2):\r\n left=total-i\r\n if left < 0: break\r\n if left==0:\r\n sols+=1\r\n break\r\n sols += twosnfours(left,b,c)\r\n\r\nprint(sols)", "n, a, b, c = map(int, input().split())\r\ncount = 0\r\nfor i in range(c+1):\r\n for j in range(b+1):\r\n temp = n - i*2 -j\r\n if temp>=0 and a*0.5 >= temp:\r\n count+=1\r\nprint(count)", "n , c , b , a = map(int,input().split())\r\n\r\nc = c//2\r\n\r\nk=0\r\nfor i in range(a+1):\r\n\r\n if 2*i>n:\r\n break\r\n\r\n for j in range(b+1):\r\n\r\n if 2*i+j>n:\r\n\r\n break\r\n\r\n if 2*i+j+c>=n:\r\n\r\n k+=1\r\n\r\nprint(k)", "n,a,b,c=map(int,input().split())\r\nif n==0 or n>2*c+b+a/2:\r\n print(0)\r\nelse:\r\n s=0\r\n m = a // 2\r\n for i in range(min(n//2,c)+1):\r\n\r\n val=n-2*i\r\n if val==0:\r\n s+=1\r\n elif val>0 and b+m>=val:\r\n if min(b,m)>=val:\r\n s+=val+1\r\n elif max(m,b)<=val:\r\n s+=(b+m-val+1)\r\n else :\r\n s+=min(b,m)+1\r\n else:\r\n print(s)", "def su(l,b,bl):\r\n if not l%bl:\r\n if b<=l/bl:\r\n return (b*bl)//l\r\n return 0\r\nsum=0\r\nw=list(map(int,input().split()))\r\nn=w[0]\r\nb=w[2]\r\nfor i in range(0,w[1]+1,2):\r\n for j in range(0,w[3]+1,1):\r\n if (n - (i / 2 + j * 2) <= b and n - (i / 2 + j * 2) >= 0):\r\n sum+=1\r\nprint(sum)", "n, a, b ,c = [int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(c+1):\r\n for j in range(b+1):\r\n t= n - i*2 -j\r\n if t>=0 and a*0.5 >= t:\r\n count+=1\r\nprint(count)\r\n", "def nik(rudy,pig,y,z):\r\n temp = 0\r\n for i in range(z+1):\r\n for j in range(y+1):\r\n t = rudy - i*2 -j\r\n if t>=0 and pig*0.5 >= t:\r\n temp+=1\r\n print(temp)\r\nrudy, pig, y, z = list(map(int,input().split()))\r\nnik(rudy,pig,y,z)\r\n", "n, a, b, c = map(int, input().split())\r\nn = 2 * n\r\n\r\n# 1 2 4\r\nres = 0\r\n\r\nfor i in range(min(c, n // 4) + 1):\r\n remain = n - i * 4\r\n for j in range(min(b, remain // 2) + 1):\r\n if remain - 2 * j <= a:\r\n res += 1\r\n\r\nprint(res)\r\n", "n, a, b, c = map(int, input().split())\r\nans = 0\r\n\r\nfor i in range(0, c + 1):\r\n remain = n - 2 * i\r\n if remain > b + a // 2 or remain < 0:\r\n continue\r\n\r\n j = min(remain, b)\r\n k = remain - j\r\n\r\n ans += min(j, a // 2 - k) + 1\r\n\r\nprint(ans)", "def nik(rudy,x,y,z,cot):\r\n \r\n for i in range(z+1):\r\n for j in range(y+1):\r\n t = rudy - i*2 -j\r\n if t>=0 and x*0.5 >= t:\r\n cot+=1\r\n return cot\r\nrudy, x, y, z = list(map(int,input().split()))\r\ncot = 0\r\nprint(nik(rudy,x,y,z,cot))\r\n\r\n", "# LUOGU_RID: 111580533\nimport sys\r\ninput=sys.stdin.readline\r\nprint=sys.stdout.write\r\nn,a,b,c=map(int,input().split())\r\nn*=2\r\nans=0\r\nfor i in range(b+1):\r\n\tfor j in range(c+1):\r\n\t\tif i*2+j*4<=n and i*2+j*4+a>=n:\r\n\t\t\tans+=1\r\nprint(str(ans))", "n, a, b, c = map(int, input().split())\r\nprint(sum(n - i // 2 - 2 * j in range(0, b + 1) for i in range(0, a + 1, 2) for j in range(c + 1)))", "n,c,b,a=map(int,input().split())\r\nans=0\r\nfor i in range(a+1):\r\n for j in range(b+1):\r\n e=n-2*i-1*j\r\n if(2*e<=c and e>=0):\r\n ans+=1\r\nprint(ans)\r\n" ]

[ "n,s=(map(int,input().split()))\r\nx=[]\r\nfor i in range(n):\r\n a,b=(map(int,input().split()))\r\n x.append([a,b])\r\nx.sort(key=lambda i:i[0],reverse=True)\r\nc=0\r\np=s\r\nfor i in x:\r\n c=max(i[1],c+p-i[0])\r\n p=i[0]\r\nc+=i[0]\r\nprint(c)", "n, s = map(int, input().split())\nMAXN = 1010\nT = [-1]*MAXN\nfor i in range(n):\n f, t = map(int, input().split())\n T[f] = max(T[f], t)\nnow = 0\nnowf = s\nwhile nowf > 0:\n now = max(now, T[nowf])\n nowf-=1\n now+=1\nprint(now)\n\n\n \t \t \t \t\t\t\t \t \t", "n,s=map(int,input().split())\r\nt=0\r\nfloor=[]\r\npt=[]\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n floor.append(a)\r\n pt.append(b)\r\nt=s-floor[n-1]\r\nfor i in range(n-1,-1,-1):\r\n if i!=n-1:\r\n t += floor[i + 1] - floor[i]\r\n if pt[i]<=t:\r\n continue\r\n elif pt[i]>t:\r\n t=pt[i]\r\nt+=floor[0]\r\nprint(t)", "n,s=(map(int,input().split()))\r\ncurtime=0\r\na=[]\r\nfor _ in range(n):\r\n a.append(tuple(map(int,input().split())))\r\na.sort()\r\na.reverse()\r\nfor i in a:\r\n curtime+=max(s-i[0],i[1]-curtime)\r\n s=i[0]\r\nprint(curtime+a[-1][0])\r\n", "n=list(map(int,input().split()))\r\ncount=0\r\nm=[]\r\nfor i in range(n[0]):\r\n x=list(map(int,input().split()))\r\n m.append(x)\r\n# print(m)\r\nf=len(m)-i-1\r\nfor i in range(n[0]):\r\n f=len(m)-i-1\r\n if i==0:\r\n count+=(n[1]-m[f][0])\r\n if i!=0:\r\n count+=(m[f+1][0]-m[f][0])\r\n \r\n if (count)<m[f][1]:\r\n count+=m[f][1]-count\r\ncount+=m[0][0]\r\nprint(count)", "n, s = map(int, input().split())\r\n\r\nft = []\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n ft.append([f, t])\r\nft.sort(reverse=True)\r\nprevf, ans = s, 0\r\nfor f, t in ft:\r\n ans += prevf - f\r\n if ans < t:\r\n ans = t\r\n prevf = f\r\nans += ft[-1][0]\r\nprint(ans)\r\n ", "if __name__ == '__main__':\r\n n, s = str(input()).split()\r\n n = int(n)\r\n s = int(s)\r\n refer = dict()\r\n for i in range(n):\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n if line[0] in refer.keys():\r\n line[1] = max(line[1], refer.get(line[0]))\r\n refer.update({line[0]: line[1]})\r\n lines = list()\r\n for k, v in refer.items():\r\n lines.append([k, v])\r\n lines.sort(key=lambda x: x[0], reverse=True)\r\n lines.append([0, 0])\r\n num = 0\r\n for line in lines:\r\n num += max(s - line[0], line[1] - num)\r\n s = line[0]\r\n print(num)\r\n", "n,s=map(int,input().split())\r\nb=[]\r\nfor i in range(n):\r\n a= list(map(int, input().split()))\r\n b.append(a)\r\nb.sort(reverse=True)\r\nt,f=0,s\r\nfor i in range(n):\r\n t+=f-b[i][0]\r\n f=b[i][0]\r\n if b[i][1]>t:t=b[i][1]\r\nt+=f\r\nprint(t)\r\n", "def main():\n n, s = [int(t) for t in input().split()]\n\n passengers = [\n tuple(int(t) for t in input().split())\n for _ in range(n)\n ]\n\n sorted(passengers, key=lambda p: -p[0])\n\n lack = 0\n for f, t in passengers:\n current_time = s - f + lack\n lack += max(t - current_time, 0)\n\n print(s + lack)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint\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, s = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n temp = list(map(int, input().split()))\r\n a.append(temp)\r\na.sort(reverse=True)\r\nt = 0\r\nfor x in a:\r\n t += s - x[0]\r\n s = x[0]\r\n t += max(0, x[1] - t)\r\nif s != 0:\r\n t += s\r\nprint(t)\r\n", "I=lambda:map(int,input().split())\r\nn,s=I()\r\nexec('a=sorted(['+n*'[*I()],'+'])[::-1]')\r\nr=t=0\r\nfor x,y in a:\r\n v=t+s-x\r\n if v<y:v=y\r\n r+=v-t\r\n t=v\r\n s=x\r\nprint(r+s)\r\n", "n, m = map(int, input().split())\r\nans = m\r\nfor x in range(n):\r\n a, b = map(int, input().split())\r\n ans = max(ans, a+b)\r\nprint(ans)", "n, t = map(int, input().split())\r\n\r\nm_t = 0\r\nfor _ in range(n):\r\n f, t_f = map(int, input().split())\r\n m_t = max(m_t, t + max(0, t_f - t + f))\r\nprint(m_t)", "n, s = map(int, input().split())\r\nans = s\r\nfor i in range(n):\r\n x, y= map(int, input().split())\r\n ans = max(ans, x + y)\r\nprint(ans)", "n, s = map(int, input().split())\r\nans = 0\r\np = []\r\nfor i in range(n):\r\n p.append(list(map(int, input().split())))\r\np.sort()\r\nfor i in range(n):\r\n ans += s - p[-i - 1][0]\r\n s = p[-i - 1][0]\r\n ans += max(0, p[-i - 1][1] - ans)\r\nprint(ans + s)", "n, m = map(int, input().split())\r\nfl = []\r\nps = []\r\nfl.append(0)\r\nps.append(0)\r\nfor i in range(0, n):\r\n a, b = map(int, input().split())\r\n fl.append(a)\r\n ps.append(b)\r\nlv = m\r\ntime = 0\r\nfor i in range(n, -1, -1):\r\n time+=lv-fl[i]\r\n if ps[i]>time:\r\n time+=ps[i]-time\r\n lv = fl[i]\r\nprint(time)", "n,s = map(int,input().split())\r\nsm = 0\r\np = []\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n p.append([x,y])\r\n\r\np = sorted(p,reverse = True)\r\nf = s\r\nt = 0\r\nfor i in p:\r\n t = t+(f-i[0])\r\n if (i[1]>t):\r\n t = t+(i[1]-t)\r\n f = i[0] \r\nt = t + p[n-1][0]\r\nprint (t)\r\n", "def solve():\r\n n,s = map(int, input().split())\r\n a = []\r\n b = []\r\n for i in range(n):\r\n x,y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\n z = s\r\n i = n-1\r\n c = 0\r\n while i>=0:\r\n c+= (z-a[i])\r\n z = a[i]\r\n if (b[i]-c) >=0:\r\n c+=(b[i]-c)\r\n i-=1\r\n c+=z\r\n print(c)\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "def hotel(a,n):\r\n time=0\r\n time=time+n-a[len(a)-1][0]\r\n for i in reversed(range(len(a))):\r\n #arr=a[i]\r\n if i!=len(a)-1:\r\n time=time+a[i+1][0]-a[i][0]\r\n if time<a[i][1]:\r\n time=time+(a[i][1]-time)\r\n\r\n time=time+a[0][0]\r\n \r\n print(time)\r\n\r\n\r\n\r\n\r\n\r\n\r\nt=list(map(int,input('').split()))\r\na=[]\r\nfor i in range(t[0]):\r\n b=list(map(int,input('').split()))\r\n a.append(b)\r\n\r\nhotel(a,t[1])", "# https://codeforces.com/problemset/problem/608/A\r\n\r\nn, f = map(int, input().split())\r\n\r\na = []\r\nfor i in range(n):\r\n a.append([x for x in map(int, input().split())])\r\n\r\na.sort(reverse=True)\r\n\r\ntime = 0\r\nfor i in range(n):\r\n time += f - a[i][0]\r\n f = a[i][0]\r\n time += max(0, a[i][1] - time)\r\n\r\ntime += f\r\n\r\nprint(time)", "n, s = map(int, input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(tuple(map(int, input().split())))\r\n \r\nres = 0\r\nfor p, t in l[::-1]:\r\n res += s - p\r\n s = p\r\n if t - res > 0:\r\n res += t - res\r\nres += l[0][0]\r\nprint(res)", "n, s = map(int, input().split())\r\nhotel = [0 for _ in range(s + 1)]\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n hotel[f] = max(hotel[f], t)\r\n\r\ntime = -1\r\nfor floor in range(s, -1, -1):\r\n time += 1\r\n if hotel[floor] > time:\r\n time = hotel[floor]\r\n\r\nprint(time)\r\n", "from queue import *\n\t\nn,s = map(int, input().split())\n\nja = [False]*1001\nfila = PriorityQueue()\ne = 0\n\nfor i in range(n):\n f,t = map(int, input().split())\n fila.put([-f, -t])\n\nwhile not fila.empty():\n f,t = fila.get()\n f *= -1\n t *= -1\n\n if not ja[f]:\n ja[f] = True\n e += s-f\n s = f\n \n if t>e:\n e += t-e\n\ne += s\n\nprint(e) ", "def solve(n, p, s):\r\n p.append((0, 0))\r\n p.sort()\r\n t = 0\r\n while p:\r\n x = p.pop()\r\n s, t = x[0], max(x[1], t + abs(s - x[0]))\r\n return t\r\n\r\n\r\nn, s = [int(x) for x in input().split(' ')]\r\np = [tuple([int(x) for x in input().split(' ')]) for r in range(n)]\r\n\r\nprint(solve(n, p, s))", "n,s=map(int,input().split())\r\nf,t=map(int,input().split())\r\np=max(s,f+t)\r\nfor i in range(n-1):\r\n f,t=map(int,input().split()) \r\n v=max(s,f+t)\r\n if(p<v):\r\n p=v\r\nprint(p)", "n,s = map(int,input().split())\r\nt=[0]*(s+1)\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if t[a]<b: t[a]=b\r\nanswer = 0\r\nlastfloor = s\r\nfor i in range(s,-1,-1):\r\n if t[i]>0:\r\n answer += lastfloor - i\r\n if answer<t[i]:\r\n answer = t[i]\r\n lastfloor = i\r\nprint(answer+lastfloor)", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n\r\n#CODE\r\n\r\n\r\nn , s = MAP()\r\narr = []\r\nfor i in range(n):\r\n x , y = MAP()\r\n arr.append((x , y))\r\n\r\n\r\narr.sort(key=lambda x : x[0] , reverse=True)\r\n#print(arr)\r\n\r\ncur = s\r\nsm = 0\r\nfor i in arr:\r\n sm += cur - i[0]\r\n cur = i[0]\r\n if sm < i[1]:\r\n sm += i[1]-sm\r\n\r\nk2 = arr[-1][0]\r\nsm += k2\r\nprint(sm)\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\n#fin = open(\"cfr336a.in\", \"r\")\nfin = sys.stdin\nn, s = map(int, fin.readline().split())\nfloor = [0] * s\nfor i in range(n):\n fl_num, sec = map(int, fin.readline().split())\n floor[fl_num - 1] = max(floor[fl_num - 1], sec)\n\nctime = 0\nfor i in range(s, 0, -1):\n ctime = max(ctime, floor[i - 1])\n ctime += 1\n\nprint(ctime)", "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,s=rinput()\r\nmaxi=s\r\nfor i in range(n):\r\n f,t=rinput()\r\n maxi=max(maxi,f+t)\r\n\r\nprint(maxi)", "\"\"\"\r\nhttps://codeforces.com/contest/608/problem/A\r\n5 10\r\n2 77\r\n3 33\r\n8 21\r\n9 12\r\n10 64 should output 79\r\n\"\"\"\r\ngroup_num, start = [int(i) for i in input().split()]\r\narrivals = {0: 0} # floor -> latest arrival time for that floor\r\nfor _ in range(group_num):\r\n floor, time = [int(i) for i in input().split()]\r\n if floor not in arrivals:\r\n arrivals[floor] = time\r\n arrivals[floor] = max(arrivals[floor], time)\r\n\r\nfloors = sorted(arrivals.keys(), reverse=True)\r\nlast_floor = start\r\ntime = 0\r\nfor f in floors:\r\n time = max(time + abs(f - last_floor), arrivals[f])\r\n last_floor = f\r\nprint(time)\r\n", "n,p = map(int,input().split())\r\nprint(max([sum(map(int,input().split())) for i in range(n)] + [p]))", "#!/usr/bin/python3\n\nn, s = map(int, input().split())\n\nlast = [0 for i in range(s + 1)]\n\nfor i in range(n):\n f, t = map(int, input().split())\n last[f] = max(last[f], t)\n\nans = -1\nfor i in range(s, -1, -1):\n ans += 1\n ans = max(ans, last[i])\n\nprint(ans)\n", "n, s = map(int, input().split())\nans = s\nfor i in range(n):\n x, y = map(int, input().split())\n ans = max(ans, x+y)\nprint(ans)\n", "n,top_floor = map(int , input().split())\r\nans = top_floor \r\nfor i in range(n) : \r\n floor , wait = list(map(int,input().split())) \r\n ans = max(ans , floor+wait)\r\nprint(ans)", "n, s = map(int, input().split())\r\nmass = []\r\nfor i in range(n):\r\n floor, t = map(int, input().split())\r\n mass.append((floor, t))\r\nfloor = s\r\nmass.sort(key = lambda x : x[0], reverse = True)\r\n#print(mass)\r\nif s - mass[0][0] > mass[0][1]:\r\n time = s - mass[0][0]\r\nelse:\r\n time = mass[0][1]\r\nfloor = mass[0][0]\r\nmass.append((0, 0))\r\n#print(mass)\r\nfor i in range(1, n+1):\r\n #print(floor, time, mass[i])\r\n if floor - mass[i][0] > mass[i][1] - time :\r\n time += floor - mass[i][0]\r\n else:\r\n time = mass[i][1]\r\n floor = mass[i][0]\r\nprint(time)\r\n", "n=list(map(int,input().split()))\r\nlst=[]\r\nfor i in range(n[0]):\r\n n1=list(map(int,input().split()))\r\n lst.append(n1)\r\nlst.sort()\r\nlst.reverse()\r\nw=n[1]-lst[0][0]\r\nfor j in range(len(lst)):\r\n if(j==0):\r\n if(w<lst[j][1]):\r\n w=w+(lst[j][1]-w)\r\n else:\r\n w=w+(lst[j-1][0]-lst[j][0])\r\n if(w<lst[j][1]):\r\n w=w+(lst[j][1]-w)\r\nm=lst[-1][0]-0\r\nprint(w+m)\r\n", "n,s=map(int,input().split())\r\na = [[0]*2]*n\r\nans=0\r\nfor i in range(n):\r\n a[i]=list(map(int,input().split()))\r\na.sort(reverse=True);\r\nfor i in range(n):\r\n ans+=s-a[i][0]\r\n if ans < a[i][1]:\r\n ans+=a[i][1]-ans\r\n s=a[i][0]\r\nprint(ans+s)", "x, f = list(map(int, input().split()))\r\nfloor = []\r\ntime = []\r\nfor i in range(x):\r\n n, m = input().split()\r\n floor.append(int(n))\r\n time.append(int(m))\r\nfloor.reverse()\r\ntime.reverse()\r\nfloor.append(int(0))\r\n\r\ni = 0\r\nt = 0\r\nif floor[i] < f:\r\n t = f - floor[i]\r\n\r\nwhile i < len(time):\r\n if time[i] > t:\r\n t += time[i]-t\r\n\r\n t += floor[i] - floor[i + 1]\r\n i += 1\r\nprint(t)\r\n", "R = lambda : map(int, input().split())\n\nn,s=R()\nm = max([sum(R()) for _ in range(n)])\nprint(max(m,s))\n\n", "n, m = [int(x) for x in input().split()]\r\npas = []\r\ntime = 0\r\nfor i in range(n):\r\n pas.append([int(x) for x in input().split()])\r\nfor temp in pas[::-1]:\r\n time += m - temp[0]\r\n m -= m - temp[0]\r\n if time < temp[1]:\r\n time = temp[1]\r\n\r\nprint(time + m)\r\n", "n,s=[int(i) for i in input().split()]\r\nl=[]\r\nm=[]\r\nsum=0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n l.append(a)\r\n m.append(b)\r\nwhile(len(l)>0):\r\n q=max(l)\r\n b=l.index(q)\r\n sum=sum+(s-q)\r\n s=q\r\n if(sum>=m[b]):\r\n pass\r\n else:\r\n sum=sum+(m[b]-sum)\r\n if(len(l)==1 and l[0]!=0):\r\n sum=sum+l[0]\r\n \r\n l.remove(q)\r\n m.pop(b)\r\nprint(sum)", "n ,s = map(int, input().split())\r\ntime = s\r\nfor i in range(n):\r\n\tf, t = map(int, input().split())\r\n\ttime = max(time, f+t)\r\nprint(time)\r\n", "n, s = map(int, input().split(' ')[:2])\n\nres = 0\n\nfor i in range(n):\n f, t = map(int, input().split(' ')[:2])\n time = max(t, s-f) + f\n res = max(res, time)\n\nprint(res)\n", "n,m = map(int,input().split())\r\ns = [[int(i) for i in input().split()] for j in range(n)]\r\ns = s[::-1]+[[0]*2]\r\ntime = m-s[0][0]\r\nlevel = s[0][0]\r\n\r\nfor i in range(n):\r\n\tif time<s[i][1]:\r\n\t\ttime+=(s[i][1]-time)\r\n\ttime+=(level-s[i+1][0])\r\n\tlevel = s[i+1][0]\r\n\r\nprint(time)\r\n\r\n", "n,s=map(int,input().split())\r\nfor i in range(n):\r\n t,f=map(int,input().split())\r\n s=max(s,t+f)\r\nprint(s)\r\n\r\n\r\n\r\n ", "n, s = map(int, input().split(' ')[:2])\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n f, t = map(int, input().split(' ')[:2])\r\n time = max(t, s-f) + f\r\n res = max(res, time)\r\n\r\nprint(res)", "n,k=list(map(int,input().split()))\r\n\r\nt=[]\r\nfor j in range(n):\r\n s=list(map(int,input().split()))\r\n\r\n t.append(s)\r\n\r\n\r\nt.sort()\r\nf=t[::-1]\r\n\r\np=0\r\n\r\nh=k\r\n\r\nfor i in range(n):\r\n a=h-f[i][0]\r\n if f[i][1]>a+p:\r\n a+=f[i][1]-(a+p)\r\n p+=a\r\n h=f[i][0]\r\nprint(p+h)\r\n \r\n", "n,s = map(int,input().split())\nans = s\nfor i in range(n):\n f,t = map(int,input().split())\n ans = max(ans,t+f)\nprint(ans)\n\n\n\n\n", "N, top = map(int, input().split())\npa = dict()\nfor i in range(N):\n f, t = map(int, input().split())\n pa[f] = max(pa.get(f, 0), t)\nnow, time = top, 0\nfor f, t in sorted(pa.items(), reverse=True):\n time += now - f\n now = f\n time = max(t, time)\nelse:\n time += now\nprint(time)\n \n", "n,s = list(map(int, input().split()))\r\nans=s\r\n\r\nfor _ in range(n):\r\n a,b = list(map(int, input().split()))\r\n ans = max(ans, a+b)\r\n \r\nprint(ans)", "I=lambda:map(int,input().split())\r\nn,s=I()\r\nprint(max(max(sum(I()),s)for _ in range(n)))# 1697821241.9137049", "n,s=map(int,input().split())\r\nmins=s\r\nmy_dict={}\r\nmylist=[]\r\nwhile(n):\r\n\tperson,floor=map(int,input().split())\r\n\tmylist.append(person+floor)\r\n\tn-=1\r\nval=max(mylist)\r\nif(val<mins):\r\n\tprint(mins)\r\nelse:\r\n\tprint(val)", "n, s = map(int, input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n\tf, t = map(int, input().split())\r\n\tl.append((f, t))\r\n\r\nl.sort(key = lambda x : x[0], reverse=True)\r\n\r\ni = 0\r\nfor j in range(n):\r\n\ti += s - l[j][0]\r\n\ti += max(0, l[j][1] - i)\r\n\ts = l[j][0]\r\ni += s\r\nprint(i)", "n,s=[int(x) for x in input().split()]\na=[]\nfor i in range(n):\n\tfloor,time=[int(x) for x in input().split()]\n\ta+=[[floor,time]]\na.sort(reverse=True)\ncurrfloor = s\ntime=0\nfor i in a:\n\ttime += currfloor - int(i[0])\n\tif time<i[1]:\n\t\ttime+=(i[1]-time)\n\tcurrfloor = i[0]\ntime += currfloor\nprint(time)\n", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if (k-a)<b:\r\n k+=b-(k-a)\r\nprint(k)", "n, s = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n f,t = list(map(int, input().split()))\r\n s = max(s, f+t)\r\nprint(s)", "a, b = map(int, input().split())\r\nans=b\r\nfor i in range(a):\r\n\tc,d=map(int, input().split())\r\n\tans=max(ans, d+c)\r\n\t\r\nprint(ans)", "n,s=map(int,input().split())\r\nans = s\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n ans = max(ans,t+f)\r\nprint(ans)\r\n", "n, s = map(int, input().split())\r\np = sorted([list(map(int, input().split())) for i in range(n)])\r\ntime = s\r\nfor i in p:\r\n time += max(0, i[1] - time + i[0])\r\nprint(time)", "passes , floors = map(int,input().split())\r\n\r\nstops = []\r\n\r\nfor i in range(passes):\r\n stops.append(list(map(int,input().split())))\r\n\r\nstops = stops[-1::-1]\r\n\r\ntotal_time = floors\r\n\r\nfor i in stops:\r\n passenger_floor = i[0]\r\n arival_time = i[1]\r\n time_taken = total_time-passenger_floor\r\n if arival_time > time_taken:\r\n total_time+=arival_time-time_taken\r\n \r\nprint(total_time)", "n, s = map(int, input().split())\r\nmaxSmt = 0\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n maxSmt = max(maxSmt, max(t - (s - f), 0))\r\nprint(s + maxSmt)", "n,s = map(int,input().split())\r\nmayor = s\r\nfor i in range(n):\r\n mayor = max(sum(map(int,input().split())),mayor)\r\nprint(mayor)", "import sys\r\nimport math\r\nfrom functools import reduce\r\nimport bisect\r\n\r\n\r\ndef getN():\r\n return int(input())\r\n\r\n\r\ndef getNM():\r\n return map(int, input().split())\r\n\r\n\r\ndef getList():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\n# input = sys.stdin.buffer.readline\r\n\r\ndef index(a, x):\r\n i = bisect.bisect_left(a, x)\r\n if i != len(a) and a[i] == x:\r\n return i\r\n return -1\r\n\r\n\r\n#############\r\n# MAIN CODE #\r\n#############\r\n\r\nn, s = getNM()\r\npasengers = []\r\nfor i in range(n):\r\n pasengers.append(list(getNM()))\r\npasengers.sort(reverse=True)\r\nans = s\r\nt = 0\r\nfor a, b in pasengers:\r\n t += s - a\r\n ans += b - t if b - t > 0 else 0\r\n t += b - t if b - t > 0 else 0\r\n s = a\r\nprint(ans)", "class Event:\n def __init__(self, floor, time):\n self.floor, self.time = floor, time\n\nn, floor = map(int, input().split())\nevents = [ Event(*map(int, input().split())) for i in range(n) ]\nevents.sort(key=lambda event: (-event.floor, event.time))\n\ntime = 0\nfor event in events:\n time = max(event.time, time + floor - event.floor)\n floor = event.floor\ntime += floor\nprint(time)\n", "n, s = [int(x) for x in input().split()]\r\n\r\npos=s*[0]\r\n\r\nfor i in range(n) :\r\n\ta, b = [int(x) for x in input().split()]\r\n\tpos[a-1]=max(pos[a-1], b)\r\n\r\npos.reverse()\r\nt=0\r\nfor i in range(s) :\r\n\tif pos[i] > t :\r\n\t\tt=pos[i]\r\n\tt += 1\r\n\r\nprint(t)\r\n\r\n\r\n\r\n\r\n", "# elevator\r\n\r\ndata = input().split()\r\nn = int(data[0]) # число пассажиров\r\ns = int(data[1]) # число этажей\r\ne = {} # этаж и время пассажира\r\n\r\ndata = [input().split() for i in range(n)]\r\n\r\nfor i in range(n):\r\n a = int(data[i][0])\r\n b = int(data[i][1])\r\n if a in e:\r\n e[a] = max(b, e[a])\r\n else:\r\n e[a] = b\r\n\r\ntimer, lift = 0, s\r\n\r\nfor i in range(s):\r\n if lift in e:\r\n if timer >= e[lift]:\r\n lift -= 1\r\n timer += 1\r\n else:\r\n timer = e[lift] + 1\r\n lift -= 1\r\n else:\r\n timer += 1\r\n lift -= 1\r\n\r\nprint(timer)", "n,k=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n c,v=map(int,input().split())\r\n lst.append([c,v])\r\nlst.sort(reverse=1) \r\nsum=0\r\nsum+=k-lst[0][0]\r\nif lst[0][1]-sum > 0 : sum+= lst[0][1]-sum\r\nfor i in range(1 , n) :\r\n sum+=lst[i-1][0]-lst[i][0]\r\n if lst[i][1] - sum >0 : sum+=lst[i][1] - sum \r\nprint(sum+lst[i][0]) \r\n", "n, s = map(int, input().split())\r\nans = s\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n ans = max(ans, t+f)\r\nprint(ans)", "n,s=map(int,input().split())\r\np=[0]*n\r\nfor i in range (0,n):\r\n f,t=map(int,input().split())\r\n p[i]=f+t\r\n\r\nprint(max(max(p),s))\r\n\r\n\r\n\r\n\r\n", "n, s = [int(x) for x in input().split()]\r\ntime = 0\r\nfloor = 0\r\nmaxeta =0\r\nvremya = 0\r\nfor i in range(n):\r\n f, t = [int(x) for x in input().split()]\r\n if time+floor<f+t:\r\n time=t\r\n floor=f\r\n if maxeta<floor:\r\n maxeta=floor\r\n vremya = t\r\nz = 0\r\n#if abs(maxeta-s)>t:\r\n# z=abs(maxeta-s)\r\nif s>maxeta and time+floor<s:\r\n print(s)\r\nelse:\r\n print(time+floor+z)\r\n", "from functools import reduce\r\n\r\ndef main():\r\n [n, s] = list(map(int, input().split()))\r\n\r\n a = []\r\n for _ in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\n a = sorted(a, key = lambda p: p[0], reverse = True)\r\n\r\n sol = 0\r\n for i in range(n):\r\n travel = s - a[i][0]\r\n sol += travel\r\n\r\n a[i][1] = max(0, a[i][1] - travel)\r\n if (a[i][1] > 0):\r\n sol += a[i][1]\r\n\r\n for j in range(i + 1, n):\r\n a[j][1] = max(0, a[j][1] - travel)\r\n a[j][1] = max(0, a[j][1] - a[i][1])\r\n s -= travel\r\n\r\n sol += a[n-1][0];\r\n print(sol)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n if k-f<t:\r\n k=f+t\r\nprint(k) ", "def solve():\n N, S = map(int, input().split())\n\n PS = []\n for i in range(N):\n f, t = map(int, input().split())\n PS.append((f, t))\n\n PS.sort(key=lambda p: -p[0])\n\n ans = 0\n for f, t in PS:\n ans += S - f\n S = f\n if ans < t:\n ans = t\n\n if S != 0:\n ans += S\n\n print(ans)\n\n\nif __name__ == '__main__':\n solve()\n", "n, s = map(int, input().split())\nL = [list(map(int, input().split())) for _ in range(n)]\n\nT = [s-k for k in range(s+1)]\nfor A in L:\n T[A[0]] = max([T[A[0]], A[1]])\nr = 0\nfor k in range(s,0,-1):\n r = max([r,T[k]])\n r+=1\nprint(r)\n", "import math\r\n\r\n\r\nn, s = tuple(map(int, input().split()))\r\nfloors = [0 for i in range(s + 1)]\r\n\r\nfor i in range(n):\r\n floor, time = tuple(map(int, input().split()))\r\n floors[floor] = max(floors[floor], time)\r\n\r\nres = s\r\nfor i in range(s + 1):\r\n res = max(res, floors[i] + i)\r\n\r\nprint(res)\r\n \r\n", "n, s = map(int, input().split())\r\np = []\r\nfor i in range(n):\r\n p.append(list(map(int, input().split())))\r\nfor i in range(n - 1):\r\n for j in range(n - 1 - i):\r\n if p[j + 1][0] > p[j][0]:\r\n p[j], p[j + 1] = p[j + 1], p[j]\r\nt = 0\r\nfor i in range(n):\r\n t += s - p[i][0]\r\n if t < p[i][1]:\r\n t += p[i][1] - t\r\n s = p[i][0]\r\nt += s\r\nprint(t)\r\n", "n, k = map(int, input().split())\r\nres = k\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n res = max(res, x + y)\r\nprint(res)\r\n", "n, s = map(int, input().split())\r\nmx = s\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n mx = max(mx, a + b)\r\nprint(mx)", "n,s=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\nl.sort(reverse=True)\r\nt=0\r\nfor i in l:\r\n\tt+=s-i[0]\r\n\ts=i[0]\r\n\tt=max(t,i[1])\r\nt+=s\r\nprint(t)", "n,s=map(int,input().split())\r\nip=[]\r\ncount=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n ip.append((a,b))\r\nip=sorted(ip,key=lambda l:l[0], reverse=True)\r\nfor i in range(n):\r\n a,b=ip[i]\r\n count+=s-a\r\n if count<b:\r\n count+=(b-count)\r\n s=a\r\ncount+=a\r\nprint(count)\r\n", "n, s = map(int, input().split())\r\n\r\nres = s\r\nfor _ in range(n):\r\n floor, time = map(int, input().split())\r\n res = max(res, floor + time)\r\n\r\nprint(res)\r\n", "n, s = map(int, input().split())\r\nlevel = [0] * (s + 1);\r\n\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n level[f] = max(level[f], t)\r\n\r\nt = 0\r\nfor i in range(s, 0, -1):\r\n t = max(t, level[i]) + 1\r\n\r\nprint (t)", "'''\r\nCreated on Apr 28, 2016\r\nGmail: [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nn,s = map(int,input().split())\r\nans = s\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n ans = max(ans,f+t)\r\nprint(ans)\r\n \r\n", "n, s = (int(i) for i in input().split())\na = sorted([[int(i) for i in input().split()] for _ in range(n)], reverse=True)\nres = 0\nfor f, t in a:\n res = max(res + s - f, t)\n s = f\nres += f\nprint(res)\n", "p, n = map(int, input().split(\" \"))\r\nl = []\r\nfor i in range(p):\r\n f1, t1 = map(int, input().split(\" \"))\r\n l.append((f1, t1))\r\n \r\nl.sort()\r\n\r\nfloor = n\r\nsumi = 0\r\nx = (0,0)\r\nwhile(not len(l) == 0):\r\n x = l.pop()\r\n sumi+=floor-x[0]\r\n if sumi < x[1]:\r\n sumi+= x[1]-sumi\r\n floor = x[0]\r\n \r\nif(x[0] != 0):\r\n sumi+=x[0]\r\nprint(sumi)", "#!/usr/bin/env python3\n\nN, S = map(int, input().split())\n\nstuff = [map(int, input().split()) for i in range(N)]\nanswer = S\nfor a, k in stuff:\n answer = max(answer, a + k)\n\nprint(answer)\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\nl.sort(reverse=True)\r\n# print(l)\r\nt=0\r\nfor i in l:\r\n\tt+=k-i[0]\r\n\tk=i[0]\r\n\tt=max(t,i[1])\r\n\t# print(k)\r\nt+=k\r\nprint(t)", "I=lambda:map(int,input().split())\r\nn,s=I()\r\nprint(max(max(sum(I()),s)for _ in '0'*n))", "passengers_num, top_floor = [int(i) for i in input().split(\" \")]\r\npassengers = []\r\nfor i in range(passengers_num):\r\n floor_num, arrive_time = [int(i) for i in input().split(\" \")]\r\n passengers.append({floor_num: arrive_time})\r\ntime_sum = 0\r\nfor floor_num in range(top_floor, 0, -1):\r\n wait_to_go = []\r\n for passenger in passengers:\r\n if passenger.get(floor_num) is not None and passenger.get(floor_num) > 0:\r\n wait_to_go.append(passenger[floor_num])\r\n if len(wait_to_go) != 0:\r\n time_sum += max(wait_to_go)\r\n for passenger in passengers:\r\n passenger[list(passenger.keys())[0]] -= max(wait_to_go)\r\n time_sum += 1\r\n for passenger in passengers:\r\n passenger[list(passenger.keys())[0]] -= 1\r\n\r\nprint(time_sum)\r\n", "n,m = map(int,input().split())\r\nl=[]\r\n\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n l.append([a,b])\r\n\r\nfor i in range(len(l)):\r\n l.sort(reverse=True)\r\nc=0\r\nh=0\r\nfor i in range(len(l)):\r\n c+=m-l[i][0]\r\n m = l[i][0]\r\n if(c<=l[i][1]):\r\n c+=l[i][1]-c\r\n\r\nprint(c+l[-1][0])\r\n \r\n \r\n \r\n \r\n\r\n \r\n", "n , s = map(int , input().split())\r\nlst = []\r\nfor i in range(n):\r\n lst.append(list(map(int , input().split())))\r\nlst = sorted(lst , key =lambda x : x[0] , reverse = True)\r\nprev , ans = s , 0\r\nfor i in range(n):\r\n ans += prev -lst[i][0]\r\n if ans < lst[i][1]:\r\n ans += (lst[i][1]- ans)\r\n \r\n prev = lst[i][0]\r\nprint(ans+prev)", "#!/usr/bin/env python3\r\n\r\n# N = number of passengers\r\n# S = level of top floor\r\nN, S = map(int, input().split())\r\n\r\narrivals = [0 for i in range(S+1)]\r\nfor i in range(N):\r\n # f = floor\r\n # t = time of arrival\r\n f, t = map(int, input().split())\r\n arrivals[f] = max(arrivals[f], t)\r\n\r\nfor i in range(S, 0, -1):\r\n arrivals[i - 1] = max(arrivals[i - 1], arrivals[i] + 1)\r\nprint(arrivals[0])\r\n", "import sys\r\nfrom collections import defaultdict, deque, Counter\r\nfrom math import factorial\r\nfrom fractions import gcd\r\nfrom itertools import product, combinations\r\n\r\nsys.setrecursionlimit(1000000)\r\ndata = sys.stdin.read().splitlines()\r\n\r\nN, S = map(int, data[0].split())\r\narr = [0] * (S + 1)\r\nfor line in data[1:]:\r\n f, t = map(int, line.split())\r\n arr[f] = max(arr[f], t)\r\n\r\nans = 0\r\n\r\nfor i in range(S, -1, -1):\r\n ans = max(ans, arr[i])\r\n ans += 1\r\n\r\nprint(ans - 1)", "def main():\r\n n, s = map(int, input().split())\r\n arrivals = []\r\n for i in range(n):\r\n f, t = map(int, input().split())\r\n arrivals.append((f, t))\r\n\r\n arrivals.sort(reverse=True)\r\n\r\n time = 0\r\n for f, t in arrivals:\r\n time += s - f\r\n if t > time:\r\n time = t\r\n s = f\r\n\r\n if s > 0:\r\n time += s\r\n\r\n print(time)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,s = map(int,input().split())\r\n\r\na=[]\r\n\r\nfor i in range(n):\r\n\tf,t = map(int,input().split())\r\n\ta.append( [ f,t ] )\r\n\r\na.sort(reverse=True)\r\n\r\n# print(a)\r\n\r\nans=0\r\nf=int(s)\r\nfor i in a:\r\n\tans += f-i[0]\r\n\tif i[1]>ans:\r\n\t\tans = i[1]\r\n\tf=i[0]\r\n\t\r\nprint(f+ans)\r\n", "n,k = map(int,input().split())\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n k = max(k,f+t)\r\nprint(k)", "n, s = map(int, input().split())\r\nans = 0\r\nfloors = [[s,0]]\r\nfor i in range(n):\r\n floor, tim = map(int, input().split())\r\n floors.append([floor, tim])\r\nfloors.append([0,0])\r\nfloors.sort(key=lambda x: -x[0])\r\nfor i in range(1, len(floors)):\r\n ans += floors[i-1][0] - floors[i][0]\r\n if ans < floors[i][1]:\r\n ans += floors[i][1] - ans\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nls=[]\r\nfor i in range(n) :\r\n f,t=map(int,input().split())\r\n tp=f,t\r\n ls.append(tp)\r\n\r\ntime=0\r\n\r\nls.sort()\r\nls=ls[::-1]\r\ntime=m-ls[0][0]\r\nm=ls[0][0]\r\nfor i in ls:\r\n time=time+m-i[0]\r\n #print(time)\r\n if time>=i[1]:\r\n pass\r\n else:\r\n time=i[1]\r\n m=i[0]\r\ntime=time+ls[n-1][0]\r\nprint(time)\r\n \r\n ", "X = list(map(int, input().split()))\r\nPassengers = []\r\nfor i in range(X[0]):\r\n Passengers.append(list(map(int, input().split())))\r\nTime = max(Passengers[-1][1], X[1] - Passengers[-1][0])\r\nPrev = Passengers[-1][0]\r\nfor i in range(X[0] - 1, -1, -1):\r\n Time = max(Time + Prev - Passengers[i][0], Passengers[i][1])\r\n Prev = Passengers[i][0]\r\nprint(Time + Prev)\r\n", "k = []\r\na, b = map(int, input().split(' '))\r\nfor i in range(a):\r\n x, y = map(int, input().split(' '))\r\n k.append([x,y])\r\nk.append([0, -1])\r\nk.sort()\r\nk.reverse()\r\n\r\ncurr = b\r\nt = 0\r\nfor i in k:\r\n d = curr - i[0]\r\n curr = i[0]\r\n t = max(i[1], t+d)\r\nprint(t)\r\n", "n, s = map(int, input().split())\r\npassengers = []\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n passengers.append({f: t})\r\ntime = 0\r\nfor f in range(s, 0, -1):\r\n ts = []\r\n for passenger in passengers:\r\n if passenger.get(f) is not None and passenger.get(f) > 0:\r\n ts.append(passenger[f])\r\n if len(ts) != 0:\r\n time += max(ts)\r\n for passenger in passengers:\r\n passenger[list(passenger.keys())[0]] -= max(ts)\r\n time += 1\r\n for passenger in passengers:\r\n passenger[list(passenger.keys())[0]] -= 1\r\n\r\nprint(time)", "n, s = map(int, input().split())\r\na = [list(map(int, input().split())) for i in range(n)]\r\na.sort(key= lambda x: -x[0])\r\nans = 0\r\n\r\nfor i in range(n):\r\n ans += s - a[i][0]\r\n if ans >= a[i][1]:\r\n pass\r\n else:\r\n ans += a[i][1] - ans\r\n s = s - (s - a[i][0])\r\n\r\nprint(ans + s)", "i, floor = input().split()\n\nfloors =[]\nfor j in range(int(i)):\n floors.append(list(map(int, input().split())))\n\ncurrent = int(floor)\nf = len(floors) - 1\ntime = 0\n\nwhile f >= 0:\n time += (current - floors[f][0])\n current = floors[f][0]\n if floors[f][1] > time:\n time += (floors[f][1] - time)\n f -= 1\n\nprint(time+current)", "from sys import stdin\r\nn, s = map(int, stdin.readline().split())\r\nval = []\r\nfor i in range(n):\r\n a, b = map(int, stdin.readline().split())\r\n val.append([a, b])\r\nval.sort(reverse=True)\r\nans = 0\r\nstack = [s]\r\nfor i in val:\r\n nval = stack[-1]\r\n ans += (nval - i[0])\r\n if i[1] > ans:\r\n ans += (i[1] - ans)\r\n stack.append(i[0])\r\nprint(ans+stack[-1])", "#!/usr/bin/python\nimport sys\na,b = input().split()\nli = [0 for x in range(1000+1)]\na = int(a)\nb = int(b)\nfor x in range(a):\n\tc,d = input().split()\n\tc = int(c)\n\td = int(d)\n\tif(li[c] < d):\n\t\tli[c] = d\nans = 0\nfl = b\nwhile(fl > 0):\n\tif(ans < li[fl]):\n\t\tans = li[fl]\n\tfl -= 1\n\tans += 1\n#\tprint(ans,fl)\nprint(ans)\nsys.exit()", "n, s = [int(x) for x in input().split()]\r\na = []\r\n\r\nfor _ in range(n):\r\n # этаж, время\r\n a.append([int(x) for x in input().split()])\r\n \r\na.sort(key=lambda x: x[0], reverse=True)\r\n\r\ntime = 0\r\nfor floor, sec in a:\r\n time += s - floor\r\n if time < sec:\r\n time = sec\r\n s = floor\r\n \r\ntime += s\r\n \r\nprint(time)", "n, k = map(int, input().split())\r\n\r\ndelay = 0\r\ndaf = []\r\n\r\nfor i in range(n):\r\n x = tuple(map(int, input().split()))\r\n daf.append(x)\r\n\r\ndaf.sort(reverse = True)\r\n\r\nfor i in range(n):\r\n delay += max(0, daf[i][1] - (k - daf[i][0] + delay))\r\n\r\nprint(k + delay)\r\n", "inf=list(map(int,input().split()))\r\nn,s=inf[0],inf[1]\r\n\r\nclass Node:\r\n def __init__(self,f,t):\r\n self.f=f\r\n self.t=t\r\ndef get(p):\r\n return p.f\r\n\r\narr=[None]*n\r\nfor i in range(n):\r\n inf=list(map(int,input().split()))\r\n arr[i]=Node(inf[0],inf[1])\r\narr=sorted(arr,key=get,reverse=True)\r\ntime = 0\r\nlast=s\r\nfor node in arr:\r\n floor_traversed=last-node.f\r\n time+=floor_traversed\r\n if node.t>time:\r\n time=time+node.t-time\r\n last=node.f\r\nprint(time+arr[-1].f)\r\n \r\n", "# n, s = [int(x) for x in input().split()]\n# tuple_list = []\n# for i in range(n):\n# \ttuple_list.append(tuple([int(x) for x in input().split()]))\n# \ttuple_list.sort(key = lambda x: x[1]) \n\nn, s = [int(x) for x in input().split()]\nmax_value = s\nfor i in range(n):\n\tvalue = sum([int(x) for x in input().split()])\n\tif(value > max_value):\n\t\tmax_value = value\nprint(max_value)", "n,s= map(int,input().split())\r\nk=0\r\np=0\r\nz=[]\r\nfor i in range(n):\r\n f,t= map(int,input().split())\r\n z.append([f,t])\r\nfor i in range(n):\r\n f=z[n-1-i][0]\r\n t=z[n-1-i][1]\r\n p+=s-f\r\n if t-p>0:\r\n k+=(t-p)\r\n p+=(t-p)\r\n k+=(s-f)\r\n s=f\r\nprint(k+z[0][0])", "n, s = list(map(int, input().split()))\nlp = list()\nfor i in range(n):\n lp.append(tuple(map(int, input().split())))\n\nlp.sort(reverse=True)\ntime = 0\ncurrent_floor = s\nfor i in range(n):\n predicted_time = time + current_floor-lp[i][0]\n passenger_atime = lp[i][1]\n if passenger_atime > predicted_time:\n time = passenger_atime\n else:\n time = predicted_time\n current_floor = lp[i][0]\ntime += current_floor\nprint(time)\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\r\n\"\"\"\r\nd=list(map(int,input().split()))\r\nflr=[]\r\ntime=[]\r\ntotal=[]\r\nfor i in range(0,d[0]):\r\n temp = list(map(int,input().split()))\r\n total.append(temp[0]+temp[1])\r\n\r\nm1 = max(total)\r\nprint(max(m1,d[1]))", "n,s=map(int,input().split())\r\nz=0\r\nfor i in range(n):\r\n\tf,t=map(int,input().split())\r\n\t# print(f,t)\r\n\tsu=f+t\r\n\tz=max(z,su)\r\n# print(max(s,su))\r\nprint(max(z,s))", "n, s = map(int, (input().split(\" \")))\r\nanswer = s\r\narr = []\r\nfor _ in range(n):\r\n arr.append(tuple(map(int, (input().split(\" \")))))\r\narr.sort(reverse=True)\r\nfor _ in range(n):\r\n f, t = arr[_]\r\n g = t - s + f\r\n if g > 0:\r\n s = s + g\r\n answer += g\r\nprint(answer)", "lst = [w.rstrip() for w in open(0).readlines()]\r\n_, s = map(int, lst[0].split())\r\nfor line in lst[1:]:\r\n a, b = map(int, line.split())\r\n s = max(s, a+b)\r\nprint(s)", "n,s=map(int,input().split())\r\nc=s\r\nfor i in range(n):\r\n\tf,t=map(int,input().split())\r\n\tc=max(c,f+t)\r\nprint(c)", "'''input\n5 10\n2 77\n3 33\n8 21\n9 12\n10 64\n'''\nn, s = map(int, input().split())\ni = sorted([list(map(int, input().split())) for _ in range(n)])[::-1]\nc = 0\nfor x in i:\n\tf, t = x[0], x[1]\n\tc += max(s - f, x[1] - c)\n\ts = f\nprint(c + s)\n\n\n\n\n\n\n\n\n\n", "num=list(map(int,input().split()))\r\nn,s=num\r\nfloor=s\r\nfloor_list=[]\r\ntime=0\r\nfor i in range(n):\r\n floor_list.append(list(map(int,input().split())))\r\nfor i in range(1,n+1):\r\n time+=floor-floor_list[-i][0]\r\n floor=floor_list[-i][0]\r\n if (floor_list[-i][1]-time)>0:\r\n time+=(floor_list[-i][1]-time)\r\nprint(time+floor)", "from sys import stdin\r\n\r\nn,s1=map(int,stdin.readline().strip().split())\r\n\r\ns=[list(map(int,stdin.readline().strip().split())) for i in range(n)]\r\ns.sort(reverse=True)\r\ns.append([0,0])\r\n\r\nst=0\r\nl=s1\r\nt=0\r\nfor i in range(n):\r\n t+=(l-s[i][0])\r\n if t<s[i][1]:\r\n t=s[i][1]\r\n l=s[i][0]\r\nt+=l-0\r\nprint(t)\r\n", "import sys\r\nn,top = map(int,input().split())\r\n\r\nfloor = [0]*n\r\narrival = [0]*n\r\ntime = 0\r\nfor i in range(n):\r\n f,a = map(int,input().split())\r\n floor[i] = f\r\n arrival[i] = a\r\n\r\nfor i in range(n-1,-1,-1):\r\n time += top - floor[i]\r\n\r\n if arrival[i] > time:\r\n time += arrival[i] - time\r\n top = floor[i]\r\n\r\n if i == 0 and floor[i] > 0:\r\n time += top\r\nprint(time)\r\n\r\n\r\n\r\n\r\n", "n,s=map(int,input().split())\r\nans=s \r\nfor x in range(n):\r\n f,t=map(int,input().split())\r\n ans=max(ans,f+t)\r\nprint(ans)", "import sys\r\nimport math\r\n\r\ndef main():\r\n a = [list(map(int,x.split())) for x in sys.stdin]\r\n inf = a.pop(0)\r\n a.sort()\r\n a.reverse()\r\n seconds = (inf[1] - a[0][0])\r\n if a[0][1] >= seconds:\r\n seconds += a[0][1] - seconds\r\n for x in range(0,len(a)-1,1):\r\n seconds += (a[x][0] - a[x+1][0])\r\n if a[x+1][1] - seconds >= 1:\r\n seconds += (a[x+1][1] - seconds)\r\n seconds += a[-1][0]\r\n print(seconds)\r\n\r\nmain()", "n, fl = map(int, input().split())\r\nz = []\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n z.append((f, t))\r\ns = 0\r\nz = sorted(z, key=lambda x: x[0],reverse=True)\r\nz.append((0, 0))\r\nt = 0\r\nfor i in range(len(z)):\r\n t += abs(fl - z[i][0])\r\n t += (z[i][1] - t if z[i][1] - t >= 0 else 0)\r\n fl = z[i][0]\r\nprint(t)", "x=input()\r\nx=x.split()\r\nb=[]\r\nsuma=0\r\ndiferencia=0\r\ntiempoa=0\r\npisomax=int(x[1])\r\nfor k in range (int(x[0])):\r\n a=input()\r\n a=a.split()\r\n b.append(a)\r\n\r\nfor k in range (int(x[0])):\r\n b[k][1]=int(b[k][1])\r\n b[k][0]=int(b[k][0])\r\n\r\nb.sort(reverse= True)\r\nfor k in range (int(x[0])):\r\n sumapisos=pisomax-b[k][0]\r\n tiempo=b[k][1]-sumapisos-tiempoa\r\n if tiempo < 0:\r\n tiempo=0\r\n suma=suma+sumapisos+tiempo\r\n pisomax=b[k][0]\r\n tiempoa=sumapisos+tiempoa+tiempo\r\n\r\nsuma=suma+b[k][0]\r\nprint(suma)", "__author__ = 'MoonBall'\r\n\r\nimport sys\r\n# sys.stdin = open('data/A.in', 'r')\r\nT = 1\r\n\r\ndef process():\r\n N, S = list(map(int, input().split()))\r\n a = [-1] * 1100\r\n for _ in range(N):\r\n f, t = list(map(int, input().split()))\r\n a[f] = max(a[f], t)\r\n\r\n ans = 0\r\n for i in range(S, -1, -1):\r\n if i != S: ans = ans + 1\r\n if a[i] != -1 and a[i] > ans:\r\n ans = a[i]\r\n\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(T):\r\n process()\r\n", "n, s = map(int, input('').split())\r\nlst = []\r\ntime = 0\r\nfor i in range(n):\r\n lst.append(list(map(int, input().split())))\r\nlst.sort(reverse = True)\r\n\r\nfor item in lst:\r\n time += s - item[0]\r\n s = item[0]\r\n if time >= item[1]:\r\n pass\r\n else:\r\n time += item[1] - time\r\nprint(time+s)\r\n\r\n", "\r\nn, s = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(list(map(int, input().split())))\r\n\r\nl.sort(reverse = True)\r\n\r\nt = 0\r\nfor i in range(n):\r\n\tt += s - l[i][0]\r\n\ts = l[i][0]\r\n\tif l[i][1] > t:\r\n\t\tt = l[i][1]\r\n\r\nt += s\r\nprint(t)", "read = lambda: map(int, input().split())\r\nn, s = read()\r\nans = s\r\nfor i in range(n):\r\n f, t = read()\r\n ans = max(ans, f + t)\r\nprint(ans)\r\n", "n, s = map(int, input().split())\r\n\r\nf, t = [], []\r\n\r\nfor i in range(n):\r\n\tl = list(map(int, input().split()))\r\n\t\r\n\tf.append(l[0])\r\n\tt.append(l[1])\r\n\t\r\nx = 0\r\n\t\r\nfor i in range(n - 1, -1, -1):\r\n\tx += (s - f[i])\r\n\tx += max(0, t[i] - x)\r\n\ts = f[i]\r\n\t\r\nprint(x + s)", "n,s = map(int,input().split())\r\nfloor = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n floor.append([a,b])\r\nfloor.sort(key= lambda x: x[0],reverse = True)\r\nt = 0\r\nindex = 0\r\nfloornow = s\r\nwhile index < n:\r\n t += (floornow - floor[index][0])\r\n if t < floor[index][1]:\r\n t = floor[index][1]\r\n floornow = floor[index][0]\r\n index += 1\r\nt += floornow\r\nprint(t)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, s = map(int, input().split())\r\nc = 0\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n x = t-(s-f)\r\n if x > c:\r\n c = x\r\nprint(s + c)", "n, s = map(int, input().split())\r\n\r\nflats = {}\r\n\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if f not in flats:\r\n flats[f] = 0\r\n flats[f] = max(flats[f], t)\r\n\r\ncurr_time = 0\r\nfor i in range(s, -1, -1):\r\n if i in flats:\r\n if curr_time < flats[i]:\r\n curr_time = flats[i]\r\n curr_time += 1\r\n\r\nprint(curr_time - 1)", "n, s = map(int, input().split())\ncf, ct = s, 0\nfor f, t in sorted((list(map(int, input().split())) for i in range(n)), reverse=True):\n ct = max(ct + cf - f, t)\n cf = f\nprint(ct + cf)\n", "n, s = map(int, input().split())\r\ndata = []\r\nfor i in range(n):\r\n level, time = map(int, input().split())\r\n data.append((level, time))\r\ndata1 = sorted(data)[::-1]\r\nduring = 0\r\nlevel = s\r\nfor i in range(n):\r\n during += level - data1[i][0]\r\n level = data1[i][0]\r\n if during < data1[i][1]:\r\n during += data1[i][1] - during\r\nprint(during + data1[-1][0])", "\r\nimport sys\r\nfrom collections import deque\r\nfrom typing import Union\r\ninput = sys.stdin.readline\r\ndef print(x, end='\\n'):\r\n sys.stdout.write(str(x) + end)\r\n \r\ndef main():\r\n T=1\r\n #T=int(input())\r\n def solve():\r\n arr=list(map(int,input().split(\" \")))\r\n n,s=arr[0],arr[1]\r\n res=[0]*n\r\n for x in range(n):\r\n arr=list(map(int,input().split(\" \")))\r\n f,t=arr[0],arr[1]\r\n res[x]=(f,t)\r\n res.sort(key=lambda x: x[0])\r\n res.reverse()\r\n Time=[]\r\n curr_elem=res[0]\r\n max_time=0\r\n for x in range(n):\r\n if res[x][0]==curr_elem[0]:\r\n max_time=max(max_time,res[x][1])\r\n else:\r\n Time.append((curr_elem[0],max_time))\r\n curr_elem=res[x]\r\n max_time=curr_elem[1]\r\n Time.append(res[-1]) \r\n elapsed=0\r\n floor=s\r\n for x in Time:\r\n elapsed+=floor-x[0]\r\n floor=x[0]\r\n \r\n elapsed+=max(0,x[1]-elapsed)\r\n elapsed+=Time[-1][0] \r\n print(elapsed) \r\n \r\n for f in range(T):\r\n solve() \r\n pass\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "n, s = map(int, input().split())\r\nans = s\r\nf = []\r\nt = []\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if(t>(s-f)):\r\n ans += t - (s-f)\r\n s += t - (s-f)\r\n\r\nprint(ans)", "n, s = map(int, input().split())\r\nh = {}\r\nfor _ in range(n):\r\n f, p = map(int, input().split())\r\n if h.get(f) is None:\r\n h[f] = []\r\n h[f].append(p)\r\narr = sorted(h.keys())[::-1]\r\nwait, ind = 0, 0\r\nfor i in range(s, -1, -1):\r\n wait += 0 if s == i else 1\r\n if h.get(i) is not None:\r\n maxi = max(h[i])\r\n if maxi != 0:\r\n maxi -= wait\r\n wait += max(0, maxi)\r\n ind += 1\r\nprint(wait)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nI=lambda:map(int,input().split())\r\nn,s=I()\r\nprint(max(max(sum(I()),s)for _ in '0'*n))\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\ncases, s = map(int, input().split())\r\npassengers = []\r\nprev_time = 0\r\nfor _ in range(cases):\r\n f, t = map(int, input().split())\r\n passengers.append([f, t])\r\n\r\npassengers = sorted(passengers, reverse=True)\r\nans = s\r\nprev_flr = s\r\nfor fi, ti in passengers:\r\n elev_arrive = prev_time + prev_flr - fi\r\n prev_flr = fi\r\n if ti > elev_arrive:\r\n ans += ti - elev_arrive\r\n prev_time = max(elev_arrive, ti)\r\n\r\nprint(ans)\r\n\r\n", "import sys\r\n(n,s) = tuple([int(i) for i in input().split(' ')])\r\ntemp = {}\r\nfor i in range(n):\r\n\t(key, value) = [int(j) for j in input().split(' ')]\r\n\tif key in temp and value > temp[key] or key not in temp:\r\n\t\ttemp[key] = value\r\n\r\ntime = 0\r\nwhile s > 0:\r\n\tif s in temp and temp[s] > time:\r\n\t\ttime = temp[s]\r\n\ttime = time + 1\r\n\ts = s - 1\r\n\r\nprint(time)\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\ndef find_biggest(n, ps, s):\n n -= 1\n i = 0\n m = 0\n\n while n >= 0 and ps[n][0] == s:\n i = n\n m = max(m, ps[n][1])\n n -= 1\n\n return m, i \n\ndef calc(n, ps, s, time):\n if n == 0:\n return s\n\n if s == 0:\n return 0\n\n if ps[n-1][0] == s:\n biggest, i = find_biggest(n, ps, s)\n\n if time >= biggest:\n return 1 + calc(i, ps[:i], s-1, time+1)\n\n return biggest + calc(i, ps[:i], s-1, biggest+1) - time + 1\n else:\n return s - ps[n-1][0] + calc(n, ps, ps[n-1][0], time + s - ps[n-1][0]) \n\n\n\ndef input_int_array():\n return [int(i) for i in input().split()]\n\nn, s = input_int_array()\n\nps = []\n\nfor i in range(n):\n ps.append(input_int_array())\n\nps.sort(key=lambda a: a[0]) \n\nprint(calc(n, ps, s, 0))\n", "n,s=map(int,input().split())\r\ncm=0\r\nfor i in range(n):\r\n fi,ti=map(int,input().split())\r\n if i==0:\r\n cm=fi+ti\r\n if i!=0:\r\n if fi+ti>cm:\r\n cm=fi+ti\r\nif cm>s:\r\n print(cm)\r\nelse:\r\n print(s)", "def aval(cur,t):\r\n if cur>=t:\r\n return True\r\n return False\r\npas,flo=map(int,input().split())\r\ncur=0\r\npeople = []\r\nfor i in range(pas):\r\n f,t=map(int,input().split())\r\n people.append((f,t))\r\npeople.sort(reverse=True)\r\naim = flo\r\nfor i in range(len(people)):\r\n nex=people[i]\r\n cur += aim-nex[0]\r\n if not aval(cur,nex[1]):\r\n cur += nex[1]-cur\r\n aim = nex[0]\r\ncur += aim\r\nprint(cur)\r\n \r\n \r\n", "t = 1\r\nfor i in range(t):\r\n\r\n ch = input()\r\n ch = ch.split()\r\n ch = [int(x) for x in ch]\r\n n, s = ch\r\n a = []\r\n for j in range(n):\r\n ch = input()\r\n ch = ch.split()\r\n ch = [int(x) for x in ch]\r\n a.append(ch)\r\n a.sort(reverse=True)\r\n sm = s - a[0][0]\r\n for j in range(n-1):\r\n k = a[j][1]\r\n if k > sm:\r\n sm = k\r\n sm += a[j][0] - a[j+1][0]\r\n\r\n if a[-1][1] > sm:\r\n sm = a[-1][1]\r\n sm += a[-1][0]\r\n\r\n\r\n\r\nprint(sm)", "line = input().split()\r\npassenger_amount = int(line[0])\r\ntop_floor = int(line[1])\r\n\r\ntime_taken = 0\r\nfloors = []\r\narrival_times = []\r\n\r\nfor i in range(passenger_amount):\r\n line = input().split(\" \")\r\n floors.append(int(line[0]))\r\n arrival_times.append(int(line[1]))\r\n\r\nfloors.reverse()\r\nfloors.append(0)\r\narrival_times.reverse()\r\n\r\ntime_taken += top_floor - floors[0]\r\n\r\nfor i in range(len(floors) - 1):\r\n if (arrival_times[i] - time_taken) > 0:\r\n time_taken += arrival_times[i] - time_taken\r\n\r\n time_taken += floors[i] - floors[i + 1]\r\n\r\nprint(time_taken)", "n,s = list(map(int, input().split()))\n\nps = []\nfor i in range(n):\n f,t = list(map(int, input().split()))\n ps.append((f,t))\nps.sort(reverse = True)\n \nans = 0\nnowf = s\nfor f,t in ps:\n ans += nowf-f\n nowf=f\n ans = t if t-ans > 0 else ans\n\nans += nowf\nprint(ans)\n\n", "def roadtrip(a, lst):\r\n ans=a\r\n for i in lst:\r\n b,c=i[0],i[1]\r\n ans=max(ans,b+c)\r\n return ans\r\n\r\n\r\nn,a=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n b,c=map(int,input().split())\r\n lst.append([b,c])\r\nprint(roadtrip(a,lst))\r\n", "a,b=map(int,input().split())\r\nprint(max(b,max(sum(map(int,input().split()))for i in range(a))))\r\n", "n, s = map(int, input().split())\r\nfi = []\r\nti = []\r\nfx = s\r\ntotal = 0\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n fi.append(f)\r\n ti.append(t)\r\nfor i in range(n-1, -1, -1):\r\n ttrvl = fx-fi[i]\r\n fx = fi[i]\r\n total += ttrvl\r\n if total < ti[i]:\r\n total = total + (ti[i] - total)\r\ntotal = total + fi[0]\r\nprint(total)\r\n", "N = input().split()\r\nn = int(N[0])\r\ns = int(N[1])\r\n\r\nans = -1\r\np = [0] * (s + 1)\r\n\r\nfor i in range(0, n):\r\n P = input().split()\r\n f = int(P[0])\r\n t = int(P[1])\r\n if p[f] < t:\r\n p[f] = t\r\n\r\nfor i in range(s, 0, -1):\r\n ans += 1\r\n if ans < p[i]:\r\n ans = p[i]\r\nprint(ans + 1)\r\n \t \t \t \t\t \t\t \t\t \t \t \t", "ns = input().split()\r\nfor i in range(2):\r\n ns[i] = int(ns[i])\r\nft = [input().split() for i in range(ns[0])]\r\nfor i in range(ns[0]):\r\n for x in range(2):\r\n ft[i][x] = int(ft[i][x])\r\npassengers = [[] for i in range(ns[1])]\r\nfor i in range(ns[0]):\r\n passengers[ft[i][0]-1].append(ft[i][1])\r\nfor i in range(ns[1]):\r\n if passengers[i] == []:\r\n passengers[i] = 0\r\n else:\r\n passengers[i] = max(passengers[i])\r\ntime = 0\r\nfloor = ns[1]\r\nwhile floor > 0:\r\n if passengers[floor-1] == 0:\r\n time += 1\r\n floor -= 1\r\n elif time >= passengers[floor-1]:\r\n passengers[floor-1] = 0\r\n else:\r\n time += passengers[floor-1]-time\r\n \r\nprint(time)\r\n", "n,s=[int(x) for x in input().split()]\nans=s\nfor i in range(n):\n f,t=[int(x) for x in input().split()]\n ans=max(ans,t+f)\nprint(ans)\n", "#608A\r\nn, s = map(int, input().split(\" \"))\r\nls = []\r\nfor _ in range(n):\r\n ls.append(list(map(int, input().split(\" \"))))\r\nfor i in range(n):\r\n s = max(s, sum(ls[i]))\r\nprint(s)\r\n", "info = [int(x) for x in input().split(' ')]\r\nn = info[0]\r\nleast = info[1]\r\nfor i in range(n):\r\n t = sum([int(x) for x in input().split(' ')])\r\n if (t>least):\r\n least=t\r\nprint(least)\r\n", "n, m = list(map(int, input().split()))\r\nmax_i, max_v = 0, 0\r\nansw = 0\r\nfor i in range(n):\r\n ind, value = list(map(int, input().split()))\r\n if answ < value + ind:\r\n answ = value + ind\r\n \r\nif m < answ:\r\n print(answ)\r\n exit(0)\r\nprint(m)", "n,s=input().strip().split(' ')\r\nn,s=[int(n),int(s)]\r\nf=[]\r\nt=[]\r\nfor a0 in range(n):\r\n x,y=input().strip().split(' ')\r\n x,y=[int(x),int(y)]\r\n f.append(x)\r\n t.append(y)\r\ntime=0\r\ncur_flr=s\r\nfor i in range(n):\r\n time+=cur_flr-f[n-1-i]\r\n if(time<t[n-1-i]):\r\n time=t[n-1-i]\r\n cur_flr=f[n-1-i]\r\nif(cur_flr):\r\n time+=cur_flr\r\nprint(time)\r\n \r\n", "x = list(map(int, input().split()))\r\n\r\nfloormax = x[1]\r\n\r\nfloors = []\r\ntimes = []\r\n\r\nfor i in range(x[0]):\r\n a = list(map(int, input().split()))\r\n floors.append(a[0])\r\n times.append(a[1])\r\n\r\nfloors.reverse() #biggest floor to smallest\r\ntimes.reverse()\r\n\r\ntotaltime = 0\r\n\r\nlastfloor = floormax\r\n\r\nfor i in range(len(floors)):\r\n totaltime += lastfloor - floors[i]\r\n #print(totaltime)\r\n\r\n if times[i] > totaltime: \r\n totaltime += times[i]-totaltime\r\n\r\n lastfloor = floors[i]\r\n\r\ntotaltime += lastfloor\r\n\r\nprint(totaltime)\r\n\r\n#print(floors)\r\n#print(times)", "n, m = map(int, input().split())\r\na = []\r\nt = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append((x, y * -1))\r\na.sort()\r\na.reverse()\r\nfor i in a:\r\n i = (i.__getitem__(0), i.__getitem__(1) * -1)\r\n if m > i.__getitem__(0):\r\n t = t + m - i.__getitem__(0)\r\n if t < i.__getitem__(1):\r\n t = i.__getitem__(1)\r\n m = i.__getitem__(0)\r\n\r\nprint(t + m)", "n, s = map(int, input().split())\r\nans = s\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n ans = max(ans, f + t)\r\nprint(ans)\r\n ", "n, s = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n f,t = list(map(int, input().split()))\r\n a.append([f,t])\r\na.sort()\r\na.reverse()\r\nsecond = 0\r\nif a[0][0] == s:\r\n second += a[0][1]\r\nfor x in range(n):\r\n second += (s - a[x][0])\r\n s = a[x][0]\r\n if second < a[x][1]:\r\n second += (a[x][1] - second)\r\nsecond += s - 0\r\nprint(second)", "n, s = map(int, input().split())\r\ndata = [list(map(int, input().split())) for _ in range(n)] + [[0, 0]]\r\ndata.sort(reverse=True)\r\n\r\nnow = max(s - data[0][0], data[0][1])\r\nfor i in range(1, n + 1):\r\n now = max(now + data[i - 1][0] - data[i][0], data[i][1])\r\n\r\nprint(now)", "n,s = map(int, input().split())\r\nmylist = []\r\nfor i in range(n):\r\n f,t = map(int, input().split())\r\n mylist.append([f,t])\r\nmylist.append([0,0])\r\nmylist.sort(reverse=True)\r\ntime=0\r\ni=0\r\nwhile s>0:\r\n if s==mylist[i][0]:\r\n if time<mylist[i][1]:\r\n time=mylist[i][1]\r\n i+=1\r\n if s>mylist[i][0]:\r\n s-=1\r\n time+=1 \r\nprint(time)", "n, s = map(int, input().split())\r\nmaxi = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n maxi = max(maxi, max(b - (s - a), 0))\r\nprint(maxi + s)\r\n", "n,s = map(int,input().split())\r\nr = s\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n r = max(r,t+f)\r\nprint(r)", "line = list(map(int,input().split()))\r\nn = line[0]\r\ns = line[1]\r\nl = []\r\nfor i in range(0,n):\r\n line = list(map(int,input().split()))\r\n l.append(line)\r\nl.sort(reverse=True)\r\nt = 0\r\nfor k in l: \r\n if k[0] < s:\r\n t = t + s - k[0]\r\n s = k[0]\r\n if t < k[1]:\r\n t = k[1]\r\nif s != 0:\r\n t = t + s\r\nprint(t)", "m,s=map(int,input().split());l=[];c=0;f=s\r\nfor i in range(m):l.append(list(map(int,input().split())))\r\nl.sort(reverse=True)\r\nfor i in range(m):\r\n\tw=abs(l[i][0]-s);c+=w\r\n\te=0 if l[i][1]<=c else (l[i][1]-c)\r\n\tc+=e;s=l[i][0]\r\nprint(c+s)", "n,m=map(int,input().split())\nt=m\nfor i in range(n):\n\ta,b=map(int,input().split())\n\tt=max(t,a+b)\nprint(t)\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 Tue Jan 10 17:55:59 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn,s = tuple(map(int,input().split()))\r\nm = []\r\nfor i in range(n):\r\n x = list(map(int,input().split()))\r\n m.append(x)\r\n \r\nm = sorted(m,reverse=True)\r\nt = 0\r\nespera = 0\r\nfor i in range(n):\r\n t+=s-m[i][0]\r\n espera = m[i][1]-t\r\n if espera>0:\r\n t+=espera\r\n s = m[i][0]\r\nt+=s\r\nprint(t)\r\n \r\n \r\n\r\n \r\n \r\n ", "n,m = map(int,input().split())\r\na = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n a.append((x,y))\r\na.sort(reverse=True)\r\n#print(a)\r\nans = 0\r\nprev = m\r\nfor i in a:\r\n ans += (prev - i[0])\r\n prev = i[0]\r\n if i[1] > ans:\r\n ans+= (i[1] -ans)\r\n #print(ans)\r\nprint(ans+prev)", "def f(ll,s):\r\n tl = [l[0]+l[1] for l in ll]\r\n tl.append(s)\r\n return max(tl)\r\n\r\nn,s = list(map(int,input().split()))\r\nll = [list(map(int,input().split())) for _ in range(n)]\r\nprint(f(ll,s))\r\n", "n,s=map(int,input().split())\r\nf=[]\r\nt=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n f.append(x)\r\n t.append(y)\r\nq=[]\r\nfor g in range(n):\r\n q.append(f[g])\r\n \r\nfor j in range(n):\r\n for k in range(n):\r\n if q[j]>q[k]:\r\n q[j],q[k]=q[k],q[j]\r\n\r\n\r\n\r\n\r\ny=0\r\nfor p in range(n):\r\n for m in range(n):\r\n if f[m]==q[p]:\r\n \r\n y+=(s-q[p])\r\n \r\n s=q[p]\r\n \r\n if t[m]>y:\r\n y+=(t[m]-y)\r\nprint(y+q[n-1])\r\n ", "n,s=map(int,input().split())\r\na=[0]*(s+1)\r\nfor _ in range(n):\r\n f,t=map(int,input().split())\r\n a[f]=max(t,a[f])\r\nans=-1\r\nfor i in range(s,-1,-1):\r\n ans+=1\r\n if ans<a[i]:\r\n ans=a[i]\r\nprint(ans)", "A = input().split()\r\nn = int(A[0])\r\ns = int(A[1])\r\nf = []\r\nh = []\r\na = []\r\nfor i in range(0, n):\r\n B = input().split()\r\n f.append(B[0])\r\n h.append(B[1])\r\nfor i in range(0, n):\r\n if (s-int(f[i]))<int(h[i]): a.append(int(h[i])+int(f[i]))\r\n else: a.append(s)\r\na.sort()\r\nprint(a[-1])", "n,s=map(int,input().split())\r\nans=0\r\nst=s\r\na=[[0]*2]*n\r\n\r\nfor i in range(n):\r\n\ta[i]=list(map(int,input().split()))\r\n\r\na.sort(reverse=True);\r\n\r\nfor i in range(n):\r\n\tans+=st-a[i][0]\r\n\tst=a[i][0]\r\n\tif a[i][1]>ans:\r\n\t\tans+=a[i][1]-ans\r\n\r\nans+=st\r\n\r\nprint (ans)", "n, s = map(int,input().split())\r\ntime = s\r\nfor _ in range(n):\r\n f,t = map(int,input().split())\r\n time = max(time, t+f)\r\n\r\nprint(time)\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef arr_2d(n):\r\n return [[int(x) for x in input().split()] for i in range(n)]\r\n\r\n\r\nn, s = inp()\r\narr = arr_2d(n)\r\ncount = 0\r\nfor i in range(n - 1, -1, -1):\r\n count += s - arr[i][0]\r\n s = arr[i][0]\r\n\r\n if (arr[i][1] - count > 0):\r\n count += arr[i][1] - count\r\nprint(count+arr[0][0])\r\n", "#!/usr/bin/env python3\n\ndef solve(s, p):\n def solve_rec(t, s, p):\n if not p:\n return t+s\n floor, when = p.pop()\n return solve_rec(max(t + s - floor, when), floor, p)\n\n p.sort()\n return solve_rec(0, s, p)\n\n\nif __name__ == '__main__':\n n, s = map(int, input().split())\n p = [list(map(int, input().split())) for _ in range(n)]\n print(solve(s, p))\n", "from sys import stdin\r\nn,s = map(int,input().split())\r\n\r\nfloor = []\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n floor.append((f,t))\r\n\r\narr = sorted(floor, reverse = True)\r\nback = s\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n p = arr[i]\r\n num = p[0]\r\n t = p[1]\r\n cnt += back - num\r\n if(cnt < t):\r\n cnt += (t-cnt)\r\n back = num\r\n if(i == n-1 and num > 0 ):\r\n cnt += num\r\nprint(cnt)\r\n\r\n\r\n\r\n", "n, s = map(int, input().split())\r\nfloors = []\r\n\r\nfor i in range(n):\r\n floors.append(list(map(int, input().split())))\r\n\r\nfloors = sorted(floors, key=lambda x: x[0], reverse=True)\r\nt = 0\r\nfor i in range(n):\r\n if s > floors[i][0]:\r\n t += (s-floors[i][0])\r\n if t < floors[i][1]:\r\n t += (floors[i][1]-t)\r\n s = floors[i][0]\r\n\r\nif s > 0:\r\n t += abs(0-s)\r\n\r\nprint(t)\r\n" ]

[ "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n return nShipsWithSameCoordinate(int(input()), {})\r\n\r\n\r\ndef nShipsWithSameCoordinate(nShips, nShipsAt):\r\n ships_Coordinates = list(range(nShips))\r\n for i in ships_Coordinates:\r\n n1, remaining = input()[1:].split('+')\r\n n2, n3 = remaining.split(')/')\r\n coordinate = (int(n1)+int(n2))/int(n3)\r\n if coordinate not in nShipsAt:\r\n nShipsAt[coordinate] = 1\r\n else:\r\n nShipsAt[coordinate] += 1\r\n ships_Coordinates[i] = coordinate\r\n\r\n return ' '.join(map(str, (nShipsAt[c] for c in ships_Coordinates)))\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n # open('output.txt', 'w').write(main())\r\n", "import re\nfrom collections import defaultdict\n\nP = re.compile(r'\\((\\d+)\\+(\\d+)\\)/(\\d+)')\n\nm = int(input())\ns = defaultdict(int)\nxs = []\n\nfor _ in range(m):\n a, b, c = map(int, P.match(input()).groups())\n x = (a + b) / c\n s[x] += 1\n xs.append(x)\n\nprint(' '.join(str(s[x]) for x in xs))\n", "n=int(input())\r\ndict1={}\r\ndict2={}\r\nfor i in range(n):\r\n s=input()\r\n s=s.split('/')\r\n c=int(s[1])\r\n s=s[0].strip('(').strip(')').split('+')\r\n a=int(s[0])\r\n b=int(s[1])\r\n ans=(a+b)/c\r\n try:\r\n dict2[ans] += 1\r\n except:\r\n dict2[ans] = 1\r\n dict1[i] = ans\r\nfor i in range(n):\r\n print(dict2[dict1[i]],end=' ')\r\n", "n=int(input())\r\nid=[0]*n\r\ndi={}\r\nfor i in range(n):\r\n s=input()\r\n id[i]=eval(s)\r\n if id[i] not in di:\r\n di[id[i]]=1\r\n else:\r\n di[id[i]]+=1\r\nfor i in range(n):\r\n print(di[id[i]],end=' ')", "n=int(input())\r\ndic={}\r\nfor i in range(n):\r\n\tnumstrings=[]\r\n\tstg=input().split('(')\r\n\tstg=stg[1].split('+')\r\n\tnumstrings.append(stg[0])\r\n\tstg=stg[1].split(')')\r\n\tnumstrings.append(stg[0])\r\n\tstg=stg[1].split('/')\r\n\tnumstrings.append(stg[1])\r\n\t# print(numstrings)\r\n\tnumstrings=[float(x) for x in numstrings]\r\n\tx=(numstrings[0]+numstrings[1])/numstrings[2]\r\n\t# x=round(x,2)\r\n\tif x in dic:\r\n\t\tdic[x].append(i)\r\n\telse:\r\n\t\tdic[x]=[i]\r\n\r\n# print(dic)\r\nans=[0 for i in range(n)]\r\nfor x in dic:\r\n\tw=str(len(dic[x]))\r\n\tfor j in dic[x]:\r\n\t\tans[j]=w\r\n\r\nprint(\" \".join(ans))\r\n\r\n", "while True:\r\n try:\r\n mp=dict()\r\n a=list()\r\n n=int(input())\r\n for i in range(n):\r\n s=input()\r\n num=eval(s)\r\n a.append(num)\r\n if num in mp:\r\n mp[num]=mp[num]+1\r\n else:\r\n mp[num]=1\r\n for i in a:\r\n print(mp[i],end=' ')\r\n print()\r\n except EOFError:\r\n break", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\ninput = stdin.readline\r\n\r\ndct = defaultdict(int)\r\nn = int(input())\r\nlst = [0] * n\r\nfor i in range(n):\r\n t = input().strip()\r\n a, b, c = map(int, (t[1:t.index('+')], t[t.index('+') + 1:t.index(')')], t[t.index('/') + 1:]))\r\n x = (a + b) / c\r\n lst[i] = x\r\n dct[x] += 1\r\nfor i in lst:\r\n print(dct[i], end=' ')\r\n", "n = int(input())\r\ncl = []\r\ndic = {}\r\nres = [0]*n\r\nfor i in range(n):\r\n x = eval(input())\r\n if x not in dic.keys():\r\n dic.update({x:[]})\r\n dic[x].append(i)\r\n else:\r\n dic[x].append(i)\r\n \r\nfor x in dic.values():\r\n k = len(x)\r\n for y in x:\r\n res[y]=k\r\n \r\nresult = ''\r\nfor x in res:\r\n result+=str(x)+' '\r\n \r\nprint(result)", "d = {}\r\nl = []\r\nfor _ in range(int(input())):\r\n n = input()\r\n s = n.split('+')\r\n s1 = s[0].split('(')\r\n s2 = s[1].split(')/')\r\n a = int(s1[1])\r\n b = int(s2[0])\r\n c = int(s2[1])\r\n k = (a+b)/c\r\n l.append(k)\r\n if k in d.keys():\r\n d[k]+=1\r\n else:\r\n d[k] = 1\r\nfor i in range(len(l)):\r\n print(d[l[i]],end=' ')\r\n", "n = int(input())\r\n\r\na = [0]*n\r\nres = dict()\r\n\r\nfor i in range(n):\r\n a[i] = eval(input())\r\n res[a[i]]=0\r\nfor i in range(n):\r\n res[a[i]] += 1\r\n\r\nfor i in a:\r\n print(res[i], end = ' ')", "import re\n\nnum = int(input())\ndes = []\nmap = {}\nfor i in range(num):\n z,a,b,w,c = re.split(r'[`\\-=~!@#$%^&*()_+\\[\\]{};\\'\\\\:\"|<,./<>?]', input().strip())\n value =(int(a)+int(b))/int(c)\n des.append(value)\n map[value] = map.get(value,0)+1\noutput = []\nfor i in des:\n output.append(str(map[i]))\nprint(\" \".join(output))\n", "n = int(input())\r\nlst = []\r\nd = dict()\r\nfor temp in range(n):\r\n input_str, z = input().split('/')\r\n x, y = input_str.split('+')\r\n x = x [1:]\r\n y = y [:len(y)-1]\r\n x = int(x)\r\n y = int(y)\r\n z = int(z)\r\n ans = (x+y)/z\r\n if(ans in d.keys()) : d[ans]+=1\r\n else : d[ans]=1\r\n lst.append(ans)\r\nfor i in lst:\r\n print(d[i], end=\" \")", "from collections import Counter\nfrom sys import stdin\n\ninput = stdin.readline\n\n\ndef gcd(x, y):\n return gcd(y, x % y) if x % y else y\n\n\nif __name__ == '__main__':\n n = int(input())\n arr = []\n\n for _ in range(n):\n x = list(input())\n fn = ''\n sn = ''\n\n i = 1\n while x[i] != '+':\n fn += x[i]\n i += 1\n\n i += 1\n while x[i] != ')':\n sn += x[i]\n i += 1\n\n top = int(fn) + int(sn)\n btm = int(''.join(x[i + 2:]))\n\n d = gcd(top, btm)\n\n top //= d\n btm //= d\n\n arr.append((top, btm))\n\n dct = Counter(arr)\n\n print(*map(lambda o: dct[o], arr))\n", "d={};k=[]\r\nfor i in range(int(input())):\r\n a=input()\r\n b=(((a.split('(')[1]).split(')/')[0]).split('+'))\r\n c=(((a.split('(')[1]).split(')/')[1]).split(')'))\r\n r=(int(b[0])+int(b[1]))/int(c[0])\r\n k.append(r)\r\n d[r]=d.get(r,0)+1\r\nfor i in range(len(k)):\r\n print(d[k[i]],end=' ')", "m = int(input())\nesc = [eval(input()) for i in range(m)]\nd = {i: 0 for i in esc}\nfor i in esc:\n d[i] += 1\nfor i in esc:\n print(d[i], end = ' ')\n", "m = int(input())\r\nl = []\r\ndict1 = {}\r\nfor i in range(m):\r\n k = input().split(\"/\")\r\n k[0] = k[0][1:len(k[0])-1]\r\n k[0] = k[0].split(\"+\")\r\n val = (int(k[0][0]) + int(k[0][1]))/(int(k[1]))\r\n if(val in dict1):\r\n dict1[val] += 1\r\n else:\r\n dict1[val] = 1\r\n l.append(val)\r\nfor i in l:\r\n print(dict1[i],end = \" \")", "_ = int(input())\r\nx = []\r\nfor __ in range(_) :\r\n s = input()\r\n a = s.split('/')\r\n c = int(a[1])\r\n a = a[0]\r\n a = a.split(')')\r\n a = a[0]\r\n a = a.split('+')\r\n b = int(a[1])\r\n a = a[0]\r\n a = a.split('(')\r\n a = int(a[1])\r\n x.append((a+b)/c)\r\nd = {}\r\nfor i in x:\r\n d[i] = 0\r\nfor i in x :\r\n d[i]+=1\r\nfor i in x :\r\n print(d[i],end=\" \")", "\r\ndef gcd (a,b) :\r\n\tif a == 0 :\r\n\t\treturn b\r\n\treturn gcd (b%a,a)\r\n\r\nn = int (input())\r\ninp = []\r\nkeys = []\r\nd= {}\r\nfor i in range (n) :\r\n\ts= str (input())\r\n\tinp.append(s)\r\n\tnum1 = \"\"\r\n\tnum2 = \"\"\r\n\tnum3 = \"\"\r\n\tind1 = 0\r\n\tfor i in range (1,len(s)) :\r\n\t\tif (s[i] == '+') :\r\n\t\t\tind1 = i+1\r\n\t\t\tbreak\r\n\t\telse :\r\n\t\t\tnum1 += s[i]\r\n\tfor i in range (ind1,len(s)) :\r\n\t\tif (s[i] == ')') :\r\n\t\t\tind1 = i+2\r\n\t\t\tbreak\r\n\t\telse :\r\n\r\n\t\t\tnum2 += s[i]\r\n\r\n\tfor i in range (ind1,len(s)) :\r\n\t\tnum3 += s[i]\r\n\r\n\tnum1 = int(num1)\r\n\tnum2 = int(num2)\r\n\tnum3 = int(num3)\r\n\r\n\tnumerator = num1 + num2\r\n\tdenominator = num3\r\n\r\n\tval = gcd (numerator,denominator)\r\n\tnumerator = numerator // val\r\n\tdenominator = denominator //val\r\n\r\n\timp = (numerator,denominator)\r\n\tif imp not in d :\r\n\t\td[imp] = 0\r\n\td[imp] += 1\r\n\tkeys.append(imp)\r\n\r\nans = []\r\nfor i in range (n) :\r\n\tans.append(d[keys[i]])\r\nprint (*ans)", "def main():\n n = int(input())\n if n == 0:\n print(\"\")\n return\n store = {}\n res = []\n for i in range(n):\n x = eval(input())\n if x in store:\n store[x] += 1\n else:\n store[x] = 1\n res.append(x)\n for i in range(n):\n res[i] = str(store[res[i]])\n print(\" \".join(res))\n\n\nmain()", "d={}\r\nl=[]\r\nfor i in range(int(input())):\r\n s=input()\r\n b=eval(s)\r\n if b not in d.keys():\r\n d[b]=1\r\n else:\r\n d[b]+=1\r\n l.append(b)\r\nfor i in l:\r\n print(d[i])", "m = int(input())\r\nlt=[]\r\nfor _ in range(m):\r\n s = input().split(\"/\")\r\n a,b,c = s[0].split(\"+\")[0][1:] , s[0].split(\"+\")[1][:-1], s[-1]\r\n a,b,c = int(a), int(b), int(c)\r\n lt.append((a+b)/c)\r\ndt={}\r\nfor i in range(m):\r\n if lt[i] not in dt:\r\n dt[lt[i]]=1 \r\n else:\r\n dt[lt[i]]+=1 \r\nfor i in range(m):\r\n lt[i] = dt[lt[i]]\r\nprint(*lt)", "a = int(input())\r\ndict = {}\r\nk = []\r\nfor i in range(a):\r\n l = eval(input())\r\n k.append(l)\r\n if l not in dict:\r\n dict[l] = 1\r\n else:\r\n dict[l] += 1\r\nfor i in range(a): print(dict[k[i]],end=\" \")\r\n", "n=int(input())\r\nd={}\r\naaa=[]\r\nfor ii in range(n):\r\n s=input().strip()\r\n arr=list(s)\r\n for i in range(len(arr)):\r\n if arr[i] is \"(\" or arr[i] is \"+\" or arr[i] is \")\" or arr[i] is \"/\":\r\n if arr[i] is \"/\":\r\n arr[i]=\"\"\r\n else:\r\n arr[i]=\" \"\r\n a,b,c=map(int,(\"\".join(arr)).split())\r\n ans=(a+b)/c \r\n if ans in d.keys():\r\n d[ans][0]+=1\r\n d[ans][1].append(ii)\r\n else:\r\n d[ans]=[1,[ii]]\r\n aaa.append(ans)\r\narr1={}\r\nfor i in d.keys():\r\n for j in d[i][1]:\r\n arr1[j]=d[i][0]\r\nfor i in range(n):\r\n print(arr1[i],end=\" \")\r\nprint(\"\")\r\n \r\n ", "import re\r\nn = int(input())\r\nA = []\r\nB = []\r\nfreq = {} \r\nmyDict1 = {}\r\nfor i in range(n):\r\n A.append(0)\r\nfor i in range(10**6):\r\n B.append(0)\r\nfor i in range(n):\r\n a = input()\r\n a = a.split('(')\r\n a = a[1].split('+')\r\n b = a[0];\r\n c = a[1].split(')')\r\n d = c[0]\r\n e = c[1].split('/')[1]\r\n ans = (int(b)+int(d))/int(e)\r\n if(ans in freq):\r\n freq[ans] += 1\r\n else:\r\n freq[ans] = 1\r\n myDict1[i] = ans\r\nfor key,value in myDict1.items():\r\n print(freq[value],end = \" \")", "import sys\r\ninput = sys.stdin.readline\r\ncounts = [eval(input().strip()) for _ in range(int(input()))]\r\nd = {j: 0 for j in counts}\r\nfor i in counts:\r\n d[i] += 1\r\nfor i in counts:\r\n print(d[i], end=' ')", "n=int(input())\r\na=[0]*n\r\nfor i in range(n):\r\n s=input()\r\n x,y=s.split('+')\r\n x=float(x[1:])\r\n u,v=y.split('/')\r\n v=float(v)\r\n u=float(u[:-1])\r\n a[i]=(x+u)/v\r\nk={}\r\nfor i in range(n):\r\n if a[i] not in k:\r\n k[a[i]]=0\r\n k[a[i]]+=1\r\no=[0]*n\r\nfor i in range(n):\r\n o[i]=str(k[a[i]])\r\nprint(' '.join(o))", "n = int(input())\r\na = []\r\nM = dict()\r\nfor i in range(n):\r\n a.append(eval(input()))\r\n M[a[-1]] = M.get(a[-1], 0) + 1\r\n\r\nfor i in range(n):\r\n print(M[a[i]], end=' ')", "m=int(input())\r\nans=[]\r\nfor i in range(m):\r\n s=list(input())\r\n s.remove(\"(\")\r\n s.remove(\")\")\r\n a=\"\"\r\n k=-1\r\n for i in range(len(s)):\r\n if s[i]!=\"+\":\r\n a+=s[i]\r\n else:\r\n k=i\r\n break\r\n b=\"\" \r\n l=0\r\n for i in range(k+1,len(s)):\r\n if s[i]!=\"/\":\r\n b+=s[i]\r\n else:\r\n l=i\r\n break \r\n c=\"\"\r\n for i in range(l+1,len(s)):\r\n c+=s[i]\r\n a=int(a)\r\n b=int(b)\r\n c=int(c)\r\n ans.append((a+b)/c)\r\nb=list(set(ans)) \r\ndic={}\r\nfor i in range(len(b)):\r\n dic[b[i]]=0\r\nfor i in range(len(ans)):\r\n dic[ans[i]]+=1\r\nfor i in range(len(ans)):\r\n print(dic[ans[i]],end=\" \")\r\n ", "#m = int(input())\r\n#coords = []\r\n\r\n#for i in range(0, m):\r\n# coords.append(eval(input()))\r\n\r\n#sort = sorted(coords)\r\n\r\n#increment = False\r\n#span = []\r\n#for i in range(1, m):\r\n# if sort[i-1] == sort[i]:\r\n# increment = True\r\n# else:\r\n# if increment == False:\r\n# span.append(1)\r\n# else:\r\n# span.append(i - len(span))\r\n# increment = False\r\n \r\n#if increment == True:\r\n# span.append(i+1-len(span))\r\n#else:\r\n# span.append(1)\r\n\r\n#output = \"\"\r\n#for i in range(0, len(span)):\r\n# output += str(span[i]) + \" \"\r\n\r\n#print(output)\r\n\r\nm = int(input())\r\ninputs = []\r\ncoords = {}\r\n\r\nfor i in range(0, m):\r\n n = eval(input())\r\n # Save values for later\r\n inputs.append(n)\r\n \r\n # Note: could replace array by counter\r\n if n in coords: \r\n coords[n] += 1\r\n else:\r\n coords[n] = 1\r\n\r\noutput = \"\"\r\nfor i in range(0, len(inputs)):\r\n output += str(coords[inputs[i]]) + \" \"\r\n\r\nprint(output)", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n s=input()\r\n s=s.replace('(','')\r\n s=s.replace(')','')\r\n s=s.split('/')\r\n c=float(s[-1])\r\n s=s[0]\r\n s=s.split('+')\r\n a=float(s[0])\r\n b=float(s[1])\r\n ans=(a+b)/c\r\n if ans in d:\r\n d[ans].append(i)\r\n else:\r\n d[ans]=[i]\r\nl=[0]*n\r\nfor k in d.keys():\r\n for i in d[k]:\r\n l[i]=str(len(d[k]))\r\nprint(' '.join(l))\r\n", "x=int(input())\r\ncnt={}\r\nqueue={}\r\na=set([])\r\nfor i in range(x):\r\n each=eval(input())\r\n if (each in a)==False:\r\n cnt[each]=0\r\n cnt[each]+=1\r\n queue[i]=each\r\n a.add(each)\r\nfor i in range(x):\r\n print(cnt[queue[i]],end=' ')\r\n \r\n \r\n \r\n", "import re\r\n\r\nm=int(input())\r\nlis=list()\r\n\r\nfor i in range(m):\r\n s=input()\r\n lis+=[re.split('\\W+', s)]\r\n\r\nd=dict()\r\n\r\nfor i in range(m):\r\n ans=int(lis[i][1])+int(lis[i][2])\r\n ans=ans/int(lis[i][3])\r\n lis[i][0]=ans\r\n if ans in d:\r\n d[ans]+=1\r\n else: d[ans]=1\r\n\r\nfor i in range(m):\r\n print(d[lis[i][0]],end=' ')\r\n", "d = dict()\r\nl = []\r\nfor _ in range(int(input())):\r\n s = input()\r\n try:\r\n d[eval(s)]+=1\r\n except KeyError:\r\n d[eval(s)]=1\r\n l.append(s)\r\nfor e in l:\r\n print(d[eval(e)],end=\" \")", "from collections import defaultdict\r\n\r\ndef gcd(a, b):\r\n if not b:\r\n return a\r\n return gcd(b, a % b)\r\n\r\nD = defaultdict(int)\r\n\r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n x, c = input().split('/')\r\n a, b = x[1:-1].split('+')\r\n a, b, c = int(a), int(b), int(c)\r\n d = a + b\r\n g = gcd(d, c)\r\n d, c = d // g, c // g\r\n D[(d, c)] += 1\r\n A.append((d, c))\r\nB = []\r\nfor x in A:\r\n B.append(D[x])\r\nprint(*B)", "arr = []\r\nd = {}\r\nfor _ in range(int(input())):\r\n s = input()\r\n a,b,c = tuple(map(int, s.replace(\"(\",\"\").replace(\")\",\"\").replace(\"/\",\".\").replace(\"+\",\".\").split(\".\")))\r\n x = (a+b)/c\r\n arr.append(x)\r\n if x not in d:\r\n d[x] = 0\r\n d[x] += 1\r\n\r\nfor i in arr:\r\n print(d[i], end = \" \")", "from collections import defaultdict\r\nd = defaultdict(lambda : 0)\r\n\r\na = []\r\nfor _ in range(int(input())):\r\n s = input()\r\n a.append(s)\r\n d[eval(s)] += 1\r\n\r\nfor e in a:\r\n print(d[eval(e)], end = ' ')", "from collections import defaultdict\nimport sys\n\nlines = sys.stdin.readlines()\nm = int(lines[0])\n\nvals = [eval(l) for l in lines[1:]]\nd = defaultdict(lambda: 0)\nfor val in vals:\n\td[val] += 1\n\nprint(\" \".join([str(d[val]) for val in vals]))\n", "n=int(input())\r\ndicti={}\r\nL=[]\r\nfor i in range(n):\r\n s=input()\r\n a=''\r\n b=''\r\n c=''\r\n i=1\r\n while s[i]!='+':\r\n a+=s[i]\r\n i=i+1 \r\n i=i+1 \r\n while s[i]!=')':\r\n b+=s[i]\r\n i=i+1\r\n c=s[i+2:]\r\n \r\n a,b,c=int(a),int(b),int(c)\r\n res=(a+b)/c \r\n if res in dicti:\r\n dicti[res]+=1\r\n else:\r\n dicti[res]=1\r\n L.append(res)\r\n \r\nfor i in range(len(L)):\r\n print(dicti[L[i]],end=' ')\r\n \r\n \r\n ", "f=input\r\nD,E={},[eval(f())for _ in range(int(f()))]\r\nfor e in E:D[e]=D.get(e,0)+1\r\nfor e in E:print(D[e])", "m = int(input())\nes = [eval(input()) for i in range(m)]\nd = {e: 0 for e in es}\nfor e in es: d[e] += 1\nfor e in es: print(d[e], end=' ')\n\n", "from math import gcd\r\n\r\nn = int(input())\r\nd = dict()\r\nqs = []\r\nfor i in range(n):\r\n s = input()\r\n a = int(s[1:s.index('+')])\r\n b = int(s[s.index('+') + 1: s.index(')')])\r\n c = int(s[s.index(')') + 2:])\r\n a = a + b\r\n gc = gcd(a, c)\r\n res = (a // gc, c // gc)\r\n qs.append(res)\r\n if res in d:\r\n d[res] += 1\r\n else:\r\n d[res] = 1\r\nfor q in qs:\r\n print(d[q], end=' ')\r\n", "from collections import Counter\r\nfrom math import gcd\r\n\r\nm = int(input())\r\n\r\nans = list()\r\n\r\nfor i in range(m):\r\n s = input()\r\n\r\n a = int(s[1:s.index('+')])\r\n b = int(s[s.index('+') + 1: s.index(')')])\r\n c = int(s[s.index('/') + 1:])\r\n\r\n d = a + b\r\n\r\n g = gcd(c, d)\r\n\r\n ans.append(tuple([d // g, c // g]))\r\n\r\nC = Counter(ans)\r\n\r\nprint(' '.join(map(str, [C[el] for el in ans])))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nd = Counter()\r\ne = [0]*n\r\nfor i in range(n):\r\n s = eval(input()[:-1])\r\n d[s] += 1\r\n e[i] = s\r\n\r\nfor i in e:\r\n print(d[i], end=' ')\r\n", "m=int(input())\r\nans=[]\r\nf={}\r\nfor _ in range(m):\r\n n=input()\r\n a=n.split('(')\r\n b=a[1].split(')')\r\n ad,bd=b[0].split('+')\r\n cd=b[1].split('/')[1]\r\n ans.append((int(ad)+int(bd))/int(cd))\r\n f[_]=(int(ad)+int(bd))/int(cd)\r\nfreq = {} \r\nfor item in ans: \r\n if (item in freq): \r\n freq[item] += 1\r\n else: \r\n freq[item] = 1\r\n\r\nfor i in range(m):\r\n print(freq[f[i]],end=\" \")\r\n \r\n ", "n = int(input())\n\nccnt = {}\nsn = {}\n\nfor i in range(1, n+1):\n\ts = input()\n\tres = eval(s)\n\tres = str(format(res, '.6f'))\n\tif (res in ccnt):\n\t\tccnt[res] += 1\n\telse:\n\t\tccnt[res] = 1\n\tsn[i] = res\n\nfor i in range(1, n+1):\n\tprint(str(ccnt[sn[i]]) + \" \", end='')\n\nprint()", "def func():\r\n def parse(s: str):\r\n s += ')'\r\n t,v = '',[]\r\n for e in s:\r\n if e=='(' or e =='/': continue\r\n elif e==')' or e=='+':\r\n v.append(float(t))\r\n t = ''\r\n else: t += e\r\n return (v[0]+v[1])/v[2]\r\n exprsn,hsh = [],{}\r\n for _ in range(int(input())):\r\n s = input()\r\n val = round(parse(s),5)\r\n exprsn.append(val)\r\n hsh[val] = hsh.setdefault(val,0) + 1\r\n for _ in exprsn: print(hsh[_],end=' ')\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)", "n = int(input())\r\ncnt = {}\r\njumps = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n \r\n ind = 0\r\n ret = [\"\", \"\", \"\"]\r\n for j in s:\r\n if j == \"(\":\r\n ind = 0\r\n elif j == \"+\":\r\n ind = 1\r\n elif j == \")\":\r\n continue\r\n elif j == \"/\":\r\n ind = 2\r\n else:\r\n ret[ind] += j\r\n \r\n coord = (int(ret[0]) + int(ret[1])) / int(ret[2])\r\n \r\n if coord not in cnt.keys():\r\n cnt[coord] = 1\r\n else:\r\n cnt[coord] += 1\r\n jumps.append(coord)\r\n \r\nfor i in jumps:\r\n print(cnt[i], end=\" \")\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef gcd(a, b):\r\n if a > b:\r\n a, b = b, a\r\n if b % a==0:\r\n return a\r\n return gcd(b % a, a)\r\n\r\ndef decode(row):\r\n x, y = row.split(\"/\")\r\n y = int(y)\r\n x = x.replace(\")\", \"\").replace(\"(\", \"\")\r\n x1, x2 = x.split(\"+\")\r\n x = int(x1)+int(x2)\r\n g = gcd(x, y)\r\n return (x//g , y//g)\r\n\r\ndef process(A):\r\n n = len(A)\r\n answer = [None for i in range(n)]\r\n L = []\r\n for i in range(n):\r\n L.append([decode(A[i]), i])\r\n L.sort()\r\n curr = [L[0][0], []]\r\n for x, i in L:\r\n if x > curr[0]:\r\n for I in curr[1]:\r\n answer[I] = len(curr[1])\r\n curr = [x, []]\r\n if x==curr[0]:\r\n curr[1].append(i)\r\n for I in curr[1]:\r\n answer[I] = len(curr[1])\r\n answer = ' '.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n return \r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n row = input().decode().strip()\r\n A.append(row)\r\nprocess(A)", "from collections import Counter\r\nm = int(input())\r\ncoord = []\r\nfor i in range(m):\r\n exp = input()\r\n n1 = int(exp[1:exp.index(\"+\")])\r\n n2 = int(exp[exp.index(\"+\")+1:exp.index(\")\")])\r\n n3 = int(exp[exp.index(\"/\")+1:])\r\n coord.append((n1+n2)/n3)\r\ncnt = Counter(coord)\r\nfor i in range(m):\r\n print(cnt[coord[i]],end=\" \")", "m = int(input())\r\nd = {}\r\nans = []\r\nfor _ in range(m):\r\n s = input().split('/')\r\n s[0] = s[0].replace(\"(\",\"\")\r\n s[0] = s[0].replace(\")\",\"\")\r\n a,b = s[0].split('+')\r\n c = int(s[-1])\r\n a = int(a)\r\n b = int(b)\r\n ans.append([a,b,c])\r\n x = \"{0:.4f}\".format((a + b)/c)\r\n d[x] = d.get(x,0) + 1\r\n\r\nfor a,b,c in ans:\r\n x = \"{0:.4f}\".format((a + b)/c)\r\n print(d[x],end = \" \")", "import re\r\n\r\nn = int(input())\r\n\r\ncnt = {}\r\np = []\r\n\r\nfor i in range(n):\r\n s = input().split('/')\r\n c = int(s[1])\r\n a = int(s[0].split('+')[0][1:])\r\n b = int(s[0].split('+')[1][:-1])\r\n p.append(hash((a + b) / c))\r\n if hash((a + b) / c) not in cnt:\r\n cnt[hash((a + b) / c)] = 1\r\n else:\r\n cnt[hash((a + b) / c)] += 1\r\n\r\nfor i in p:\r\n print(cnt[i], end=' ')\r\n\r\n\r\n", "n=int(input())\r\nct = {}\r\nctx = []\r\nfor ni in range(0, n):\r\n\tst = input().strip()[1:]\r\n\tp1 = st.index('+')\r\n\ta = int(st[:p1])\r\n\tst = st[p1+1:]\r\n\tp2 = st.index(')')\r\n\tb = int(st[:p2])\r\n\tc = int(st[p2+2:])\r\n\tv = ((a+b)/c)\r\n\tif v in ct: ct[v]+=1\r\n\telse: ct[v]=1\r\n\tctx.append(v)\r\nst = []\r\nfor cti in ctx: st.append(str(ct[cti]))\r\nprint(\" \".join(st))\r\n\r\n\r\n", "from fractions import gcd\n\nans = []\ndic = {}\n\nn = int(input())\nfor i in range(n):\n word = input()\n word = word.replace('(',',')\n word = word.replace('+',',')\n word = word.replace(')/',',')\n w = word.split(',')\n a = int(w[1])\n b = int(w[2])\n numerator = a + b\n denumerator = int(w[3])\n x = numerator // gcd(numerator, denumerator)\n y = denumerator // gcd(numerator, denumerator)\n ans.append((x, y))\n if (x, y) in dic:\n dic[(x, y)] += 1\n else:\n dic[(x, y)] = 1\nfor i in range(n):\n if i > 0:\n print(' ', end='')\n print(dic[ans[i]], end='')\nprint(\"\\n\", end='')", "n = int(input())\nl=[]\ndic={}\nwhile(n>0):\n\ts=input()\n\tcoord= eval(s)\n\tl.append(coord)\n\tdic[coord]=dic.get(coord,0) + 1\n\tn-=1\n\nnew_list = [ dic[coord] for coord in l ]\nprint(*new_list,sep =\" \")\n", "#codeforces.com/contest/958/problem/D1\r\n\r\nm=int(input())\r\npositions=[]\r\nposcount={}\r\nfor i in range(m):\r\n crew=list(input())\r\n n=len(crew)\r\n i=1\r\n a=''\r\n while crew[i]!='+':\r\n a+=crew[i]\r\n i+=1\r\n b=''\r\n i+=1\r\n while crew[i]!=')':\r\n b+=crew[i]\r\n i+=1\r\n c=''\r\n i+=2\r\n while i<n:\r\n c+=crew[i]\r\n i+=1\r\n a=int(a)\r\n b=int(b)\r\n c=int(c)\r\n res=(a+b)/c\r\n positions.append(res)\r\n if res in poscount:\r\n poscount[res]+=1\r\n else:\r\n poscount[res]=1\r\n\r\nans=[]\r\nfor i in range(m):\r\n ans.append(poscount[positions[i]])\r\nprint(*ans,sep=' ')" ]

[ "s = input()\r\nl = list(set(s))\r\nans = 1\r\nif (len(l)>4) or (len(l)<=1):\r\n ans = 0\r\nelse:\r\n if len(l)==2:\r\n c1=0\r\n c0=0\r\n for i in range(len(s)):\r\n if s[i]==l[0]:\r\n c0+=1\r\n else:\r\n c1+=1\r\n if (c1<2) or (c0<2):\r\n ans = 0\r\n if (len(l)==3):\r\n c1 = 0\r\n c2 = 0\r\n c0 = 0\r\n for i in range(len(s)):\r\n if s[i]==l[0]:\r\n c0+=1\r\n if s[i]==l[1]:\r\n c1+=1\r\n if s[i]==l[2]:\r\n c2+=1\r\n if (c1+c2+c0)<4:\r\n ans = 0\r\nif (ans==0):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n", "\"\"\"Problem B - Not simply beatiful strings.\n\nhttp://codeforces.com/contest/955/problem/B\n\nLet's call a string adorable if its letters can be realigned in such a way\nthat they form two consequent groups of equal symbols (note that different\ngroups must contain different symbols). For example, ababa is adorable (you can\ntransform it to aaabb, where the first three letters form a group of a-s and\nothers — a group of b-s), but cccc is not since in each possible consequent\npartition letters in these two groups coincide.\n\nYou're given a string s. Check whether it can be split into two non-empty\nsubsequences such that the strings formed by these subsequences are adorable.\nHere a subsequence is an arbitrary set of indexes of the string.\n\nInput:\n\nThe only line contains s (1 ≤ |s| ≤ 105) consisting of lowercase latin\nletters.\n\nOutput:\n\nPrint «Yes» if the string can be split according to the criteria above or «No»\notherwise.\n\nEach letter can be printed in arbitrary case.\n\n\"\"\"\nimport logging\n\nch = logging.StreamHandler()\nch.setLevel(logging.DEBUG)\n\nlogger = logging.getLogger()\nlogger.setLevel(logging.DEBUG)\nlogger.addHandler(ch)\n\n\ndef solve(s):\n chars = list(set(s))\n if not (2 <= len(chars) <= 4):\n return False\n if len(chars) == 2 and (s.count(chars[0]) < 2 or s.count(chars[1]) < 2):\n logger.debug('%s, %s', s.count(chars[0]) < 2, s.count(chars[1]) < 2)\n return False\n if len(chars) == 3:\n # At least one has to have more than one duplicated character\n if not any(s.count(c) > 1 for c in chars):\n return False\n return True\n\n\ndef main():\n s = input().strip()\n result = solve(s)\n print('Yes' if result else 'No')\n\n\nif __name__ == '__main__':\n main()\n", "ab = 'abcdefghijklmnopqrstuvwxyz'\r\nab_ = [0] * 26\r\n\r\nstring = str(input())\r\nif len(string) < 4:\r\n print('No')\r\n exit(0)\r\n\r\nk = 0\r\nfor i in range(len(string)):\r\n for j in range(26):\r\n if string[i] == ab[j]:\r\n ab_[j] += 1\r\n\r\nfor i in range(26):\r\n if ab_[i] > 0:\r\n k += 1\r\n\r\nif k > 4:\r\n print('No')\r\n exit(0)\r\n\r\nif k == 1:\r\n print('No')\r\n exit(0)\r\n\r\nif k == 2:\r\n for i in range(26):\r\n if ab_[i] == 1:\r\n print('No')\r\n exit(0)\r\n\r\nprint('Yes')\r\n", "T = input()\r\nD = {}\r\nfor i in T:\r\n if i in D:\r\n D[i]+=1\r\n else:\r\n D[i]=1\r\nR = []\r\nfor i in D:\r\n R.append(D[i])\r\n\r\nif len(R) == 4:\r\n print('YES')\r\nelif len(R) == 3:\r\n if max(R)>=2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif len(R) == 2:\r\n if min(R)>=2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "from collections import defaultdict\n\nstring = input()\n\n\ndef can_split_into_two_adorable():\n letters_count = defaultdict(lambda: 0)\n\n for i in string:\n letters_count[i] += 1\n\n if len(letters_count) > 4 or len(letters_count) == 1:\n return False\n\n if len(letters_count) == 2:\n for i in letters_count.values():\n if i < 2:\n return False\n if len(letters_count) == 3 and sum(letters_count.values()) == 3:\n return False\n\n return True\n\n\nif can_split_into_two_adorable():\n print(\"YES\")\nelse:\n print(\"NO\")", "#codeforces_955B_live\r\nsi = [ e for e in input()]\r\ntest = len(set(si)) \r\nif test > 4 or test == 1:\r\n\tprint(\"No\")\r\nelif test == 2:\r\n\tsi.sort()\r\n\tif si.count(si[0]) == 1 or si.count(si[-1]) == 1 :\r\n\t\tprint(\"No\")\r\n\telse:\r\n\t\tprint(\"Yes\")\r\nelif test == 3:\r\n\tsi.sort()\r\n\tif len(si) == 3:\r\n\t\tprint(\"No\")\r\n\telse:\r\n\t\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"Yes\")\r\n", "s = input()\r\nk = len(set(s))\r\nss= list(set(s))\r\nans=\"NO\"\r\nif k == 4 or k==3 and len(s)!=3 or k==2 and s.count(ss[0])!=1 and s.count(ss[1])!=1:\r\n ans = \"YES\"\r\nprint(ans)", "from collections import Counter\ns = Counter(input())\nif sum(s.values()) < 4 or len(s) == 1 or len(s) > 4 :\n print('No')\n exit()\nelif len(s) >= 3:\n print('Yes')\n exit()\ncheck = 0;\nfor i in s:\n if s[i] == 1:\n check = 1\n break\nif check == 1:\n print('No')\n exit()\nelse:\n print('Yes')\n exit()\nexit()\n", "s=input()\r\nl=26*[0]\r\nfor i in range(0,len(s)):\r\n l[ord(s[i])-ord('a')]+=1\r\nl.sort()\r\nif l[21]>0 or (l[23]==0 and l[24]<2):\r\n print(\"NO\")\r\nelif l[23]>0 and l[22]==0:\r\n if l[25]<2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"YES\")\r\n", "from collections import Counter\r\nd = Counter(input())\r\n \r\nif sum(d.values()) < 4 or len(d) > 4 or len(d) == 1:\r\n print('No')\r\nelif len(d) >= 3:\r\n print('Yes')\r\nelif any(d[k] == 1 for k in d):\r\n print('No')\r\nelse:\r\n print('Yes')", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nx = set(s)\r\nif len(x) > 4 or len(x) == 1:\r\n print('No')\r\n exit(0)\r\n\r\nif len(x) == 4:\r\n print('Yes')\r\n exit(0)\r\n\r\nif len(x) == 3:\r\n if len(s) == 3:\r\n print('No')\r\n else:\r\n print('Yes')\r\n exit(0)\r\n\r\n\r\nx = list(x)\r\na = s.count(x[0])\r\nb = len(s) - a\r\nif a == 1 or b == 1:\r\n print('No')\r\nelse:\r\n print('Yes')", "s = input()\ncnt = [0 for i in range(26)]\nfor c in s:\n cnt[ord(c) - ord('a')] += 1\n\ncnt1 = 0\ncnt2 = 0\nfor i in range(26):\n if cnt[i] > 0:\n cnt1 += 1\n if cnt[i] > 1:\n cnt2 += 1\n\nif cnt1 > 4 or cnt1 < 2:\n print('No')\nelif cnt1 == 2:\n if cnt2 < 2:\n print('No')\n else:\n print('Yes')\nelif cnt1 == 3:\n if len(s) > 3:\n print('Yes')\n else:\n print('No')\nelse:\n print('Yes')\n", "s = input()\nkol = 0\nfor i in range(26):\n if chr(i + 97) in s:\n kol += 1\ntmp = list(set(s))\nif kol == 4:\n print('Yes')\nelif kol == 3 and len(s) != 3:\n print('Yes')\nelif kol == 2 and s.count(tmp[0]) != 1 and s.count(tmp[1]) != 1:\n print('Yes')\nelse:\n print('No')", "n=input()\r\nif len(n)<4:\r\n print(\"No\")\r\nelse:\r\n l=[]\r\n for i in n:\r\n if i not in l:\r\n l+=[i]\r\n d=len(l)\r\n if d>4:\r\n print(\"No\")\r\n elif d==4:\r\n print(\"Yes\")\r\n elif d==3 and len(n)>=4:\r\n print(\"Yes\")\r\n elif d==1:\r\n print(\"No\")\r\n elif d==2:\r\n a=l[0]\r\n b=l[1]\r\n if n.count(a)>=2 and n.count(b)>=2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "R=lambda:map(int,input().split())\r\n\r\ns = str(input())\r\n\r\ndyn = [0] * 26\r\napp = [False] * 26\r\n\r\nfor i in range(len(s)):\r\n dyn[ord(s[i]) - ord('a')] += 1\r\n app[ord(s[i]) - ord('a')] = True\r\n \r\nt = sum(app)\r\n\r\nif t == 1 or t > 4: print('No')\r\n\r\nif t == 2:\r\n if 1 not in dyn: print('Yes')\r\n else: print('No')\r\n \r\nif t == 3:\r\n if max(dyn) > 1: print('Yes')\r\n else: print('No')\r\n \r\nif t == 4: print('Yes')\r\n", "from collections import Counter\r\n\r\ncr = list(dict(Counter(input())).values())\r\nif len(cr) > 4 or len(cr) == 1:\r\n print(\"No\")\r\nelif len(cr) == 4:\r\n print('Yes')\r\nelif len(cr) == 3:\r\n print('Yes' if max(cr)>1 else 'No')\r\nelif len(cr) == 2:\r\n print('Yes' if cr[0]>1 and cr[1]>1 else 'No')\r\n", "s = input()\na = set(s)\nl = len(a)\nc = lambda x: s.count(x) > 1\nprint('Yes' if l == 2 and all(map(c, a)) or l == 3 and any(map(c, a)) or l == 4 else 'No')\n", "from collections import Counter\r\n\r\nstring = str(input())\r\ndistinctChracter = len(set(string))\r\nif distinctChracter>4:\r\n print(\"No\")\r\nelif len(string)<4:\r\n print(\"No\")\r\nelif distinctChracter == 4:\r\n print(\"Yes\")\r\nelif distinctChracter == 1:\r\n print(\"No\")\r\nelif distinctChracter == 3 and len(string) >=4:\r\n print(\"yes\")\r\nelif distinctChracter == 2:\r\n d = Counter(string)\r\n if any(d[k] == 1 for k in d):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")", "X=[0]*128\r\nfor i in input(): X[ord(i)]+=1\r\nchKind,chList=0,[]\r\nfor i in X:\r\n if i:\r\n chKind+=1\r\n chList.append(i)\r\n\r\nif chKind==1: print('No')\r\nif chKind==2:\r\n if min(chList)>1: print('Yes')\r\n else: print('No')\r\nif chKind==3:\r\n if max(chList)>1: print('Yes')\r\n else: print('No')\r\nif chKind==4: print('Yes')\r\nif chKind>4: print('No')", "s = input()\r\nd = {}\r\nfor ch in s:\r\n if ch in d:\r\n d[ch] += 1\r\n else:\r\n d[ch] = 1\r\n\r\nif sum(d.values()) < 4 or len(d) > 4 or len(d) == 1:\r\n print('No')\r\nelif len(d) >= 3:\r\n print('Yes')\r\nelif any(d[k] == 1 for k in d):\r\n print('No')\r\nelse:\r\n print('Yes')", "from collections import Counter\r\ns = input().strip()\r\ncounter = Counter(s)\r\nnchar = len(counter)\r\nans = 'No'\r\nif nchar==4 or \\\r\n nchar==3 and any([n>1 for ch, n in counter.items()]) or\\\r\n nchar==2 and all([n>1 for ch, n in counter.items()]):\r\n\tans = 'Yes'\r\nprint(ans)\r\n", "import collections as cl\r\n\r\n\r\ns = list(cl.Counter(input()).values())\r\nprint(('No', 'Yes')[(len(s) == 2 and s.count(1) == 0\r\n or len(s) == 3 and s.count(1) <= 2\r\n or len(s) == 4)])\r\n\r\n", "s = input()\r\nf=[0]*26\r\na='a'\r\nfor ele in s:\r\n f[ord(ele)-ord(a)]+=1 \r\n\r\nse = set(s)\r\n\r\nif len(se) == 1 or len(se)>4: \r\n print(\"No\")\r\n exit(0)\r\nif len(se)==2:\r\n s = list(se)\r\n if f[ord(s[0])-ord(a)]>1 and f[ord(s[1])-ord(a)]>1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nif len(se)==3:\r\n if f[ord(s[0])-ord(a)]>1 or f[ord(s[1])-ord(a)]>1 or f[ord(s[2])-ord(a)]>1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nif(len(se))==4:\r\n print(\"Yes\")", "a=input()\r\nb=list(set(a))\r\nif(len(b)==1 or len(b)>=5):\r\n\tprint(\"NO\")\r\nelif(len(b)==2):\r\n\tc1=a.count(b[0])\r\n\tc2=a.count(b[1])\r\n\tif(c1>=2 and c2>=2):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelif(len(b)==3):\r\n\tc1=a.count(b[0])\r\n\tc2=a.count(b[1])\r\n\tc3=a.count(b[2])\r\n\tif(c1==1 and c2==1 and c3==1):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\nelse:\r\n\tprint(\"YES\")", "s = input()\r\nu = set(s)\r\nl = len(u)\r\nc = [s.count(x) > 1 for x in u]\r\nif l is 4 or (l is 3 and any(c)) or (l is 2 and all(c)):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "s = list(input())\ns.sort()\nif len(s) < 4:\n print(\"No\")\nelse:\n st = set(s)\n if len(st) > 4:\n print(\"No\")\n elif len(st) < 2:\n print(\"No\")\n elif len(st) == 2:\n c1 = s.count(s[0])\n c2 = s.count(s[-1])\n if c1 < 2 or c2 < 2:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n print(\"Yes\")\n", "import re\r\nimport math\r\nimport decimal\r\nimport bisect\r\n\r\ndef read():\r\n\treturn input().strip()\r\n\r\n# code goes here\r\ncan = False\r\nword = read()\r\nif len(word) < 4:\r\n\t# print(\"if len(word) < 4:\")\r\n\tcan = False\r\nelse:\r\n\tchars = {}\r\n\tfor c in word:\r\n\t\tif c not in chars:\r\n\t\t\tchars[c] = 1\r\n\t\telse:\r\n\t\t\tchars[c] += 1\r\n\r\n\tvals = sorted(chars.values())\r\n\tif len(chars) > 4 or len(chars) == 1:\r\n\t\t# print(\"if len(chars) > 4 or len(chars) == 1:\")\r\n\t\tcan = False\r\n\telif len(chars) == 2:\r\n\t\t# print(\"elif len(chars) == 2:\")\r\n\t\tcan = vals[0] > 1 and vals[1] > 1\r\n\t\t# print(\"vals[0] > 1 and vals[1] > 1 is\", can)\r\n\telse:\r\n\t\t# print(\"else:\")\r\n\t\tcan = True\r\n\t\t# print(\"vals[0] >= 2 and vals[1] >= 2 and vals[2] == 1 is\", can)\r\n\r\nprint(\"Yes\" if can else \"No\")\r\n", "s=input()\r\nif(len(s)<4):\r\n print('No')\r\nelse:\r\n d=0\r\n c=0\r\n a=[0]*26\r\n for i in s:\r\n if(a[ord(i)-ord('a')]==0):\r\n d+=1\r\n a[ord(i)-ord('a')]+=1\r\n if(d==4 or d==3 or (d==2 and (1 not in a))):\r\n c=1\r\n if(c==0):\r\n print('No')\r\n else:\r\n print('Yes')\r\n ", "s = str(input())\r\n\r\nd = dict()\r\n\r\nfor i in s:\r\n d[i] = d.get(i,0)+1\r\n\r\ncnt = 0 \r\nm = 0\r\n\r\nf = []\r\n\r\nfor key in d:\r\n cnt = cnt + 1\r\n f.append(d[key])\r\n m = max(m,d[key])\r\n \r\n#print(cnt)\r\n \r\nif cnt==1:\r\n print(\"No\")\r\n \r\nelif cnt==2:\r\n if f[0]>=2 and f[1]>=2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\nelif cnt==3:\r\n if m>=2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\nelif cnt==4:\r\n print(\"Yes\")\r\n \r\nelse:\r\n print(\"No\")\r\n \r\n ", "s = sorted(input())\nt = 1\nlets = []\nfor i in range(1,len(s)):\n if s[i] == s[i-1]:\n t += 1\n else: \n lets.append(t)\n t = 1\nlets.append(t)\nsuc = False\nif len(lets) == 2 and lets[0] > 1 and lets[1] > 1: suc = True\nif len(lets) == 3 and max(lets) > 1: suc = True\nif len(lets) == 4: suc = True\nif suc: print('Yes')\nelse: print('No')\n", "from collections import Counter\n\n\ndef has_beautiful_splits(s):\n counter = Counter(s)\n if len(counter) == 4:\n return True\n elif len(counter) == 3:\n return max(counter.values()) > 1\n elif len(counter) == 2:\n return min(counter.values()) > 1\n return False\n\n\ns = input()\nprint(\"Yes\" if has_beautiful_splits(s) else \"No\")\n", "# http://codeforces.com/problemset/problem/955/B\n# Not simply beatiful strings\n\nstring = input()\nd = {}\n\nfor c in string:\n try:\n d[c] += 1\n except:\n d[c] = 1\n\nif len(d) == 1:\n print('No')\nelif len(d) == 2:\n valid = True\n for v in d.values():\n if v == 1:\n valid = False\n break\n if valid:\n print('Yes')\n else:\n print('No')\nelif len(d) == 3:\n if len(string) > 3:\n print('Yes')\n else:\n print('No')\nelif len(d) == 4:\n print('Yes')\nelse:\n print('No')\n", "n=input()\r\nb=list(set(n))\r\nif len(b) in range(2,5):\r\n if len(b)==2:\r\n if n.count(b[0])<2 or n.count(b[1])<2:\r\n print('NO')\r\n else:\r\n print('YES')\r\n elif len(n)>=4:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "a=input()\r\ns=set(a)\r\nif(len(s)>4):\r\n print(\"No\")\r\n exit()\r\nif(len(s)==4):\r\n print(\"Yes\")\r\n exit()\r\nif(len(s)==3):\r\n if(len(a)==3):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\nif(len(a)==2 or len(s)==1):\r\n print(\"No\")\r\n exit()\r\nif(len(s)==2):\r\n st=sorted(a)\r\n if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "from collections import*\ns=Counter(input())\nl=len(s)\nprint(['No','Yes'][1<l<5and len([x for x in s.values()if x>1])>3-l])", "from collections import Counter\r\n\r\nd=Counter(input())\r\n\r\nif sum(d.values())<4 or len(d)>4 or len(d)==1:\r\n print(\"NO\")\r\nelif len(d)>=3:\r\n print(\"YES\")\r\nelif any(d[k]==1 for k in d):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def go(s):\r\n d = {}\r\n for c in s:\r\n d[c] = d.get(c, 0) + 1\r\n if len(d.keys()) > 4 or len(d.keys()) == 1:\r\n return 'No'\r\n if len(d.keys()) == 2:\r\n if 1 in d.values():\r\n return 'No'\r\n else:\r\n return 'Yes'\r\n if len(d.keys()) == 3:\r\n if sum(d.values()) > 3:\r\n return 'Yes'\r\n else:\r\n return 'No'\r\n else:\r\n return 'Yes'\r\n \r\n\r\n\r\ns = list(input())\r\nprint(go(s))", "s = input()\na = list(set(s))\nl = len(a)\nprint('Yes' if l == 2 and all(s.count(a[i]) > 1 for i in [0, 1]) or l == 3 and any(s.count(a[i]) > 1 for i in range(3)) or l == 4 else 'No')\n", "s = input()\r\nd, m, l = dict(), set(), list()\r\nfor i in s:\r\n try:\r\n d[i] += 1\r\n except:\r\n d[i] = 1\r\n m.add(i)\r\nfor i in m:\r\n l.append(d[i])\r\nif len(l) == 2:\r\n if min(l) >= 2:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif len(l) == 3:\r\n if l.count(1) != 3:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif len(l) == 4:\r\n print('Yes')\r\nelse:\r\n print('No')", "from collections import Counter\n\ndef main():\n S = input()\n\n counter = Counter(S)\n topn = counter.most_common()\n cnt = len(topn)\n if cnt == 4:\n ans = 'Yes'\n elif cnt == 3:\n if len(S) > 3:\n ans = 'Yes'\n else:\n ans = 'No'\n elif cnt == 2:\n if topn[0][1] > 1 and topn[1][1] > 1:\n ans = 'Yes'\n else:\n ans = 'No'\n else:\n ans = 'No'\n\n print(ans)\n\nmain()\n", "s = input()\r\n\r\nse = len(set(s))\r\n\r\npossible = False\r\n\r\nif(se > 4):\r\n\tpossible = False\r\n\r\nelif (se is 4):\r\n\tpossible = True\r\n\r\nelif (se is 3):\r\n\tif(len(s) >= 4):\r\n\t\tpossible = True\r\n\telse:\r\n\t\tpossible = False\r\n\r\nelif (se is 2):\r\n\tf1 = 0\r\n\tf2 = 0\r\n\tc = s[0]\r\n\tfor c1 in s:\r\n\t\tif c1 == c:\r\n\t\t\tf1 += 1\r\n\t\telse:\r\n\t\t\tf2 += 1\r\n\r\n\tif f1 >= 2 and f2 >= 2:\r\n\t\tpossible = True\r\n\telse:\r\n\t\tpossible = False\r\n\r\nif(possible):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "s = input()\r\nd = {}\r\nfor i in range(len(s)):\r\n try:\r\n d[s[i]] += 1\r\n except KeyError:\r\n d[s[i]] = 1\r\nif len(d) > 4:\r\n print('No')\r\nif len(d) == 4:\r\n print('Yes')\r\nif len(d) == 3:\r\n for i in d:\r\n if d[i] > 1:\r\n print('Yes')\r\n exit()\r\n print('No')\r\nif len(d) == 2:\r\n f = 0\r\n for i in d:\r\n if d[i] <= 1:\r\n f = 1\r\n if f:\r\n print('No')\r\n else:\r\n print('Yes')\r\nif len(d) <= 1:\r\n print('No')", "from sys import exit\r\ns = input()\r\nc = [0]*26\r\nfor i in s:\r\n c[ord(i) - ord('a')]+=1\r\nuse = 0\r\nfor i in c:\r\n if i!=0:\r\n use+=1\r\nif (use==1 or use > 4):\r\n print('No')\r\n exit(0)\r\nif (use==4):\r\n print('Yes')\r\n exit(0)\r\nif (use==3):\r\n if (len(s) >=4):\r\n print('Yes')\r\n else:\r\n print('No')\r\n exit(0)\r\nfor i in c:\r\n if (i!=0):\r\n sav = i\r\nif (sav==1 or len(s) - sav==1):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "d = {}\r\ns = input()\r\nfor l in s:\r\n if l not in d:\r\n d[l] = 0\r\n d[l]+=1\r\nif len(d) > 4:\r\n print('No')\r\nelif len(d) == 3:\r\n if len(s) > 3:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif len(d) == 2:\r\n for k in d:\r\n if d[k] < 2:\r\n print('No')\r\n exit()\r\n print('Yes')\r\nelif len(d)==4:\r\n print('Yes')\r\nelse:\r\n print('No')", "from collections import*\ns=Counter(input())\nl=len(s)\nprint(['No','Yes'][1<l<5and l+sum(x>1for x in s.values())>3])", "s = input()\na = set(s)\nl = len(a)\nc = [s.count(x) > 1 for x in a]\nprint('Yes' if l == 2 and all(c) or l == 3 and any(c) or l == 4 else 'No')\n", "import getpass\r\nimport sys\r\nimport math\r\nfrom decimal import Decimal\r\nimport decimal\r\n\r\nfiles = True\r\ndebug = False\r\n\r\nif getpass.getuser() == 'frohenk' and files:\r\n debug = True\r\n sys.stdin = open(\"test.in\")\r\n # sys.stdout = open('test.out', 'w')\r\nelif files:\r\n # fname = \"gift\"\r\n # sys.stdin = open(\"%s.in\" % fname)\r\n # sys.stdout = open('%s.out' % fname, 'w')\r\n pass\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef range_sum(a, b):\r\n ass = (((b - a + 1) // 2) * (a + b))\r\n if (a - b) % 2 == 0:\r\n ass += (b - a + 2) // 2\r\n return ass\r\n\r\n\r\ndef comba(n, x):\r\n return (math.factorial(n) // math.factorial(n - x)) // math.factorial(x)\r\n\r\n\r\nmp = {}\r\nst = input()\r\nfor i in st:\r\n mp[i] = 0\r\nfor i in st:\r\n mp[i] += 1\r\n\r\nif len(mp) == 4:\r\n print('Yes')\r\n exit(0)\r\n\r\nif len(mp) == 1:\r\n print('No')\r\n exit(0)\r\n\r\nif len(mp) == 2:\r\n if min(mp.values()) >= 2:\r\n print('Yes')\r\n exit(0)\r\n\r\nif len(mp) == 3:\r\n if max(mp.values()) >= 2:\r\n print('Yes')\r\n exit(0)\r\nprint('No')\r\n\r\n", "s = list(input().strip())\r\nh = [0] * 26\r\nfor e in s:\r\n x = ord(e) - ord('a')\r\n h[x] += 1\r\n\r\ncnt = 0\r\nfor e in h:\r\n if e > 0:\r\n cnt += 1\r\n\r\nif cnt > 4 or cnt == 1:\r\n print('No') \r\nelif cnt == 4:\r\n print('Yes')\r\nelif cnt == 3:\r\n if max(h) > 1:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif cnt == 2:\r\n h.sort(reverse=True)\r\n if h[1] > 1:\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\n", "y=input()\nx={i:y.count(i)for i in set(y)}\nl=len(x)\nprint('YNEOS'[(any(x[i]<2 for i in x)if l==2 else len(y)<4)if 1<l<5 else 1::2])", "from collections import Counter\r\n\r\ns = input()\r\n\r\nctr = Counter(s)\r\n\r\ndef check(ctr):\r\n if len(ctr) == 4:\r\n return \"Yes\"\r\n if len(ctr) > 4:\r\n return \"No\"\r\n if len(ctr) == 1:\r\n return \"No\"\r\n if len(ctr) == 2:\r\n for el in ctr:\r\n if ctr[el] == 1:\r\n return \"No\"\r\n return \"Yes\"\r\n if len(ctr) == 3:\r\n for el in ctr:\r\n if ctr[el] > 1:\r\n return \"Yes\"\r\n return \"No\"\r\n\r\nprint(check(ctr))", "s = input()\r\nd = {}\r\nfor i in s:\r\n if d.get(i):\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nif len(d) > 4 or len(d) < 2:\r\n print(\"No\")\r\nelif len(d) == 2:\r\n exist = True\r\n for i in d.values():\r\n if i < 2:\r\n exist = False\r\n if exist:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelif len(d) == 3:\r\n exist = False\r\n for i in d.values():\r\n if i >= 2:\r\n exist = True\r\n if exist:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "S = input()\r\ncount = [0]*26\r\nfor i in S:\r\n count[ord(i) - ord('a')]+=1\r\nDif = 0\r\nfor i in count:\r\n if i!=0:\r\n Dif+=1\r\nif Dif>4 or len(S) < 4:\r\n print(\"No\")\r\nelse:\r\n if (Dif == 1):\r\n print(\"No\")\r\n if Dif>=3:\r\n print(\"Yes\")\r\n if Dif == 2:\r\n flag = True\r\n for i in count:\r\n if i == 1:\r\n flag = False\r\n if flag:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")# 1690962043.3305445", "t = input()\r\nd = {}\r\nfor i in t:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nr = []\r\nfor i in d:\r\n r.append(d[i])\r\n\r\nif len(r) == 4:\r\n print('Yes')\r\nelif len(r) == 3:\r\n if max(r)>=2:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif len(r) == 2:\r\n if min(r)>=2:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelse:\r\n print('No')", "class CodeforcesTask955BSolution:\n def __init__(self):\n self.result = ''\n self.s = ''\n\n def read_input(self):\n self.s = input()\n\n def process_task(self):\n chars = set([ord(c) for c in self.s])\n if len(chars) > 4:\n self.result = \"No\"\n elif len(chars) == 1:\n self.result = \"No\"\n else:\n if len(chars) == 4:\n self.result = \"Yes\"\n elif len(chars) == 3:\n if len(self.s) < 4:\n self.result = \"No\"\n else:\n self.result = \"Yes\"\n else:\n cnts = self.s.count(self.s[0])\n if len(self.s) - cnts == 1 or cnts == 1:\n self.result = \"No\"\n else:\n self.result = \"Yes\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask955BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\ns=input()\na=list(s)\n# print(a)\nd={}\nb=list(set(a))\nif(len(b)>4 or len(b)==1):\n print(\"No\")\n sys.exit()\nif(len(b)==4):\n print(\"Yes\")\n sys.exit()\nif(len(b)==2):\n c1=0\n c2=0\n for k in a:\n c1+=int(k==b[0])\n c2+=int(k==b[1])\n if(c1>1 and c2>1):\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n c1=0\n c2=0\n c3=0\n for k in a:\n c1+=int(k==b[0])\n c2+=int(k==b[1])\n c3+=int(k==b[2])\n if(c1>1 or c2>1 or c3>1):\n print(\"Yes\")\n else:\n print(\"No\")\n\n", "import itertools\r\ns=list(input())\r\nx=len(set(s))\r\nif x==1:\r\n print(\"No\")\r\nelif x==2:\r\n if(s.count(list(set(s))[0]) > 1 and s.count(list(set(s))[1]) > 1):\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif len(set(s)) == 3:\r\n if any(s.count(x) > 1 for x in set(s)):\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif x==4:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "from collections import defaultdict as dd, deque\n\nH = dd(int)\n\ns = input()\n\nfor c in s:\n H[c] += 1\n\nif len(H)==4 or (len(H)==3 and max(H.values())>1) or (len(H)==2 and min(H.values())>1):\n print('Yes')\nelse:\n print('No')\n", "str = input()\r\nflag = False\r\nd = {}\r\nfor i in str:\r\n d[i] = d[i] + 1 if i in d else 1\r\nif len(d) == 4:\r\n flag = True\r\nif len(d) == 3:\r\n for i in d:\r\n if d[i] > 1:\r\n flag = True\r\nif len(d) == 2:\r\n flag = True\r\n for i in d:\r\n if d[i] == 1:\r\n flag = False\r\nif flag:\r\n print('Yes')\r\nelse:\r\n print('No')", "s = input()\r\ndict = {}\r\nfor i in range(len(s)):\r\n if s[i] not in dict.keys():\r\n dict[s[i]] = 1\r\n else:\r\n dict[s[i]] += 1\r\nif len(s) == 1:\r\n print('No')\r\nelse:\r\n if len(dict) == 1:\r\n print('No')\r\n elif len(dict) == 2:\r\n k = 1\r\n for i in dict:\r\n if dict[i] == 1:\r\n k = 0\r\n if k == 1:\r\n print('Yes')\r\n else:\r\n print('No')\r\n elif len(dict) == 3:\r\n if len(s) > 3:\r\n print('Yes')\r\n else:\r\n print('No')\r\n elif len(dict) == 4:\r\n print('Yes')\r\n else:\r\n print('No')", "s = input()\nchars = {}\nfor c in s:\n if c not in chars:\n chars[c] = 0\n chars[c]+=1\n\nif len(chars.keys()) == 1 or len(chars.keys()) > 4:\n print(\"No\")\nelif len(chars.keys()) == 2:\n one = 0\n for key in chars:\n if chars[key]==1:\n one+=1\n if one == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelif len(chars.keys()) == 3:\n one = 0\n for key in chars:\n if chars[key]==1:\n one+=1\n if one <= 2:\n print(\"Yes\")\n else:\n print(\"No\")\nelif len(chars.keys()) == 4:\n print(\"Yes\")\n", "from collections import Counter\r\n\r\ns = input().strip()\r\n\r\ncounter = Counter(s)\r\n\r\nif len(s) < 4:\r\n print('No')\r\nelif len(counter) == 1:\r\n print('No')\r\nelif len(counter) > 4:\r\n print('No')\r\nelif len(counter) >= 3:\r\n print('Yes')\r\nelif len(counter) == 2:\r\n if min(counter.values()) > 1:\r\n print('Yes')\r\n else:\r\n print('No')", "s = input()\nt = set(s)\nl = len(t)\nprint(['No', 'Yes'][2 <= l <= 4 and l + sum(s.count(x) >= 2 for x in t) >= 4])\n", "s = input()\nd = {}\na = set()\nfor i in s:\n\tif i not in d:\n\t\td[i] = 1\n\t\ta.add(i)\n\telse:\n\t\td[i] += 1\nif len(d) > 4 or len(d) <= 1:\n\tprint(\"No\")\nelif len(d) == \"4\":\n\tprint(\"Yes\")\nelse:\t\n\t#print(d)\n\t#print(a)\n\t\n\ty = []\n\tfor j in a:\n\t\ty.append(d[j])\n\ty.sort()\n\tif y[0] >= 2:\n\t\tprint(\"Yes\")\n\telif len(y) == 2 and y[0] == 1:\n\t\tprint(\"No\")\n\telif len(y) == 3 and y[2] == 1:\n\t\tprint(\"No\")\n\telse:\n\t\tprint(\"Yes\")\n\n\n\n\t\t \n", "a=list(input())\r\nb=[0]*26\r\ncount=0\r\nfor i in a:\r\n b[ord(i)-ord('a')]+=1\r\nif b.count(0)<22:\r\n exit(print('NO'))\r\nif len(set(a))==3 and max(b)>=2:\r\n exit(print('YES'))\r\nif len(set(a))==4:\r\n exit(print('YES'))\r\nif len(set(a))==2:\r\n for i in set(a):\r\n if b[ord(i)-ord('a')]<2:\r\n exit(print('NO'))\r\n else:\r\n count+=1\r\n if count==2:\r\n exit(print('YES'))\r\nprint('NO')\r\n ", "def main():\r\n\tstring = input()\r\n\tletters = {}\r\n\tfor i in string:\r\n\t\tif(i in letters):\r\n\t\t\tletters[i] += 1\r\n\t\telse:\r\n\t\t\tif(len(letters) == 4):\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\treturn\r\n\t\t\telse:\r\n\t\t\t\tletters[i] = 1\r\n\t\r\n\tif(len(letters) == 4):\r\n\t\tprint(\"Yes\")\r\n\telif(len(letters) == 3):\r\n\t\tfor i in letters.keys():\r\n\t\t\tif letters[i] > 1:\r\n\t\t\t\tprint(\"Yes\")\r\n\t\t\t\treturn\r\n\t\tprint(\"No\")\r\n\t\treturn\r\n\telif(len(letters) == 2):\r\n\t\tkeys = list(letters.keys())\r\n\t\tif(letters[keys[0]] > 1 and letters[keys[1]] > 1):\r\n\t\t\tprint(\"Yes\")\r\n\t\t\treturn\r\n\t\telse:\r\n\t\t\tprint(\"No\")\r\n\t\t\treturn\r\n\telse:\r\n\t\tprint(\"No\")\r\n\t\treturn\r\n\r\nmain()\r\n\t", "import sys,math \r\ns=input()\r\nif len(set(list(s)))==1 or len(set(list(s)))>4:\r\n print(\"NO\")\r\nelif len(set(list(s)))==4:\r\n print(\"YES\")\r\nelif len(set(list(s)))==3:\r\n if len(s)>3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif len(set(list(s)))==2:\r\n a=[0]*26\r\n for i in range(len(s)):\r\n a[ord(s[i])-97]+=1 \r\n a.sort(reverse=True)\r\n if a[0]>1 and a[1]>1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "a=[0]*27\r\nx=input()\r\nfor i in x:\r\n a[ord(i)-96]+=1\r\ns=0\r\nq=0\r\nfor i in a:\r\n if i!=0: s+=1\r\n if i>1: q+=1\r\nif s>4:\r\n print('No')\r\nelif s<=1:\r\n print('No')\r\nelif s==4:\r\n print('Yes')\r\nelif s==2:\r\n if q>=2:\r\n print('Yes')\r\n else: print('No')\r\nelse:\r\n if q>=1:\r\n print('Yes')\r\n else: print('No')", "x = input()\nd = {}\nfor l in 'abcdefghijklmnopqrstuvwxyz':\n if l in x:\n d[l] = x.count(l)\n\ndef panic():\n print(\"No\")\n exit(0)\n\ndef ok():\n print(\"Yes\")\n exit(0)\n\ncnt = len(d.keys())\nnums = sorted(d.values())\n\nif cnt == 2 and nums[0] > 1 and nums[1] > 1:\n ok()\n\nif cnt == 3 and max(nums)>1:\n ok()\n\nif cnt == 4:\n ok()\n\npanic()\n", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\nfrom collections import Counter\r\ns = Counter(input())\r\nif sum(s.values()) < 4 or len(s) > 4 or len(s) == 1:\r\n print('No')\r\nelif len(s) >= 3:\r\n print('Yes')\r\nelif any(s[i] == 1 for i in s):\r\n print('No')\r\nelse:\r\n print('Yes')", "s = input()\r\na = [0]*26\r\nfor i in s:\r\n a[ord(i)-97]+=1\r\no = []\r\nfor i in a:\r\n if i > 0:o.append(i)\r\nif len(o)==0:\r\n print('No')\r\nelif len(o)>= 5:print('No')\r\nelif len(o)==1:print('No')\r\nelif len(o) == 4:print('Yes')\r\nelse:\r\n t = len(o)\r\n for i in o:\r\n if i > 1:t += 1\r\n if t >= 4:\r\n print('Yes')\r\n else:print('No')\r\n", "from collections import Counter\r\n\r\ns = input()\r\nd = Counter(s)\r\n\r\nif len(s) < 4 or len(d) > 4 or len(d) == 1:\r\n print('No')\r\nelif len(d) >= 3:\r\n print('Yes')\r\nelif any(d[k] == 1 for k in d):\r\n print('No')\r\nelse:\r\n print('Yes')", "s = list(input())\n\nc = {}\nfor e in s:\n if e not in c:\n c[e] = 1\n else:\n c[e] += 1\n\ntam = len(c)\nflag = True\n\nif tam <= 1 or tam >= 5:\n flag = False\n\nelif tam == 2:\n for e in c:\n if c[e] <= 1:\n flag = False\n break\n\nelif tam == 3:\n flag = False\n for e in c:\n if c[e] >= 2:\n flag = True\n break\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "a=input();b=list(set(a))\r\nif len(b) in range(2,5):\r\n if len(b)==2:\r\n if a.count(b[0])<2 or a.count(b[1])<2:\r\n print('NO')\r\n else:\r\n print('YES')\r\n elif len(a)>=4:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\ndef bstring(s):\r\n d = dict()\r\n for letter in s:\r\n d[letter] = d.get(letter, 0) + 1\r\n if len(d.keys()) > 4 or len(d.keys()) < 2:\r\n return 'No'\r\n elif len(d.keys()) == 4:\r\n return 'Yes'\r\n elif len(d.keys()) == 2:\r\n for c in d.values():\r\n if c == 1:\r\n return 'No'\r\n return 'Yes'\r\n elif len(d.keys()) == 3:\r\n for c in d.values():\r\n if c >= 2:\r\n return 'Yes'\r\n return ' No'\r\nprint(bstring(s))", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(S):\r\n L = [0 for i in range(26)]\r\n for c in S:\r\n L[ord(c)-ord('a')]+=1 \r\n L = [x for x in L if x > 0]\r\n L.sort()\r\n if len(L) > 4:\r\n sys.stdout.write('No\\n')\r\n return \r\n if len(L)==4:\r\n sys.stdout.write('Yes\\n')\r\n return \r\n if len(L)==3:\r\n a, b, c = L \r\n if c > 1:\r\n sys.stdout.write('Yes\\n')\r\n return \r\n else:\r\n sys.stdout.write('No\\n')\r\n return \r\n if len(L)==2:\r\n a, b = L \r\n if a > 1:\r\n sys.stdout.write('Yes\\n')\r\n return \r\n else:\r\n sys.stdout.write('No\\n')\r\n return\r\n if len(L)==1:\r\n sys.stdout.write('No\\n')\r\n return \r\nS = input().decode().strip()\r\nprocess(S)", "s = str(input())\nfrom collections import Counter\nC = Counter(s)\nC = list(C.values())\nC.sort(reverse=True)\nif len(C) == 1:\n print('No')\nelif len(C) == 2:\n if C[0] >= 2 and C[1] >= 2:\n print('Yes')\n else:\n print('No')\nelif len(C) == 3:\n if C[0] >= 2:\n print('Yes')\n else:\n print('No')\nelif len(C) == 4:\n print('Yes')\nelse:\n print('No')\n", "def ok(s):\n st = set(s)\n if not 2 <= len(st) <= 4:\n return False\n if len(st) == 2:\n return all(s.count(v) >= 2 for v in st)\n elif len(st) == 3:\n return any(s.count(v) >= 2 for v in st)\n else:\n return True\n\ns = input()\n\nif ok(s):\n print('Yes')\nelse:\n print('No')\n", "s = input()\r\nset_s = set(s)\r\nyes = 0\r\ncnt = 0\r\nif len(set_s) == 2:\r\n if sum(s.count(x) > 1 for x in set_s) == 2:\r\n yes = 1\r\nelif len(set_s) == 3:\r\n if sum(s.count(x) > 1 for x in set_s):\r\n yes = 1\r\nelif len(set_s) == 4:\r\n yes = 1\r\n\r\nprint(['No', 'Yes'][yes])", "s,m=set(),set()\r\nb=0\r\nfor i in input():\r\n if i not in s:\r\n s.add(i)\r\n else:\r\n m.add(i)\r\n if len(s)>4:\r\n print('No')\r\n quit()\r\n elif len(s)+len(m)>=4:\r\n b=1\r\nif b:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "s = input()\r\nd,lst = {},[]\r\nfor i,x in enumerate(s):\r\n if d.get(x)==None:\r\n d[x]=0\r\n lst.append(x)\r\n d[x]+=1\r\nle = len(d)\r\nif le==1 or le>4:\r\n print('No')\r\nelse:\r\n if le==2:\r\n if d[lst[0]]>1 and d[lst[1]]>1:\r\n print('Yes')\r\n else:\r\n print('No')\r\n elif le==3:\r\n if len(s)>3:\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n print('Yes')", "s = input()\r\nset0 = set()\r\narr = []\r\nfor i in s:\r\n set0.add(i)\r\nset0 = list(set0)\r\nfor i in set0:\r\n arr.append(s.count(i))\r\nif len(set0) > 4 or len(set0) == 1:\r\n print(\"No\")\r\nelif len(set0) == 2 and 1 in arr:\r\n print(\"No\")\r\nelif len(set0) == 3 and arr.count(1) == 3:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "s = input()\r\nn = len(s)\r\n\r\nfreq = [0] * 26\r\nfor i in range(n):\r\n freq[ord(s[i]) - ord('a')] += 1\r\n \r\nunique = 0\r\ncnt = [0, 0, 0]\r\nfor i in range(26):\r\n if freq[i] > 0:\r\n unique += 1\r\n if freq[i] == 1:\r\n cnt[1] += 1\r\n else:\r\n cnt[2] += 1\r\n\r\nif unique <= 1 or unique >= 5:\r\n print(\"No\")\r\nelif unique == 4:\r\n print(\"Yes\")\r\nelif unique == 3 and cnt[2] >= 1:\r\n print(\"Yes\")\r\nelif unique == 2 and cnt[2] >= 2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\nt=set(s)\nl=len(t)\nprint(['No','Yes'][1<l<5and l+sum(s.count(x)>1for x in t)>3])\n\t\t\t\t \t\t\t\t \t \t \t \t\t\t\t\t \t\t \t", "s=input()\nfrom collections import Counter\n\ndef adorable(s):\n if len(set(s))==1:\n return 'No'\n if len(s)<4:\n return 'No'\n if len(set(s)) > 4:\n return 'No'\n if len(set(s))==2:\n d=Counter(s)\n for i in d:\n if d[i]==1:\n return 'No'\n return 'Yes'\nprint(adorable(s))\n", "#in\r\ns = input()\r\n\r\n#comp\r\nans = \"No\"\r\n\r\nif len(s)>3:\r\n letern = 1\r\n leters = [s[0]]\r\n letersc = [0]\r\n \r\n for l in s:\r\n f = 0\r\n for i in range(0, letern):\r\n if leters[i] == l:\r\n letersc[i] += 1\r\n f = 1\r\n if f == 0:\r\n letern += 1\r\n leters.append(l)\r\n letersc.append(1)\r\n \r\n if letern == 4:\r\n ans = \"Yes\"\r\n if letern == 3:\r\n ans = \"Yes\"\r\n if letern == 2:\r\n f = 0\r\n for c in letersc:\r\n if c == 1:\r\n f = 1\r\n if f != 1:\r\n ans = \"Yes\"\r\n \r\n \r\n#out\r\nprint(ans)\r\n\r\n\r\n", "s = input()\r\na = [0] * 26\r\nfor i in range(len(s)):\r\n a[ord(s[i]) - ord('a')] += 1\r\nctr = 0\r\nfor x in a:\r\n if x > 0:\r\n ctr += 1\r\nans = \"No\"\r\nif ctr > 1:\r\n if ctr == 2:\r\n cnt = 0\r\n for x in a:\r\n if x > 1:\r\n cnt += 1\r\n if cnt == ctr:\r\n ans = \"Yes\"\r\n elif ctr == 3:\r\n b = False\r\n for x in a:\r\n if x > 1:\r\n b = True\r\n break\r\n if b:\r\n ans = \"Yes\"\r\n elif ctr == 4:\r\n ans = \"Yes\"\r\nprint(ans)", "from collections import Counter\r\nslovo = Counter(input())\r\nif sum(slovo.values()) < 4 or len(slovo) > 4 or len(slovo) == 1:\r\n print('No')\r\nelif len(slovo) >= 3:\r\n print('Yes')\r\nelif any(slovo[i] == 1 for i in slovo):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "# IAWT\r\ns = input()\r\ncnt = [0 for i in range(26)]\r\nfor el in s:\r\n cnt[ord(el) - ord('a')] += 1\r\n\r\ntps = 0\r\nnos = 0\r\nfor i in range(26):\r\n if cnt[i] > 0:\r\n tps += 1\r\n if cnt[i] > 1:\r\n nos += 1\r\n\r\ndef f():\r\n if tps > 4: return False\r\n if tps < 2: return False\r\n if tps == 2:\r\n if nos < 2: return False\r\n return True\r\n if tps == 3:\r\n if len(s) > 3: return True\r\n return False\r\n return True\r\nif f(): print('Yes')\r\nelse: print('No')\r\n \r\n", "s=input()\nt=set(s)\nl=len(t)\nprint(['No','Yes'][1<l<5and l+sum(x>1for x in (s.count(y) for y in t))>3])", "#JMD\r\n#Nagendra Jha-4096\r\n\r\n#a=list(map(int,sys.stdin.readline().split(' ')))\r\n#n,k,s= map(int, sys.stdin.readline().split(' '))\r\n\r\nimport sys\r\nimport math\r\n\r\n#import fractions\r\n#import numpy\r\n\r\n###Defines...###\r\nmod=1000000007\r\n\r\n###FUF's...###\r\ndef nospace(l):\r\n\tans=''.join(str(i) for i in l)\r\n\treturn ans\r\n\r\n\r\n\r\n##### Main ####\r\ns=str(input())\r\nsets=set(s)\r\nif(len(sets)>4 or len(sets)==1):print(\"No\")\r\nelif(len(sets)==4): print(\"Yes\")\r\nelif(len(sets)==3):\r\n flag=0\r\n for ss in sets:\r\n if(s.count(ss)>1):\r\n flag=1\r\n break\r\n if(flag):print(\"Yes\")\r\n else:print(\"No\")\r\nelif(len(sets)==2):\r\n flag=1\r\n for ss in sets:\r\n if(s.count(ss)==1):\r\n flag=0\r\n break\r\n if(flag):print(\"Yes\")\r\n else:print(\"No\")\r\n \r\n\r\n", "s=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\nif len(d)>4 or len(d)==1:\r\n print('No')\r\nelse:\r\n if len(d)==2:\r\n ans=True\r\n for i in d:\r\n if d[i]==1:\r\n ans=False\r\n break\r\n if ans:\r\n print('Yes')\r\n else:\r\n print('No')\r\n elif len(d)==3:\r\n ans=False\r\n for i in d:\r\n if d[i]>1:\r\n ans=True\r\n break\r\n if ans:\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n print(\"Yes\")", "s = list(input())\r\narr = [0]*26\r\nfor i in range(len(s)):\r\n arr[ord(s[i])-ord('a')]+=1\r\nones = 0\r\nmul =0\r\nfor i in range(len(arr)):\r\n if(arr[i]==1):\r\n ones+=1\r\n elif(arr[i]>1):\r\n mul+=1\r\nif(ones+mul>4):\r\n print(\"No\")\r\nelif(ones+mul==4):\r\n print(\"Yes\")\r\nelif(ones+mul==3):\r\n if(mul):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelif(ones+mul==2):\r\n if(ones):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n ", "s = {}\r\ni = input()\r\nfor ch in i:\r\n if ch in s:\r\n s[ch] += 1\r\n else:\r\n s[ch] = 1\r\n\r\n# s = set(input())\r\n\r\nif len(s) > 4:\r\n print('No')\r\nelif len(s) == 4:\r\n print('Yes')\r\nelif len(s) == 3:\r\n print('Yes' if len(i) > 3 else 'No')\r\nelif len(s) == 2:\r\n if all((x >= 2 for x in s.values())):\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif len(s) == 1:\r\n print('No')", "N = 26; s = input (); cnt = dict ()\r\nfor ch in s : cnt[ch] = cnt.get (ch, 0) + 1\r\ncnt1, cnt2 = 0, 0\r\nfor i in cnt.keys () :\r\n if cnt[i] > 1 : cnt2 += 1\r\n else : cnt1 += 1\r\nif len (s) < 4 or cnt1 + cnt2 > 4 or cnt1 + cnt2 == 1: print (\"No\")\r\nelif cnt1 + cnt2 == 2 : print (\"Yes\" if cnt2 == 2 else \"No\")\r\nelse : print (\"Yes\")\r\n", "s = input()\r\nseta = set(s)\r\n\r\nif len(s) < 4:\r\n print(\"No\")\r\nelif len(seta) == 2:\r\n ans = \"Yes\"\r\n for i in seta:\r\n if s.count(i) == 1:\r\n ans = \"No\"\r\n break\r\n print(ans)\r\nelif len(seta) in [3, 4]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# ===================================\r\nq = [str(x) for x in input()]\r\ns = set(q)\r\nl = len(s)\r\nflag = 0\r\nif l == 2 or l == 4:\r\n\tflag = 1\r\n\tif l == 2 and any(q.count(x) < 2 for x in s):\r\n\t\tflag = 0\t\t\r\nif l == 3:\r\n\tif any(q.count(x) > 1 for x in s):\r\n\t\tflag = 1\r\nprint(\"Yes\" if flag else \"No\")", "s=input()\r\nd=len(set(s))\r\nfrom collections import Counter \r\nc=Counter(s)\r\nif len(s)<4:\r\n print('No')\r\nelif d>4:\r\n print('No')\r\nelif d==4:\r\n print('Yes')\r\nelif d==3:\r\n print('Yes')\r\nelif d==2:\r\n for i in c:\r\n if c[i]==1:\r\n print('No')\r\n break \r\n else:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n \r\n ", "s=input()\nmp={}\nfor i in s:\n\tif(i in mp):\n\t\tmp[i]=mp[i]+1\n\telse:\n\t\tmp[i]=1\n\nif(len(mp)>4 or len(mp)<=1):\n\tprint(\"No\")\nelse:\n\n\tif(len(mp)==4):\n\t\tprint(\"Yes\")\n\t\n\telif(len(mp)==3):\n\t\tif(max(mp.values())>=2):\n\t\t\tprint(\"Yes\")\n\t\telse:\n\t\t\tprint('No')\n\t\n\telif(len(mp)==2):\n\t\tl=list(mp.values())\n\t\tif(l[0]>=2 and l[1]>=2):\n\t\t\tprint(\"Yes\")\n\t\telse:\n\t\t\tprint('No')", "import sys\r\nfrom collections import defaultdict\r\ns = list(input().strip())\r\nn = len(s)\r\nif n < 4:\r\n print(\"No\")\r\n sys.exit(0)\r\ncount = defaultdict(int)\r\nfor x in s:\r\n count[x] += 1\r\n\r\nn = len(count)\r\nif n == 1 or n > 4:\r\n res = \"No\"\r\nelif n == 4:\r\n res = \"Yes\"\r\nelif n == 3:\r\n res = \"No\"\r\n for x in count.values():\r\n if x >=2:\r\n res = \"Yes\"\r\nelse:\r\n res = \"Yes\"\r\n for x in count.values():\r\n if x < 2:\r\n res = \"No\"\r\nprint(res)\r\n", "str = input()\nst = [0 for x in range(26)]\nst2 = [0 for x in range(26)]\n\nif len(str) < 4:\n print(\"No\")\n exit()\n\ndf = 0\n\nfor i in range(len(str)):\n st[ord(str[i])-97] += 1\n \n if st2[ord(str[i])-97] != 1:\n df += 1\n st2[ord(str[i])-97] += 1\n \n if df > 4:\n print(\"No\")\n exit()\n \nif (df == 2 and 1 in st) or df == 1:\n print(\"No\")\n exit()\n\nprint(\"YES\") \n", "import sys\r\nimport bisect\r\n#input=sys.stdin.readline\r\ns=input()\r\nhashi=dict()\r\nfor i in s:\r\n if(i in hashi):\r\n hashi[i]+=1\r\n else:\r\n hashi[i]=1\r\nz=len(hashi)\r\nif(len(s)<4):\r\n print(\"No\")\r\n quit()\r\nif(z>4):\r\n print(\"No\")\r\n quit()\r\nif(z==1):\r\n print(\"No\")\r\n quit()\r\nrem=0\r\nfor i in hashi:\r\n if(hashi[i]>1):\r\n rem+=1\r\nif(rem+z>=4):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = input()\r\nr = set(s)\r\nif len(r)>=5 or len(r)<=1:\r\n print('No')\r\nif len(r)==4:\r\n print('Yes')\r\nif len(r)==3:\r\n if len(s)>3:\r\n print('Yes')\r\n else:\r\n print('No')\r\nif len(r)==2:\r\n d = dict()\r\n f = 1\r\n for i in s:\r\n if d.get(i)==None: d[i]=1\r\n else: d[i]+=1\r\n for i in s:\r\n if d[i] == 1: f=0\r\n if f:\r\n print('Yes')\r\n else:\r\n print('No')", "s=input()\r\nes1=\"\"\r\nes2=\"\"\r\nif len(s)<4:\r\n print(\"No\")\r\n exit(0)\r\nelse:\r\n a=list(set(s))\r\n a.sort()\r\n b=len(a)\r\n if b>4:\r\n print(\"No\")\r\n exit(0)\r\n else:\r\n if b==3 or b==4:\r\n print(\"Yes\")\r\n elif b==1:\r\n print(\"No\")\r\n else:\r\n for i in a:\r\n if s.count(i)==1:\r\n print(\"No\")\r\n exit()\r\n print(\"Yes\")\r\n", "s = dict()\r\nfor symb in list(input()):\r\n\ts[symb] = s.get(symb, 0) + 1\r\ncnt = 0\r\nc = []\r\nfor i in s.values():\r\n\tc.append(i)\r\n\tcnt += 1\r\nif cnt == 4:\r\n\tprint('Yes')\r\nelif cnt == 3:\r\n\tif c[0] > 1 or c[1] > 1 or c[2] > 1:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\tprint('No')\r\nelif cnt == 2:\r\n\tif c[0] > 1 and c[1] > 1:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\tprint('No')\r\nelse:\r\n\tprint('No')", "from collections import Counter\r\ns = input()\r\nc = Counter(s)\r\n\r\nif len(s) < 4 or len(c) > 4 or len(c) <= 1:\r\n print(\"No\")\r\n exit(0)\r\n \r\nif len(c) >= 3:\r\n print(\"Yes\")\r\n exit(0)\r\n \r\nprint(\"Yes\") if min(c.values()) > 1 else print(\"No\")", "A=input()\r\nzzz=0\r\nif len({elem:elem for elem in list(A)})>4 or len({elem:elem for elem in list(A)})<2:\r\n ans='NO'\r\nelse:\r\n if len({elem:elem for elem in list(A)})==2: \r\n d = dict.fromkeys(A, 0) \r\n for c in A: \r\n d[c] += 1\r\n for i in range(len(A)):\r\n if d[A[i]]==len(A)-1:\r\n zzz+=1\r\n if zzz==0:\r\n ans='YES'\r\n else:\r\n ans='NO'\r\n else:\r\n if len({elem:elem for elem in list(A)})==3:\r\n if len(A)>3:\r\n ans='YES'\r\n else:\r\n ans='NO'\r\n else:\r\n if len({elem:elem for elem in list(A)})==4:\r\n ans='YES'\r\nprint(ans)", "from collections import Counter\r\n\r\ns = input()\r\ncount = Counter(s)\r\nif sum(count.values()) < 4 or len(count) > 4 or len(count) == 1:\r\n print('No')\r\nelif len(count) >= 3:\r\n print('Yes')\r\nelif any(count[k] == 1 for k in count):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "from collections import defaultdict\n\ns = input()\nd = defaultdict(int)\nfor i in s:\n d[i] += 1\n\nif len(s) < 4:\n print(\"No\")\n exit()\n\nvals = sorted(d.values())\nif len(vals) == 1:\n print(\"No\")\nelif len(vals) == 2:\n if vals[0] == 1:\n print(\"No\")\n else:\n print(\"Yes\")\nelif len(vals) == 3:\n print(\"Yes\")\nelif len(vals) == 4:\n print(\"Yes\")\nelif len(vals) > 4:\n print(\"No\")\n", "x=input()\r\nif len(set(x))>4 or len(x)<4:\r\n print(\"No\")\r\n exit\r\nelse :\r\n if len(set(x))==1:\r\n print(\"No\")\r\n if len(set(x))==2:\r\n if all( x.count(i)>=2 for i in set(x)):\r\n print(\"Yes\")\r\n else :\r\n print(\"No\")\r\n if len(set(x))==3 or len(set(x))==4:\r\n print(\"Yes\")\r\n \r\n \r\n ", "test_str = input()\r\n\r\nmmap = {}\r\n\r\nfor c in test_str:\r\n if c in mmap.keys():\r\n mmap[c] = mmap[c] + 1\r\n else:\r\n mmap[c] = 1\r\n\r\nnum = len(mmap.keys())\r\n\r\nif (num > 4 or num <=1):\r\n print(\"No\")\r\nelif (num==2):\r\n for key,value in mmap.items():\r\n if(value <2):\r\n print(\"No\")\r\n exit()\r\n print(\"Yes\")\r\nelif (num==3):\r\n if(sum(mmap.values()) < 4):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\nelse:\r\n print(\"Yes\")\r\n\r\n\r\n \r\n\r\n\r\n" ]

[ "n, m = (int(x) for x in input().strip().split())\r\n\r\ncoproc = [int(x) for x in input().strip().split()]\r\nedges = []\r\nfor _ in range(m):\r\n edges.append((int(x) for x in input().strip().split()))\r\n\r\ninorder = [0] * n \r\nadj = [[] for _ in range(n)]\r\nfor u, v in edges:\r\n adj[v].append(u)\r\n inorder[u] += 1\r\n \r\nqueue0 = [u for u in range(n) if inorder[u]==0 and not coproc[u]]\r\nqueue1 = [u for u in range(n) if inorder[u]==0 and coproc[u]]\r\n\r\nres = 0 \r\n\r\nwhile len(queue0)>0 or len(queue1)>0:\r\n \r\n while queue0:\r\n next0 = []\r\n for u in queue0:\r\n for v in adj[u]:\r\n inorder[v] -= 1 \r\n if inorder[v] == 0:\r\n if coproc[v]:\r\n queue1.append(v)\r\n else:\r\n next0.append(v)\r\n queue0 = next0\r\n \r\n if queue1:\r\n res += 1 # coproc call\r\n \r\n \r\n while queue1:\r\n next1 = []\r\n for u in queue1:\r\n for v in adj[u]:\r\n inorder[v] -= 1 \r\n if inorder[v] == 0:\r\n if coproc[v]:\r\n next1.append(v)\r\n else:\r\n queue0.append(v)\r\n queue1 = next1\r\n \r\nprint(res)", "from sys import stdin\r\nfrom collections import deque\r\n\r\nn,m = [int(x) for x in stdin.readline().split()]\r\n\r\ne = [int(x) for x in stdin.readline().split()]\r\ngraph = [set() for x in range(n)]\r\nreverse = [set() for x in range(n)]\r\nroot = set([x for x in range(n)])\r\n\r\nfor edge in range(m):\r\n a,b = [int(x) for x in stdin.readline().split()]\r\n graph[b].add(a)\r\n reverse[a].add(b)\r\n if a in root:\r\n root.remove(a)\r\n\r\ndone = set()\r\n\r\nqMain = deque(list(root))\r\nqCo = deque()\r\n\r\ntotal = -1\r\n\r\nwhile len(done) < n:\r\n total += 1\r\n while qCo:\r\n nxt = qCo.popleft()\r\n #print('co', nxt)\r\n if e[nxt] == 0:\r\n qMain.append(nxt)\r\n else:\r\n done.add(nxt)\r\n for x in graph[nxt]:\r\n reverse[x].remove(nxt)\r\n if not reverse[x]:\r\n qCo.append(x)\r\n \r\n while qMain:\r\n nxt = qMain.popleft()\r\n #print('main', nxt)\r\n if e[nxt] == 1:\r\n qCo.append(nxt)\r\n else:\r\n done.add(nxt)\r\n for x in graph[nxt]:\r\n reverse[x].remove(nxt)\r\n if not reverse[x]:\r\n qMain.append(x)\r\n\r\nprint(total)\r\n" ]

[ "n=int(input())\r\nstroka=input()\r\nSF=0\r\nFS=0\r\nplusiki=0\r\nwhile plusiki<n-1:\r\n if stroka[plusiki]=='S' and stroka[plusiki+1]=='F':\r\n SF=SF+1\r\n if stroka[plusiki]=='F' and stroka[plusiki+1]=='S':\r\n FS=FS+1\r\n plusiki=plusiki+1\r\nif SF>FS:\r\n print('YES')\r\nelse:\r\n print('NO')", "k = int(input())\r\na = input()\r\nsf = a.count('SF')\r\nfs = a.count('FS')\r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n n=I()\n s=S()\n\n stof=0\n ftos=0\n\n for i in range(n-1):\n if s[i]!=s[i+1]:\n if s[i]=='S':\n stof+=1\n else:\n ftos+=1\n\n if stof>ftos:\n return 'YES'\n return 'NO'\n\nprint(main())\n", "def fl(s):\r\n sfCount = 0\r\n fsCount = 0\r\n for i in range(0, len(s)-1):\r\n if s[i] + s[i+1] == \"SF\":\r\n sfCount += 1\r\n elif s[i] + s[i+1] == \"FS\":\r\n fsCount += 1\r\n if sfCount > fsCount:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\ninput()\r\ns = input()\r\nfl(s)", "n = int (input())\r\na=input()\r\nif a[0]+a[-1]==\"SF\":\r\n exit(print(\"YES\"))\r\nprint(\"NO\")\r\n", "n = int(input())\r\ndays = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(n-1):\r\n if days[i] == 'S' and days[i+1] == 'F':\r\n sf +=1\r\n continue\r\n elif days[i] == 'F' and days[i+1] == 'S':\r\n fs += 1\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\ns=stdin.readline()\r\nif(s[0]==\"S\" and s[n-1]==\"F\"):\r\n stdout.write(\"YES\")\r\nelse:\r\n stdout.write(\"NO\")", "c = int(input())\r\ns = input()\r\n\r\nif s[0] == \"S\" and s[c-1] == \"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nstring = input()\nflights = [char for char in string]\nSE_TO_SF = 0\nSF_TO_SE = 0\nfor i in range(len(flights)-1):\n if flights[i] == 'S' and flights[i+1] == 'F':\n SE_TO_SF+=1\n elif flights[i] == 'F' and flights[i+1] == 'S':\n SF_TO_SE+=1\n else:\n pass\nif SE_TO_SF > SF_TO_SE:\n print('YES')\nelse:\n print('NO')", "n=int(input())\r\nSorF=input()\r\nSorF=SorF.upper()\r\ncntofF=0\r\ncntofS=0\r\nfor i in range(len(SorF)-1):\r\n if SorF[i]!=SorF[i+1]:\r\n if SorF[i]=='S':\r\n cntofF+=1\r\n else: \r\n cntofS+=1\r\nif cntofF<=cntofS:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "input()\ns = input()\nprint([\"NO\", \"YES\"][s.count(\"SF\") > s.count(\"FS\")])\n", "n = int(input())\ns = input()\nsf = s.count('SF')\nfs = s.count(\"FS\")\nif sf > fs:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\r\nl = input()\r\nk = list(l)\r\nc = 0\r\nd = 0\r\nfor i in range(n-1):\r\n if k[i] == 'S' and k[i+1] == 'F':\r\n c += 1\r\n \r\n if k[i] == 'F' and k[i+1] == 'S':\r\n d += 1\r\n \r\n \r\n \r\nif c > d:\r\n print('YES')\r\n \r\nelse :\r\n print('NO')", "n=int(input())\r\nstroka=input()\r\nif stroka[0]=='S' and stroka[n-1]=='F':\r\n print('YES')\r\nelse:\r\n print('NO')", "if __name__ == '__main__':\r\n input()\r\n flights = input()\r\n print('YES' if flights.count('SF') > flights.count('FS') else 'NO')", "n=int(input())\r\nd=input()\r\nf=d.count(\"SF\")\r\ns=d.count(\"FS\")\r\nif(f>s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nabc = input()\r\nf = 0\r\ns = 0\r\nfor i in range(len(abc)-1):\r\n if abc[i] == \"S\" and abc[i+1] == 'F':\r\n s += 1\r\n elif abc[i] == \"F\" and abc[i+1] == 'S':\r\n f += 1\r\nif s > f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\ns=input()\r\nsanfrancisco=0\r\nseattle=0\r\nfor i in range(0,len(s)-1):\r\n if(s[i]==\"S\" and s[i+1]==\"F\"):\r\n sanfrancisco+=1\r\n elif(s[i]==\"F\" and s[i+1]==\"S\"):\r\n seattle+=1\r\nif(sanfrancisco>seattle):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu May 30 09:08:28 2019\r\n\r\n@author: avina\r\n\"\"\"\r\nn = int(input())\r\ns = input()\r\n\r\n\r\ne=0;e1=0\r\nfor i in range(n-1):\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n e+=1\r\n elif s[i] == 'F' and s[i+1] == 'S':\r\n e1+=1\r\nif e > e1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/python3\r\n\r\nn = int(input())\r\nstring = input()\r\ns = string.count(\"SF\")\r\nf = string.count(\"FS\")\r\nr = \"YES\" if s > f else \"NO\" \r\nprint(r)\r\n'''\r\nhttps://codeforces.com/problemset/problem/867/A\r\n'''\r\n", "n = int(input())\r\ns = input()\r\na = 'SF'\r\nb = 'FS'\r\nc1 = c2 = 0\r\nfor i in range(n-1):\r\n if s[i]+s[i+1] == a:\r\n c1+=1\r\n elif s[i]+s[i+1] == b:\r\n c2+=1\r\nif c1 > c2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "N = int(input())\n\nSAN_FRANCISCO = \"F\"\nSIETTLE = \"S\"\n\ntowns = input()\n\ns_to_f = 0\nf_to_s = 0\n\nfor i in range(1, len(towns)):\n if towns[i - 1] == SIETTLE and towns[i] == SAN_FRANCISCO:\n s_to_f += 1\n elif towns[i - 1] == SAN_FRANCISCO and towns[i] == SIETTLE:\n f_to_s += 1\n\nprint(\"YES\" if s_to_f > f_to_s else \"NO\")\n", "n=int(input())\r\na=input()\r\nsfs=0;\r\nssf=0;i=0;\r\nwhile(i<n-1):\r\n if(a[i]=='F' and a[i+1]=='S'):\r\n sfs+=1;\r\n elif(a[i]=='S' and a[i+1]=='F'):\r\n ssf+=1;\r\n i+=1;\r\nif(ssf>sfs):\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\")", "days = int(input())\r\nrecord = input()\r\nsf=0\r\nfs=0\r\nfor i in range(days-1):\r\n if record[i]=='S' and record[i+1]=='F':\r\n sf += 1\r\n if record[i]=='F' and record[i+1]=='S':\r\n fs += 1\r\nif sf > fs:\r\n print('YES')\r\nelse:\r\n print('No')", "##n, b, d = [int(t) for t in input().split()]\n##clean = 0\n##t = 0\n##a = [int(t) for t in input().split()]\n##if n > 1:\n## for i in a:\n## if i <= b:\n## t = t + i\n## if t > d:\n## clean = clean + 1\n## t = 0\n##print(clean)\n \nn = int(input())\ncity = input()\nfs = 0\nsf = 0\nfor i in range(n-1):\n if city[i] == 'S' and city[i+1] == 'F':\n sf = sf + 1\n elif city[i]=='F' and city[i+1]==\"S\":\n fs = fs + 1\nif sf > fs:\n print('YES')\nelse:\n print('NO')\n", "n = int(input())\r\ns = input();\r\ncnt1 = 0\r\ncnt2 = 0\r\ns1 = \"\"\r\nfor i in range(1, n):\r\n if s[i-1] == \"S\" and s[i] == \"F\":\r\n cnt1 += 1\r\n elif s[i-1] == \"F\" and s[i] == \"S\":\r\n cnt2 += 1\r\nif cnt1 > cnt2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\nx=0\r\ny=0\r\nprev=s[0]\r\n\r\nfor curr in s[1:] :\r\n if prev=='S' and curr=='F':\r\n x=x+1\r\n elif prev=='F' and curr=='S':\r\n y=y+1\r\n prev=curr\r\n\r\nif x>y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(len(a)-1):\r\n if a[i] == 'S' and a[i+1] == 'F':\r\n sf += 1\r\n elif a[i] == 'F' and a[i+1] == 'S':\r\n fs += 1\r\nif sf > fs:\r\n print('YES')\r\nelif sf <= fs:\r\n print('NO')", "if __name__ == \"__main__\":\r\n \r\n days = int(input())\r\n travels = list(input())\r\n \r\n count_s_f = 0\r\n count_f_s = 0\r\n i=0\r\n\r\n while i != len(travels)-1:\r\n if travels[i] == 'S' and travels[i+1] == 'F':\r\n count_s_f+=1\r\n elif travels[i] == 'F' and travels[i+1] == 'S':\r\n count_f_s+=1\r\n else:\r\n pass\r\n i+=1\r\n\r\n if count_s_f > count_f_s:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n \r\n", "n = int(input())\nway = input()\nfromFtoS = 0\nfromStoF = 0\nfor i in range(1, n):\n if way[i] == 'S' and way[i-1] == 'F':\n fromFtoS += 1\n elif way[i] == 'F' and way[i-1] == 'S':\n fromStoF += 1\nif fromStoF > fromFtoS:\n print('YES')\nelse:\n print('NO')\n", "n = input()\r\nword = input()\r\nSF = 0\r\nFS = 0\r\nfor i in range (0, int(n)-1) :\r\n if word[i] + word[i+1] == \"SF\" :\r\n SF += 1\r\n elif word[i] + word[i+1] == \"FS\" :\r\n FS += 1\r\n\r\n\r\nif SF > FS :\r\n print(\"yes\")\r\nelse :\r\n print(\"no\")\r\n", "n = int(input())\r\nstrok = input()\r\n\r\nif strok.count('SF')>strok.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\nn=int(input())\r\ns=input()\r\nif(s[0]=='S'and s[len(s)-1]=='F'):\r\n print(\"YES\\n\")\r\n exit()\r\nprint(\"NO\\n\")\r\n", "from string import*\r\na,s=int(input()),input()\r\nprint(\"YES\" if s.count(\"SF\")>s.count(\"FS\") else \"NO\")", "n=int(input())\r\nf=input()\r\ncurr=f[0]\r\nfs=0\r\nsf=0\r\nfor i in range(1,n):\r\n if curr==\"F\":\r\n if f[i]!=curr:\r\n fs+=1\r\n curr=f[i]\r\n if curr==\"S\":\r\n if f[i]!=curr:\r\n sf+=1\r\n curr=f[i]\r\nprint(\"YES\") if sf>fs else print(\"NO\")\r\n", "days = int(input())\r\nstring = input()\r\nlast = \"\"\r\nsf, fs = 0, 0\r\n\r\nfor x in string:\r\n if last == \"S\" and x == \"F\":\r\n sf += 1\r\n elif last == \"F\" and x == \"S\":\r\n fs += 1\r\n last = x\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nst = input()\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n v = st[i : i + 2]\r\n if v == \"SF\":\r\n cnt += 1\r\n elif v == \"FS\":\r\n cnt -= 1\r\n\r\nprint([\"NO\", \"YES\"][cnt > 0])\r\n", "list = []\r\ni = 0\r\nseattle = 0\r\nfrancisco = 0\r\nn = int(input())\r\ns = input()\r\nfor char in s:\r\n list.append(char)\r\nwhile i < len(s) - 1 :\r\n if list[i] == \"S\" and list[i+1] == \"F\":\r\n seattle += 1\r\n elif list[i] == \"F\" and list[i+1] == \"S\":\r\n francisco += 1\r\n i += 1\r\n\r\nif seattle > francisco:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=input()\r\nb=0\r\nc=0\r\nfor i in range (n-1) :\r\n if l[i] != l[i+1] :\r\n if l[i] == \"S\" :\r\n b+=1\r\n else :\r\n c+=1\r\nif b>c :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "ip_no_days=int(input())\r\ndata_diff_days=input()\r\n\r\ncountSF=0\r\ncountFS=0\r\n\r\nfor i in range(1,len(data_diff_days)):\r\n if data_diff_days[i-1]=='S' and data_diff_days[i]=='F':\r\n countSF+=1\r\n elif data_diff_days[i-1]=='F' and data_diff_days[i]=='S':\r\n countFS+=1\r\n else:\r\n continue\r\n\r\nif countSF>countFS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# memSql has american offices in both sf and seattle. \r\n# more times from seattle to sf during the last n days? \r\nn = int(input())\r\nflights = input() \r\ns_f = 0 \r\nf_s = 0 \r\nfor i in range(1, n):\r\n if flights[i-1] == 'S' and flights[i] == 'F':\r\n s_f += 1\r\n elif flights[i-1] == 'F' and flights[i] == 'S':\r\n f_s += 1\r\nprint(\"YES\") if s_f > f_s else print(\"NO\")", "a=input()\nb=input()\nsf=b.count('SF')\nfs=b.count('FS')\nif sf>fs:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "n = int(input())\r\ns = list(str(input()))\r\nfToS = 0\r\nsToF = 0\r\nfor i in range(n-1):\r\n if s[i] == \"F\" and s[i+1] == \"S\":\r\n fToS+=1\r\n elif s[i] == \"S\" and s[i+1] == \"F\":\r\n sToF+=1\r\nif sToF > fToS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=input()\r\ns=0\r\nc=0\r\nb=list(a)\r\nfor i in range(n-1):\r\n\tif(b[i]!=b[i+1]) and (b[i]=='S'):\r\n\t\ts+=1\r\n\telif(b[i]!=b[i+1]) and (b[i]=='F'):\r\n\t\tc+=1\r\nif s>c:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "n = int(input())\r\nmovements = input()\r\nfs = 0\r\nsf = 0\r\nfor i in range(len(movements)-1):\r\n if movements[i: i + 2] == 'FS':\r\n fs += 1\r\n elif movements[i: i + 2] == 'SF':\r\n sf += 1\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\ncount=0\r\ncount1=0\r\nfor i in range(0,n-1):\r\n\tif (s[i+1]=='S') and (s[i]=='F'):\r\n\t\tcount+=1\r\n\tif (s[i+1]== 'F') and (s[i]=='S'):\r\n\t\tcount1+=1\r\nif count1>count:\r\n\tprint('yes')\r\nelse:\r\n\tprint('no')", "n=int(input())\r\nK=input()\r\ns=K.count(\"SF\")\r\nf=K.count(\"FS\")\r\nif s>f:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "num = int(input())\r\nlst = list(input())\r\nans = ''\r\nfor i in range(num):\r\n if i+1 == num:\r\n break\r\n if lst[i] != lst[i+1]:\r\n ans += lst[i]\r\nif ans.count(\"S\") > ans.count(\"F\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Hamza nachid Template\r\nimport sys\r\nfrom math import ceil\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef read_int():\r\n return int(input().strip())\r\n\r\n\r\ndef read_int_list():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef read_int_set():\r\n return set(map(int, input().split()))\r\n\r\n\r\ndef read_string():\r\n return input().strip()\r\nn = read_int()\r\ns=read_string()\r\nans=0\r\nfor i in range(len(s)-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n ans+=1\r\n elif s[i]=='F' and s[i+1]=='S':\r\n ans-=1\r\nif ans>0:\r\n print('yes')\r\nelse:\r\n print('no')", "n = int(input())\r\ns = input()\r\nsf = 0\r\nfs = 0\r\nflag = 0\r\nfor i in range(0, n):\r\n for j in range(i+1, n):\r\n if s[i] == \"S\" and s[j] == \"F\":\r\n sf += 1\r\n flag = 1\r\n break\r\n elif s[i] == \"F\" and s[j] == \"S\":\r\n fs += 1\r\n flag = 1\r\n break\r\n else:\r\n flag = 1\r\n break\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t = int(input())\r\na = input()\r\nprint(\"YES\" if a.count(\"SF\") > a.count(\"FS\") else \"NO\")", "x = input()\r\nz = input()\r\ns_f = z.count('SF')\r\nf_z = z.count('FS')\r\nif s_f > f_z:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nstr = input()\r\ndom = str.count(\"SF\")\r\nsub = str.count(\"FS\")\r\nif dom > sub:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nstring=input()\r\nif(string[0]==\"S\" and string[-1]==\"F\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\ndef solve():\r\n\tn = int(input())\r\n\tstri = input()\r\n\tSF = 0\r\n\tFS = 0\r\n\tfor i in range(len(stri)):\t\r\n\t\tif stri[i:i+2] == \"FS\":\r\n\t\t\tFS+=1\r\n\t\telif stri[i:i+2] == \"SF\":\r\n\t\t\tSF+=1\r\n\tif SF>FS:\r\n\t\treturn \"YES\"\r\n\telse:\r\n\t\treturn \"NO\"\r\n\t\r\nans=solve()\r\nprint(ans)", "n = int(input())\nstr = input()\nf_cnt, s_cnt = 0, 0\nfor i in range(n - 1):\n if str[i] == 'F' and str[i + 1] == 'S':\n f_cnt += 1\n elif str[i] == 'S' and str[i + 1] == 'F':\n s_cnt += 1\nif s_cnt > f_cnt:\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", "n = int(input())\r\nm = input()\r\ns = m.count('SF')\r\nf = m.count('FS')\r\n\r\nif s > f: print('YES')\r\nelse: print('NO')\r\n\r\n\r\n", "import sys\r\nimport re\r\nfrom collections import Counter\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n c = Counter(re.sub(r'(.)\\1+', r'\\1', inp[1])[1:])\r\n return ('NO', 'YES')[c['F'] > c['S']]\r\n\r\nprint(main())\r\n", "n=int(input())\r\ns=input()\r\nval_S,val_F=0,0\r\nfor i in range(len(s)-1):\r\n if s[i]==\"S\" and s[i+1]==\"F\":\r\n val_S+=1\r\n if s[i]==\"F\" and s[i+1]==\"S\":\r\n val_F+=1\r\nif val_S>val_F:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t=int(input())\r\ns=input()\r\ns1=list(s)\r\nsf=0\r\nfs=0\r\nfor i in range(t-1):\r\n if s1[i]=='S' and s1[i+1]=='F':\r\n sf+=1\r\n if s1[i]=='F' and s1[i+1]=='S':\r\n fs+=1\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\nfin = sys.stdin\nfout = sys.stdout\n\nlines = (line.strip() for line in fin)\n\nn = int(next(lines))\ntrips = next(lines)\n\ntotal = 0\nfor i in range(n - 1):\n trip = trips[i:i+2]\n if trip == 'SF':\n total += 1\n elif trip == 'FS':\n total -= 1\n\nprint(\"YES\" if total > 0 else \"NO\", file=fout)\n", "n=int(input())\r\nstring=input()\r\nsf=0\r\nfs=0\r\nfor i in range(1,n):\r\n if string[i]=='F' and string[i-1]=='S':\r\n sf+=1\r\n elif string[i]=='S' and string[i-1]=='F':\r\n fs+=1\r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')", "input()\r\nS = list(input())\r\nFS = 0\r\nSF = 0\r\nSW = S[0]\r\nfor i in S:\r\n\tif i != SW:\r\n\t\tif SW == 'F':\r\n\t\t\tFS += 1\r\n\t\telse:\r\n\t\t\tSF += 1\r\n\t\tSW = i\r\nif SF>FS:\r\n\tprint('yes')\r\nelse:\r\n\tprint('no')\r\n", "n = int(input())\r\ns = input()\r\n\r\ntoF = 0\r\ntoS = 0\r\nfor i in range(1, len(s)):\r\n if s[i] != s[i-1]:\r\n if s[i] == 'S':\r\n toS += 1\r\n else:\r\n toF += 1\r\n\r\nif toF > toS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=int(input())\r\ns=input()\r\nif(s.count(\"FS\")<s.count(\"SF\")):print(\"YES\")\r\nelse:print(\"NO\")", "no = input()\r\nnos = input()\r\nnos = list(nos)\r\nno1 = 0\r\nno2 = 0\r\nfor i in range(int(no)-1):\r\n if nos[i] == \"S\" and nos[i+1] == \"F\":\r\n no1 += 1\r\n elif nos[i] == \"F\" and nos[i+1] == \"S\":\r\n no2 += 1\r\nif no1 > no2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "n = int(input())\r\ns = input()\r\n\r\nsf = st = 0\r\nfor i in range(0, n - 1):\r\n if s[i] == 'F' and s[i + 1] == 'S':\r\n st += 1\r\n if s[i] == 'S' and s[i + 1] == 'F':\r\n sf += 1\r\n\r\nprint(\"YES\" if sf > st else \"NO\")", "a=int(input())\nb=input()\nprint(\"YES\" if b[0]==\"S\" and b[-1]==\"F\" else \"NO\")", "def main():\r\n n = int(input())\r\n s = input()\r\n count1 = 0\r\n for i in range(n - 1):\r\n if s[i] == \"S\" and s[i + 1] == \"F\" :\r\n count1 += 1\r\n elif s[i] == \"F\" and s[i + 1] == \"S\" :\r\n count1 -= 1\r\n if count1 >0 :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == \"__main__\" :\r\n main()", "N = int(input())\r\ns = input()\r\ncnt = 0\r\nfor i in range(N-1):\r\n if s[i:i+2]=='FS': cnt-=1\r\n elif s[i:i+2]=='SF': cnt+=1\r\nif cnt>0: print('YES')\r\nelse: print('NO')\r\n", "k=int(input())\r\nline=input()\r\nif line.count(\"SF\")>line.count(\"FS\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nl=input()\r\nk=l.count('SF')\r\nt = l.count('FS')\r\nif(k>t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nstring = input()\r\nSF = 0\r\nFS = 0\r\nfor i in range(n-1):\r\n if string[i] != string [i+1]:\r\n if string[i] == 'S' and string[i+1] == 'F':\r\n SF += 1\r\n else:\r\n FS += 1\r\nif SF > FS:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n", "n=eval(input())\r\nt=input()\r\ni=0\r\nc=0\r\nw=0\r\nwhile(i<n-1):\r\n if(t[i]==\"F\" and t[i+1]==\"S\"):\r\n c+=1\r\n if(t[i]==\"S\" and t[i+1]==\"F\"):\r\n w+=1\r\n i+=1\r\nif(c>=w):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n=int(input())\r\nl = list(input())\r\ny=0\r\nn=0\r\nfor i in range(0,len(l)-1):\r\n if l[i] == 'S' and l[i+1] == 'F':\r\n y +=1\r\n elif l[i] == 'F' and l[i+1] == 'S':\r\n n+=1\r\nif y == 0 and n == 0:\r\n print('NO')\r\nelif y >n:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\np=input()\r\ni=0\r\nx=0\r\ny=0\r\nif(n>=2 or n<=100):\r\n if(len(p)==n):\r\n for i in range(1,n):\r\n x=x+(p[i-1]=='S' and p[i]=='F')\r\n y=y+(p[i-1]=='F' and p[i]=='S')\r\n if(x>y):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\n#\r\n#\r\n#\r\n\r\nlol = input()\r\ns = input()\r\n\r\nprint(\"YES\" if (s[0] == \"S\" and s[-1] == \"F\") else \"NO\")", "_ = int(input())\r\n\r\nflights = input() \r\n\r\nflew_more_times_to_sf = False\r\n\r\nif \"S\" not in flights:\r\n pass\r\nelse:\r\n seattle_to_sf_flights = flights.count(\"SF\")\r\n sf_to_seattle_flights = flights.count(\"FS\")\r\n\r\n if seattle_to_sf_flights > sf_to_seattle_flights:\r\n flew_more_times_to_sf = True\r\n\r\nif flew_more_times_to_sf:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\ntemp = 0\r\nF=0\r\nS=0\r\nz=0\r\nif(s[0]=='F'):\r\n z=0\r\nelse:\r\n z=1\r\nfor i in range (n): \r\n \r\n if(s[i]=='F'and z==0):\r\n F+=1\r\n z=1\r\n elif(z and s[i]=='S'):\r\n S+=1\r\n z=0\r\n \r\n\r\nif(s[n-1]=='F'):\r\n F-=1\r\nelse:\r\n S-=1\r\n\r\nif(F<S):print('YES')\r\nelse : print('NO')\r\n", "a = input()\r\nplane = str(input())\r\nif plane.count('SF') > plane.count('FS'):\r\n print('YES')\r\nelse :\r\n print('NO')", "n=int(input())\r\ns=input()\r\nt1=0\r\nt2=0\r\nfor i in range(1,n) :\r\n\tif s[i]=='F' and s[i-1]=='S':\r\n\t\tt1+=1\r\n\tif s[i]=='S' and s[i-1]=='F' :\r\n\t\tt2+=1\r\nif t1>t2:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "num_of_days = input()\r\npattern = input()\r\n\r\ncounter = 0\r\nfalse_counter = 0\r\n\r\nif 'S' not in pattern:\r\n print(\"NO\")\r\nelse:\r\n for char in range(len(pattern) - 1):\r\n if pattern[char] + pattern[char + 1] == 'SF':\r\n counter += 1\r\n elif pattern[char] + pattern[char + 1] == 'FS':\r\n false_counter += 1\r\n\r\n if counter > false_counter:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a=int( input())\r\nb=str(input())\r\nk=0\r\nfor i in range(a-1):\r\n x=b[i:i+1]\r\n y=b[i+1:i+2]\r\n if x=='S' and y=='F':\r\n k+=1\r\n elif x=='F' and y=='S':\r\n k-=1\r\nif k>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "days = int(input())\r\nflights = input()\r\ncounter_yes = 0\r\ncounter_no = 0\r\nfor i in range(days - 1):\r\n if flights[i] == \"F\" and flights[i + 1] == \"S\":\r\n counter_no += 1\r\n elif flights[i] == \"S\" and flights[i + 1] == \"F\":\r\n counter_yes += 1\r\nif counter_yes > counter_no:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ndays = input()\r\nstart = days[0]\r\nsf = 0\r\nfs = 0\r\nfor i in range(1,n):\r\n if start != days[i]:\r\n if start == 'S':\r\n sf += 1\r\n else:\r\n fs += 1\r\n start = days[i]\r\nprint('YES' if sf > fs else 'NO')\r\n", "n=int(input())\r\ns=str(input())\r\nyes=0\r\nno=0\r\nfor i in range(n-1):\r\n if(s[i]=='S' and s[i+1]=='F'):\r\n yes+=1\r\n if(s[i]=='F' and s[i+1]=='S'): \r\n no+=1\r\nif(yes>no):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "n=int(input())\r\na=input()\r\nl=0\r\nk=0\r\na1=a[0]\r\n\r\nfor i in range(n):\r\n if a1==\"S\" and a[i]==\"F\":\r\n l+=1\r\n a1=a[i]\r\n elif a1==\"F\" and a[i]==\"S\":\r\n k+=1\r\n a1=a[i]\r\nif l>k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n", "a = int(input())\r\nw = input()\r\nt = 0\r\n\r\nfor i in range(a-1):\r\n if w[i]=='S' and w[i+1]=='F':\r\n t+=1\r\n elif w[i]=='F' and w[i+1]=='S':\r\n t-=1\r\nif t==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nk=0;\r\na=input()\r\nfor i in range(n-1):\r\n if(a[i]=='S' and a[i+1]=='F'):\r\n k=k+1\r\n if(a[i]=='F' and a[i+1]=='S'):\r\n k=k-1\r\nif(k>0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "st = input()\r\nst = input()\r\nprint('YES' if st.count('SF') > st.count('FS') else 'NO')", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output.out\",'w')\r\nn=int(input())\r\nx=input()\r\ns,f=0,0\r\na=list(x)\r\nfor i in range(n-1):\r\n\tif (a[i] != a[i+1]) and (a[i]==\"S\"):\r\n\t\ts+=1\t\t\r\n\telif (a[i] != a[i+1]) and (a[i]=='F'):\r\n\t\tf+=1\t\r\nif s>f:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\t\t\t\r\n\r\n\r\n\r\n", "def flight(s):\r\n letter = ''\r\n countF = 0\r\n countS = 0\r\n locations = [i for i in s]\r\n\r\n for i in range(len(locations)):\r\n if i == 0:\r\n letter = locations[i]\r\n elif locations[i] == 'F' and letter != locations[i]:\r\n countS += 1\r\n letter = locations[i]\r\n elif locations[i] == 'S' and letter != locations[i]:\r\n countF += 1\r\n letter = locations[i]\r\n\r\n if countS > countF:\r\n return 'YES'\r\n return 'NO'\r\n\r\nif __name__ == \"__main__\":\r\n n = input().strip()\r\n s = list(map(str, input().strip()))\r\n print(flight(s))\r\n ", "n=int(input())\r\ns=str(input())\r\nl=[]\r\nl[:0]=s\r\nx=0\r\ny=0\r\nfor i in range(n-1):\r\n if l[i]=='S' and l[i+1]=='F':\r\n x=x+1\r\n elif l[i]=='F' and l[i+1]=='S':\r\n y=y+1\r\nif(x>y):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "n=int(input())\r\ns=input()\r\nsf=0\r\nfs=0\r\nflag=0\r\nfor i in range(0,n):\r\n for j in range(i+1,n):\r\n if s[i]==\"S\" and s[j]==\"F\":\r\n sf+=1\r\n flag=1\r\n break\r\n elif s[i]==\"F\" and s[j]==\"S\":\r\n fs+=1\r\n flag=1\r\n break\r\n else:\r\n flag=1\r\n break\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "q=input()\r\nw=input()\r\nif w.count('SF')>w.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nif b.count('SF') > b.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\ns = str(input())\r\nprint(\"YES\" if s.count(\"SF\") > s.count(\"FS\") else \"NO\")", "import math\r\nimport sys\r\nsys.setrecursionlimit(1500)\r\n\r\ndef list_str(l, char):\r\n output_str = \"\"\r\n for i in range(len(l) - 1):\r\n output_str += str(l[i]) + char\r\n output_str += str(l[len(l) - 1])\r\n return output_str\r\n\r\n\r\ndef str_list(s, char):\r\n output_list = []\r\n intermediate = \"\"\r\n for i in range(len(s)):\r\n if s[i] != char:\r\n intermediate += s[i]\r\n if i == len(s) - 1:\r\n output_list.append(int(intermediate))\r\n else:\r\n if intermediate:\r\n output_list.append(int(intermediate))\r\n intermediate = \"\"\r\n return output_list\r\n\r\n\r\ndef merge_sort(l):\r\n def merge(l1, l2):\r\n i, j = 0, 0\r\n output_list = []\r\n while i < len(l1) and j < len(l2):\r\n if l1[i] > l2[j]:\r\n output_list.append(l1[i])\r\n i += 1\r\n else:\r\n output_list.append(l2[j])\r\n j += 1\r\n if i == len(l1):\r\n output_list += l2[j:]\r\n elif j == len(l2):\r\n output_list += l1[i:]\r\n return output_list\r\n\r\n def sort(l):\r\n if len(l) < 2:\r\n return l\r\n else:\r\n mid = len(l) // 2\r\n left = sort(l[:mid])\r\n right = sort(l[mid:])\r\n return merge(left, right)\r\n return sort(l)\r\n\r\n\r\ndef be_reversed(l):\r\n def recursion_part(l, start, end):\r\n if start >= end:\r\n return l\r\n else:\r\n l[start], l[end] = l[end], l[start]\r\n return recursion_part(l, start + 1, end - 1)\r\n return recursion_part(l, 0, len(l) - 1)\r\n\r\n\r\ndef quicksort(l):\r\n def partition(l, start, end):\r\n i = start\r\n ind_pivot = end\r\n for j in range(start, end):\r\n if l[j] >= l[ind_pivot]:\r\n l[j], l[i] = l[i], l[j]\r\n i += 1\r\n l[ind_pivot], l[i] = l[i], l[ind_pivot]\r\n return i\r\n\r\n\r\n def quick_sort(l, start, end):\r\n if len(l) < 2:\r\n return l\r\n elif start < end:\r\n p = partition(l, start, end)\r\n quick_sort(l, start, p - 1)\r\n quick_sort(l, p + 1, end)\r\n quick_sort(l, 0, len(l) - 1)\r\n return l\r\n\r\n# k = [ 2,4,3,2,1,2,3,4,5,6,5,4,3,2]\r\n# quicksort(k)\r\n# print(k)\r\n\r\n\r\ndef collector_recursive(l):\r\n output_list = []\r\n def colec(l, start, end, cl):\r\n if start > end:\r\n return cl\r\n else:\r\n cl.append(f\"{l[start][1]} {l[end][1]}\")\r\n return colec(l, start + 1, end - 1, cl)\r\n return colec(l, 0, len(l) - 1, output_list)\r\n\r\n\r\ndef find_min(l):\r\n mini = l[0]\r\n ind = 0\r\n for i in range(len(l)):\r\n if mini > l[i]:\r\n mini = l[i]\r\n ind = i\r\n return ind\r\n\r\n\r\ndef are_pairs(s_1, s_2):\r\n if (s_1 == \"(\" and s_2 == \")\") or (s_1 == \"[\" and s_2 == \"]\"):\r\n return True\r\n return False\r\n\r\n\r\ndef counter(s, x, y):\r\n count = 0\r\n f = 0\r\n for c in s:\r\n if c == x:\r\n f += 1\r\n elif c == y:\r\n if f:\r\n count += 1\r\n f -= 1\r\n return count\r\n\r\n\r\ndef main_function():\r\n output_list = []\r\n test_cases = range(int(input()))\r\n #for test_case in test_cases:\r\n s = input()\r\n interm = s[0]\r\n count_sf = 0\r\n count_fs = 0\r\n for c in s[1:]:\r\n if interm == \"S\" and c != interm:\r\n count_sf += 1\r\n elif interm == \"F\" and c != interm:\r\n count_fs += 1\r\n interm = c\r\n if count_sf > count_fs:\r\n return \"YES\"\r\n return \"NO\"\r\n return list_str(output_list, \"\\n\")\r\n\r\n\r\nprint(main_function())\r\n", "n = int(input())\r\nx = input()\r\nsanf = 0\r\nseat = 0\r\nfor i in range(1,n):\r\n prev = x[i-1]\r\n now = x[i]\r\n if (prev=='F') & (now=='S'):\r\n seat+=1\r\n if (prev=='S') & (now=='F'):\r\n sanf+=1\r\nprint('YES' if sanf>seat else 'NO')", "a=int(input())\r\nb=input()\r\nk=0\r\nn=0\r\nb=b.replace('S','1')\r\nb=b.replace('F','0')\r\nfor i in range(a-1):\r\n if int(b[i])!=int(b[i+1]):\r\n if int(b[i])>int(b[i+1]):\r\n k+=1\r\n else:\r\n n+=1\r\nif k>n:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\nstof,ftos = 0,0\r\nfor i in range(1,n):\r\n if s[i]=='F' and s[i-1]=='S':\r\n stof+=1\r\n elif s[i]=='S' and s[i-1]=='F':\r\n ftos+=1\r\nif stof>ftos:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nb = input()\r\na1 = b.count(\"SF\")\r\na2 = b.count(\"FS\")\r\nif a1 > a2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\nk=[]\r\ni=n-1\r\nsf=fs=0\r\nwhile i>0:\r\n if s[i]!=s[i-1]:\r\n k.append(s[i-1]+s[i])\r\n i-=1\r\n else:\r\n i-=1\r\nfor i in k:\r\n if i=='SF':\r\n sf+=1\r\n else:\r\n fs+=1\r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nn = int(input())\r\ns = input()\r\nres1=0\r\nres2=0\r\n\r\nfor i in range(len(s)-1): \r\n if(s[i]=='F' and s[i+1]=='S'):\r\n res1+=1;\r\n elif(s[i]=='S' and s[i+1]=='F'):\r\n res2+=1;\r\n \r\nif(res2>res1):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "#2020\r\n\r\nn=int(input())\r\ns=input()\r\nsf=0\r\nnf=0\r\nfor i in range(0,n-1):\r\n if(s[i]=='S' and s[i+1]=='F'):\r\n sf=sf+1\r\n elif(s[i]=='F' and s[i+1]=='S'):\r\n nf=nf+1\r\nif(sf>nf):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = list(input())\r\nfran = 0\r\nsea = 0\r\nfor i in range(n-1):\r\n if s[i]== 'F' and s[i+1] == 'S':\r\n fran +=1\r\n elif s[i]== 'S' and s[i+1] == 'F':\r\n sea +=1\r\n\r\n\r\nif sea > fran :\r\n print(\"Yes\")\r\n\r\nelse:\r\n print(\"No\")\r\n", "n=input()\r\ncidades=input()\r\nFtoS=0\r\nStoF=0\r\nfor index in range(int(n)-1):\r\n letra=cidades[int(index)+1]\r\n if cidades[int(index)]!=letra:\r\n if letra==\"F\":\r\n StoF+=1\r\n else:\r\n FtoS+=1\r\nif StoF > FtoS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a = int(input())\r\nb = input()\r\n\r\nsf = 0\r\nfs = 0\r\ni = 1\r\nfor i in range(1, a):\r\n if b[i - 1] != b[i]:\r\n if b[i - 1] == \"S\":\r\n sf += 1\r\n else:\r\n fs += 1\r\n\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\t\r\n", "# LUOGU_RID: 101679030\n# S-F > F-S\n_, s = input(), input()\nx = sum(s[i:i+2] == 'SF' for i in range(len(s) - 1))\ny = sum(s[i:i+2] == 'FS' for i in range(len(s) - 1))\nprint(x > y and 'YES' or 'NO')", "n = int(input())\r\nstring = input()\r\ncounter_s = 0\r\ncounter_f = 0\r\nfor i in range(1, len(string)):\r\n if string[i] == \"S\" and string[i - 1] == \"F\":\r\n counter_f += 1\r\n elif string[i] == \"F\" and string[i - 1] == \"S\":\r\n counter_s += 1\r\nprint(\"YES\" if counter_s > counter_f else \"NO\")", "#Codeforce 867A\r\nlength=int(input())\r\nstring1=input()\r\nif string1[0]==\"F\":\r\n print(\"No\")\r\nelif string1[0]==\"S\" and string1[length-1]==\"S\":\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n = int(input(\"\"))\r\nstr = input(\"\")\r\nif str[0] == 'S' and str[-1] == 'F':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nn = int(input())\r\ns = input()\r\n\r\nFran = 0\r\nSeattle = 0\r\n\r\nfor i in range(len(s)-1):\r\n if s[i] == 'F':\r\n if s[i+1] == 'S':\r\n Fran += 1\r\n elif s[i] == \"S\":\r\n if s[i+1] == \"F\":\r\n Seattle += 1\r\n\r\n\r\nprint(\"Yes\" if Seattle > Fran else \"No\")", "import sys\n\nn = int(sys.stdin.readline())\nlocations = sys.stdin.readline()\n\nseattle_to_sf = 0\nsf_to_seattle = 0\n\nfor i in range(n - 1):\n if locations[i] == 'S' and locations[i + 1] == 'F':\n seattle_to_sf += 1\n elif locations[i] == 'F' and locations[i + 1] == 'S':\n sf_to_seattle += 1\n\nif seattle_to_sf > sf_to_seattle:\n print(\"yes\")\nelse:\n print(\"no\")\n", "n = int(input())\r\ninpt = input()\r\n\r\nsf = 0\r\nfs = 0\r\n\r\nfor i in range(n-1):\r\n if inpt[i] == \"S\" and inpt[i+1] == \"F\":\r\n sf += 1\r\n if inpt[i] == \"F\" and inpt [i+1] == \"S\":\r\n fs += 1\r\n# print (sf)\r\n# print (fs)\r\n\r\nif sf > fs:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "n = int(input())\ncount_S = 0\ncount_F = 0\ncity = input()\nfor i in range(len(city)-1):\n if city[i] == \"S\" and city[i+1] == \"F\":\n count_S = count_S+ 1\n elif city[i] == \"F\" and city[i+1] == \"S\":\n count_F = count_F+ 1\n else:\n count_F =count_F+ 0\n count_S =count_S + 0\nif count_S > count_F:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "days=int(input())\r\nSF=0\r\nFS=0\r\nS=input()\r\nfor i in range(len(S)-1):\r\n if S[i]!=S[i+1]:\r\n if S[i]=='S':\r\n SF+=1\r\n else:\r\n FS+=1\r\nif SF>FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ntour = input()\r\nhasil1,hasil2,j = 0,0,1\r\n\r\nfor i in range(len(tour)):\r\n if i != len(tour)-1:\r\n if tour[i] == \"S\" and tour[j] == \"F\":\r\n hasil1 += 1\r\n elif tour[i] == \"F\"and tour[j] == \"S\":\r\n hasil2 += 1\r\n j += 1\r\nif hasil1 <= hasil2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "input()\r\nc=input().count\r\nif(c('SF')>c('FS')):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\ns=input()\nse,fa=0,0\nfor i in range(n-1):\n\tif (s[i+1]=='F')and(s[i]=='S'):\n\t\tfa+=1\n\telif (s[i+1]=='S')and(s[i]=='F'):\n\t\tse+=1\nif fa>se:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n=int(input())\r\nstring=input()\r\nsan=string.count('SF')\r\nfran=string.count('FS')\r\nif(san>fran):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_pleasant(n, travel_string):\n\ts2sf = 0\n\tsf2s = 0\n\tfor i in range(n - 1):\n\t\tif travel_string[i] == travel_string[i + 1]:\n\t\t\tcontinue\n\t\telif travel_string[i + 1] == \"S\":\n\t\t\tsf2s += 1\n\t\telse:\n\t\t\ts2sf += 1\n\t\n\tif s2sf > sf2s:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\n\n\n\n\n\n\n\nn = int(input())\ntravel_string = input()\nis_pleasant(n, travel_string)\n", "n = int(input())\r\nst = input()\r\npre = '0'\r\nsc = 0\r\nfc = 0\r\nfor i in st:\r\n if i == 'S' and pre == 'F':\r\n fc += 1\r\n elif i =='F' and pre == 'S':\r\n sc += 1\r\n pre = i\r\nif sc > fc :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=input()\r\nsf=0\r\nfs=0\r\nfor b in range(0,len(a)-1):\r\n #print(b,b+1)\r\n if a[b]=='S' and a[b+1]=='F':\r\n sf+=1\r\n #print(\"1\",sf)\r\n elif a[b]=='F' and a[b+1]=='S':\r\n fs+=1\r\n #print(\"2\",fs)\r\n else:\r\n b+=1\r\n #print(\"3\")\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "N = int(input())\r\nS = input()\r\nprefer = 0\r\nhate = 0\r\nnow = S[0]\r\nfor i in range(1, N):\r\n\tif now != S[i]:\r\n\t\tif now == 'S': prefer += 1\r\n\t\telse: hate += 1\r\n\t\tnow = S[i]\r\nif prefer > hate: print('YES')\r\nelse: print('NO')", "n = int(input())\ns = input()\n\nfs = 0\nsf = 0\n\nprev = s[0]\n\nfor i in range(1,n):\n if prev!=s[i]:\n if prev==\"F\":\n fs+=1\n else:\n sf+=1\n\n prev = s[i]\n\nif sf >fs:\n print(\"YES\")\nelse:\n print(\"NO\")", "# cook your dish here\r\na=int(input())\r\ns=input()\r\nsf=0\r\nfs=0\r\ni=0\r\nwhile(i!=a):\r\n if(s[i:i+2]==\"SF\"):\r\n sf=sf+1\r\n elif(s[i:i+2]==\"FS\"):\r\n fs=fs+1\r\n i=i+1\r\n \r\n \r\nif(sf>fs):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "import math\r\nn = int(input())\r\ns = input()\r\nd1 = 0\r\nd2 = 0\r\nfor i in range(1,n):\r\n d1 += (0,1)[s[i]=='F' and s[i-1]=='S']\r\n d2 += (0,1)[s[i]=='S' and s[i-1]=='F']\r\nprint(('NO','YES')[d1>d2])\r\n \r\n", "a=int(input())\nb=input()\nt1 =0\nt2=0\nfor i in range(a-1):\n if b[i] == 'S' and b[i+1] == 'F':\n t1+=1\n elif b[i] == 'F' and b[i+1] == 'S':\n t2+=1\n\nif t1> t2:\n print('YES')\nelse:\n print('NO')", "n=int(input())\r\na=input()\r\ns=a[0]\r\nc=0\r\nt=0\r\nfor i in range(1,n):\r\n if s==a[i]:\r\n pass\r\n else:\r\n if a[i]==\"S\":\r\n t +=1\r\n s=a[i]\r\n else:\r\n c +=1\r\n s=a[i]\r\nif t>=c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "while 1:\r\n try:\r\n input()\r\n x = input()\r\n except:\r\n break\r\n re = 0\r\n to = 0\r\n for i in range(len(x)-1):\r\n if x[i]==\"F\" and x[i+1] == \"S\":\r\n re +=1\r\n elif x[i]==\"S\" and x[i+1] ==\"F\":\r\n to +=1\r\n if to > re:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# cf 867/A (600)\nn = int(input())\ns = input()\n\nlast = 'X'\nsf = 0\nfs = 0\nfor c in s:\n if c == 'S':\n if last == 'F':\n fs += 1\n last = c \n else: # c == 'F'\n if last == 'S':\n sf += 1\n last = c\n\nif sf > fs:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=int(input())\r\nb=input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(1,a):\r\n if b[i-1]==\"S\" and b[i]==\"F\":\r\n count1+=1\r\n elif b[i-1]==\"F\" and b[i]==\"S\":\r\n count2+=1\r\nif count1>count2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nl = list(input())\r\nc1,c2=0,0\r\nfor i in range(n-1):\r\n\tif l[i]=='F' and l[i+1]=='S':\r\n\t\tc1+=1\r\n\tif l[i]=='S' and l[i+1]=='F':\r\n\t\tc2+=1\r\nif c2>c1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a = int(input())\r\nb = input()\r\ncptS=cptF=0\r\nfor i in range(1,a):\r\n if b[i] != b [i-1]:\r\n if b[i] == 'S':\r\n cptS +=1\r\n else:\r\n cptF +=1\r\nprint(['YES', 'NO'][cptS >= cptF])\r\n", "n = int(input())\r\nstring = input()\r\nprev = string[0]\r\nStoF = 0 \r\nFtoS = 0 \r\nfor i in range(1,len(string)):\r\n if string[i] != prev:\r\n if prev == \"S\":\r\n StoF += 1\r\n else:\r\n FtoS += 1\r\n prev = string[i]\r\nif StoF > FtoS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nx = input()\r\nif x.count('SF')>x.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ndays = input()\r\ns_to_f = days.count(\"SF\")\r\nf_to_s = days.count(\"FS\")\r\nif s_to_f > f_to_s:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\nstring = input()\r\nif string.count(\"SF\") > string.count(\"FS\"): print(\"YES\")\r\nelse: print(\"NO\")", "x = int(input())\r\nflights = input()\r\nif flights[0] != flights[-1] and flights[0] == \"S\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\narr = input()\r\narr = [s for s in arr]\r\ns_to_f = 0\r\nf_to_s = 0\r\n\r\nfor i in range(len(arr)):\r\n if i == 0:\r\n None\r\n else:\r\n if arr[i-1] == 'S' and arr[i] == 'F':\r\n s_to_f +=1\r\n if arr[i-1] == 'F' and arr[i] == 'S':\r\n f_to_s +=1\r\n \r\n\r\nif s_to_f >f_to_s :\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\ns = input()\n\na = 0\nb = 0\nfor i in range(n - 1):\n\ta += (s[i] + s[i + 1] == \"SF\")\n\tb += (s[i] + s[i + 1] == \"FS\")\n\nprint(\"YES\" if a > b else \"NO\")", "n1 = input()\r\narr1 = input()\r\narr = []\r\nfor i in arr1:\r\n arr.append(i)\r\n\r\nn = int(n1)\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if arr[i] == 'S' and i + 1 < n:\r\n if arr[i+ 1] == 'F':\r\n count += 1 \r\n \r\n elif arr[i] == 'F' and i + 1 < n:\r\n if arr[i + 1] == 'S':\r\n count -= 1 \r\n\r\nif count <= 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a = int(input())\r\nb = input()\r\nc, d = 0, 0\r\nfor i in range(a):\r\n if i != a - 1:\r\n if 'S' in b[i] and 'F' in b[i+1]:\r\n c -= -1\r\n elif 'F' in b[i] and 'S' in b[i + 1]:\r\n d -= -1\r\n elif 'SS' in b[i]:\r\n pass\r\n elif 'FF' in b[i]:\r\n pass\r\n elif i == a - 1:\r\n break\r\nif c > d:\r\n print('YES')\r\nelif c <= d:\r\n print('NO')\r\n", "n=int(input())\nstr_n = input().upper()\ncount_sf =0\ncount_fs=0\nfor i in range (len(str_n)-1):\n if str_n[i] == 'S' and str_n[i+1]=='F':\n count_sf +=1\n elif str_n[i]== 'F' and str_n[i+1]=='S':\n count_fs +=1\nif count_sf > count_fs:\n print('YES')\nelse:\n print('NO')", "n=int(input())\r\nx=input()\r\nl=list(x)\r\nj=p=0\r\nfor i in range(n-1):\r\n if l[i]==\"S\" and l[i+1]==\"F\" :\r\n j+=1\r\n elif l[i]==\"F\" and l[i+1]==\"S\" :\r\n p+=1\r\nif j > p :\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "\r\nn=int(input())\r\nt=input()\r\na=[]\r\nfor x in range(n-1):\r\n\tif t[x]==\"S\" and t[x+1]==\"F\":\r\n\t\ta.append(1)\r\n\telif t[x]==\"F\" and t[x+1]==\"S\":\r\n\t\ta.append(0)\r\nif a.count(1)>a.count(0):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "n = int(input()) ; t = input()\r\nprint(\"YES\" if t[0] == \"S\" and t[-1] == \"F\" else \"NO\") \r\n \r\n", "n = input()\nw = 0\nd = input()\n\nfor i in range(len(d) - 1):\n if d[i] == 'S' and d[i+1] != d[i]:\n w += 1\n elif d[i] == 'F' and d[i+1] != d[i]:\n w -= 1\n\nprint([\"NO\", \"YES\"][w > 0])\n\n", "n = int(input())\nS = list(input())\n\nprevious = None\ncounter = 0\nfor s in S:\n if previous == 'S' and s == 'F':\n counter += 1\n if previous == 'F' and s == 'S':\n counter -= 1\n previous = s\n\nif counter > 0:\n print('YES')\nelse:\n print('NO')\n", "n = int(input())\r\nx = input()\r\ncnt = 0\r\ncount = 0\r\nfor i in range(0,n-1):\r\n if x[i] == 'S':\r\n if x[i+1] == 'F':\r\n count+=1\r\n if x[i] == 'F':\r\n if x[i+1] == 'S':\r\n cnt+=1\r\nif count>cnt:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=str(input())\r\nif l.count(\"SF\")>l.count(\"FS\"):\r\n print(\"YES\")\r\nelif l.count(\"SF\")==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nt = input()\r\n\r\ns_f = 0\r\nf_s = 0\r\n\r\nfor i in range(0, n-1):\r\n if t[i] == \"S\" and t[i+1] == \"F\":\r\n s_f += 1\r\n elif t[i] == \"F\" and t[i+1] == \"S\":\r\n f_s += 1\r\n else:\r\n continue\r\n\r\n\r\nif s_f > f_s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport math\r\n\r\ndef main():\r\n\t#sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n\t#sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n\r\n\tn = int(sys.stdin.readline())\r\n\tf = (sys.stdin.readline().strip())\r\n\r\n\tif f[0] == 'S' and f[n - 1] == 'F':\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n#hajj", "s=int(input())\nn = input()\nq=0\np=0\nif (n[0]=='S') and (n[s-1]=='F'):\n print('YES')\nelse:\n print('NO')", "t=int(input())-1\ns=input()\nif(s[0]==\"S\" and s[t]==\"F\"):\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nsf =0\r\nss =0\r\n\r\nfor i in range(1,n) :\r\n if s[i-1]=='S':\r\n if s[i]=='F':\r\n sf+=1\r\n else:\r\n if s[i]== 'S':\r\n ss+=1\r\n\r\nprint('YES' if (sf>ss) else 'NO')\r\n", "def sol():\r\n n=int(input())\r\n s=input()\r\n print(\"YES\" if(s[0]=='S' and s[n-1]=='F') else \"NO\")\r\nif(__name__=='__main__'):\r\n sol()\r\n", "a=int(input())\r\nb=input()\r\nx=y=0\r\n\r\nfirst = b[0]\r\nfor second in b[1:]:\r\n if first == 'S' and second == 'F':\r\n x+=1\r\n elif first == 'F' and second == 'S':\r\n y+=1\r\n first = second\r\n\r\nif x>y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\np=input()\r\nsf=0\r\nfs=0\r\nfor i in range(n-1):\r\n if(p[i]=='S' and p[i+1]=='F'):\r\n sf+=1\r\n elif(p[i]=='F' and p[i+1]=='S'):\r\n fs+=1\r\nif(sf>fs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def betweenOffices(n, l):\r\n i = 0\r\n j = 0\r\n for a in range (n-1):\r\n if l[a] == 'S' and l[a+1] == 'F':\r\n i = i + 1\r\n for b in range (n-1):\r\n if l[b] == 'F' and l[b+1] == 'S':\r\n j = j + 1\r\n if i > j:\r\n return ('YES')\r\n else:\r\n return ('NO')\r\n \r\nprint (betweenOffices(int(input()), input()))\r\n ", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\ns= input()\r\nc=0\r\nd=0\r\nfor i in range(0,n-1):\r\n\tif s[i] ==\"F\" and s[i+1]==\"S\":\r\n\t\tc+=1\r\n\tif s[i]==\"S\" and s[i+1]==\"F\":\r\n\t\td+=1\r\nif(d>c):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n=int(input())\r\nstroka=input()\r\nif stroka.count('SF')>stroka.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\n\r\nsf,fs = 0,0\r\nfor i in range(n-1):\r\n\tif s[i]=='S' and s[i+1]=='F':\r\n\t\tsf += 1\r\n\tif s[i]=='F' and s[i+1]=='S':\r\n\t\tfs += 1\r\n\r\nif sf>fs:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\na = list(input())\r\n\r\ncount_s = 0\r\ncount_f = 0\r\nfor i in range(n-1):\r\n if a[i] == 'S' and a[i] != a[i+1]:\r\n count_s += 1\r\n elif a[i] == 'F' and a[i] != a[i+1]:\r\n count_f += 1\r\n \r\nif count_s > count_f:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "n = int(input())\r\nflights = input()\r\nstof = 0\r\nftos = 0\r\nprev = \"\"\r\n\r\nif flights[0] == \"S\":\r\n prev = \"S\"\r\nelif flights[0] == \"F\":\r\n prev = \"F\"\r\n\r\nfor i in range(len(flights)):\r\n if prev != flights[i]:\r\n if prev == \"S\":\r\n stof += 1\r\n elif prev == \"F\":\r\n ftos += 1\r\n if flights[i] == \"S\":\r\n prev = \"S\"\r\n elif flights[i] == \"F\":\r\n prev = \"F\"\r\n\r\nif stof > ftos:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = input().rstrip()\r\nf = s = 0\r\nfor i in range(1, n):\r\n if data[i - 1] == 'S' and data[i] == 'F':\r\n f += 1\r\n elif data[i - 1] == 'F' and data[i] == 'S':\r\n s += 1\r\n\r\nprint(\"YES\" if f > s else \"NO\")", "a=int(input())\r\nflights=input()\r\nif flights.count('SF')>flights.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\ns = input()\n\nfrancisco, seattle = 0,0\nfor i in range(len(s)-1):\n\tif s[i] == 'F' and s[i+1] == 'S':\n\t\tseattle +=1\n\telif s[i] == 'S' and s[i+1] == 'F':\n\t\tfrancisco += 1\n\nif francisco > seattle:\n\tprint('YES')\nelse:\n\tprint('NO')\n\n\n", "n = int(input())\na = input()\na = a.upper()\nfs = a.count('FS')\nsf = a.count('SF')\nif sf<=fs:\n print('NO')\nelse:\n print(\"YES\")\n", "data = input()\r\ndata = int(data)\r\nline = input()\r\nif line.count(\"SF\") > line.count(\"FS\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#867A in codeforces\r\nn = int(input())\r\nstof = 0\r\nftos = 0\r\ndays = list(char for char in input())\r\ncity = days[0]\r\nfor nextcity in days:\r\n\tif city != nextcity:\r\n\t\tif city == \"S\":\r\n\t\t\tstof += 1\r\n\t\telif city == \"F\":\r\n\t\t\tftos += 1\r\n\t\tcity = nextcity\r\nif stof>ftos:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\nstr = input()\r\ncountSF = 0\r\ncountFS = 0 \r\nfor i in range(len(str)-1):\r\n if str[i] == \"S\" and str[i+1] == \"F\" : \r\n countSF+=1\r\n if str[i] == \"F\" and str[i+1]==\"S\" : \r\n countFS+=1\r\nif countSF > countFS : \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nsea_to_sf = s.count(\"SF\")\r\nsf_to_sea = s.count(\"FS\")\r\nif sea_to_sf > sf_to_sea:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\nm=input()\ns=list(m)\ni=0\nr=0\nj=0\nk=0\nwhile k<n-1:\n k=k+1\n if (s[i]=='S') and (s[i+1]=='F'):\n r=r+1\n elif (s[i]=='F') and (s[i+1]=='S'):\n j=j+1\n i=i+1\nif r>j:\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", "n = int(input()) - 1\r\ns = input()\r\nFS = 0\r\nSF = 0\r\nfor i in range(n):\r\n\tif s[i] == 'F' and s[i + 1] == 'S':\r\n\t\tFS += 1\r\n\telif s[i] == 'S' and s[i + 1] == 'F':\r\n\t\tSF += 1\r\nif FS >= SF:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "# coding: utf-8\r\n\r\nn = int(input())\r\ns = input()\r\ntoSanFrancisco = toSeattle = 0\r\n\r\nfor i in range(1, n):\r\n if s[i] != s[i - 1]:\r\n if s[i] == 'S':\r\n toSeattle += 1\r\n \r\n else:\r\n toSanFrancisco += 1\r\n \r\nprint('YES') if toSanFrancisco > toSeattle else print('NO')", "x=int(input())\r\ny=input()\r\nf=list(y)\r\nli1=[]\r\nli2=[]\r\ndef g(c):\r\n if c=='F':\r\n c=1\r\n else:\r\n c=0\r\n return c\r\nF=list(map(g,f))\r\nz=0\r\nfor i in range(x-1):\r\n if F[z]-F[z+1]==0 :\r\n z+=1\r\n elif F[z]-F[z+1]==1:\r\n li1.append(z)\r\n z+=1\r\n else:\r\n li2.append(z)\r\n z+=1\r\n\r\nif len(li1)<len(li2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nstof=0\r\nftos=0\r\nfor i in range(0,len(s)):\r\n if(i+1<len(s) and s[i]=='S' and s[i+1]=='F'):\r\n stof+=1\r\n elif(i+1<len(s) and s[i]=='F' and s[i+1]=='S'):\r\n ftos+=1\r\nif(stof>ftos):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\ns=input()\r\ni=0\r\nfar=0\r\nseat=0\r\nwhile i<len(s)-1:\r\n if s[i]==\"S\" and s[i+1]==\"F\":\r\n far+=1\r\n elif s[i]==\"F\" and s[i+1]==\"S\":\r\n seat+=1\r\n i+=1\r\nif seat<far:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\nline = input()\nprint(\"YES\" if line.count('SF') > line.count('FS') else 'NO')", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\nline = input()\r\n\r\nsf = 0\r\nfs = 0\r\nfor i in range(n-1):\r\n if line[i:i+2] == 'SF':\r\n sf += 1\r\n elif line[i:i+2] == 'FS':\r\n fs += 1\r\n\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = int(input())\r\nn = list(str(input()))\r\n\r\n\r\ndef flight(num, n):\r\n i = 0\r\n S = 0\r\n F = 0\r\n for x in range(num-1):\r\n if n[i] == n[i+1]:\r\n i += 1\r\n else:\r\n if n[i] == \"S\":\r\n S += 1\r\n i += 1\r\n else:\r\n F += 1\r\n i += 1\r\n if S > F:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\nflight(num, n)\r\n", "n=int(input())\ns=input()\na=0\nb=0\nfor i in range(n-1):\n\tif s[i]==\"S\" and s[i+1]==\"F\":\n\t\ta+=1\n\telif s[i]==\"F\" and s[i+1]==\"S\":\n\t\tb+=1\nif a>b:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t", "t=int(input())\r\na=input()\r\nb=a\r\na=a.replace(\"SF\",'1')\r\nb=b.replace(\"FS\",'0')\r\nc=a.count('1')\r\nd=b.count('0')\r\nif c>d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\ncy , cn =0, 0\r\nfor i in range(len(s)-1):\r\n if s[i]+s[i+1]=='SF':\r\n cy+=1\r\n continue\r\n if s[i]+s[i+1]=='FS':\r\n cn+=1\r\nif cy>cn:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ntravel=list(input())\r\ngood=0\r\nbad=0\r\nfor i in range(1,len(travel)):\r\n if travel[i]=='F' and travel[i-1]=='S':\r\n good+=1\r\n elif travel[i]=='S' and travel[i-1]=='F':\r\n bad+=1\r\n\r\nif good>bad:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "input()\r\ns = input()\r\nprint(('NO', 'YES')[s[0] + s[-1] == 'SF'])", "input()\r\nmy_str = input()\r\nSF = my_str.count(\"SF\")\r\nFS = my_str.count(\"FS\")\r\nif SF > FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "queries = input()\n\n\nstring = input()\nprevious = string[0]\nS = 0\nF = 0\nfor char in string[1:]: \n if previous != char:\n if char == 'F':\n F += 1\n else:\n S += 1\n previous = char\n\nif F > S:\n print('YES')\nelse:\n print('NO') ", "n = input()\r\npalabra = input()\r\n\r\ncnt_s = 0\r\ncnt_f = 0\r\n\r\nfor i in range(1, len(palabra)):\r\n if palabra[i] != palabra[i-1]:\r\n if palabra[i] == 'F':\r\n cnt_s += 1\r\n else:\r\n cnt_f += 1\r\n\r\nif cnt_s > cnt_f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\na = s.count('SF')\r\nb = s.count('FS')\r\nif a > b:\r\n print('YES')\r\nelse:\r\n print('NO')", "amountofdays = int(input())\r\n\r\nfsdays = list(input())\r\nf_s= 0\r\ns_f =0\r\nlastcity = None\r\nfor i in fsdays:\r\n if lastcity != None and lastcity != i:\r\n if i == \"S\":\r\n f_s += 1 \r\n else:\r\n s_f +=1\r\n lastcity = i\r\nif f_s < s_f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\ndays = input()\r\ns = 0\r\nf = 0\r\n\r\nfor i in range (len(days)):\r\n if i != len(days) - 1:\r\n if days[i+1] != days[i]:\r\n if days[i+1] == \"S\":\r\n s += 1\r\n else:\r\n f += 1\r\n\r\nif s >= f:\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "n = int(input())\ncity = list(input())\ncount = 0\nfor i in range(1,n):\n if city[i-1] == 'S' and city[i] == 'F':\n count += 1\n if city[i-1] == 'F' and city[i] == 'S':\n count -= 1\nif count >= 1:\n print('YES')\nelse:\n print(\"NO\")\n\n\n\n", "n = int(input())\r\n\r\nstring = input()\r\n\r\nsfCount = 0\r\nfsCount = 0\r\n\r\nfor i in range(n-1):\r\n if string[i] == 'S' and string[i+1] == 'F':\r\n sfCount += 1\r\n elif string[i] == 'F' and string[i+1] == 'S':\r\n fsCount += 1\r\n \r\n\r\nif sfCount > fsCount:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\np=input()\r\nf=0\r\ns=0\r\nfor i in range(0,n-1):\r\n if p[i]!=p[i+1]:\r\n if p[i]=='S':\r\n f+=1\r\n else:\r\n s+=1\r\nif f>s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nsttr = input()\r\nprint('YES' if sttr.count('SF') > sttr.count('FS') else 'NO')", "input()\r\ns = input()\r\ncur = s[0]\r\nStoF = 0\r\nFtoS = 0\r\nfor c in s:\r\n if c != cur:\r\n cur = c\r\n if c == 'F':\r\n StoF += 1\r\n else:\r\n FtoS += 1\r\n\r\nif StoF > FtoS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n=int(input())\r\ns = str(input())\r\nif n!=len(s):\r\n print(-1)\r\nelse: \r\n c=0\r\n d=0\r\n for i in range(0,len(s)-1):\r\n if s[i]+s[i+1]=='SF':\r\n c+=1\r\n elif s[i]+s[i+1]=='FS':\r\n d+=1\r\n if c>d:\r\n print('YES')\r\n else:\r\n print('NO')", "# http://codeforces.com/problemset/problem/867/A\n\nn=int(input())\nloc=list(input())\nSF,FS=0,0\nfor i in range(len(loc)-1):\n\tif(loc[i]=='S' and loc[i+1]=='F'):\n\t\tSF+=1\n\telif(loc[i]=='F' and loc[i+1]=='S'):\n\t\tFS+=1\nif(SF>FS):\n\tprint('YES')\nelse:\n\tprint('NO')", "# for testCase in range(int(input())):\nn = int(input())\ntrav = input()\nn -= 1\ncnt = 0\nfor i in range(n):\n if trav[i] == 'S' and trav[i+1] == 'F':\n cnt += 1\n elif trav[i] == 'F' and trav[i+1] == 'S':\n cnt -= 1\nif cnt > 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\ns = input()\r\n\r\nfs = 0\r\nsf = 0\r\n\r\nfor i in range(n - 1):\r\n if s[i:i + 2] == 'FS':\r\n fs += 1\r\n elif s[i:i + 2] == 'SF':\r\n sf += 1\r\n \r\nprint(\"YES\" if sf > fs else \"NO\")", "length = input()\r\nstring = input()\r\nftos = 0\r\nstof = 0\r\nfor i in range(len(string)-1):\r\n if(string[i] != string[i+1]):\r\n if(string[i] == \"F\"):\r\n ftos = ftos + 1\r\n else:\r\n stof = stof + 1\r\nif(stof > ftos):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n \r\n \r\n", "n=input()\r\ns=input()\r\nl=list(s)\r\nstof=0\r\nftos=0\r\nfor i in range(len(s)-1):\r\n if l[i]=='F' and l[i+1]=='S':\r\n ftos=ftos+1\r\n elif l[i]=='S' and l[i+1]=='F':\r\n stof=stof+1\r\nif stof>ftos:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nsarr = input().lower()\nsfc, fsc = 0, 0\nprev = sarr[0]\nfor i in range(1, n):\n\tif sarr[i] != prev:\n\t\tif prev == \"s\":\n\t\t\tsfc += 1\n\t\telse:\n\t\t\tfsc += 1\n\tprev = sarr[i]\nif sfc > fsc:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "n=int(input())\r\ns=\"\"\r\ns=input().upper()\r\nif s[0]==\"S\" and s[n-1]==\"F\":\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \t\r\n", "n=int(input())\na=input()\nj=0;count=0;\nj=int(j);count=int(count)\nfor i in range (len(a)-1):\n if(a[i]=='S' and a[i+1]=='F'):\n count=count+1\n if(a[i]=='F' and a[i+1]=='S'):\n j=j+1\nif(j<count):\n print('YES')\nelse:\n print('NO')\n \n", "t=int(input())\r\nF=str(input())\r\nl=F.count('SF')\r\nm=F.count('FS')\r\nif l>m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "_ = input()\nstring = input()\n\nno = string.count(\"FS\")\nyes =string.count(\"SF\")\nprint(\"YES\" if yes > no else \"NO\")\n", "days = int(input())\r\npos = input()\r\n\r\ns = 0\r\nf = 0\r\n\r\nfor i in range(days-1):\r\n if pos[i] == 'F' and pos[i+1] == 'S':\r\n f += 1\r\n elif pos[i] == 'S' and pos[i+1] == 'F':\r\n s += 1\r\n\r\nif f >= s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nflight = input()\r\nif flight[0]==\"S\" and flight[n-1]==\"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input(\"\"))\r\nstr1=input(\"\")[0:a]\r\ncountr=0\r\ncountnr=0\r\nfor i in range(0,len(str1)-1):\r\n \r\n if(str1[i]==\"S\" and str1[i+1]==\"F\"):\r\n countr+=1\r\n if(str1[i]==\"F\" and str1[i+1]==\"S\"):\r\n countnr+=1\r\n\r\n\r\nif(countnr>=countr):\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")", "n,s=input(),input()\r\nprint(['NO','YES'][s.count('SF')>s.count('FS')])", "days = int(input())\ncities = input()\nk = 0\ncities = cities + \" \"\nfor i in range(days):\n\tif cities[i] == \"S\" and cities[i+1] == \"F\":\n\t\tk += 1\n\telif cities[i] == \"F\" and cities[i+1] == \"S\":\n\t\tk -= 1\nif k>0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n = int(input())\ncities = input()\n\nfavorite = 0\nnon_favorite = 0\n\nfor i in range(len(cities) - 1):\n if cities[i] + cities[i+1] == \"SF\":\n favorite += 1\n elif cities[i] + cities[i+1] == \"FS\":\n non_favorite += 1\n\nif favorite > non_favorite:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\ns = str(input())\r\ncount=0\r\ncount1=0\r\n\r\nfor i in range(n-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n count+=1\r\nfor j in range(n-1):\r\n if s[j]=='F' and s[j+1]=='S':\r\n count1+=1\r\nif count>count1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "read = lambda:map(int, input().split())\r\nn = int(input())\r\nf = input()\r\nrt = 0\r\nfor i in range(n - 1):\r\n if f[i] == \"S\" and f[i + 1] == \"F\":\r\n rt += 1\r\n elif f[i] == \"F\" and f[i + 1] == \"S\":\r\n rt -= 1\r\nif (rt > 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n= int(input())\r\nx= input()\r\na=0\r\nb=0\r\nfor i in range(1,len(x)):\r\n if x[i-1]==\"S\" and x[i]==\"F\":\r\n a+=1\r\n if x[i-1]==\"F\" and x[i]==\"S\":\r\n b+=1\r\nif a>b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "#!/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].count('SF')\r\n F = wtf[1].count('FS')\r\n print('YES' if S > F else 'NO')\r\n", "n=int(input())\r\nyes=0\r\nno=0\r\nstr=input()\r\nfor i in range(0,len(str)):\r\n if(i<len(str)-1):\r\n if(str[i]=='S' and str[i+1]=='F'):\r\n yes+=1\r\n if(str[i]=='F' and str[i+1]=='S'):\r\n no+=1\r\nif(yes>no):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ntravel = input()\r\nlst = list(travel)\r\ncount = 0\r\ncount_2 = 0\r\nS = s = \"S\"\r\nF = f = \"Ff\"\r\nfor i in range (n-1):\r\n if (lst[i] == \"S\"):\r\n if (lst[i+1] == \"F\"):\r\n count += 1\r\n elif (lst[i] == \"F\" or \"f\"):\r\n if (lst[i+1] == \"S\"): \r\n count_2 += 1\r\n else:\r\n count += 0 \r\n count_2 += 0\r\n\r\nif (count > count_2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "import math\r\nfrom re import L\r\nimport sys,bisect\r\nfrom collections import deque,OrderedDict,defaultdict\r\nimport heapq\r\nfrom collections import Counter\r\ndef inp(): return sys.stdin.readline().rstrip()\r\ndef mpp(): return map(int,inp().split())\r\ndef lis(): return list(mpp())\r\ndef yn(n):\r\n if n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\ndef fn(arr,n):\r\n if arr==sorted(arr):\r\n return 0\r\n di={}\r\n for i in range(n):\r\n di[arr[i]]=i+1\r\n r=n-1\r\n for i in range(n-1,0,-1):\r\n r=i\r\n if arr[i]<arr[i-1]:break\r\n s=set()\r\n i=0\r\n while i<r:\r\n r=max(r,di[arr[i]])\r\n s.add(arr[i])\r\n i+=1\r\n return len(s)\r\n\r\n\r\ndef main():\r\n n=int(inp())\r\n s=inp()\r\n sf=0\r\n fs=0\r\n for i in range(1,n):\r\n if s[i]==\"F\" and s[i-1]==\"S\":\r\n sf+=1\r\n elif s[i]==\"S\" and s[i-1]==\"F\":\r\n fs+=1\r\n print(yn(sf>fs))\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n main()", "n = int(input()) \r\ns = input()\r\npos = s[0]\r\nsf = 0\r\nfs = 0\r\nfor i in range(1,len(s)) :\r\n\tif pos == 'S' and s[i] == 'F' :\r\n\t\tsf += 1\r\n\t\tpos = s[i]\r\n\telif pos == 'F' and s[i] == 'S' :\r\n\t\tfs += 1\r\n\t\tpos = s[i]\r\nif sf <= fs :\r\n\tprint(\"NO\")\r\nelse :\r\n\tprint(\"YES\")\r\n", "n = int(input())\r\nf = input()\r\n\r\nFS = 0\r\nSF = 0\r\n\r\nfor i in range(n-1):\r\n if f[i] + f[i+1] == 'FS':\r\n FS += 1\r\n if f[i] + f[i+1] == 'SF':\r\n SF += 1\r\n \r\nif SF > FS:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "if __name__ == \"__main__\":\n n = int(input())\n cities = input()\n good_flies: int = 0\n\n for i in range(len(cities) - 1):\n if cities[i] == 'S' and cities[i+1] == 'F':\n good_flies += 1\n elif cities[i] == 'F' and cities[i+1] == 'S':\n good_flies -= 1\n\n if good_flies > 0:\n print('YES')\n else:\n print('NO')", "n = int(input())\r\ndays = input()\r\n\r\nnumFS = 0\r\nnumSF = 0\r\n\r\nfor i in range(n-1):\r\n\tif (days[i] + days[i+1] == 'FS'):\r\n\t\tnumFS += 1\r\n\telif( days[i] + days[i+1] == 'SF'):\r\n\t\tnumSF += 1\r\n\t\r\n\r\nif (numSF > numFS):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "_,s=input(),input()\r\nprint(\"YNEOS\"[s.count(\"SF\")<=s.count(\"FS\")::2])", "num=int(input())\r\nstring=str(input())\r\nseatle=0\r\nfrasico=0\r\nfor i in range(num-1):\r\n if string[i]==\"S\" and string[i+1]==\"F\":\r\n seatle=seatle+1 \r\n elif string[i]==\"F\" and string[i+1]==\"S\":\r\n frasico=frasico+1 \r\n else:\r\n continue\r\nif seatle>frasico:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstring = \"\"\r\nseattle = 0\r\nsan_fran = 0\r\ns = input().upper()\r\n\r\nfor i in range(n - 1):\r\n if s[i] == \"F\" and s[i+1] == \"S\":\r\n seattle = seattle + 1\r\n elif s[i] == \"S\" and s[i+1] == \"F\":\r\n san_fran = san_fran + 1\r\n\r\nif seattle < san_fran:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=list(input())\r\na=0\r\nb=0\r\nfor i in range(n-1):\r\n if s[i:i+2]==list(\"SF\"):\r\n a+=1\r\n elif s[i:i+2]==list(\"FS\"):\r\n b+=1\r\n#print(a,b) \r\nif a>b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n = int(input())\r\ns = input()\r\nf = 0\r\nsia = 0\r\nfor i in range(1,n):\r\n if s[i-1] != s[i]:\r\n if s[i-1] == 'F':\r\n f += 1\r\n else:\r\n sia += 1\r\nif sia > f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nk=input()\r\nif k[0]=='S' and k[n-1]=='F':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nx=list(input().lower())\r\nfs,sf=0,0\r\nfor i in range(len(x)-1):\r\n if x[i]=='f' and x[i+1]=='s':\r\n fs+=1\r\n if x[i]=='s' and x[i+1]=='f':\r\n sf+=1\r\nprint(\"YES\" if sf>fs else \"NO\")", "input()\r\ns=input()\r\nSF = s.count('SF')\r\nFS = s.count('FS')\r\nprint('YES' if SF>FS else 'NO')", "n = int(input())\r\ns = input()\r\na = 0\r\nb = 0\r\nfor i in range(n-1):\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n a += 1\r\n elif s[i] == 'F' and s[i+1] == 'S':\r\n b += 1\r\nif a > b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\nse = sf = 0\r\n\r\nfor i in range(1, n):\r\n if s[i] == 'F' and s[i - 1] == 'S':\r\n se += 1\r\n elif s[i] == 'S' and s[i - 1] == 'F':\r\n sf += 1\r\nprint(\"YES\" if se > sf else \"NO\")", "n=int(input())\r\ns=input()\r\nlst=[]\r\ntemp=''\r\nini=s[0]\r\nfor i in s:\r\n if i==ini:\r\n temp+=i\r\n continue \r\n else:\r\n lst.append(set(temp))\r\n temp=\"\"\r\n ini=i \r\n temp+=i\r\nlst.append(set(temp))\r\nlst=list(lst[1:])\r\nf=0 \r\ns=0 \r\nfor i in lst:\r\n if i=={'F'}:\r\n f+=1 \r\n else:\r\n s+=1\r\nprint(\"YES\" if f>s else \"NO\")\r\n", "'''\r\n\tCodeForces 867A\r\n\tBetween the Offices\r\n\r\n\tTags: String Manipulation\r\n'''\r\ninput()\r\ns = input()\r\n\r\nans = s.count('SF') - s.count('FS')\r\nprint('YES' if ans > 0 else 'NO')", "day = int(input())\r\nstat = input()\r\nif len(stat)>day :\r\n print(\"Wrong input\")\r\nelse :\r\n if stat.count(\"SF\")>stat.count(\"FS\") :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n ", "n = int(input())\r\ns = input()\r\ns.upper()\r\nx=0\r\ny=0\r\nfor i in range(n-1):\r\n if ((s[i]=='S') and( s[i+1]=='F')):\r\n y=y+1\r\n \r\n elif ((s[i]=='F') and( s[i+1]=='S')):\r\n x=x+1\r\nif (x<y):\r\n print('YES')\r\nelse:\r\n print('NO')", "# cook your dish here \r\ntry :\r\n n = int(input()) \r\n s = input() \r\n count_of_flight = 0 \r\n for each in range ( 0, len(s) -1 ) : \r\n ch = s[each] + s[each+1]\r\n if ( ch == \"FS\" ) :\r\n count_of_flight -= 1 \r\n elif( ch == \"SF\" ):\r\n count_of_flight += 1\r\n else :\r\n pass\r\n if( count_of_flight > 0 ) :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\nexcept :\r\n pass\r\n", "n = int(input())\r\nstr = input()\r\na,b = 0,0\r\nfor i in range (n-1):\r\n if str[i]==\"S\" and str[i+1]==\"F\":\r\n a+=1\r\n elif str[i]==\"F\" and str[i+1]==\"S\":\r\n b+=1\r\nif a>b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport os.path\r\nfrom math import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom collections import defaultdict as dd, Counter,deque\r\nfrom itertools import accumulate\r\nfrom operator import add\r\nfrom heapq import *\r\n#from sortedcontainers import SortedList as SL, SortedSet as SS, SortedDict as SD\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\ndef st():\r\n return str(sys.stdin.buffer.readline().strip())[2:-1]\r\ndef li():\r\n return list(map(int, sys.stdin.buffer.readline().split()))\r\ndef mp():\r\n return map(int, sys.stdin.buffer.readline().split())\r\ndef inp():\r\n return int(sys.stdin.buffer.readline())\r\n\r\nmod = 1000000007\r\nINF = float(\"inf\")\r\n\r\ndef solve():\r\n n = inp()\r\n s = st()\r\n stl = sf = 0\r\n i = 0\r\n while i < n:\r\n x = s[i]\r\n xi = i\r\n while i < n and s[i] == x:\r\n i += 1\r\n if i<=n-1:\r\n if x == 'F':\r\n sf += 1\r\n else:\r\n stl += 1\r\n # print(stl,sf)\r\n if stl > sf:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n\r\n\r\n\r\n \r\n # ---- CHECK FOR CORNER CASES ----\r\n \r\n# for _ in range(inp()):\r\nsolve()", "num=int(input())\r\nstring=input()\r\ncurrent=string[0]\r\ncount=0\r\ncount2=0\r\nfor i in range (num):\r\n if current==\"S\" and string[i]==\"F\":\r\n count+=1\r\n if current==\"F\" and string[i]==\"S\":\r\n count2+=1\r\n current=string[i]\r\nif count>count2:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "in1 = int(input())\r\nin2 = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(in1-1):\r\n s = in2[i : i+2]\r\n if s == 'SF':\r\n sf = sf + 1\r\n if s == 'FS':\r\n fs = fs + 1\r\nif sf > fs:\r\n print('YES')\r\nelse :\r\n print('NO')", "import re\r\nn = int(input())\r\ns = input()\r\nprint('YES' if len(re.findall(r'SF', s)) > len(re.findall(r'FS', s)) else 'NO')", "n = int(input())\nf = str(input())\n\nS2F = 0\nF2S = 0\nfor i in range(n-1):\n tmp = (f[i:i+2])\n if tmp == 'SF':\n S2F += 1\n if tmp == 'FS':\n F2S += 1\n\nif S2F > F2S:\n print('YES')\nelse:\n print('NO')\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 = iinput()\r\na = input()\r\n\r\ns = a[0]\r\nyes = 0\r\nno = 0\r\n\r\nfor i in range(1,n):\r\n\tif s == 'F' and a[i] == 'S':\r\n\t\tno += 1\r\n\telif s == 'S' and a[i] == 'F':\r\n\t\tyes += 1\r\n\ts = a[i]\r\n\r\nif yes > no:\r\n\tprint(\"YES\") \r\nelse:\r\n\tprint(\"NO\")\r\n\r\n\r\n", "n=int(input())\r\ns = input()\r\nif s.count('SF')>s.count('FS'):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "\r\ndef solve(n):\r\n s = f = 0\r\n for i in range(len(n)):\r\n try:\r\n if n[i] == 'S' and n[i+1] == 'F':\r\n s += 1\r\n elif n[i] == 'F' and n[i+1] == 'S':\r\n f += 1\r\n except:\r\n if s > f:\r\n return 'YES'\r\n return 'NO'\r\n\r\ninput()\r\nn = input()\r\nprint(solve(n))\r\n", "t=int(input())\r\ncS=0\r\ncF=0\r\ncity=input()\r\nfor i in range(1,t):\r\n if city[i-1]=='F' and city[i]=='S':\r\n cF+=1\r\n elif city[i-1]=='F' and city[i]=='F':\r\n continue\r\n elif city[i-1]=='S' and city[i]=='S':\r\n continue\r\n else:\r\n cS+=1\r\nif cS>cF:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\ns_to_f = 0\r\nf_to_s = 0\r\nfor i in range(1, n):\r\n if s[i-1] == 'S' and s[i] == 'F':\r\n s_to_f += 1\r\n if s[i-1] == 'F' and s[i] == 'S':\r\n f_to_s += 1\r\nif s_to_f > f_to_s:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\ns = str(input())\nx = 0\ny = 0\nfor i in range(len(s)):\n if s[i:i+2] == 'SF':\n x = x + 1\n else:\n if s[i:i+2] == 'FS':\n y = y + 1\nif x > y:\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", "n = int(input())\r\ncities = input()\r\ncities = list(cities)\r\nto_francisco_seattle = 0 # negative for more often to Seattle\r\n\r\nprevious = cities[0]\r\nfor i in range(1, n):\r\n if previous == 'F' and cities[i] == \"S\":\r\n to_francisco_seattle -= 1\r\n if previous == 'S' and cities[i] == \"F\":\r\n to_francisco_seattle += 1\r\n\r\n previous = cities[i]\r\n\r\nif to_francisco_seattle > 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\ns=input()\r\nf=0\r\nsi=0\r\nfor i in range (0,len(s)):\r\n if (i+1<len(s)):\r\n if (s[i]!=s[i+1]) and (s[i]=='S'):\r\n f+=1\r\n elif (s[i]!=s[i+1]) and (s[i]=='F'):\r\n si+=1\r\nif (f>si):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nflights = input()\r\nf_to_s, s_to_f = 0, 0\r\nfor i in range(n - 1):\r\n if flights[i] == 'S' and flights[i + 1] == 'F':\r\n s_to_f += 1\r\n elif flights[i] == 'F' and flights[i + 1] == 'S':\r\n f_to_s += 1\r\n\r\nif s_to_f > f_to_s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nb = input()\r\n\r\ntemp = b[0]\r\nSF = 0\r\nFS = 0\r\n\r\nfor i in b[1:]:\r\n temp += i\r\n if temp == \"SF\":\r\n SF += 1\r\n if temp == \"FS\":\r\n FS += 1\r\n temp = temp[1:]\r\n\r\nprint(\"YES\" if SF > FS else \"NO\")\r\n", "num = input()\ncities = input()\n\nif cities[0] == \"F\":\n print(\"NO\")\nelse:\n swaps = 0\n for c1, c2 in zip(cities[:-1], cities[1:]):\n if c1 != c2:\n swaps += 1\n if swaps % 2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "n = int(input())\r\nc = input()\r\nf = 0\r\ns = 0\r\nres = 'NO'\r\n\r\nfor i in range(len(c)-1):\r\n if c[i] == 'F' and c[i+1] == 'S':\r\n s += 1\r\n elif c[i] == 'S' and c[i+1] == 'F':\r\n f += 1\r\n\r\nif f > s:\r\n res = 'YES'\r\n\r\nprint(res)", "n = int(input())\r\ns = input()\r\ncounts = countf = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i:i+2]=='SF':\r\n counts+=1\r\n elif s[i:i+2]=='FS':\r\n countf+=1\r\nif counts>countf:\r\n print('YES')\r\nelse:\r\n print('NO')", "input()\r\nn = input()\r\nprint(\"NO\" if n.count(\"FS\") >= n.count(\"SF\") else \"YES\")", "n = int(input())\ns = input()\nif s.count('FS') >= s.count('SF'):\n print('No')\nelse:\n print('Yes')", "def solve(n, m):\r\n\r\n one = m.count('SF')\r\n two = m.count('FS')\r\n if one > two:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n m = input()\r\n print(solve(n, m))", "n = int(input())\r\nstat = list(input())\r\nflag = stat[0]\r\nf = s = 0\r\nfor i in stat[1:]:\r\n if i!=flag and i=='F':\r\n f+=1\r\n flag = 'F'\r\n elif i!=flag and i=='S':\r\n s+=1\r\n flag = 'S'\r\nprint('YES' if f>s else 'NO')", "n=input();s=input();print(['NO','YES'][s[0]=='S' and s[-1]=='F'])", "#!/usr/bin/python3\n\nn = int(input())\nstring = input()\ns = string.count(\"SF\")\nf = string.count(\"FS\")\nr = \"YES\" if s > f else \"NO\" \nprint(r)\n'''\nhttps://codeforces.com/problemset/problem/867/A\n'''\n", "n=int(input())\r\nstr=input()\r\nfs=0\r\nsf=0\r\nfor i in range(n-1):\r\n if(str[i]==\"F\" and str[i+1]==\"S\"):\r\n fs=fs+1\r\n elif(str[i]==\"S\" and str[i+1]==\"F\"):\r\n sf=sf+1\r\nif(sf>fs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nf = input()\r\n\r\n#sf = 0\r\n#fs = 0\r\n\r\n#for i in range(1, n):\r\n# if f[i] == 'S' and f[i - 1] == 'F':\r\n# fs += 1\r\n# if f[i] == 'F' and f[i - 1] == 'S':\r\n# sf += 1\r\n\r\n#print('YES' if sf > fs else 'NO')\r\n\r\nprint('YES' if f[0] == 'S' and f[-1] == 'F' else 'NO')", "n=int(input())\r\nf=list(str(input()))\r\nv=0\r\nfor i in range(n-1):\r\n if f[i]!=f[i+1]:\r\n if f[i]=='S':v+=1\r\n else:v-=1\r\nif v>0:print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nstring = str(input())\r\n# var1 = [x for x in input().split(' ')]\r\n\r\n\r\n# lines = []\r\n# for i in range(q):\r\n# line = int(input())\r\n# if line:\r\n# lines.append(line)\r\n# else:\r\n# break\r\nnew = []\r\n\r\nfor i in string:\r\n if i == 'F':\r\n new.append(1)\r\n else:\r\n new.append(0)\r\n\r\nF = 0\r\nS = 0\r\n\r\nfor i in range(1, n):\r\n if (new[i] - new[i-1]) < 0:\r\n F += 1\r\n elif (new[i] - new[i-1]) > 0:\r\n S += 1\r\nif F < S:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\n\n_ = sys.stdin.readline()\ns = sys.stdin.readline()\n\n\ndef comparator(x, y):\n if x == \"F\" and y == \"S\":\n return -1\n elif x == \"S\" and y == \"F\":\n return 1\n else:\n return 0\n\n\nprint(\"YES\" if sum(map(lambda t: comparator(t[0], t[1]), zip(s, s[1:]))) > 0 else \"NO\")\n", "t=int(input())\r\nn=input()\r\ns=0\r\nf=0\r\nif( n.count('F')==t or n.count('S')==t):\r\n print(\"NO\")\r\nelse:\r\n for i in range(1,t):\r\n if n[i]=='S' and n[i-1]=='F':\r\n s=s+1\r\n elif(n[i]=='F' and n[i-1]=='S'):\r\n f=f+1\r\n if(f>s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\nprint(['NO','YES'][s.count('SF')>s.count('FS')])", "n = int(input())\r\nmy_str = input()\r\nfrom_s_to_f, from_f_to_s = 0, 0\r\nfor i in range(1, len(my_str)):\r\n if my_str[i] == 'F' and my_str[i-1] == 'S':\r\n from_s_to_f += 1\r\n if my_str[i] == 'S' and my_str[i-1] == 'F':\r\n from_f_to_s += 1\r\nif from_s_to_f > from_f_to_s:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n1=int(input())\r\ns=input()\r\nn=[]\r\nfor i in s:\r\n n.append(i)\r\ncount,count1=0,0\r\nfor i in range(len(n)-1):\r\n if n[i]=='S' and n[i+1]=='F':\r\n count+=1\r\n elif n[i+1]=='S' and n[i]=='F':\r\n count1+=1\r\nif count>count1:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "t = int(input())\r\na = input()\r\nSF = 0\r\nFS = 0\r\nfor i in range(1, t):\r\n if a[i - 1] == 'S' and a[i] == 'F':\r\n SF += 1\r\n elif a[i - 1] == 'F' and a[i] == 'S':\r\n FS += 1\r\nif SF > FS:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nb=input()\r\ns=b.count('SF')\r\nf=b.count('FS')\r\nif s>f:\r\n print('YES')\r\nelse:\r\n print('NO')", "N = int(input())\r\nword = input()\r\n\r\ncountsf = word.count('SF')\r\ncountfs = word.count('FS')\r\n\r\nif countsf > countfs:\r\n print('YES')\r\nelse:\r\n print('NO')", "days = int(input())\nflights = input()\n\nseattle_to_san_francisco = 0\nsan_francisco_to_seattle = 0\n\nfor i in range(days - 1):\n if flights[i] == 'S' and flights[i + 1] == 'F':\n seattle_to_san_francisco += 1\n\n if flights[i] == 'F' and flights[i + 1] == 'S':\n san_francisco_to_seattle += 1\n\nif seattle_to_san_francisco > san_francisco_to_seattle:\n print('YES')\nelse:\n print('NO')", "n = input()\r\nlst = list( input() )\r\n\r\nfrontier = lst[0]\r\nfromSan = 0\r\nfromSea = 0\r\n\r\nfor char in lst:\r\n if char != frontier:\r\n if frontier == 'F':\r\n fromSan += 1\r\n else:\r\n fromSea += 1\r\n \r\n frontier = char\r\n\r\nprint(\"YES\" if fromSea > fromSan else \"NO\")", "n=int(input())\r\ns=input()\r\nsf=0\r\nfs=0\r\nfor i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n sf+=s[i]==\"S\"\r\n fs+=s[i]==\"F\"\r\n\r\nprint(\"YNEOS\"[sf<=fs::2])\r\n", "n=int(input())\r\na=input()\r\nc1=0\r\nc2=0\r\nfor i in range(n-1):\r\n\tif a[i]=='S'and a[i+1]=='F':\r\n\t\tc1+=1\r\n\t\r\n\tif a[i]=='F'and a[i+1]=='S':\r\n\t\tc2+=1\r\nif c1>c2:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "num = int(input())\r\nlist = []\r\nlist = input()\r\nstr = []\r\nfor n in range(0,num):\r\n\tstr.append(list[n])\r\nif num==1:\r\n\tprint(\"no\")\r\nelse:\r\n\tcount = 0\r\n\tfor m in range(0,num-1):\r\n\t\tif str[m] == 'F':\r\n\t\t\tif str[m+1] == 'S':\r\n\t\t\t\tcount = count - 1\r\n\t\telse:\r\n\t\t\tif str[m+1] == 'F':\r\n\t\t\t\tcount = count + 1\r\n\tif count>0:\r\n\t\tprint(\"yes\")\r\n\telse:\r\n\t\tprint(\"no\")", "n=int(input())\r\nstring=input()\r\nf=0\r\ns=0\r\ni=0\r\nwhile i<n-1:\r\n if(string[i]==\"F\" and string[i+1]==\"S\"):\r\n f+=1;\r\n elif(string[i]==\"S\" and string[i+1]==\"F\"):\r\n s+=1\r\n i+=1\r\nif(s>f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nSF = str(input())\r\nSF_start = str(SF[0])\r\ni = SF_start\r\nfor i in range(0, n):\r\n if SF[i] == SF_start:\r\n continue\r\n else:\r\n SF_start = SF[i]\r\nif SF_start != SF[0] and SF[0]=='S':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n\tn = int(input())\n\tx = [i for i in input()]\n\tresult =0\n\tfor i in range(1,n):\n\t\tif x[i-1]=='S' and x[i] =='F':\n\t\t\tresult+=1\n\t\tif x[i-1]=='F' and x[i] =='S':\n\t\t\tresult-=1\t\n\tif result>0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nif __name__ == '__main__':\n\tmain()\n", "input()\na=input().lower()\nprint(\"YES\" if (a.count(\"sf\"))>(a.count(\"fs\")) else \"no\")\n#print(string.count(\"fs\"))\n#print(string.count(\"sf\"))\n", "x = int(input())\r\nl = list(input())\r\ns = 0\r\nf = 0\r\nfor i in range(1,len(l)):\r\n if l[i-1]==\"S\" and l[i]==\"F\":\r\n f+=1\r\n if l[i]==\"S\" and l[i-1]==\"F\":\r\n s+=1\r\nif f>s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\ndays = list(input())\n\ns_to_sf = 0\nsf_to_s = 0\n\nfor i in range(1, len(days)):\n if days[i-1] == 'S' and days[i] == 'F':\n s_to_sf += 1\n elif days[i-1] == 'F' and days[i] == 'S':\n sf_to_s += 1\n\nif s_to_sf > sf_to_s:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "# https://codeforces.com/problemset/problem/867/A\r\n\r\ninput()\r\ns = input()\r\n\r\n# SF = travel Seattle to San Francisco\r\n# FS = travel San Francisco to Seattle\r\n\r\nprint('YES' if s.count('SF') > s.count('FS') else 'NO')\r\n", "n= int(input())\ns=input()\ncount_sf=0\ncount_fs =0\nfor i in range(1,n):\n if s[i]=='F' and s[i-1]=='S':\n count_sf+=1\n if s[i]=='S' and s[i-1]=='F':\n count_fs+=1\nif count_sf>count_fs:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "a=int(input())\r\nb=str(input ())\r\nif b[:1]==\"S\" and b [-1:]==\"F\":\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "n=int(input())\r\nk=list(input())\r\nflag=0\r\ncount=0\r\nfor i in range(n-1):\r\n\tif k[i]==k[i+1]:\r\n\t\tcontinue\t\r\n\telif k[i]!=k[i+1]:\r\n\t\tif k[i]==\"F\":\r\n\t\t\tflag+=1\r\n\t\telse:\r\n\t\t\tcount+=1\t\r\nif count>flag:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "n=int(input())\r\na=input()\r\nk1 = 0\r\nk2 = 0\r\nfor i in range(0, n-1):\r\n if a[i] == 'S' and a[i+1]=='F':\r\n k1+=1\r\n if a[i] == 'F' and a[i + 1] == 'S':\r\n k2 += 1\r\nif k1>k2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\nn = int(n)\nd = input()\ncounter = 1\ngdeya = d[0]\nvteplo = 0\nvholod = 0\nwhile counter < n :\n if d[counter] != gdeya :\n if gdeya == 'F' :\n vholod = vholod + 1\n else :\n vteplo = vteplo + 1\n gdeya = d[counter]\n counter = counter + 1\nif vteplo > vholod :\n print('YES')\nelse :\n print('NO')\n\n \n \n \n \n\n ", "n = int(input())\r\nm = input()\r\ns = 0\r\nf = 0\r\nfor i in range(n-1):\r\n\tif m[i] == \"S\" and m[i + 1] == \"F\":\r\n\t\ts += 1\r\n\telif m[i] == \"F\" and m[i + 1] == \"S\":\r\n\t\tf += 1\r\nif s > f:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\ncities = input()\r\n\r\nprint(('NO', 'YES')[cities[0] == 'S' and cities[-1] == 'F'])\r\n", "n = int(input())\r\ns = input()\r\nsf=so=0\r\n\r\nfor i in range(n-1):\r\n if (s[i] == s[i+1]):\r\n continue\r\n elif(s[i]=='S' and s[i+1]=='F'):\r\n sf+=1\r\n else:\r\n so+=1\r\nif(sf>so):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nplc = input()\nsf, fs = 0, 0\nfor i in range(1, n):\n\tif plc[i - 1] == 'S' and plc[i] == 'F': sf += 1\n\tif plc[i - 1] == 'F' and plc[i] == 'S': fs += 1\nif sf > fs: print('YES')\nelse: print('NO')\n \t\t \t \t \t \t \t \t\t \t\t \t\t", "n = int(input())\r\na = input()\r\nFS = a.count(\"FS\")\r\nSF = a.count(\"SF\")\r\nif SF > FS:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "t=int(input())\r\ns=input()\r\ny=0\r\nn=0\r\nfor i in range(t-1):\r\n if s[i]==\"S\" and s[i+1]==\"F\":\r\n y=y+1\r\n elif s[i]==\"F\" and s[i+1]==\"S\":\r\n n=n+1\r\nif y>n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isFlewMoreTimesFromSeattleToSanFrancisco(numberOfDays,flights):\r\n sToF=0\r\n others=0\r\n previous=flights[0]\r\n for x in range(1,len(flights)):\r\n if previous == 's' and flights[x] == 'f':\r\n sToF= sToF+1\r\n elif previous == 'f' and flights[x] =='s':\r\n others = others+1\r\n previous = flights[x]\r\n if sToF > others:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\nnumberOfDays = int(input())\r\nflights = input().lower()\r\nisFlewMoreTimesFromSeattleToSanFrancisco(numberOfDays,flights)\r\n", "n = int(input())\ndays = input()\n\nseattle_to_sf = 0\nsf_to_seattle = 0\n\nfor i in range(n - 1):\n if days[i] == 'S' and days[i+1] == 'F':\n seattle_to_sf += 1\n elif days[i] == 'F' and days[i+1] == 'S':\n sf_to_seattle += 1\n\nif seattle_to_sf > sf_to_seattle:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "input()\r\nX = input()\r\nprint(\"YES\" if X.count(\"SF\") > X.count(\"FS\") else \"NO\")\r\n#Mehrdad Hassanzadeh when seeing someone using JAVA for accepting codeforces problems", "n = int(input())\r\ns = input()\r\n\r\nYes = 0\r\nNo = 0\r\n\r\nfor i in range(1, len(s)):\r\n if s[i]!=s[i-1]:\r\n if s[i]=='S':\r\n No += 1\r\n else:\r\n Yes += 1\r\nif Yes>No:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\nl=list(s)\r\ncout=0\r\ncout2=0\r\nfor i in range(len(l)-1):\r\n c1=l[i]\r\n c2=l[i+1]\r\n if c1=='S' and c2=='F' :\r\n cout=cout+1\r\n if c1=='F' and c2=='S' :\r\n cout2=cout2+1\r\n\r\nif cout>cout2:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "length, tour = input(), input()\r\nprint('YES' if tour.count('SF') > tour.count('FS') else 'NO')", "num = int(input())\r\nflight = input()\r\ns_f = 0\r\nf_s = 0\r\nfor i in range(1, len(flight)):\r\n if flight[i] == 'F' and flight[i - 1] == 'S':\r\n s_f += 1\r\n elif flight[i] == 'S' and flight[i - 1] == 'F':\r\n f_s += 1\r\nif f_s < s_f:\r\n print(\"YES\")\r\nelif f_s > s_f:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "foul_number = int(input())\r\nstring = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(foul_number-1):\r\n if string[i] == 'S' and string[i+1] == 'F':\r\n sf += 1\r\n elif string[i] == 'F' and string[i+1] == 'S':\r\n fs += 1\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n ns = 0\r\n nf = 0\r\n n = int(input())\r\n s = input()\r\n for i in range(n):\r\n if i:\r\n if s[i-1] == 'S' and s[i] == 'F':\r\n nf += 1\r\n if s[i-1] == 'F' and s[i] == 'S':\r\n ns += 1\r\n if nf > ns:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def split(word):\r\n return [char for char in word]\r\nn = int(input())\r\ncity = input()\r\ncity = split(city)\r\nstof = 0\r\nftos = 0\r\nfor i in range(n - 1):\r\n if (city[i] == \"F\") and (city[i + 1] == \"S\"):\r\n ftos += 1\r\n elif (city[i] == \"S\") and (city[i + 1] == \"F\"):\r\n stof += 1\r\n else:\r\n continue\r\nif stof > ftos:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nq = 0\r\np = 0\r\ny = []\r\nw = input()\r\nfor i in range(0, a):\r\n y.append(w[i])\r\nfor u in range(0, a - 1):\r\n if y[u] == 'S' and y[u + 1] == 'F':\r\n q = q + 1\r\n elif y[u] == 'F' and y[u + 1] == 'S':\r\n p = p + 1\r\nif q > p:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n = int(input())\r\ns = input()\r\nprint(\"NYOE S\"[s.count(\"SF\")>s.count(\"FS\")::2])", "# https://codeforces.com/problemset/problem/867/A\r\n\r\nn = int(input())\r\n\r\ns_f = f_s = 0\r\n\r\nstring = input()\r\n\r\nfor i in range(1, n):\r\n if string[i - 1] == \"S\" and string[i] == \"F\":\r\n s_f += 1\r\n\r\n if string[i - 1] == \"F\" and string[i] == \"S\":\r\n f_s += 1\r\n\r\nif s_f > f_s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nh = str(input())\r\na = 0\r\nb = 0\r\nfor i in range (n-1):\r\n if h[i] == \"S\" and h[i+1] == \"F\":\r\n a+=1\r\n elif h[i] == \"F\" and h[i+1] == \"S\":\r\n b+=1\r\nif max(a, b) == a and a!=b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "int(input())\r\ncnt1 = cnt2 = 0 \r\ns = input()\r\nfor i in range(len(s)-1):\r\n if s[i] == \"F\" and s[i+1] == \"S\":\r\n cnt1 += 1\r\n elif s[i] == \"S\" and s[i+1] == \"F\":\r\n cnt2 += 1\r\n \r\nif cnt2 > cnt1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\ns=input()\nprint(\"YES\" if s.count('SF') > s.count('FS') else \"NO\")", "n = map(int,input())\nst = input()\n\nsf = st.count(\"SF\")\nfs = st.count(\"FS\")\n\nif(sf > fs):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "int(input());k=input();print(\"YES\" if k.count(\"SF\")>k.count(\"FS\") else \"NO\")", "length = input()\r\ndays = str(input())\r\ni = 0\r\nstatus = days[0]\r\nn = 0\r\nfor i in days:\r\n if i != status and i == 'F':\r\n n += 1\r\n elif i != status and i == 'S':\r\n n -= 1\r\n status = i\r\n\r\nif n > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input()\nfromS = fromF = 0\nfor i in range(n - 1):\n if s[i] == 'S' and s[i + 1] == 'F':\n fromS += 1\n elif s[i] == 'F' and s[i + 1] == 'S':\n fromF += 1\nif fromS > fromF:\n print('YES')\nelse:\n print('NO')\n", "p=int(input())\r\nq=input()\r\nx=0\r\ny=0\r\n\r\nprev=q[0]\r\nfor curr in q[1:]:\r\n if prev=='S' and curr=='F':\r\n x+=1\r\n elif prev=='F' and curr=='S':\r\n y+=1\r\n prev=curr\r\n\r\nif x>y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = int(input())\r\np = input()\r\n\r\nsea = 0\r\nfran = 0\r\n\r\nfor i in range(len(p)-1):\r\n\tif p[i] != p[i+1] and p[i+1] == \"S\":\r\n\t\tsea +=1\r\n\tif p[i] != p[i+1] and p[i+1] == \"F\":\r\n\t\tfran +=1\r\n\r\nif fran > sea:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "x=int(input())\nj=input()\nh=0\nl=0\nfor i in range(x-1):\n if j[i]==\"F\" and j[i+1]==\"S\":\n h+=1\n elif j[i]==\"S\" and j[i+1]==\"F\":\n l+=1\nif h>l or h==l:\n print(\"NO\")\nelse:\n print(\"YES\")\n \n \n", "a = int(input())\nb = input()\nx, y = 0, 0\nfor i in range(a - 1):\n if b[i] == \"S\" and b[i + 1] == \"F\":\n x += 1\n elif b[i] == \"F\" and b[i + 1] == \"S\":\n y += 1\nif x > y:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\nk=input()\r\nsf=0\r\nfs=0\r\nif len(set(k))==1:\r\n print(\"NO\")\r\nelse:\r\n for i in range(n-1):\r\n if k[i]==\"S\" and k[i+1]==\"F\":\r\n sf+=1\r\n elif k[i]==\"F\" and k[i+1]==\"S\":\r\n fs+=1\r\n\r\n if sf>fs:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\ns = 0\nf = 0\nx = input()\nfor i in range(n - 1):\n if x[i] == \"F\" and x[i+1] == \"S\":\n s += 1\n elif x[i] == \"S\" and x[i+1] == \"F\":\n f += 1\n\nif f > s:\n print(\"YES\")\nelse:\n print(\"NO\")", "input()\r\ns = input()\r\n \r\nprint(['NO', 'YES'][s[0] == 'S' and s[-1] == 'F'])\r\n", "total_days = int(input())\r\ndays = input()\r\n\r\nprevious_day = days[0]\r\n\r\nflight_counts = {\r\n 'S': 0,\r\n 'F': 0\r\n}\r\n\r\nfor i in range(1, total_days):\r\n if days[i] is not previous_day:\r\n flight_counts[days[i]] = flight_counts[days[i]] + 1\r\n previous_day = days[i]\r\n\r\nif flight_counts['F'] > flight_counts['S']:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\na = input()\r\nsf = 0\r\nfs = 0\r\np = 0\r\nfor i in range(2, n + 2):\r\n if a[p:i] == 'SF':\r\n sf += 1\r\n elif a[p:i] == 'FS':\r\n fs += 1\r\n p += 1\r\nif sf > fs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nn1=input()\r\nif(n1.count('SF')>n1.count('FS')):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nshed = str(input())\r\nToS = 0\r\nToF= 0\r\nfor i in range(len(shed)-1):\r\n if(shed[i] == 'S' and shed[i+1] == 'F'):\r\n ToF += 1\r\n if(shed[i] == 'F' and shed[i+1] == 'S'):\r\n ToS += 1\r\nif(ToF > ToS):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ncity = list(input())\r\n\r\nyes_count = 0\r\nno_count = 0\r\n\r\nfor i in range(1, n):\r\n\r\n\tif city[i - 1] == \"F\" and city[i] == \"S\":\r\n\t\tno_count += 1\r\n\t\r\n\telif city[i - 1] == \"S\" and city[i] == \"F\":\r\n\t\tyes_count += 1\r\n\r\nif yes_count > no_count:\r\n\tprint(\"YES\")\r\n\r\nelif yes_count <= no_count:\r\n\tprint(\"NO\")\r\n", "\r\nn = int(input())\r\n\r\ns = input()\r\n\r\ns2 = s.count('SF')\r\ns3 = s.count('FS')\r\n\r\n#print(s2 , s3)\r\n\r\nif s2 > s3 :\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n\r\n", "n = int(input()); yes = 0\r\ndays = input()\r\nfor i in range(n-1):\r\n yes += 1 if days[i] == 'S' and days[i+1] == 'F' else 0\r\n yes -= 1 if days[i] == 'F' and days[i+1] == 'S' else 0\r\nif yes >= 1:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "import re\n\nn = int(input())\ns = input()\n\nSF = r'SF'\nFS = r'FS'\n\nif len(re.findall(SF, s)) > len(re.findall(FS, s)):\n print('YES')\nelse:\n print('NO')\n", "n = int(input())\r\ncity = str(input())\r\nif city[0] == \"S\" and city[len(city)-1] == \"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num = int(input())\r\ncities = input()\r\nscore = 0\r\nfor i in range(len(cities)-1):\r\n flight = cities[i:i+2]\r\n if flight == 'SF':\r\n score += 1\r\n elif flight == 'FS':\r\n score -= 1\r\nif score > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "m=int(input())\r\na = str(input())\r\nl = list(a)\r\nif l[0]==\"S\" and l[m-1]==\"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\nc = 0\r\nk = 0\r\nM = [i for i in s]\r\nfor i in range(n-1):\r\n if M[i] == 'S' and M[i + 1] == 'F':\r\n c = c + 1\r\n elif M[i] == 'F' and M[i + 1] == 'S':\r\n c = c - 1\r\nif c > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\ns=input()\r\ntry:\r\n sf=s.count(\"SF\")\r\nexcept:\r\n sf=0\r\ntry:\r\n fs=s.count(\"FS\")\r\nexcept:\r\n fs=0\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys,math\ninput=sys.stdin.readline\n\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\nn=int(input())\ns=input()\nif(s.count(\"SF\")>s.count(\"FS\")):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a = input()\r\na = input()\r\n\r\nif a.count(\"S\") == 0 | a.count(\"F\") == 0:\r\n print(\"NO\")\r\n exit(0)\r\nif a[0] == 'S' and a[-1] == 'F':\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "n=int(input())\r\ny=input()\r\nt=y.count(\"SF\")\r\nt1=y.count(\"FS\")\r\n\r\nif t>t1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\nx=s.count('SF')\r\ny=s.count('FS')\r\nif(x>y):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "# https://codeforces.com/problemset/problem/867/A\r\n\r\ndays = int(input())\r\n\r\nc1 = 0\r\nc2 = 0\r\n\r\nflights = input()\r\n\r\nfor i in range(len(flights)-1):\r\n if flights[i] == 'F' and flights[i+1] == 'S':\r\n c1 += 1\r\n elif flights[i] =='S' and flights[i+1] == 'F':\r\n c2 += 1\r\n \r\nif c1>c2:\r\n print('NO')\r\nelif c1 == c2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(x):\r\n\tprint()\r\n\tfor s in x:\r\n\t\tprint(s)\r\n\r\ndef solve():\r\n\tn = int(input())\r\n\ts = input()\r\n\tif s.count(\"SF\") > s.count(\"FS\"):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\nsolve()", "n=int(input())\r\ns=input()\r\nX=0\r\nY=0\r\nfor i in range(1,n):\r\n if s[i]=='F' and s[i-1]=='S':\r\n X += 1\r\n elif s[i]=='S' and s[i-1]=='F':\r\n Y += 1\r\nif X>Y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "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\ts = input()\r\n\t\tresult = []\r\n\t\tlength = len(s)\r\n\t\tsf, fs = 0, 0\r\n\r\n\t\tfor j in range(length - 1):\r\n\t\t\tif s[j] == 'S' and s[j+1] == 'F':\r\n\t\t\t\tsf += 1\r\n\t\t\telif s[j] == 'F' and s[j+1] == 'S':\r\n\t\t\t\tfs += 1\r\n\r\n\t\tif sf > fs:\r\n\t\t\tresult.append(\"YES\")\r\n\t\telse:\r\n\t\t\tresult.append(\"NO\")\r\n\r\n\t\tfor x in result:\r\n\t\t\tprint(x)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "import sys\r\n\r\nfor s in sys.stdin:\r\n string = str(input())\r\n if string.count(\"SF\") > string.count(\"FS\"):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = int(input())\r\nb = str(input())\r\nk=0\r\nf=0\r\ni=0\r\nfor i in range (0,a-1) :\r\n if b[i] != b[i+1] and b[i] == \"S\" :\r\n k = k+1\r\n if b[i] != b[i+1] and b[i] == \"F\" :\r\n f = f+ 1\r\nif k > f :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nsp = input()\r\nSF = sp.count('SF')\r\nFS = sp.count('FS')\r\nif SF>FS:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = int(input())\r\nb = str(input())\r\nc = [*b]\r\ni = 0\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nwhile i < a-1:\r\n if c[i] == 'F' and c[i+1] == 'S':\r\n count1 = count1 + 1\r\n i = i + 1\r\n elif c[i] == 'S' and c[i+1] == 'F':\r\n count2 = count2 + 1\r\n i = i + 1\r\n else:\r\n i = i + 1\r\n\r\nif count2 > count1:\r\n print('YES')\r\nelse:\r\n print('NO')", "num = int(input())\nstring = input()\n\ncount = 0\nfor i in range(len(string)-1):\n if string[i] != string[i+1]:\n if string[i] == 'S':\n count +=1\n else:\n count -= 1\nif(count>0):\n print(\"YES\")\nelse:\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"Untitled2.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YJXlpE-tdxluyBiM0PtODA3gu43Bbpl0\n\"\"\"\n\nx = int(input())\ny = input()\nkolvo = 0\nfor z in range(x-1):\n if y[z] != y[z+1]:\n if y[z] == \"F\":\n kolvo += -1\n else:\n kolvo += 1\nif kolvo >= 1:\n print (\"YES\")\nelse:\n print ('NO')\n\n", "number = input('')\r\nairport = input('')\r\n\r\nif airport[0] == 'S' and airport[-1] == 'F':\r\n print('YES')\r\nelse:\r\n print('NO')", "input()\r\ns = list(input())\r\nc, d = 0, 0\r\nfor i in range(len(s) - 1):\r\n if(s[i] == 'F' and s[i + 1] == 'S'):\r\n c += 1\r\n elif(s[i] == 'S' and s[i + 1] == 'F'):\r\n d += 1\r\n else:\r\n continue\r\nif(d > c):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nplaces = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(1, n):\r\n if places[i] == 'F' and places[i - 1] == 'S':\r\n count1 += 1\r\n elif places[i] == 'S' and places[i - 1] == 'F':\r\n count2 += 1\r\nif count1 > count2:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\na = list(map(str, input()))\n\nc1 = 0\nc2 = 0\n\nfor i in range(n-1):\n if a[i] == 'S' and a[i+1] == 'F':\n c1 += 1\n\n elif a[i] == 'F' and a[i+1] == 'S':\n c2 += 1\n\nif c1 > c2:\n print('YES')\n\nelse:\n print('NO')", "def rahul(word):\r\n return[char for char in word]\r\n\r\na=int(input())\r\nb=rahul(input())\r\nc=list()\r\nd=0\r\nr=0\r\nwhile r<(a-1):\r\n if b[r]!=b[r+1]:\r\n c.append(1)\r\n r=r+1\r\nr=0\r\nwhile r<len(c):\r\n d=d+c[r]\r\n r=r+2\r\nif d>(len(c)-d):\r\n if b[0]=='S':\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif d==(len(c)-d):\r\n print('NO')\r\nelse:\r\n if b[0]=='S':\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "n=int(input())\r\nstr=input()\r\ncountw=0\r\ncountl=0\r\nfor i in range(n):\r\n if(str[i:i+2]=='SF'):\r\n countw+=1\r\n elif(str[i:i+2]=='FS'):\r\n countl+=1\r\nif(countw>countl):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nc = 0\r\nfor i in range(2,n+2):\r\n\tif s[i-2:i] == 'SF':\r\n\t\tc +=1\r\n\telif s[i-2:i] == 'FS':\r\n\t\tc -=1\r\nif c > 0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\nposition = input()\n\nprint('YES' if position.count('SF') > position.count('FS') else 'NO')\n\n", "_ = int(input())\nflights = str(input())\nprint( \"YES\" if flights.count(\"SF\") > flights.count(\"FS\") else \"NO\")\n \t \t\t \t\t \t \t\t \t\t \t\t", "n=int(input())\r\na = input()\r\nprint((\"YES\", \"NO\")[a.count('FS') >= a.count('SF')])", "n=int(input())\r\nl=input()\r\nsf=l.count('SF')\r\nfs=l.count('FS')\r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ns = str(input())\r\n\r\nnot_res = 0\r\nres = 0\r\n\r\nfor i in range(len(s)):\r\n if i+1 < len(s):\r\n if s[i] == \"S\" and s[i+1] == \"F\":\r\n res += 1\r\n elif s[i] == \"F\" and s[i+1] == \"S\":\r\n not_res += 1\r\nprint(\"YES\" if res > not_res else \"NO\")", "n=input()\r\ns=input()\r\ns1=s\r\ns2=s\r\nSF=0\r\nFS=0\r\n\r\nwhile s1.find('SF')!=-1:\r\n pos=s1.find('SF')\r\n SF=SF+1\r\n s1=s1[pos+1:]\r\n\r\nwhile s2.find('FS')!=-1:\r\n pos=s2.find('FS')\r\n FS=FS+1\r\n s2=s2[pos+1:]\r\n\r\nif SF>FS:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "input()\r\na=input()\r\nprint('NYOE S'[a[0]=='S'and a[-1]=='F'::2])", "q = int(input())\r\ninp = input()\r\nc = 0\r\n\r\nfor i in range(1, q):\r\n if (inp[i] != inp[i-1]):\r\n if (inp[i] == \"F\"):\r\n c += 1\r\n else:\r\n c -= 1\r\n\r\nif (c > 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\nstring = input()\r\nprint(\"YES\" if(string.count(\"SF\") > string.count(\"FS\")) else \"NO\")", "n=int(input())\r\nstr=input()\r\ni=0\r\nj=0\r\nfor c in range(0,n-1):\r\n if str[c]=='S' and str[c+1]=='F':\r\n i+=1\r\n elif str[c]=='F' and str[c+1]=='S':\r\n j+=1\r\n else:\r\n continue\r\nprint([\"NO\",\"YES\"][i>j])", "N = int(input())\r\ndays = str(input())\r\nif days[0]+days[-1] == 'SF':\r\n print('YES')\r\nelse :\r\n print('NO')", "a=int(input())\r\nq=input()\r\ncountSF,countFS=0,0\r\nfor i in range(len(q)-1):\r\n if q[i]=='S' and q[i+1]=='F':\r\n countSF+=1\r\n elif q[i]=='F' and q[i+1]=='S':\r\n countFS+=1\r\nif countSF>countFS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\ndic = {'S':0,'F':0}\r\nfor i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n dic[s[i+1]]+=1\r\nif dic['F']>dic['S']:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ncities = input()\r\nprint(\"YES\" if 'S' == cities[0] and 'S' != cities[n-1] else \"NO\")\r\n", "n=int(input())\r\nst=input()\r\nsf=0\r\nfs=0\r\nfor i in range(n-1):\r\n if st[i]==\"S\" and st[i+1]==\"F\":\r\n sf+=1\r\n elif st[i]==\"F\" and st[i+1]==\"S\":\r\n fs+=1\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nif s[0]==\"S\" and s[-1]==\"F\":print(\"YES\")\r\nelse:print(\"NO\")", "n = int(input())\nst = input()\nif (st.count('SF') > st.count('FS')):\n print(\"YES\")\nelse:\n print(\"NO\")", "k=int(input())\r\na=input()\r\nb=a.count(\"FS\")\r\nc=a.count(\"SF\")\r\nif c>b:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\nc=input()\r\nk=c.count('SF')\r\nl=c.count('FS')\r\nif k>l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\na=input()\r\nb=a.split(\"FS\")\r\na=a.split(\"SF\")\r\nif(len(a)>len(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\ny=input()\r\nl=k=0\r\nfor n in range(len(y)-1):\r\n\tif y[n]=='F' and y[n+1]=='S':\r\n\t\tl+=1\r\n\telif y[n]=='S' and y[n+1]=='F':\r\n\t\tk+=1\r\nif k>l:\r\n\tprint('YES')\r\n\t\r\nelse:\r\n\tprint('NO')\r\n\t", "def count(s,n):\r\n ctr=0\r\n ctr_1=0\r\n for i in range(n-1):\r\n if s[i]+s[i+1]=='FS' :\r\n ctr+=1\r\n elif s[i]+s[i+1]=='SF':\r\n ctr_1+=1 \r\n \r\n if ctr_1>ctr:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nn=input()\r\nn=int(n)\r\ns=input()\r\ncount(s,n)", "a = int(input())\nn = input()\np = 0 \nw = 0\n\nfor i in range(a - 1):\n if n[i] == 'S' and n[i+1] == 'F':\n p = p + 1\n if n[i] == 'F' and n[i+1] == 'S':\n w = w + 1\nif p > w:\n print('YES')\nelse: \n print('NO')", "# import sys\r\n# sys.stdin=open('input.in','r')\r\n# sys.stdout=open('output.out','w')\r\nn=int(input())\r\ns=input()\r\nsf=s.count('SF')\r\nfs=s.count('FS')\r\nif sf>fs:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\ninp, t = [x for x in str(input())], []\r\n\r\nfor i in range(n-1):\r\n if inp[i] != inp[i+1]:\r\n if inp[i] == 'S':\r\n t.append(1)\r\n else:\r\n t.append(-1)\r\n\r\nif sum(t) > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = input()\r\nwhile True:\r\n n = len(a)\r\n b = a.replace(\"SS\", \"S\").replace(\"FF\", \"F\")\r\n m = len(b)\r\n a = b\r\n if n == m:\r\n break\r\nres = 0\r\nfor i in range(len(a)-1):\r\n if a[i] == \"S\" and a[i+1] == \"F\":\r\n res += 1\r\nprint(\"YES\" if res > len(a)-1-res else \"NO\")\r\n", "n=int(input())\r\ns=input()\r\nsd=fd=0\r\nfor i in range(n-1):\r\n\tif s[i]==\"S\":\r\n\t\tif s[i+1]==\"F\":\r\n\t\t\tsd+=1\r\n\telse:\r\n\t\tif s[i+1]==\"S\":\r\n\t\t\tfd+=1\r\nif sd>fd:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\nn = int(input())\r\n\r\nstring = list(input())\r\n\r\ncount = 0\r\nchage = 0\r\nfor i in range(0,n-1):\r\n if string[i] == \"S\" and string[i+1] == \"F\":\r\n chage += 1\r\n elif string[i] == \"F\" and string[i+1] == \"S\":\r\n count+=1\r\nif chage>count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = input()\r\nif a.count('F') == len(a):\r\n print(\"NO\")\r\nelif a.count(\"SF\")>a.count(\"FS\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input()\ns = list(input())\nprev = s[0]\ntoS = 0\ntoF = 0\nfor i in range(1, len(s)):\n if s[i] == 'F' and s[i-1] == 'S':\n toF += 1\n elif s[i] == 'S' and s[i-1] == 'F':\n toS += 1\nprint('YES' if toF > toS else 'NO')\n \n", "n=int(input())\r\nf=0\r\na=input()\r\nfor i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n if a[i]==\"F\":\r\n f+=1\r\n else:\r\n f-=1\r\nif f>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\na=s.count('SF')\r\nb=s.count('FS')\r\nif a>b:\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")\r\n", "a = []\r\n\r\nn = int(input())\r\na = str(input())\r\ncount = countf = 0\r\nx=n\r\n\r\nif(2<=n and n<=100 and len(a)==n):\r\n for i in range(n-1):\r\n if(a[i]=='S'):\r\n q = i + 1\r\n if(a[q]=='F'):\r\n count = count + 1\r\n else:continue\r\n else:continue\r\n \r\n for i in range(n-1):\r\n if(a[i]=='F'):\r\n r = i + 1\r\n if(a[r]=='S'):\r\n countf = countf + 1\r\n else:continue\r\n else:continue\r\n \r\n if(count>countf):print('YES')\r\n else: print('NO')", "a,b = int(input()),input()\r\nprint('YES' if b.count('SF')> b.count('FS') else 'NO')", "n = int(input())\r\ns = input()\r\nyes, no = 0, 0\r\n\r\nfor i in range(1, n):\r\n if s[i] != s[i - 1]:\r\n if s[i] == 'F':\r\n yes += 1\r\n else:\r\n no += 1\r\n\r\nif yes > no:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ns = input()\r\n\r\nStoF = 0\r\nFtoS = 0\r\ncurrent = s[0]\r\nfor i in range(1,n):\r\n if current != s[i]:\r\n if s[i] == 'F': \r\n StoF += 1\r\n current = 'F'\r\n else: \r\n FtoS += 1\r\n current = 'S'\r\n\r\nif StoF > FtoS:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Apr 11 20:37:42 2020\r\n\r\n@author: Maciej\r\n\"\"\"\r\nn = int(input())\r\ncity = input()\r\ns2f = 0\r\nf2s = 0\r\nfor i in range(n - 1):\r\n if city[i] == 'S' and city[i+1] == 'F':\r\n s2f += 1\r\n elif city[i] == 'F' and city[i+1] == 'S':\r\n f2s += 1\r\nprint('YES' if s2f > f2s else 'NO')", "c=int(input())\r\ns=input()[:c]\r\nli=list(s)\r\n##print(li)\r\nwarm_flight,cold_flight,stay=0,0,0\r\nfor j in range(len(s)):\r\n k=j+1\r\n if(k==len(s)):\r\n break \r\n f1=li[j]\r\n f2=li[k] \r\n if(f1=='S' and f2=='F'):\r\n warm_flight+=1\r\n elif(f1=='F' and f2=='S'):\r\n cold_flight+=1\r\n elif(f1=='F' and f2=='F' or f1=='S' and f2=='S'):\r\n stay+=1\r\n \r\n##print(warm_flight,cold_flight)\r\nif(warm_flight>cold_flight):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nres = s.count(\"SF\") - s.count(\"FS\")\r\nif res > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\nif s[0]=='F':\r\n print('NO')\r\nelse:\r\n d=False\r\n for i in range(1,len(s)):\r\n if s[i-1]!=s[i]:d=not d\r\n if d:print('YES')\r\n else:print('NO')\r\n", "n=int(input())\r\ns=input()\r\nt=0\r\nans=0\r\nfor i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n t+=1\r\n if s[i]==\"S\":\r\n ans+=1\r\n t-=1\r\nif ans>t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nflights = input()\r\n\r\nx = 0\r\n\r\nfor i in range(len(flights)-1):\r\n if flights[i] == 'S' and flights[i+1] == 'F':\r\n x+=1\r\n if flights[i] == 'F' and flights[i+1] == 'S':\r\n x-=1\r\n\r\nif x > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "input()\ns = input()\nsf_count = 0\nfs_count = 0\nfor i in range(len(s) - 1):\n if s[i] == 'S' and s[i + 1] == 'F':\n sf_count += 1\n if s[i] == 'F' and s[i + 1] == 'S':\n fs_count += 1\nif sf_count > fs_count:\n print('YES')\nelse:\n print('NO')", "n = int(input())\ns = input()\nans = 0\nfor i in range(1,n):\n prev = s[i-1]\n curr = s[i]\n if prev == 'S' and curr == 'F':\n ans += 1\n elif prev == 'F' and curr == 'S':\n ans -= 1\nif ans > 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\ns = input()\na=0\nb=0\nfor i in range(1,n):\n if s[i]=='F' and s[i-1]=='S':\n a += 1\n elif s[i]!=s[i-1]:\n b += 1\nif a>b:\n print(\"YES\")\nelse:\n print(\"NO\")", "m=int(input())\r\nn=(input())\r\nx=0 \r\ny=0\r\nfor i in range(len(n)-1):\r\n if n[i] == \"S\" and n[i+1] == \"F\":\r\n x+=1\r\n \r\n if n[i] == \"F\" and n[i+1] == \"S\":\r\n y+=1\r\n \r\nif x>y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "useless = input()\r\ninp = input()\r\nif (inp.count('SF') > inp.count('FS')):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\ns = input()\ny = 0\nfor i in range(1, n):\n if s[i] != s[i - 1]:\n if s[i] == 'F':\n y += 1\n else:\n y -= 1\nif y > 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\ny=input()\r\nh=y.count('FS')\r\nk=y.count('SF')\r\nif k>h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n ", "i = int(input())\r\nt = str(input())\r\nj = 0\r\nfs = 0\r\nsf = 0\r\nwhile j < (i-1):\r\n a = t[j]\r\n b = t[j + 1]\r\n txt = \"\"+a+b\r\n if txt == \"FS\":\r\n fs += 1\r\n j += 1\r\n elif txt == \"SF\":\r\n sf += 1\r\n j += 1\r\n else:\r\n j += 1\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "sf, st = 0, 0\r\nn = int(input())\r\ns = input()\r\n\r\nc=s[0]\r\nfor i in s[1:]:\r\n if c != i:\r\n if i == 'S': st+=1\r\n else: sf+=1\r\n c=i\r\n\r\nif sf > st:print('YES')\r\nelse:print('NO')", "a=int(input())\r\nb=input()\r\ncount1=0\r\ncount2=0\r\nfor x in range(0,a-1):\r\n if(b[x]=='S' and b[x+1]=='F'):\r\n count1=count1+1\r\n elif(b[x]=='F' and b[x+1]=='S'):\r\n count2=count2 + 1\r\nif(count1>count2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nn = int(a)\r\n\r\nword = input()\r\n\r\nf = 0\r\ns = 0\r\n\r\nfor x in range(1,n):\r\n if word[x-1] == \"S\" and word[x] == \"F\":\r\n s = s+1\r\n elif word[x-1] == \"F\" and word[x] == \"S\":\r\n f = f+1\r\n\r\n\r\nif f >= s :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "days=input()\r\noffice=input()\r\nsf=office.count(\"SF\")\r\nfs=office.count(\"FS\")\r\nif sf>fs:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a = int(input())\r\n\r\nb = input()\r\n\r\ns = 0\r\nf = 0\r\n\r\nfor i in range(a - 1):\r\n if b[i] == 'F' and b[i + 1] == 'S':\r\n f += 1\r\n elif b[i] == 'S' and b[i + 1] == 'F':\r\n s += 1\r\n\r\nif s > f:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri May 28 19:45:26 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input()\r\nr = 0\r\nnr = 0\r\nfor i in range(n):\r\n if i + 1 < n:\r\n if s[i] == \"S\":\r\n if s[i + 1] == \"F\":\r\n r += 1\r\n elif s[i + 1] == \"S\":\r\n nr += 1\r\nif r > nr:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nfs = 0\r\nsf = 0\r\nfor i in range(n-1):\r\n if s[i] == \"F\" and s[i+1] == \"S\":\r\n fs += 1\r\n elif s[i] == \"S\" and s[i+1] == \"F\":\r\n sf += 1\r\n\r\nif fs >= sf:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "\r\n\r\n\r\n\r\nn = int(input())\r\nstring = input()\r\n\r\ns = 0\r\nf = 0\r\nfor i in range(n - 1):\r\n char1 = string[i]\r\n char2 = string[i+1]\r\n if (char1 == 'S' and char2 == 'F'):\r\n f += 1\r\n if (char1 == 'F' and char2 == 'S'):\r\n s += 1\r\n\r\nif (f > s):\r\n print ('YES')\r\nelse:\r\n print ('NO')", "t = int(input())\ndays = input()\nif days.count(\"SF\") > days.count(\"FS\"):print(\"YES\")\nelse:print(\"NO\")", "m=int(input())\r\nn=[*input()]\r\nx=0\r\ny=0\r\nfor i in range(len(n)-1):\r\n if n[i]==\"S\" and n[i+1]==\"F\":\r\n x+=1\r\n if n[i]==\"F\" and n[i+1]==\"S\":\r\n y+=1\r\nif x>y:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\npos=input()\r\n\r\nS=pos.count(\"SF\")\r\nF=pos.count(\"FS\")\r\nif S>F:\r\n print(\"YES\")\r\nelse:\r\n print(\"No\")", "n1 = int(input())\r\nstr1 = input()\r\n\r\ncount_sf = 0\r\ncount_other = 0\r\nfor i in range(len(str1)-1):\r\n if str1[i] + str1[i+1] == \"SF\":\r\n count_sf+=1\r\n elif str1[i]+str1[i+1] == \"FS\":\r\n count_other+=1\r\n \r\nif count_sf>count_other:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n, s = int(input()), input()\nres = \"YES\" if s.count(\"SF\") > s.count(\"FS\") else \"NO\"\nprint(res)\n", "numOfDays=int(input())\r\ntravelD=input()\r\n\r\ncounterSF=0\r\ncounterFS=0\r\nfor i in range(numOfDays-1):\r\n if travelD[i]==\"S\" and travelD[i+1]==\"F\":\r\n counterSF += 1\r\n if travelD[i] == \"F\" and travelD[i + 1] == \"S\":\r\n counterFS += 1\r\n\r\nif counterSF>counterFS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ntoS, toF = 0, 0\r\nstrk = input()\r\nfor i in range(n-1):\r\n if strk[i] != strk[i+1]:\r\n if strk[i+1] == 'F':\r\n toF += 1\r\n else:\r\n toS += 1 \r\nif toF > toS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input();s=input();print('NYOE S'[s[-1]!=s[0]=='S'::2])", "n = int(input())\r\nstr1 = str(input())\r\nF = 0\r\nS = 0\r\nfor i in range(1,n):\r\n if (str1[i-1] != str1[i]):\r\n if (str1[i-1]=='S'):\r\n S+=1\r\n else:\r\n F+=1\r\nif S>F:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n=int(input())\r\nk=input()\r\nc,d=0,0\r\nfor i in range(n):\r\n if i<n-1:\r\n if k[i]=='S' and k[i+1]=='F':\r\n c+=1\r\n if k[i]=='F' and k[i+1]=='S':\r\n d+=1\r\nif c>d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input()\na, b = 0, 0\nfor i in range(1, n):\n if s[i - 1] == 'S' and s[i] == 'F':\n a += 1\n elif s[i - 1] == 'F' and s[i] == 'S':\n b += 1\nif a > b:\n print('YES')\nelse:\n print('NO')", "n = input();\r\nn = int(n);\r\ns = input();\r\nflag1=0;\r\nflag2=0;\r\nfor i in range(n-1):\r\n if s[i] == 'S':\r\n if s[i]!=s[i+1]:\r\n flag1+=1;\r\n if s[i] == 'F':\r\n if s[i]!= s[i+1]:\r\n flag2+=1;\r\nif flag1>flag2:\r\n print(\"Yes\");\r\nelse:\r\n print(\"No\");\r\n ", "k = int(input())\r\nmas = list(input())\r\ni = 0\r\nSF = 0\r\nFS = 0\r\nwhile i < k - 1:\r\n if mas[i] == 'S' and mas[i + 1] == 'F':\r\n SF += 1\r\n if mas[i] == 'F' and mas[i + 1] == 'S':\r\n FS += 1\r\n i += 1\r\nif SF > FS:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\ns=input()\r\ns=s+\" \"\r\ns_f=0\r\nf_s=0\r\nfor i in range(n):\r\n if s[i]==\"S\" and s[i+1]==\"F\":\r\n s_f=s_f+1\r\n elif s[i]==\"F\" and s[i+1]==\"S\":\r\n f_s=f_s+1\r\nif s_f>f_s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\ncount = 0\r\nfor i in range(n-1):\r\n if(s[i] == 'S' and s[i+1] == 'F'):\r\n count += 1\r\n elif(s[i] == 'F' and s[i+1] == 'S'):\r\n count -= 1\r\nif(count > 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "x=int(input())\r\ny=input()\r\nf_to_s=0\r\nf_to_f=0\r\nfor i in range(x-1):\r\n if(y[i]!=y[i+1]):\r\n if(y[i]==\"S\"):\r\n f_to_f+=1\r\n else:\r\n f_to_s+=1\r\nif(f_to_f>f_to_s):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\n\ns = input()\n\na,b = 0,0\n\n\nfor i in range(0,len(s)-1):\n if s[i] == 'S' and s[i+1] == 'F':\n a += 1\n elif s[i] == 'F' and s[i+1] == 'S':\n b += 1\n\nif a > b:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "input()\r\nx = input()\r\ny = x[0]\r\nsi = 0\r\nsan = 0\r\nfor i in x:\r\n if i != y:\r\n y = i\r\n if i == 'F':\r\n san += 1\r\n else:\r\n si += 1\r\nif san>si:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nvisit = input()\r\nfrancis = 0\r\nseatle = 0\r\nfor i in range(0,n-1):\r\n if(visit[i]+visit[i+1] == 'SF'):\r\n francis += 1 \r\n elif(visit[i]+visit[i+1] == 'FS'):\r\n seatle += 1 \r\nif(seatle<francis):\r\n print('YES')\r\nelse:\r\n print('NO')", "_ = int(input())\r\ns = input()\r\n\r\nftos = 0\r\nstof = 0\r\n\r\np = s[0]\r\nfor c in s[1:]:\r\n if c != p:\r\n if c == 'F':\r\n stof += 1\r\n else:\r\n ftos += 1\r\n p = c\r\nprint(\"YES\" if stof > ftos else \"NO\")\r\n", "n = int(input())\r\ns = input()\r\nsf = s.count('SF')\r\nfs = s.count('FS')\r\nprint('YES' if sf > fs else 'NO')", "workdays = int(input())\nDayloc = input()\nif Dayloc.count('SF') > Dayloc.count('FS'):\n print('YES')\nelse:\n print('NO')", "n = int(input())\r\ns = list(input())\r\nsi = 0\r\nfr = 0\r\nfor i in range(1, n):\r\n\tif s[i] != s[i - 1]:\r\n\t\tif s[i] == 'S':\r\n\t\t\tfr += 1\r\n\t\telse:\r\n\t\t\tsi += 1\r\nif si > fr:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\narr = input()\r\nprint(\"YES\" if arr.count(\"SF\") > arr.count(\"FS\") else \"NO\")", "n=int(input())\r\nq=input()\r\na=list(q)\r\ns=0\r\nf=0\r\nfor i in range(1,len(q)):\r\n if a[i]==\"S\" and a[i-1]!=\"S\":\r\n s=s+1\r\n elif a[i]==\"F\" and a[i-1]!=\"F\":\r\n f=f+1\r\nif f>s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nb=input()\r\ncnt=0\r\nd=0\r\nfor i in range(a-1):\r\n \r\n if b[i]=='S' and b[i+1]=='F':\r\n cnt+=1\r\n elif b[i]=='F' and b[i+1]=='S':\r\n d+=1\r\nif cnt>d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import sys\r\n \r\nrd = sys.stdin.readline\r\n\r\nn = int(rd())\r\ns = rd().strip()\r\n\r\nif s.count('SF') > s.count(\"FS\"): print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n=int(input())\r\na=input()\r\nc1=0\r\nc2=0\r\nfor i in range (n-1):\r\n\tif a[i]=='S' and a[i+1]=='F':\r\n\t\tc1=c1+1\r\n\tif a[i]=='F' and a[i+1]=='S':\r\n\t \tc2=c2+1\r\n\r\nif c1>c2:\r\n\tprint(\"YES\")\r\nelse: \r\n\tprint(\"NO\")\r\n\r\n", "a=int(input())\r\ns=input()\r\nl=0\r\nr=0\r\ns=list(s)\r\nd=len(s)\r\nfor i in range(0,d-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n l+=1\r\n if s[i]=='F' and s[i+1]=='S':\r\n r+=1\r\nif l>r:\r\n print('Yes')\r\nelse:\r\n print('No')", "n = int(input())\r\nsf = str(input())\r\ni=0\r\nk=0\r\np=0\r\n\r\n# for i in range(len(sf)):\r\n# if sf[i] == \"S\" and sf[i+1] == \"F\":\r\n# k +=1\r\n# elif sf[i] == \"F\" and sf[i+1] == \"S\":\r\n# p += 1\r\n# if k>p:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\nwhile i < n-1:\r\n if sf[i] == \"S\" and sf[i+1] == \"F\":\r\n k +=1\r\n elif sf[i] == \"F\" and sf[i+1] == \"S\":\r\n p += 1\r\n i += 1\r\nif k>p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "noOfDays =input()\r\nnoOfDays = int(noOfDays)\r\nFlightsString = input()\r\nStoF,FtoS = 0,0\r\n\r\nfor x in range(1,noOfDays):\r\n \r\n if FlightsString[x] == FlightsString[x-1] :\r\n continue\r\n elif FlightsString[x] == 'S':\r\n FtoS += 1\r\n else:\r\n StoF += 1\r\n\r\nprint('Yes' if StoF > FtoS else 'No')", "n = int(input())\r\ndays = list(input())\r\ncF, cS = 0,0 \r\nfor i in range(n-1):\r\n if days[i] != days[i+1]:\r\n if days[i] == 'F':\r\n cF +=1\r\n else:\r\n cS+=1\r\nif cS > cF:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "numInput, places = int(input()), input()\r\nflewToSanFrancisco, flewToSeattle = 0, 0\r\n\r\nfor i in range(len(places)-1):\r\n flewToSanFrancisco += (places[i] == 'S' and places[i+1] == 'F')\r\n flewToSeattle += (places[i] == 'F' and places[i+1] == 'S')\r\n\r\nprint(\"YES\" if flewToSanFrancisco > flewToSeattle else \"NO\")", "#include <bits/stdc++.h> /*\r\nfrom sys import exit as sys_return\r\n\"\"\"*******************************\r\n \r\n cat /dev/ass > /dev/head\r\n Ctrl+C\r\n cat /knowledge > /dev/head\r\n \r\n*******************************\"\"\"\r\n# */ using namespace std;\r\n\r\namount = int(input())\r\nto_disco, to_dota = 0, 0\r\ncities = str(input())\r\nfor i in range(1, amount):\r\n if cities[i - 1] == 'F' and cities[i] == 'S':\r\n to_dota += 1\r\n if cities[i - 1] == 'S' and cities[i] == 'F':\r\n to_disco += 1\r\nif to_disco > to_dota:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=input(\"\")\r\nc=0\r\nk=0\r\nfor i in range(0,n):\r\n if((i+1)<n):\r\n if(a[i]=='S' and a[i+1]=='F'):\r\n c+=1\r\n if(a[i]=='F' and a[i+1]=='S'):\r\n k+=1\r\nif(c>k):\r\n print(\"YES\")\r\nif(c<=k):\r\n print(\"NO\")", "import itertools\nimport math\nfrom collections import defaultdict\n\ndef input_ints():\n return list(map(int, input().split()))\n\ndef solve():\n input()\n s = input()\n print('YES' if s.count('SF') > s.count('FS') else 'NO')\n\n\nif __name__ == '__main__':\n solve()\n", "n = int(input())\r\ns = input()\r\nc1 = s.count('SF')\r\nc2 = s.count('FS')\r\nif c1 > c2:\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")", "n = int(input())\n\ns = str(input())\n\nsf = s.count('SF')\nfs = s.count('FS')\n\nif sf>fs:\n\tprint('YES')\nelse:\n\tprint('NO')", "i1 = input()\r\ni2 = input()\r\ns = \"\"\r\n\r\nif i2.count(\"SF\") > i2.count(\"FS\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nst = input()\r\n\r\nSF = st.count(\"SF\")\r\nFS = st.count(\"FS\")\r\n\r\nif SF>FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nm=input()\r\na=0\r\nb=0\r\nfor i in range(1,len(m)):\r\n if m[i]=='F' and m[i-1]=='S':\r\n a+=1\r\n elif m[i]=='S' and m[i-1]=='F':\r\n b+=1\r\nif a>b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\ny = 0\r\nno = 0\r\ni = -1\r\nwhile i != n-2:\r\n\ti += 1\r\n\tif s[i] == 'F' and s[i+1] == 'S':\r\n\t\tno += 1\r\n\telif s[i] == 'S' and s[i+1] == 'F':\r\n\t\ty += 1\r\nprint('YES' if y>no else 'NO')", "# if s to f > f to s\n# print(\"YES\")\n# else\n# print(\"NO\")\n\nn = int(input())\nl = list(map(str, input()))\nll = []\n\n\nfor i in range(len(l)-1):\n ll.append([l[i],l[i+1]])\n\nif ll.count(['S','F']) > ll.count(['F','S']):\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\nl=input()\r\nif(l[0]=='S' and l[-1]=='F'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "input();x=input()\r\nprint('NO' if x.count('SF')<=x.count('FS') else 'YES')", "n = int(input())\r\ns = input()\r\n\r\np = s[0]\r\nfs, sf = 0, 0\r\nfor i in range(1, n):\r\n if s[i] == 'F' and p == 'S':\r\n sf += 1\r\n elif s[i] == 'S' and p == 'F':\r\n fs += 1\r\n p = s[i]\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\nn = int(input())\r\nx = input()\r\npt1 = \"SF\"\r\npt2 = \"FS\"\r\na = re.findall(pt1,x)\r\nb = re.findall(pt2,x)\r\nif len(a)>len(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nstrm=input()\r\nc=0\r\nm=0\r\nq=list(strm)\r\nfor i in range(len(q)-1):\r\n \r\n if (q[i]+q[i+1])==\"SF\":\r\n c=c+1\r\n elif (q[i]+q[i+1])==\"FS\":\r\n m=m+1\r\nif c>m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nm=str(input())\r\nsum=0\r\ncount=0\r\nfor i in range(n-1):\r\n\tif m[i]=='S' and m[i+1]=='F':\r\n\t\tsum=sum+1\r\nfor i in range(n-1):\r\n\tif m[i]=='F' and m[i+1]=='S':\r\n\t\tcount+=1\r\nif sum>count:\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")", "n, s = input(), input()\nfs, sf = sum([(s[i]=='F') and (s[i+1]=='S') for i in range(len(s)-1)]), sum([(s[i]=='S') and (s[i+1]=='F') for i in range(len(s)-1)])\nprint(['NO','YES'][sf>fs])", "n = int(input())\r\ns = input()\r\ncurrent_pos = s[0]\r\ncount = 0\r\nfor i in range(1,n):\r\n if(s[i]!=current_pos):\r\n count+= 1 if current_pos=='S' else -1\r\n current_pos = s[i]\r\nres = 'YES' if count>0 else 'NO'\r\nprint(res)", "if __name__ == '__main__':\r\n n = int(input())\r\n arr = list(input())\r\n S = 0\r\n SF = 0\r\n for i in range(1, n):\r\n if arr[i] != arr[i - 1]:\r\n if arr[i] == 'S':\r\n S += 1\r\n else:\r\n SF += 1\r\n if S < SF:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "len, string = int(input()), input()\r\n\r\ns = 0\r\nf = 0\r\n\r\npre = None\r\n\r\nfor i in range(1, len):\r\n if string[i] != string[i - 1]:\r\n if string[i - 1] == 'S':\r\n f += 1\r\n else:\r\n s += 1\r\n\r\n\r\n\r\nif f > s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n=int(input())\r\nstri=list(input())\r\ns,f=0,0\r\nfor j in range(0,n-1):\r\n if stri[j]== 'S' and stri[j+1]=='F':\r\n s+=1\r\n elif stri[j]== 'F' and stri[j+1]=='S':\r\n f+=1\r\n\r\nx=print('YES') if s>f else print('NO')\r\n \r\n \r\n ", "# oskwariusz\r\n# 867\r\n# A. Between the Offices\r\n\r\nn = int(input())\r\ndays = input()\r\nto_san_francisco = 0\r\nto_seattle = 0\r\nfor i in range(1, len(days)):\r\n if days[i - 1] == 'S' and days[i] == 'F':\r\n to_san_francisco += 1\r\n elif days[i - 1] == 'F' and days[i] == 'S':\r\n to_seattle += 1\r\nprint(\"YES\" if to_san_francisco > to_seattle else \"NO\")\r\n", "k=int(input())\r\na=input()\r\nc=a.count(\"SF\")\r\nd=a.count(\"FS\")\r\nif(c>d):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\n\r\na = input()\r\n\r\nprint('Yes' if a.count('SF') > a.count('FS') else 'No')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nans = \"YES\" if s[0] & 1 and not s[-1] & 1 else \"NO\"\r\nprint(ans)", "n = int(input())\r\no = list(input())\r\nf = 0\r\ns = 0\r\nfor i in range(0,n-1):\r\n if o[i] == \"S\" and o[i+1] == \"F\":\r\n s += 1\r\n if o[i] == \"F\" and o[i+1] == \"S\":\r\n f += 1\r\n\r\n \r\nif s > f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# import os\r\n\r\nn = int(input())\r\n\r\ns = input()\r\nbase = s[0]\r\nc = 0\r\n\r\nwhile len(s) > 1:\r\n if s[0] != s[1]:\r\n c += 1\r\n s = s[1:]\r\n\r\nif c % 2 == 1 and base == 'S':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n# 04/01 - 21\r\n# 05/01 - 27\r\n# 06/01 - 28\r\n\r\n\r\n\r\n\r\n\r\n ", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nx=int(input())\r\np=input()\r\ncf=0\r\ncs=0\r\nfor i in range (len(p)-1):\r\n\tif(p[i]=='F' and p[i+1]=='S'):\r\n\t\tcf+=1\r\n\telif(p[i]=='S' and p[i+1]=='F'):\r\n\t\tcs+=1\r\n\r\nif(cs>cf):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\t\t\t\t\r\n\r\n", "n = int(input())\r\na = input()\r\ns = 0\r\nf = 0\r\nfor i in range(n-1):\r\n if a[i] == \"S\" and a[i+1] == \"F\":\r\n f += 1\r\n elif a[i] == \"F\" and a[i+1] == \"S\":\r\n s += 1\r\nif s >= f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\ns=input()\r\nfor i in range(n):\r\n\tif s[0]==\"S\" and s[n-1:n]==\"F\":\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\n\telif s[0]==\"F\" or (s[0]==\"S\" and s[n-1:n]==\"S\"):\r\n\t\tprint(\"NO\")\r\n\t\tbreak\t", "x = int(input())\r\ny = input()\r\nz=[]\r\nfor c in range(x):\r\n z.append(y[c])\r\n\r\ncount = 0\r\n\r\nfor c in range (1,x):\r\n if z[c-1] + z[c] == \"SF\":\r\n count = count + 1\r\n if z[c-1] + z[c] == \"FS\":\r\n count = count -1\r\n\r\nif count > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\nx = input()\r\n\r\nif (x.count('SF') > x.count('FS')):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "size = int(input())\r\ndata = input()\r\nif data[0] == \"S\" and data[-1] == \"F\":\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\ns=input()\r\nflights_to_s=0\r\nflights_to_f=0\r\n\r\ni=0\r\nfor i in range(len(s)):\r\n\tif i+2<=len(s):\r\n\t\tif s[i]!=s[i+1]:\r\n\t\t\tif s[i]==\"F\" and s[i+1]==\"S\":\r\n\t\t\t\tflights_to_s=flights_to_s+1\r\n\t\t\telif s[i]==\"S\" and s[i+1]==\"F\":\r\n\t\t\t\tflights_to_f=flights_to_f+1\r\n\r\nif flights_to_f>flights_to_s:\r\n\tprint(\"YES\")\r\nelse: \r\n\tprint(\"NO\")\r\n", "n = int(input())\r\nstring = input()\r\ns = f = 0\r\nfor i in range(n - 1):\r\n if string[i] == \"S\" and string[i + 1] == \"F\":\r\n s += 1\r\n elif string[i] != string[i + 1]:\r\n f += 1\r\nres = \"YES\" if s > f else \"NO\"\r\nprint(res)", "n=int(input())\r\nstring1=input()\r\nif string1.count(\"SF\")>string1.count(\"FS\"):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\na=0\r\nf=0\r\ns=input()\r\nfor i in range(0,n-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n a+=1\r\n elif s[i]=='F' and s[i+1]=='S':\r\n f+=1\r\nif(a>f):print(\"YES\")\r\nelif(a<=f):print(\"NO\")", "n = int(input())\r\noffices = input()\r\nfrancisco_seattle = 0 \r\nseattle_francisco = 0 \r\n\r\nfor i in range(1,len(offices)):\r\n \r\n if offices[i-1] != offices[i]:\r\n \r\n if offices[i-1] == \"S\":\r\n seattle_francisco += 1\r\n else:\r\n francisco_seattle += 1\r\n \r\nif seattle_francisco > francisco_seattle:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ncityes = str(input())\r\nif cityes.count(\"FS\") < cityes.count(\"SF\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input()\nfirst = second = 0\nfor i in range(1, n):\n if s[i] == \"F\" and s[i - 1] == \"S\":\n first += 1\n if s[i] == \"S\" and s[i - 1] == \"F\":\n second += 1\nif first > second:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\nflights = input()\r\nstsf = 0\r\nsfts = 0\r\nfor i in range(len(flights)):\r\n if i > 0:\r\n if flights[i] == 'F' and flights[i - 1] == 'S':\r\n stsf += 1\r\n elif flights[i] == 'S' and flights[i - 1] == 'F':\r\n sfts += 1\r\nif stsf > sfts:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nl = input()\r\nc=0\r\nd=0\r\nfor i in range(len(l)-1):\r\n if l[i]=='S' and l[i+1]=='F' :\r\n c = c + 1\r\n elif l[i]=='F' and l[i+1]=='S' :\r\n d = d + 1\r\nif c > d :\r\n print('yes')\r\nelse :\r\n print('no')", "if __name__ == \"__main__\":\r\n n = int(input())\r\n st = input()\r\n prev = st[0]\r\n more, less = 0, 0\r\n for i in range(1, n):\r\n if prev == \"S\" and st[i] == \"F\":\r\n more += 1\r\n elif prev == \"F\" and st[i] == \"S\":\r\n less += 1\r\n prev = st[i]\r\n if more > less:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n = int(input())\r\ndays = input()\r\nif days.count('SF') > days.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "number = int(input())\r\nflights = input()\r\n\r\nprint('YES') if len(flights.split('SF')) > len(flights.split('FS')) else print('NO')", "def main():\r\n size = int(input())\r\n flights = input()\r\n if flights[0] == 'F':\r\n print('NO')\r\n return\r\n else:\r\n if flights[size-1] == 'F':\r\n print('YES')\r\n return\r\n print('NO')\r\n return\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "useless = int(input())\ndata = list(input().strip().upper())\nseatle, francisco, count = 0, 0, 0\nwhile count < useless - 1:\n if data[count] == \"S\" and data[count + 1] == \"F\":\n seatle += 1\n elif data[count] == \"F\" and data[count + 1] == \"S\":\n francisco += 1\n count += 1\nif seatle > francisco:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "input()\r\nk=input()\r\ns=0\r\nf=0\r\nfor i in range(len(k)-1):\r\n if k[i]=='S' and k[i+1]=='F':\r\n s+=1\r\n elif k[i]=='F' and k[i+1]=='S':\r\n f+=1\r\nprint(\"YES\" if s>f else \"NO\")", "n = int(input())\r\ncity = input()\r\n\r\nSF_count = city.count('SF')\r\n\r\nFS_count = city.count('FS')\r\n\r\nif SF_count > FS_count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nso=sf=0\r\np=s[0]\r\nfor i in s:\r\n c=i\r\n if (c!=p):\r\n if(p==\"S\"):\r\n sf+=1\r\n else:\r\n so+=1\r\n p=i\r\nif(sf>so):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=int(input())\r\nb=input()\r\nstf=0\r\nfts=0\r\nfor i in range (0,a):\r\n\tif b[i:i+2]==\"SF\":\r\n\t\tstf+=1\r\n\tif b[i:i+2]==\"FS\":\r\n\t\tfts+=1\r\nif fts<stf :\r\n\tprint(\"Yes\")\r\nelse :\r\n\tprint(\"No\")", "sf = 0\r\nfs = 0\r\nn = int(input())\r\nplaces = input()\r\nfor i in range(0,n):\r\n\tif places[i:i+2] == 'SF':\r\n\t\tsf+=1\r\n\telif places[i:i+2] == 'FS':\r\n\t\tfs+=1\r\nif sf>fs:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\ns = list(str(input()))\r\nsf = 0\r\nfs = 0\r\nfor i in range(n-1):\r\n if s[i] == 'S':\r\n if s[i+1] == 'F':\r\n sf += 1\r\n else:\r\n if s[i+1] == 'S':\r\n fs += 1\r\nprint(\"YES\" if sf > fs else \"NO\")\r\n", "n = int(input())\n\no = input()\nFtS = 0\nStF = 0\n\nfor i in range(1, n):\n if o[i - 1] == \"F\" and o[i] == \"S\": FtS += 1\n elif o[i - 1] == \"S\" and o[i] == \"F\": StF += 1\n\nprint(\"YES\" if StF > FtS else \"NO\")\n", "input()\nistr = input()\nif istr[0] == 'S' and istr[-1] == 'F':\n print('YES')\nelse:\n print('NO')\n", "n = input()\ns = input()\nans = 0\n\nfor i in range(2, len(s) + 1):\n if s[i-2:i] == \"SF\":\n ans += 1\n elif s[i-2:i] == \"FS\":\n ans -= 1\n\nif ans > 0:\n print('YES')\nelse:\n print('NO')", "import sys\r\nsys.stdin.readline()\r\ninput = sys.stdin.readline().strip()\r\nif input[0] == \"S\" and input[-1] == \"F\":\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "input()\r\na = input()\r\nprint('YES' if a[0] + a[-1] == 'SF' else 'NO')", "def solve(test):\r\n n = int(input())\r\n s = input()\r\n S = 0\r\n F = 0\r\n for i in range(1, n):\r\n if s[i] != s[i - 1]:\r\n if s[i - 1] == 'S':\r\n S += 1\r\n else:\r\n F += 1\r\n print('YES' if S > F else 'NO')\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "n = int(input())\r\nfly = input()\r\n\r\nprev = fly[0]\r\nresult = 0\r\nif len(fly) == 1:\r\n print('NO')\r\nelse:\r\n for i in range(1, n):\r\n if prev != fly[i]:\r\n if prev == 'S':\r\n result += 1\r\n else:\r\n result -= 1\r\n prev = fly[i]\r\nprint('YES' if result > 0 else 'NO')\r\n\r\n", "n = int(input())\r\ns = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(n-1):\r\n if(s[i] == 'F' and s[i+1] == 'S'):\r\n sf+=1\r\n elif(s[i] == 'S' and s[i+1] == 'F'):\r\n fs+=1\r\nif(fs > sf):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nstring = input()[:n]\r\nstring = string.upper()\r\ni = 0\r\nj = 1\r\ncounter = 0\r\notherCounter = 0\r\n\r\nwhile i < len(string) - 1 and j < len(string):\r\n if string[i] == 'S' and string[j] == 'F':\r\n counter += 1\r\n elif string[i] == 'F' and string[j] == 'S':\r\n otherCounter += 1\r\n i += 1\r\n j += 1\r\n\r\nif counter > otherCounter:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve(offices):\r\n s2f = 0\r\n f2s = 0\r\n for i in range(1, len(offices)):\r\n if offices[i] != offices[i - 1]:\r\n if offices[i - 1] == 'S':\r\n s2f += 1\r\n else:\r\n f2s += 1\r\n if s2f > f2s:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\ndef main():\r\n _ = int(input())\r\n offices = input()\r\n print(solve(offices))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ns = input()\r\n\r\ncount = 0\r\ni = 0\r\nwhile i < len(s)-1:\r\n if s[i]=='F' and s[i+1]=='S':\r\n count-=1\r\n elif s[i]=='S' and s[i+1]=='F':\r\n count+=1\r\n i+=1\r\n\r\nif count>0: \r\n print(\"YES\")\r\nelse: \r\n print('NO')", "n = int(input())\r\nseq = input()\r\ns = 0\r\nf = 0\r\nfor i in range(n-1):\r\n\tif seq[i] == \"F\" and seq [i+1] == \"S\":\r\n\t\tf += 1\r\n\telif seq[i] == \"S\" and seq[i+1] == \"F\":\r\n\t\ts += 1\r\nif s > f:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n = int(input())\r\nword = input()\r\nsf = word.count(\"SF\")\r\nfs = word.count(\"FS\")\r\nprint([\"NO\",\"YES\"][sf > fs])", "n=int(input())\r\ns=input()\r\nt,c=0,0\r\nfor i in range(n-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n t+=1\r\n elif s[i]=='F' and s[i+1]=='S':\r\n c+=1\r\nif t>c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input()\r\n\r\nof = input()\r\nl = of[0]\r\nsf = 0\r\nfs = 0\r\nfor i in of[1:]:\r\n if i == l: continue\r\n if l == 'S': sf += 1\r\n else: fs += 1\r\n l = i\r\n \r\nif sf > fs: print(\"YES\")\r\nelse: print(\"NO\")", "n = int(input())\r\nj = str(input())\r\ncount = 0\r\n#if n > 2:\r\nfor i in range(0,n-1):\r\n if j[i] != j[i+1]:\r\n if j[i] == \"S\":\r\n count = count + 1\r\n else:\r\n count = count - 1\r\n#else:\r\n\r\nif count <= 0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "number = input()\r\narr = input()\r\n\r\nprint(\"YES\") if arr[0] == \"S\" and arr[len(arr) - 1] == \"F\" else print(\"NO\")", "n = int(input())\r\ns = input()\r\ny = 0\r\nfor i in range(n-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n y+=1\r\n elif s[i]=='F' and s[i+1]=='S':\r\n y-=1\r\nif y>0:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n\r\nn = int(input())\r\ns = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(1, len(s), 1):\r\n if s[i - 1: i + 1] == \"SF\":\r\n sf += 1\r\n elif s[i - 1: i + 1] == \"FS\":\r\n fs += 1\r\n \r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nb = input()\r\n\r\nSF = 0\r\nFS = 0\r\n\r\nfor i in range(a-1):\r\n if b[i] == 'S' and b[i+1] == 'F':\r\n SF += 1\r\n elif b[i] == 'F' and b[i+1] == 'S':\r\n FS += 1\r\n\r\nif SF>FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, s = int(input()), input()\r\nprint('YES') if s.count('SF') > s.count('FS') else print('NO')\r\n", "n=int(input())\r\ns=input()\r\nsf, fs =0, 0\r\nfor i in range(0, n-1):\r\n if s[i:i+2]=='SF':\r\n sf+=1\r\n if s[i:i+2]=='FS':\r\n fs+=1\r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/867/A\r\n\"\"\"\r\n\r\ninput()\r\ns = input()\r\n\r\nif s.count(\"SF\") > s.count(\"FS\"):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\ns=list(input())\r\n#print(s)\r\ncf=0;cs=0\r\nfor x in range(len(s)-1):\r\n if s[x]=='F' and s[x+1]=='S': # flight to seattle\r\n cf+=1\r\n elif s[x]=='S' and s[x+1]=='F': \r\n cs+=1\r\n#print(\"flights to san franciso\",cf)\r\n#print(\"flights to seattle\",cs)\r\n#yes only when no. of flights from s to f is more than f to s\r\nif cs>cf:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\nnumCases = int(input())\r\nflights = input()\r\nnumSF = 0\r\nnumFS = 0\r\n\r\ncount = 1\r\nwhile count < numCases:\r\n if flights[count-1] == \"S\" and flights[count] == \"F\":\r\n numSF += 1\r\n elif flights[count-1] == \"F\" and flights[count] == \"S\":\r\n numFS += 1\r\n count += 1\r\n\r\nif numSF > numFS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\ns = input()\r\nfreq = {'FS': 0, 'SF': 0}\r\ni = 0\r\nwhile i < n - 1:\r\n flight = s[i:i + 2]\r\n if flight == 'SF' or flight == 'FS': freq[flight] += 1\r\n i += 1\r\nif freq['SF'] > freq['FS']: print('YES')\r\nelse: print('NO')", "n = int(input())\r\nstring = input()\r\ns,f = 0,0\r\nfor i in range(n-1):\r\n if string[i] == \"S\" and string[i+1] != string[i]:\r\n s += 1\r\n elif string[i] == \"F\" and string[i+1] != string[i]:\r\n f += 1\r\nprint(\"YES\" if s > f else \"NO\")", "n=int(input())\r\nl=list(input())\r\nu=len(l)\r\ns=0\r\nv=0\r\n\r\nfor i in range(u-1):\r\n if l[i]=='F':\r\n if l[i]!=l[i+1]:\r\n s=s+1\r\n if l[i]=='S':\r\n if l[i]!=l[i+1]:\r\n v=v+1\r\nif v>s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "#!/usr/bin/python3\n\nn = int(input())\ncities = input()\n\nSF = 0\nFS = 0\ncurrent_city = cities[0]\nfor city in cities[1:]:\n if(current_city != city):\n if(current_city == \"S\"):\n SF = SF + 1\n else:\n FS = FS + 1\n current_city = city\n\nif(SF > FS):\n print(\"YES\")\nelse:\n print(\"NO\")", "inp=input\nli=list\niinp=lambda : int(inp())\nent=lambda : map(int,inp().split())\nlient=lambda : li(ent())\n\nn=iinp()\ncadena=inp()\nsan=sea=0\nfor i in range(1,n):\n if cadena[i-1]=='S' and cadena[i]=='F':\n sea+=1\n elif cadena[i-1]=='F' and cadena[i]=='S':\n san+=1\nif sea>san: print(\"YES\")\nelse: print(\"NO\")", "n=input()\r\nt=input()\r\nn=0\r\nl=t.count('SF')\r\nn=0\r\nn=t.count('FS')\r\nprint('YES' if (l>n and (l>0 or n>0)) else 'NO')", "a = int(input())\r\nd = input()\r\ns1 = 0\r\ns2 = 0\r\nfor q in range(a - 1):\r\n if(d[q]==\"S\" and d[q+1]==\"F\"):\r\n s1 += 1\r\n if (d[q]==\"F\" and d[q + 1] == \"S\"):\r\n s2 += 1\r\nif(s1>s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = list(input())\r\nans_f,ans_s = 0,0\r\nfor i in range(n-1):\r\n if a[i] == \"S\" and a[i+1] == \"F\": ans_s += 1\r\n elif a[i] == \"F\" and a[i+1] == \"S\": ans_f += 1\r\nif ans_s > ans_f: print(\"YES\")\r\nelse: print(\"NO\")", "_ = input()\r\nstr = input()\r\nprint(\"YES\" if str.count(\"SF\") > str.count(\"FS\") else \"NO\")", "n = int(input())\r\nstr1 = input()\r\nStF = str1.count(\"SF\")\r\nFtS = str1.count(\"FS\")\r\nif StF > FtS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nstring = input()\ns_to_f = string.count(\"SF\")\nf_to_s = string.count(\"FS\")\nif s_to_f > f_to_s:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\nx = input()\r\nca = 0\r\ncb = 0\r\n\r\nfor i in range(n-1):\r\n if x[i] == 'S' and x[i+1] == 'F':\r\n ca = ca + 1\r\n if x[i] == 'F' and x[i+1] == 'S':\r\n cb = cb + 1\r\n\r\nif ca > cb:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ns = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(n-1):\r\n if s[i:i+2] == 'SF':\r\n c1 += 1\r\n elif s[i:i+2] == 'FS':\r\n c2 += 1\r\nif c1 > c2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nIF more SF than FS YES\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n s = I().strip()\r\n\r\n flights = 0\r\n for i in range(1,n):\r\n if s[i-1] == \"S\" and s[i] == \"F\":\r\n flights += 1\r\n elif s[i-1] == \"F\" and s[i] == \"S\":\r\n flights -= 1\r\n print(\"YES\" if flights > 0 else \"NO\")\r\n\r\n\r\nsolve()", "n = int(input())\r\ns = input()\r\ns2f = 0\r\nf2s = 0\r\nfor i in range(1, n):\r\n if s[i] != s[i-1]:\r\n if s[i] == 'F':\r\n s2f += 1\r\n else:\r\n f2s += 1\r\nprint(\"Yes\" if s2f > f2s else \"No\")\r\n\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n/////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n/////////////////////////////////////////\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n", "input()\r\nsche=input()\r\nif sche.count('SF') > sche.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\r\nProblem Name :\r\nBetween the Offices\r\nProblem Link :\r\nhttps://codeforces.com/problemset/problem/867/A\r\n'''\r\n# Input Operation \r\nnum=int(input())\r\nstr=input()\r\n# Output Operation \r\nif(str[0]==\"S\" and str[-1]==\"F\"):\r\n print(\"YES\")\r\nelse:print(\"NO\")", "n=int(input())\r\ns=input()\r\nfran,seat=0,0\r\nfor i in range(n-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n fran+=1\r\n elif s[i]=='F' and s[i+1]=='S':\r\n seat+=1\r\nif fran>seat:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "N=int(input())\r\nstr=input()\r\ncS=0\r\ncF=0\r\nfor x in range (N-1) :\r\n if (str[x] == 'S' and str[x+1] == 'F'):\r\n cS=cS+1\r\n elif (str[x] == 'F' and str[x+1] == 'S'):\r\n cF=cF+1\r\nif(cS>cF):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t, sf, fs = int(input()), input(), 0, 0\r\nfor i in range(n-1):\r\n if(t[i] == \"S\" and t[i+1] == \"F\"):\r\n sf += 1\r\n elif(t[i] == \"F\" and t[i+1] == \"S\"):\r\n fs += 1 \r\n\r\nprint(\"YES\") if sf > fs else print(\"NO\")", "# # s='2 3'\r\n# # print(s\r\ns=0\r\nf=0\r\ni=1\r\nn=int(input())\r\n# m1=0\r\n# k1=0\r\nd=input()\r\nwhile i<n:\r\n\r\n # b=input().split()\r\n td = d[i]\r\n pd = d[i-1]\r\n if td==\"S\" and pd=='F':\r\n s=s+1\r\n if td==\"F\" and pd=='S':\r\n f=f+1\r\n\r\n i=i+1\r\nif s<f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n \r\n\r\n\r\n# if i==m:\r\n# f1=f1+1\r\n# else:\r\n# s1=s1+1\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n# i=i+1\r\n# if f1<s1:\r\n# print('NO') \r\n# if f1>s1:\r\n# print('YES') \r\n# if f1==s1:\r\n# print('NO') \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# # while n>i: \r\n# if m>k:\r\n# m1=m1+1\r\n# if m<k: \r\n# k1=k1+1\r\n# i=i+1\r\n# if k1<m1:\r\n# print('Mishka')\r\n# if k1>m1:\r\n# print('Chris')\r\n# if k1==m1:\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n# # print('Friendship is magic!^^') ", "b=list()\r\nc=list()\r\na=int(input())\r\nd=str(input())\r\ndef top():\r\n for i in range(a-1):\r\n if (d[i]+d[(i+1)])==\"SF\":\r\n b.append(1)\r\n elif (d[i]+d[(i+1)])==\"FS\":\r\n c.append(1)\r\n else:\r\n continue\r\ntop()\r\nif len(b)>len(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\n\r\na=0\r\nb=0\r\nfor i in range(n-1):\r\n if s[i]==\"F\" and s[i+1]==\"S\":\r\n a+=1\r\n elif s[i]==\"S\" and s[i+1]==\"F\":\r\n b+=1\r\n else:\r\n i+=1\r\n\r\nif b>a:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\t \t\r\n\r\n\r\n\r\n\r\n\r\n", "n = map(int, input())\r\ns = input()\r\nf = s\r\ns = s.split('SF')\r\nf = f.split('FS')\r\n\r\nif len(s) > len(f):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "if __name__ == '__main__':\n input()\n days_offices = input()\n\n print(\n 'YES' if days_offices.count('SF') > days_offices.count('FS') else\n 'NO'\n )\n", "n=int(input())\r\ns=input()\r\na=s.count(\"FS\")\r\nb=s.count(\"SF\")\r\nif(a>=b):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = input()\r\ns = input()\r\na = []\r\nfor c in s:\r\n a.append(c)\r\nsf = 0\r\nff = 0\r\nfor i in range(len(a)-1):\r\n if a[i] == \"S\" and a[i+1] == \"F\":\r\n sf += 1\r\n elif a[i] == \"F\" and a[i+1] == \"S\":\r\n ff += 1\r\nif sf > ff:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "import string\nn=int(input())\ns=input()\nk=s.count('SF')\nl=s.count('FS')\nif l>=k:\n print(\"NO\")\nelse:\n print(\"YES\")", "n=int(input())\r\nflights=input()\r\nfts=0\r\nftf=0\r\nfor i in range (len(flights)-1):\r\n\tif flights[i]=='S' and flights[i+1]=='F':\r\n\t\tfts+=1\r\n\telif flights[i+1]=='S' and flights[i]=='F':\r\n\t\tftf+=1\r\nif fts>ftf:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "a = input()\na = input()\nprint('YES' if a.count('SF')>a.count('FS') else 'NO')", "def fr(r, s):\r\n return s[:s.find(r)] + s[s.find(r)+len(r):]\r\ndef f(r, s):\r\n a = 0\r\n while r in s: s, a= fr(r, s), a + 1\r\n return a\r\nn, s = int(input()), input()\r\nprint('YES' if f('SF', s) > f('FS', s) else 'NO')", "input()\r\ny = input()\r\nprint('YES' if y.count('SF') > y.count('FS') else 'NO')\r\n#heh", "input()\r\ns=input()\r\nprint('NYOE S'[s.count('SF')>s.count('FS')::2])\r\n", "#%% 867a Between the offices \r\n\r\nn = int(input())\r\ns = input()\r\nfs = 0; sf = 0\r\nfor a in s[:-1]:\r\n for b in s[1:]:\r\n t = a+b\r\n sf += t == 'SF'\r\n fs += t == 'FS'\r\nprint('YNEOS'[fs>=sf::2])\r\n", "n = int(input())\r\ns = input()\r\n\r\ns_to_f = s.count(\"SF\")\r\nf_to_s = s.count(\"FS\")\r\n\r\nprint(\"YES\" if s_to_f > f_to_s else \"NO\")\r\n", "input()\r\na = input()\r\nif a.count(\"FS\") >= a.count(\"SF\"):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\ns=str(input())\r\nsf=0;fs=0\r\nfor i in range(n-1):\r\n\tif s[i]=='S' and s[i+1]=='F':\r\n\t\tsf+=1\r\n\tif s[i]=='F' and s[i+1]=='S':\r\n\t\tfs+=1\r\nprint('YES' if sf>fs else 'NO')", "n = int(input())\r\ns = input()\r\nFr = Se = 0\r\nprev = s[0]\r\nfor i in range(1, n):\r\n if s[i] != prev:\r\n if s[i] == 'F':\r\n Fr += 1\r\n else:\r\n Se += 1\r\n prev = s[i]\r\n# print(Se, Fr)\r\nprint(\"YES\" if Fr > Se else \"NO\")", "q = int(input())\r\nc = input()\r\ng = c.replace('SF','1').count('1')\r\nd = c.replace('FS','2').count('2')\r\nif g>d:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "input(); s = input(); print('NYOE S'[s[-1] != s[0] == 'S'::2])", "import sys\r\nn = int(input())\r\nx = input()\r\nlst = x.split()\r\nf = 0\r\nif x[0]==\"S\" and x[n-1] ==\"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = list(input())\r\ns2f = 0\r\nf2s = 0\r\ni = 1\r\nwhile i < len(s):\r\n if s[i] != s[i-1]:\r\n if s[i] == \"F\":\r\n s2f+=1\r\n else:\r\n f2s+=1\r\n i+=1\r\nop = \"YES\" if s2f > f2s else \"NO\"\r\nprint(op)\r\n", "n=int(input())\r\ns=input()\r\ncnsf=0\r\ncnfs=0\r\nfor i in range(len(s)-1):\r\n if(s[i]=='F' and s[i+1]=='S'):\r\n cnfs+=1\r\n elif(s[i]=='S' and s[i+1]=='F'):\r\n cnsf+=1\r\nif(cnsf>cnfs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nf=input()\r\nprint(\"YES\") if f[0]==\"S\" and f[-1]==\"F\" else print(\"NO\")\r\n", "n=int(input())\r\nch=input()\r\nif ch[0]==\"S\" and ch[len(ch)-1]==\"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\nn = int(input())\r\nc = str(input())\r\n\r\nif(list(c)[0] == 'S' and list(c)[n - 1] == 'F'):\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\nn = int(input())\nsch = input()\n#left = list(map(str,input().strip().split(\" \")))\nif sch.count('SF')>sch.count('FS'):\n print('YES')\nelse:\n print('NO')\n\n\n\n", "input()\nFS = 0\nSF = 0\nprev = \"X\"\nfor i in input():\n if i == \"F\" and prev == \"S\":\n SF+=1\n elif i == \"S\" and prev == \"F\":\n FS+=1\n prev = i\nprint(\"YES\" if SF > FS else \"NO\")\n", "# number of days\nt = int(input())\n\ndays = input()\n\nstof, ftos = 0, 0\n\nfor x in range(1, len(days)):\n\tif days[x-1] == 'F' and days[x] == 'S':\n\t\tftos += 1\n\telif days[x-1] == 'S' and days[x] == 'F':\n\t\tstof += 1\n\nprint(\"YES\" if stof > ftos else \"NO\")", "# Codeforces\r\n# #867A - Between the Offices\r\n# http://codeforces.com/problemset/problem/867/A\r\n# 12/01/2019\r\n# Nilton G. M. Junior\r\n\r\n\r\nif __name__ == '__main__':\r\n no_days = int(input())\r\n locations = input()\r\n print(\"YES\" if locations.count(\"SF\") > locations.count(\"FS\") else \"NO\")\r\n", "n = int(input())\r\nstring = input()\r\n\r\nFS = string.count('FS')\r\nSF = string.count('SF')\r\n\r\nif SF>FS:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=input()\r\nb=input()\r\nc=b.count(\"SF\")\r\nd=b.count(\"FS\")\r\ne=b.count(\"F\")\r\nf=b.count(\"S\")\r\n\r\nif(e==len(b)):\r\n print(\"NO\")\r\nelif(f==len(b)):\r\n print(\"NO\")\r\nelif(c>d):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num=int(input())\r\nstr=input()\r\n\r\nif(str[0]==\"S\" and str[-1]==\"F\"):\r\n print(\"YES\")\r\nelse:print(\"NO\")", "n = int(input())\r\nl = input()\r\n\r\nprint(('NO', 'YES')[l[0] == 'S' and l[-1] == 'F'])", "n=int(input())\r\nm=input()\r\nfre={\"sf\":0,\"fs\":0}\r\n\r\nfor j in range(len(m)-1):\r\n if m[j]==\"S\" and m[j+1]==\"F\":\r\n fre[\"sf\"]+=1\r\n if m[j]==\"F\" and m[j+1]==\"S\":\r\n fre[\"fs\"]+=1\r\n\r\n \r\nif fre[\"sf\"]>fre[\"fs\"]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\n\nline = input()\ns = line.count('SF')\nf = line.count('FS')\nif(s > f):\n print(\"YES\")\nelse:\n print(\"NO\")", "t = int(input())\r\n\r\ncities = input()\r\nmy_list = []\r\n\r\nfs = 0\r\nsf = 0\r\n\r\nfor char in cities:\r\n\tmy_list.append(char)\r\n\r\nfor i in range(t-1):\r\n\tif my_list[i+1] == 'S' and my_list[i] == 'F':\r\n\t\tfs+=1\r\n\tif my_list[i+1] == 'F' and my_list[i] == 'S':\r\n\t\tsf+=1\r\n\r\nif sf > fs :\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "x=int(input())\r\ny=input()\r\nc=y.count(\"SF\")\r\nv=y.count(\"FS\")\r\nif c>v:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=input()\r\ns=0\r\ns2=0\r\nfor i in range(n-1):\r\n if a[i:i+2]=='SF':\r\n s=s+1\r\n if a[i:i+2]=='FS':\r\n s2=s2+1\r\nif s>s2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input()) \r\ns=0\r\nf=0\r\na=str(input())\r\nfor i in range (1,n) :\r\n if a[i-1]==\"S\" and a[i]==\"F\":\r\n \ts=s+1\r\n if a[i-1]==\"F\" and a[i]==\"S\":\r\n \tf=f+1\r\nif s>f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nSF = 0\r\nFS = 0\r\nfor i in range(n - 1):\r\n if s[i] + s[i + 1] == 'SF':\r\n SF += 1\r\n if s[i] + s[i + 1] == 'FS':\r\n FS += 1\r\nif SF > FS:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nplaces = input()\r\ncount = 0\r\nfor index in range(n-1):\r\n if (places[index] == 'F' and places[index+1] == 'F') or (places[index] == 'S' and places[index + 1] == 'S'):\r\n continue\r\n count = count + 1 if places[index] == 'S' and places[index + 1] == 'F' else count - 1\r\nprint(\"NO\" if count <= 0 else \"YES\")\r\n", "n = int(input())\r\nst = input()\r\nseasan, sansea = 0, 0\r\nfor i in range(len(st )-1):\r\n if st[i] == 'F' and st[i + 1] == 'S':\r\n sansea += 1\r\n \r\n elif st[i] == 'S' and st[i + 1] == 'F':\r\n seasan += 1\r\n \r\nif seasan > sansea:\r\n print('yes')\r\n \r\nelse:\r\n print('no')", "n=int(input())\r\na=input()\r\nc,d=0,0\r\nfor i in range(len(a)-1):\r\n\tif a[i]=='S' and a[i+1]=='F':\r\n\t\tc+=1\r\n\telif a[i]=='F'and a[i+1]=='S':\r\n\t\td+=1\r\nif c>d:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "a=int(input())\r\nb=input()\r\nSF=0\r\nFS=0\r\nfor i in range(0,a-1):\r\n if b[i]==\"S\" and b[i+1]==\"F\":\r\n SF=SF+1\r\n if b[i]==\"F\" and b[i+1]==\"S\":\r\n FS=FS+1\r\n\r\nif SF > FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a = 0\nb = 0\ninput()\nc = input(\"\")\nfor i in range(1, len(c)):\n if c[i-1] == \"S\":\n if c[i] == \"F\":\n a+= 1\n if c[i-1] == \"F\":\n if c[i] == \"S\":\n b+= 1\nif a > b:\n print(\"YES\")\nelse:\n print(\"NO\")", "night = int(input())\r\nstr = [a for a in input()]\r\ns , f = 0 , 0\r\nfor x in range(1 , len(str)):\r\n if str[x] != str[x-1] and str[x] == 'F':\r\n s += 1\r\n elif str[x] != str[x-1] and str[x] == 'S':\r\n f += 1\r\nif s > f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nf=input()\r\nd=0\r\nr=0\r\nfor i in range(0,n-1):\r\n if f[i]!=f[i+1]:\r\n if f[i]==\"S\":\r\n d+=1\r\n else:\r\n r+=1\r\nif d>r:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\nd={'S':0,'F':0}\r\ncur=s[0]\r\nfor i in range(1,n):\r\n if(s[i]!=cur):\r\n d[cur]+=1\r\n cur=s[i]\r\nif(d['S']>d['F']):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=int(input())\r\nb=input()\r\nc=b.upper()\r\nS,F=0,0\r\nfor x in range(0,a-1):\r\n if c[x]!=c[x+1]:\r\n if c[x+1]==\"F\":\r\n S+=1\r\n else:\r\n F+=1\r\nif S>F:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n ", "n=int(input())\r\ns=input()\r\ncnt_1=int(0)\r\ncnt_2=int(0)\r\nfor i in range(1,n):\r\n if s[i-1]=='S' and s[i]=='F':\r\n cnt_1+=1\r\n elif s[i-1]=='F' and s[i]=='S':\r\n cnt_2+=1\r\nif (cnt_1>cnt_2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\ng=input()\nx=g.count(\"z\")\ns,f=0,0\nfor i in range(1, n):\n if g[i] == 'S' and g[i-1]=='F':\n s+=1\n if g[i]=='F' and g[i-1]=='S':\n f+=1\nif f>s:\n print(\"YES\")\nelse:\n print(\"NO\")", "input()\r\ns = input()\r\nprint('Yes' if s.count('SF') > s.count('FS') else 'No')", "n = int(input())\nw = input()\n\nprint(\"YES\" if w.count(\"SF\") > w.count(\"FS\") else \"NO\")\n\n", "n=int(input())\r\nb= input() \r\nif b.count('SF')> b.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\nx = input()\ns = ''\nfor i in range(1, len(x)):\n if x[i] != x[i - 1]:\n s += x[i]\nif s.count('F') > s.count('S'):\n print('YES')\nelse:\n print('NO')\n", "n=int(input())\r\nl=list(input())\r\nsf=0\r\nfs=0\r\nfor i in range(n-1):\r\n if l[i]=='F' and l[i+1]=='S':\r\n fs+=1\r\n elif l[i]=='S' and l[i+1]=='F':\r\n sf+=1\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\na = input()\r\nSF = 0\r\nFS = 0\r\nfor i in range(len(a)-1):\r\n if(a[i]=='S' and a[i+1]=='F'):\r\n SF+=1\r\n elif(a[i]=='F' and a[i+1]=='S'):\r\n FS+=1\r\nif(SF>FS):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\ns=str(input())\nk=0\np=0\nfor i in range(len(s)-1):\n if s[i]=='S'and s[i+1]=='F':\n k+=1\n if s[i]=='F'and s[i+1]=='S':\n p+=1\nif k>p:\n print('yes')\nelse:\n print('no')\n", "n = int(input())\r\nReise = str(input())\r\nSF = 0\r\nFS = 0\r\nfor i in range(n-1):\r\n if Reise[i]==\"S\" and Reise[i+1]==\"F\":\r\n SF +=1\r\n elif Reise[i]==\"F\" and Reise[i+1]==\"S\":\r\n FS +=1\r\nif SF>FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = ''\r\nans = count=0\r\na = str(input())\r\nfor j in range(1, len(a)):\r\n\tif a[j-1]=='S' and a[j]=='F' :\r\n\t\tans+=1\r\n\tif a[j-1]=='F' and a[j]=='S' :\r\n\t\tcount+=1\r\nif ans>count:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "'''\r\nesfandiar pourthmasb\r\nTelegram : @Essi4678\r\nInstagram : essipoortahmasb2018\r\nUniversity of Bojnourd\r\n'''\r\nn=int(input().strip())\r\ns=input()\r\na=[0,0]\r\na[0]=s.count(\"SF\")\r\na[1]=s.count(\"FS\")\r\n\r\nprint(\"YES\") if a[0]>a[1] else print(\"NO\")\r\n\t\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n", "num = int(input())\r\nn = input()\r\n\r\nSfly = 0\r\nFfly = 0\r\n\r\nfor i in range(0, len(n)-1):\r\n if n[i] == \"S\":\r\n if n[i] != n[i+1]:\r\n Sfly += 1\r\n else:\r\n if n[i] != n[i+1]:\r\n Ffly += 1\r\n\r\nif Sfly > Ffly:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\ncs=0\r\ncf=0\r\nfor i in range(n-1):\r\n\tif(s[i]=='F'):\r\n\t\tif(s[i+1]=='S'):\r\n\t\t\tcf=cf+1\r\n\tif(s[i]=='S'):\r\n\t\tif(s[i+1]=='F'):\r\n\t\t\tcs=cs+1\r\n\tif(s[i]=='S'):\r\n\t\tif(s[i+1]=='S'):\r\n\t\t\tcs=cs\r\n\tif(s[i]=='F'):\r\n\t\tif(s[i+1]=='F'):\r\n\t\t\tcf=cf\r\nif(cs>cf):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def bublesort(a):\r\n\tn = len(a)\r\n\tfl1 = False\r\n\twhile not fl1:\r\n\t\tfl1 = True\r\n\t\tfor i in range(n - 1):\r\n\t\t\tif a[i] > a[i + 1]:\r\n\t\t\t\ta[i], a[i + 1] = a[i + 1], a[i]\r\n\t\t\t\tfl1 = False\r\n\r\n\r\nn = int(input())\r\na = input()\r\nk = 0\r\np = 0\r\nfor i in range(len(a) - 1):\r\n\tif a[i] != a[i + 1] and a[i] == \"S\":\r\n\t\tk += 1\r\n\telif a[i] != a[i + 1]:\r\n\t\tp += 1\r\nif k > p:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\") \r\n", "n = int(input())\r\ns = input()\r\n\r\ns = list(s)\r\n\r\ncounts = 0\r\ncountf = 0\r\n\r\nfor i in range(1,len(s)) :\r\n if (s[i-1] == 'S') and (s[i] == 'F') :\r\n counts += 1\r\n elif (s[i-1] == 'F') and (s[i] == 'S') :\r\n countf += 1\r\n\r\nif counts > countf :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "a = int(input())\r\ns = input()\r\nprint(\"YES\"if(s.count(\"SF\")>s.count(\"FS\"))else\"NO\")", "n=int(input())\r\nif n>=2 and n<=100:\r\n s=input()\r\n cs,cf=0,0\r\n for i in range(len(s)-1):\r\n if s[i]=='F' and s[i+1]=='S':\r\n cf+=1\r\n if s[i]=='S' and s[i+1]=='F':\r\n cs+=1\r\n if cs>cf:\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\r\ns=input()\r\nc1=0\r\nc2=0\r\nfor i in range(len(s)-1):\r\n if(s[i]==\"S\" and s[i+1]==\"F\"):\r\n c1=c1+1\r\n elif(s[i]==\"F\" and s[i+1]==\"S\"):\r\n c2=c2+1\r\nif(c1>c2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "a=int(input())\r\na=input()\r\nif a[0]==\"S\" and a[-1]==\"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t, n, w = int(input()), input(), 0\r\nfor i in range(0, len(n)):\r\n if i != len(n) - 1:\r\n if n[i] + n[i + 1] == 'SF':\r\n w += 1\r\n elif n[i] + n[i + 1] == 'FS':\r\n w -= 1\r\nif w > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ns = input()\r\nx = 0\r\ny = 0\r\n\r\nprev = s[0]\r\nfor curr in s[1:]:\r\n if prev == 'S' and curr == 'F':\r\n x += 1\r\n elif prev == 'F' and curr == 'S':\r\n y += 1\r\n prev = curr\r\n\r\nif x > y: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input()\na = 0\nb = 0\nfor i in range(1,n):\n if(s[i] == \"S\" and s[i-1] == \"F\"):\n a += 1\n elif(s[i] == \"F\" and s[i-1] == \"S\"):\n b += 1\nif(a>=b):\n print(\"NO\")\nelse:\n print(\"YES\")", "n = int(input())\r\ns = str(input())\r\ncnt1 = 0\r\ncnt2 = 0\r\nfor i in range(n-1):\r\n if s[i] == 'S' and s[i+1] == 'F' :\r\n cnt1+=1\r\n elif s[i] == 'F' and s[i+1] == 'S' :\r\n cnt2+=1\r\nif cnt1>cnt2 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nif b[0]=='S' and b[-1]=='F':\r\n print('YES')\r\nelse:\r\n print('NO')", "_ = input()\r\nresT = resF = 0\r\nl = list(input())\r\ns = l[0]\r\nfor j in l:\r\n if j != s :\r\n if j == 'F':\r\n resT += 1\r\n else:\r\n resF += 1\r\n s = j\r\nres = \"YES\" if resT > resF else \"NO\"\r\nprint(res)", "n = int(input())\nnstr = input()\n\nsf_count = 0\nfs_count = 0\n\nfor x in range(len(nstr)-1):\n if nstr[x] != nstr[x+1]:\n if nstr[x] == \"S\":\n sf_count +=1\n else:\n fs_count +=1\n\nif sf_count > fs_count:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "t = int(input())\r\ncity = input().upper()\r\nif city.count('SF')>city.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "days = map(int, input().split())\r\nlocations=input()\r\n# days=4\r\n# locations ='FSSFFFSFS'\r\ntrips_to_f = 0\r\ntrips_to_s = 0\r\nfor i in range(len(locations)-1):\r\n # print(locations[i])\r\n if locations[i+1] == 'F' and locations[i] == 'S':\r\n trips_to_f += 1\r\n elif locations[i+1] == 'S' and locations[i] == 'F':\r\n trips_to_s += 1\r\nif trips_to_f > trips_to_s:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "n = int(input())\r\na = input()\r\nsum1 = 0\r\nsum2 = 0\r\nif set(a) == \"F\" or set(a) == \"S\":\r\n print(\"NO\")\r\nelse:\r\n for i in range(1, len(a) ):\r\n if a[i] == \"F\" and a[i - 1] == \"S\":\r\n sum1 += 1\r\n elif a[i] == \"S\" and a[i - 1] == \"F\":\r\n sum2 += 1\r\nif sum1 > sum2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nst=input()\r\nsumfs=0\r\nsumsf=0\r\ni=0\r\nwhile i<n-1:\r\n if st[i]=='S' and st[i+1]=='F':\r\n sumsf+=1\r\n i+=1\r\n elif st[i]=='F' and st[i+1]=='S':\r\n sumfs+=1\r\n i+=1\r\n else:\r\n i+=1\r\nif sumsf>sumfs:\r\n print('YES',end='')\r\nelse:\r\n print('NO',end='')\r\n", "x=int(input())\r\nn=input()\r\ns=0\r\nd=0\r\nar=[]\r\nfor i in n:\r\n ar.append(i)\r\nfor j in range(1,x):\r\n if(ar[j]==\"F\" and ar[j-1]==\"S\"):\r\n s=s+1\r\n elif(ar[j]==\"S\" and ar[j-1]==\"F\"):\r\n d=d+1\r\nif(s>d):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "i=input\nn=int(i())\ndays=i()\nif days.count('SF') > days.count('FS'):\n print('YES')\nelse:\n print('NO')\n", "n = int(input(\"\"))\ns = input(\"\")\nsf = 0\nfs = 0\nk = s[0]\nfor i in range(1,n):\n if(s[i] == \"S\" and k == \"F\"):\n fs += 1\n elif(s[i] == \"F\" and k == \"S\"):\n sf += 1\n k = s[i]\nif(sf > fs):\n trips = \"YES\"\nelse:\n trips = \"NO\"\nprint(trips) \n", "R = lambda:[*map(int,input().split())]\r\nn = R()\r\ns = input()\r\nS = s.count('FS')\r\nF = s.count('SF')\r\nif S<F:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n = int(input())\r\nd = input()\r\n# yes if flew more times from s to f, no otherwise\r\ns = 0 # to s\r\nf = 0 # to f\r\n\r\nfor i in range(len(d)-1):\r\n if d[i] == 'S' and d[i+1] == 'F':\r\n f += 1\r\n elif d[i] == 'F' and d[i+1] == 'S':\r\n s += 1\r\n\r\nif f > s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "days = int(input())\r\ntravel = input()\r\nday_counter = 0\r\nday_counter_1 = 2\r\nsf_counter = 0\r\nfs_counter = 0\r\n\r\nwhile day_counter <= days:\r\n if \"SF\" in travel[day_counter:day_counter_1]:\r\n sf_counter += 1\r\n elif \"FS\" in travel[day_counter:day_counter_1]:\r\n fs_counter += 1\r\n day_counter += 1\r\n day_counter_1 += 1\r\n\r\nif sf_counter > fs_counter:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "N = int(input())\ns = input()\nF = 0\nS = 0\nfor i in range(1,N):\n if s[i] != s[i - 1]:\n if s[i] == \"F\":\n F += 1\n else:\n S += 1\nans = \"YES\"\nif F <= S:\n ans = \"NO\"\nprint(ans)\n\n", "n = int(input())\r\ns = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(0,n -1 ,1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n sf+=1\r\n elif s[i]=='F' and s[i+1] == 'S':\r\n fs+=1\r\nif (sf>fs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nphrase = input()\r\nsf = phrase.count('SF')\r\nfs = phrase.count('FS')\r\nif(sf>fs): print(\"YES\")\r\nelse: print(\"NO\")", "booseted = int(input(''))\ntravel_log = input('')\n\nsf = travel_log.count('SF')\nfs = travel_log.count('FS')\n\nif sf > fs:\n print('YES')\nelse:\n print('NO')", "n = input().split()\r\nDay = input() #FSSF SSFFSFFSFF\r\n\r\nf = 0\r\ns = 0\r\n\r\nfor i in range(len(Day) - 1):\r\n if Day[i] == 'F':\r\n if Day[i + 1] == 'S':\r\n f += 1\r\n \r\nfor i in range(len(Day) - 1):\r\n if Day[i] == 'S':\r\n if Day[i + 1] == 'F':\r\n s += 1\r\nif s > f:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n", "import re\r\nt=int(input())\r\ns=input()\r\ncountsf = len(re.findall('(?=SF)', s))\r\ncountfs = len(re.findall('(?=FS)', s))\r\nif countsf>countfs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "\r\nn = int(input())\r\ns = input()\r\nsf, fs = 0, 0\r\nfor i in range(n-1):\r\n if s[i]+s[i+1] == \"FS\":\r\n fs += 1\r\n elif s[i]+s[i+1] == \"SF\":\r\n sf += 1\r\n\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = str(input())\r\nif a[0] == 'S' and a[n-1] == 'F': print('YES') \r\nelse: print('NO')\r\n \r\n", "# input the number flights\r\nt = int(input())\r\n# input the string s\r\ns = str(input())\r\n# set intial counts to 0\r\nseattleCounts=0\r\nsanFranciscoCounts=0\r\n# loop over range of len(s) starting from 1\r\nfor i in range(1,len(s)):\r\n # check if the day before we were in S then went to F\r\n if s[i-1] == 'S' and s[i]== 'F':\r\n sanFranciscoCounts+=1\r\n # else if we were in F and then went to S\r\n elif s[i-1] == 'F' and s[i]== 'S':\r\n seattleCounts+=1\r\nif seattleCounts < sanFranciscoCounts:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nb = input()\r\nb = list(b)\r\ne = int()\r\nf = int()\r\n\r\nfor x in range(a):\r\n if x < (a-1):\r\n if b[x] == b[x+1]:\r\n pass\r\n elif b[x] < b[x+1]:\r\n f = f + 1\r\n elif b[x] > b[x+1]:\r\n e = e + 1\r\n\r\nif e > f: \r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\ns = input()\r\nF_S = 0\r\nS_F = 0\r\nprevious = ''\r\n\r\nfor i in s:\r\n if i == 'F':\r\n if previous == 'S':\r\n S_F+=1\r\n elif i == 'S':\r\n if previous == 'F':\r\n F_S+=1\r\n previous = i\r\n \r\nif F_S>=S_F:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nplace= input()\r\n\r\n\r\nsf = 0\r\nfs =0\r\nfor i in range(0,n-1):\r\n if place[i] == \"S\":\r\n if place[i+1] == \"F\":\r\n sf+=1\r\n\r\n else:\r\n pass\r\n\r\n else:\r\n if place[i+1]==\"S\":\r\n fs+=1\r\n\r\n else:\r\n pass\r\n\r\n\r\nif sf > fs :\r\n print (\"YES\")\r\n\r\nelse:\r\n print (\"NO\")\r\n \r\n\r\n\r\n", "n = int(input())\r\nlst = list(input())\r\nseasan = 0\r\nsansea = 0\r\nfor i in range(n - 1):\r\n first = lst[i]\r\n second = lst[i + 1]\r\n if(first == 'S' and second == 'F'):\r\n seasan += 1\r\n elif(first == 'F' and second == 'S'):\r\n sansea += 1\r\nprint(\"YES\" if seasan > sansea else \"NO\")", "n = int(input())\r\na = input()\r\nx,y = 0,0\r\nfor i in range(len(a)-1):\r\n\tc =a[i:i+2]\r\n\tif a[i:i+2] == \"SF\":\r\n\t \tx+=1\r\n\telif a[i:i+2] == \"FS\":\r\n\t \ty+=1\r\nif x>y:\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\")", "n = int(input())\r\ns = input()\r\nx = []\r\nduo = []\r\n\r\nfor i in s:\r\n\tx.append(i)\r\n\r\nfor i in range(0,n-1):\r\n\tduo.append(x[i]+x[i+1])\r\n\r\nSF = duo.count(\"SF\")\r\nFS = duo.count(\"FS\")\r\n\r\nif SF > FS:\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\")", "n=int(input())\r\nS=input()\r\nA=S.count(\"SF\")\r\nB=S.count(\"FS\")\r\nif A>B:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c_flights=int(input())\r\nflights=input()\r\nsanfrancisco=0\r\nseattle=0\r\nfor i in range(c_flights-1):\r\n if flights[i]=='S' and flights[i+1]=='F':\r\n seattle+=1\r\n if flights[i]=='F' and flights[i+1]=='S':\r\n sanfrancisco+=1\r\nif seattle>sanfrancisco:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\na=list(map(str,input().split()))\r\nc=0\r\nd=0\r\nfor i in range(n-1):\r\n\tif a[0][i]==\"S\" and a[0][i+1]==\"F\":\r\n\t\tc+=1\r\n\tif a[0][i]==\"F\" and a[0][i+1]==\"S\":\r\n\t\td+=1\r\nif (c>d):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\t\t\r\n", "n = int(input())\r\nword = input()\r\nif word.startswith('S') and word.endswith('F'):\r\n print('YES')\r\nelse:\r\n print('NO')", "b = int(input())\r\na = input()\r\nse = 0\r\nsf = 0\r\nfor i in range(0, len(a)-1):\r\n if a[i] == 'S' and a[i+1] == 'F':\r\n se = se+1\r\n elif(a[i] == 'F' and a[i+1] == 'S'):\r\n sf = sf+1\r\nif se > sf:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def betweenOffices(n, places):\r\n StoF = 0\r\n FtoS = 0\r\n for i in range(n - 1):\r\n if places[i] == \"S\" and places[i + 1] == \"F\":\r\n StoF += 1\r\n if places[i] == \"F\" and places[i + 1] == \"S\":\r\n FtoS += 1\r\n if FtoS < StoF:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nn = int(input())\r\nplaces = input()\r\nprint(betweenOffices(n, places))", "n = int(input())\r\ns = input()\r\na = 0\r\nb = 0\r\nc = 0\r\nfor i in range(n-1):\r\n if(s[i] == s[i+1]):\r\n c += 1\r\nif(c == len(s)-1):\r\n print(\"NO\")\r\nelse:\r\n for i in range(n-1):\r\n if(s[i] == 'S' and s[i+1] == 'F'):\r\n a += 1\r\n if(s[i] == 'F' and s[i+1] == 'S'):\r\n b += 1\r\n if(a > b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a=int(input())\nb=input()\nc=0\nk=0\nfor i in range(a-1):\n if b[i:i+2]==\"SF\":\n c+=1\n elif b[i:i+2]==\"FS\":\n k+=1\n\n\nif c>k:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "siz=int(input())\r\nst=input()\r\nse=0\r\nsa=0\r\nfor i in range(siz-1):\r\n if st[i]=='S' and st[i+1]=='F':\r\n sa+=1\r\n elif st[i]=='F' and st[i+1]=='S':\r\n se+=1\r\n\r\nif sa>se:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "z=int(input())\r\ny=str(input())\r\nsea=0\r\nfra=0\r\nfor i in range(z) :\r\n if i+1<=z-1:\r\n if y[i]==\"S\" :\r\n if y[i+1]==\"F\":\r\n sea+=1\r\n elif y[i]==\"F\" :\r\n if y[i+1]==\"S\" :\r\n fra+=1\r\nif sea>fra :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n", "n=int(input())\r\ns=input()\r\nfa,sa=0,0\r\nfor i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n if s[i]=='F':\r\n sa+=1 \r\n else:\r\n fa+=1 \r\nif fa>sa:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\nn=int(input())\r\np=input()\r\nif p.startswith(\"S\") and p.endswith(\"F\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\ny=input()\r\nc=y.count('SF')\r\nd=y.count('FS')\r\nprint('YES' if c>d else \"NO\" )", "n = int(input())\r\na = input()\r\na += 'e'\r\ncounter_from_seattle = 0\r\ncounter_to_seattle = 0\r\nfor i in range(n):\r\n if a[i] + a[i+1] == \"SF\":\r\n counter_from_seattle += 1\r\n elif a[i] != a[i+1]:\r\n counter_to_seattle += 1\r\n\r\nif counter_from_seattle > counter_to_seattle-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nk=input()\r\nf=0\r\ns=0\r\nfor i in range(n-1):\r\n if \"S\" in k[i] and 'F' in k[i+1]:\r\n s+=1\r\n elif \"F\" in k[i] and 'S' in k[i+1]:\r\n f+=1\r\n \r\nif s>f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\nkf = 0\r\nks = 0\r\ntemp = s[0]\r\nfor i in range(1, len(s)):\r\n if (temp != s[i]) and (s[i] == 'F'):\r\n temp = s[i]\r\n kf += 1\r\n elif (temp != s[i]) and (s[i] == 'S'):\r\n temp = s[i]\r\n ks += 1\r\nif kf > ks:\r\n print('YES')\r\nelse:\r\n print('NO')", "no = input()\r\nchar = input()\r\nf, s = 0, 0\r\nx = len(char)\r\nif char[0] == 'S' and char[x-1] == 'F':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\na = input()\r\nf = 0\r\ns = 0\r\nfor i in range(1, n):\r\n if a[i] == 'S'and a[i - 1] == 'F':\r\n f += 1\r\n elif a[i] == 'F' and a[i - 1] == 'S':\r\n s += 1\r\nif s > f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\nprint('YES' if (s.count('SF') > s.count('FS')) else 'NO')\r\n", "input()\nlet = input()\nif let[0] == 'S' and let[-1] == 'F':\n print('Yes')\nelse:\n print('NO')\n", "n = int(input())\nstr = input()\nprint('YES' if str.count('SF') > str.count('FS') else 'NO')", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nn_string = sys.stdin.readline()\r\n\r\ndef offices(n,n_string):\r\n s_to_f = 0\r\n f_to_s = 0\r\n for i in range(len(n_string)-1):\r\n if n_string[i] == \"S\" and n_string[i+1] == \"F\":\r\n s_to_f += 1\r\n elif n_string[i] == \"F\" and n_string[i+1] == \"S\":\r\n f_to_s += 1\r\n\r\n if s_to_f > f_to_s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\noffices(n,n_string)\r\n", "def manager(n, s):\r\n c1 = 0\r\n c2 = 0\r\n for i in range(n - 1):\r\n if(s[i] == 'S' and s[i + 1] == 'F'):\r\n c1 = c1 + 1\r\n elif(s[i] == 'F' and s[i + 1] == 'S'):\r\n c2 = c2 + 1\r\n if(c1 > c2):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nn = int(input())\r\ns = str(input())\r\nprint(manager(n, s))", "n = int(input())\r\ns = input()\r\n\r\nsf = s.count('SF')\r\nfs = s.count('FS')\r\n\r\nif(fs < sf):\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\nn = int(input())\ncube = lambda n: n ** 3\nprint(cube(n))\n'''\n'''\nn = int(input())\na = list(map(int, input().split()))\nzero = 0\nfor i in range(n - 1):\n\tif a[i] < a[i + 1] and a[i] > a[i + 1]:\n\t\tzero += 1\nprint(zero)\n'''\n'''\nn = int(input())\nif n % 2 == 0:\n\tprint('Mahmoud')\nelse:\n\tprint('Ehab')\n'''\n'''\nn = int(input())\nzero = 0\nlis = [100, 20, 5, 1]\nfor i in lis:\n\twhile n >= i:\n\t\tn -= i\n\t\tzero += 1\nprint(zero)\n'''\nn = int(input()) ; s = input()\nfrancisco = 0 ; seattle = 0\nfor i in range(n - 1):\n\tif s[i] == 'F' and s[i + 1] == 'S':\n\t\tfrancisco += 1\n\telif s[i] == 'S' and s[i + 1] == 'F':\n\t\tseattle += 1\nif seattle > francisco:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "n=int(input())\r\ns=input()\r\nf2s=0\r\ns2f=0\r\nfor i in range(n-1):\r\n if s[i+1]=='F' and s[i]=='S':\r\n s2f+=1\r\n elif s[i+1]=='S' and s[i]=='F':\r\n f2s+=1\r\nif s2f>f2s:\r\n print('yes')\r\nelse:\r\n print('no')", "n = int(input())\r\nflight = input()\r\nsf = fs = 0\r\nfor i in range(n-1):\r\n if(flight[i]=='S' and flight[i+1]=='F'):\r\n sf += 1\r\n elif(flight[i]=='F' and flight[i+1]=='S'):\r\n fs += 1\r\nif(sf>fs):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n", "numOfDays=(int(input()))\r\nstr=input()\r\nif str[0]=='S' and str[numOfDays-1]=='F':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "i = input()\r\ni = int(i)\r\ns = input()\r\n\r\nif s[0] == 'S' and s[i-1] == 'F':\r\n\tprint ('YES')\r\nelse:\r\n\tprint ('NO')", "t=int(input())\r\ns=str(input())\r\nl=s.count('SF')\r\nm=s.count('FS')\r\n#print(l,m)\r\nif l>m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nm=input()\r\nc=m.count('FS')\r\nd=m.count('SF')\r\nif m=='SF':\r\n\tprint('YES')\r\nelif d>c:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "input()\r\nc = input()\r\nprint(['NO','YES'][c[0]=='S' and c[-1] =='F'])", "#!/bin/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\n# Complete the function below.\r\nm= int(input())\r\ns= str(input())\r\n\r\na=s.count(\"SF\")\r\nb=s.count(\"FS\")\r\nif a>b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nn = input()\r\np = 0 \r\nw = 0\r\n\r\nfor i in range(a - 1):\r\n if n[i] == 'S' and n[i+1] == 'F':\r\n p = p + 1\r\n if n[i] == 'F' and n[i+1] == 'S':\r\n w = w + 1\r\nif p > w:\r\n print('YES')\r\nelse: \r\n print('NO')", "a=int(input())\r\nb=str(input())\r\nx=0\r\ny=0\r\nfor i in range(a-1):\r\n if b[i]=='S' and b[i+1]=='F':\r\n x+=1\r\n elif b[i]=='F' and b[i+1]=='S':\r\n y+=1\r\n else:\r\n x+=0\r\n y+=0\r\nif x>y:\r\n print('YES')\r\nelif x==0 or y==0:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ns = input()\r\n\r\nseattle_to_sf = 0\r\nsf_to_seattle = 0\r\n\r\nfor i in range(n-1):\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n seattle_to_sf += 1\r\n elif s[i] == 'F' and s[i+1] == 'S':\r\n sf_to_seattle += 1\r\n\r\nif seattle_to_sf > sf_to_seattle:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num_len = int(input())\r\ns = input()\r\n\r\nstf = 0\r\nfts = 0\r\n\r\nfor i in range(1, num_len):\r\n if s[i] != s[i-1]:\r\n if s[i] == 'S':\r\n fts += 1\r\n else:\r\n stf += 1\r\n \r\nif stf > fts:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\n\r\nFtoS = 0\r\nStoF = 0\r\n\r\nfor i in range(1, n):\r\n if s[i - 1] == \"F\" and s[i] == \"S\":\r\n FtoS += 1\r\n elif s[i - 1] == \"S\" and s[i] == \"F\":\r\n StoF += 1\r\n\r\nif StoF > FtoS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nschedule = input()\r\n\r\nif schedule.count('SF') > schedule.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nflights=input().upper()\r\nf=0\r\ns=0\r\nfor i in range(n-1):\r\n if flights[i]=='S' and flights[i+1]=='F':\r\n f+=1\r\n if flights[i]=='F' and flights[i+1]=='S':\r\n s+=1\r\nif f>s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-30 23:02:00\nLastEditTime: 2021-11-30 23:08:39\nDescription: Between the Offices\nFilePath: CF867A.py\n'''\n\n\ndef func():\n n = int(input())\n s = input().strip()\n count1, count2 = 0, 0\n for i in range(n - 1):\n if s[i] == \"S\" and s[i + 1] == \"F\":\n count1 += 1\n if s[i] == \"F\" and s[i + 1] == \"S\":\n count2 += 1\n print(\"YES\" if count1 > count2 else \"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "a = int(input())\ns = input()\nb, l = 0, 0\nfor i in range(a - 1):\n if s[i] == 'S' and s[i + 1] == 'F':\n b += 1\n elif s[i] == 'F' and s[i + 1] == 'S':\n l += 1\nif b > l:\n print('YES')\nelse:\n print('NO')\n", "def main(string):\r\n if string.count('SF')>string.count('FS'):\r\n return \"YES\"\r\n return \"NO\"\r\ninput()\r\nprint(main(input()))", "n=int(input())\r\ns=input()\r\nc1=s.count(\"SF\")\r\nc2=s.count(\"FS\")\r\nif c1>c2:\r\n print(\"YES\")\r\nelif c1<c2:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nst = input()\r\nsf,fs = 0,0\r\n\r\nfor i in range(n-1):\r\n if st[i]=='S' and st[i+1]=='F':\r\n sf+=1\r\n elif st[i]=='F' and st[i+1]=='S':\r\n fs+=1\r\n \r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=int(input())\nb=input()\ni=0\ncountfs=0\ncountsf=0\nwhile (i+1)<a:\n if b[i]==\"F\" and b[i+1]==\"S\":\n countfs+=1\n elif b[i]==\"S\" and b[i+1]==\"F\":\n countsf+=1\n i+=1\nif countsf>countfs:\n print(\"YES\")\nelse:\n print(\"NO\")", "d = int(input())\r\nflights = input()\r\nSF_cnt = 0\r\nFS_cnt = 0\r\nif flights.count(\"SF\") > flights.count(\"FS\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\n\r\na = 0\r\nb = 0\r\n\r\nfor i in range(len(s)-1):\r\n if(s[i]+s[i+1]=='SF'):\r\n a+=1\r\n elif(s[i]+s[i+1]=='FS'):\r\n b+=1\r\n\r\nprint('YES' if a>b else 'NO')\r\n", "#Between the Offices\nn=int(input())\ns=str(input())\nsf=s.count(\"SF\")\nfs=s.count(\"FS\")\nif(sf>fs):\n\tprint('YES')\nelse:\n\tprint(\"NO\")", "n = int(input())\r\nd = input()\r\ns=0\r\nf=0\r\nfor i in range(len(d)-1):\r\n \r\n if d[i] != d[i+1]:\r\n if d[i] == 'F':\r\n f += 1\r\n else:\r\n s += 1\r\nif s>f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input(\"\")\r\ntravels = str(input(\"\"))\r\n\r\ns2f = 0\r\nf2s = 0\r\n\r\nfor i in range(len(travels)- 1):\r\n if travels[i] == \"S\" and travels[i+1] == \"F\":\r\n s2f += 1\r\n elif travels[i] == \"F\" and travels[i+1] ==\"S\":\r\n f2s += 1\r\n else:\r\n continue\r\nif s2f > f2s :\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "n = int (input())\r\nw = str (input())\r\nw.upper()\r\na1 = 'SF'\r\na2 = 'FS'\r\nb1 = w.count(a1)#Number of flights from Seattle to San Francisco\r\nb2 = w.count(a2)#Number of flights from San Francisco to Seattle \r\nif b1>b2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\na = str(input())\r\nx = 0\r\ny = 0\r\nfor i in range(n-1):\r\n if a[i] == \"S\" and a[i+1] == \"F\":\r\n x = x + 1\r\n elif a[i] == \"F\" and a[i+1] == \"S\":\r\n y = y + 1\r\n else:\r\n continue\r\nif x > y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=input()\r\nsf=0\r\ns=0\r\nfor i in range(n-1):\r\n if(l[i]==\"S\" and l[i+1]==\"F\"):\r\n s=s+1\r\n if(l[i]==\"F\" and l[i+1]==\"S\"):\r\n sf=sf+1\r\nif(s>sf):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n,flight = int(input()),input()\r\nif flight[0] == 'S' and flight[len(flight)-1] == 'F':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\na = input()\r\ns = a.count(\"SF\")\r\nf = a.count('FS')\r\nif s>f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\nlast = \"\"\r\n\r\nsf = 0\r\nfs = 0\r\n\r\nfor c in s:\r\n if last + c == \"FS\":\r\n fs += 1\r\n elif last + c == \"SF\":\r\n sf += 1\r\n last = c\r\n\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input()\r\ns = input().lower()\r\ns2f = s.count('sf')\r\nf2s = s.count('fs')\r\nif s2f > f2s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def bw_ofc(offices):\r\n\tofcs = {'F':0,'S':0}\r\n\tfor i in range(1,len(offices)):\r\n\t\tif offices[i] != offices[i-1]:\r\n\t\t\tofcs[offices[i-1]]+=1\t\t\r\n\tif ofcs['F']>=ofcs['S']:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input().strip(\" \"))\r\n\toffices = input().strip(\" \")\r\n\tbw_ofc(offices)", "n = int(input())\r\ns = input()\r\nstof = 0\r\nftos = 0\r\nfor i in range(len(s) - 1):\r\n\tif(s[i] == 'S'):\r\n\t\tif(s[i+1] == 'F'):\r\n\t\t\tstof += 1\r\n\telse:\r\n\t\tif(s[i+1] == 'S'):\r\n\t\t\tftos += 1\r\nif(stof > ftos):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\nstr=input()\r\nc=0\r\nfor i in range(1,n):\r\n if str[i]!=str[i-1]:\r\n c=c+1\r\nif c%2!=0 and str[0]=='S':\r\n print('YES')\r\nelse:\r\n print('NO')", "class Main():\r\n n = int(input())\r\n places = input()\r\n sf = places.count('SF')\r\n fs = places.count('FS')\r\n print('YES') if sf>fs else print('NO')\r\n\r\n\r\nif __name__ == '__main__': Main()\r\n", "n=int(input())\r\ns=input()\r\ncount=0\r\ncount1=0\r\nfor i in range(0,len(s)-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n count=count+1\r\n elif s[i]=='F' and s[i+1]=='S':\r\n count1=count1+1\r\n else:\r\n continue\r\nif count>count1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input()\r\nt = input()\r\nprint(['NO', 'YES'][t[0]=='S' and t[-1] =='F'])", "input(); a = input()\r\nif (a[0]== \"S\" and a[-1] == \"F\") and (a[0]!=a[-1]):\r\n print(\"\\nYES\")\r\nelse:\r\n print(\"\\nNO\")", "no_of_days = int(input(\"\"))\r\nplaces = input(\"\")\r\nS_to_F = 0\r\nF_to_S = 0\r\nfor day in range(0,no_of_days-1):\r\n if places[day] != places[day+1]:\r\n if places[day] == \"S\":\r\n S_to_F += 1\r\n else:\r\n F_to_S += 1\r\nif S_to_F > F_to_S:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nstring = input()\r\na = 0\r\nb = 0\r\nfor i in range(n - 1):\r\n if string[i] != string[i + 1]:\r\n if string[i] == \"S\":\r\n a += 1\r\n else:\r\n b += 1\r\nif a > b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "length = int(input())\r\ncities = input()\r\n\r\nfs = 0\r\nsf = 0\r\n\r\nfor i in range(1,length):\r\n if cities[i-1]=='F' and cities[i]=='S':\r\n fs += 1\r\n elif cities[i-1]=='S' and cities[i]=='F':\r\n sf += 1\r\n\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=int(input())\r\nb=input()\r\nc=0\r\nd=0\r\nfor i in range(a-1):\r\n if b[i]=='F':\r\n if b[i+1]=='S':\r\n c=c+1\r\n if b[i]=='S':\r\n if b[i+1]=='F':\r\n d=d+1\r\nif d>c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\nstring = input()\nif string[0]=='S' and string[-1]=='F':\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\r\noffice = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(len(office)-1):\r\n if office[i] == 'S' and office[i+1] == 'F':\r\n sf += 1\r\n elif office[i] == 'F' and office[i+1] == 'S':\r\n fs += 1\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# import sys\r\n# sys.stdin=open(\"test11.in\",\"r\")\r\n# sys.stdout=open(\"test11.out\",\"w\")\r\n\r\nn=int(input())\r\na=input()\r\ns=0\r\nf=0\r\nfor i in range(len(a)-1):\r\n\tif a[i]==\"S\" and a[i+1]==\"F\":\r\n\t\ts+=1\r\n\telif a[i]==\"F\" and a[i+1]==\"S\":\r\n\t\tf+=1\r\nif(s>f):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "def count_flights(directions):\r\n seattle_to_sf = directions.count(\"SF\")\r\n sf_to_seattle = directions.count(\"FS\")\r\n return \"YES\" if seattle_to_sf > sf_to_seattle else \"NO\"\r\nn = int(input())\r\noffice_visits = input().strip()\r\nprint(count_flights(office_visits))\r\n", "n=int(input())\r\ns=input()\r\nsf=0\r\nfs=0\r\ni=0\r\nfor i in range(len(s)-1):\r\n if(s[i]=='S' and s[i+1]=='F'):\r\n sf=sf+1 \r\n elif(s[i]=='F' and s[i+1]=='S'):\r\n fs=fs+1\r\n \r\n \r\nif(sf>fs):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "n = input(); str = input(); Seattle = str.count(\"SF\"); SanFrancisco = str.count(\"FS\"); print(\"YES\") if Seattle > SanFrancisco else print(\"NO\")", "n = int(input())\r\ns = input()\r\n\r\ngood = 0\r\nbad = 0\r\n\r\nfor i in range(n - 1):\r\n if s[i] + s[i + 1] == \"FS\":\r\n bad += 1\r\n if s[i] + s[i + 1] == \"SF\":\r\n good += 1\r\n\r\nif good > bad:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a= int(input())\r\nc = input()\r\ns = 0\r\nf= 0\r\n\r\nfor i in range(a-1):\r\n if c[i] == \"S\" and c[i+1] == \"F\":\r\n f+=1\r\n if c[i] == \"F\" and c[i+1] == \"S\":\r\n s+=1\r\nif f > s:\r\n print(\"YES\")\r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\nm = input()\na = None\ncount = 0\nfor o in m:\n if a is None:\n a = o\n elif a != o :\n a = o\n count = count + 1\n else: continue\n\nif count % 2 == 0 :\n print('NO')\nelif m[0] == \"S\":\n print('YES')\nelse:\n print('NO')\n", "n = int(input())\r\ns = input()\r\ns_f = 0\r\nf_s = 0\r\nfor i in range(0,n-1):\r\n if s[i] == \"F\" and s[i+1] == \"S\":\r\n f_s += 1\r\n elif s[i] == \"S\" and s[i+1] == \"F\":\r\n s_f += 1 \r\nif s_f > f_s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "N=int(input())\r\ndays=input()\r\ncountf=count=0\r\nprevious=days[0]\r\nfor i in days:\r\n current=i\r\n if previous!=current:\r\n if previous==\"S\":\r\n count=count+1\r\n else:\r\n countf=countf+1\r\n previous=i \r\nif(count>countf):\r\n print('YES')\r\nelse:\r\n print('NO') \r\n \r\n \r\n ", "n = int(input())\r\ns = input()\r\nF = S = 0\r\n\r\nfor i in range (len(s)):\r\n if(i == len(s) - 1):\r\n break\r\n elif(s[i] == 'F' and s[i+1] == 'S'):\r\n F += 1\r\n elif(s[i] == 'S' and s[i+1] == 'F'):\r\n S += 1\r\nif(S > F):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n\r\n", "n = int(input())\r\nstr1 = input()\r\nif(n== len(str1)):\r\n if(str1[0]=='S' and str1[n-1] =='F'):\r\n\t print('YES')\r\n else:\r\n\t print('NO')", "nF = int(input())\r\nfL = list(input())\r\nsF = 0\r\nfS = 0\r\n\r\nfor i in range(nF - 1):\r\n if(fL[i] == \"F\"):\r\n if(fL[i+1] == \"S\"):\r\n fS += 1\r\n elif(fL[i] == \"S\"):\r\n if(fL[i+1] == \"F\"):\r\n sF += 1\r\n\r\nif(sF > fS):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\ns = input()\r\n\r\ns2 = ''\r\nfor ch in s:\r\n if len(s2) == 0 or ch != s2[-1]:\r\n s2 += ch\r\n\r\n\r\ns2 = s2[1:]\r\nx = 0\r\nfor ch in s2:\r\n x += 1 if ch == 'F' else -1\r\n\r\nprint('YES' if x > 0 else 'NO')\r\n", "import math\r\nimport collections\r\nimport bisect\r\n \r\n \r\n \r\ndef cint() : return list(map(int, input().split())) \r\ndef cstr() : return list(map(str, input().split(' '))) \r\n \r\n\r\ndef solve():\r\n n = int(input())\r\n word = input()\r\n\r\n counter1 = 0\r\n counter2 = 0\r\n\r\n prev = ''\r\n for i in range(n):\r\n if i==0:\r\n prev = word[i]\r\n else:\r\n if prev == 'F' and word[i] == 'S':\r\n counter1+=1\r\n prev = 'S'\r\n elif prev == 'S' and word[i] == 'F':\r\n counter2+=1\r\n prev = 'F'\r\n \r\n if counter2 > counter1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n while t!=0:\r\n solve()\r\n t-=1", "n = int(input())\r\nroute = input()\r\nsf =0 \r\nfs = 0\r\nfor i in range(1,len(route)):\r\n if route[i-1] == 'S' and route[i] == 'F' :\r\n sf+=1\r\n elif route[i-1] == 'F' and route[i] == 'S' :\r\n fs+=1\r\nif sf > fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\nn = int(input())\r\nflight = input()\r\nre_fs = r'(FS)'\r\nre_sf = r'(SF)'\r\ns_f = len(re.findall(re_sf, flight))\r\nf_s = len(re.findall(re_fs, flight))\r\nprint(\"YES\" if s_f > f_s else \"NO\")", "n = int(input())\ns = input()\n\nif s[0:1] == \"S\" and s[n-1:n] == \"F\":\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\ns = input()\r\ntotal_s_f = 0\r\ntotal_f_s = 0\r\nfor i in range(1, n):\r\n if s[i] == 'S' and s[i - 1] == 'F':\r\n total_f_s += 1\r\n elif s[i] == 'F' and s[i - 1] == 'S':\r\n total_s_f += 1\r\nif total_s_f > total_f_s:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\na=list(input())[:n]\r\ncount=0\r\nk=0\r\nf=0\r\nfor i in range(len(a)-1):\r\n if a[i]==\"S\" and a[i+1]==\"F\":\r\n count=count+1\r\n elif a[i]==\"F\" and a[i+1]==\"S\" :\r\n k+=1\r\n elif a[i]==\"F\" and a[i]==\"F\":\r\n f=1\r\n else:\r\n f=1\r\nif count>k :\r\n print(\"YES\")\r\nelif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "days=int(input())\nstring=input()\nsf_count=string.count('SF')\nfs_count=string.count('FS')\nif sf_count>fs_count:\n\tprint('YES')\nelse:\n\tprint('NO')\n\n", "x=input()\r\nn=input()\r\nif n.count('SF') > n.count('FS'):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\narr = list(input())\ns2f = 0\nf2s = 0\n\nfor i in range(n-1):\n\tif arr[i] == 'S' and arr[i+1] == 'F':\n\t\ts2f+=1\n\telif arr[i] == 'F' and arr[i+1] == 'S':\n\t\tf2s+=1\n\telse:pass\nif s2f > f2s:\n\tprint(\"YES\")\nelse:print(\"NO\")\t \t\t\t\n", "n = int(input())\r\ns = input()\r\nts, tf = 0, 0\r\nl = \"N\"\r\n\r\nfor i in range(n):\r\n if s[i] != l:\r\n if l == \"F\":\r\n ts += 1\r\n elif l == \"S\":\r\n tf += 1\r\n l = s[i]\r\nif tf > ts:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\nn = int(input())\nfly_di = list(input())\nfly_di1 =''.join(fly_di)\n\na = fly_di1.count(\"SF\")\nb = fly_di1.count(\"FS\")\n\nif a > b:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\nstring=input()\r\ns1=string\r\ns2=string\r\ncnt1=0\r\ncnt2=0\r\nfor i in range(len(string)):\r\n if \"SF\" in s1:\r\n s1=s1[:s1.index(\"SF\")]+s1[s1.index(\"SF\")+2:]\r\n cnt1+=1\r\n if \"FS\" in s2:\r\n s2=s2[:s2.index(\"FS\")]+s2[s2.index(\"FS\")+2:]\r\n cnt2+=1\r\nif cnt1>cnt2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Level - 800\r\n# Link - https://codeforces.com/problemset/problem/867/A\r\n\r\nn = int(input())\r\nstring = input()\r\n\r\nif string[0] == \"S\" and string[n - 1] == \"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "d=int(input())\ns=input()\nif s.count(\"SF\")>s.count(\"FS\"):\n print(\"Yes\")\nelse:\n print(\"No\")", "n=int(input())\r\narr=input()\r\ns=0\r\nf=0\r\nfor i in range(n-1):\r\n if arr[i]=='S' and arr[i+1]== 'F':\r\n s+=1\r\n elif arr[i]=='F' and arr[i+1]== 'S':\r\n f+=1\r\nif(s>f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int (input())\r\n\r\nstring = input()\r\n\r\n\r\nseattleToSan = string.count (\"SF\")\r\nsanToSeattle = string.count (\"FS\")\r\n\r\nif seattleToSan > sanToSeattle:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "n = int(input())\r\na = input()\r\nk = 0\r\nfor i in range(n - 1):\r\n\tif a[i] == \"S\" and a[i + 1] == \"F\":\r\n\t\tk += 1\r\n\telif a[i] == \"F\" and a[i + 1] == \"S\":\r\n\t\tk -= 1\r\nif k > 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\nstl = 0 \r\nsf = 0\r\nfor i in range(1,len(s)):\r\n\tif s[i-1] == 'S' and s[i]!='S':\r\n\t\tstl+=1\r\n\telif s[i-1] == 'F' and s[i]!='F':\r\n\t\tsf+=1\r\nif stl > sf:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\ngood = 0\r\nbad = 0\r\nfor i in range(len(s)-1):\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n good += 1\r\n if s[i] == 'F' and s[i+1] == 'S':\r\n bad += 1\r\nif good > bad:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\na=input()\r\nx=y=0\r\nfor i in range(n-1):\r\n if a[i]=='S':\r\n if a[i+1]=='F':\r\n x+=1\r\n elif a[i]=='F':\r\n if a[i+1]=='S':\r\n y+=1\r\nprint('YES') if x>y else print('NO')\r\n", "ln = int(input())\r\ns = input()\r\n\r\nif s[0] == \"S\" and s[::-1][0] == \"F\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nS=input()\r\nk=0\r\nk1=0\r\nfor i in range(len(S)-1):\r\n if S[i]!=S[i+1] and S[i]=='S':\r\n k+=1\r\n elif S[i]!=S[i+1] and S[i]=='F':\r\n k1+=1\r\nif k>k1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "input()\r\ni = input()\r\nfor _ in range(101):\r\n i = i.replace(\"SS\", \"S\").replace(\"FF\", \"F\")\r\ni = i[1:]\r\nprint(\"YES\" if i.count(\"F\") > i.count(\"S\") else \"NO\")\r\n", "n = int(input())\r\nst = input()\r\nsf = 'SF'\r\nfs = 'FS'\r\nc1 = st.count(sf)\r\nc2 = st.count(fs)\r\nif c1>c2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "N=int(input())\r\nS=input()\r\na=0\r\nb=0\r\ni=0\r\nwhile i<N-1:\r\n if S[i] ==\"S\" and S[i+1] == \"F\":\r\n a+=1\r\n if S[i] ==\"F\" and S[i+1] == \"S\":\r\n b+=1\r\n i+=1\r\nif a>b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "q = input()\r\na = input()\r\nprint(['NO','YES'][a[0]=='S' and a[-1]=='F'])", "n=int(input())\r\nstrg=input()\r\narr=[]\r\narr[:0]=strg\r\ncountSF=0\r\ncountFS=0\r\n\r\nif(arr[0]=='S' and arr[-1]=='F'):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstr = input()\r\nsf = 0\r\nfs = 0\r\n\r\nfor i in range(n - 1):\r\n if(str[i:i+2] == 'FS'):\r\n fs += 1\r\n if(str[i:i+2] == 'SF'):\r\n sf += 1\r\n\r\nprint(sf > fs and 'YES' or 'NO')\r\n", "n = int(input())\r\ns = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(s) - 1):\r\n if(s[i] == 'S' and s[i+1] == 'F'):\r\n c1 += 1\r\n elif(s[i] == 'F' and s[i+1] == 'S'):\r\n c2 += 1\r\nif(c1 > c2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstr = str(input())\r\nsum = 0\r\nfor file in range(1,len(str)):\r\n\ti = str[file - 1]\r\n\tif i == \"S\" and i == str[file]:\r\n\t\tcontinue\r\n\telif i == \"S\" and str[file] != \"S\":\r\n\t\tsum += 1\r\n\telif i == \"F\" and str[file] != \"F\":\r\n\t\tsum -= 1\r\nif sum <= 0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n=int(input())\r\ns=input()\r\nA=0\r\nB=0\r\nfor i in range(n-1):\r\n if s[i:i+2]==\"SF\":\r\n A+=1\r\n elif s[i:i+2]==\"FS\":\r\n B+=1\r\nif A>B:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\np = 0 \r\nq = 0 \r\nfor i in range(len(s)-1):\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n p+=1 \r\n if s[i] == 'F' and s[i+1] == 'S':\r\n q+=1 \r\nif p>q:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "_ = int(input())\r\n\r\ncities = input()\r\n\r\nfrom_seattle = 0\r\nto_seattle = 0 \r\n\r\nfor i in range(len(cities) - 1):\r\n if (cities[i] == 'S' and cities[i+1] == 'F'):\r\n from_seattle += 1\r\n elif (cities[i] == 'F' and cities[i+1] == 'S'):\r\n to_seattle += 1\r\nprint(\"Yes\" if from_seattle > to_seattle else \"No\")", "n = int(input())\r\ns = input()\r\na, b = 0, 0\r\nprev = s[0]\r\nfor i in range(1, n):\r\n char = s[i]\r\n if char != prev:\r\n if prev == 'F':\r\n b += 1\r\n elif prev == 'S':\r\n a += 1\r\n prev = char\r\nif a > b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nlst = list(input())\r\ncount = 0\r\nfor i in range(n-1):\r\n if (lst[i]+lst[i+1]==\"FS\"):\r\n count-=1\r\n if (lst[i]+lst[i+1]==\"SF\"):\r\n count+=1\r\nif (count>0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\ns = ''\r\nfor c in input():\r\n if not s or s[-1] != c:\r\n s += c\r\n\r\ns = s[1:]\r\nprint('YES' if s.count('F') > s.count('S') else 'NO')", "n = int(input(\"\"))\nsf = list(input(\"\"))\n\n\ns2f = 0\nf2s = 0\n\nfor i in range(1,n):\n\ts2f += 1 if sf[i - 1] == 'S' and sf[i] == 'F' else 0\n\tf2s += 1 if sf[i - 1] == 'F' and sf[i] == 'S' else 0\n\nprint(\"YES\" if s2f > f2s else \"NO\")\n", "n=int(input())\r\nstring1=input()\r\nfs=string1.count(\"FS\")\r\nsf=string1.count(\"SF\")\r\nif sf>fs:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\ns = input()\r\na = s.count('FS')\r\nb = s.count('SF')\r\nif b > a:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nx=input()\r\na1= x.count(\"SF\")\r\na2= x.count(\"FS\")\r\n\r\nif a1>a2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n\tn = int(input());s = input();print('YES') if s.count('SF')> s.count('FS') else print('NO')", "n = int(input())\r\ns = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(s)-1):\r\n \tif s[i]=='S' and s[i+1]=='F':\r\n \t\tcount1+=1\r\n \tif s[i]=='F' and s[i+1]=='S':\r\n \t\tcount2+=1\r\nif count1>count2:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "len, string = int(input()), input()\r\ncount = 0\r\nfor i, j in zip(string[:-1], string[1:]):\r\n if i == \"F\" and j == \"S\":\r\n count -= 1\r\n elif i == \"S\" and j == \"F\":\r\n count += 1\r\nif count > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nx=input()\r\np=x[0]\r\nsf=0\r\nfs=0\r\nfor i in range(1,n):\r\n if x[i]=='F':\r\n if p=='S':\r\n sf+=1\r\n else:\r\n if p=='F':\r\n fs+=1\r\n p=x[i]\r\n\r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\n\r\nstring = input()\r\n\r\nS_TO_F = 0\r\n\r\nF_TO_S = 0\r\n\r\ntemp = \"\"\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n temp = string[i]\r\n else:\r\n if temp == \"S\" and string[i] == \"F\":\r\n temp = string[i]\r\n S_TO_F += 1\r\n elif temp == \"F\" and string[i] == \"S\":\r\n temp = string[i]\r\n F_TO_S += 1\r\n else:\r\n temp = string[i]\r\n \r\nif S_TO_F > F_TO_S:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=input()\r\nx=a.count(\"SF\")\r\ny=a.count(\"FS\")\r\nprint(\"YES\" if x>y else \"NO\")", "n = int(input())\r\nz = input()\r\nif z.count('SF') > z.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\n\r\nn = int(input())\r\n\r\nx = input()\r\ns = f = 0\r\nfor i in range(n - 1):\r\n if x[i] == 'S' and x[i + 1] == 'F':\r\n s = s + 1\r\n elif x[i] == 'F' and x[i + 1] == 'S':\r\n f = f + 1\r\n \r\nif s > f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nstr = input()\r\ncnt1 = 0\r\ncnt2 = 0\r\nfor i in range(1, n):\r\n if str[i - 1] == 'F' and str[i] == 'S':\r\n cnt1 += 1\r\n elif str[i - 1] == 'S' and str[i] == 'F':\r\n cnt2 += 1\r\nif cnt2 > cnt1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")# 1698064869.6158943", "n = int(input())\r\nstring = input()\r\nif string[0]=='S' and string[n-1]=='F':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nS = input()\r\n\r\ncountTrue = 0\r\ncountFalse = 0\r\nfor i in range(1, len(S)):\r\n if S[i-1] == \"S\" and S[i] == \"F\":\r\n countTrue += 1\r\n\r\n if S[i-1] == \"F\" and S[i] == \"S\":\r\n countFalse += 1\r\n# print(countTrue, countFalse)\r\nif countTrue > countFalse:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\nyes,no = 0,0\r\nfor i in range(0,n-1) :\r\n\tif (s[i] == 'S' and s[i + 1] == 'F') :\r\n\t\tyes += 1\r\n\tif (s[i] == 'F' and s[i + 1] == 'S') :\r\n\t\tno += 1\r\nif (yes > no) :\r\n\tprint (\"YES\")\r\nelse :\r\n\tprint (\"NO\")\r\n\r\n", "n=int(input())\r\na=input()\r\n\r\nif (a[0]=='S' and a[-1]=='F'):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nf=list(input())\r\na=0\r\nb=0\r\nfor i in range(n-1):\r\n\tif(f[i]==\"S\" and f[i+1]==\"F\"):\r\n\t\ta+=1\r\n\tif(f[i]==\"F\" and f[i+1]==\"S\"): \r\n\t\tb+=1\r\nif(a>b):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "t=1\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n s=input()\r\n sf=0\r\n sea=0\r\n for i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n if s[i]==\"S\":\r\n sf+=1\r\n else:\r\n sea+=1\r\n if sea>=sf:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n ", "n=int(input())\r\ns=input()\r\nsf=0\r\nfs=0\r\nfor i in range(1,n):\r\n if s[i-1]==\"S\" and s[i]==\"F\":\r\n sf+=1\r\n elif s[i-1]==\"F\" and s[i]==\"S\":\r\n fs+=1\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\nsf = 0\r\nfs = 0\r\nfor i in range(len(s)-1):\r\n if s[i]+s[i+1] == 'SF':\r\n sf += 1\r\n elif s[i]+s[i+1] == \"FS\":\r\n fs += 1\r\nif sf>fs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\n\ncnt = int(input())\nlocs = input()\n\npre, sf, fs = locs[0], 0, 0\nfor i in range(1, len(locs)):\n if pre != locs[i]:\n if locs[i] == 'S':\n fs += 1\n elif locs[i] == 'F':\n sf += 1\n pre = locs[i]\n\nif sf > fs:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\r\ns = str(input())\r\nf=0\r\nsf=0\r\nfor i in range(len(s)-1):\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n f=f+1\r\n elif s[i] == 'F' and s[i+1] == 'S':\r\n sf=sf+1\r\nif f>sf:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin\r\n\r\ninp = stdin.readline\r\n\r\nn = int(inp().strip())\r\ns = inp().strip()\r\n\r\nstf = 0\r\nfts = 0\r\nprev = s[0]\r\nfor city in s:\r\n if prev == 'S' and city == 'F':\r\n stf += 1\r\n elif prev == 'F' and city == 'S':\r\n fts += 1\r\n prev = city\r\n\r\nprint(\"YES\" if stf > fts else \"NO\")", "d=int(input())\r\nn=input()\r\nc=0\r\nd=0\r\nfor i in range(len(n)-1) :\r\n if n[i]==\"S\" and n[i+1]==\"F\" :\r\n c=c+1\r\n elif n[i]==\"F\" and n[i+1]==\"S\" :\r\n d=d+1\r\nif c>d :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "n=int(input())\r\nt=input()\r\nif t.count('SF')>t.count('FS'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,s = input(),input()\r\nprint ('YES' if s.count('SF') > s.count('FS') else 'NO')", "from sys import stdin\nn = int(stdin.readline())\ndays = stdin.readline()\n\nmore = 0\nfor i in range(0, n-1):\n if days[i] != days[i+1]:\n if days[i+1] == \"F\":\n more += 1\n else:\n more -= 1\n\nif (more > 0):\n print(\"YES\")\nelse:\n print(\"NO\")\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 = int(input())\r\nll = list(input())\r\nse = 0\r\nsf = 0\r\n\r\nfor i in range(len(ll)-1):\r\n if ll[i]=='S' and ll[i+1]==\"F\":\r\n sf+=1\r\n elif ll[i]=='F' and ll[i+1]==\"S\":\r\n se+=1\r\nif sf>se:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#867A Between the offices\r\n#SSFFSFFSFF\r\nn=int(input())\r\ns=input()\r\nx=0\r\ny=0\r\n\r\nprevious=s[0]\r\nfor current in s[1:]:\r\n if previous=='S' and current=='F':\r\n x+=1\r\n elif previous=='F' and current=='S':\r\n y+=1\r\n previous=current\r\n\r\nif x>y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nf=list(input())\r\nif f[0]=='S' and f[n-1]=='F':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n = int(input())\r\nip = input()\r\nf = 0\r\ns = 0\r\n\r\nfor i in range(0, n-1):\r\n if ip[i] != ip[i +1] and ip[i] == \"F\":\r\n f += 1\r\n if ip[i] != ip[i +1] and ip[i] == \"S\":\r\n s += 1\r\n\r\nif s > f:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "n, s = int(input()), input()\r\nprint(\"YES\" if s[0] == 'S' and s[-1] == 'F' else \"NO\")", "input()\ns = input()\nFS = s.count(\"FS\")\nSF = s.count(\"SF\")\nprint(\"YES\" if SF > FS else \"NO\")\n", "n = int(input())\r\ns = input()\r\ni = 0\r\ncountS = 0\r\ncountSF = 0\r\nwhile i < n-1:\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n countS += 1\r\n if s[i] == 'F' and s[i+1] == 'S':\r\n countSF += 1\r\n i += 1\r\nif countS > countSF:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "d = input()\r\nn = input()\r\n#n1 = n.split('SF')\r\n#n2 = n.split('FS')\r\n#print(n1,n2)\r\nif len(n.split('SF')) > len(n.split('FS')):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#https://codeforces.com/problemset/problem/867/A\r\nnum_days = int(input())\r\ntravel_iten = input()\r\n\r\ntravel_SF = 0\r\ntravel_FS = 0\r\n\r\nfor i in range(num_days-1):\r\n if travel_iten[i] == \"S\" and travel_iten[i+1] == \"F\":\r\n travel_SF += 1\r\n elif travel_iten[i] == \"F\" and travel_iten[i+1] == \"S\":\r\n travel_FS += 1\r\n\r\nif travel_SF > travel_FS:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "n = int(input())\r\ns = input()\r\nsf,fs=0,0\r\nfor i in range(len(s)-1):\r\n if s[i] == 'S' and s[i+1] == 'F':\r\n sf+=1\r\n elif s[i] == 'F' and s[i+1] == 'S':\r\n fs+=1\r\nif sf>fs:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = str(input())\r\ntotal = n-1\r\nfav = 0\r\nunfav = 0\r\nfor i in range(n-1):\r\n if s[i]==\"S\" and s[i+1]==\"F\":\r\n fav+=1\r\n elif s[i]==\"F\" and s[i+1]==\"S\":\r\n unfav+=1\r\nif fav>unfav:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=list(map(str,input()))\r\nif(a[0]=='S' and a[n-1]=='F'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\ns = input()\nif s[0] == 'S' and s[n-1] == 'F':\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\n", "import time\r\n\r\ndef countFlights(flightStr):\r\n flSF = 0\r\n flFS = 0\r\n for x in range(len(flightStr)-1):\r\n if flightStr[x:x+2] == \"SF\":\r\n flSF += 1\r\n if flightStr[x:x+2] == \"FS\":\r\n flFS += 1\r\n\r\n if flSF > flFS:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n flightStr = input()\r\n print(countFlights(flightStr))\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()", "x=int(input())\r\na=input()\r\nStoF=0\r\nFtoS=0\r\nfor i in range(x-1):\r\n if(a[i]=='S' and a[i+1]=='F'):\r\n StoF=StoF+1\r\n elif(a[i]=='F' and a[i+1]=='S'):\r\n FtoS=FtoS+1\r\nif(StoF>FtoS):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nstring=str(input())\r\nl=string.__len__()\r\ncount_1=0\r\ncount_2=0\r\nfor i in range(0,l-1):\r\n if string[i]=='F' and string[i+1]=='S':\r\n count_1=count_1+1\r\n elif string[i]=='S' and string[i+1]=='F':\r\n count_2=count_2+1\r\nif count_2>count_1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\nst = 0\r\nft = 0\r\nfor i in range(len(s)-1):\r\n if s[i]==\"S\" and s[i+1]==\"F\":\r\n st+=1\r\n elif s[i]==\"F\" and s[i+1]==\"S\":\r\n ft+=1\r\nif st>ft:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\ta=read()\n\tfs=0\n\tsf=0\n\tfor i in range(1, n):\n\t\tif a[i-1]=='F' and a[i]=='S':\n\t\t\tfs+=1\n\t\telif a[i-1]=='S' and a[i]=='F':\n\t\t\tsf+=1\n\tif sf>fs:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nsolve()\n", "a=int(input())\r\nb=str(input())\r\nif b[:1]=='S' and b[-1:]=='F':\r\n print('YES')\r\nelse:\r\n print('NO')", "def func(st):\r\n if(st[0] == 'S' and st[-1] == 'F'):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nn = int(input())\r\nst = input()\r\nprint(func(st))", "n = int(input())\r\n\r\nf = input()\r\n\r\nsf = 0\r\nfs = 0\r\n\r\nfor i in range(1, n):\r\n if f[i] == 'S' and f[i - 1] == 'F':\r\n fs += 1\r\n if f[i] == 'F' and f[i - 1] == 'S':\r\n sf += 1\r\n\r\nprint('YES' if sf > fs else 'NO')", "n=int(input())\r\ns=input()\r\na=b=0\r\nfor i in range(n-1):\r\n if s[i]=='S'and s[i+1]=='F':\r\n a+=1\r\n elif s[i]=='F'and s[i+1]=='S':\r\n b+=1\r\nif a>b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nstr = input()\r\nc = 0\r\nd = 0\r\nfor i in range(n) :\r\n if str[i:i+2] == 'SF' :\r\n c = c+1\r\n if str[i:i+2] == 'FS' :\r\n d = d+1\r\nif c > d :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n\r\n\r\n", "def solve(n, s):\n cnt = 0\n for i in range(1, len(s)):\n if s[i - 1] == \"S\" and s[i] == \"F\":\n cnt += 1\n elif s[i - 1] != s[i]:\n cnt -= 1\n\n return \"YES\" if cnt > 0 else \"NO\"\n\n \nn = int(input())\ns = list(map(str, input()))\nprint(solve(n, s))\n", "x=int(input())\r\ns=input()\r\nc=0\r\nf={}\r\na=[]\r\nf['sf']=0\r\nf['fs']=0\r\nfor i in range(x-1):\r\n if s[i]=='S' and s[i+1]=='F':\r\n f['sf']+=1\r\n elif s[i]=='F' and s[i+1]=='S':\r\n f['fs']+=1\r\n\r\nif f['sf']>f['fs']:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n", "n=int(input())\r\ns=input()\r\ns1,f1=0,0\r\nfor i in range(1,len(s)):\r\n if s[i]=='S' and s[i-1]=='F':\r\n f1+=1 \r\n elif s[i]=='F' and s[i-1]=='S':\r\n s1+=1 \r\nif s1>f1:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[89]:\n\n\nn = int(input())\nl = input()\nif len(l) > n or len(l) < n:\n sys.exit()\ncount_SF = 0\ncount_FS = 0\n\nfor i in range(n-1):\n if l[i] == 'S':\n if l[i+1] == 'F':\n count_SF=count_SF+1\n\nfor i in range(n-1):\n if l[i] == 'F':\n if l[i+1] == 'S':\n count_FS=count_FS+1\n\nif count_SF > count_FS:\n print('YES')\nelse: \n print('NO')\n\n\n# In[ ]:\n\n\n\n\n", "n=int(input())\r\ns=input()\r\nF_to_S=s.count('FS')\r\nS_to_F=s.count('SF')\r\nif S_to_F>F_to_S:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input());s=input()\r\na=0;b=0\r\nfor i in range(1,n):\r\n if s[i-1]=='S' and s[i]=='F':\r\n a+=1\r\n elif s[i-1]=='F' and s[i]=='S':\r\n b+=1\r\nprint(\"YES\" if a>b else \"NO\")", "a=int(input())\r\ne=0\r\nb=input()\r\nj=0\r\nfor i in range(a):\r\n if i+1<a:\r\n if b[i]=='S' and b[i+1]=='F':\r\n e+=1\r\n if b[i]=='F' and b[i+1]=='S':\r\n j+=1\r\nif e>j:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=int(input())\nb=input()\ni=0\ncountf=0\ncounts=0\nwhile (i+1)<a:\n if b[i]==\"F\" and b[i+1]==\"S\":\n countf+=1\n elif b[i]==\"S\" and b[i+1]==\"F\":\n counts+=1\n i+=1\nif counts>countf:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = int(input())\ncities = input()\n\nSettletoFransicocount = 0\n\nFransicotoSettlecount = 0\n\n\nfor i in range(0, a - 1):\n if cities[i] == 'S' and cities[i + 1] == 'F':\n SettletoFransicocount += 1\n if cities[i] == 'F' and cities[i + 1] == 'S':\n FransicotoSettlecount += 1\n \n \n\nif SettletoFransicocount > FransicotoSettlecount:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "a = input()\na = list(input())\nfs, sf = 0, 0\nfor i in range(len(a)-1):\n\tif a[i] == 'F' and a[i+1] == 'S':\n\t\tfs += 1\n\telif a[i] == 'S' and a[i+1] == 'F':\n\t\tsf += 1\nif sf > fs:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "n=int(input())\r\ns=input()\r\nsf=0\r\nse=0\r\nfor i in range(1,n):\r\n if s[i]=='S' and s[i-1]=='F':\r\n sf+=1\r\n elif s[i]=='F' and s[i-1]=='S':\r\n se+=1\r\n#print(se,sf)\r\nif se>sf:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "a=input()\r\nstring=input()\r\nno= string.count(\"FS\")\r\nyes=string.count(\"SF\")\r\nprint(\"YES\" if yes>no else \"NO\")", "x=input()\r\nstr=input()\r\nFS, SF = 0, 0\r\nfor i in range(len(str)-1):\r\n if str[i]=='F' and str[i+1]=='S':\r\n FS+=1\r\n elif str[i]=='S' and str[i+1]=='F':\r\n SF+=1\r\n\r\nif SF>FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=0\r\nf=0\r\nn=int(input())\r\nst=input()\r\nfor i in range(1,n):\r\n if st[i]!=st[i-1]:\r\n if st[i]=='S':\r\n s+=1\r\n else:\r\n f+=1\r\nif f>s:\r\n print('YES')\r\nelse:\r\n print('NO')", "# import sys\r\n\r\n# sys.stdin = open(\"ccinput.in\", \"r\")\r\n# sys.stdout = open(\"ccoutput.out\", \"w\")\r\n\r\nn = int(input())\r\na = list(input())\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(a)-1):\r\n\tif a[i] == 'F' and a[i+1] == 'S':\r\n\t\tc1+=1\r\n\telif a[i] == 'S' and a[i+1] == 'F':\r\n\t\tc2+=1\r\n\r\nif c1<c2:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n=input()\r\na=str(input())\r\nf=0;s=0;t=1\r\nwhile t<len(a):\r\n if a[t]!=a[t-1]:\r\n if a[t]=='S':\r\n s+=1\r\n else:\r\n f+=1\r\n t+=1\r\nif f<=s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\nb=str(input())\r\nc=list(b)\r\ns=0\r\nsf=0\r\nfor i in range(len(c)-1):\r\n if c[i]=='S' and c[i+1]=='F':\r\n sf=sf+1\r\n if c[i]=='F' and c[i+1]=='S':\r\n s=s+1\r\nif s<sf:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def main():\n n = int(input())\n offices = input()\n sf_to_se = 0\n se_to_sf = 0\n for i in range(0, n-1):\n if offices[i] == 'S' and offices[i+1] == 'F':\n se_to_sf += 1\n elif offices[i] == 'F' and offices[i+1] == 'S':\n sf_to_se += 1\n if se_to_sf > sf_to_se:\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()", "x = int(input())\r\ntown = input()\r\nFS = town.count('FS')\r\nSF = town.count('SF')\r\nprint('yes' if SF>FS else 'no' )", "a=int(input())\r\nb=input()\r\nn=b.count('FS')\r\ny=b.count('SF')\r\nif y>n:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\ncs = 0\r\ncf = 0\r\nfor i in range(0,n):\r\n if(i+1<n):\r\n if(s[i] == 'S' and s[i+1] == 'F'):\r\n cf += 1\r\n elif(s[i] == 'F' and s[i+1] == 'S'):\r\n cs += 1\r\n\r\nif(cf > cs):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nstring=list(map(str,input()))[:n]\r\nf_s=0\r\ns_f=0\r\nfor i in range(0,n-1):\r\n\tif string[i]=='F' and string[i+1]=='S':\r\n\t\tf_s+=1\r\n\telif string[i]=='S' and string[i+1]=='F':\r\n\t\ts_f+=1\r\nif s_f>f_s:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\ns=input()\r\ncnt=0\r\n'''if 2<=n and n<=100:\r\n\tfor i in range(n):\r\n\t\tif s[i]=='F':\r\n\t\t\tif i+1<n:\r\n\t\t\t\tif s[i+1]=='S':\r\n\t\t\t\t\tcnt-=1\r\n\t\t\t\tif s[i+1]=='F':\r\n\t\t\t\t\tcnt+=1\r\n\t\t\telse:\r\n\t\t\t\t\tbreak\r\n\t\tif s[i]=='S':\r\n\t\t\tif i+1<n:\r\n\t\t\t\tif s[i+1]=='S':\r\n\t\t\t\t\tcnt-=1\r\n\t\t\t\tif s[i+1]=='F':\r\n\t\t\t\t\tcnt+=1\r\n\t\t\telse:\r\n\t\t\t\t\tbreak\r\nif cnt>0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n'''\r\nif s.count('SF')>s.count('FS'):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\nif 2 <= n <= 100:\r\n st = input()\r\n a = 0\r\n b = 0\r\n i = 0\r\n while i < n - 1:\r\n if st[i] == 'F' and st[i+1] == 'S':\r\n a += 1\r\n elif st[i] == 'S' and st[i+1] == 'F':\r\n b += 1\r\n i += 1\r\n if a > b:\r\n print('NO')\r\n if a < b:\r\n print('YES')\r\n if a == b:\r\n print('NO')", "n = int(input())\r\nmoo = list(input())\r\npor = 0\r\nblu = 0\r\nfor i in range(len(moo)-1):\r\n if moo[i] == \"F\" and moo[i+1] == \"S\":\r\n blu += 1\r\n elif moo[i] == \"S\" and moo[i+1] == \"F\":\r\n por += 1\r\nif por > blu:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\ns = input().strip()\r\nlast = s[0]\r\nfts = stf = 0\r\nfor c in s:\r\n\tif c != last:\r\n\t\tif c == 'S': fts += 1\r\n\t\telse: stf += 1\r\n\tlast = c\r\nprint( 'Yes' if stf>fts else 'No' )\r\n", "n=int(input())\r\ns=input()\r\nx=y=0\r\nfor i in range(0,len(s)-1):\r\n\tif s[i]+s[i+1]==\"SF\":\r\n\t\tx+=1\r\n\telif s[i]+s[i+1]==\"FS\":\r\n\t\ty+=1\r\nif x>y:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "q=lambda:map(int,input().split())\r\nqs=lambda:input().split()\r\nn,=q()\r\na,=qs()\r\nprint('NYOE S'[a.count('SF')>a.count('FS')::2])", "S_to_F_amount = 0\r\nF_to_S_amount = 0\r\nn = input()\r\nprev_city, next_city = '', ''\r\ncities = input()\r\nfor city in cities:\r\n\tnext_city = city\r\n\tif prev_city != '':\r\n\t\t#print(prev_city, ' -> ', next_city)\r\n\t\tif prev_city == 'S' and next_city != 'S' :\r\n\t\t\t#print('S_to_F_amount += 1')\r\n\t\t\tS_to_F_amount += 1\r\n\t\telif prev_city != 'S' and next_city == 'S':\r\n\t\t\t#print('F_to_S_amount += 1')\r\n\t\t\tF_to_S_amount += 1\r\n\tprev_city = next_city\r\n\r\nif S_to_F_amount > F_to_S_amount:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "days = int(input())\r\noffices = input()\r\nSF = 0\r\nFS = 0\r\nfor i in range (0,days-1):\r\n if ((offices[i] == \"S\") and (offices[i+1] == \"F\")):\r\n SF = SF + 1\r\n elif ((offices[i] == \"F\") and (offices[i+1] == \"S\")):\r\n FS = FS + 1\r\n\r\nif (SF > FS):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nf = input()\r\ncurs = 0\r\n\r\nfor i in range(n - 1):\r\n curs += f[i] + f[i+1] == \"SF\"\r\n curs -= f[i] + f[i+1] == \"FS\"\r\nelse:\r\n print(\"YES\" if curs > 0 else \"NO\")\r\n", "n=int(input())\r\ns=input()\r\nlst=list(s)\r\nfrst=lst[0]\r\nk=0\r\nif s[0]=='F':\r\n print('no')\r\nelse:\r\n for i in lst:\r\n if i==frst:\r\n pass\r\n else:\r\n frst=i\r\n k+=1\r\n\r\n if k%2==0:\r\n print('no')\r\n else:\r\n print('yes')\r\n\r\n", "n=int(input())\r\nt=input()\r\nt=list(t)\r\nx=0\r\ny=0\r\nfor i in range(0,n-1):\r\n if t[i]=='S' and t[i+1]=='F':\r\n x+=1\r\n elif t[i]=='F' and t[i+1]=='S':y+=1\r\nif x>y:print('YES')\r\nelse:print('NO')", "n = int(input())\r\ncities = input()\r\n\r\ns_to_f, f_to_s = 0, 0\r\nfor i in range(len(cities) - 1):\r\n if cities[i] == 'S' and cities[i + 1] == 'F':\r\n s_to_f += 1\r\n elif cities[i] == 'F' and cities[i + 1] == 'S':\r\n f_to_s += 1\r\n\r\nif s_to_f > f_to_s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\n\nn = int(input())\nstrr = input()\n\nm = [ord(strr[i])-ord(strr[i-1]) for i in range(1,len(strr))]\n\nprint(\"YES\" if m.count(-13)>m.count(13) else \"NO\")\n", "n=int(input())\ns=input()\ns2f=f2s=0\nfor i in range(n-1):\n if s[i:i+2] == 'SF':\n s2f+=1\n elif s[i:i+2] == 'FS':\n f2s+=1\nprint('YES' if s2f>f2s else 'NO')\n", "count1=0\r\ncount2=0\r\nn = int(input())\r\nrow = list(str(input()))\r\nfor j in range(n-1):\r\n if row[j] == 'S' and row[j+1] == 'F':\r\n count1 = count1 + 1\r\n elif row[j] == 'F' and row[j+1] == 'S':\r\n count2 = count2 + 1\r\nif count1 > count2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nn = int(input())\r\nstr = \"\"\r\nstr = input().upper()\r\n\r\nx = fc = sc = 0\r\nfc=str.count('SF')\r\nsc=str.count('FS')\r\n\r\nif fc > sc:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\np, c, d = '', 0, 0\nfor i in input():\n if i != p:\n if p == 'S' and i == 'F': c += 1\n elif p == 'F' and i == 'S': d += 1\n p = i\nprint(\"YES\" if c > d else \"NO\")\n", "n = int(input())\r\ns = input()\r\nnw = s[0]\r\nc = 0\r\nd = 0\r\nfor i in s:\r\n if i != nw:\r\n if nw == \"F\":\r\n c += 1\r\n else:\r\n d += 1\r\n nw = i\r\nif c < d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\nn = int(input())\n\nstring = input()\n\nif len(re.findall('SF',string))>len(re.findall('FS',string)):\n\tprint(\"YES\")\nelse:\n\tprint('NO')\n\n", "class CodeforcesTask867ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.flights = ''\r\n\r\n def read_input(self):\r\n input()\r\n self.flights = input()\r\n\r\n def process_task(self):\r\n s_to_f = self.flights.count(\"SF\")\r\n f_to_s = self.flights.count(\"FS\")\r\n if s_to_f > f_to_s:\r\n self.result = \"YES\"\r\n else:\r\n self.result = \"NO\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask867ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "#for _ in range(int(input())):\r\n#y,b,r=map(int,input().split())\r\nn=int(input())\r\na=list(input())\r\nf=s=0\r\nfor i in range(n-1):\r\n if(a[i]==\"F\" and a[i+1]==\"S\"):\r\n f+=1\r\n elif(a[i]==\"S\" and a[i+1]==\"F\"):\r\n s+=1\r\nif(s>f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\nsf= s.replace('SF','1')\r\nfs= s.replace('FS','0')\r\nif sf.count('1') > fs.count('0'):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\nyesterday = ''\r\ntoday = ''\r\nSF = 0\r\nFS = 0\r\nfor i in s:\r\n yesterday = today\r\n today = i\r\n if yesterday == 'S' and today == 'S':\r\n continue\r\n elif yesterday == 'F' and today == 'F':\r\n continue\r\n elif yesterday == 'S' and today == 'F':\r\n SF += 1\r\n elif yesterday == 'F' and today == 'S':\r\n FS += 1\r\nif SF > FS:\r\n print('YES')\r\nelse:\r\n print('NO')", "\nimport sys\ndef get_single_int ():\n return int (sys.stdin.readline ().strip ())\ndef get_string ():\n return sys.stdin.readline ().strip ()\ndef get_ints ():\n return map (int, sys.stdin.readline ().strip ().split ())\ndef get_list ():\n return list (map (int, sys.stdin.readline ().strip ().split ()))\n\n#code starts here\nn = get_single_int ()\ns = get_string ()\none = s.count (\"FS\")\ntwo = s.count(\"SF\")\nif two > one:\n print (\"YES\")\nelse:\n print (\"NO\")\n", "n = [int(i) for i in input().split()]\r\nl = [i for i in input()]\r\nstatus = l[0]\r\nyes = 0\r\nno = 0\r\ndel l[0]\r\nfor i in l:\r\n if status == 'S' and i == 'F':\r\n yes+=1\r\n elif i == status:\r\n pass\r\n else:\r\n no+=1\r\n status = i\r\nif yes>no:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n=int(input());s=input();sf,fs=0,0\r\nfor i in range(n-1):\r\n\tif s[i]=='S' and s[i+1]=='F':sf+=1\r\n\telif s[i]=='F' and s[i+1]=='S':fs+=1\r\nif sf>fs:print('YES')\r\nelse:print('NO')", "testCases=int(input())\r\nflights=input()\r\nsanFrancisco=0\r\nseattle=0\r\nfor i in range(testCases-1):\r\n if flights[i]=='S' and flights[i+1]=='F':\r\n seattle+=1\r\n elif flights[i]=='F' and flights[i+1]=='S':\r\n sanFrancisco+=1\r\nif seattle>sanFrancisco:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\n\r\nSF = 0\r\nFS = 0\r\n\r\nfor i in range(n-1):\r\n if(s[i] == \"F\" and s[i+1] == \"S\"):\r\n FS += 1\r\n elif(s[i] == \"S\" and s[i+1] == \"F\"):\r\n SF += 1\r\n\r\nif(SF > FS):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nline = str(input())\r\n\r\nif line[0] == 'S' and line[n - 1] == 'F':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "trips = int(input())\nlocation = list(input())\nif location[0] == \"S\" and location[trips - 1] == \"F\":\n print(\"YES\")\nelse:\n print(\"NO\")", "\r\nn=int(input())\r\ns=input()\r\nf,p=0,0\r\nfor i in range(len(s)):\r\n\tif s[i:i+2]=='SF':\r\n\t\tf+=1\r\n\telif s[i:i+2]=='FS':\r\n\t\tp+=1\r\n\r\nif f>p:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\nar = list(input())\r\ncount = 0\r\nfor i in range(1, n):\r\n if ar[i - 1] + ar[i] == 'SF':\r\n count += 1\r\n elif ar[i - 1] + ar[i] == 'FS':\r\n count -= 1\r\nif count > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\ns = input()\n\ntotal = 0\n\nfor i in range(n-1):\n if s[i] == 'S' and s[i+1] == 'F':\n total += 1\n if s[i] == 'F' and s[i+1] == 'S':\n total -= 1\n\nif total > 0:\n print('YES')\nelse:\n print('NO')\n", "t=int(input())\r\nn=str(input())\r\nsf=n.count('SF')\r\nfs=n.count('FS')\r\nif sf>fs:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "# Between the Offices\ndef office(s):\n cor = 0\n wor = 0\n i = 1\n while i < len(s):\n if s[i-1] == 'S' and s[i] == 'F':\n cor += 1\n elif s[i-1] == 'F' and s[i] == 'S':\n wor += 1\n i += 1\n if cor > wor:\n return \"YES\"\n return \"NO\"\n\n\nn = int(input())\ns = input()\nprint(office(s))", "n = int(input())\r\ncounter = 0\r\nm = str(input())\r\nfor i in range(0, n-1):\r\n if m[i] == \"S\" and m[i+1] == \"F\":\r\n counter += 1\r\n if m[i] == \"F\" and m[i+1] == \"S\":\r\n counter -= 1\r\nif counter > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\nstrng='SF'\r\nc=0\r\nif s.count('SF')>0:\r\n if(s.count('FS')<=0 or (s.count('FS')<s.count('SF'))):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "n = int(input())\ns = input()\nse = 0\nsf = 0\nfor i in range(1, n):\n if s[i]=='S'and s[i-1]=='F':\n se+=1\n elif s[i] == 'F' and s[i-1]=='S':\n sf+=1\nif se<sf:print('yes')\nelse:print('no')", "input()\r\nstring = input()\r\nSF =0\r\nFS = 0\r\ncurrent = string[0]\r\nfor city in string:\r\n if city!= current:\r\n if current == 'S':\r\n SF+=1\r\n else:\r\n FS+=1\r\n current = city\r\n \r\nif SF>FS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n \r\n \r\n ", "\r\n\r\nl=int(input())\r\ns=input()[:l]\r\nfs=0\r\nsf=0\r\ns1=\"FS\"\r\ns2=\"SF\"\r\n\r\n\r\nfs=s.count(s1)\r\nsf=s.count(s2)\r\n\r\nif(sf>fs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n " ]

[ "I = input\r\nn,m = map(int , I().split())\r\nb = [1] * n * 2\r\nb[0] = b[n - 1] = b[n] = b[2 * n - 1] = 0\r\nfor i in range(m):\r\n r , c = map(int , I().split())\r\n b[r - 1] = b[n + c - 1] = 0\r\nif n % 2 and b[n // 2] and b[n + n // 2] : b[n // 2] = 0\r\nprint(sum(b))", "def solve():\n n, m = map(int, input().split())\n a = [0 for x in range(n)]\n b = [0 for x in range(n)]\n for i in range(m):\n row, col = map(int, input().split())\n row -= 1\n col -= 1\n a[row] += 1\n b[col] += 1\n res = 0\n for i in range(1, n - 1):\n if a[i] == 0: res+=1\n if b[i] == 0: res+=1\n if a[i] == 0 and b[i] == 0 and i == n - i - 1: res-=1\n print(res)\nsolve()", "# Not Original Submission, Unable to solve the problem\r\nI=input\r\nn,m=map(int,I().split())\r\nb=[1]*n*2\r\nb[0]=b[n-1]=b[n]=b[2*n-1]=0\r\nfor i in range(m):\r\n r,c=map(int,I().split())\r\n b[r-1]=b[n+c-1]=0\r\nif n%2 and b[n//2] and b[n+n//2]:b[n//2]=0\r\nprint(sum(b))", "n, m = map(int, input().split())\nset_x = {1, n}\nset_y = {1, n}\nset_total = {x for x in range(1, n + 1)}\n\nfor i in range(0, m):\n x, y = map(int, input().split())\n set_x.add(x)\n set_y.add(y)\n\nresult = 0\navai_x = set_total - set_x\navai_y = set_total - set_y\nresult = len(avai_x) + len(avai_y)\nif (n & 1) == 1 and ((n >> 1) + 1) in avai_y and ((n >> 1) + 1) in avai_x:\n result -= 1\n\nprint(result)\n\n\n\n", "n, m = map(int, input().split())\r\nl = [0 for i in range(0, n)]\r\nc = [0 for i in range(0, n)]\r\nsol = 0\r\n\r\nfor i in range(0, m):\r\n a, b = map(int, input().split())\r\n l[a-1] = 1\r\n c[b-1] = 1\r\n\r\nfor i in range(1, n//2):\r\n #ma ocup de liniile i si n-i, coloanele la fel\r\n sol += 4 - (l[i] + c[i] + l[n-i-1] + c[n-i-1])\r\n\r\nif n % 2 == 1:\r\n if not l[n//2] or not c[n//2]: sol += 1\r\n\r\nprint(sol)\r\n \r\n \r\n", "n, m = map(int, input().split())\nused = [1] * 2 * n\nfor i in range(m):\n\tx, y = map(int, input().split())\n\tused[x - 1] = used[n + y - 1] = 0\n\t\nif n % 2 and used[n // 2]:\n\tused[n // 2 + n] = 0\nres = sum(used)\nfor i in [0, n - 1, n, 2 * n - 1]:\n\tres -= used[i]\nprint(res)\n\n", "n, m = map(int, input().split())\r\nk = n + 1\r\na, b = [0] * k, [0] * k\r\na[0] = a[1] = a[n] = b[0] = b[1] = b[n] = 1\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n a[x] = b[y] = 1\r\ns = a.count(0) + b.count(0)\r\nif n & 1 and 0 == a[k // 2] == b[k // 2]: s -= 1\r\nprint(s)" ]

[ "N = 100000\r\nv = []\r\nfor i in range(0, N) :\r\n\tv.append([])\r\n\r\nline = input()\r\nn = int(line)\r\nline = input()\r\nlineSplit = line.split()\r\na = 0\r\nfor i in range(0, len(lineSplit)) :\r\n\tb = int(lineSplit[i])\r\n\tif b > a :\r\n\t\tfor j in range(a, b) :\r\n\t\t\tv[j].append([i, -1])\r\n\telif b < a :\r\n\t\tfor j in range(a-1, b-1, -1) :\r\n\t\t\tv[j][-1][1] = i\r\n\ta = b\r\n\r\nif a > 0 :\r\n\tfor j in range(0, a) :\r\n\t\tv[j][-1][1] = n\r\n\r\nc = 0\r\nfor i in range(0, N) :\r\n\tc += len(v[i])\r\nprint(c)\r\n#for i in v :\r\n#\tprint(i)\r\nfor i in range(0, N) :\r\n\tfor j in range(0, len(v[i])) :\r\n\t\tprint(v[i][j][0] + 1, v[i][j][1])\r\n", "n = int(input())\nbig = 10 ** 5\nlast = (big + 1) * [ -1 ]\ndata = list(map(int, input().split()))\ndata.insert(0, 0)\ndata.append(0)\n\nresult = []\nprevious = 0\nfor pos, current in enumerate(data):\n if current > previous:\n for x in range(previous + 1, current + 1):\n last[x] = pos\n elif current < previous:\n for x in range(previous, current, -1):\n result.append('%d %d' % (last[x], pos - 1))\n previous = current\n\nprint(len(result))\nprint('\\n'.join(result))\n", "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\nn=ri()\r\na=ris()\r\na.append(0)\r\nl,r=[],[]\r\ns=0\r\nfor i,x in enum(a):\r\n while s<x:\r\n l.append(i+1)\r\n s+=1\r\n while s>x:\r\n r.append(i)\r\n s-=1\r\nprint(len(l))\r\nwhile l:\r\n print(l.pop(),r.pop())\r\n" ]

[ "n, m = [int(i) for i in input().split()]\r\nmas = [input() for _ in range(n)]\r\ncount = 0\r\nfor i in range(n-1,-1,-1):\r\n if 'S' not in mas[i]:\r\n count += m\r\n del mas[i]\r\n n -= 1\r\nfor j in range(m-1, -1, -1):\r\n flag = False\r\n for i in range(n):\r\n flag += 'S' == mas[i][j] \r\n if not flag:\r\n count += n\r\n\r\n\r\n\r\nprint(count)", "arr = input()\r\narr = arr.split(\" \")\r\n\r\nr = int(arr[0])\r\nc = int(arr[1])\r\nrow = []\r\ncol = []\r\nfor i in range(r):\r\n\ttext = input()\r\n\tfor j in range(c):\r\n\t\tif text[j] == \"S\":\r\n\t\t\tif j not in col:\r\n\t\t\t\tcol.append(j)\r\n\t\t\tif i not in row:\r\n\t\t\t\trow.append(i)\r\n\r\nprint((r-len(row))*c + (c-len(col))*r - ((r-len(row))*(c-len(col))))\r\n\t\t\t", "a,b=input().split()\r\nc=[]\r\na = int(a)\r\nb=int(b)\r\ncount=0\r\nfor i in range(0,a):\r\n d=[x for x in input()]\r\n c.append(d)\r\n\r\n\r\n \r\n\r\nfor i in range(0,a):\r\n for j in range(0,b):\r\n if(c[i][j]=='S'):\r\n break\r\n else:\r\n for j in range(0,b):\r\n c[i][j]=0\r\n count+=b\r\n \r\n\r\n \r\nfor i in range(0,b):\r\n for j in range(0,a):\r\n if(c[j][i])=='S':\r\n break\r\n else:\r\n for j in range(0,a):\r\n if(c[j][i]!=0):\r\n count+=1\r\n\r\nprint(count)\r\n \r\n\r\n", "r, c = [int(i) for i in input().split()]\r\narr = []\r\ns = 0\r\nres = 0\r\nc_s = 0\r\nfor i in range(r):\r\n x = input()\r\n arr.append(x)\r\n if 'S' in x:\r\n s += 1\r\nres += (r - s) * c\r\nfor i in range(c):\r\n straw = False\r\n for j in range(r):\r\n if arr[j][i] == 'S':\r\n straw = True\r\n break\r\n if not straw:\r\n c_s += 1\r\nres += s * c_s\r\nprint(res)\r\n", "rows,columns = map(int,input().split())\r\ngrid = [list(input()) for i in range(rows)]\r\ncount = 0\r\n\r\n \r\n## column slicing\r\nfor i in range(columns):\r\n for j in range(rows):\r\n if grid[j][i] == \".\":\r\n continue\r\n else:break\r\n else: \r\n count += rows\r\n for j in range(rows):\r\n grid[j][i] =0\r\n## row slicing\r\nfor i in grid:\r\n if \"S\" not in i:\r\n for j in i:\r\n if j==\".\":count += 1\r\n \r\nprint(count)", "r, c = map(int, input().split())\r\nlst = [[s for s in input()] for _ in range(r)]\r\ncount, col = 0, set()\r\nfor i in range(r):\r\n if 'S' not in lst[i]:\r\n count += 1\r\n for j in range(c):\r\n if lst[i][j] == 'S':\r\n col.add(j)\r\nprint((c - len(col)) * (r - count) + count * c)", "n,m = input().split()\r\nm = int(m)\r\ns=''\r\nans = 0\r\nfor i in range(int(n)):\r\n temp = str(input())\r\n if 'S' not in temp:\r\n ans = ans+m\r\n temp=''\r\n s = s + temp\r\nfor j in range(int(m)):\r\n temp = ''\r\n while j<len(s):\r\n temp = temp + s[j]\r\n j = j+int(m)\r\n if 'S' not in temp:\r\n ans = ans + len(temp) \r\nprint(ans)", "r,c=[int(z) for z in input().split()]\r\nr1=list(range(0,r))\r\nc1=list(range(0,c))\r\nfor i in range(0,r):\r\n s=input()\r\n for j in range(0,len(s)):\r\n if s[j]=='S':\r\n if i in r1:\r\n r1.remove(i)\r\n if j in c1:\r\n c1.remove(j)\r\nprint(len(r1)*c+len(c1)*r-len(r1)*len(c1))", "n,m=map(int,input().split())\r\nc=0\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n if(s.count('.')==m):\r\n c=c+1\r\n a.append(s)\r\nr=0\r\nfor i in range(m):\r\n y=\"\"\r\n for j in range(n):\r\n y=y+a[j][i]\r\n if(y.count('.')==n):\r\n r=r+1\r\n\r\nprint((c*m)+(r*n)-(c*r))\r\n", "ROWS,COLS = map(int,input().split())\r\n\r\ngrid = []\r\n\r\nfor _ in range(ROWS):\r\n grid.append(list(input()))\r\n\r\nrcount = 0\r\nccount = 0\r\n\r\nfor r in range(ROWS):\r\n for c in range(COLS):\r\n if grid[r][c]==\"S\":\r\n rcount+=1\r\n break\r\n \r\nfor c in range(COLS):\r\n for r in range(ROWS):\r\n if grid[r][c]==\"S\":\r\n ccount+=1\r\n break\r\n\r\nprint(ROWS*COLS - rcount*ccount)", "def f(i):\r\n\tfor j in range(n):\r\n\t\tif l[j][i]=='S':\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nn,m=map(int,input().split())\r\nr=0\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tif \"S\" not in s:\r\n\t\tr+=1\r\n\t\tc+=m\r\n\tl.append(list(s))\r\nfor i in range(m):\r\n\tif f(i):\r\n\t\tc+=n-r\r\nprint(c)", "r, k=[int(i) for i in input().split()]\r\na=[]\r\nc=[]\r\nro, ko = 0, 0\r\nfor i in range(r):\r\n b=[]\r\n s=input()\r\n for f in s:\r\n if f=='S':\r\n ro+=1\r\n break\r\n for j in range(k):\r\n b.append(s[j]) \r\n a.append(b)\r\nfor j in range(k):\r\n for i in range(r):\r\n if a[i][j]=='S':\r\n ko+=1\r\n break\r\nprint((r-ro)*k + (k-ko)*ro)", "a, b = [int(i) for i in input().split()]\r\nf = []\r\nz = []\r\nc = []\r\ng,h = 0,0\r\nv,u = 0,0\r\nfor i in range(a):\r\n f.append(input())\r\nfor i in range(b):\r\n x = ''\r\n for j in range(a):\r\n x+=f[j][i]\r\n c.append(x)\r\nfor i in c:\r\n if 'S' in i:\r\n pass\r\n else:\r\n v+=len(i)\r\n g+=1\r\nfor i in f:\r\n if 'S' in i:\r\n pass\r\n else:\r\n u+=len(i)\r\n h+=1\r\nprint((v+u)-(g*h)) ", "#TASKS\r\n#1) take all input and store map as a 2D array for example:\r\n# S . . .\r\n# . . . .\r\n# . . S .\r\n\r\n#2) Check rows for S's, for each row with an S, +1 to counter\r\n\r\n#3) Check columns for S's, for each column with an S, +1 to counter\r\n\r\n#4) Answer is (rows without S) * c + (columns without S) * r - (rows without s*columns without s)\r\n\r\ndef main():\r\n#1)\r\n r, c = map(int, input().split())\r\n k = list()\r\n for i in range(r):\r\n k.append([char for char in input()])\r\n columns = 0\r\n rows = 0\r\n\r\n#2)\r\n for i in range(r):\r\n if 'S' not in k[i]:\r\n rows += 1\r\n\r\n#3)\r\n for i in range(c):\r\n if 'S' not in [k[j][i] for j in range(r)]:\r\n columns += 1\r\n\r\n#4)\r\n print((rows * c) + (columns * r) - (rows*columns))\r\n\r\nmain()", "r,c=[int(x) for x in input().split()]\r\nrow=[0 for i in range(r)]\r\ncol=[0 for i in range(c)]\r\nfor i in range(r):\r\n s=input()\r\n for j in range(c):\r\n if(s[j]=='S'):\r\n row[i]=1\r\n col[j]=1\r\ncnt=0\r\n#print(row)\r\n#print(col)\r\nfor i in range(r):\r\n for j in range(c):\r\n if(row[i]==0 or col[j]==0):\r\n cnt+=1\r\nprint(cnt)", "n, m = map(int, input().split())\r\na = []\r\ncount = 0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n if 'S' in a[i]:\r\n continue\r\n else:\r\n a[i] = '0'*m\r\n count += m\r\nfor j in range(m):\r\n in_count = 0\r\n for i in range(n):\r\n if a[i][j] == '.':\r\n in_count += 1\r\n elif a[i][j] == 'S':\r\n in_count = 0\r\n break\r\n count += in_count\r\n# for i in a:\r\n# for j in i:\r\n# print(j, end=' ')\r\n# print()\r\n\r\nprint(count)", "s=input('')\r\nn,m=s.split(' ')\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nfor i in range(n):\r\n s1=input('')\r\n l.append(list(s1))\r\nl1=[]\r\nfor i in range(n):\r\n# print(l[i])\r\n temp=l[i].count('S')\r\n# print(temp)\r\n if(temp==0):\r\n for j in range(m):\r\n l1.append([i,j])\r\nl2=(list(map(list,zip(*l))))\r\n# print(l2)\r\nfor i in range(m):\r\n# print(l[i])\r\n temp=l2[i].count('S')\r\n# print(temp)\r\n if(temp==0):\r\n for j in range(n):\r\n l1.append([j,i])\r\nl3=[]\r\n# print(l1)\r\ncount=0\r\nfor i in l1:\r\n if i not in l3:\r\n l3.append(i)\r\nprint(len(l3))\r\n\r\n\r\n ", "r, c = map(int, input().split())\r\nmatrix = []\r\nnumber = 0\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(r):\r\n x = input()\r\n matrix.append(list(x[:c]))\r\nfor i in range(r):\r\n count = 0\r\n for j in range(c):\r\n if matrix[i][j] == 'S':\r\n break\r\n else:\r\n number += c\r\n count1 += 1\r\nfor j in range(c):\r\n for i in range(r):\r\n if matrix[i][j] == 'S':\r\n break\r\n else:\r\n number += r\r\n count2 += 1\r\nprint(number - count1 * count2)\r\n", "row, col = map(int, input().split())\r\n\r\ndt_row = []\r\ndt_col = []\r\n\r\nfor i in range(row):\r\n take = input()\r\n for j in range(col):\r\n if(take[j] == \"S\"):\r\n if(i not in dt_row):\r\n dt_row.append(i)\r\n if(j not in dt_col):\r\n dt_col.append(j)\r\nprint(row*col - len(dt_row)*len(dt_col))\r\n", "n, m = map(int, input().split())\r\nc_n = [1] * m\r\nc_m = 0\r\nfor _ in range(n):\r\n s = input()\r\n if 'S' in s:\r\n for i in range(m):\r\n if s[i] == 'S':\r\n c_n[i] = 0\r\n else:\r\n c_m += 1\r\nprint(c_m * m + c_n.count(1) * (n - c_m))", "a , b = [int(x) for x in input().split()]\r\nls =[]\r\n\r\nfor i in range(0,a):\r\n ls.append(input())\r\n\r\nlt = [\"\"] * b\r\n\r\n\r\np = 0\r\n\r\nfor i in range(0,len(ls)):\r\n if \"S\" not in ls[i]: \r\n p+= len(ls[i])\r\n ls [i] = b*\"a\"\r\n \r\nfor i in range(0,b):\r\n for j in range(0,a):\r\n lt[i] += str(ls[j])[i]\r\n\r\nfor x in lt:\r\n if \"S\" not in x: p+= x.count(\".\")\r\n \r\nprint(p)\r\n", "n,m = map(int,input().split())\r\nans1,ans2 = 0,0\r\nl = []\r\nfor i in range(n):\r\n s = list(input())\r\n if 'S' not in s:\r\n ans1+=1\r\n l.append(s)\r\n\r\nfor i in range(m):\r\n x = \"\"\r\n for j in range(n):\r\n x += l[j][i]\r\n if 'S' not in x:\r\n ans2+=1\r\nprint(ans1*m + ans2*n - ans1*ans2)", "n,m=map(int,input().split())\r\ns=[list(input()) for i in range(n)]\r\nr1=len([1 for i in s if 'S' in i])\r\nr2=len([1 for i in zip(*s) if 'S' in i])\r\nprint(n*m-r1*r2)", "r,c=map(int,input().split())\r\ncol=set()\r\nrow=set()\r\nfor i in range(r):\r\n s=input()\r\n if \"S\" in s:\r\n row.add(i)\r\n for j in range(c):\r\n if s[j]==\"S\":\r\n col.add(j)\r\nprint(r*c-len(col)*len(row))", "n , k = map(int,input().split())\r\nl = []\r\ncake = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(list(s))\r\n cake.append([0]*k)\r\n\r\n\r\neat = 0\r\nfor i in range(n):\r\n flag = True\r\n for j in range(k):\r\n if(l[i][j] == 'S'):\r\n flag = False\r\n \r\n if(flag):\r\n for j in range(k):\r\n cake[i][j]=1\r\n \r\n\r\nfor j in range(k):\r\n flag = True\r\n for i in range(n):\r\n if(l[i][j] == 'S'):\r\n flag = False\r\n \r\n if(flag):\r\n for i in range(n):\r\n cake[i][j]=1\r\n \r\n \r\nfor i in range(n):\r\n eat+=sum(cake[i])\r\n\r\nprint(eat)", "def solve():\r\n n,m=list(map(int,input().split()))\r\n l=list()\r\n for i in range(n):\r\n l.append(input())\r\n flag,row,col=1,0,0\r\n for i in range(n):\r\n for j in range(m):\r\n if(l[i][j]==\"S\"):\r\n flag=0\r\n if(flag):\r\n row+=1\r\n flag=1\r\n flag=1\r\n for i in range(m):\r\n for j in range(n):\r\n if(l[j][i]==\"S\"):\r\n flag=0\r\n if(flag):\r\n col+=1\r\n flag=1\r\n print(row*m+col*n-row*col)\r\n\r\n\r\n\r\n#----------------------------------------------------------#\r\n\r\nt=1\r\nfor _ in range(t):solve()", "if __name__ == \"__main__\":\r\n r,c = map(int,input().split())\r\n count = 0\r\n r1 = []\r\n c1 = []\r\n\r\n for j in range(r):\r\n s = input()\r\n\r\n for i in range(c):\r\n if s[i] == 'S':\r\n c1.append(i)\r\n r1.append(j)\r\n count += 1\r\n \r\n if(count == r*c):\r\n print(0)\r\n else:\r\n print(r*c - len(set(r1))*len(set(c1)))", "\r\nr,c = list(map(int, input().split()))\r\nrow = [0]*r\r\ncol = [0]*c\r\n\r\nfor i in range(r):\r\n string = input()\r\n for j in range(c):\r\n if string[j] == 'S':\r\n row[i]=1\r\n col[j]=1\r\n\r\ncakes = 0\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i]==0 or col[j]==0:\r\n cakes += 1\r\n\r\nprint(cakes)\r\n", "\r\n\r\nr,c=map(int,input().split())\r\nl=[[0 for i in range(c)] for j in range(r)]\r\ns=[]\r\nfor i in range(r):\r\n t=input()\r\n s.append(t)\r\n# for i in s:\r\n# print(i)\r\nans=0\r\nfor i in range(r):\r\n for j in range(c):\r\n row,col=True,True\r\n for k in range(c):\r\n # print(s[i][k])\r\n if s[i][k]=='S':\r\n row=False\r\n for k in range(r):\r\n if s[k][j]=='S':\r\n col=False\r\n # print(s[i][j],i,j,row or col)\r\n if (row or col):\r\n ans+=1\r\nprint(ans)", "import re\n\n\nif __name__ == '__main__':\n r, c = list(map(int, input().split()))\n row_strawberry = set()\n col_strawberry = set()\n r_ = 0\n c_ = 0\n for i in range(r):\n demon = input()\n x = demon.count('S')\n if x:\n res = re.finditer(r'S', demon)\n for j in res:\n col = j.start()\n if i not in row_strawberry:\n row_strawberry.add(i)\n r_ += 1\n if col not in col_strawberry:\n col_strawberry.add(col)\n c_ += 1\n\n\n print(r * c - r_ * c_)\n", "a,b = map(int,input().split())\r\nlist1 = [input() for i in range(a)]\r\nprint(a*b - len([1 for i in list1 if i.count('S')])*len([1 for j in zip(*list1) if j.count('S')]))", "from math import *\r\nfrom math import factorial as fact, comb as ncr \r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom array import array\r\nfrom collections import Counter as ctr\r\nfrom collections import deque as dq\r\n\r\nli=lambda : list(map(int,input().split()))\r\narr=lambda a: array('i',a)\r\nbi=lambda n: bin(n).replace(\"0b\", \"\")\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n n,m=li()\r\n cr=0\r\n cc=[1]*m\r\n for i in range(n):\r\n t=list(input())\r\n if 'S' not in t:\r\n cr+=1\r\n continue\r\n for j in range(m):\r\n if t[j]=='S':\r\n cc[j]=0\r\n c=cc.count(1)\r\n print(cr*m+c*(n-cr))\r\n\r\nsolve()", "x=input()\r\nr=int(x.split()[0])\r\nc=int(x.split()[1])\r\ns=[] #squares\r\nfor i in range(r):\r\n y=input()\r\n for i in range(c): s.append(y[i])\r\ne=[] #indices of evil\r\nfor i in range(len(s)):\r\n if s[i]==\"S\": e.append(i+1)\r\nR=[] #rows of the evil\r\nC=[] #columns of the evil\r\nfor i in e:\r\n R.append((i-1)//c+1)\r\n C.append((i-1)%c+1)\r\nR1=[] #rows no duplicate\r\nC1=[] #columns no duplicate\r\nfor i in R:\r\n if i not in R1: R1.append(i)\r\nfor i in C:\r\n if i not in C1: C1.append(i)\r\nr1=r-len(R1) #free rows\r\nc1=c-len(C1) #free columns\r\nprint(r1*c+c1*r-r1*c1)\r\n \r\n", "#A. Cakeminator\r\nr,c = [int(x) for x in input().split()]\r\ngrid = []\r\nfor i in range(r):\r\n grid += [[x for x in input()]]\r\n\r\n\r\nfor i in range(r):\r\n if 'S' not in grid[i]:\r\n for j in range(len(grid[i])):\r\n grid[i][j] = \"X\"\r\n\r\n\r\nrotated = list(zip(*grid))[::-1]\r\ngrid = [list(x) for x in rotated]\r\n\r\nfor i in range(len(grid)):\r\n if 'S' not in grid[i]:\r\n for j in range(len(grid[i])):\r\n grid[i][j] = \"X\"\r\n \r\nct = 0\r\nfor row in grid:\r\n for col in row:\r\n if col == \"X\":\r\n ct +=1\r\nprint(ct)", "r,c=map(int,input().split())\r\nx,y=set(),set()\r\nfor i in range(r):\r\n\ta=input()\r\n\tfor j in range(len(a)):\r\n\t\tif a[j]=='S':\r\n\t\t\tx.add(i);y.add(j)\r\nprint(r*c-len(x)*len(y))", "r, c = [int(s) for s in input().split()]\r\ncake = []\r\nrow = 0\r\ncolumn = 0\r\n\r\nfor i in range(r):\r\n line = input()\r\n cake.append(line)\r\n\r\n if 'S' not in line:\r\n row += 1\r\nfor i in range(c):\r\n s = 0\r\n for j in range(r):\r\n if cake[j][i] == 'S':\r\n s += 1\r\n if s == 0:\r\n column += 1\r\n\r\nprint(row*c + column*r - row*column)\r\n\r\n", "r,c=map(int,input().split())\r\ngrid=[]\r\nfor i in range(r):\r\n s=list(input())\r\n grid.append(s)\r\nrow=set()\r\ncol=set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if(grid[i][j]=='S'):\r\n row.add(i)\r\n col.add(j)\r\ncnt=0\r\nfor i in range(r):\r\n if(i not in row):\r\n t=0\r\n for j in range(c):\r\n grid[i][j]='#'\r\n t+=1\r\n cnt+=t\r\nfor i in range(c):\r\n if(i not in col):\r\n t=0\r\n for j in range(r):\r\n if(grid[j][i]=='.'):\r\n grid[j][i]='#'\r\n t+=1\r\n cnt+=t\r\nprint(cnt)\r\n \r\n\r\n \r\n\r\n \r\n \r\n", "r, c = map(int,input().split())\n\ncake = []\n\nfor i in range(r):\n cake.append(list(input()))\n\ncake_transposed = list(zip(*cake))\n\ncount = 0\n\nfor i in range(r):\n for j in range(c):\n if ('S' not in cake[i]) or ('S' not in cake_transposed[j]):\n count = count + 1\n \n\n#print(cake)\n#print(cake_transposed)\n\nprint(count)", "if __name__ == '__main__':\r\n\r\n\tl = input().split()\r\n\trow, col = int(l[0]), int(l[1])\r\n\r\n\tcount = 0\r\n\trowDic = {}\r\n\tcolDic = {}\r\n\tstrawCount = 0\r\n\twhile count < row:\r\n\t\tl = input()\r\n\t\tfor i in range(len(l)):\r\n\t\t\tif l[i] == \"S\":\r\n\t\t\t\t#print(l[i])\r\n\t\t\t\trowDic[count] = 1\r\n\t\t\t\tcolDic[i] = 1\r\n\t\t\t\tstrawCount += 1\r\n\t\tcount += 1\r\n\r\n\t#print(strawCount)\r\n\tcantEat = 0\r\n\tif strawCount:\r\n\t\tfor i in range(row):\r\n\t\t\tfor j in range(col):\r\n\t\t\t\tif rowDic.get(i, 0) > 0 and colDic.get(j, 0) > 0 :\r\n\t\t\t\t\tcantEat += 1\r\n\t#print(cantEat)\r\n\tprint(row*col - cantEat)", "n,m=map(int,input().split())\r\na=[]\r\ncount=0\r\nz=0\r\nfor k in range(n):\r\n a.append(list(map(str,input())))\r\nfor i in range(n):\r\n s=0\r\n for j in range(m):\r\n if a[i][j]==\"S\":\r\n s+=1\r\n if s==0:\r\n count+=m\r\n a.insert(i,[0]*m)\r\n a.pop(i+1)\r\nfor k in range(m):\r\n s=0\r\n countS=0\r\n for l in range(n):\r\n if a[l][k]==\"S\":\r\n s+=1\r\n elif a[l][k]==\".\":\r\n countS+=1\r\n if s==0:\r\n count+=countS\r\nprint(count)", "a,b=map(int,input().split())\r\nl=[]\r\ncount=row=0\r\nfor i in range(a):\r\n l.append(input())\r\n if 'S' not in l[i]:\r\n count+=1\r\nfor i in range(b):\r\n col=0\r\n for j in range(a):\r\n if l[j][i] == 'S':\r\n col +=1\r\n if col==0:\r\n row+=1\r\nprint(row*a+count*b-count*row)\r\n", "# Read input\nr, c = map(int, input().split())\n\n# Initialize variables\ncake = []\nrow_count = 0\ncolumn_count = 0\n\n# Read the cake and count the number of evil strawberries in each row and column\nfor i in range(r):\n row = input()\n cake.append(row)\n if 'S' not in row:\n row_count += 1\n\nfor j in range(c):\n if all(cake[i][j] != 'S' for i in range(r)):\n column_count += 1\n\n# Calculate the maximum number of cells that the cakeminator can eat\nmax_cells = row_count * c + column_count * (r - row_count)\n\n# Print the result\nprint(max_cells)\n", "import sys\r\nr, c = map(int, sys.stdin.readline().split())\r\ncake = [0] * r\r\nfor i in range(r):\r\n cake[i] = (sys.stdin.readline())\r\ncakecells = 0\r\nrCells = r\r\nfor i in range(r):\r\n if not 'S' in cake[i]:\r\n cakecells += c\r\n rCells -= 1\r\nfor i in range(c):\r\n free = True\r\n for j in range(r):\r\n if cake[j][i] == 'S':\r\n free = False\r\n break\r\n if free:\r\n cakecells += rCells\r\nprint(cakecells)\r\n", "n,m = map(int,input().split())\r\na = []\r\nk = 0\r\nfor _ in range(n):\r\n s = input()\r\n if not 'S' in s:\r\n k += m\r\n else:\r\n a.append(s)\r\n\r\nfor i in range(m):\r\n c = 0\r\n for ele in a:\r\n if ele[i] == '.':\r\n c += 1\r\n if c == len(a):\r\n k += len(a)\r\n\r\nprint(k)\r\n", "r, c = map(int, input().split())\r\ncake = [input() for _ in range(r)]\r\n\r\nmas = [[False] * c for i in range(r)]\r\ncnd = 0\r\n\r\nfor i in range(r):\r\n if 'S' not in cake[i]:\r\n for j in range(c):\r\n mas[i][j] = True\r\nfor j in range(c):\r\n is_find = False\r\n for i in range(r):\r\n if cake[i][j] == 'S':\r\n is_find = True\r\n break\r\n if not is_find:\r\n for i in range(r):\r\n mas[i][j] = True\r\nfor row in mas:\r\n cnd += row.count(True)\r\n\r\nprint(cnd)", "r, c = list(map(int, input().split()))\r\nno_r = 0\r\na = []\r\nres = 0\r\nfor _ in range(r):\r\n s = input()\r\n a.append(s)\r\n if 'S' not in s:\r\n no_r += 1\r\nfor i in range(c):\r\n has_s = False\r\n for j in range(r):\r\n if a[j][i] == 'S':\r\n has_s = True\r\n break\r\n if not has_s:\r\n res += r - no_r\r\nres += no_r*c\r\nprint(res)", "r, c = map(int,input().split())\r\na = []\r\ns = 0\r\nfor i in range(r):\r\n a.append(input())\r\n if 'S' not in a[i]:\r\n s += a[i].count('.')\r\n a[i] = '-' * c\r\nfor j in range(c):\r\n str = ''\r\n for i in range(r):\r\n str += a[i][j]\r\n if 'S' not in str:\r\n s += str.count('.')\r\nprint(s)", "#Тортминатор\r\n\r\nn, m = map(int, input().split())\r\ns = [input()for _ in range(n)]\r\ncount = 0\r\ncountzero = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == \"S\":\r\n break\r\n else:\r\n count+=m\r\n s.pop(i)\r\n s.insert(i,[0]*m)\r\n\r\nfor j in range(m):\r\n countzero = 0\r\n for i in range(n):\r\n if s[i][j] == \"S\":\r\n break\r\n if s[i][j] == 0:\r\n countzero+=1\r\n else:\r\n count+=n-countzero\r\n \r\nprint(count) \r\n\r\n\r\n\r\n\r\n\r\n", "r, c = map(int, input().split())\ncake = [input().strip() for _ in range(r)]\nans = 0\nfor i in range(r):\n for j in range(c):\n if cake[i][j] == '.' and ('S' not in cake[i] or 'S' not in list(zip(*cake))[j]):\n ans += 1\nprint(ans)\n", "n,m = map(int,input().split())\r\n\r\na = []\r\nk = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n a.append(list(s))\r\n\r\nfor i in range(n):\r\n if 'S' not in a[i]:\r\n k+=len(a[i])\r\n a[i] = [1]*m\r\n\r\nfor i in range(m):\r\n b = []\r\n for j in range(n):\r\n b.append(a[j][i])\r\n if 'S' not in b:\r\n k+=len(b)-b.count(1)\r\n\r\nprint(k)", "N,M = map(int,input().split())\r\nc = [0]*M\r\nr = []\r\nfor i in range(N):\r\n s = input()\r\n if 'S' in s:\r\n r.append(1)\r\n else:\r\n r.append(0)\r\n for m in range(M):\r\n if s[m]=='S':\r\n c[m]=1\r\n\r\nprint(N*M-sum(r)*sum(c))\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(n):\r\n if 'S' in a[i]:\r\n continue\r\n else:\r\n a[i]=list('#'*m)\r\ncount=0\r\nk=0\r\nfor j in range(m):\r\n for i in range(n):\r\n if a[i][j]=='S':\r\n count+=1\r\n if count==0:\r\n while k<n:\r\n a[k][j] = '#'\r\n k+=1\r\n k=0\r\n count=0\r\nfor i in a:\r\n for j in i:\r\n if j=='#':\r\n count+=1\r\nprint(count)", "r, c = list(map(int, input().split()))\r\nrow, col = [], []\r\nfor i in range(r):\r\n grid_row = input()\r\n for j, ch in enumerate(grid_row):\r\n if ch == \"S\":\r\n row.append(i)\r\n col.append(j)\r\nrow = len(set(row))\r\ncol = len(set(col))\r\neat_row = r-row\r\neat_col = c-col\r\neatable = eat_row*c + eat_col*r - eat_col*eat_row\r\nprint(eatable)\r\n", "\"\"\"\r\n ⢰⡖⣶⣆⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣰⣶⣶⡆\r\n⠀⠀⠘⠓⠛⡟⢻⣿⣤⣤⠀⠀⣠⣤⣼⣿⣿⣧⣤⣄⠀⠀⣤⣤⣿⣿⣿⠛⠛⠃\r\n⠀⠀⠀⠀⠀⠉⠉⢹⠈⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠉⠉\r\n⠀⠀⠀⣀⣀⡖⢲⣾⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣶⣶⣀⣀\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⠃⠀⠘⢻⣿⣿⣿⣿⣿⣿⡟⠃⠀⠘⣿⣿⣿⣿⣿⣿⡇\r\n⢰⢲⣾⣷⣿⣿⣿⣿⣿⣆⣀⣰⣾⣿⣿⣿⣿⣿⣿⣷⣆⣀⣰⣿⣿⣿⣿⣿⣿⣷⣶⡆\r\n⢸⢸⣿⠛⠛⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⠛⣿⣿⡇\r\n⢸⢸⣿⠀⠀⠉⠉⠹⠿⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠏⠉⠉⠀⠀⣿⣿⡇\r\n⢸⣸⢿⣀⠀⠀⠀⠀⠀⠀⠛⠛⢻⣿⣿⣿⣿⣿⣿⡟⠛⠛⠀⠀⠀⠀⠀⠀⣀⣿⣿⡇\r\n⠀⢸⢀⣿⣦⣤⡄⠀⠀⠀⠀⠀⠀⠀⠘⠛⠛⠃⠀⠀⠀⠀⠀⠀⠀⢠⣤⣴⣿⣿⡇\r\n⠀⠈⠉⠉⠧⠽⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⠿⠿⠉⠉⠁ ⠀⠀\r\n ⣀⣀⣤⣤⣤⡀\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀ ⣶⣿⣿⣿⣿⣿⠇\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⢀⣸⣿⣿⣿⣿⣿⣿⣿\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣶⣾⣿⣿⣿⣿⣿⡿⠟\r\n ⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣀⣾⣿⣿⣿⣿⣿⣿⠋⠁\r\n ⠀⠀⢸⣿⣿⣿⣤⠀⣤⣿⣿⣿⣿⣿⣿⠛\r\n ⠀⠀⠸⢿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠏⠉\r\n ⠀⠀⠀⠸⠿⣿⣿⣿⣿⣿⣿⣏⣤⣀\r\n ⠀⠀⠀⣤⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿\r\n ⢰⣶⣾⣿⣿⣿⡟⠃⠛⠛⢻⡿⠿⠛\r\n ⢸⣿⣿⣿⣿⠏\r\n ⠈⠛⠛⠉⠉\r\n \r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\"\"\"\r\nrow, col = map(int, input().split())\r\ngame = []\r\nlist_index = []\r\ncels = 0\r\nfor i in range(row):\r\n s = list(str(input()))\r\n\r\n for i in range(len(s)):\r\n if s[i] == \"S\":\r\n list_index.append(i)\r\n if \"S\" not in s:\r\n cels += col\r\n else:\r\n game.append(s)\r\n\r\nresult = set(list_index)\r\n\r\nprint(cels + (col - len(result)) * len(game))\r\n", "r, c = [int(i) for i in input().split()]\r\ncakes = 0\r\ncake = []\r\nRstraw = []\r\nCstraw = []\r\n\r\nfor i in range(r):\r\n row = [i for i in input()]\r\n for j in range(c):\r\n if row[j] == 'S':\r\n Rstraw.append(i)\r\n Cstraw.append(j)\r\n cake.append(row)\r\n\r\nfor row in range(r):\r\n for column in range(c):\r\n if row in Rstraw and column in Cstraw:\r\n pass\r\n else:\r\n cakes+=1\r\n\r\nprint(cakes)\r\n", "n,m = list(map(int,input().split()))\r\n\r\ncake=[]\r\neats=0\r\n\r\nfor i in range(n):\r\n l=input()\r\n cake.append(l)\r\n\r\nfor index,i in enumerate(cake):\r\n if i.count('.')==len(i):\r\n eats+=len(i)\r\n cake[index]='y'*len(i)\r\n\r\nfor i in range(m):\r\n s=\"\"\r\n for j in cake:\r\n s+=j[i]\r\n \r\n if 'S' not in s:\r\n eats+=s.count('.')\r\n\r\nprint(eats)\r\n", "n, m = map(int, input().split())\r\nmass = []\r\ncount = 0\r\nn_count = 0\r\nfor i in range(n):\r\n k = input()\r\n if 'S' not in k:\r\n count += len(k)\r\n else:\r\n mass.append(k)\r\n n_count +=1\r\nfor i in range(m):\r\n param = True\r\n for j in range(n_count):\r\n if mass[j][i] == 'S':\r\n param = False\r\n if param:\r\n count+=n_count\r\nprint(count)\r\n\r\n\r\n", "r, c = map(int, input().split())\r\n\r\nindr = []\r\nindc = []\r\nfor i in range(0, r):\r\n s = list(input())\r\n for j in range(0, c):\r\n if s[j] == 'S':\r\n indr.append(i)\r\n indc.append(j)\r\n \r\n# print(indr, indc)\r\nindr = list(set(indr))\r\nindc = list(set(indc))\r\nreqr, reqc = [], []\r\nfor i in range(0, r):\r\n if i not in indr:\r\n reqr.append(i)\r\nfor i in range(0, c):\r\n if i not in indc:\r\n reqc.append(i)\r\n# print(reqr, reqc)\r\nopind = []\r\n\r\nfor i in reqr:\r\n for j in range(0, c):\r\n opind.append([i,j])\r\n \r\n# print(opind)\r\nfor i in reqc:\r\n for j in range(0, r):\r\n opind.append([j,i])\r\n# print(opind)\r\ncount = 0\r\nfor i in range(0, len(opind)):\r\n if opind[i] not in opind[i+1:]:\r\n count += 1\r\n \r\nprint(count)\r\n\r\n ", "Y,X = [int(x) for x in input().split()]\r\narr = []\r\nfor _ in range(Y):\r\n row = list(input())\r\n arr.append(row)\r\n\r\nrows = set(i for i in range(Y))\r\ncols = set(i for i in range(X))\r\n\r\nfor y in range(Y):\r\n for x in range(X):\r\n if arr[y][x] == \"S\":\r\n if y in rows:\r\n rows.remove(y)\r\n if x in cols:\r\n cols.remove(x)\r\n\r\n\r\nscore = 0\r\nfor y in rows:\r\n for x in range(X):\r\n if arr[y][x] == \".\":\r\n score += 1\r\n arr[y][x] = None\r\n\r\n\r\nfor x in cols:\r\n for y in range(Y):\r\n if arr[y][x] == \".\":\r\n score += 1\r\n arr[y][x] = None\r\n\r\nprint(score)\r\n", "r, c = map(int, input().split())\r\nrow = set()\r\ncol = set()\r\nfor i in range(r):\r\n t = input()\r\n for j in range(c):\r\n if t[j] == 'S':\r\n row.add(i)\r\n col.add(j)\r\n \r\nprint(r*c - len(row) * len(col))\r\n", "n,m=[int(x) for x in input().split()]\r\na,res=[],[]\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n if a[i].count('S')==0:\r\n for j in range(m):\r\n res.append([i,j])\r\nfor i in range(m):\r\n check=1\r\n for j in range(n):\r\n if a[j][i]=='S':\r\n check=0\r\n break\r\n if check==1:\r\n for j in range(n):\r\n if [j,i] not in res:\r\n res.append([j,i])\r\nprint(len(res))", "rc = list(map(int,input().strip().split()))[:2]\nall=[]\neatencells=0\nfor i in range(rc[0]):\n col = input()\n all.append(col)\nrow=set()\ncolumnn=set()\nfor i in range(rc[0]):\n for j in range(rc[1]):\n if all[i][j]=='S':\n row.add(i)\n columnn.add(j)\nR = rc[0]-len(row)\nC = rc[1]-len(columnn)\neatencells = R*rc[1] + C*rc[0] - R*C\n\nprint(eatencells)\n\n \t \t\t \t\t \t\t \t \t", "r,c=map(int,input().split())\narr=[]\nfor i in range(r):\n a=input()\n a=list(a)\n arr.append(a)\ncount=0\nfor i in arr:\n if \"S\" not in i:\n count +=1\nans=0\nans += count*c\ntemp=0\ncount1=0\nwhile temp!=c:\n flag=0\n for i in arr:\n if i[temp]!=\".\":\n flag=1\n break\n if flag==0:\n count1 += 1\n temp += 1\nans += count1 * (r-count)\nprint(ans)", "def f():\r\n r,c=list(map(int,input().split(\" \")))\r\n mat=[]\r\n for i in range(r):\r\n temp=input()\r\n mat.append(list(temp))\r\n row=[]\r\n col=[]\r\n for i in range(r):\r\n for j in range(c):\r\n if mat[i][j]==\"S\":\r\n row.append(i)\r\n col.append(j)\r\n count=0\r\n eaten=[]\r\n for i in range(r):\r\n if i in row:\r\n continue\r\n else:\r\n count=count+c\r\n eaten.append(i)\r\n \r\n for j in range(c):\r\n if j in col:\r\n continue\r\n else:\r\n for k in range(r):\r\n if k in eaten:\r\n continue\r\n else:\r\n count=count+1\r\n return count\r\nprint(f())\r\n \r\n", "r, c = map(int, input().split())\r\nli = []\r\nfor i in range(r):\r\n val = input()\r\n ins = []\r\n for j in val:\r\n ins.append(j)\r\n li.append(ins)\r\n# print(li)\r\n# traversing through rows\r\nrow = 0\r\nfor i in range(r):\r\n ok = 0\r\n for j in range(c):\r\n if li[i][j] != \"S\":\r\n pass\r\n else:\r\n ok = -1\r\n if ok == 0:\r\n row += 1\r\n# traversing through column\r\ncolumn = 0\r\nfor i in range(c):\r\n ok1 = 0\r\n for j in range(r):\r\n if li[j][i] != \"S\":\r\n pass\r\n else:\r\n ok1 = -1\r\n if ok1 == 0:\r\n column += 1\r\n# print(row,column)\r\nr_no = r * column\r\nc_no = c * row\r\ntotal = r_no + c_no - (row * column)\r\nprint(total)\r\n", "r, c = map(int, input().split())\r\nt = []\r\nam = 0\r\nfor i in range(r):\r\n t.append(list(input()))\r\nfor i in range(r):\r\n if 'S' not in t[i] and t[i] != ['#'] * c:\r\n for k in range(c):\r\n if t[i][k] == '.':\r\n am += 1\r\n t[i][k] = '#'\r\nfor i in range(c):\r\n j = []\r\n for k in range(r):\r\n j.append(t[k][i])\r\n if 'S' not in j and j != ['#'] * r:\r\n for k in range(r):\r\n if j[k] == '.':\r\n am += 1\r\n t[k][i] = '#'\r\nprint(am)", "r, c = map(int,input().split())\r\ncake = []\r\ncnt = 0\r\nfor i in range(r):\r\n cake.append(input())\r\nfor i in range(r):\r\n if 'S' not in cake[i]:\r\n cnt += c\r\nemp_rows = cnt//c\r\nfor j in range(c):\r\n if 'S' not in [cake[k][j] for k in range(r)]:\r\n cnt += r - emp_rows\r\nprint(cnt)", "r, c = map(int, input().split(' '))\r\nmat = [list(input()) for i in range(r)]\r\nmat2 = [[mat[j][i] for j in range(r)] for i in range(c)][::-1]\r\np = []\r\ncount = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if mat[i][j] != 'S' and 'S' not in mat[i] and [i, j] not in p:\r\n p.append([i, j])\r\n count+=1\r\nfor j in range(c):\r\n for i in range(r):\r\n if mat2[j][i] != 'S' and 'S' not in mat2[j] and [i, j] not in p:\r\n p.append([i, j])\r\n count+=1\r\nprint(count)", "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 Cakeminator():\r\n r,c = invr()\r\n Fullmatrix = []\r\n infectedRows = []\r\n infectedColumns = []\r\n \r\n rowIndex = 0\r\n for i in range(r):\r\n row = insr()\r\n Fullmatrix.append(row)\r\n colIndex = 0\r\n for content in row:\r\n if content == 'S':\r\n infectedRows.append(rowIndex)\r\n infectedColumns.append(colIndex)\r\n colIndex += 1\r\n rowIndex += 1\r\n \r\n uniqueInfectedRows = list(set(infectedRows))\r\n uniqueInfectedColumns = list(set(infectedColumns))\r\n\r\n cakeThroughRows = (r - len(uniqueInfectedRows))*c \r\n cakeThroughCols = (c - len(uniqueInfectedColumns)) * len(uniqueInfectedRows)\r\n\r\n print(cakeThroughCols+cakeThroughRows)\r\n return\r\n\r\n\r\nCakeminator()", "def solve(n,m,arr,cb,rb):\n\t\n\tx=0\n\tfor i in range(n):\n\t\ty=0\n\t\tif i in rb :\n\t\t\tcontinue\n\t\tfor j in range(m):\n\t\t\ty+=1 if arr[i][j]==1 else 0\n\t\t\tarr[i][j]=0\n\t\tx+=y\n\n\tfor j in range(m):\n\t\ty=0\n\t\tif j in cb :\n\t\t\tcontinue\n\t\tfor i in range(n):\n\t\t\ty+=1 if arr[i][j]==1 else 0\n\t\t\tarr[i][j]=0\n\t\tx+=y\n\n\n\treturn x\n\n\t\t\n\n\t\n\n\n\n\n\n\nl3 = input()\nl3=[int(x) for x in l3.split()]\nr=l3[0]\nc=l3[1]\nmat=[]\nrb={}\ncb={}\nfor i in range(r):\n\tst=input()\n\tl=[]\n\tfor j in range(len(st)) :\n\t\tif st[j]=='.':\n\t\t\tl.append(1)\n\t\telse:\n\t\t\tcb[j]=1\n\t\t\trb[i]=1\n\t\t\tl.append('x')\n\tmat.append(l)\n\n\n\nprint(solve(r,c,mat,cb,rb))\n", "r,c = map(int,input().split())\r\nm = []\r\nans=0\r\nfor k in range(r):\r\n a = input()\r\n if \"S\" not in a:\r\n ans = ans +c\r\n else:\r\n ap = list(a)\r\n m.append(ap)\r\nfor j in range(c):\r\n co = []\r\n for k in range(len(m)):\r\n co.append(m[k][j])\r\n if \"S\" not in co:\r\n ans = ans+len(m)\r\nprint(ans)", "\r\nr, c = map(int,input().split())\r\n\r\nmat = [ list(input()) for _ in range(r)]\r\n\r\nrow = [True]*r\r\ncol = [True]*c\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n\r\n if mat[i][j] == 'S':\r\n row[i] = col[j] = False\r\n\r\nrow_cnt = len(list(filter(lambda x: x==True ,row) ))\r\ncol_cnt = len(list(filter(lambda x: x==True ,col) ))\r\n\r\nprint(c*row_cnt + r*col_cnt - row_cnt*col_cnt)\r\n", "l1=[int(i) for i in input().split()]\r\nr=l1[0]\r\nc=l1[-1]\r\nl2=[]\r\ncount_cake=count_line=0\r\nfor j in range(r):\r\n s=input()\r\n if s.count(\"S\")==0:\r\n count_line+=1\r\n count_cake=count_cake+c\r\n l2.append(s)\r\nfor k in range(c):\r\n s=\"\"\r\n for l in range(r):\r\n x=l2[l]\r\n y=x[k]\r\n s=s+y\r\n if s.count(\"S\")==0:\r\n count_cake=count_cake+r-count_line\r\nprint(count_cake)", "y, x = map(int, input().split())\r\nlst = [\"\"]*x\r\nlst_pos = []\r\nfor q in range(y):\r\n n = input()\r\n if \"S\" not in n:\r\n for q2 in range(x):\r\n lst_pos.append([q,q2])\r\n for q2 in range(x):\r\n lst[q2] += n[q2]\r\nfor q in range(x):\r\n if \"S\" not in lst[q]:\r\n for q2 in range(y):\r\n p = [q2,q]\r\n if p not in lst_pos:\r\n lst_pos.append(p)\r\nprint(len(lst_pos))\r\n", "x, y = input().split()\r\nx = int(x)\r\ny = int(y)\r\ngrid = []\r\n\r\nfor i in range(x):\r\n line = list(input())\r\n grid.append(line)\r\n\r\npoints = 0\r\nfor i in grid:\r\n if 'S' not in i:\r\n while i.count('.') != 0:\r\n i.remove('.')\r\n i.append('X')\r\n points += i.count('X')\r\n\r\nfor i in range(y):\r\n count = 0\r\n for j in range(x):\r\n if grid[j][i] == '.':\r\n count += 1\r\n elif grid[j][i] == 'X':\r\n pass\r\n else:\r\n count = 0\r\n break\r\n points += count\r\n\r\nprint (points)", "a,b=map(int,input().split())\r\ns=[]\r\ncount=0\r\nfor i in range(a):\r\n s.append(list(str(input())))\r\nfor i in range(a):\r\n if 'S' in s[i]:\r\n pass\r\n else:\r\n for j in range(len(s[i])):\r\n s[i][j]='!'\r\n count+=1\r\ncurr=0\r\nflag=True\r\nfor j in range(b):\r\n for i in range(a):\r\n if s[i][j]!='S' and s[i][j]=='.':\r\n s[i][j]='!'\r\n curr+=1\r\n elif s[i][j]!='S' and s[i][j]=='!':\r\n continue\r\n else:\r\n curr=0\r\n flag=False\r\n break\r\n if flag:\r\n count+=curr\r\n curr=0\r\n flag=True\r\nprint(count)", "r, c = [int(i) for i in input().split()]\r\na = []\r\nrow = 0\r\nb = []\r\ncolumn = 0\r\nfor i in range(r):\r\n a.append(list(input()))\r\nfor i in range(r):\r\n if 'S' not in a[i]:\r\n row += 1\r\nfor i in range(c, 0, -1):\r\n b.append([])\r\n for j in range(r):\r\n b[c-i].append([])\r\n b[c-i][j] = a[j][i-1]\r\nfor i in range(c):\r\n if 'S' not in b[i]:\r\n column += 1\r\n\r\nprint(row * c + column * (r - row))\r\n\r\n\r\n\r\n \r\n", "r, c = map(int, input().split())\r\nd = []\r\ncount = 0\r\nkol = 0\r\nfor i in range(r):\r\n a = input()\r\n b = ' '.join(a)\r\n bb = b.split()\r\n d += [bb]\r\nfor i in range(r):\r\n s = 0\r\n for j in range(c):\r\n if d[i][j] == '.':\r\n s += 1\r\n if s == c:\r\n count += 1\r\nfor j in range(c):\r\n s = 0\r\n for i in range(r):\r\n if d[i][j] == '.':\r\n s += 1\r\n if s == r:\r\n kol += 1\r\nprint(((count * c) + (kol * r)) - (kol * count))\r\n", "#A. Cakeminator\r\nr,c = map(int,input().split())\r\ncake = []\r\nfor _ in range(r):\r\n tmp = list(input())\r\n tmp = [0 if i== '.' else 1 for i in tmp]\r\n cake.append(tmp)\r\np = 0\r\ntr = 0\r\nfor i in range(r):\r\n if sum(cake[i])==0:\r\n p+=c\r\n tr += 1\r\nfor i in range(c):\r\n tmp = 0\r\n for j in range(r):\r\n tmp += cake[j][i]\r\n if tmp == 0:\r\n p += (r-tr)\r\nprint(p)", "n,m=map(int,input().split())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n\ts=input()\r\n\tif 'S' not in s:\r\n\t\tc+=m\r\n\telse:\r\n\t\tl.append(s)\r\nfor i in range(m):\r\n\ts1=0\r\n\tfor j in range(len(l)):\r\n\t\tif l[j][i]!='S':\r\n\t\t\ts1+=1\r\n\t\telse:\r\n\t\t\ts1=0\r\n\t\t\tbreak\r\n\tc+=s1\r\nprint(c)", "r, c = [int(x) for x in input().split()]\r\nlst = []\r\nfor i in range(r):\r\n t = input()\r\n temp = []\r\n for i in range(c):\r\n temp.append(t[i])\r\n lst.append(temp)\r\ncount = 0\r\nfor i in range(r):\r\n if \"S\" not in lst[i]:\r\n for j in range(c):\r\n if lst[i][j] == \".\":\r\n count += 1\r\n lst[i][j] = \"e\"\r\nlst2 =[]\r\nfor i in range(c):\r\n temp2 = []\r\n for j in range(r):\r\n temp2.append(lst[j][i])\r\n lst2.append(temp2)\r\n\r\nfor i in range(c):\r\n if \"S\" not in lst2[i]:\r\n for j in range(r):\r\n if lst2[i][j] == \".\":\r\n count += 1\r\n lst2[i][j] = \"e\"\r\nprint(count)", "N, M = map(int,input().split())\r\nGrid = [input() for i in range(N)]\r\nrows, cols = set(), set()\r\nfor r in range(N):\r\n for c in range(M):\r\n if Grid[r][c] == 'S':\r\n rows.add(r); cols.add(c)\r\n\r\nprint(N*M - len(rows)*len(cols))", "r,c = map(int,input().split())\na = set()\nb = set()\nfor i in range(r):\n\tk = input()\n\tfor x in range(len(k)):\n\t\tif k[x] == \"S\":\n\t\t\ta.add(x)\n\t\t\tb.add(i)\nprint(r*c-len(a)*len(b))\n", "r, c = map(int, input().split())\r\ncake = []\r\nfor _ in range(r):\r\n cake.append(list(map(str, input())))\r\n\r\nr_eatable, c_eatable = 0, 0\r\nfor item in cake:\r\n if \"S\" not in item:\r\n r_eatable += 1\r\n else:\r\n pass\r\n\r\nfor i in range(c):\r\n temp = []\r\n for j in range(r):\r\n temp.append(cake[j][i])\r\n if \"S\" not in temp:\r\n c_eatable += 1\r\n else:\r\n pass\r\n del temp\r\n\r\nprint((r_eatable * c) + (c_eatable * (r - r_eatable)))", "n, m = map(int, input().split())\r\na = [[j for j in input()] for i in range(n)]\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n\tok = True\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == 'S':\r\n\t\t\tok = False\r\n\t\t\tbreak\r\n\tif ok:\r\n\t\tfor j in range(m):\r\n\t\t\tif a[i][j] != '#':\r\n\t\t\t\tcnt += 1\r\n\t\t\ta[i][j] = '#'\r\n\r\nfor i in range(m):\r\n\tok = True\r\n\tfor j in range(n):\r\n\t\tif a[j][i] == 'S':\r\n\t\t\tok = False\r\n\t\t\tbreak\r\n\tif ok:\r\n\t\tfor j in range(n):\r\n\t\t\tif a[j][i] != '#':\r\n\t\t\t\tcnt += 1\r\n\t\t\ta[j][i] = '#'\r\n\r\n#print(a)\r\nprint(cnt)", "temp = [int(x) for x in input().split()]\r\nr = temp[0]\r\nc = temp[1]\r\ng = []\r\nfor i in range(r):\r\n g.append(input())\r\n\r\nchecked = [[True for x in range(c)] for x in range(r)]\r\n\r\nfor i in range(r):\r\n if 'S' in g[i]:\r\n for j in range(c):\r\n checked[i][j] = False\r\n x = g[i].index('S')\r\nfor i in range(c):\r\n bool = False\r\n for j in range(r):\r\n if g[j][i] == 'S':\r\n bool = True\r\n break\r\n if not bool:\r\n for k in range(r):\r\n checked[k][i] = True\r\nresult = 0\r\nfor x in checked:\r\n result += x.count(True)\r\nprint(result)\r\n", "r, c = map(int, input().split())\r\nl = [list(input()) for i in range(r)]\r\na = [1 for i in l if 'S' in i]\r\nb = [1 for i in zip(*l) if 'S' in i]\r\nprint(r*c - len(a)*len(b))", "r,c = [int(i) for i in input().split()]\r\nmat = []\r\nfor i in range(r):\r\n mat.append(input())\r\ncount = 0\r\nrow = 0\r\nrec = dict()\r\nfor i in range(r):\r\n if 'S' not in mat[i]:\r\n count+=c\r\n row+=1\r\n else:\r\n for j in range(c):\r\n if mat[i][j]=='S':\r\n if j not in rec:\r\n rec[j] = [i]\r\n else:\r\n rec[j].append(i)\r\nfor i in range(c):\r\n if i in rec:\r\n continue\r\n else:\r\n count += r-row\r\nprint(count)", "\n\n\n\n\nr, c = map(int, input().split())\n\n\ncake = []\n\nfor i in range(r) :\n cake.append([*input()])\n \n \n\n\n\n\ncount = 0\nfor i in range(r) :\n if \"S\" in cake[i] or \".\" not in cake[i]:\n continue\n \n count += cake[i].count(\".\")\n cake[i] = [\"E\"] * c\n\nfor j in range(c) :\n col = [cake[x][j] for x in range(r)]\n \n if \"S\" in col or \".\" not in col:\n continue\n \n count += col.count(\".\")\n for i in range(r) :\n cake[i][j] = \"E\"\n \n \nprint(count)\n \t \t \t \t \t\t \t\t \t\t\t \t", "n, m = map(int, input().split())\r\nl = []\r\ncount = 0\r\na = 0\r\nb = 0\r\nfor j in range(n):\r\n s = input()\r\n if s.count('S') == 0:\r\n count += m\r\n a += 1\r\n l.append(s)\r\nfor j in range(m):\r\n flag = True\r\n for i in range(n):\r\n if l[i][j] == 'S':\r\n flag = False\r\n break\r\n if flag:\r\n count += n\r\n b += 1\r\nprint(count - (a * b))\r\n", "row, col = map(int, input().split())\r\n\r\nlst = [list(input()) for _ in range(row)]\r\n\r\ntranposeLst = []\r\nfor i in range(col):\r\n inner = []\r\n for j in range(row):\r\n inner.append(0)\r\n tranposeLst.append(inner)\r\n\r\nfor i in range(row):\r\n\r\n if \"S\" not in lst[i]: \r\n lst[i] = [\"X\"] * col\r\n\r\n for j in range(col):\r\n tranposeLst[j][i] = lst[i][j]\r\n\r\nfor i in range(col):\r\n if \"S\" not in tranposeLst[i]: \r\n tranposeLst[i] = [\"X\"] * row\r\n\r\n\r\ncount = 0\r\nfor i in range(col):\r\n for j in range(row):\r\n if tranposeLst[i][j] == \"X\": count += 1\r\n\r\nprint(count)", "r,c=map(int,input().split())\r\nh=[]\r\na=[]\r\nfor i in range(r):\r\n s=input()\r\n for j in range(c):\r\n if s[j]=='S':\r\n h.append(i)\r\n a.append(j)\r\nh=len(list(set(h)))\r\na=len(list(set(a)))\r\nprint(c*(r-h)+r*(c-a)-(r-h)*(c-a))\r\n", "r,c=[int(i) for i in input().split()]\r\ns=[]\r\nx=0\r\ny=0\r\nfor i in range(r):\r\n s1=input()\r\n s.append(s1)\r\n if not \"S\" in s1:\r\n x+=1\r\nfor j in range(c):\r\n for i in range(r):\r\n if \"S\" in s[i][j]:\r\n break\r\n else:\r\n y+=r-x\r\nprint(x*c+y)\r\n", "a,b=map(int,input().split())\r\nl=[]\r\nr=0\r\nfor i in range(a):\r\n \r\n y=list(input())\r\n if('S' not in y):\r\n r+=len(y)\r\n else:\r\n l.append(y)\r\nru=[]\r\nfor k in range(b):\r\n t=[]\r\n for f in range(len(l)):\r\n t.append(l[f][k])\r\n ru.append(t)\r\nfor u in ru:\r\n if('S' not in u):\r\n r+=len(u)\r\nprint(r)\r\n\r\n\r\n", "r, c = map(int, input().split())\n\ncake = []\nfor _ in range(r):\n cake.append(list(input()))\n\nfor i in range(r):\n if \"S\" in cake[i]:\n continue\n for j in range(c):\n cake[i][j] = \"X\"\n\nfor i in range(c):\n if \"S\" in [c[i] for c in cake]:\n continue\n for j in range(r):\n cake[j][i] = \"X\"\n\ncounter = 0\nfor i in range(r):\n for j in range(c):\n if cake[i][j] == \"X\":\n counter += 1\nprint(counter)\n", "def check_row(s):\r\n return 0 if \"S\" in s else 1\r\n\r\nr,c=[int(i) for i in input().split()]\r\nlt=[]\r\nfor i in range(r):\r\n lt.append(input())\r\nfor i in range(r):\r\n if check_row(lt[i]):\r\n lt[i]=lt[i].replace('.','0') # CONC #__lt[i].replace('.','0') returns some value which NEEDS to be assigned to lt[i] for changed value to be placed there otherwise nothing will happen as we don't used the returned value\r\nfor i in range(c):\r\n validator=0\r\n for k in lt:\r\n if k[i]=='S':\r\n break\r\n else: validator+=1\r\n if validator==r:\r\n for k in range(r):\r\n lt[k]=lt[k][:i]+lt[k][i].replace('.','0',1)+lt[k][i+1:]\r\npieces=0\r\nfor i in lt:\r\n pieces+=i.count('0')\r\nprint(pieces)\r\n", "r, c = map(int, input().split())\r\na = []\r\nfor i in range(r):\r\n s = input()\r\n s = list(s)\r\n a.append(s)\r\n# print(a)\r\nrow = 0\r\nfor i in a:\r\n if 'S' in i:\r\n row += 1\r\n continue\r\n# print(row)\r\nb = []\r\nfor i in range(c):\r\n temp = []\r\n for j in range(r):\r\n temp.append(0)\r\n b.append(temp)\r\n# print(b)\r\nfor i in range(r):\r\n for j in range(c):\r\n b[j][i] = a[i][j]\r\n# print(b)\r\ncol = 0\r\nfor i in b:\r\n if 'S' in i:\r\n col += 1\r\n continue\r\nprint((r * c) - (row * col))\r\n", "x,y=map(int,input().split())\r\nl=[]\r\nm=[]\r\nfor i in range(x):\r\n\ts=input()\r\n\tfor j in range(y):\r\n\t\tif s[j]==\"S\":\r\n\t\t\tl.append(i)\r\n\t\t\tm.append(j)\r\nprint(x*y-len(list(set(l)))*len(list(set(m))))\r\n", "\r\n\r\nr , c = map(int , input().split())\r\n\r\nrow = [0]*r\r\ncol = [0]*c\r\ncnt = 0\r\nfor i in range(r):\r\n a = list(input())\r\n for j in range(c):\r\n if a[j] == 'S':\r\n row[i] = 1\r\n col[j] = 1\r\n r1 = row.count(1)\r\n c1 = col.count(1)\r\n \r\nprint((r * c) - (r1 * c1))\r\n", "r, c = map(int, input().split())\r\n\r\ns = []\r\n\r\nfor x in range(r):\r\n s.append(list(input()))\r\n\r\nresult = 0\r\n\r\nfor x in range(r):\r\n t = s[x]\r\n if 'S' not in t:\r\n result += c\r\n i = 0\r\n while i < c:\r\n t[i] = 'x'\r\n i += 1\r\n\r\ns = list(map(list, zip(*s)))\r\n\r\nfor x in range(c):\r\n t = s[x]\r\n if 'S' not in t:\r\n result += t.count('.')\r\n i = 0\r\n while i < r:\r\n t[i] = 'x'\r\n i += 1\r\n\r\nprint(result)\r\n", "# URL: https://codeforces.com/problemset/problem/330/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\nr, c = map(int, inp().split())\nrr, cc = set(), set()\nfor i in range(1, r + 1):\n for j, x in enumerate(inp().decode()):\n if x == 'S':\n rr.add(i)\n cc.add(j + 1)\nans = (r - len(rr)) * c + (c - len(cc)) * len(rr)\nout(f\"{ans}\")\n", "r, c = map(int, input().split())\r\ninstance = []\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in range(0, r):\r\n ins = input()\r\n instance.append(ins)\r\n\r\nfor i in range(0, r):\r\n for j in range(0, c):\r\n if (instance[i][j] == 'S'):\r\n count1 += 1\r\n break\r\nfor i in range(0, c):\r\n for j in range(0, r):\r\n if (instance[j][i] == 'S'):\r\n count2 += 1\r\n break\r\n\r\ntotal = r*c - (count1*count2)\r\nprint(total)", "r,c = map(int,input().split())\na = [list(input()) for i in range(r)]\nr1 = r - sum('S' in line for line in a )\nl2 = list(map(list, zip(*a))) \nc1 = c - sum('S' in line for line in l2)\nprint(c1*r + r1*c - r1*c1)\n", "\t\t###~~~LOTA~~~###\r\nl=[]\r\nn,m=map(int,input().split())\r\nr=0\r\ncount=0\r\nfor i in range(n):\r\n\tk=input()\r\n\tl.append(k)\r\n\tif 'S' not in k:\r\n\t\tr+=1\r\n\t\tcount+=m\r\nfor i in range(m):\r\n\tk=[]\r\n\tfor j in range(n):\r\n\t\tk.append(l[j][i])\r\n\tif 'S' not in k:\r\n\t\tcount+=n-r\r\nprint(count)", "if __name__ == \"__main__\":\r\n\tstrok, stolb = list(map(int, input().split()))\r\n\tres = []\r\n\tresult = 0\r\n\tfor s in range(strok):\r\n\t\tstring = input()\r\n\t\tif 'S' not in string:\r\n\t\t\tresult += len(string)\r\n\t\t\tcontinue\r\n\t\tres.append(string)\r\n\t\r\n\ti = j = 0\r\n\tn = len(res)\r\n\twhile j != stolb:\r\n\t\twhile i != n:\r\n\t\t\tif res[i][j] == 'S':\r\n\t\t\t\tbreak\r\n\t\t\ti += 1\r\n\t\telse:\r\n\t\t\tresult += n\r\n\t\t\t\r\n\t\ti = 0\r\n\t\tj += 1\r\n\r\n\r\n\r\n\r\n\tprint(result)\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n", "r,c=map(int,input().split())\r\nl=[]\r\nfor _ in range(r):\r\n l_=[i for i in input()]\r\n l.append(l_)\r\nfor i in range(r):\r\n if \"S\" not in l[i]:\r\n for j in range(c):\r\n l[i][j]=1\r\nx=[]\r\nfor i in range(c):\r\n x_=[]\r\n for j in range(r):\r\n x_.append(l[j][i])\r\n x.append(x_)\r\nfor i in range(c):\r\n if \"S\" not in x[i]:\r\n for j in range(r):\r\n x[i][j]=1\r\ncount_=0\r\nfor i in range(c):\r\n for j in range(r):\r\n if x[i][j]==1:\r\n count_+=1\r\nprint(count_)\r\n", "r, c = [int(i) for i in input().split(' ')]\r\nls = list()\r\n\r\nfor i in range(r):\r\n ls_ = [-(c+r) if s == 'S' else 1 for s in input()]\r\n ls.append(ls_)\r\n\r\nresult = 0\r\nfor i in range(r):\r\n sum_ = sum([s_ for s_ in ls[i]])\r\n if(sum_ < 0):\r\n continue\r\n\r\n result += sum_\r\n for j in range(c):\r\n if(ls[i][j] >= 0):\r\n ls[i][j] = 0\r\n\r\n# print(result)\r\n\r\nfor i in range(c):\r\n sum_ = sum([ls[s_][i] for s_ in range(r)])\r\n if(sum_ < 0):\r\n continue\r\n \r\n result += sum_\r\n for j in range(r):\r\n if(ls[j][i] >= 0):\r\n ls[j][i] = 0\r\n\r\nprint(result)", "r,c=map(int,input().split())\r\nl=[]\r\ncount=0\r\na,b=0,0\r\nfor i in range(r):\r\n l.append(input())\r\nfor i in l:\r\n flag=0\r\n for j in i:\r\n if j==\"S\":\r\n flag=1\r\n break\r\n if flag==0:\r\n count+=c\r\n a+=1\r\nfor i in range(c):\r\n flag=0\r\n for j in range(r):\r\n if l[j][i]==\"S\":\r\n flag=1\r\n break\r\n if flag==0:\r\n count+=r\r\n b+=1\r\n else:\r\n flag=0\r\nprint(count-(a*b))\r\n", "r, c = map(int, input().split())\r\ncake = [[x for x in input()] for _ in range(r)]\r\ncake_2 = []\r\ncount = 0\r\nfor i in range(r):\r\n if 'S' not in cake[i]:\r\n count += len(cake[i])\r\n else:\r\n cake_2.append(cake[i])\r\ncake_2 = list(zip(*cake_2))\r\nfor row in cake_2:\r\n if 'S' not in row:\r\n count += len(row)\r\n\r\nprint(count)", "rows, columns = map(int, input().split())\r\n\r\noccupied_rows = 0\r\noccupied_columns_set = set()\r\n\r\nfor i in range(rows):\r\n line = input()\r\n if 'S' not in line:\r\n continue\r\n occupied_rows += 1\r\n [occupied_columns_set.add(j) for j in range(columns) if line[j] == 'S']\r\n\r\noccupied_columns = len(occupied_columns_set)\r\n\r\nprint(columns * rows - occupied_columns * occupied_rows)\r\n", "r, c = map(int, input().split())\r\ntort =[]\r\n\r\nfor i in range(r):\r\n tort.append(input())\r\ncount = 0\r\nfor i in range(r):\r\n if 'S' not in tort[i]:\r\n tort[i] = tort[i].replace('.', '+')\r\n count += c\r\n \r\nfor j in range(c):\r\n res = ''\r\n for i in range(r):\r\n res += tort[i][j]\r\n if 'S' not in res:\r\n count += res.count('.')\r\n\r\n\r\n#for i in tort:\r\n# print(i)\r\nprint(count)", "r,c = map(int,input().split())\r\ncell = []\r\nfor i in range(r):\r\n a = list(map(str,input().strip()))\r\n cell.append(a)\r\nrow = set()\r\ncolumn = set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if(cell[i][j] == 'S'):\r\n row.add(i)\r\n column.add(j)\r\nprint(r*c - len(row)*len(column))", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\ntort=[[False]*m for i in range(n)]\r\nfor i in range(n):\r\n if \"S\" not in a[i]:\r\n for j in range(m):\r\n tort[i][j]=True\r\nfor j in range(m):\r\n is_find=False\r\n for i in range(n):\r\n if a[i][j]==\"S\":\r\n is_find=True\r\n break\r\n if not is_find:\r\n for i in range(n):\r\n tort[i][j]=True\r\ncount=0\r\nfor i in tort:\r\n count=count+i.count(True)\r\nprint(count)", "a, b = [int(i) for i in input().split()]\r\nc = [input() for j in range(a)]\r\nd1 = 0\r\nd2 = 0\r\nd = False\r\nfor i in range(a):\r\n if \"S\" not in c[i]:\r\n d1 += b\r\nfor i in range(b):\r\n d = False\r\n for j in range(a):\r\n if c[j][i] == \"S\":\r\n d = True\r\n break\r\n if not d:\r\n d2 += a\r\nprint(int(d1 + d2 - ((d2/a)*(d1/b))))", "a=input().split()\r\nn,k = int(a[0]),int(a[1])\r\nrows=[]\r\nfor i in range(n):\r\n rows.append(input())\r\nc=0\r\nfor i in range(n):\r\n if rows[i].find('S') < 0:\r\n c+=rows[i].count('.')\r\n rows[i]=rows[i].replace('.','D')\r\nfor i in range(k):\r\n f=1\r\n for j in range(n):\r\n if rows[j][i] == 'S':\r\n f=0\r\n if f:\r\n for j in range(n):\r\n if rows[j][i] == '.':\r\n c+=1\r\nprint(c)", "r,c=map(int,input().split())\r\ncnt=0\r\nlist=[]\r\nfor i in range(r):\r\n x=input()\r\n if 'S' in x:\r\n for i in range(c):\r\n if x[i]=='S':\r\n list.append(i)\r\n else:\r\n cnt+=1\r\ncnt2=0\r\nfor i in range(c):\r\n if i in list:\r\n pass\r\n else:\r\n cnt2+=1\r\nprint(cnt*c+cnt2*(r-cnt))\r\n", "\r\na=list(map(int,input().split()))\r\nboard=[]\r\nfor i in range(a[0]):\r\n board.append(list(input()))\r\n#print(board)\r\nx=a[0]\r\ny=a[1]\r\nlis=[]\r\nfor i in range(x):\r\n for j in range(y):\r\n if board[i][j]==\".\" :\r\n lis.append((i,j))\r\n elif board[i][j]==\"S\":\r\n for k in range(j):\r\n lis.pop()\r\n break\r\n#print(lis)\r\nfor i in range(y):\r\n for j in range(x):\r\n #print(j,i)\r\n if board[j][i]==\".\" :\r\n #print((j,i),\" ###\")\r\n lis.append((j,i))\r\n #print(lis)\r\n elif board[j][i]==\"S\":\r\n for k in range(j):\r\n lis.pop()\r\n break\r\nlis=sorted(lis)\r\ncount=0\r\na=0\r\nfor i in range(len(lis)-1):\r\n if lis[i]==lis[i+1]:\r\n a=a+1\r\n else:\r\n count=count+a\r\n a=0\r\ncount=count+a \r\nprint(len(lis)-count)", "n, m = map(int, input().split())\r\ns = []\r\ncount = 0\r\ncount_i = 0\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor i in range(n):\r\n if 'S' not in s[i]:\r\n count_i += 1\r\nfor j in range(m):\r\n for i in range(n):\r\n if s[i][j] == 'S':\r\n break\r\n else:\r\n count += 1\r\n\r\nprint(count * n + count_i * m - count*count_i)", "n,m=map(int,input().split())\r\nr=[]\r\nc=[]\r\nfor i in range(n):\r\n\tx=input()\r\n\tfor j in range(m):\r\n\t\tif x[j]=='S':\r\n\t\t\tr.append(i)\r\n\t\t\tc.append(j)\r\n\r\nr=len(list(set(r)))\r\nc=len(list(set(c)))\r\nprint(n*m-r*c)\r\n", "n,m=map(int,input().split())\r\nx=[]\r\nfor i in range(n):\r\n x.append(list(input()))\r\nc=0\r\nfor i in range(n):\r\n s=0\r\n b=0\r\n for j in range(m):\r\n if x[i][j]==\".\":\r\n b+=1\r\n if x[i][j]==\"S\":\r\n s+=1\r\n break\r\n if s==0:\r\n for j in range(m):\r\n x[i][j]=\"0\"\r\n c+=b\r\nfor i in range(m):\r\n s=0\r\n b=0\r\n for j in range(n):\r\n if x[j][i]==\".\":\r\n b+=1\r\n if x[j][i]==\"S\":\r\n s+=1\r\n break\r\n if s==0:\r\n c+=b\r\nprint(c)", "def main():\r\n r, c = list(map(int, input().split()))\r\n table = []\r\n for i in range(r):\r\n s = input()\r\n tmp = []\r\n for j in s:\r\n if j == 'S':\r\n tmp.append(1)\r\n else:\r\n tmp.append(0)\r\n table.append(tmp)\r\n\r\n sum_c, sum_r = [0 for i in range(c)], [0 for i in range(r)]\r\n for i in range(r):\r\n for j in range(c):\r\n sum_c[j] += table[i][j]\r\n sum_r[i] += table[i][j]\r\n ans = 0\r\n for i in range(r):\r\n for j in range(c):\r\n if sum_r[i] == 0 or sum_c[j] == 0:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m = map(int,input().split())\r\ns = [list(input()) for i in range(n)]\r\nr1 = len([1 for i in s if 'S' in i])\r\nr2 = len([1 for i in zip(*s) if 'S' in i])\r\nprint(n * m - r1 * r2)", "r, c = map(int, input().split())\ncake = []\ncc = [True for i in range(c)]\ncr = [True for i in range(r)]\nt = 0\nfor i in range(r):\n cake.append(input())\nfor row in range(r):\n for col in range(c):\n if cake[row][col] == 'S': \n cc[col] = False\n cr[row] = False\n \nfor i in range(r):\n for j in range(c):\n if cc[j] or cr[i]:\n t += 1\nprint(t)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n ans=0\r\n evilcol=[]\r\n for i in l:\r\n for j in range(c):\r\n if(i[j]=='S'):\r\n evilcol.append(j)\r\n evilcol=list(set(evilcol))\r\n evilrow=[]\r\n for i in range(r):\r\n for j in l[i]:\r\n if(j=='S'):\r\n evilrow.append(i)\r\n for i in range(r):\r\n if(i not in evilrow):\r\n for j in range(c):\r\n l[i][j]='R'\r\n ans+=1\r\n for i in range(r):\r\n for j in range(c):\r\n if(j not in evilcol):\r\n if(l[i][j]!='R'):\r\n l[i][j]='R'\r\n ans+=1\r\n \r\n return ans\r\n\r\n\r\n\r\nr,c=map(int,input().split())\r\nl=[]\r\nfor i in range(r):\r\n string=input()\r\n a = [string[x] for x in range(len(string)-1)]\r\n l.append(a)\r\nprint(exe())", "r, c = map(int, input().split())\r\ncake = []\r\nfor i in range(r):\r\n cake.append([x for x in input()])\r\n\r\ncount = 0\r\nfor layer in cake:\r\n if \"S\" not in layer:\r\n count += c\r\n for j in range(c):\r\n layer[j] = \"E\"\r\n#print(cake)\r\nfor i in range(c):\r\n flg = True\r\n temp = 0\r\n for j in range(r):\r\n if cake[j][i] == \"S\":\r\n flg = False\r\n break\r\n if cake[j][i] == \"E\":\r\n continue\r\n temp += 1\r\n if flg:\r\n count += temp\r\n\r\nprint(count)\r\n", "x,y=map(int,input().split())\r\nr=0\r\nc=0\r\np=[]\r\nfor i in range(x):\r\n n=str(input())\r\n if \"S\" not in n:\r\n r+=1\r\n elif \"S\" in n:\r\n for i in range(len(n)):\r\n if n[i]==\"S\" :\r\n if i+1 not in p:\r\n p.append(i+1)\r\nu=r*y\r\nh=y-len(p)\r\nk=h*x\r\no=(u+k)-(h*r)\r\nprint(o)\r\n\r\n", "from sys import stdin\r\n_input = stdin.readline\r\n_list, _str, _len, _int, _range = list, str, len, int, range\r\ndef solution():\r\n r, c = [_int(i) for i in _input().split()]\r\n arr = []\r\n for i in _range(r):\r\n arr.append(_list(_input().rstrip('\\n')))\r\n\r\n eaten_row = []\r\n for i in _range(r):\r\n if arr[i].count('S') == 0:\r\n eaten_row.append(i)\r\n ans = 0\r\n for j in _range(c):\r\n k = 0\r\n for i in _range(r):\r\n if i in eaten_row:\r\n continue\r\n elif arr[i][j] == 'S':\r\n k = 0\r\n break\r\n else:\r\n k += 1\r\n ans += k\r\n ans += _len(eaten_row)*c\r\n print(ans)\r\nsolution()\r\n", "n, m = map(int, input().split())\r\ns = [list(map(str, input())) for i in range(n)]\r\ncount = 0\r\nrow = 0\r\nfor i in range(n):\r\n if 'S' not in s[i]:\r\n count += len(s[i])\r\n row += 1\r\nfor i in range(m):\r\n col = 0\r\n for j in range(n):\r\n if s[j][i] != 'S':\r\n col += 1\r\n if col == n:\r\n count += n - row\r\nprint(count)", "a,b=map(int,input().split())\r\narea=a*b\r\ns1=set()\r\ns2=set()\r\nfor i in range (a):\r\n c=input()\r\n for j in range (len(c)):\r\n if c[j]==\"S\":\r\n s1.add(i)\r\n s2.add(j)\r\nresult=len(s1)*len(s2)\r\nprint(area-result)", "x=input(\"\")\narr1=list(map(int,x.split()))\narr2=[]\nc1=[]\nr1=0\nfor i in range(arr1[0]):\n y=str(input(\"\"))\n arr2.append(y)\nfor j in range(arr1[0]):\n Y='R'\n for k in range(arr1[1]):\n if(arr2[j][k]=='S'):\n Y='W'\n c1.append(k)\n if(Y=='W'):\n r1+=1 \nl1=[]\nfor i in c1:\n if i not in l1:\n l1.append(i)\ntotal=((arr1[0]-r1)*arr1[1])+((arr1[1]-len(l1))*arr1[0])-((arr1[0]-r1)*(arr1[1]-len(l1)))\nprint(total)\n \t \t\t \t \t\t\t \t \t \t \t \t \t\t\t \t", "#y = [int(item) for item in input().split()]\r\nr, c = [int(item) for item in input().split()]\r\nmat = [[s for s in input()] for _ in range(r)]\r\ncount = 0\r\nrows = 0\r\ncols = set()\r\nd = {}\r\nfor i in range(r):\r\n if 'S' not in mat[i]:\r\n rows += 1\r\n for j in range(c):\r\n if 'S' == mat[i][j]:\r\n cols.add(j)\r\n\r\ncount = ((c-len(cols)) * (r-rows))+rows * c\r\n\r\nprint(count)\r\n", "r,c=map(int,input().split())\r\nrow,colm=[],[]\r\nfor i in range(r):\r\n l=input()\r\n for j in range(c):\r\n if(l[j]=='S'):\r\n row.append(i)\r\n colm.append(j)\r\nrow=list(set(row))\t\t\t\r\ncolm=list(set(colm))\r\nprint(r*c - len(row)*len(colm))", "r,c = map(int,input().split())\r\nall_seq= []\r\ncount_row_with_out_s=0\r\ncount_col_with_out_s=0\r\nfor i in range(r):\r\n row_input= input()\r\n all_seq.append(row_input)\r\n\r\nfor row in all_seq:\r\n if 'S' not in row:\r\n count_row_with_out_s+=1\r\n# print(count_row_with_out_s)\r\n\r\nfor col in range(c):\r\n flag=True\r\n for row in range(r):\r\n if all_seq[row][col]=='S':\r\n flag=False\r\n break\r\n if flag:\r\n count_col_with_out_s+=1\r\n# print(count_col_with_out_s)\r\n\r\neatable_row_cells=count_row_with_out_s*c\r\neatable_col_cells=(count_col_with_out_s*r)-(count_col_with_out_s*count_row_with_out_s)\r\n\r\nprint(eatable_row_cells+eatable_col_cells)\r\n", "r, c = map(int, input().split())\r\nx, y = [], []\r\n\r\nfor i in range(r):\r\n s = input()\r\n for j in range(len(s)):\r\n if s[j] == 'S':\r\n x.append(i)\r\n y.append(j)\r\n\r\n\r\ns = r*c\r\nf = [[0]*c for i in range(r)]\r\nfor i in range(len(x)):\r\n f[x[i]][y[i]] = 2\r\n\r\n\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if i in x:\r\n f[i][j] += 1\r\n if j in y:\r\n f[i][j] += 1\r\n if f[i][j] > 1:\r\n s -= 1\r\n\r\n\r\n#for i in f:\r\n# print(i)\r\n#print(x, y)\r\nprint(s)\r\n \r\n \r\n", "r, c = [int(i) for i in input().split()]\r\n\r\nrows = []\r\ncolumns = []\r\ncoords = []\r\n\r\nfor i in range(r):\r\n row = input().lower()\r\n pos = -1\r\n for j in range(row.count('s')):\r\n pos = row.find('s', pos + 1)\r\n if i not in rows:\r\n rows.append(i)\r\n if pos not in columns:\r\n columns.append(pos)\r\n\r\nfor i in rows:\r\n for j in columns:\r\n if (str(i) + '-' + str(j)) not in coords:\r\n coords.append((str(i) + '-' + str(j)))\r\n\r\nprint((r * c) - len(coords))", "\"\"\"\r\n ⢰⡖⣶⣆⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣰⣶⣶⡆\r\n⠀⠀⠘⠓⠛⡟⢻⣿⣤⣤⠀⠀⣠⣤⣼⣿⣿⣧⣤⣄⠀⠀⣤⣤⣿⣿⣿⠛⠛⠃\r\n⠀⠀⠀⠀⠀⠉⠉⢹⠈⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠉⠉\r\n⠀⠀⠀⣀⣀⡖⢲⣾⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣶⣶⣀⣀\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⠃⠀⠘⢻⣿⣿⣿⣿⣿⣿⡟⠃⠀⠘⣿⣿⣿⣿⣿⣿⡇\r\n⢰⢲⣾⣷⣿⣿⣿⣿⣿⣆⣀⣰⣾⣿⣿⣿⣿⣿⣿⣷⣆⣀⣰⣿⣿⣿⣿⣿⣿⣷⣶⡆\r\n⢸⢸⣿⠛⠛⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⠛⣿⣿⡇\r\n⢸⢸⣿⠀⠀⠉⠉⠹⠿⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠏⠉⠉⠀⠀⣿⣿⡇\r\n⢸⣸⢿⣀⠀⠀⠀⠀⠀⠀⠛⠛⢻⣿⣿⣿⣿⣿⣿⡟⠛⠛⠀⠀⠀⠀⠀⠀⣀⣿⣿⡇\r\n⠀⢸⢀⣿⣦⣤⡄⠀⠀⠀⠀⠀⠀⠀⠘⠛⠛⠃⠀⠀⠀⠀⠀⠀⠀⢠⣤⣴⣿⣿⡇\r\n⠀⠈⠉⠉⠧⠽⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⠿⠿⠉⠉⠁ ⠀⠀\r\n ⣀⣀⣤⣤⣤⡀\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀ ⣶⣿⣿⣿⣿⣿⠇\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⢀⣸⣿⣿⣿⣿⣿⣿⣿\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣶⣾⣿⣿⣿⣿⣿⡿⠟\r\n ⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣀⣾⣿⣿⣿⣿⣿⣿⠋⠁\r\n ⠀⠀⢸⣿⣿⣿⣤⠀⣤⣿⣿⣿⣿⣿⣿⠛\r\n ⠀⠀⠸⢿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠏⠉\r\n ⠀⠀⠀⠸⠿⣿⣿⣿⣿⣿⣿⣏⣤⣀\r\n ⠀⠀⠀⣤⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿\r\n ⢰⣶⣾⣿⣿⣿⡟⠃⠛⠛⢻⡿⠿⠛\r\n ⢸⣿⣿⣿⣿⠏\r\n ⠈⠛⠛⠉⠉\r\n\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\"\"\"\r\nr, c = map(int, input().split())\r\nx, y = set(), set()\r\nfor i in range(r):\r\n a = input()\r\n for j in range(len(a)):\r\n if a[j] == 'S':\r\n x.add(i)\r\n y.add(j)\r\nprint(r * c - len(x) * len(y))\r\n", "r,c = map(int,input().split())\r\ncake = []\r\npoints = set()\r\nfor i in range(r) :\r\n row = input()\r\n cake.append(row)\r\n\r\nfor i in range(r) :\r\n key = 0\r\n for j in range(c) :\r\n if(cake[i][j] == 'S') :\r\n key = 1\r\n break\r\n if(key == 0) :\r\n for j in range(c) :\r\n points.add((i,j))\r\n\r\nfor i in range(c) :\r\n key = 0\r\n for j in range(r) :\r\n if(cake[j][i] == 'S') :\r\n key = 1\r\n break\r\n if(key == 0) :\r\n for j in range(r) :\r\n points.add((j,i))\r\n\r\nprint(len(points))\r\n\r\n\r\n", "r , c = list(map(int, input().split()))\r\na = [input() for i in range(r)]\r\nik, jk = [], []\r\nfor i in range(r):\r\n for j in range(c):\r\n if a[i][j] == 'S':\r\n if i not in ik:\r\n ik.append(i)\r\n if j not in jk:\r\n jk.append(j)\r\nprint(r * c - len(ik) * len(jk))", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque,Counter\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10,pi\r\n# from functools import cmp_to_key\r\n\r\n\r\nr,c=map(int,input().split())\r\nfr=[False]*r;fc=[False]*c\r\nfor i in range(r):\r\n t=input()\r\n for j in range(c):\r\n if t[j]=='S':\r\n fr[i]=True\r\n fc[j]=True\r\ncnt=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if not fr[i] or not fc[j]:\r\n cnt+=1\r\nprint(cnt)", "r,c=map(int, input().split())\r\ner=[]\r\nec=[]\r\nfor i in range(r):\r\n l=input()\r\n for j in range(c):\r\n if l[j]=='S':\r\n er.append(i)\r\n ec.append(j)\r\nc=r*c\r\nfor i in range(r):\r\n for j in range(c):\r\n if i in er and j in ec:\r\n c-=1\r\nprint(c)", "\r\nr,c= map(int,input().split())\r\ntot = 0\r\ncount = 0\r\nls = []\r\nfor i in range(r):\r\n ls.append(input())\r\n\r\nl2 = []\r\n\r\nfor i in range(c):\r\n sss = \"\"\r\n for j in ls:\r\n sss+=j[i]\r\n l2.append(sss)\r\n\r\nfor i in ls:\r\n if not i.__contains__('S'):\r\n tot+=len(i)\r\n count+=1\r\n\r\nfor i in l2:\r\n if not i.__contains__('S'):\r\n tot +=(len(i)-count)\r\n\r\nprint(tot)", "r,c = map(int,input().split())\r\ns=[]\r\nfor x in range(r):\r\n s.append(list(input()))\r\n\r\n\r\nresult=0\r\nfor x in range(r):\r\n t=s[x]\r\n if 'S' not in t:\r\n result+=c\r\n i=0\r\n while i<c:\r\n t[i]='x'\r\n i+=1\r\n\r\ns=list(map(list,zip(*s)))\r\n\r\nfor x in range(c):\r\n t=s[x]\r\n if 'S' not in t:\r\n result+=t.count('.')\r\n i=0\r\n while i<r:\r\n t[i]='x'\r\n i+=1\r\n\r\nprint(result)\r\n", "r, c = list(map(int, input().split()))\r\nmatrix = []\r\nfor i in range(r):\r\n line = list(input())\r\n matrix.append(line)\r\nmatrix90 = []\r\nfor i in range(c):\r\n line = []\r\n for j in range(r):\r\n line.append(matrix[j][i])\r\n matrix90.append(line)\r\nCount = Count2 = 0\r\nfor i in matrix:\r\n if 'S' not in i:\r\n Count += 1\r\n# print(Count)\r\nfor i in matrix90:\r\n if 'S' not in i:\r\n Count2 += 1\r\n# for i in matrix90:\r\n# print(i)\r\nC = (Count * len(matrix[0]) + Count2 * len(matrix90[0])) - Count * Count2\r\nprint(C)", "r,c=map(int,input().split())\r\nmat=[]\r\nfor i in range(r):\r\n mat.append(list(input()))\r\nrw=[];cl=[]\r\nfor i in range(r):\r\n for j in range(c):\r\n if mat[i][j]==\"S\":\r\n rw.append(i)\r\n cl.append(j)\r\nk=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if i in rw and j in cl:\r\n k+=1\r\nprint(r*c-k)\r\n \r\n \r\n", "r, c = list(map(int, input().split()))\n\ncount = r * c\nmatrix = []\nfor i in range(r):\n row = input()\n matrix.append(row)\n\n\ndef sInRow(row):\n for i in range(c):\n if matrix[row][i] == \"S\":\n return True\n\n return False\n\n\ndef sInCol(col):\n for i in range(r):\n if matrix[i][col] == \"S\":\n return True\n\n return False\n\n\nfor i in range(r):\n for j in range(c):\n if sInRow(i) and sInCol(j):\n count -= 1\n\nprint(count)\n \t \t\t \t \t \t \t\t\t \t\t \t \t\t\t", "x=input(\"\")\narr1=list(map(int,x.split()))\narr2=[]\ncolumn=[]\nrow=0\nfor i in range(arr1[0]):\n y=str(input(\"\"))\n arr2.append(y)\nfor j in range(arr1[0]):\n choice='N'\n for k in range(arr1[1]):\n if(arr2[j][k]=='S'):\n choice='Y'\n column.append(k)\n if(choice=='Y'):\n row+=1 \nnot_dupl=[]\nfor i in column:\n if i not in not_dupl:\n not_dupl.append(i)\ntotal=((arr1[0]-row)*arr1[1])+((arr1[1]-len(not_dupl))*arr1[0])-((arr1[0]-row)*(arr1[1]-len(not_dupl)))\nprint(total)\n\t \t\t \t\t\t \t \t \t \t\t \t\t\t \t\t", "n, m = map(int, input().split()) # Размер торта.\r\nT = [] # Пустой список ТОРТ.\r\nL = [] # Пустой список тарелка для съедобных кусочков.\r\nfor i in range(n): # Заполняем торт,\r\n T.append(input()) # считывая строки.\r\nfor j in range(n): # Проверяем стороки\r\n if 'S' not in T[j]: # на наличие гадкой клубники.\r\n for k in range(m): # Если нет,\r\n L.append(f'{j}{k}') # Переписываем номера кусочков в чистых строках в \"L\"\r\n else: # Иначе\r\n continue # не едим эту строку.\r\nfor j in range(m): # Для каждого столца.\r\n P = [] # Здесь будем временно хранить столбец.\r\n f = True # Флаг устанавливаем True\r\n for k in range(n): # Проверяем столбики\r\n if T[k][j] == 'S': # на наличие гадкой клубники.\r\n f = False # Если она есть, флагу присваиваем False \r\n P.append(f'{k}{j}') # Набираем столбец\r\n if f: # В зависимости от флага\r\n for i in P: # Перекладываем кусочки,\r\n if i not in L: # если ранее не переложили,\r\n L.append(i) # на тарелку.\r\nprint(len(L)) ", "r,c=map(int,input().split())\r\nm=[]\r\na=[]\r\nfor i in range(r):\r\n\ts=input()\r\n\ta.append(s)\r\nfor i in range(r):\r\n\tif 'S' not in a[i]:\r\n\t\tm.extend([(i,j) for j in range(c)])\r\nfor i in range(c):\r\n\tb=[]\r\n\tfor j in range(r):\r\n\t\tb.append(a[j][i])\r\n\tif 'S' not in b:\r\n\t\tm.extend([(k,i) for k in range(r)])\r\nm=set(m)\r\nprint(len(m))", "n, m = map(int, input().split())\r\nmatrix = [list(input()) for _ in range(n)]\r\ncnt = 0\r\ncnt_rows = 0\r\ncnt_colums = 0\r\n\r\nfor row in matrix:\r\n if \"S\" not in row:\r\n cnt += len(row)\r\n cnt_rows += 1\r\n \r\nfor row in zip(*matrix):\r\n if \"S\" not in row:\r\n cnt += len(row)\r\n cnt_colums += 1\r\n \r\nprint(cnt - cnt_colums * cnt_rows)", "rows,cols=map(int,input().split())\r\nr=[0]*rows\r\nc=[0]*cols\r\nrcount=ccount=0\r\n\r\nfor i in range(rows):\r\n s=input()\r\n for j in range(cols):\r\n if s[j]=='S':\r\n r[i]=c[j]=1\r\n\r\nfor i in range(rows):\r\n if not r[i]:\r\n rcount+=1\r\n\r\nfor i in range(cols):\r\n if not c[i]:\r\n ccount+=1\r\n\r\nresult=cols*rcount+rows*ccount-rcount*ccount\r\nprint(result)\r\n ", "r,c = map(int,input().split())\r\nmatrix=[]\r\nrlst =[]\r\nfor i in range(r):\r\n row = input()\r\n rlst = list(row)\r\n matrix.append(rlst)\r\n\r\n# print(matrix)\r\n\r\n#how many can he eat\r\nhow_many = 0\r\n#check empty row\r\nrc_is_empty = True\r\n\r\n#check if row is empty\r\nfor i in range(r):\r\n rc_is_empty = True\r\n if 'S' in matrix[i]:\r\n rc_is_empty = False\r\n if rc_is_empty:\r\n for j in range(c):\r\n matrix[i][j] = 'E'\r\n\r\n#check if col is empty\r\nfor j in range(c):\r\n rc_is_empty = True\r\n for i in range(r):\r\n if 'S' in matrix[i][j]:\r\n rc_is_empty = False\r\n if rc_is_empty:\r\n for i in range(r):\r\n matrix[i][j]='E'\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if matrix[i][j] == 'E':\r\n how_many +=1\r\n\r\n\r\nprint(how_many)\r\n", "m, n = list(map(int, input().split(' ')))\r\nmatrix = [list(input()) for _ in range(m)]\r\n\r\nans = 0\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n lin = [line[j] for line in matrix]\r\n if 'S' not in matrix[i] or 'S' not in lin:\r\n ans += 1\r\nprint(ans)\r\n", "if(__name__=='__main__'):\r\n n,m=map(int,input().split())\r\n mat=[]\r\n for i in range(n):\r\n p=input()\r\n x=[item for item in p]\r\n mat.append(x)\r\n rowCount=0\r\n colCount=0\r\n for i in range(n):\r\n z=True\r\n for j in range(m):\r\n if(mat[i][j]=='S'):\r\n z=False\r\n break\r\n if(z):\r\n rowCount+=1\r\n for i in range(m):\r\n z=True\r\n for j in range(n):\r\n if(mat[j][i]=='S'):\r\n z=False\r\n break\r\n if(z):\r\n colCount+=1\r\n #print(colCount,rowCount)\r\n mi=rowCount*colCount\r\n print(rowCount*m+colCount*n-mi)\r\n", "r, c = map(int, input().split())\r\na = [list(map(str,input())) for i in range(r)]\r\nb = []\r\ns = 0\r\nline = 0\r\ncol = 0\r\nfor i in range(r):\r\n if 'S' not in a[i]:\r\n for j in range(c):\r\n if a[i][j] == '.':\r\n a[i][j] = 0\r\n s += 1\r\nfor j in range(c):\r\n is_find = False\r\n for i in range(r):\r\n if a[i][j] == 'S':\r\n is_find = True\r\n break\r\n if not is_find:\r\n for i in range(r):\r\n if a[i][j] == '.':\r\n a[i][j] = 0\r\n s += 1\r\n\r\nprint(s)", "m,n=map(int,input().split())\r\nl,l1=[],[]\r\nfor i in range(m):\r\n l=[x for x in input()]\r\n l1.append(l)\r\nl,l2=[],[]\r\nfor i in range(m):\r\n for j in range(n):\r\n if l1[i][j]!='S':\r\n l.append(str(i)+str(j))\r\n else:\r\n l=[]\r\n break\r\n if l!=[]:\r\n l2+=l \r\n l=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if l1[j][i]!='S':\r\n l.append(str(j)+str(i))\r\n else:\r\n l=[]\r\n break\r\n if l!=[]:\r\n l2+=l \r\n l=[]\r\nprint(len(set(l2)))\r\n ", "row, col = map(int, input().split())\r\ngrid = []\r\nablex = []\r\nabley = []\r\nfor x in range(row):\r\n cur_row = input()\r\n grid.append(cur_row)\r\n for i in range(col):\r\n if cur_row[i] == \"S\":\r\n ablex.append(i)\r\n abley.append(x)\r\ncount = 0\r\nfor rows in range(row):\r\n for cols in range(col):\r\n if rows in abley and cols in ablex:\r\n count += 1\r\nprint(row*col - count)", "n, m = (int(i) for i in input().split())\r\nl = [input() for i in range(n)]\r\na = []\r\nfor i in range(n): # 2 цикла нужны для определения координат 'S' в матрице\r\n for j in range(m):\r\n if l[i][j] == 'S':\r\n a.append([i, j]) # добавляем координаты 'S'\r\n\r\nfor i in range(len(a)): # 2 цикла для нахождения координат '.', которые не съедят.\r\n for j in range(len(a)):\r\n if [a[i][0], a[j][1]] not in a:\r\n a.append([a[i][0], a[j][1]])\r\nprint(n * m - len(a))\r\n", "def process():\r\n rows, cols = list(map(int, input().split()))\r\n \r\n matrix = []\r\n bad_row = set()\r\n bad_col = set()\r\n for r in range(rows):\r\n matrix.append(input())\r\n for c, ch in enumerate(matrix[r]):\r\n if ch == 'S':\r\n bad_row.add(r)\r\n bad_col.add(c)\r\n \r\n result = 0\r\n for i in range(rows):\r\n for j in range(cols):\r\n if not(i in bad_row and j in bad_col):\r\n result += 1\r\n \r\n print(result)\r\n \r\nprocess()", "r,c = map(int, input().split())\r\na = []\r\nfor i in range(r):\r\n\ta.append([])\r\n\ta[i]= input()\r\ncount_r = 0\r\ncount_c = 0\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\t# print(a[i][j])\r\n\t\tif(a[i][j]=='S'):\r\n\t\t\tval_r = 'False'\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tval_r = 'True'\r\n\tif(val_r == 'True'):\r\n\t\tcount_r += 1\r\nfor j in range(c):\r\n\tfor i in range(r):\r\n\t\tif(a[i][j]=='S'):\r\n\t\t\tval_c = 'False'\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tval_c = 'True'\r\n\tif(val_c == 'True'):\r\n\t\tcount_c += 1\r\n\r\nprint((c*count_r)+(r*count_c)-(count_r*count_c))\r\n\r\n", "# 5.8.7. A.Тортминатор.py\n# https://stepik.org/lesson/332555/step/7?unit=315943\n# https://codeforces.com/problemset/problem/330/A\n#\n\"\"\"\nДан прямоугольный торт, который имеет вид таблицы размером r × c.\nКаждая ячейка таблицы содержит либо гадкую клубничку, либо является пустой.\nНапример, торт размера 3 × 4 может выглядеть так:\n\nТортминатор намерен съесть этот торт!\nКаждый раз, когда он ест, он выбирает строку или столбец,\nне содержащие гадкой клубнички, а содержащие по крайней мере\nодну несъеденную ячейку торта. Затем Тортминатор поедает все выбранные им\nячейки торта. Тортминатор может есть сколько угодно раз.\n\nПожалуйста, выведите максимальное количество ячеек,\nкоторые может съесть Тортминатор.\n\nВходные данные\n\nПервая строка содержит два целых числа r и c (2 ≤ r, c ≤ 10),\nобозначающих количество строк и количество столбцов в торте.\nСледующие r строк содержат по c символов — j-ый символ i-ой строки\nобозначает содержимое ячейки в строке i и столбце j,\nи имеет одно из следующих значений:\n\nсимвол '.' обозначает ячейку торта без гадкой клубнички;\nсимвол 'S' обозначает ячейку торта с гадкой клубничкой.\n\nВыходные данные\nВыведите максимальное количество ячеек торта, которые может съесть тортминатор.\n\n\"\"\"\n\n# r, c = 3, 4\nr, c = map(int, input().split())\nmatrix = [[j for j in input()] for i in range(r)]\n\ntrans = [[matrix[y][x] for y in range(r)] for x in range(c)] # транспонированная матрица\n\nd1 = {(b, a) for a in range(c) for b in range(r) if 'S' not in matrix[b]}\nd2 = {(a, b) for a in range(r) for b in range(c) if 'S' not in trans[b]}\n\nprint(len(d1 | d2))", "r,c = map(int,input().split()) \r\n\r\nstr1 = ''\r\nstr2 = ''\r\nfor i in range(r):\r\n n = input()\r\n for j in range(len(n)):\r\n if n[j] == 'S':\r\n str1+=str(i)\r\n str2+=str(j)\r\n \r\n \r\n \r\nprint(r*c - len(set(str1)) * len(set(str2)))", "r, c = [int(i) for i in input().split()]\r\ncake = []\r\nrow_s = 0\r\ncolumn_s = 0\r\nres = 0\r\n\r\n\r\n\r\nfor i in range(r):\r\n cake.append(list(input()))\r\n\r\n\r\nfor i in cake:\r\n for j in i:\r\n if j == \"S\":\r\n break\r\n else:\r\n row_s += 1\r\n\r\n\r\nfor j in range(c):\r\n for i in range(r):\r\n if cake[i][j] == \"S\":\r\n break\r\n else:\r\n column_s += 1\r\n\r\nprint(row_s * c + column_s * (r - row_s))\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\na = [[str(i) for i in input()] for j in range(n)]\r\nkol = 0;f = [];k = 0;a2 = []\r\nfor i in range(len(a)):\r\n if a[i].count('.') == m:\r\n kol += m;k += 1\r\n else:f.append(a[i])\r\nfor i in range(m):\r\n v = []\r\n for j in range(len(f)):v.append(f[j][i])\r\n a2.append(v)\r\nfor i in range(len(a2)):\r\n if a2[i].count('.') == len(a2[i]):\r\n kol += len(a2[i])\r\nprint(kol)\r\n\r\n", "r,c = input().split()\r\nr = int(r)\r\nc = int(c)\r\ntotal = r*c\r\nm = []\r\ncakes_eaten = 0\r\nfor i in range(r):\r\n s = input()\r\n if 'S' in s:\r\n m.append(s)\r\n else:\r\n cakes_eaten += c\r\n r -= 1\r\n \r\n#rint('Total no of cake boxes: ',total)\r\n\r\nfor j in range(c):\r\n temp = 0\r\n for i in range(r):\r\n #rint(str(i)+str(j),end = '\\t')\r\n \r\n if m[i][j] == 'S':\r\n break\r\n else:\r\n if i == (r-1):\r\n cakes_eaten += r\r\n #rint('\\n')\r\nprint(cakes_eaten)\r\n", "r, c = map(int, input().split())\ncake = [input() for _ in range(r)]\n\nrows = [i for i in range(r) if 'S' not in cake[i]]\ncols = [j for j in range(c) if 'S' not in [cake[i][j] for i in range(r)]]\n\nmax_cells = (((len(rows) * c) + (len(cols) * r)) - (len(rows) * len(cols)))\nprint(max_cells)\n\n \t\t \t\t\t \t\t \t \t \t \t \t \t", "r,c=map(int,input().split())\r\nl=[]\r\nre,ce,e=0,0,0\r\nfor i in range(r):\r\n x=input()\r\n if \"S\" not in x:\r\n re+=1\r\n e+=c\r\n l.append(x)\r\nfor i in range(c):\r\n f=False\r\n for j in range(r):\r\n if l[j][i] == \"S\":\r\n f=True\r\n if not f:\r\n ce+=1\r\n e+=r\r\nprint(e-(re*ce))", "r,c = map(int, input().split())\r\ns = set()\r\ne = set()\r\n \r\nfor i in range(r):\r\n tmp = input()\r\n for j in range(c):\r\n if tmp[j] == 'S':\r\n s.add((i,j))\r\n \r\nfor s1 in s:\r\n for s2 in s:\r\n if (s1 != s2) and ( (s1[0] != s2[0]) or (s1[1] != s2[1]) ):\r\n e.add((s1[0],s2[1]))\r\n e.add((s2[0],s1[1]))\r\n \r\nprint((r*c)-len(s.union(e)))", "r, c = map(int, input().split())\r\ncake = []\r\nempty_r = empty_c = 0\r\n\r\nfor i in range(r):\r\n cake.append(input())\r\n if 'S' not in cake[i]:\r\n empty_r += 1\r\n\r\nfor i in range(c):\r\n empty = True\r\n for piece in cake:\r\n if piece[i] == 'S':\r\n empty = False\r\n break\r\n if empty:\r\n empty_c += 1\r\n\r\nprint((empty_r * c) + (empty_c * r) - (empty_r * empty_c))\r\n", "r,c=map(int,input().split())\r\nans=0\r\nk=set()\r\nfor i in range(0,r):\r\n\ts=input()\r\n\tif \"S\" not in s:\r\n\t\tans+=1\r\n\telse:\r\n\t\tfor i in range(0,c):\r\n\t\t\tif s[i]==\"S\":\r\n\t\t\t\tk.add(i)\r\nj=len(k)\r\ngc=c-j\r\ngr=r-ans\r\nans=ans*c\r\nans+=(gc*gr)\r\nprint(ans)", "n,m = map(int,input().split())\r\npole = []\r\nk=0\r\nfor x in range(n):\r\n a = list(input())\r\n pole.append(a)\r\n\r\nfor x in range(n):\r\n if pole[x].count('S')==0:\r\n pole[x]=[1]*m\r\n\r\nfor x in range(m):\r\n fl=0\r\n for y in range(n):\r\n if pole[y][x]=='S':\r\n fl=1\r\n if fl==0:\r\n for y in range(n):\r\n pole[y][x]=1\r\n\r\nfor x in range(n):\r\n for y in range(m):\r\n if pole[x][y]==1:\r\n k+=1\r\nprint(k)", "r,c = [int(x) for x in input().split()]\r\nl = []\r\nfor i in range(r):\r\n l.append(input())\r\nevilRow = list(set([i for i in range(r) if 'S' in l[i]]))\r\nevilCol = list(set([j for i in evilRow for j in range(c) if l[i][j]=='S']))\r\nprint(r*c - len(evilRow)*len(evilCol))", "r,c=map(int,input().split())\r\ns=[list(input()) for i in range(r)]\r\nmatrix=[]\r\nfor i in zip(*s):\r\n matrix.append(i)\r\nrow=[1]*c\r\ncol=[1]*r\r\nfor i in range(c):\r\n for j in range(r):\r\n if matrix[i][j]=='S':\r\n row[i]=col[j]=0\r\neatable=0\r\nfor i in range(c):\r\n for j in range(r):\r\n if row[i]!=0 or col[j]!=0:\r\n eatable+=1\r\nprint(eatable)", "r,c =map(int,input().split())\r\ns=[]\r\n\r\nfor i in range (r):\r\n s.append(list(input()))\r\n\r\n\r\nx=0\r\nfor i in range(r):\r\n t=s[i]\r\n if \"S\" not in t:\r\n x+=c\r\n j=0\r\n while j<c:\r\n t[j]=\"0\"\r\n j+=1\r\n\r\ns=list(map(list,zip(*s)))\r\n\r\n\r\nfor i in range (c):\r\n t=s[i]\r\n if \"S\" not in t:\r\n x+=t.count(\".\")\r\n j=0\r\n while j<r:\r\n t[j]=\"0\"\r\n j+=1\r\n\r\nprint(x)", "lines = [w.rstrip() for w in open(0).readlines()]\r\nr, c = map(int, lines[0].split())\r\nlines = lines[1:]\r\ndc = dict()\r\neaten = set()\r\nfor i, x in enumerate(lines):\r\n for j, y in enumerate(x):\r\n dc[(i,j)] = y\r\n if x == \".\"*c:\r\n eaten = eaten.union((i,j) for j in range(c))\r\n\r\nfor j in range(c):\r\n if all(dc[(i,j)] == \".\" for i in range(r)):\r\n eaten = eaten.union((i,j) for i in range(r))\r\nprint(len(eaten))", "n,m=map(int,input().split())\r\ns=[];r=0\r\nfor i in range(n):\r\n s.append(list(input()))\r\nfor i in s:\r\n if 'S' not in i: \r\n t = i.count('.') \r\n r += t\r\n s[s.index(i)] = [' ']*m\r\ns=list(zip(*s))\r\nfor i in s:\r\n if 'S' not in i: \r\n t = i.count('.') \r\n r += t\r\n s[s.index(i)] = [' ']*n\r\nprint(r)", "x, y = [int(i) for i in input().split()]\r\ncount_row = 0\r\ncols = []\r\nfor i in range(x):\r\n inp = input()\r\n flag = False\r\n for indx, j in enumerate(inp):\r\n if j == 'S':\r\n flag = True\r\n if indx not in cols:\r\n cols.append(indx)\r\n if not (flag):\r\n count_row += 1\r\ncount_col = y-len(cols)\r\nprint(count_row*y+count_col*x-count_row*count_col)\r\n", "if __name__ == '__main__':\r\n rows, cols = set(), set()\r\n n, m = map(int, input().split())\r\n for r in range(n):\r\n s = input()\r\n for c in range(m):\r\n if s[c] == 'S':\r\n rows.add(r)\r\n cols.add(c)\r\n print(n * m - len(rows) * len(cols))\r\n", "\r\n\r\ndef main():\r\n r, c = map(int, input().split())\r\n grid = []\r\n\r\n for i in range(r):\r\n grid.append(input())\r\n\r\n\r\n ans = 0\r\n\r\n for i in range(r):\r\n if 'S' not in grid[i]:\r\n ans += c\r\n grid[i] = 'e' * c\r\n\r\n\r\n start = 0\r\n while start < c:\r\n good = True\r\n total = 0\r\n for i in range(r):\r\n if grid[i][start] == 'S':\r\n good = False\r\n break\r\n elif grid[i][start] == '.':\r\n total += 1\r\n\r\n if good:\r\n ans += total\r\n start += 1\r\n print(ans)\r\n\r\n\r\n\r\n\r\nmain()\r\n", "from collections import Counter\r\nn, m = map(int, input(). split())\r\nans = [ ]\r\nb = [ ]\r\nnn = n\r\nq = 0\r\nw = 0\r\ne = 0\r\nr = [ ]\r\nwhile n > 0:\r\n s = input()\r\n b += [s]\r\n p = Counter(s)\r\n if p['.'] == m:\r\n for i in range(m):\r\n ans += [str(i) + str(n)]\r\n n -= 1\r\nwhile 1 > 0:\r\n if q == nn:\r\n if e == nn:\r\n ans += [*r]\r\n if w == m:\r\n break\r\n r = [ ]\r\n e = 0\r\n w += 1\r\n q = 0\r\n elif q != nn and w != m and b[q][w] == '.':\r\n e += 1\r\n q += 1\r\n r += [str(w) + str(q)]\r\n else:\r\n q += 1\r\nprint(len(set(ans)))\r\n", "def cakeminator(cake, r, c):\r\n total = 0\r\n # Check which rows cakeminator can eat\r\n for i in range(r):\r\n if 'S' not in cake[i]:\r\n for j in range(c):\r\n if cake[i][j] == '.':\r\n cake[i][j] = 'x'\r\n total += 1\r\n \r\n # Check which columns cakeminator can eat\r\n for i in range(c):\r\n res = [] \r\n for j in range(r):\r\n res.append(cake[j][i])\r\n \r\n if 'S' not in res:\r\n total += res.count('.')\r\n \r\n return total\r\n \r\n \r\ndef mkcake(r, c):\r\n cake = []\r\n for i in range(r):\r\n s = list(input())\r\n cake.append(s)\r\n return cake\r\n \r\n \r\ndef main():\r\n r, c = map(int, input().split())\r\n cake = mkcake(r, c)\r\n print(cakeminator(cake, r, c))\r\n \r\n \r\nmain()", "a, q = map(int, input().split(' '))\r\ns = []\r\nw = []\r\nfor i in range(a):\r\n d = input()\r\n if 'S' in d:\r\n s.append(1)\r\n for j in range(q):\r\n if d[j] == 'S':\r\n w.append(j)\r\nprint(a * q - len(s) * len(set(w)))\r\n", "r,c = map(int, input().split())\r\narr = []\r\nrows = 0\r\ncols = 0\r\nfor i in range(r):\r\n\tarr.append(input())\r\nfor i in range(r):\r\n\tif 'S' not in arr[i]:\r\n\t\trows += 1\r\nfor i in range(c):\r\n\ttemp = 0\r\n\tfor j in range(r):\r\n\t\tif arr[j][i] != 'S':\r\n\t\t\ttemp += 1\r\n\tif temp == r:\r\n\t\tcols += 1\r\nprint(rows*c + cols*r - rows*cols)", "r, c = map(int, input().split())\r\nans_r = set()\r\nans_c = set()\r\nfor row in range(r):\r\n s = input()\r\n start = 0\r\n while True:\r\n col = s.find('S', start)\r\n if col < 0:\r\n break\r\n start = col + 1\r\n ans_r.add(row)\r\n ans_c.add(col)\r\nprint(r * c - len(ans_r) * len(ans_c))\r\n", "r, c = map(int, input().split())\r\ncake = []\r\ncells = 0\r\nrows = 0\r\n\r\nfor i in range(r):\r\n cake.append(input())\r\n if cake[i].count('S') == 0:\r\n cells += c\r\n rows += 1\r\n\r\ncolumns = ['' for _ in range(c)]\r\n\r\nfor row in range(c):\r\n for column in range(r):\r\n columns[row] += cake[column][row]\r\n\r\nfor column in columns:\r\n if column.count('S') == 0:\r\n cells += r-rows\r\n\r\nprint(cells)\r\n", "x=[int (x) for x in input().split()]\r\nr=x[0]\r\nc=x[1]\r\na=0\r\nv=[]\r\nfor i in range(r):\r\n it=input()\r\n v.append(it)\r\n if it.count(\"S\")==0:\r\n a+=1\r\nb=0\r\nfor j in range(c):\r\n l=\"\"\r\n for k in range(r):\r\n l+=v[k][j]\r\n if l.count(\"S\")==0:\r\n b+=1\r\nprint((a*c)+(b*r)-(a*b))", "r, c = [int(i) for i in input().split()]\r\ntort = []\r\nx = 0 #строки\r\ny = 0 #столбцы\r\nfor i in range(r):\r\n tort.append(input())\r\n if 'S' not in tort[i]:\r\n x += 1\r\nfor j in range(c):\r\n cow = True\r\n for i in range(r):\r\n if tort[i][j] == 'S':\r\n cow = False\r\n break\r\n if cow:\r\n y += 1\r\nprint(c * x + (r-x) * y)", "n, m = map(int,input().split())\ns = []\ncount_i = 0\ncount_j = 0\nfor i in range(n):\n s.append(input())\n\nfor i in range(n):\n if 'S' not in s[i]:\n count_i += 1\nfor j in range(m):\n count = 0\n for i in range(n):\n if s[i][j] == 'S':\n continue\n else:\n count +=1\n if count == n:\n count_j +=1\nprint(count_i*m + count_j*n - count_i*count_j)", "r, c = map(int, input().split())\r\nx = []\r\ny = []\r\nfor i in range(r):\r\n row = [char for char in input()]\r\n for j in range(c):\r\n if row[j] == 'S':\r\n x.append(j)\r\n y.append(i)\r\n\r\ncells = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if i not in y or j not in x:\r\n cells += 1\r\nprint(cells)", "r,c = map (int,input(\"\").split())\r\ns=[]\r\nfor x in range (r):\r\n s.append(list(input(\"\")))\r\nresult=0\r\n\r\nfor x in range (r):\r\n t=s[x]\r\n if \"S\" not in t:\r\n result += c\r\n i=0\r\n while i<c:\r\n t[i]='x'\r\n i+=1\r\n \r\ns=list(map(list,zip(*s)))\r\n\r\nfor x in range (c):\r\n t=s[x]\r\n if 'S'not in t :\r\n result +=t.count('.')\r\n i=0\r\n while i<r:\r\n t[i] ='x'\r\n i+=1\r\nprint(result)", "r,c=map(int,input().split())\r\nx1=min(r,c)\r\not=[]\r\ncount=0\r\na,b=0,0\r\nfor i in range(r) :\r\n s=input()\r\n if 'S' not in s :\r\n a+=1\r\n # else:\r\n l=list(s)\r\n ot.append(l)\r\n# print(ot)\r\nfor i in range(c) :\r\n x=\"\"\r\n for j in range(r) :\r\n x+=ot[j][i]\r\n # print(x)\r\n if 'S' not in x:\r\n b+=1\r\n# print(a,b) \r\nprint(a*c+b*(r-a))\r\n\r\n", "r,c = map(int,input().split()) \r\nv = 0\r\nf = list()\r\nf1 = list()\r\nfor i in range(r):\r\n n = input()\r\n for j in range(len(n)):\r\n if n[j] == 'S':\r\n f.append(i)\r\n f1.append(j)\r\n \r\n\r\n\r\nprint(r*c - len(set(f)) * len(set(f1)))", "strok,stolb=map(int, input().split())\r\nr=''\r\npole=[]\r\nkuskov=0\r\nfor i in range(strok):\r\n r=input()\r\n if 'S' in r:\r\n pole.append(r)\r\n else:\r\n kuskov+=stolb\r\n strok-=1\r\nfor i in range(stolb):\r\n vertrjad = ''\r\n for j in range(strok):\r\n vertrjad+=pole[j][i]\r\n if 'S' not in vertrjad:\r\n kuskov+=strok\r\nprint(kuskov)", "r,c=map(int,input().split())\r\nl=[]\r\nc1=0\r\nx=0\r\nfor i in range(r):\r\n\tl1=list(input())\r\n\tif 'S' not in l1:\r\n\t\t# print(l1,c1)\r\n\t\tc1+=c\r\n\t\tx+=1\r\n\t\tpass\r\n\telse:\r\n\t\tl.append(l1)\r\nr-=x\r\n# print(c1)\r\nfor i in range(c):\r\n\tc2=0\r\n\tfor j in range(r):\r\n\t\tif l[j][i]=='.':\r\n\t\t\tc2+=1\r\n\t\telse:\r\n\t\t\tc2=0\r\n\t\t\tbreak\r\n\tc1+=c2\r\nprint(c1)", "r, c = map(int, input().split())\r\na = []\r\n[a.append(input()) for _ in range(r)]\r\nk = 0\r\nt = 0\r\nn = 0\r\nfor j in range(c):\r\n for i in range(r):\r\n if a[i][j] == 'S':\r\n continue\r\n else:\r\n t += 1\r\n if t == r:\r\n k += t\r\n n += +1\r\n t = 0\r\nfor i in range(r):\r\n if 'S' in a[i]:\r\n continue\r\n else:\r\n k += len(a[i]) - n\r\nprint(k)\r\n", "r,c=map(int,input().split())\r\na=[]\r\nb=[]\r\nd=0\r\nfor i in range(0,r):\r\n a=list(input())\r\n if \"S\" not in a:\r\n a=[0]*c\r\n d=d+c\r\n b.append(a)\r\nfor i in range(0,c):\r\n k=0\r\n m=0\r\n for j in range(0,r):\r\n if(b[j][i]==\".\" or b[j][i]==0):\r\n if(b[j][i]==\".\"):\r\n m=m+1\r\n else:\r\n k=1\r\n if(k==0):\r\n d=d+m\r\nprint(d)\r\n \r\n \r\n \r\n \r\n", "r, c = map(int, input().split())\r\n\r\ntort = [input() for _ in range(r)]\r\n\r\nmassive = [[False] * c for _ in range(r)]\r\n\r\nfor i in range(r):\r\n if \"S\" not in tort[i]:\r\n for j in range(c):\r\n massive[i][j] = True\r\n\r\nfor j in range(c):\r\n is_find = False\r\n for i in range(r):\r\n if tort[i][j] == \"S\":\r\n is_find = True\r\n break\r\n if not is_find:\r\n for i in range(r):\r\n massive[i][j] = True\r\n\r\ncount_True = 0\r\nfor row in massive:\r\n count_True += row.count(True)\r\n \r\nprint(count_True)\r\n", "x=input(\"\")\r\narr1=list(map(int,x.split()))\r\narr2=[]\r\ncolumn=[]\r\nrow=0\r\nfor i in range(arr1[0]):\r\n y=str(input(\"\"))\r\n arr2.append(y)\r\nfor j in range(arr1[0]):\r\n choice='N'\r\n for k in range(arr1[1]):\r\n if(arr2[j][k]=='S'):\r\n choice='Y'\r\n column.append(k)\r\n if(choice=='Y'):\r\n row+=1 \r\nnot_dupl=[]\r\nfor i in column:\r\n if i not in not_dupl:\r\n not_dupl.append(i)\r\ntotal=((arr1[0]-row)*arr1[1])+((arr1[1]-len(not_dupl))*arr1[0])-((arr1[0]-row)*(arr1[1]-len(not_dupl)))\r\nprint(total)", "A = []\nR,C = list(map(int,input().split()))\nfor row in range(R):\n A.append(list(input()))\n\n\ncakes = 0\nfor i , row in enumerate(A):\n if 'S' not in row:\n A[i] = ['X' for _ in row]\n cakes += row.count('.')\n\nfor c in range(C):\n col = [A[r][c] for r in range(R)]\n if 'S' not in col:\n for r in range(R):\n A[r][c] = 'X'\n cakes += col.count('.')\n\nprint(cakes)\n \t\t \t \t\t\t \t \t\t\t \t\t \t \t", "r, c = list(map(int, input().split()))\r\na = [input() for i in range(r)]\r\nk_i, k_j = [], []\r\nfor i in range(r):\r\n for j in range(c):\r\n if a[i][j] == 'S':\r\n if i not in k_i:\r\n k_i.append(i)\r\n if j not in k_j:\r\n k_j.append(j)\r\nprint(r * c - len(k_i) * len(k_j))", "r,c = map(int, input().split())\r\nr0=[];c0=[]\r\n\r\nfor i in range(r):\r\n\ts = input()\r\n\tfor j in range(c):\r\n\t\tif s[j]==\"S\":\r\n\t\t\tr0.append(i)\r\n\t\t\tc0.append(j)\r\nr0=set(r0);c0=set(c0)\r\nprint((r*c)-(len(r0)*len(c0)))", "a=[int(i)for i in input().split()]\r\ns=[input() for i in range(a[0])]\r\nd=0\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i-d]=='.'*a[1]:\r\n del s[i-d]\r\n d+=1\r\n k+=a[1]\r\nf=[[s[-(i+1)][o] for i in range(len(s))]for o in range(a[1])]\r\nd=0\r\nfor i in range(len(f)):\r\n if f[i-d]==['.']*len(s):\r\n del f[i-d]\r\n d+=1\r\n k+=len(s)\r\nprint(k)", "r, c = map(int, input().split())\r\ncount=0; rows=set();cols=set()\r\nfor i in range(r):\r\n\ts = input().strip()\r\n\tfor j in range(c):\r\n\t\tif s[j]==\"S\":\r\n\t\t\tcols.add(j)\r\n\t\t\trows.add(i)\r\nprint(r*c-(len(rows)*len(cols)))", "n,m=map(int,input().split())\r\nc=0\r\ns=set()\r\nfor i in range(n):\r\n k=input()\r\n if 'S' not in k:\r\n c+=1\r\n continue\r\n for j in range(m):\r\n if k[j]=='S':\r\n s.add(j)\r\nt=(m-len(s))*n+c*m-c*(m-len(s))\r\nprint(t)", "a,b = map(int,input().split(' '))\r\ncake=[]\r\nfor i in range(a):\r\n cake.append(input())\r\neat =0\r\nfor i in range(a):\r\n if 'S' not in cake[i] and '.' in cake[i]:\r\n eat += cake[i].count('.')\r\n cake[i]=cake[i].replace('.','x')\r\n#print(cake)\r\nfor i in range(b):\r\n if 'S'not in [row[i] for row in cake] and '.' in [row[i] for row in cake]:\r\n eat += [row[i] for row in cake].count('.')\r\nprint(eat)", "n,m = map(int, input().split())\r\ncakes = n*m\r\nl = 0\r\na = []\r\nfor i in range(n):\r\n k = input()\r\n if 'S' in k:\r\n cakes -= m\r\n a += list(filter(lambda x: k[x] == 'S', range(len(k))))\r\n else:\r\n l += 1\r\nprint(cakes + (n-l)*(m-len(set(a))))\r\n", "n, m = map(int, input().split())\r\ncake = list()\r\nfor j in range(n):\r\n cake.append(input())\r\nans = list()\r\nfor j in range(n):\r\n if \"S\" not in cake[j]:\r\n for i in range(m):\r\n ans.extend([[j, i]])\r\nfor i in range(m):\r\n if any(cake[j][i] == \"S\" for j in range(n)) != True:\r\n for j in range(n):\r\n if [j, i] not in ans:\r\n ans.extend([[j, i]])\r\nprint(len(ans))\r\n", "r, c = map(int, input().split())\r\ncake = [input() for _ in range(r)]\r\n\r\nrow_has_evil = [False] * r\r\ncol_has_evil = [False] * c\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if cake[i][j] == 'S':\r\n row_has_evil[i] = True\r\n col_has_evil[j] = True\r\n\r\nrow_cakes = sum([not row_has_evil[i] for i in range(r)])\r\ncol_cakes = sum([not col_has_evil[j] for j in range(c)])\r\n\r\nmax_cakes = row_cakes * c + col_cakes * r - row_cakes * col_cakes\r\n\r\nprint(max_cakes)\r\n", "row,column=input().split()\r\nrow,column=int(row),int(column)\r\nmatrix=[]\r\nforb_r=[]\r\nforb_c=[]\r\nfor i in range(row):\r\n matrix.append(str(input()))\r\n for j in range(column):\r\n if matrix[i][j]=='S':\r\n forb_c.append(j)\r\n forb_r.append(i)\r\ncount=0\r\nfor i in range(row):\r\n for j in range(column):\r\n if i in forb_r and j in forb_c:\r\n count=count+1\r\nprint(row*column-count)", "r, c = map(int, input().split())\r\ncake=[]\r\nfor i in range(r):\r\n cake.append(input())\r\nmas=[[False]*c for i in range(r)] # создаем массив с помощью генератора списков\r\n\r\nfor i in range(r):\r\n if 'S' not in cake[i]: # если в строке нет S то\r\n for j in range(c): # проставляем в яцейки строки True\r\n mas[i][j]=True # записываем в массив\r\nfor j in range(c): # обходим значения столбцов\r\n is_find=False # создаем логическую переменную, делаем заключение что нет в столбце 'S'\r\n for i in range(r): # обходим строки\r\n if cake[i][j]=='S':\r\n is_find=True\r\n break\r\n if not is_find: # если в столбце нет 'S' т.е если is_find не True\r\n for i in range(r):\r\n mas[i][j]=True # то в этом столбце пишем True\r\ncount=0 # создаем счетчик\r\nfor row in mas: # обходим построчно массив и\r\n count+=row.count(True) # записываем сколько в строке row встречается True\r\nprint(count)", "r, c = map(int, input().split())\r\nrow = set()\r\ncol = set()\r\nfor i in range(r):\r\n s = input()\r\n for j in range(len(s)):\r\n if s[j] == 'S':\r\n row.add(i)\r\n col.add(j)\r\nprint(r*c - len(row)*len(col))", "(r, c) = map(int, input().split())\r\nmatrix = []\r\n\r\nfor i in range(r):\r\n matrix.append(list(input()))\r\n\r\nstrawberries = []\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if matrix[i][j] == \"S\":\r\n strawberries.append([i, j])\r\n\r\nresult = 0\r\nrows_without = 0\r\n\r\nfor i in range(r):\r\n strawberry_on_row = False\r\n for j in range(len(strawberries)):\r\n if strawberries[j][0] == i:\r\n strawberry_on_row = True\r\n break\r\n\r\n if not strawberry_on_row:\r\n rows_without += 1\r\n result += c\r\n\r\nfor i in range(c):\r\n strawberry_on_col = False\r\n for j in range(len(strawberries)):\r\n if strawberries[j][1] == i:\r\n strawberry_on_col = True\r\n break\r\n\r\n if not strawberry_on_col:\r\n result += r-rows_without\r\n\r\nprint(result)", "r, c = map(int, input().split())\r\ncake = []\r\ncc = [True for i in range(c)]\r\ncr = [True for i in range(r)]\r\nt = 0\r\nfor i in range(r):\r\n cake.append(input())\r\nfor row in range(r):\r\n for col in range(c):\r\n if cake[row][col] == 'S': \r\n cc[col] = False\r\n cr[row] = False\r\n \r\nfor i in range(r):\r\n for j in range(c):\r\n if cc[j] or cr[i]:\r\n t += 1\r\nprint(t)\r\n", "r, c = map(int, input().split())\r\nrow_with_strawberry = [False] * r\r\ncol_with_strawberry = [False] * c\r\nfor i in range(r):\r\n cake_row = input()\r\n for j in range(c):\r\n if cake_row[j] == 'S':\r\n row_with_strawberry[i] = True\r\n col_with_strawberry[j] = True\r\n\r\nrows_without_strawberry = 0\r\nfor i in range(r):\r\n if not row_with_strawberry[i]:\r\n rows_without_strawberry += 1\r\n\r\ncols_without_strawberry = 0\r\nfor j in range(c):\r\n if not col_with_strawberry[j]:\r\n cols_without_strawberry += 1\r\n\r\nmax_cake = rows_without_strawberry * c + \\\r\n cols_without_strawberry * (r - rows_without_strawberry)\r\nprint(max_cake)\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nc=0\r\nfor _ in range(n):\r\n s=input()\r\n if 'S' not in s:\r\n c+=len(s)\r\n else:\r\n l.append(list(s))\r\n# print(l)\r\n# print(c)\r\nfor i in range(m):\r\n t=[]\r\n for j in range(len(l)):\r\n t.append(l[j][i])\r\n if 'S' not in t:\r\n c+=len(t)\r\nprint(c)", "n,m = map(int,input().split())\r\nlst = []\r\nfor i in range(n):\r\n lst.append(list(input().strip()))\r\nrow = [0]*n\r\ncol = [0]*m\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst[i][j] == \"S\":\r\n row[i] = 1\r\n col[j] = 1\r\nro = row.count(0)\r\nco = col.count(0)\r\ns = 0\r\ns = (co * n) - (ro * co)\r\ns += (ro * m)\r\nprint(s)", "import math\r\nfrom sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, m = multi_input()\r\n a = []\r\n for _ in range(n):\r\n s = str_input()\r\n a.append(s)\r\n rows = set()\r\n cols = set()\r\n for i in range(n):\r\n for j in range(m):\r\n if (a[i][j] == 'S'):\r\n rows.add(i)\r\n cols.add(j)\r\n ans = (n - len(rows)) * m + (m - len(cols)) * len(rows)\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "r,c = map(int,input().split())\r\ncake = []\r\npoints = set()\r\nfor i in range(r) :\r\n row = input()\r\n cake.append(row)\r\n\r\n'''for i in range(r) :\r\n key = 0\r\n for j in range(c) :\r\n if(cake[i][j] == 'S') :\r\n key = 1\r\n break\r\n if(key == 0) :\r\n for j in range(c) :\r\n points.add((i,j))\r\n\r\nfor i in range(c) :\r\n key = 0\r\n for j in range(r) :\r\n if(cake[j][i] == 'S') :\r\n key = 1\r\n break\r\n if(key == 0) :\r\n for j in range(r) :\r\n points.add((j,i))\r\n\r\nprint(len(points))'''\r\n\r\nhori = [0]*c\r\nvert = [0]*r \r\ncount = 0\r\n\r\nfor i in range(r) :\r\n for j in range(c) :\r\n if(cake[i][j] == 'S') :\r\n vert[i] = 1\r\n hori[j] = 1\r\n\r\nfor i in range(r) :\r\n for j in range(c) :\r\n if(cake[i][j] != 'S') :\r\n if(hori[j] == 0 or vert[i] == 0) :\r\n count += 1\r\n\r\nprint(count)\r\n\r\n\r\n", "r, c = [int(i) for i in input().split()]\n\nstrings = []\nfor _ in range(r):\n strings.append(input())\n\nrows = [-1 for _ in range(r)]\ncols = [-1 for _ in range(c)]\n\nfor i in range(r):\n for j in range(c):\n if strings[i][j] == 'S':\n rows[i] = cols[j] = 1\n\ncount = 0\nfor i in range(r):\n for j in range(c):\n if rows[i] != 1 or cols[j] != 1:\n count += 1\n\nprint(count)\n\n", "height , width = [int(x) for x in input().split(\" \")]\r\ninfectedRowsSet = set()\r\ninfectedColumnsSet = set()\r\n\r\nfor i in range(height):\r\n row = input()\r\n for j in range(len(row)):\r\n if row[j] == \"S\":\r\n infectedRowsSet.add(i)\r\n infectedColumnsSet.add(j)\r\n\r\nprint(height*width - len(infectedColumnsSet) * len(infectedRowsSet))", "\r\ndef solve(n, m):\r\n\r\n t = []\r\n r = []\r\n final = []\r\n count = 0\r\n steps = 0\r\n\r\n for i in range(n):\r\n t.append(list(input()))\r\n\r\n for i in range(m):\r\n for j in range(n):\r\n r.append(t[j][i])\r\n\r\n for i in range(0, len(r), n):\r\n final.append(r[i: i +n])\r\n\r\n for i in final:\r\n if all(x == '.' for x in i):\r\n count += 1\r\n steps += n\r\n\r\n for i in t:\r\n if all(x == '.' for x in i):\r\n steps += m - count\r\n\r\n return steps\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))", "r,c=map(int,input().split())\r\nrow,col=[0 for i in range(r)],[0 for i in range(c)]\r\nfor i in range(r):\r\n s=input()\r\n for j in range(c):\r\n if s[j]=='S':\r\n row[i]=1\r\n col[j]=1\r\ncount=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i]==0 or col[j]==0:\r\n count+=1\r\nprint(count) ", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nr,c = get_ints()\r\nrow = [0]*r\r\ncolumn = [0]*c\r\nfor i in range(r):\r\n s = get_string()\r\n for j in range(len(s)):\r\n if s[j] == 'S':\r\n row[i] = 1\r\n column[j] = 1\r\nrc = sum(row)\r\ncc = sum(column)\r\noup = (r-rc)*c+(c-cc)*(rc)\r\nprint(oup)", "r, c = [int(i) for i in input().split()]\r\na = []\r\nb = []\r\n\r\nfor i in range(r):\r\n s = input()\r\n for j in range(c):\r\n if s[j] == 'S':\r\n a.append(i+1)\r\n b.append(j+1)\r\n\r\n\r\na = len(list(set(a)))\r\nb = len(list(set(b)))\r\nprint((r-a)*c + (c-b)*r - (r-a)*(c-b))\r\n", "r,c=map(int, input().split())\r\na=[]\r\nk=0\r\nfor _ in range(r):\r\n x=str(input())\r\n a.append(x)\r\nfor _ in range(len(a)):\r\n if \"S\" not in a[_]:\r\n a[_]=[\":\"]*c\r\n k+=c\r\nb = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]\r\nfor _ in range(len(b)):\r\n if \"S\" not in b[_]:\r\n k+=b[_].count(\".\")\r\nprint(k)", " \r\nn, m = map(int, input().split(\" \"))\r\nL = [input() for x in range(n)]\r\n \r\nx = set([])\r\ny = set([])\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if (L[i][j] == 'S') :\r\n x.add(i)\r\n y.add(j)\r\n \r\nans = n * (m - len(y)) + m * (n - len(x)) - (m - len(y)) * (n - len(x))\r\nprint(ans)", "rc=input().split()\r\nr=int(rc[0])\r\nc=int(rc[1])\r\nl=[]\r\nx=0\r\ny=0\r\nfor i in range(r):\r\n l.append(input())\r\nfor i in range(r):\r\n for j in range(c):\r\n if l[i][j]==\"S\":\r\n x=x+1\r\n break\r\nfor i in range(c):\r\n for j in range(r):\r\n if l[j][i]==\"S\":\r\n y=y+1\r\n break\r\nprint((r*c) - (x*y))\r\n\r\n", "r,c = map(int,input().split())\r\nL1,L2 = [0]*r,[0]*c\r\nfor i in range(r):\r\n s = input()\r\n for j in range(c):\r\n if s[j] == 'S':\r\n L1[i]+=1;L2[j]+=1\r\nprint(L1.count(0)*c+L2.count(0)*(r-L1.count(0)))", "from collections import defaultdict\r\nfrom operator import inv\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inps():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nr, c = invr()\r\ncake = []\r\n\r\nfor i in range(r):\r\n row = insr()\r\n cake.append(row)\r\n\r\nans = 0\r\ngoodRows = 0\r\nfor i in range(r):\r\n hasS = False\r\n for j in range(c):\r\n if cake[i][j] == \"S\":\r\n hasS = True\r\n break\r\n if not hasS:\r\n goodRows += 1\r\n ans += c\r\n \r\nfor j in range(c):\r\n hasS = False\r\n for i in range(r):\r\n if cake[i][j] == \"S\":\r\n hasS = True\r\n break\r\n if not hasS:\r\n ans += r - goodRows\r\n\r\nprint(ans)", "r, c = map(int, input().split())\r\na = []\r\no = 0\r\n\r\nfor i in range(r):\r\n b = (input())\r\n a.append(b)\r\n if not 'S' in b:\r\n o += len(a.pop())\r\n else:\r\n continue\r\n\r\nfor i in range(c):\r\n d = 0\r\n for j in range(len(a)):\r\n if a[j][i] == 'S':\r\n d = 0\r\n break\r\n else:\r\n d += 1\r\n o += d\r\nprint(o)\r\n", "r, c = map(int, input().split())\r\ncakes = list()\r\n\r\nfor _ in range(r):\r\n row = input()\r\n cakes.append(list(row))\r\n\r\ncount = 0\r\n\r\nfor i in range(r):\r\n if 'S' not in cakes[i]:\r\n count += cakes[i].count('.')\r\n for x in range(c):\r\n cakes[i][x] = '#'\r\n\r\nfor j in range(c):\r\n columns = [cakes[i][j] for i in range(r)]\r\n if 'S' not in columns:\r\n count += columns.count('.')\r\nprint(count)\r\n", "n1 = input().split()\r\nlist1 = []\r\nfor i in n1:\r\n list1.append(int(i))\r\nlist2 = []\r\nfor i in range(list1[0]):\r\n \r\n list2.append(input())\r\n\r\n\r\n\r\nrows_clear = []\r\ncolums_not_clear = []\r\nfor i in list2:\r\n if \"S\" not in i:\r\n rows_clear.append(1)\r\n if \"S\" in i:\r\n index_s = [j for j, x in enumerate(i) if x == \"S\"]\r\n for k in index_s:\r\n if k not in colums_not_clear:\r\n colums_not_clear.append(k)\r\n \r\n\r\ncolums_clear = []\r\ntotal = len(rows_clear) * list1[-1]\r\nfor i in range(list1[-1]):\r\n if i not in colums_not_clear:\r\n colums_clear.append(i)\r\n \r\nif len(colums_clear) == 0:\r\n total += 0\r\n print(total)\r\nelse:\r\n for i in colums_clear:\r\n total += list1[0] - len(rows_clear)\r\n print(total)\r\n", "\r\nn, m = map(int, input().split())\r\narr =[]\r\nfor i in range(n):\r\n r = list(map(str, input().strip(\" \")))\r\n arr.append(r)\r\n\r\nrs, cs = [], []\r\nfor i in range(len(arr)):\r\n for j in range(len(arr[0])):\r\n if arr[i][j] == \"S\":\r\n rs.append(i)\r\n cs.append(j)\r\nres = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if j in cs and i in rs:\r\n pass\r\n else: res += 1\r\nprint(res)", "import sys\r\nfrom math import sqrt, gcd, ceil, log, floor\r\n# from bisect import bisect, bisect_left\r\nfrom collections import defaultdict, Counter, deque\r\nfrom heapq import heapify, heappush, heappop\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n# sys.setrecursionlimit(200000)\r\n\r\ndef main():\r\n\t# ans_ = []\r\n\tn, m = read(); arr = []\r\n\trow = set(); col = set()\r\n\tfor i in range(n):\r\n\t\ts = input().strip()\r\n\t\tfor j in range(m):\r\n\t\t\tif s[j] == \"S\":\r\n\t\t\t\trow.add(i)\r\n\t\t\t\tcol.add(j)\r\n\t\t# arr.append(list(input().strip()))\r\n\t# print(row, col)\r\n\tans = (n - len(row))*m + (m - len(col))*n - (n - len(row))*(m - len(col))\r\n\tprint(ans)\r\n\r\n\t# \tans_.append(str(ans))\r\n\t# print((\"\\n\").join(ans_))\r\nif __name__ == \"__main__\":\r\n\tmain()", "r, c = map(int, input().split())\r\nl = []\r\ns = 0\r\nfor i in range(r):\r\n l.append(input())\r\nfor i in range(len(l)):\r\n if l[i].count('S') == 0:\r\n s += l[i].count('.')\r\n l[i] = ['*' for i in l[i]]\r\nfor i in range(c):\r\n x = 0\r\n for j in range(r):\r\n if l[j][i] == 'S':\r\n x = 0\r\n break\r\n if l[j][i] == '.':\r\n x += 1\r\n s += x\r\nprint(s)", "a,b = map(int,input().split())\r\nz,w,q =[],0,0\r\nfor i in range(a):\r\n\tl = list(input())\r\n\tz.append(l)\r\n\tif l.count(\"S\")==0:w+=1\r\nfor i in range(len(z[0])):\r\n\te =\"\"\r\n\tfor j in range(len(z)):\r\n\t\te+=z[j][i]\r\n\tif e.count(\"S\")==0:q+=(a-w)\r\nprint(w*b + q)\r\n", "row,col=map(int,input().split())\r\n\r\narr=[0]*row\r\narrr=[0]*col\r\n\r\nfor i in range(row):\r\n line=input()\r\n \r\n for j in range(col):\r\n if line[j]==\"S\":\r\n arr[i]=1\r\n arrr[j]=1\r\n \r\nres=0\r\n\r\nfor i in range(row):\r\n for j in range(col):\r\n if arr[i]==0 or arrr[j]==0:\r\n res+=1\r\nprint(res)\r\n ", "x,y=map(int,input().split())\r\n\r\ngrid = []\r\n\r\nfor i in range(x):\r\n line = list(input())\r\n grid.append(line)\r\n\r\nC = 0\r\n\r\nfor i in range(x):\r\n if 'S' not in grid[i]:\r\n C += y\r\n grid[i] = [1]*y\r\nfor i in range(y):\r\n temp = x\r\n for j in range(x):\r\n if grid[j][i] == 'S':\r\n break\r\n elif grid[j][i] == 1:\r\n temp -= 1 \r\n else:\r\n C += temp\r\n\r\nprint(C)\r\n\r\n \r\n \r\n", "n,m=map(int,input().split())\nrow=set()\ncol=set()\nfor i in range(n):\n a=input()\n for j in range(m):\n if a[j]=='S':\n row.add(i)\n col.add(j)\nprint(n*m-len(row)*len(col))", "n,m=map(int,input().split())\r\nw=[]\r\nsum=0\r\nfor i in range(n):\r\n s=list(input())\r\n w.append(s)\r\nfor i in range(n):\r\n if 'S' not in w[i]:\r\n for l in range(m):\r\n if w[i][l]=='.':\r\n w[i][l]='+'\r\nvv=[]\r\nfor i in range(m):\r\n v=[]\r\n for l in range(n):\r\n v.append(w[l][i])\r\n vv.append(v)\r\nfor i in range(m):\r\n if 'S' not in vv[i]:\r\n for l in range(n):\r\n if vv[i][l]=='.':\r\n vv[i][l]='+'\r\nfor i in range(len(vv)):\r\n sum=sum+(vv[i].count('+'))\r\nprint(sum)\r\n\r\n", "R,C=map(int,input().split(' '))\r\ns=[]\r\nfor i in range(R):\r\n x=list(input())\r\n s+=[x]\r\n\r\nv=0\r\nr=[]\r\nc=[]\r\nfor i in range(R):\r\n for j in range(C):\r\n if s[i][j]=='S':\r\n v+=1\r\n r+=[i]\r\n c+=[j]\r\n\r\nfor i in range(R):\r\n for j in range(C):\r\n if s[i][j]=='.':\r\n if i in r and j in c:\r\n v+=1\r\n\r\nprint(R*C-v)\r\n \r\n", "a, b = map(int, input().split())\r\nc = []\r\ncount = n = 0\r\nfor i in range(a):\r\n c.append(input())\r\nfor i in range(a):\r\n for j in range(b):\r\n if c[i][j] == 'S':\r\n break\r\n else:\r\n count += b\r\n c[i] = ' ' * b\r\nfor i in range(b):\r\n countt = 0\r\n for j in range(a):\r\n if c[j][i] == 'S':\r\n countt = 0\r\n break\r\n elif c[j][i] != ' ':\r\n countt += 1\r\n else:\r\n count += countt\r\nprint(count)", "r,c=map(int,input().split())\r\narr=[list(input()) for _ in [0]*r];t=0\r\nfor i in range(r):\r\n for j in range(c):\r\n t+=((not arr[i].count('S')) or (not [k for k in range(r) if arr[k][j]=='S']))\r\nprint(t)", "a, b = map(int, input().split())\r\nl = []\r\nfor i in range(a):\r\n l.append(input())\r\n\r\nfor i in range(a):\r\n c = 0\r\n for j in range(b):\r\n if l[i][j] != 'S':\r\n c += 1\r\n if b - c == 0:\r\n for n in range(len(l[i])):\r\n l[i] = '*' * b\r\n\r\nfor j in range(b):\r\n c = 0\r\n for i in range(a):\r\n if l[i][j] != 'S':\r\n c += 1\r\n if a - c == 0:\r\n for w in range(a):\r\n s = list(l[w])\r\n s[j] = '*'\r\n l[w] = ''.join(s)\r\n\r\nc = 0\r\nfor i in range(a):\r\n c += l[i].count('*')\r\nprint(c)", "a,b=map(int,input().split())\r\nl=[]\r\nnr=0\r\nnc=0\r\nfor i in range(0,a):\r\n s=list(input())\r\n if \"S\" not in s:\r\n nr=nr+1\r\n l.append(s)\r\nr=[]\r\nq=\"\"\r\nfor i in range(0,b):\r\n for j in l:\r\n q=q+j[i]\r\n r.append(q)\r\n if \"S\" not in q:\r\n nc=nc+1\r\n q=\"\"\r\nprint(nr*b+(nc)*(a-nr))", "r,c = map(int, input().split())\r\nl = []\r\n\r\nfor i in range(r):\r\n temp = input()\r\n l.append(temp)\r\n\r\nrr = set()\r\ncc = set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if l[i][j] == 'S':\r\n rr.add(i)\r\n cc.add(j)\r\nres = r*c - (len(rr)*len(cc))\r\n\r\nprint(res)\r\n# print(rr)\r\n# print(cc)", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nb = [[0 for j in range(m)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n b[i][j] = a[i][j]\r\n\r\nraw = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j] == 'S':\r\n raw.append(j)\r\nfor i in range(n):\r\n for j in range(m):\r\n if j in raw and b[i][j] != 'S':\r\n b[i][j] = 'x'\r\nfor i in range(n):\r\n if 'S' not in b[i]:\r\n for j in range(m):\r\n b[i][j] = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j] == '.':\r\n b[i][j] = 0\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j] == 0:\r\n cnt += 1\r\nprint(cnt)\r\n", "from pickle import FALSE, TRUE\r\n\r\n\r\na = input().split(\" \")\r\nl = []\r\ncake = 0\r\nfor i in range(int(a[0])):\r\n l.append(input())\r\nfor i in range(int(a[0])):\r\n for j in range(int(a[1])):\r\n c = 0\r\n o = 0\r\n if(not'S' in l[i]):\r\n c = 1\r\n for k in range(int(a[0])):\r\n if(l[k][j] == 'S'):\r\n o = 1\r\n break\r\n if(o == 0):\r\n c = 1\r\n if(c == 1):\r\n cake += 1\r\nprint(cake)\r\n", "grid = []\r\nr, c = map(int, input().split())\r\ncake = [input()]\r\nfor row in range(r - 1):\r\n cake += [input()]\r\n\r\nanswer = 0\r\nfor row in range(r):\r\n grid.append([])\r\n for column in range(c):\r\n if cake[row][column] == \"S\":\r\n grid[row].append(2)\r\n \r\n else:\r\n grid[row].append(0)\r\n\r\nfor row in range(r):\r\n if 2 in grid[row]:\r\n pass\r\n else:\r\n for column in range(c):\r\n grid[row][column] = 1\r\n answer += c\r\n\r\n\r\nfor column in range(c):\r\n summ = 0\r\n for row in range(r):\r\n if grid[row][column] == 2:\r\n summ = r\r\n break\r\n summ += grid[row][column]\r\n if (r - summ) > 0:\r\n answer += (r - summ)\r\n\r\nprint(answer)", "r,c=map(int,input().split())\r\nro,co={},{}\r\nfor i in range(r):\r\n s=input()\r\n for j in range(c):\r\n if s[j]==\"S\":\r\n if i not in ro.keys():\r\n ro[i]=1\r\n if j not in co.keys():\r\n co[j]=1\r\ns=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if i not in ro.keys() or j not in co.keys():\r\n s+=1\r\nprint(s)", "r,c = [int(num) for num in input().split(' ')]\nmap = []\nfor i in range(r):\n row =[ch for ch in input()]\n map.append(row)\nans = 0\nfor i in range(r):\n if 'S' not in map[i]:\n for j in range(c):\n if map[i][j] == '.':\n map[i][j] = '*'\n ans += 1\n\nfor i in range(c):\n cnt = 0\n isFind = False\n for j in range(r):\n if map[j][i] == 'S':\n isFind = True\n break\n if map[j][i] == '.':\n cnt+=1\n if isFind == False:\n ans += cnt\nprint(ans) \n ", "r, c = map(int, input().split())\r\narr = []\r\nrows = 0\r\ncols = 0\r\nfor i in range(r):\r\n rowTemp = input()\r\n if(rowTemp.count('S') >= 1):\r\n arr.append(rowTemp)\r\n else:\r\n rows += 1\r\nfor j in range(c):\r\n col = True\r\n for l in range(len(arr)):\r\n ch = arr[l][j]\r\n if(ch == 'S'):\r\n col = False\r\n break\r\n if(col):\r\n cols += 1\r\nans = (rows * c) + (cols * len(arr))\r\nprint(ans)", "a, b = map(int, input().split())\r\nf = []\r\nc = 0\r\ng = []\r\nfor i in range(0, a):\r\n e = input(\"\")\r\n if \"S\" not in e:\r\n c += b\r\n else:\r\n f.append(e)\r\nif len(f) >= 1:\r\n for i in range(0, len(f[0])):\r\n r = \"\"\r\n for j in range(0, len(f)):\r\n r += f[j][i]\r\n g.append(r)\r\n if \"S\" not in g[i]:\r\n c += len(g[i])\r\nprint(c)\r\n", "row, col = map(int, input().split())\narr1 = [0] * row\narr2 = [0] * col\n\nfor i in range(row):\n line = input()\n for z in range(col):\n if line[z] == 'S':\n arr1[i] = 1\n arr2[z] = 1\n\nres = 0\nfor i in range(row):\n for z in range(col):\n if arr1[i] == 0 or arr2[z] == 0:\n res += 1\nprint(res)\n \t\t\t \t\t \t \t\t \t\t\t \t \t \t\t\t\t\t\t\t", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\n\r\nr, c = 0, 0\r\nfor i in range(n):\r\n flag = False\r\n for j in range(m):\r\n if a[i][j] == 'S':\r\n flag = True\r\n if flag == False:\r\n r += 1\r\n\r\n\r\nfor j in range(m):\r\n flag = False\r\n for i in range(n):\r\n if a[i][j] == 'S':\r\n flag = True\r\n if flag == False:\r\n c += 1\r\n\r\nprint(m * r + n * c - r * c)\r\n", "n, m = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n\ta.append(list(input()))\r\ns = 0\r\ns1 = 0\r\nfor i in range(n):\r\n\tcount = 0\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == \".\":\r\n\t\t\tcount += 1\r\n\tif count == m:\r\n\t\ts += m\r\n\t\ts1 += 1\r\nfor i in range(m):\r\n\tcount = 0\r\n\tfor j in range(n):\r\n\t\tif a[j][i] == \".\":\r\n\t\t\tcount += 1\r\n\tif count == n:\r\n\t\ts += (n - s1)\r\nprint(s)\t\t", "r, c = map(int, input().split())\r\ngrid = []\r\nfor __ in range(r):\r\n grid.append(list(input()))\r\nsr, sc = set(), set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j] == 'S':\r\n sr.add(i)\r\n sc.add(j)\r\nans = 0\r\nfor i in range(r):\r\n if i not in sr:\r\n for j in range(c):\r\n if grid[i][j] == '.':\r\n ans += 1\r\n grid[i][j] = 'E'\r\n\r\nfor j in range(c):\r\n if j not in sc:\r\n for i in range(r):\r\n if grid[i][j] == '.':\r\n ans += 1\r\n grid[i][j] = 'E'\r\nprint(ans)", "r,c=map(int,input().split())\r\nA,B=[],[]\r\nfor i in range(r):\r\n R=list(input())\r\n while('S'in R):\r\n I=R.index('S')\r\n B+=[I]\r\n A+=[i]\r\n R[I]='.'\r\n \r\nprint((r*c)-len(set(A))*len(set(B))) \r\n \r\n ", "r, c = list(map(int, input().split()))\r\ngood_c= [True] * c\r\ngood_r = [True] * r\r\ncount = 0\r\nfor i in range(r):\r\n row = input()\r\n for j, x in enumerate(row):\r\n if x== 'S':\r\n good_r[i] = False\r\n good_c[j] = False\r\nr_count = len(list(filter(None, good_r)))\r\nc_count = len(list(filter(None, good_c)))\r\ncount += c * r_count\r\ncount += r * c_count\r\ncount -= r_count * c_count\r\nprint(count)\r\n", "num = input().split(' ')\r\nr = int(num[0])\r\nc = int(num[1])\r\nl=[]\r\nfor i in range(0,r):\r\n t=[]\r\n str=input()\r\n for x in str:\r\n t.append(x)\r\n # t = [int(i) for i in t]\r\n l.append(t)\r\nf=[]\r\nfor i in range(0,r):\r\n t=[]\r\n for j in range(0,c):\r\n if l[i][j]=='.':\r\n t.append('t')\r\n else :\r\n t.append('f')\r\n f.append(t)\r\nn=0\r\nfor i in range(r):\r\n if 'S' not in l[i]:\r\n for q in range(len(f[i])):\r\n if f[i][q] == 't':\r\n n+=1\r\n f[i][q]='f'\r\n\r\nfor i in range(c):\r\n t=[]\r\n for j in range(r):\r\n t.append(l[j][i])\r\n if 'S' not in t:\r\n for k in range(r):\r\n if f[k][i] =='t':\r\n n+=1\r\n f[k][i]=='f'\r\nprint(n)", "r,c=map(int,input().split())\nrow=[]\ncol=[]\narr=[]\nfor i in range(r):\n line=input()\n arr.append(line)\n if \"S\" not in line:\n row.append(i)\nfor j in range(c):\n count=0\n for i in range(r):\n if arr[i][j]!=\"S\":\n count=count+1\n if count==r:\n col.append(j)\nans=(len(row)*c + len(col)*r - len(row)*len(col))\nprint(ans)\n", "def main():\r\n r, c = map(int, input().split())\r\n row = set()\r\n col = set()\r\n for i in range(r):\r\n s = input()\r\n for j in range(len(s)):\r\n if s[j] == 'S':\r\n row.add(i)\r\n col.add(j)\r\n # print(row)\r\n # print(col)\r\n print(r*c - len(row)*len(col))\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "i=input().split()\r\nr,c=int(i[0]),int(i[1])\r\ncake=[]\r\nindex=[]\r\ntotal = 0\r\nfor i in range(r):\r\n row=input()\r\n row=[x for x in row]\r\n if 'S' not in row: \r\n index.append([0]*c)\r\n total += c\r\n else:\r\n index.append([1]*c)\r\n cake.append(row)\r\nfor i in range(c):\r\n for j in range(r):\r\n if cake[j][i] == 'S':\r\n break\r\n else:\r\n for j in range(r):\r\n if index[j][i]==1:\r\n total+=1\r\nprint(total)", "r,c=map(int,input().split());a=[input() for _ in[0]*r]\r\ns=lambda x:sum(i.count('S')>0 for i in x)\r\nprint(r*c-s(a)*s(zip(*a)))", "r, c = map(int, input().split())\r\nrow = [0] * 11\r\ncol = [0] * 11\r\nfor i in range(r):\r\n s = input()\r\n for j in range(c):\r\n if s[j] == 'S':\r\n row[i] = 1\r\n col[j] = 1\r\ncakes = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i] == 0 or col[j] == 0:\r\n cakes += 1\r\nprint(cakes)", "r,c = map(int, input().split())\r\n\r\narr,flag,ans = [],0,0\r\n\r\nfor _ in range(r):\r\n \r\n arr.append(list(input()))\r\n \r\nfor i in range(r):\r\n \r\n for j in range(c):\r\n \r\n if arr[i][j] == 'S':\r\n \r\n flag = 1\r\n \r\n break\r\n \r\n if flag == 0:\r\n \r\n for j in range(c):\r\n \r\n if arr[i][j] == '.':\r\n \r\n arr[i][j] = 'E'\r\n \r\n ans += 1\r\n \r\n flag = 0\r\n \r\nflag = 0\r\n \r\nfor i in range(c):\r\n \r\n for j in range(r):\r\n \r\n if arr[j][i] == 'S':\r\n \r\n flag = 1\r\n \r\n break\r\n \r\n if flag == 0:\r\n \r\n for j in range(r):\r\n \r\n if arr[j][i] == '.':\r\n \r\n ans += 1\r\n \r\n arr[j][i] = 'E'\r\n \r\n flag = 0\r\n \r\nprint(ans)", "x,y=list(map(int,input().split()))\r\nnums=[]\r\nr=[]\r\nc=[]\r\nfor i in range(x):\r\n s=list(input())\r\n nums.append(s)\r\n for j in range(y):\r\n if nums[i][j]==\"S\":\r\n r.append(i)\r\n c.append(j)\r\nl=[[0 for _ in range(y)]for x in range(x)]\r\nans=0\r\nfor i in range(x):\r\n for j in range(y):\r\n if (i not in r or j not in c) and l[i][j]==0:\r\n ans+=1\r\n l[i][j]=1\r\nprint(ans)\r\n ", "r, c = map(int, input().split())\r\nmatrix = []\r\nfor _ in range(r):\r\n matrix.append(input())\r\nrow, col = 0, 0\r\nfor i in range(r):\r\n if matrix[i].find('S') != -1:\r\n row += 1\r\nfor j in range(c):\r\n for i in range(r):\r\n if matrix[i][j] == 'S':\r\n col += 1\r\n break\r\nprint(r * c - row * col)", "ar = []\r\nfor i in input().split(' '):\r\n ar.append(int(i))\r\nmatrix = [[0 for col in range(ar[1])] for row in range(ar[0])]\r\ncount = 0\r\nrow_totals = []\r\nfor i in range(ar[0]):\r\n temp = input()\r\n ch = 0\r\n for j in range(len(temp)):\r\n if temp[j] == 'S':\r\n matrix[i][j] = 1\r\n ch = 1\r\n if ch == 0:\r\n row_totals.append(0)\r\n else:\r\n row_totals.append(1)\r\ncol_totals = [ sum(x) for x in zip(*matrix) ]\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix[i])):\r\n if row_totals[i] == 0 or col_totals[j] == 0:\r\n count = count + 1\r\nprint(count)\r\n", "r, c = map(int, input().split())\r\ncake = [input() for _ in range(r)]\r\nis_r = [0 for _ in range(r)] # Индикатор подпорченных строк, 0 - идеальная строка, 1 - подпорченная\r\nis_c = [0 for _ in range(c)] # Индикатор подпорченных столбцов, 0 - идеальный, 1 - подпорченный\r\nfor i in range(r):\r\n if \"S\" in cake[i]: # Если находим клубничку в строке:\r\n is_r[i] = 1 # В ячейку с номером этой строки записываем 1 (*)\r\n for j in range(c): # И пробегаем по всем элементам подпорченной строки\r\n if cake[i][j] == \"S\": # Когда в j-той ячейке подпорченной строки находим клубничку\r\n is_c[j] = 1 # то в ячейку с номером этого столбца записываем 1\r\nnjam_njam = r * c - sum(is_r) * sum(is_c) # Из всего количества ячеек вычитаем те, что находятся одновременно\r\n # и в подпорченных строках, и в подпорченных столбцах\r\nprint(njam_njam)", "def Cakeminator():\r\n rows,cols = map(int,input().split())\r\n max_eat = 0\r\n rows_eat = 0\r\n grid = []\r\n for i in range(rows):\r\n row = input()\r\n if \"S\" not in row:\r\n rows_eat += 1 \r\n max_eat += cols \r\n grid.append(row) \r\n\r\n for i in range(cols):\r\n found = False\r\n for j in range(rows):\r\n if grid[j][i] == \"S\":\r\n found = True\r\n break\r\n if not found:\r\n max_eat += rows - rows_eat\r\n \r\n return max_eat \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(Cakeminator())\r\n remained_test_cases -= 1 ", "r, c = (int(x) for x in input().split())\r\ni = 0\r\nfull_pieces = 0\r\ncolumn_with_strawberry = set()\r\nwhile i < r:\r\n\tpiece_of_cake = input()\r\n\tif 'S' not in piece_of_cake:\r\n\t\tfull_pieces += 1\r\n\telse:\r\n\t\tj = 0\r\n\t\twhile j < c:\r\n\t\t\tif piece_of_cake[j] == 'S':\r\n\t\t\t\tcolumn_with_strawberry.add(j)\r\n\t\t\tj += 1\r\n\ti += 1\r\nmax_cakes = full_pieces*c + (c - len(column_with_strawberry))*(r - full_pieces)\r\nprint(int(max_cakes))", "r,c = map(int,input().split())\r\ns = []\r\nd = [[],[]]\r\n\r\n\r\nfor i in range(r):\r\n\ts.append(input())\r\n\r\nfor i in s:\r\n\tif i.count(\".\")==c:\r\n\t\td[0].append(c)\r\n\r\n\r\nfor i in range(c):\r\n\th = 0\r\n\tfor j in range(r):\r\n\t\tif s[j][i]==\".\":\r\n\t\t\th+=1\r\n\tif h==r:\r\n\t\td[1].append(r)\r\n\r\n\r\na = sum(d[0])+sum(d[1])\r\nb = len(d[0])*len(d[1])\r\n\r\nprint(a-b)\r\n\r\n", "r, c = [int(x) for x in input().split()]\r\nmatrix = []\r\ni = 0\r\nj = 0\r\ncakes = 0\r\ncommon = 0\r\n\r\nfor k in range(r):\r\n row = [x for x in input()]\r\n matrix.append(row)\r\n\r\nwhile i < r:\r\n if \"S\" not in matrix[i]:\r\n common += 1\r\n cakes += c\r\n i += 1\r\n\r\ninvMatrix = []\r\n\r\nfor l in range(c):\r\n invMatrix.append([])\r\n for row in matrix:\r\n invMatrix[l].append(row[l])\r\n\r\nwhile j < c:\r\n if \"S\" not in invMatrix[j]:\r\n cakes += r\r\n cakes -= common\r\n j += 1\r\n\r\nprint(cakes)\r\n\r\n\r\n\r\n\r\n", "if __name__ == '__main__':\r\n s = input().split()\r\n r = int(s[0])\r\n c = int(s[1])\r\n rows = []\r\n cols = []\r\n for i in range(r):\r\n s = input()\r\n for j in range(c):\r\n if s[j] == 'S':\r\n rows.append(i)\r\n cols.append(j)\r\n q = len(set(rows))\r\n w = len(set(cols))\r\n print(r * c - w * q)\r\n\r\n", "r, c = map(int, input().split())\r\na = [input() for i in range(r)]\r\nrow_count = 0\r\ncolumn_count = 0\r\nfor i in a:\r\n if 'S' not in i:\r\n row_count += 1\r\n# print(row_count)\r\nb = []\r\nfor j in range(c):\r\n t = ''\r\n for i in range(r):\r\n t += a[i][j]\r\n b.append(t)\r\nfor i in b:\r\n if 'S' not in i:\r\n column_count += 1\r\n# print(column_count)\r\nprint(r * column_count + c * row_count - row_count * column_count)", "r, c = map(int, input().strip().split())\ng=[]\nfor i in range(0, r):\n\tg.append(list(input().strip()))\nres = 0\n\nfor i in g:\n\tif 'S' not in i:\n\t\tfor j in range(0, c):\n\t\t\tif i[j]=='.': \n\t\t\t\tres+=1\n\t\t\t\ti[j]=-1\ng_t=[[] for a in range(0, c)]\n\nfor i in range(0, c):\n\tfor j in range(0, r) : \n\t\tg_t[i].append(g[j][i])\nfor i in g_t:\n\tif 'S' not in i:\n\t\tfor j in range(0, r):\n\t\t\tif i[j]=='.':\n\t\t\t\tres+=1 \n\t\t\t\ti[j]=-1\nprint(res) ", "n,m=map(int,input().split())\r\ns=[];r1,r2=0,0\r\nfor i in range(n):\r\n s.append(list(input()))\r\nfor i in s:\r\n if 'S' in i: \r\n r1+=1\r\ns=list(zip(*s))\r\nfor i in s:\r\n if 'S' in i: \r\n r2+=1\r\nprint(n*m-r1*r2)", "r, c = map(int, input().split())\r\n\r\nstrawbery = []\r\n\r\nfor i in range(r):\r\n l = input()\r\n for j in range(c):\r\n if l[j] == 'S':\r\n strawbery.append((i, j))\r\n\r\nhor = len({x for x, y in strawbery})\r\nvert = len({x for y, x in strawbery})\r\neaten_hor = (r - hor) * c \r\neaten_ver = (c - vert) * hor\r\nprint(eaten_hor + eaten_ver)", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nk=[]\ncake=0\nr,c=map(int,input().split())\nfor _ in range(r):\n s=input('')\n if 'S' not in s:\n cake+=c\n else:\n k+=list(i for i in range(c) if s[i]!='S')\nk1=sum(list(1 for i in k if k.count(i)==r-(cake//c)))\n\nprint (cake + k1)", "def fun(n,m,li):\r\n eatrow=[]\r\n noteatcolumn=[]\r\n for i in range(n):\r\n fi=[]\r\n for j in range(m):\r\n if li[i][j]=='S':\r\n fi.append(j)\r\n if len(fi)>0:\r\n noteatcolumn.extend(fi)\r\n continue\r\n else:\r\n eatrow.extend([(i,j) for j in range(m)])\r\n eat=set(range(m))-set(noteatcolumn)\r\n for j in eat :\r\n eatrow.extend([(i,j) for i in range(n)])\r\n print(len(set(eatrow)))\r\n \r\n \r\nn,m=list(map(lambda x:int(x),input().split()))\r\nli=[input() for i in range(n)]\r\nfun(n,m,li)\r\n", "r, c = map(int, input().split())\r\nrow,col=set(),set()\r\nfor i in range(r):\r\n a=input()\r\n for j in range(c):\r\n if a[j] == 'S':\r\n row.add(i)\r\n col.add(j)\r\nn=r-len(row)\r\nm=c-len(col)\r\nprint(n*c+m*r-n*m)", "r, c = map(int, input().split())\r\n\r\nmas = [list(input()) for i in range(r)]\r\n\r\n# axis = 0\r\nfor i in range(r):\r\n if not 'S' in mas[i]:\r\n mas[i] = [1] * c\r\n\r\n# axis = 1\r\nfor p in range(c):\r\n find_S = False\r\n for i in range(r):\r\n if mas[i][p] == 'S':\r\n find_S = True\r\n break\r\n if not find_S:\r\n for i in range(r):\r\n mas[i][p] = 1\r\n\r\n# считаем кол-во единиц\r\nk = 0\r\nfor m in mas:\r\n k+=m.count(1)\r\n\r\nprint(k)\r\n", "n,m=list(map(int,input().split()))\r\nxl=[]\r\nl=[]\r\nfor _ in range(n):\r\n xl.append(list(input()))\r\n\r\nc=0\r\nl=xl.copy()\r\n\r\nfor x in xl:\r\n \r\n if 'S' not in x:\r\n c+=m\r\n l.remove(x)\r\n \r\n\r\nnl= list(map(list, zip(*l)))\r\n\r\n\r\nfor x in nl:\r\n if 'S' not in x:\r\n c+=len(x)\r\n\r\n\r\nprint(c)", "R,C = map(int,input().split())\r\nLst = [None]*R\r\n\r\nfor i in range(R):\r\n Lst[i] = list(input())\r\n\r\nCount = 0\r\n#print(Lst)\r\n#print(Lst[0])\r\nfor i in range(R):\r\n if('S' in Lst[i]):\r\n continue\r\n else:\r\n for j in range(C):\r\n Lst[i][j] = '+'\r\n Count = Count + 1\r\n\r\n#print(Lst)\r\n\r\nfor i in range(C):\r\n Val = 0\r\n for j in range(R):\r\n #print(\"Yes\", Lst[j][i])\r\n if(Lst[j][i] == 'S'):\r\n Val = 0\r\n break\r\n elif(Lst[j][i] == '.'):\r\n Val += 1\r\n Count += Val\r\nprint(Count)\r\n", "n, m = map(int, input().split())\na = [list(input()) for i in range(n)]\nrows, columns = 0,0\nfor i in range(n):\n if 'S' not in a[i]:\n for j in range(m): a[i][j] = 'A'\nfor i in range(m):\n if 'S' not in ''.join([a[j][i] for j in range(n)]):\n for j in range(n): a[j][i] = 'A'\nprint(''.join([''.join(i[:]) for i in a]).count('A'))", "a, b = map(int, input().split())\r\nl = [list(input()) for i in range(a)]\r\nc = 0 \r\nfor i in range(a):\r\n if 'S' not in l[i][0:]:\r\n k = 0\r\n while k<b:\r\n if l[i][k] == '.':\r\n l[i][k] = ' '\r\n c += 1\r\n k += 1\r\n continue\r\n k+=1\r\n \r\nfor i in range(b):\r\n k = 0\r\n key = True\r\n while k<a:\r\n if 'S' in l[k][i]:\r\n key = False\r\n break\r\n k += 1\r\n k = 0\r\n if key:\r\n while k<a:\r\n if l[k][i] == '.':\r\n l[k][i] == ' '\r\n c+=1\r\n k+=1\r\n continue\r\n k+=1\r\nprint(c)", "a, b= input().split()\r\na=int(a)\r\nb=int(b)\r\narr=[]\r\n\r\nfor i in range (a):\r\n e=list(input())\r\n arr.append(e)\r\n\r\nn_row=0\r\nsample=0\r\n\r\nfor row in arr:\r\n if 'S' not in row:\r\n sample += b\r\n n_row += 1\r\n\r\nt_arr=[]\r\n\r\nfor col in range (b):\r\n w=[]\r\n for row in range(a):\r\n \r\n w.append(arr[row][col])\r\n t_arr.append(w)\r\n\r\nfor row in t_arr:\r\n if 'S' not in row:\r\n sample += a\r\n sample -= n_row\r\nprint(sample)\r\n", "m,n=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(m):\r\n s=input()\r\n for j in range(n):\r\n if s[j]==\"S\":\r\n a.append(i)\r\n b.append(j)\r\nprint(m*n-len(list(set(a)))*len(list(set(b))))", "r, c = map(int, input().split())\r\na = [input() for _ in [0]*r]\r\ndef s(x): return sum(i.count('S') > 0 for i in x)\r\n\r\n\r\nprint(r*c-s(a)*s(zip(*a)))", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nnum=L1[0]\r\nnum2=L1[1]\r\nctr=0\r\n\r\nmohit=0\r\nsuru=0\r\n\r\nL2=[]\r\n\r\nfor i in range (0,num):\r\n L1= [str(x) for x in input().split(\" \")]\r\n L2.append(L1[0])\r\n\r\n \r\n\r\nfor i in L2:\r\n if \"S\" not in i:\r\n ctr=ctr+num2\r\n mohit=mohit+1\r\n\r\n#print(L2[0][0])\r\n#print(L2)\r\n#print(ctr)\r\nfor i in range(0,num2):\r\n str1=\"\"\r\n for j in range(0,num):\r\n str1=str1+L2[j][i]\r\n if \"S\" not in str1:\r\n ctr=ctr+num\r\n suru=suru+1\r\n\r\nctr=ctr-(mohit*suru)\r\nprint(ctr) \r\n\r\n ", "a, b = map(int, input().split())\r\nlst = [c for i in range(a) for c in input().split()]\r\nmatrix = [[i for i in c] for c in lst]\r\nfor row in matrix:\r\n for i, elem in enumerate(row):\r\n if elem != 'S':\r\n if 'S' not in row:\r\n row[i] = 1\r\n else:\r\n row[i] = 0\r\ns = 0\r\nfor row in zip(*matrix):\r\n row = list(row)\r\n for i, elem in enumerate(row):\r\n if elem != 'S':\r\n if 'S' not in row:\r\n row[i] = 1 \r\n for elem in row:\r\n if elem == 1:\r\n s += 1\r\nprint(s)", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\ncount = 0\r\ns = 0\r\nfor i in range(n):\r\n c = 0\r\n for j in range(m):\r\n if a[i][j] == '.':\r\n c += 1\r\n if c == m:\r\n count += m\r\n s += 1\r\nfor j in range(m):\r\n c = 0\r\n for i in range(n):\r\n if a[i][j] == '.':\r\n c += 1\r\n if c == n:\r\n count += n - s\r\nprint(count)\r\n\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/330/A\r\n\r\ndef check(mx):\r\n e_line, e_column = 0, 0\r\n for line in mx:\r\n if \"S\" not in line:\r\n e_line += 1\r\n for i in range(len(mx[0])):\r\n fl = False\r\n for j in range(len(mx)):\r\n if mx[j][i] == 'S':\r\n fl = True\r\n break\r\n if not fl:\r\n e_column += 1\r\n return e_line * len(mx[0]) + e_column * len(mx) - e_line * e_column\r\n\r\n\r\nn, m = map(int, input().split())\r\nmx = []\r\nfor _ in range(n):\r\n mx.append(input())\r\nprint(check(mx))\r\n", "r, c = map(int, input().split())\nmat = []\nfor i in range(r):\n mat.append(input())\nrows = set()\ncols = set()\nfor i in range(r):\n for j in range(c):\n if mat[i][j]==\"S\":\n rows.add(i)\n cols.add(j)\nans = 0\nfor i in range(r):\n for j in range(c):\n if i not in rows or j not in cols:\n ans += 1\n\nprint(ans)\n", "r, c = list(map(int, input().split()))\r\nm = [input () for _ in range(r)]\r\nprint(sum(c for r in m if 'S' not in r)\r\n + sum((r - sum(1 for r in m if 'S' not in r))\r\n for c in zip(*m) if 'S' not in c))", "ROWS,COLS = map(int,input().split())\r\n\r\ngrid = []\r\n\r\nfor _ in range(ROWS):\r\n grid.append(list(input()))\r\n\r\nres = 0\r\n\r\nvisited = [[False for _ in range (COLS)] for _ in range(ROWS)]\r\n\r\nfor r in range(ROWS):\r\n count = 0\r\n for c in range(COLS):\r\n if grid[r][c]==\"S\":\r\n count=0\r\n break\r\n if not visited[r][c]:\r\n count+=1\r\n if count:\r\n for i in range(COLS):\r\n visited[r][i] = True\r\n res+=count\r\n\r\nfor c in range(COLS):\r\n count = 0\r\n for r in range(ROWS):\r\n if grid[r][c]==\"S\":\r\n count=0\r\n break\r\n if not visited[r][c]:\r\n count+=1\r\n if count:\r\n for i in range(ROWS):\r\n visited[i][c] = True\r\n res+=count\r\n\r\nprint(res)", "dim = [int(_) for _ in input().split()]\n\nl = []\nx = []\ny = []\n\nco = 0\n\nfor i in range(dim[0]):\n arr = [*input()]\n l.append(arr)\n\nfor j in range(dim[0]):\n for k in range(dim[1]):\n if l[j][k] == 'S':\n x.append(j + 1)\n y.append(k + 1)\n\nprint(dim[0]*dim[1] - len(set(x))*len(set(y)))\n\n", "r, c = map(int, input().split())\r\n\r\ncake = []\r\nfor i in range(r):\r\n row = input()\r\n cake.append(list(row))\r\n\r\nrow_count = 0\r\ncol_count = 0\r\n\r\nfor i in range(r):\r\n has_strawberry = False\r\n for j in range(c):\r\n if cake[i][j] == 'S':\r\n has_strawberry = True\r\n break\r\n if not has_strawberry:\r\n row_count += 1\r\n\r\nfor j in range(c):\r\n has_strawberry = False\r\n for i in range(r):\r\n if cake[i][j] == 'S':\r\n has_strawberry = True\r\n break\r\n if not has_strawberry:\r\n col_count += 1\r\n\r\nmax_cells = row_count * c + col_count * (r - row_count)\r\nprint(max_cells)", "a, b = map(int, input().split())\r\nc = [input() for _ in range(a)]\r\nx, y, c2 = 0, 0, []\r\n\r\nfor i in range(b):\r\n tmp = []\r\n for j in range(a):\r\n tmp.append(c[j][i])\r\n c2.append(tmp)\r\n\r\nfor _ in c:\r\n if 'S' not in _:\r\n x += 1\r\nfor _ in c2:\r\n if 'S' not in _:\r\n y += 1\r\n\r\nprint((x*b + y*(a-x)))", "r, c = map(int, input().split())\r\n\r\ndata = []\r\nfor i in range(r):\r\n data.append(input())\r\n\r\ncount = 0\r\n\r\n# horizontal check\r\nfor i in range(r):\r\n check = 1\r\n for j in range(c):\r\n if data[i][j] == \"S\":\r\n check = 0\r\n if check:\r\n for j in range(c):\r\n if data[i][j] == \".\":\r\n data[i] = data[i][:j] + \" \" + data[i][j + 1:]\r\n count += 1\r\n\r\n# vertical check\r\nfor i in range(c):\r\n check = 1\r\n for j in range(r):\r\n if data[j][i] == \"S\":\r\n check = 0\r\n if check:\r\n for j in range(r):\r\n if data[j][i] == \".\":\r\n data[j] = data[j][:i] + \" \" + data[j][i + 1:]\r\n count += 1\r\n\r\nprint(count)", "r, c = map(int, input().split())\r\ncake = [[1] * c for _ in range(r)]\r\nevil_r = set()\r\nevil_c = set()\r\nfor i in range(r):\r\n s = input()\r\n for j in range(c):\r\n if s[j] == \"S\":\r\n cake[i][j] = 0\r\n evil_r.add(i)\r\n evil_c.add(j)\r\nres = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if i not in evil_r or j not in evil_c:\r\n res += cake[i][j]\r\nprint(res)\r\n", "r, c = map(int, input().split())\nlst = [0]*r\nh = [0]*c\np = []\nfor i in range(r):\n s = str(input())\n if \"S\" in s:\n lst[i] = 1\n for j in range(c):\n if s[j] == \"S\":\n h[j] = 1\n p.append(s)\ncount = 0\nfor i in range(r):\n for j in range(c):\n if lst[i] == 0 or h[j] == 0:\n count += 1\nprint(count)\n\n", "r, c = map(int, input().split())\r\n\r\ntort = []\r\nanother_tort = [[] for _ in range(c)]\r\ncount = 0\r\nminus = 0\r\n\r\nfor i in range(r):\r\n _input = input()\r\n tort.append(_input)\r\n for j in range(c):\r\n another_tort[j].append(_input[j])\r\n\r\nfor i in range(r):\r\n if 'S' not in tort[i]:\r\n count += c\r\n minus += 1\r\nfor i in range(c):\r\n if 'S' not in another_tort[i]:\r\n count += r - minus\r\n\r\nprint(count)", "r,c=map(int,input().split())\r\nrow=set()\r\ncol=set()\r\narr=[]\r\nfor j in range(r):\r\n temp=list(input())\r\n z=[]\r\n for i,item in enumerate(temp):\r\n if item=='S':\r\n row.add(j)\r\n col.add(i)\r\n z.append(-1)\r\n else:\r\n z.append(0)\r\n arr.append(z)\r\nans=0\r\nfor i in range(r):\r\n if i not in row:\r\n for j in range(c):\r\n if arr[i][j]==0:\r\n arr[i][j]=1\r\n ans+=1\r\nfor j in range(c):\r\n if j not in col:\r\n for i in range(r):\r\n if arr[i][j]==0:\r\n arr[i][j]=1\r\n ans+=1\r\nprint(ans)\r\n\r\n \r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n \r\n'''\r\n \r\n'''\r\n\r\ndef sum_col(cake, num_rows, col):\r\n count = 0\r\n for row in range(num_rows):\r\n count += cake[row][col]\r\n return count\r\n\r\nr,c = map(int, input().split())\r\ncake = [[1] * c for _ in range(r)]\r\ngood_rows = [1] * r\r\ngood_cols = [1] * c\r\nfor row in range(r):\r\n for col, char in enumerate(input().rstrip()):\r\n if char == \"S\":\r\n good_rows[row] = 0\r\n good_cols[col] = 0\r\n cake[row][col] = 0\r\n\r\ncount = 0\r\nfor row in range(r):\r\n if good_rows[row]:\r\n count += sum(cake[row])\r\n cake[row] = [0] * c\r\n\r\nfor col in range(c):\r\n if good_cols[col]:\r\n count += sum_col(cake, r, col)\r\n\r\nprint(count)", "r , c = map(int,input().split())\r\nr_evil = set()\r\nc_evil = set()\r\n\r\nfor i in range(r):\r\n t = input()\r\n for x,y in enumerate(t):\r\n if y == \"S\":\r\n r_evil.add(i)\r\n c_evil.add(x)\r\n\r\nprint(r*c - len(r_evil) * len(c_evil))", "\"\"\"\r\nq = int(input())\r\nfor z in range(q):\r\n\tn = int(input())\r\n\"\"\"\r\nn, m = map(int, input().split())\r\nfN = [True] * n\r\nfM = [True] * m\r\nfor i in range(n):\r\n\ts = input()\r\n\tfor j in range(m):\r\n\t\tif s[j] == 'S':\r\n\t\t\tfN[i] = False\r\n\t\t\tfM[j] = False\r\nctr = 0\r\nfor i in range(n):\r\n\tif fN[i]:\r\n\t\tctr += m\r\n\t\tcontinue\r\n\tfor j in range(m):\r\n\t\tif fM[j]:\r\n\t\t\tctr += 1\r\nprint(ctr)", "def string_to_list(s, char):\r\n collector = \"\"\r\n output_list = []\r\n for i in range(len(s)):\r\n if s[i] != char:\r\n collector += s[i]\r\n if i == len(s) - 1:\r\n output_list.append(int(collector))\r\n else:\r\n output_list.append(int(collector))\r\n collector = \"\"\r\n return output_list\r\n\r\n\r\n#print(string_to_list(\"2 -1 -1\", \" \"))\r\n\r\n\r\ndef list_to_string(l, char):\r\n output_string = \"\"\r\n for i in range(len(l) - 1):\r\n output_string += str(l[i]) + char\r\n output_string += str(l[-1])\r\n return output_string\r\n\r\n\r\ndef quick_sort(l):\r\n def partition(l, start, end):\r\n pivot = l[end]\r\n i = start\r\n for j in range(start, end):\r\n if l[j] <= pivot:\r\n l[j], l[i] = l[i], l[j]\r\n i += 1\r\n l[end], l[i] = l[i], l[end]\r\n return i\r\n\r\n def recutrsion_part(l, start, end):\r\n if len(l) < 2:\r\n return l\r\n elif not start >= end:\r\n p = partition(l, start, end)\r\n recutrsion_part(l, start, p - 1)\r\n recutrsion_part(l, p + 1, end)\r\n recutrsion_part(l, 0, len(l) - 1)\r\n return l\r\n\r\n\r\n#print(quick_sort([2,3,4,3,2,1,2,3,4,5,6,5,4,3,2]))\r\n\r\n\r\n\r\ndef list_reverse(l):\r\n def recursion(l, start, end):\r\n if start >= end:\r\n return l\r\n else:\r\n l[start], l[end] = l[end], l[start]\r\n return recursion(l, start + 1, end - 1)\r\n return recursion(l, 0, len(l) - 1)\r\n\r\n\r\ndef divisibility(n):\r\n sum = 0\r\n for i in n:\r\n sum += int(i)\r\n return not sum % 4\r\n\r\n\r\ndef recursive_solution(x):\r\n while not divisibility(x):\r\n x = str(int(x) + 1)\r\n return x\r\n\r\n\r\ndef which_is_higher(l):\r\n if l[1] < l[0]:\r\n l[0], l[1] = l[1], l[0]\r\n return l\r\n\r\n\r\ndef list_multiplication(l):\r\n product = 0\r\n for i in l:\r\n product += i\r\n return product\r\n\r\n\r\ndef main_function():\r\n r, c = string_to_list(input(), \" \")\r\n count = 0\r\n temp_list = []\r\n general = []\r\n for i in range(r):\r\n row = input()\r\n is_there_s = False\r\n for i in row:\r\n if i == \"S\":\r\n is_there_s = True\r\n temp_list.append(row)\r\n break\r\n if not is_there_s:\r\n count += c\r\n for i in range(c):\r\n is_there_s_2 = False\r\n for j in temp_list:\r\n if j[i] == \"S\":\r\n is_there_s_2 = True\r\n break\r\n if not is_there_s_2:\r\n count += len(temp_list)\r\n return count\r\n\r\n\r\nprint(main_function())\r\n", "n,m=map(int,input().split())\r\nE='.'*m\r\nx=0\r\na=[]\r\nq=0\r\nfor i in range(n):\r\n L=input()\r\n if L==E:\r\n x+=m\r\n else:\r\n a.append(L)\r\nA=len(a)\r\nfor j in range(m):\r\n q=0\r\n for i in range(A):\r\n if a[i][j]=='.':\r\n q+=1\r\n if q==A:\r\n x+=A\r\nprint(x)", "n,m=map(int,input().split(' '))\r\ns=[]\r\nr,c=0,0\r\nfor i in range(n):\r\n s.append(input())\r\n if('S' not in s[i]):r+=1\r\n \r\nfor j in range(m):\r\n if('S' not in list([S[j] for S in s])):\r\n c+=1\r\nprint(r*m+c*n-(r*c))", "r, c = [int(i) for i in input().split()]\r\nmatrix = []\r\nres = 0\r\nfor _ in range(r):\r\n matrix.append(input())\r\n\r\nfor i in range(r - 1, -1, -1): # rows (WORKS)\r\n if 'S' in list(matrix[i]):\r\n continue\r\n else:\r\n res += len(matrix[i])\r\n del matrix[i]\r\n\r\nfor tup in zip(*matrix): # columns\r\n if 'S' in tup:\r\n continue\r\n else:\r\n res += len(tup)\r\n # matrix.remove(''.join(list(tup))) # removes row, not column\r\nprint(res)\r\n", "n, m = map(int, input().split())\r\nmas = [list(input()) for i in range(n)]\r\ncount = 0\r\ncount_2 = 0\r\nfor i in range(n):\r\n if 'S' not in mas[i]:\r\n count_2 += m\r\n for j in range(m):\r\n if 'S' not in mas[i]:\r\n mas[i][j]='_'\r\nfor i in range(m):\r\n for j in range(n):\r\n if mas[j][i] == '.':\r\n count += 1\r\n if mas[j][i]==\"S\":\r\n count=0\r\n break\r\n count_2 += count\r\n count = 0\r\nprint(count_2)\r\n", "data = input()\ndata = data.split()\nr = int(data[0])\nc = int(data[1])\n\ncake = []\nfor i in range(r):\n cake.append(input())\n\n\ndef delete_rows(cake):\n maxi = 0\n keys = []\n for key, row in enumerate(cake):\n if 'S' not in row:\n maxi = maxi + len(row)\n keys.append(key)\n\n count = 0\n for val in keys:\n cake.pop(val-count)\n count += 1\n return cake, maxi\n\n\ndef delete_columns(cake_columns):\n maxi = 0\n keys = []\n for key, column in enumerate(cake_columns):\n if 'S' not in column:\n maxi = maxi + len(column)\n keys.append(key)\n\n count = 0\n for val in keys:\n cake_columns.pop(val-count)\n count += 1\n return cake_columns, maxi\n\n\ndef inverse(cake):\n cake_columns = []\n for line in cake:\n if cake_columns == []:\n for cell in line:\n cake_columns.append(cell)\n else:\n value = 1\n for key, column in enumerate(cake_columns):\n column = column+line[key:value]\n cake_columns[key] = column\n value += 1\n return cake_columns\n\n\ndef is_posible(cake, maxi1, maxi2):\n maxi = maxi1 + maxi2\n posible = False\n values = [0 for _ in range(len(cake[0]))]\n for row in cake:\n for key, cell in enumerate(row):\n if cell == '.':\n values[key] += 1\n\n for val in values:\n if val == len(cake[0]):\n posible = True\n return maxi, posible\n\n\nmaxi = 0\n\n# delete rows\ncake, maxi1 = delete_rows(cake)\n\n# Inverse\ncake_columns = inverse(cake)\n\n# delete columns\ncake, maxi2 = delete_columns(cake_columns)\n\nmaxif = maxi1 + maxi2\n\nprint(maxif)\n\t\t \t \t \t \t\t \t\t\t\t\t \t \t \t\t", "x=input().split()\r\nr=int(x[0])\r\nc=int(x[1])\r\nl=[]\r\nd=[]\r\nfor i in range(r):\r\n l.append(input())\r\nfor j in range(r):\r\n if 'S' not in l[j]:\r\n for k in range(c):\r\n d.append(str(j)+str(k))\r\nfor a in range(c):\r\n w=0\r\n for b in range(r):\r\n if l[b][a]!='S':\r\n w+=1\r\n if w==r:\r\n for b in range(r):\r\n d.append(str(b)+str(a))\r\nprint(len(list(set(d))))", "r,c=map(int,input().split())\r\narea=r*c\r\nsr=set()\r\nsc=set()\r\nfor i in range (r):\r\n a=input()\r\n for j in range (len(a)):\r\n if a[j]==\"S\":\r\n sr.add(i)\r\n sc.add(j)\r\nresult=len(sr)*len(sc)\r\nprint(area-result)", "x, y = map(int, input().split())\r\nrow, col = set(), set()\r\nfor i in range(x):\r\n s = input()\r\n for j in range(y):\r\n if s[j] == 'S':\r\n row.add(i)\r\n col.add(j)\r\nprint(x*y-len(row)*len(col))", "\r\nstroki,stolbsi = map(int,input().split())\r\nmatrica = []\r\nkycki = 0\r\nfor i in range(stroki):\r\n stroka = input()\r\n matrica.append(stroka)\r\nnewm = []\r\nfor p in range(stroki):\r\n if not(\"S\" in matrica[p]):\r\n kycki+=stolbsi\r\n else:\r\n newm.append(matrica[p])\r\nfor k in range(stolbsi):\r\n localstr = \"\"\r\n for o in range(len(newm)):\r\n localstr+=newm[o][k]\r\n if not(\"S\" in localstr):\r\n kycki += len(newm)\r\nprint(kycki)", "def stri(t,a,b):\r\n l=0\r\n for i in range(b):\r\n if t[i]==\"S\":\r\n a[i]=1\r\n l=-1\r\n if l==0:\r\n return 0\r\n else:\r\n return -1\r\n\r\na,b=map(int,input().split())\r\nr=[0]*a\r\nc=[0]*b\r\nfor i in range(a):\r\n k=input()\r\n t=stri(k,c,b)\r\n if t==-1:\r\n r[i]=1\r\n \r\nm=r.count(0)\r\nn=c.count(0)\r\nprint(m*b+n*a-m*n)", "r, c = map(int, input().split())\r\nl = [input() for _ in range(r)]\r\ncount, share = 0, 0\r\ntemp = []\r\n\r\nfor i in l:\r\n if \".\" * c in i:\r\n count += 1 * c\r\n share += 1\r\n\r\nfor j in range(c):\r\n temp = []\r\n for i in range(r):\r\n if l[i][j] == \"S\":\r\n temp = []\r\n break\r\n else:\r\n temp.append(l[i][j])\r\n if temp:\r\n count += 1 * r - share\r\n\r\nprint(count)", "R, C = list(map(int, input().split()))\n\nmat = []\nfor _ in range(R):\n mat.append(list(input()))\n\n\nfor r in range(R):\n if 'S' not in mat[r]:\n for c in range(C):\n mat[r][c] = '*'\n\nfor c in range(C):\n foundS = False\n for r in range(R):\n if mat[r][c] == 'S':\n foundS = True\n break\n\n if not foundS:\n for r in range(R):\n mat[r][c] = '*'\n\ntotal = 0\nfor r in range(R):\n for c in range(C):\n if mat[r][c] == '*':\n total += 1\n\nprint(total)\n", "r, c = [int(i) for i in input().split()]\r\nlist_s = []\r\neaten = 0\r\nfor i in range(r):\r\n a = input()\r\n list_s.append(a)\r\n\r\ni = 0\r\nwhile i < len(list_s):\r\n if 'S' not in list_s[i]:\r\n eaten += len(list_s[i])\r\n list_s.pop(i)\r\n else:\r\n i += 1\r\n\r\nfor i in range(c): # ширина\r\n line = ''\r\n for j in range(len(list_s)): # высота\r\n line += list_s[j][i]\r\n if 'S' not in line:\r\n eaten += len(list_s)\r\n\r\nprint(eaten)", "y, x = map(int, input().split())\r\nmas = []\r\ncount = 0\r\nh = 0\r\nfor i in range(y):\r\n mas.append(str(input()))\r\ntort = [[False]*x for i in range(y)]\r\nvert = 0\r\n# print(tort)\r\n# for i in range(y):\r\n# for j in range(x):\r\n# if mas[i][j] == '.':\r\n# tort[i][j] = True\r\n# print(tort)\r\nfor i in range(y):\r\n if \"S\" not in mas[i]:\r\n for j in range(x):\r\n tort[i][j] = True\r\nfor j in range(x):\r\n for i in range(y):\r\n if mas[i][j] == \".\":\r\n vert += 1\r\n if vert == y:\r\n while h != y:\r\n tort[h][j] = True\r\n h += 1\r\n h = 0\r\n vert = 0\r\n# print(tort)\r\nfor j in range(x):\r\n for i in range(y):\r\n if tort[i][j] == True:\r\n count += 1\r\nprint(count)", "r, c = map(int, input().split())\r\ncake = []\r\nfor i in range(r):\r\n row = list(input())\r\n cake.append(row)\r\nevilRow, evilCol = set(), set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if cake[i][j] == \"S\":\r\n evilCol.add(j)\r\n evilRow.add(i)\r\nans = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if i not in evilRow or j not in evilCol:\r\n ans += 1\r\nprint(ans)", "# https://stepik.org/lesson/332555/step/7?unit=315943\r\n\r\nn, m = map(int, input().split())\r\nlst = [[elem for elem in input()] for _ in range(n)]\r\ns = 0\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(n):\r\n flag = False\r\n for j in range(m):\r\n if lst[i][j] == 'S':\r\n flag = True\r\n break\r\n if flag:\r\n continue\r\n s += m\r\n lst[i] = [1] * m\r\n\r\nfor j in range(m):\r\n flag = False\r\n\r\n\r\n for i in range(n):\r\n if lst[i][j] == 'S':\r\n flag = True\r\n break\r\n if flag:\r\n continue\r\n if not flag:\r\n x = sum([lst[i][j] for i in range(n) if lst[i][j] == 1])\r\n s += n - x \r\nprint(s)\r\n", "#l=[['S','.','.','.'],['.','.','.','.'],['.','.','S','.']]\r\nr,c = map(int, input().split())\r\nl = [0]*r\r\nfor _ in range(r):\r\n a=input()\r\n l[_]=list(a)\r\n\r\n\r\nfor i in range(r):\r\n count = 0\r\n for j in range(c):\r\n if l[i][j] !='S':\r\n count +=1\r\n if count == c:\r\n for k in range(c):\r\n l[i][k]='1'\r\nfor col in range(c):\r\n cnt = 0\r\n for row in range(r):\r\n if l[row][col] !='S':\r\n cnt +=1\r\n if cnt == r:\r\n for m in range(r):\r\n l[m][col] = '1'\r\n\r\ntotal = sum([l[a][b]=='1' for a in range(r) for b in range(c)])\r\n\r\nprint(total)\r\n", "r, c = map(int, input().split())\r\ns = [list(input()) for i in range(r)]\r\nhorizontal_s = 0\r\nvertical_s = 0\r\nfor i in s:\r\n if \"S\" in i:\r\n horizontal_s += 1\r\nfor i in zip(*s):\r\n if \"S\" in i:\r\n vertical_s += 1\r\nprint(r*c-horizontal_s*vertical_s)", "r,c=map(int,input().split(\" \"))\r\nlist1=[]\r\nfor j in range(r):\r\n list1.append(list(input()))\r\nsum1=0\r\nfor j in range(c):\r\n stri=\"\"\r\n for i in range(r):\r\n stri+=list1[i][j]\r\n if 'S' not in stri:\r\n sum1+=len(stri)\r\n for i in range(r):\r\n list1[i][j]='*'\r\nfor j in list1:\r\n if 'S' not in j:\r\n sum1+=j.count('.')\r\nprint(sum1)\r\n\r\n \r\n \r\n \r\n\r\n ", "def read_int():\r\n return int(input())\r\n\r\n\r\ndef read_ints():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef print_nums(nums):\r\n print(\" \".join(map(str, nums)))\r\n\r\n\r\nM, N = read_ints()\r\nrows = set()\r\ncols = set()\r\nfor r in range(M):\r\n s = input()\r\n for c, x in enumerate(s):\r\n if x == 'S':\r\n rows.add(r)\r\n cols.add(c)\r\nR = M - len(rows)\r\nC = N - len(cols)\r\ntotal = R * N + C * M - R * C\r\nprint(total)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled74.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1TMF3empw9H5Gg2AyJyAuduDgxMfS09yH\n\"\"\"\n\nn,k=map(int,input().split())\nl1=[]\nfor x in range(0,n):\n l2=input()\n l2=list(l2)\n l1.append(l2)\nc=0\nx=0\nwhile x<len(l1):\n if \"S\" not in l1[x]:\n c=c+k\n l1.pop(x)\n x=x-1\n x=x+1\nfor y in range(0,k):\n s=0\n for x in range(0,len(l1)):\n if l1[x][y]==\"S\":\n s=s+1\n break\n if s==0:\n c=c+len(l1)\nprint(c)", "r,c= map(int, input().split())\r\na=set()\r\nb=set()\r\nfor i in range(r):\r\n d=input()\r\n for j in range(c):\r\n if d[j]=='S':\r\n a.add(i)\r\n b.add(j)\r\ntotal=r*c\r\nx=len(a)*len(b)\r\nprint(total-x)\r\n", "r,c = [int (x) for x in input().split()]\r\nmatrix=[]\r\nR=0\r\nC=0\r\nfor i in range(0,r):\r\n st = input()\r\n lst=list(st)\r\n matrix.append(lst)\r\nfor i in matrix:\r\n if 'S' in i:\r\n R+=1 \r\nfor i in range(0,c):\r\n for j in range(0,r):\r\n if(matrix[j][i] == 'S'):\r\n C+=1 \r\n break\r\nprint(r*c-R*C)", "r,c = map(int,input().split())\r\nli=[]\r\ncount=0\r\nfor i in range(r):\r\n s = list(input())\r\n if 'S' not in s:\r\n count+=c\r\n s = ['*']*c\r\n li.append(s)\r\nresult = [[li[j][i] for j in range(len(li))] for i in range(len(li[0]))]\r\n\r\nfor i in range(c):\r\n s = result[i][0:r]\r\n if 'S' not in s:\r\n count+=s.count('.')\r\nprint(count)\r\n", "r,c=list(map(int,input().split()))\nmatrix=[]\n\nfor i in range(r):\n row=input()\n matrix.append(row)\n\nans=r*c\n\nrow_chk=[0]*r\ncol_chk=[0]*c\n\nfor i in range(r):\n for j in range(c):\n if(matrix[i][j]==\"S\"):\n row_chk[i]=1\n col_chk[j]=1\n\nfor i in range(r):\n for j in range(c):\n if row_chk[i] and col_chk[j]:\n ans-=1\nprint(ans)\n\n\n\n \t \t \t\t \t \t \t \t \t\t\t \t \t\t\t\t", "n, k = map(int, input().split())\r\ns1, s2 = set(), set()\r\n\r\nfor i in range(n):\r\n row = input().strip()\r\n for j in range(k):\r\n if row[j] == 'S':\r\n s1.add(i)\r\n s2.add(j)\r\n\r\nresult = n * k - (len(s1) * len(s2))\r\nprint(result)\r\n", "r,c=map(int,input().split())\r\nsr,sc=0,set()\r\nfor i in range(r):\r\n rw=input()\r\n if 'S' in rw:\r\n sr+=1 \r\n for j, ch in enumerate(rw):\r\n if ch == 'S':\r\n sc.add(j)\r\n \r\n \r\nprint(r*c-sr*len(sc))\r\n ", "r, c = map(int,input().split())\r\np=[]\r\nfor i in range(r):\r\n k=input()\r\n l=[]\r\n for j in k:\r\n if j == \"S\":\r\n l.append(1)\r\n continue\r\n l.append(0)\r\n p.append(l)\r\nsatr=[]\r\nsotun=[]\r\nfor i in range(r):\r\n for j in range(c):\r\n if p[i][j]==1:\r\n satr.append(i)\r\n sotun.append(j)\r\n\r\ncount=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if not (i in satr and j in sotun):\r\n count+=1\r\nprint(count)", "r, c = [int(i) for i in input().split()]\r\nlist1 = []\r\nstr1 = 0\r\nstl1 = 0\r\nfor i in range(r):\r\n list1.append(input())\r\nfor i in range(len(list1)):\r\n if 'S' not in list1[i]:\r\n str1 += 1\r\nfor j in range(c):\r\n for i in range(r):\r\n if list1[i][j] == 'S':\r\n break\r\n else:\r\n stl1 += 1\r\nprint(str1*c+stl1*r-str1*stl1)", "r,c = map(int,input().split())\r\nl =[]\r\ncount = 0\r\nfor i in range(r):\r\n l.append(input())\r\n if \"S\" not in l[-1]:\r\n l[-1] = [0]*c\r\n count+=c\r\nit = list(zip(*l))\r\nfor ele in it:\r\n if \"S\" not in ele:\r\n count+=r\r\n count-= ele.count(0)\r\nprint(count)", "r, c = map(int, input().split())\nrow = [0] * c\ncount = 0\nfor _ in range(r):\n string = input()\n if 'S' not in string:\n count += c\n else:\n for i in range(c):\n if string[i] == 'S':\n row[i] = -1\n elif row[i] >= 0:\n row[i] += 1\ncount += sum(filter(lambda x: x != -1, row))\nprint(count)\n", "r, c = [int(f) for f in input().split()]\r\nx = 0\r\ny = 0\r\ncake = []\r\nfor i in range(r):\r\n b = input()\r\n cake.append(b)\r\n if 'S' not in b:\r\n x+=1\r\n\r\nfor f in range(c):\r\n for i in range(r):\r\n if cake[i][f] == 'S':\r\n break\r\n else:\r\n y +=r-x\r\n\r\nprint(x*c+y)\r\n\r\n\r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nr,c = li()\r\ncake = [input() for _ in range(r)]\r\nans = 0\r\nfor i in range(r):\r\n if 'S' not in cake[i]:\r\n ans += c\r\n cake[i] = 'T'*c\r\nx = [''.join(i) for i in zip(*cake)]\r\nfor i in range(c):\r\n if 'S' not in x[i]:\r\n ans += x[i].count('.')\r\nprint(ans)", "if __name__ == \"__main__\":\r\n r, c = map(int, input().split())\r\n row = []\r\n\r\n for _ in range(r):\r\n row.append(list(input()))\r\n\r\n col = []\r\n for _ in range(c):\r\n col.append([])\r\n\r\n total_cake = 0\r\n r_cake = 0\r\n c_cake = 0\r\n\r\n for r in row:\r\n for i in range(c):\r\n col[i].append(r[i])\r\n\r\n if 'S' not in r:\r\n total_cake += len(r)\r\n r_cake += 1\r\n\r\n for c in col:\r\n if 'S' not in c:\r\n total_cake += len(c) - r_cake\r\n\r\n print(total_cake)\r\n", "r,c=map(int,input().split())\r\nck=[input() for i in range(r)]\r\nr_count=[1 if 'S'in it else 0 for it in ck]\r\nc_count=[1 if 'S'in [ck[i][j] for i in range(r) ] else 0 for j in range(c)]\r\ncount=[1 if r_count[i]==0 or c_count[j]==0 else 0 for i in range(r) for j in range(c)]\r\nprint(sum(count))", "def solve(n, m, arr):\r\n cnt = 0\r\n a = set()\r\n b = set()\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"S\":\r\n a.add(i)\r\n b.add(j)\r\n\r\n return ((n * m) - (len(a) * len(b)))\r\n\r\nn, m = map(int, (input().split()))\r\narr = [input() for i in range(n)]\r\nprint(solve(n, m, arr))", "r, c = map(int, input().split())\r\nli = [input() for _ in range(r)]\r\nli2 = list(zip(*li))\r\nli3 = [\"\".join(row) for row in li2]\r\ncnt = 0\r\nval = 0\r\nfor i in li:\r\n if i == c*\".\":\r\n val += c\r\n cnt += 1\r\ncnt2 = 0\r\nfor j in li3:\r\n if j == r*\".\":\r\n val += r\r\n cnt2 += 1\r\nprint(val - cnt*cnt2)", "(r, c) = map(int, input().split(' '))\n\ncolumns = []\nrows = 0\n\nfor i in range(r):\n s = input()\n if s.count('S') == 0:\n rows += 1\n for j in range(c):\n if s[j] == 'S':\n columns.append(j)\n\ncan_eat = rows * c + (c - len(set(columns))) * (r - rows)\nprint(can_eat)", "n,m=map(int,input().split())\narr=[]\nmapping={}\nx=[]\ny=[]\nans=0\nfor _ in range(n):\n line=input()\n for i in range(m):\n if line[i]=='S':\n x.append(_)\n y.append(i)\n # print(_,i)\n # mapping[_]='x'\n # mapping['y']=i\n # arr.append()\n# print(x,y)\nfor i in range(n):\n for j in range(m):\n if i in x and j in y:\n continue\n else:\n # print(i,j)\n ans+=1\nprint(ans)\n\n\n# n,m=map(int,input().split())\n# arr=[]\n# mapping={}\n# x=[]\n# y=[]\n# ans=0\n# for _ in range(n):\n# line=input()\n# for i in range(m):\n# if line[i]=='S':\n# x.append(_)\n# y.append(i)\n# print(_,i)\n# # mapping[_]='x'\n# # mapping['y']=i\n# # arr.append()\n# print(x,y)\n# for i in range(n):\n# for j in range(m):\n# if i in x or j in y:\n# continue\n# else:\n# print(i,j)\n# ans+=1\n# print(ans)", "# Required Libraries\r\nfrom collections import deque\r\n\r\n# Constants\r\nMOD = int(1e9 + 7)\r\nMAX = int(1e18)\r\nN = int(1e5 + 7)\r\ninf = int(1e18)\r\n\r\n# Function to solve the problem\r\ndef solve():\r\n # Main code\r\n n, m = map(int, input().split())\r\n s = []\r\n for i in range(n):\r\n s.append(input())\r\n ans = 0\r\n for i in range(n):\r\n for j in range(m):\r\n c = True\r\n ok = True\r\n for k in range(n):\r\n if s[k][j] == 'S':\r\n ok = False\r\n for k in range(m):\r\n if s[i][k] == 'S':\r\n c = False\r\n ans += ok or c\r\n print(ans)\r\n\r\n# Main function\r\ndef main():\r\n # Input Handling\r\n t = 1\r\n while t:\r\n solve()\r\n print()\r\n t -= 1\r\n\r\n# Main Execution\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = list(map(int, input().split()))\n\nc_rows = 0\nmatrix = []\nk = 0\nfor i in range(n[0]):\n y = [char for char in input()]\n if not \"S\" in y:\n k += n[1] \n c_rows += 1\n matrix.append(y)\n\nfor i in range(n[1]):\n e = 1\n for j in range(n[0]):\n if matrix[j][i] == \"S\":\n e = -1\n break \n if e != -1:\n k += n[0] - c_rows\n \nprint(k)", "def f(j,rows):\r\n c = 0\r\n for i in range(len(rows)):\r\n if rows[i][j]=='S':\r\n return 0,False\r\n else:\r\n if rows[i][j]=='.':\r\n c+=1\r\n return c,True\r\n\r\nr,c = [int(x) for x in input().split()]\r\nrows = []\r\nfor i in range(r):\r\n rows.append(input())\r\n \r\ncells=0\r\nfor i in range(r):\r\n if 'S' not in rows[i]:\r\n rows[i]=\"0\"*c\r\n cells+=c\r\nfor j in range(c):\r\n x,y = f(j,rows)\r\n if y==True:\r\n cells+=x\r\nprint(cells)\r\n ", "n = [int(i) for i in input().split()]\ntable = [None] * n[0]\nfor i in range(n[0]):\n table[i]= list(map(lambda x: 0 if(x==\"S\") else 1,[str(i) for i in input()]))\n\nfil1 = [1]*n[1]\nre1 = list(filter(lambda x:fil1==x,table))\nt_1 = list(filter(lambda x:fil1!=x,table))\n\nlt_1 = len(t_1)\nconst=0\nfor i in range(n[1]):\n c=0\n for j in range(lt_1):\n c+=t_1[j][i]\n if (c==lt_1):\n const+=c\nsuma = const+sum(list(map(lambda x:sum(x), re1)))\nprint(suma)\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\na = set()\r\nb = set()\r\nfor i in range(r):\r\n d = input()\r\n for j in range(len(d)):\r\n if d[j] == 'S':\r\n a.add(j)\r\n b.add(i)\r\nprint(r*c-len(a)*len(b))\r\n", "n,m=list(map(int,input().split()))\r\ngrid=[]\r\nfor i in range(n):\r\n temp=input()\r\n grid.append(temp)\r\n# print(grid)\r\n# # grid=[[\"S\",\".\",\".\",\".\"],\r\n# # [\".\",\".\",\".\",\".\"],\r\n# # [\".\",\".\",\"S\",\".\"]]\r\n \r\n# for i in grid:\r\n# print(*i)\r\n \r\n#via rows \r\ntot_set=set()\r\n\r\nfor i in range(n):\r\n curr_set=set()\r\n for j in range(m):\r\n if grid[i][j]==\"S\":\r\n curr_set.clear()\r\n break \r\n else:\r\n curr_set.add((i,j))\r\n tot_set=tot_set|curr_set\r\n\r\n# print(tot_set)\r\n# # 0 0\r\n# # 1 0\r\n# # 2 0\r\n# # 0 1 \r\n# # 1 1\r\n# # 2 1\r\n\r\n# # 1 st loop on row varialbe\r\n# # 2 nd loop on col constant\r\n\r\nfor i in range(m):\r\n curr_set=set()\r\n for j in range(n):\r\n if grid[j][i]==\"S\":\r\n curr_set.clear()\r\n break \r\n else:\r\n curr_set.add((j,i))\r\n tot_set=tot_set|curr_set\r\n \r\n \r\nprint(len(tot_set))\r\n \r\n \r\n \r\n\r\n \r\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())\r\ngrid=[]\r\nfor i in range(r):\r\n grid+=[list(input())]\r\nans=0\r\nfor i in grid:\r\n if 'S' not in i:\r\n ans+=i.count('.')\r\n i[:]='1'*len(i)\r\nt=[]\r\nfor i in range(c):\r\n t+=[[0]*r]\r\nfor i in range(c):\r\n for j in range(r):\r\n t[i][j]=grid[j][i]\r\nfor i in t:\r\n if 'S' not in i:\r\n ans+=i.count('.') \r\n i[:]='1'*len(i)\r\nprint(ans)", "\r\ndef solve():\r\n r,c = [int(x) for x in input().split(' ')]\r\n cake = []\r\n for i in range(r):\r\n cake.append(input())\r\n rows = [True if cake[i].find('S')!=-1 else False for i in range(r)]\r\n cakeT = list(zip(*cake))\r\n cols = [True if ('S' in cakeT[i]) else False for i in range(c)]\r\n\r\n ans = 0\r\n for i in range(r):\r\n for j in range(c):\r\n if not (rows[i]&cols[j]):\r\n ans+=1\r\n print(ans)\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()", "import sys\ninput = sys.stdin.readline\n\nresults = []\nfor _ in range(1) :\n\tR, C = map(int, input().split())\n\tM = [list(input().rstrip()) for _ in range(R)]\n\t\n\tfor ri in range(R) :\n\t\tisValid = True\n\t\tfor ci in range(C) :\n\t\t\tif M[ri][ci] == \"S\" :\n\t\t\t\tisValid = False\n\t\t\t\tbreak\n\t\tif not isValid :\n\t\t\tcontinue\n\t\t\t\n\t\tfor ci in range(C) :\n\t\t\tM[ri][ci] = \"X\"\t\n\t\n\tfor ci in range(C) :\n\t\tisValid = True\n\t\tfor ri in range(R) :\n\t\t\tif M[ri][ci] == \"S\" :\n\t\t\t\tisValid = False\n\t\t\t\tbreak\n\t\tif not isValid :\n\t\t\tcontinue\n\t\t\n\t\tfor ri in range(R) :\n\t\t\tM[ri][ci] = \"X\"\n\t\t\t\n\ttc = 0\n\tfor ri in range(R) :\n\t\tfor ci in range(C) :\n\t\t\tif M[ri][ci] == \"X\" :\n\t\t\t\ttc += 1\n\tresults.append(str(tc))\nprint(\"\\n\".join(results))", "n, m = map(int, input().split())\r\nmatrix = [[j for j in input()] for _ in range(n)]\r\n# for row in matrix:\r\n# print(*row)\r\nresult, row_counter = 0, 0\r\nfor row in matrix:\r\n if 'S' not in row:\r\n result += len(row)\r\n row_counter += 1\r\n \r\nfor j in range(m):\r\n col = [row[j] for row in matrix]\r\n if 'S' not in col:\r\n result += (len(col) - row_counter)\r\nprint(result)", "def main():\r\n n, m = map(int, input().split())\r\n v = [list(input()) for _ in range(n)]\r\n a = len([1 for i in v if 'S' in i])\r\n b = len([1 for i in zip(*v) if 'S' in i])\r\n print(n * m - a * b)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# Cakeminator\ndef cake(s):\n ans = 0\n for i, n in enumerate(s):\n if 'S' in n:\n continue\n else:\n s[i] = ['E'] * len(n)\n ans += len(n)\n x = list(zip(*s))\n for i, n in enumerate(x):\n if 'S' in n:\n continue\n else:\n ans += n.count('.')\n return ans\n\nr, c = list(map(int, input().rstrip().split()))\ns = []\nfor i in range(r):\n x = list(input())\n s.append(x)\nprint(cake(s))", "r, c = [int(i) for i in input().split()]\r\ncake = []\r\ncounter = 0\r\ncounter1 = 0\r\n\r\nfor i in range(r):\r\n cake.append(input())\r\n\r\nfor i in cake:\r\n if \"S\" not in i:\r\n counter += 1\r\n\r\nfor i in range(0, c):\r\n s = True\r\n for j in cake:\r\n if j[i] == \"S\":\r\n s = False\r\n break\r\n if s == True:\r\n counter1 += 1\r\n\r\nresult = counter*c + counter1*(r-counter)\r\n\r\nprint(result)\r\n", "r,c=map(int,input().split());x=[0,0];a=[input() for _ in[0]*r]\r\nfor i in[0,1]:x[i]=sum(s.count('S')<1 for s in a);a=zip(*a)\r\nprint(x[0]*c+x[1]*r-x[0]*x[1])", "r,c = list(map(int, input().split()))\r\nrows_with_s = []\r\ncols_with_s = []\r\nr_cnt = 0\r\nc_cnt = 0\r\nfor i in range(r):\r\n\trow = input()\r\n\tif 'S' in row:\r\n\t\tfor j in range(c):\r\n\t\t\tif row[j] == 'S':\r\n\t\t\t\trows_with_s.append(i)\r\n\t\t\t\tcols_with_s.append(j)\r\nfor i in range(c):\r\n\tif i not in cols_with_s:\r\n\t\tc_cnt += 1\r\nfor j in range(r):\r\n\tif j not in rows_with_s:\r\n\t\tr_cnt += 1\r\ncnt = c_cnt*r + r_cnt*c - c_cnt*r_cnt\r\nprint(cnt)", "while True:\r\n try:\r\n r, c = map(int, input().split())\r\n list0 = []\r\n row = [0] * 15\r\n column = [0] * 15\r\n for i in range(r):\r\n list0.append(input())\r\n for j in range(c):\r\n if list0[i][j] == 'S':\r\n row[i] = column[j] = 1\r\n ans = r * c\r\n for i in range(r):\r\n for j in range(c):\r\n if row[i] == 1 and column[j] == 1:\r\n ans -= 1\r\n print(ans)\r\n except:\r\n break", "r,c=map(int,input().split())\r\nn=[0]*r\r\nm=[0]*c\r\nd=r*c\r\nfor i in range(r):\r\n l=list(map(str,input()))\r\n for j in range(c):\r\n if(l[j]==\"S\"):\r\n n[i]=1\r\n m[j]=1\r\nfor i in range(r):\r\n for j in range(c):\r\n if(n[i]==1 and m[j]==1):\r\n d=d-1\r\nprint(d)", "h, w = map(int, input().split())\ng = [input() for _ in range(h)]\nys = {y for y, r in enumerate(g) if \"S\" not in r}\nxs = {x for x, r in enumerate(zip(*g)) if \"S\" not in r}\nprint(sum(y in ys or x in xs for y in range(h) for x in range(w)))\n", "# https://codeforces.com/contest/330/problem/A\r\n\r\nr, c = input().split()\r\nr, c = int(r), int(c)\r\n\r\nd = []\r\nevil_positions = [[],[]]\r\ncakes = 0\r\n\r\nfor i in range(0, r):\r\n l = input()\r\n l2 = []\r\n for j in range(0, c):\r\n l2.append(l[j])\r\n d.append(l2)\r\n\r\n# looping through rows \r\nfor i in range(0, r):\r\n if not \"S\" in d[i]:\r\n for j in range(0, c):\r\n if d[i][j] == \".\":\r\n cakes += 1\r\n d[i][j] = \"-\"\r\n\r\n# looping through columns \r\nfor i in range(0, c):\r\n if not \"S\" in [d[x][i] for x in range(0,r)]:\r\n for j in range(0, r):\r\n if d[j][i] == \".\":\r\n cakes += 1\r\n d[j][i] == \"-\"\r\n\r\nprint(cakes)", "n,m=map(int,input().split())\r\nb=[ list(i for i in input()) for j in range(n)]\r\nsay=0\r\nfor i in range(n):\r\n\tif 'S' not in b[i]:\r\n\t\tfor j in range(m):\r\n\t\t\tif b[i][j] == '.':\r\n\t\t\t\tsay+=1\r\n\t\t\t\tb[i][j] = ','\r\nd=[]\r\nfor i in range(m):\r\n a=[]\r\n for j in range(n):\r\n \ta.append(b[j][i])\r\n d.append(a)\r\nfor i in range(m):\r\n\tif 'S' not in d[i]:\r\n\t\tfor j in range(n):\r\n\t\t\tif d[i][j] == '.':\r\n\t\t\t\tsay+=1\r\n\t\t\t\td[i][j] = ','\r\nprint(say)\r\n\t\t\t\t", "from distutils import ccompiler\n\n\nr, c = list(map(int, input().split()))\nrows = []\nfor i in range(r):\n rows.append(list(input()))\n\nnoRows = set()\nnoCols = set()\nfor i in range(r) :\n for j in range(c) :\n if rows[i][j] == 'S' :\n noRows.add(i)\n noCols.add(j)\n\nRcount = r-len(noRows)\nCcount = c-len(noCols)\ncells = Rcount*c + Ccount*r - Rcount*Ccount\n\nprint(cells)\n\t \t \t \t \t\t\t \t\t \t \t \t", "a,b=map(int,input().split())\r\nc=[]\r\nd=[]\r\nfor i in range(a):\r\n z=list(input()) \r\n for j in range(b):\r\n if z[j]=='S':\r\n c.append(i)\r\n d.append(j)\r\nprint(a*b-len(list(set(c)))*len(list(set(d))))", "import sys\r\n\r\nn,m = list(map(int,input().strip().split(' ')))\r\n\r\ngrid = []\r\n\r\nfor i in range(n):\r\n\r\n s = list(input().strip())\r\n\r\n grid.append(s)\r\n\r\nans = 0\r\n\r\nrow = [0]*n\r\ncol = [0]*m\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n\r\n if grid[i][j]=='S':\r\n row[i]=1\r\n col[j]=1\r\n \r\nans =0\r\nfor i in range(n):\r\n for j in range(m):\r\n\r\n if grid[i][j]!='S':\r\n if row[i]!=1 or col[j]!=1:\r\n ans+=1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "y = 0\r\na = []\r\nx = 0\r\nr, c = [int(i) for i in input().split()]\r\nfor i in range(r):\r\n a.append(input())\r\n\r\nfor i in range(r):\r\n if 'S' not in a[i]:\r\n x += 1\r\n\r\nfor i in range(c):\r\n for j in range(r):\r\n if a[j][i] == 'S':\r\n break\r\n else:\r\n y += r - x\r\n\r\nprint(x*c+y)", "rows, columns = map(int, input().split())\r\n\r\noccupied_rows = 0\r\noccupied_columns_set = set()\r\n\r\nfor i in range(rows):\r\n line = input()\r\n if 'S' not in line:\r\n continue\r\n occupied_rows += 1\r\n [occupied_columns_set.add(j) for j in range(columns) if line[j] == 'S']\r\n\r\noccupied_columns = len(occupied_columns_set)\r\n\r\nfree_rows = rows - occupied_rows\r\nfree_columns = columns - occupied_columns\r\n\r\neaten_rows = free_rows * columns\r\neaten_columns = free_columns * occupied_rows\r\n\r\nprint(eaten_rows + eaten_columns)", "a=list(map(int,input().strip().split()))\r\nr=a[0]\r\nc=a[1]\r\na=[]\r\nfor i in range(r):\r\n b=input()\r\n a.append(b)\r\ns=0\r\np=0\r\nfor i in range(0,r):\r\n q=0\r\n for j in range(0,c):\r\n if(a[i][j]==\"S\"):\r\n q=q+1\r\n if(q==0):\r\n s=s+c\r\n p=p+1\r\nfor i in range(0,c):\r\n q=0\r\n for j in range(0,r):\r\n if(a[j][i]==\"S\"):\r\n q=q+1\r\n if(q==0):\r\n s=s+r-p\r\n\r\nprint(s)\r\n\r\n", "r, c = map(int, input().split())\r\nmatrix = []\r\ncount = 0\r\nfor i in range(r):\r\n matrix.append(input())\r\nflag = [[False] * c for i in range(r)]\r\nfor i in range(r):\r\n if 'S' not in matrix[i]:\r\n for j in range(c):\r\n flag[i][j] = True\r\nfor j in range(c):\r\n is_find = False\r\n for i in range(r):\r\n if matrix[i][j] == 'S':\r\n is_find=True\r\n break\r\n if not is_find:\r\n for i in range(r):\r\n flag[i][j]=True\r\nfor b in range(r):\r\n for j in range(c):\r\n if flag[b][j]==True:\r\n count+=1\r\nprint(count)", "t = input()\r\na = tuple(int(x) for x in t.split())\r\nval: list = list()\r\nrow: list = list()\r\ncol: list = list()\r\n\r\nfor i in range(a[0]):\r\n l = list(map(str, input()))\r\n val.append(l)\r\n\r\nfor i in range(len(val)):\r\n for j in range(len(val[i])):\r\n if val[i][j] == 'S':\r\n row.append(i)\r\n col.append(j)\r\n\r\nrow.sort()\r\ncol.sort()\r\nresult: int = 0\r\ncheck: int = 0\r\nfor i in range(a[0]):\r\n if i not in row:\r\n result += a[1]\r\n check += 1\r\n\r\nfor i in range(a[1]):\r\n if i not in col:\r\n result += (a[0]- check)\r\n\r\nprint(result)\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nli = []\r\nans = 0\r\nfor i in range(n):\r\n s = list(input())\r\n if 'S' not in s:\r\n ans += m \r\n else:\r\n li.append(s)\r\nif(len(li)!=0):\r\n li2 = []\r\n for i in range(len(li[0])):\r\n x = []\r\n for j in li:\r\n x.append(j[i])\r\n if('S' not in x):\r\n ans += len(x)\r\nprint(ans)\r\n \r\n", "n = input()\r\n\r\nr,c = n.split()\r\nrows = []\r\ncount = 0\r\ncake = 0\r\nrocount = 0\r\nwhile count < int(r):\r\n row = input()\r\n if \"S\" not in row:\r\n cake += int(c)\r\n rocount += 1\r\n rows.append(row)\r\n count += 1\r\n\r\nfor x in range(0,int(c)):\r\n pre = \"\"\r\n for y in rows:\r\n if y[x] == \".\":\r\n pre+= y[x]\r\n else:\r\n pre+= y[x]\r\n break\r\n if \"S\" not in pre:\r\n cake += int(r)-rocount\r\n\r\nprint (cake)\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\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())\r\ncakecells = []\r\nfor i in range(r):\r\n row = input()\r\n cakecells.append(row)\r\nrowstoeat = 0\r\nfor item in cakecells:\r\n rowstoeat += 1 if 'S' not in item else 0\r\ncolumnstoeat = 0\r\nfor j in range(c):\r\n eatable = True\r\n for i in range(r):\r\n if cakecells[i][j] == 'S':\r\n eatable = False\r\n break\r\n columnstoeat += 1 if eatable else 0\r\nanswer = (rowstoeat * c) + (columnstoeat * (r - rowstoeat))\r\nprint(answer)\r\n", "r, c = [int(x) for x in input().split()]\r\nl = []\r\nfor k in range(r):\r\n a = input()\r\n l.append(a)\r\npositions = []\r\nfor i in range(0, c):\r\n if \"S\" not in [l[x][i] for x in range(0,r)]:\r\n for j in range(0, r):\r\n b = l[j][i]\r\n positions.append([j,i])\r\nfor i in range(0, r):\r\n if \"S\" not in l[i]:\r\n for j in range(0, c):\r\n b = l[i][j]\r\n positions.append([i,j])\r\ntp=[]\r\nfor i in positions:\r\n if i not in tp:\r\n tp.append(i)\r\nprint(len(tp))\r\n", "# cook your dish here\r\n# cook your dish here\r\n#t=int(input())\r\n\r\nfor i in range(1):\r\n r,c=[int(x) for x in input().split()]\r\n l=[]\r\n for i in range(r):\r\n k=input()\r\n l.append(k)\r\n rs=[]\r\n cs=[]\r\n ans=0\r\n rows=0\r\n cols=0\r\n for i in range(r):\r\n flag=0\r\n for j in range(c):\r\n if l[i][j]=='S':\r\n rs.append(i)\r\n cs.append(j)\r\n flag=1\r\n if not flag:\r\n rows+=1\r\n #print(rows)\r\n for i in range(c):\r\n flag=0\r\n for j in range(r):\r\n if l[j][i]=='S':\r\n rs.append(i)\r\n cs.append(j)\r\n flag=1\r\n if not flag:\r\n cols+=1\r\n ans+=rows*c+cols*r\r\n ans-=rows*cols\r\n print(ans)\r\n", "n, m = map(int, input().split())\r\na = set()\r\nb = set()\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == 'S':\r\n a.add(j)\r\n b.add(i)\r\nprint(n * m - len(a) * len(b))\r\n", "a,b = map(int, input().split())\r\n\r\nstrings = []\r\n\r\nfor i in range(a):\r\n strings.append(list(input()))\r\n\r\ncounter = 0\r\n\r\nfor i in range(a):\r\n if 'S' not in strings[i]:\r\n counter += strings[i].count('.')\r\n strings[i] = len(strings[i]) * [' ']\r\n \r\nfor j in range(b):\r\n tmp_cnt = 0\r\n for i in range(a):\r\n if strings[i][j] == '.':\r\n tmp_cnt += 1\r\n elif strings[i][j] == 'S':\r\n tmp_cnt = 0\r\n break\r\n counter += tmp_cnt\r\n\r\nprint(counter)\r\n", "# 코드포스 330A Cakeminator\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nr, c = map(int, put().split())\r\ncake = [put().strip() for i in range(r)]\r\nsr, sc = set(), set()\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if cake[i][j] == 'S':\r\n sr.add(i)\r\n sc.add(j)\r\n\r\nprint(r * c - len(sr) * len(sc))", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nr, c = map(lambda v: int(v), input().split())\r\nm = list()\r\nans = 0\r\n\r\nfor i in range(r):\r\n a = input()\r\n if a.find(\"S\") != -1: m.append(list(a))\r\n else:\r\n ans += a.count(\".\")\r\n m.append(list(a.replace(\".\", \"e\")))\r\n\r\nfor i in range(c):\r\n e = 0\r\n for j in range(r):\r\n a = m[j][i]\r\n if a == \"S\":\r\n e=0\r\n break;\r\n elif a == \".\": e+=1\r\n ans+=e\r\n\r\nprint(ans)\r\n", "h,w=map(int,input().split())\r\na=[]\r\nhang=[0 for i in range(h)]\r\nlie=[0 for i in range(w)]\r\n\r\nfor i in range(h):\r\n a.append(input())\r\n for j in range(w):\r\n if a[i][j]=='S':\r\n hang[i]=1\r\n lie[j]=1\r\n \r\n# print(b)\r\ns=0\r\nfor i in range(h):\r\n for j in range(w):\r\n if a[i][j]=='.' and (hang[i]==0 or lie[j]==0): \r\n s+=1\r\nprint(s)", "(r,c)=[int(x) for x in input().split()]\r\nl=[]\r\nout=0\r\nfor i in range(r):\r\n n=input()\r\n l.append(n)\r\nfor i in range(len(l)):\r\n if l[i]==\".\"*c:\r\n out+=c\r\n l[i]=l[i].replace('.',' ')\r\nfor x in range(c):\r\n s=0\r\n for i in l:\r\n if i[x]=='.':\r\n s+=1\r\n elif i[x]==' ':\r\n s+=0\r\n elif i[x]=='S':\r\n s=0\r\n break\r\n out+=s \r\nprint(out)", "'''\r\n\r\n\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nr,c=map(int,input().split())\r\ngrid = []\r\nfor _ in range(r):\r\n grid.append(input().strip())\r\n\r\nrows = set()\r\ncols = set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j]=='S':\r\n rows.add(i)\r\n cols.add(j)\r\n\r\ncol_cnt = (c-len(cols)) * r\r\nrow_cnt = (r-len(rows)) * c\r\n\r\nrem_r = r - len(rows)\r\nrem_c = c - len(cols)\r\n\r\nint_cnt = rem_r * rem_c\r\n# print(row_cnt, col_cnt, int_cnt)\r\nprint(col_cnt + row_cnt - int_cnt)", "a,b=map(int,input().split())\r\nc=set()\r\nd=set()\r\nfor i in range(a):\r\n x=input()\r\n for y in range(len(x)):\r\n if x[y]==\"S\":\r\n c.add(y)\r\n d.add(i)\r\nprint(a*b-len(c)*len(d))\r\n", "r,c=map(int,input().split())\r\ngrid=[]\r\nfor i in range(r):\r\n s=input()\r\n grid.append(s)\r\ndef check(i,j):\r\n sol=0\r\n for k in range(c):\r\n if grid[i][k]=='S':\r\n sol+=1\r\n break\r\n for k in range(r):\r\n if grid[k][j]=='S':\r\n sol+=1\r\n break\r\n return sol<2\r\nans=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j]=='.':\r\n if check(i,j):\r\n ans+=1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a.append(input())\r\ns = s1 = s2 = 0\r\nfor i in a:\r\n if i.find('S') != -1:\r\n if i.find('S') not in b:\r\n b.append(i.find('S'))\r\n else:\r\n s += m\r\n s1 += 1\r\nfor i in a:\r\n for j in range(m):\r\n if i[j] == 'S' and j not in b:\r\n b.append(j)\r\nfor j in range(m):\r\n if j not in b:\r\n s += n\r\n s2 += 1\r\nprint( s - s1*s2)", "r,c = [int(x) for x in input().split()]\r\ncake = [[] for i in range(r)]\r\n\r\nfor i in range(r):\r\n cake[i] = [1 if x == 'S' else 0 for x in input()]\r\n\r\neatcol = r\r\neatrow = c\r\n\r\ncells = 0\r\n\r\nfor i in range(r):\r\n numinrow = 0\r\n for j in range(c):\r\n numinrow += cake[i][j]\r\n if numinrow == 0:\r\n cells += eatrow\r\n eatcol -= 1\r\n\r\nfor j in range(c):\r\n numincol = 0\r\n for i in range(r):\r\n numincol += cake[i][j]\r\n if numincol == 0:\r\n cells += eatcol\r\n eatrow -= 1\r\n\r\nprint(cells)", "r,c = [int(x) for x in input().split()]\r\nx = []\r\nfor i in range(r):\r\n y = list(input())\r\n x.append(y)\r\nrow_s = []\r\ncolumn_s = []\r\nfor i in range(r):\r\n for j in range(c):\r\n if x[i][j] == 'S':\r\n row_s.append(i)\r\n column_s.append(j)\r\nnewr = list(set(row_s))\r\nnewc = list(set(column_s))\r\nR = len(newr)\r\nC = len(newc)\r\nprint((r-R)*c + ((c-C)*r)-(r-R)*(c-C))", "r,c = map(int, input().split())\r\na=[]\r\ng=[]\r\nfor x in range(r):\r\n a.append(input())\r\nd=0\r\nfor i in range(r):\r\n if a[i] == \".\"*c:\r\n d+=c\r\n else:\r\n g.append(a[i])\r\nfor i in range(c):\r\n f=False\r\n for x in g:\r\n if x[i] == 'S':\r\n f=True\r\n if f==False:\r\n d+=len(g)\r\nprint(d)\r\n", "r, c = [int(i) for i in input().split()]\ncake = []\ncake_eaten = 0\ncake_num = 0\nfor i in range(r):\n cake_row = list(input())\n cake.append(cake_row)\n if 'S' not in cake_row:\n cake_eaten += c\n cake_num += 1\n\nfor i in range(c):\n cake_column = []\n for j in range(r):\n cake_column.append(cake[j][i])\n if 'S' not in cake_column:\n cake_eaten += r - cake_num\n\nprint(cake_eaten)", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nb = [[False] * m for k in range(n)]\r\ncount = 0\r\nfor i in range(n):\r\n if 'S' not in a[i]:\r\n for j in range(m):\r\n b[i][j] = True\r\nfor j in range(m):\r\n is_find = False\r\n for i in range(n):\r\n if a[i][j] == 'S':\r\n is_find = True\r\n break\r\n if not is_find:\r\n for i in range(n):\r\n b[i][j] = True\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j]:\r\n count += 1\r\nprint(count)", "t = input()\r\narr = tuple(int(x) for x in t.split())\r\nval = []\r\nrow = []\r\ncol = []\r\n\r\nfor i in range(arr[0]):\r\n l = list(map(str, input()))\r\n val.append(l)\r\n\r\nfor i in range(len(val)):\r\n for j in range(len(val[i])):\r\n if val[i][j] == 'S':\r\n row.append(i)\r\n col.append(j)\r\n\r\nrow.sort()\r\ncol.sort()\r\ncnt = 0\r\ncheck = 0\r\nfor i in range(arr[0]):\r\n if i not in row:\r\n cnt += arr[1]\r\n check += 1\r\n\r\nfor i in range(arr[1]):\r\n if i not in col:\r\n cnt += (arr[0]- check)\r\n\r\nprint(cnt)", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom posixpath import split\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\n\r\n\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\ndef solve():\r\n n,m=map(int,input().split())\r\n a=[input() for i in range(n)]\r\n\r\n ans=0\r\n row=0\r\n for i in range(n):\r\n s=0\r\n for j in range(m):\r\n if(a[i][j]==\"S\"):\r\n s+=1\r\n if(not s):\r\n ans+=m\r\n row+=1\r\n \r\n col=0\r\n for i in range(m):\r\n s=0\r\n for j in range(n):\r\n if(a[j][i]==\"S\"):\r\n s+=1\r\n if(not s):\r\n ans+=(n-row)\r\n\r\n return ans\r\n# f.truncate(0)\r\n# for _ in range(int(input())):\r\n# # s=input()\r\n# # n=int(input())\r\n# f.write(f\"Case #{_+1}: {solve()}\\n\")\r\n# f.close()\r\n# print(solve())\r\n\r\nif __name__ == \"__main__\":\r\n # for _ in range(int(input())):\r\n print(solve())", "import sys\r\ninput = sys.stdin.readline\r\nins = lambda: input().rstrip()\r\nini = lambda: int(input().rstrip())\r\ninm = lambda: map(int, input().rstrip().split())\r\ninl = lambda: list(map(int, input().split()))\r\nout = lambda x, s='\\n': print(s.join(map(str, x)))\r\n\r\nr, c = inm()\r\ncol = [0] * c\r\ncount = 0\r\nfor _ in range(r):\r\n s = ins()\r\n for i in range(c):\r\n col[i] += 1 if s[i] == \".\" else -1\r\n if \"S\" not in s:\r\n count += c\r\nif r == count // c:\r\n print(count)\r\nelse:\r\n print(count + col.count(r) * (r - count//c))\r\n", "r,c = list(map(int,input().split()))\r\narr = []\r\nx,y = set(),set()\r\nfor i in range(r):\r\n a = input()\r\n for j in range(c):\r\n if a[j] == 'S':\r\n y.add(j)\r\n if 'S' in a:\r\n x.add(i)\r\n arr.append([j for j in a])\r\nans = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if arr[i][j] == '.' and (i not in x or j not in y):\r\n ans += 1\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Nov 19 21:18:28 2021\r\n\r\n@author: odraode\r\n\"\"\"\r\n\r\n\r\n'''\r\nTesto dell'esercizio su 'https://codeforces.com/problemset/problem/330/A' - diff 800\r\n'''\r\n\r\n\r\ndef countPieces(k):\r\n ris =0\r\n for i in range(len(k)):\r\n if(k[i]=='.'):\r\n ris+=1\r\n return ris\r\n\r\nr,c = input().split(' ')\r\nr = int(r)\r\nc = int(c)\r\nmatrix = [ [ 0 for i in range(c) ] for j in range(r) ]\r\nfor x in range(r):\r\n l = input()\r\n for y in range(c):\r\n # matrix[c][y]='S' if(l[y]=='S') else matrix[c][y]='.'\r\n if(l[y]=='S'): matrix[x][y]='S'\r\n else: matrix[x][y]='.'\r\n\r\nate = 0\r\nfor x in range(r):\r\n if('S' not in matrix[x]):\r\n ate+=c\r\n for y in range(c):\r\n matrix[x][y]=0\r\n\r\nfor x in range(c):\r\n l=[]\r\n for y in range(r):\r\n l.append(matrix[y][x])\r\n if('S' not in l):\r\n ate+=countPieces(l)\r\n\r\nprint(ate)\r\n \r\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 = list(map(int,input().split()))\r\narr = []\r\nx,y = set(),set()\r\nfor i in range(r):\r\n a = input()\r\n for j in range(c):\r\n if a[j] == 'S':\r\n y.add(j)\r\n x.add(i)\r\nprint(r*c - len(x)*len(y))", "r, c = map(int, input().split())\nl = [list(input()) for i in range(r)]\na = [1 for i in l if 'S' in i]\nb = [1 for i in zip(*l) if 'S' in i]\nr1 = len(a)\nr2 = len(b)\nprint(r * c - r1 * r2)\n\t \t\t\t\t \t\t\t\t\t\t \t \t\t \t\t", "n, m = map(int, input().split())\r\ncnt = 0\r\n\r\nseq = [list(input()) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if \"S\" not in seq[i] or \"S\" not in (el[j] for el in seq):\r\n seq[i][j] = \"0\"\r\n cnt += 1\r\n \r\nprint(cnt)\r\n", "m,n=map(int,input().split())\r\nl=[]\r\nl1=[]\r\nfor i in range(m):\r\n s=input()\r\n l1.append([0]*n)\r\n l.append(s)\r\ns1=0\r\nfor i in range(m):\r\n c=0\r\n for j in range(n):\r\n if(l[i][j]=='S'):\r\n c=1\r\n break\r\n if(c==0):\r\n for j in range(n):\r\n if(l1[i][j]==0):\r\n l1[i][j]=1\r\n s1+=1\r\nfor i in range(n):\r\n c=0\r\n for j in range(m):\r\n if(l[j][i]=='S'):\r\n c=1\r\n break\r\n if(c==0):\r\n for j in range(m):\r\n if(l1[j][i]==0):\r\n l1[j][i]=1\r\n s1+=1\r\nprint(s1)\r\n", "\r\nr,c = map(int,input().split());nulr=[];nulc=[];rows=columns=0\r\nmtx = [input() for _ in range(r)]\r\nfor i in range(r):\r\n for j in range(c):\r\n if mtx[i][j] != \".\":\r\n nulr.append(i);nulc.append(j)\r\nfor a in range(r):\r\n if a not in nulr:\r\n rows += 1\r\nfor b in range(c):\r\n if b not in nulc:\r\n columns += 1\r\nprint((rows*c + columns*r)-(rows*columns))\r\n", "m, n = map(int, input().split())\r\nrows = dict((i, True) for i in range(m))\r\ncols = dict((j, True) for j in range(n))\r\ngraph = [input() for _ in range(m)]\r\nfor i in range(m):\r\n for j in range(n):\r\n if graph[i][j] == 'S':\r\n rows[i] = False\r\n cols[j] = False\r\n\r\nans = 0\r\nfor i in range(m):\r\n for j in range(n):\r\n ans += cols[j] or rows[i]\r\n\r\nprint(ans)", "r,c=map(int,input().split())\r\nh=[]\r\nv=[]\r\nfor i in range(r):\r\n x=list(input())\r\n for j in range(c):\r\n if(x[j]=='S'):\r\n h.append(i)\r\n v.append(j)\r\nans=(r*c)-(len(list(set(h)))*len(list(set(v))))\r\nprint(ans)\r\n ", "r,c=[int(x) for x in input().split()]\r\narr1,arr2=[0]*c,[0]*r\r\nmatrix=[]\r\nfor i in range(r):\r\n row=input()\r\n for j in range(len(row)):\r\n if row[j]==\"S\":\r\n arr1[j]=1\r\n arr2[i]=1\r\n matrix.append(row)\r\ncount=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if matrix[i][j]==\".\":\r\n if (not arr1[j]) or (not arr2[i]):\r\n count+=1\r\nprint(count)\r\n", "# stepic Задача 1\r\n# N = int(input())\r\n# arr = []\r\n# s_arr = 0\r\n# for i in range(N):\r\n# help_arr = list(map(int, input().split()))\r\n# arr.append(help_arr)\r\n#\r\n# for i in range(N):\r\n# for j in range(N):\r\n# if i == j:\r\n# s_arr += arr[i][j]\r\n# print(s_arr)\r\n\r\n# n = int(input())\r\n# s = 0\r\n# for i in range(n):\r\n# s += int(input().split()[i])\r\n# print(s)\r\n\r\n# stepic Задача 2\r\n# N = int(input())\r\n# arr = []\r\n# for i in range(N):\r\n# arr.append(list(map(int, input().split())))\r\n# for j in range(N):\r\n# for i in range(N):\r\n# print(arr[i][j], end=' ')\r\n# print()\r\n#\r\n# n = int(input())\r\n# a = [input().split() for i in range(n)]\r\n# for y in range(len(a)):\r\n# for x in range(len(a[y])):\r\n# print(a[x][y], end=' ')\r\n# print()\r\n\r\n# stepic Задача 3\r\n# N = int(input())\r\n# a = [input().split() for i in range(N)]\r\n# for j in range(N - 1, -1, -1):\r\n# for i in range(N - 1, -1, -1):\r\n# print(a[i][j], end=' ')\r\n# print()\r\n\r\n# stepic Задача 4\r\n# N, M = map(int, input().split())\r\n# a = [input().split() for i in range(N)]\r\n# for i in range(N):\r\n# for j in range(len(a[i])-1, -1, -1):\r\n# print(a[i][j], end=' ')\r\n# print()\r\n\r\n# stepic Задача 5\r\n# N, M = map(int, input().split())\r\n# a = [input().split() for i in range(N)]\r\n# for i in range(N-1,-1,-1):\r\n# for j in range(len(a[i])):\r\n# print(a[i][j], end=' ')\r\n# print()\r\n\r\n# matrix = [list(map(int, input().split())) for i in range(5)]\r\n# stepic Задача 6\r\n# a = [input().split() for i in range(5)]\r\n# for i in range(len(a)):\r\n# for j in range(len(a[i])):\r\n# if a[i][j] == '1':\r\n# p = abs(i - 2) + abs(j - 2)\r\n# print(p)\r\n\r\n# stepic Задача 7\r\n# N, M = map(int, input().split())\r\n# matrix = [list(map(int, input().split())) for i in range(N)]\r\n# N_sum = [0]*N\r\n# M_sum = [0]*M\r\n# for i in range(N):\r\n# for j in range(M):\r\n# N_sum[i] = sum(matrix[i])\r\n# M_sum[j] += matrix[i][j]\r\n# print(*N_sum)\r\n# print(*M_sum)\r\n\r\n# stepic Задача 8\r\n# N = int(input())\r\n# matrix = [list(map(int, input().split())) for i in range(N)]\r\n# flag = 'Yes'\r\n# for i in range(N):\r\n# for j in range(N):\r\n# if matrix[i][j] != matrix[j][i]:\r\n# flag = 'No'\r\n# break\r\n# print(flag)\r\n\r\n# stepic Задача 9\r\n# N, M = map(int, input().split())\r\n# matrix = [list(map(int, input().split())) for i in range(N)]\r\n# max_sum = 0\r\n# str_sum = 0\r\n# for i in range(N):\r\n# if sum(matrix[i]) > max_sum:\r\n# max_sum = sum(matrix[i])\r\n# str_sum = i\r\n# print(max_sum)\r\n# print(str_sum)\r\n\r\n# stepic Задача 10\r\n# N, M = map(int, input().split())\r\n# matrix = [list(map(int, input().split())) for i in range(N)]\r\n# max_res = 0\r\n# count_max_res = 0\r\n# for i in range(N):\r\n# for j in range(M):\r\n# if matrix[i][j] > max_res:\r\n# max_res = matrix[i][j]\r\n# count_max_res = i, j\r\n# print(max_res)\r\n# print(*count_max_res)\r\n\r\n# stepic Задача 11\r\n# N, M = map(int, input().split())\r\n# matrix = [list(map(int, input().split())) for i in range(N)]\r\n# max_res = -1\r\n# count_max_res = 0\r\n# for i in range(N):\r\n# if max(matrix[i]) > max_res:\r\n# max_res = max(matrix[i])\r\n# count_max_res = i\r\n# elif max(matrix[i]) == max_res:\r\n# if sum(matrix[i]) > sum(matrix[count_max_res]):\r\n# count_max_res = i\r\n# print(count_max_res)\r\n\r\n# stepic Задача 12\r\n# N, M = map(int, input().split())\r\n# matrix = [list(map(int, input().split())) for i in range(N)]\r\n# max_res = -1\r\n# count_max_res = 0\r\n# for i in range(N):\r\n# if max(matrix[i]) > max_res:\r\n# max_res = max(matrix[i])\r\n# count_max_res = 1\r\n# elif max(matrix[i]) == max_res:\r\n# count_max_res += 1\r\n# print(count_max_res)\r\n#\r\n# n, m = map(int, input().split())\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n# x = [] # наилучший максимальный бросок, каждого спортсмена\r\n# for i in range(n):\r\n# x.append(max(a[i]))\r\n# print(x.count(max(x)))\r\n\r\n# stepic Задача 13\r\n# a = []\r\n# flag = 'Yes'\r\n# for i in range(4):\r\n# a.append([s for s in input().replace('', ' ').strip().split()])\r\n# for i in range(1, len(a)):\r\n# for j in range(1, len(a[i])):\r\n# if a[i][j] == a[i - 1][j] == a[i][j - 1] == a[i - 1][j - 1]:\r\n# flag = 'No'\r\n# print(flag)\r\n\r\n# stepic Задача 14\r\n# n, m = map(int, input().split())\r\n# a = []\r\n# b = []\r\n# count = 0\r\n# # a = [list(map(str, input())) for i in range(n)]\r\n# for i in range(n):\r\n# a.append([s for s in input().replace('', ' ').strip().split()])\r\n# input()\r\n# for i in range(n):\r\n# b.append([s for s in input().replace('', ' ').strip().split()])\r\n# for i in range(n):\r\n# for j in range(m):\r\n# if a[i][j] == b[i][j]:\r\n# count += 1\r\n# print(count)\r\n\r\n# stepic Задача 15\r\n# n, x = map(int, input().split())\r\n# a = []\r\n# count = 0\r\n# for i in range(1, n+1):\r\n# internal_a = []\r\n# for j in range(1, n+1):\r\n# k = i * j\r\n# internal_a.append(k)\r\n# if k == x:\r\n# count += 1\r\n# a.append(internal_a)\r\n# print(count)\r\n# for i in range(len(a)):\r\n# for j in range(len(a[i])):\r\n# print(a[i][j], end=' ')\r\n# print()\r\n\r\n# n, x = map(int, input().split())\r\n# a = []\r\n# for i in range(1, n + 1):\r\n# for j in range(1, n + 1):\r\n# a.append(i * j)\r\n# print(a.count(x))\r\n# stepic Задача 2.1\r\n# A. Матчи\r\n# n = int(input())\r\n# # a = [list(map(int, input().split())) for i in range(n)]\r\n# a = []\r\n# count = 0\r\n# for i in range(n):\r\n# b = list(map(int, input().split()))\r\n# a.append(b)\r\n# for i in range(n):\r\n# for j in range(i+1, n):\r\n# if i != j:\r\n# if a[i][0] == a[j][1] and a[i][1] == a[j][0]:\r\n# count += 2\r\n# elif a[i][0] == a[j][1] or a[i][1] == a[j][0]:\r\n# count += 1\r\n# print(count)\r\n# https://codeforces.com/problemset/problem/268/A\r\n\r\n# stepic Задача 2.2\r\n# N, M = map(int, input().split())\r\n# a = []\r\n# count = 0\r\n# for i in range(N):\r\n# a.append([s for s in input().replace('', ' ').strip().split()])\r\n# for i in range(N):\r\n# for j in range(M):\r\n# if a[i][j] == '.':\r\n# if i == 0:\r\n# if j == 0:\r\n# if a[i + 1][j] == '.' and a[i][j + 1] == '.':\r\n# count += 1\r\n# elif j < M - 1:\r\n# if a[i][j - 1] == '.' and a[i + 1][j] == '.' and a[i][j + 1] == '.':\r\n# count += 1\r\n# elif j == N - 1:\r\n# if a[i + 1][j] == '.' and a[i][j - 1] == '.':\r\n# count += 1\r\n# elif i < N - 1:\r\n# if j == 0:\r\n# if a[i + 1][j] == '.' and a[i][j + 1] == '.' and a[i - 1][j] == '.':\r\n# count += 1\r\n# elif j < M - 1:\r\n# if a[i][j - 1] == '.' and a[i + 1][j] == '.' and a[i][j + 1] == '.' and a[i - 1][j] == '.':\r\n# count += 1\r\n# elif j == N - 1:\r\n# if a[i + 1][j] == '.' and a[i][j - 1] == '.' and a[i - 1][j] == '.':\r\n# count += 1\r\n# elif i == N - 1:\r\n# if j == 0:\r\n# if a[i - 1][j] == '.' and a[i][j + 1] == '.':\r\n# count += 1\r\n# elif j < M - 1:\r\n# if a[i][j - 1] == '.' and a[i - 1][j] == '.' and a[i][j + 1] == '.':\r\n# count += 1\r\n# elif j == N - 1:\r\n# if a[i - 1][j] == '.' and a[i][j - 1] == '.':\r\n# count += 1\r\n# print(count)\r\n#\r\n# n, m = map(int, input().split())\r\n# a = [list(map(str, '.' + input() + '.')) for i in range(n)]\r\n# a.insert(0, '.' * (m + 2))\r\n# a.append('.' * (m + 2))\r\n# c = 0\r\n# for i in range(1, n + 1):\r\n# for j in range(1, m + 1):\r\n# if a[i][j] == a[i - 1][j] == a[i][j + 1] == a[i + 1][j] == a[i][j - 1]:\r\n# c += 1\r\n# print(c)\r\n\r\n# stepic Задача 2.3\r\n# n, m = map(int, input().split())\r\n# a = []\r\n# for i in range(n):\r\n# t = m * i\r\n# a_help= [s for s in range(t, m*(i+1))]\r\n# a.append(a_help)\r\n# if i % 2 != 0:\r\n# # a[i] = a[i][::-1]\r\n# a[i].reverse()\r\n# for i in range(len(a)):\r\n# for j in range(len(a[i])):\r\n# print(str(a[i][j]).rjust(3), end='')\r\n# print()\r\n\r\n# stepic Задача 2.4\r\n# # A. Фотографии Брейна\r\n# n, m = map(int, input().split())\r\n# a = [list(map(str, input().split())) for i in range(n)]\r\n# flag = 'B'\r\n# for i in range(n):\r\n# for j in range(m):\r\n# if a[i][j] in 'C' or a[i][j] == 'M' or a[i][j] == 'Y':\r\n# # if a[i][j] in 'CMY':\r\n# flag = 'C'\r\n# if flag == 'B':\r\n# print('#Black&White')\r\n# elif flag == 'C':\r\n# print('#Color')\r\n# # for i in range(len(a)):\r\n# # print(a[i])\r\n# https://codeforces.com/problemset/problem/707/A\r\n\r\n# # stepic Задача 2.5\r\n# def create_2d_arr2(m):\r\n# arr2d = []\r\n# for _ in range(m):\r\n# internal_arr = []\r\n# for _ in range(m):\r\n# internal_arr.append(0)\r\n# arr2d.append(internal_arr)\r\n# return arr2d\r\n#\r\n#\r\n# n = int(input())\r\n# a = create_2d_arr2(n)\r\n# # a = [[0] * n for i in range(n)]\r\n# number = 1\r\n# m = 0\r\n# a[n // 2][n // 2] = n * n\r\n#\r\n# for r in range(n // 2):\r\n# for i in range(n - m):\r\n# a[r][i + r] = number\r\n# number += 1\r\n# for i in range(r + 1, n - r):\r\n# a[i][-r - 1] = number\r\n# number += 1\r\n# for i in range(r + 1, n - r):\r\n# a[-r - 1][-i - 1] = number\r\n# number += 1\r\n# for i in range(r + 1, n - (r +1)):\r\n# a[-i-1][r]= number\r\n# number += 1\r\n# m += 2\r\n#\r\n# for i in a:\r\n# print(*i)\r\n'''\r\n3 4\r\nS...\r\n....\r\n..S.\r\n'''\r\n# stepic Задача 2.6\r\nn, m = map(int, input().split())\r\na = []\r\nt = count = 0\r\nflag = True\r\nfor i in range(n):\r\n a.append([s for s in input().replace('', ' ').strip().split()])\r\n\r\nfor i in range(n):\r\n if 'S' not in a[i]:\r\n t += 1\r\n count += len(a[i])\r\nfor i in range(m):\r\n flag = True\r\n for j in range(n):\r\n if a[j][i] == 'S':\r\n flag = False\r\n elif j == n-1 and flag:\r\n count += n - t\r\n# for i in range(n):\r\n# print(a[i])\r\nprint(count)\r\n\r\n\r\n", "r,c=map(int,input().split())\r\nj=[]\r\nk=0\r\nfor i in range(r):\r\n a=input()\r\n if 'S' not in a:\r\n k+=c\r\n a=a.replace('.','u')\r\n j.append(a)\r\nfor i in range(c):\r\n z=[]\r\n for t in range(r):\r\n z+=j[t][i]\r\n if 'S' not in z:\r\n k+=z.count('.')\r\nprint(k)", "r,c=map(int,input().split())\r\nrow=[0]*r\r\ncol=[0]*c\r\nfor i in range(r):\r\n s=input()\r\n for j in range(c):\r\n if s[j]=='S':\r\n row[i]=1 \r\n col[j]=1 \r\nans=0 \r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i]==0 or col[j]==0:\r\n ans+=1 \r\nprint(ans)", "r,c = map(int,input().split())\r\nr1 = r\r\nl = []\r\nwhile r1>0:\r\n s = input()\r\n l.append(s)\r\n r1-=1\r\ncnt1 = 0\r\ncnt2 = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if l[i][j] == 'S':\r\n cnt1+=1\r\n break\r\nfor i in range(c):\r\n for j in range(r):\r\n if l[j][i] == 'S':\r\n cnt2+=1\r\n break\r\nans = (r*c)-(cnt1*cnt2)\r\nprint(ans)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nmtx = [[0 for i in range(m)] for j in range(n)]\r\nfor i in range(n):\r\n s = str(input())\r\n for j in range(m):\r\n mtx[i][j] = (s[j])\r\ncake = 0\r\nfor i in range(n):\r\n count = 0\r\n for j in range(m):\r\n if mtx[i][j] == \"S\":\r\n count += 1\r\n if count == 0:\r\n for l in range(m):\r\n if mtx[i][l] == \".\":\r\n cake += 1\r\n mtx[i][l] = 0\r\nfor i in range(m):\r\n count = 0\r\n for j in range(n):\r\n if mtx[j][i] == \"S\":\r\n count += 1\r\n if count == 0:\r\n for l in range(n):\r\n if mtx[l][i] == \".\":\r\n cake += 1\r\n mtx[l][i] = 0\r\nprint(cake)", "'''330a cakeminator'''\r\nrow,col = [*map(int,input().split())]\r\neat = [0,0]; mat = []\r\nfor _ in range(row):\r\n x = input()\r\n eat[0]+=int('S' not in x)\r\n mat.append(x) \r\n \r\nfor x in zip(*mat):\r\n eat[1]+=int('S' not in x)\r\n\r\nprint(eat[0]*col + eat[1]*row - eat[0]*eat[1])\r\n ", "#import sys\r\n#input = sys.stdin.readline\r\nrows,columns=map(int,input().strip().split())\r\nmatrix=[[0 for x in range(columns)] for y in range(rows)]\r\n#print(matrix)\r\nfor i in range(rows):\r\n n=list(input())\r\n for j in range(len(n)):\r\n matrix[i][j]=n[j]\r\nk=0\r\nfor i in range(rows):\r\n c=0\r\n for j in range(columns):\r\n if matrix[i][j]!='S':\r\n c+=1\r\n if c==columns:\r\n for j in range(columns):\r\n k+=1\r\n matrix[i][j]='v'\r\n#print(matrix)\r\nfor i in range(columns):\r\n c=0\r\n for j in range(rows):\r\n #print(matrix[j][i])\r\n if matrix[j][i]!='S':\r\n c+=1\r\n if c==rows:\r\n for j in range(rows):\r\n if matrix[j][i]!='v':\r\n k+=1\r\nprint(k)\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "numRows, numCols = list(map(int, input().split(' ')))\r\ncake = []\r\nmaxCellsEaten = 0\r\n\r\nfor i in range(numRows):\r\n nextRowInput = input()\r\n nextRowToBuild = []\r\n for j in range(numCols):\r\n nextRowToBuild.append(nextRowInput[j])\r\n cake.append(nextRowToBuild)\r\n\r\nfor i in range(numRows):\r\n isNoStrawberries = True\r\n for j in range(numCols):\r\n if cake[i][j] == 'S':\r\n isNoStrawberries = False\r\n break\r\n if isNoStrawberries:\r\n for j in range(numCols):\r\n if cake[i][j] == '.':\r\n cake[i][j] = 0\r\n maxCellsEaten += 1\r\n\r\nfor i in range(numCols):\r\n isNoStrawberries = True\r\n for j in range(numRows):\r\n if cake[j][i] == 'S':\r\n isNoStrawberries = False\r\n break\r\n if isNoStrawberries:\r\n for j in range(numRows):\r\n if cake[j][i] == '.':\r\n cake[j][i] = 0\r\n maxCellsEaten += 1\r\nprint(maxCellsEaten)\r\n", "N, M = map(int,input().split())\r\nGrid = [input() for i in range(N)]\r\nrows, cols = set(), set()\r\nVisited = [[False for j in range(M)] for i in range(N)] # [[False]*M ]*N\r\nfor r in range(N):\r\n for c in range(M):\r\n if Grid[r][c] == 'S':\r\n rows.add(r); cols.add(c)\r\n\r\nfor r in range(N):\r\n if r not in rows:\r\n for c in range(M):\r\n Visited[r][c] = True\r\nfor c in range(M):\r\n if c not in cols:\r\n for r in range(N):\r\n Visited[r][c] = True\r\n #print(*Visited)\r\n\r\nmaxCells = sum([1 for i in range(N) for j in range(M) if Visited[i][j]])\r\nprint(maxCells)", "n, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n x = input()\r\n curr = []\r\n for j in x:\r\n if j == \"S\":\r\n curr += [-1]\r\n else:\r\n curr += [1]\r\n s += [curr]\r\nans = 0\r\nfor i in range(n):\r\n if -1 not in s[i]:\r\n for j in range(m):\r\n if s[i][j] == 1:\r\n ans += 1\r\n s[i][j] = 0\r\nfor col in range(m):\r\n there = -1 in map(lambda r: r[col], s)\r\n if not there:\r\n for i in range(n):\r\n if s[i][col] == 1:\r\n ans += 1\r\n s[i][col] = 0\r\nprint(ans)", "r, c = map(int, input().split())\r\nrows = [1] * r\r\ncols = [1] * c\r\n\r\nfor row in range(r):\r\n cells = input()\r\n for col, cell in enumerate(cells):\r\n if cell == 'S':\r\n rows[row] = 0\r\n cols[col] = 0\r\n\r\nresult = 0\r\noffset = 0\r\nfor row in rows:\r\n if row:\r\n offset -= 1\r\n result += c\r\n\r\nfor col in cols:\r\n if col:\r\n result += r + offset\r\n\r\nprint(result)", "r,c=list(map(int,input().split()))\nmatrix=[]\nstrawBerry=[]\nfor i in range(r):\n\tmatrix.append(list(input()))\n\tfor j,val in enumerate(matrix[-1]):\n\t\t#print(val,j)\n\t\tif val==\"S\":\n\t\t\tstrawBerry.append((i,j))\nhashSet=set(strawBerry)\nfor idx_i in range(len(strawBerry)):\n\tfor idx_j in range(idx_i+1,len(strawBerry)):\n\t\t#print(i,strawBerry[i])\n\t\ti=strawBerry[idx_i]\n\t\tj=strawBerry[idx_j]\n\t\tif (i[0],j[1]) not in hashSet:\n\t\t\thashSet.add((i[0],j[1]))\n\n\t\tif (j[0],i[1]) not in hashSet:\n\t\t\thashSet.add((j[0],i[1]))\n#print(hashSet,matrix)\nprint(r*c-len(hashSet))\n", "temp=input().split(\" \");\r\nr=int(temp[0]);\r\nc=int(temp[1]);\r\n\r\nr_data=[0]*r;\r\nc_data=[0]*c;\r\n\r\nfor i in range(r):\r\n temp=list(input())\r\n for j in range(0,c):\r\n if(temp[j]==\"S\"):\r\n c_data[j]=-1;\r\n r_data[i]=-1;\r\n else:\r\n if(c_data[j]>=0):\r\n c_data[j]+=1;\r\n if(r_data[i]>=0):\r\n r_data[i]+=1;\r\n\r\n\r\n\r\nsum=0;\r\ncount1=0;\r\ncount2=0;\r\nfor x in r_data:\r\n if(x>=0):\r\n sum+=x;\r\n count1+=1;\r\n\r\n\r\nfor x in c_data:\r\n if(x>=0):\r\n sum+=x;\r\n count2+=1;\r\n\r\nsum=sum-count1*count2;\r\n\r\n\r\nprint(sum);\r\n \r\n \r\n", "n,m=map(int,input().split())\r\na=[]\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n s=s.replace(\"S\",\"0\")\r\n s=s.replace(\".\",\"1\")\r\n b=list(s)\r\n a.append(b)\r\n if s.count(\"1\")==m:\r\n c+=1\r\ncount=c*m\r\nfor i in range(m):\r\n z=0\r\n for j in range(n):\r\n if a[j][i]==\"1\":\r\n z+=1\r\n else:\r\n z=0\r\n break\r\n if z!=0:\r\n count+=z-c\r\nprint(count)", "r, c = map(int, input().split())\r\n\r\nx = r * [0]\r\ny = c * [0]\r\n\r\nfor i in range(r):\r\n s = input()\r\n for j in range(c):\r\n if (s[j] == 'S'):\r\n x[i] = 1\r\n y[j] = 1\r\n\r\na = x.count(1)\r\nb = y.count(1)\r\n\r\nprint(r * c - a * b)\r\n\r\n\r\n", "r,c = map(int,input().split())\r\nmat = []\r\nfor i in range(r):\r\n mat.append(list(str(input())))\r\n\r\nrr,cc = set(),set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if mat[i][j] == \"S\":\r\n rr.add(i)\r\n cc.add(j)\r\nprint(r*c - len(rr)*len(cc))", "q, w = list(map(int, input().split()))\r\na = []\r\nb = 0\r\nfor i in range(q):\r\n a.append(list(input()))\r\nfor i in range(q):\r\n for j in range(w):\r\n if 'S' in a[i]:\r\n break\r\n if 'S' not in a[i]:\r\n a[i] [j] = '+'\r\nfor j in range(w):\r\n S = False\r\n for i in range(q):\r\n if 'S' in a[i] [j]:\r\n S = True\r\n break\r\n if not S:\r\n for i in range(q):\r\n a[i] [j] = '+'\r\nfor i in range(q):\r\n for j in range(w):\r\n if a[i] [j] == '+':\r\n b+=1\r\nprint(b)", "#инициализация торта\r\nr, c = map(int, input().split())\r\ntort = []\r\nfor i in range(r):\r\n tort.append(input().replace('',' ').split())\r\n#инициализация торта\r\n#пробег по строкам\r\ncount = 0\r\nfor i in range(r):\r\n if 'S' in tort[i]:\r\n continue\r\n else:\r\n for j in range(c):\r\n if tort[i][j] == '.':\r\n tort[i][j] = ' '\r\n count += 1\r\n#пробег по строкам\r\n#пробег по столбцам\r\nfor j in range(c):\r\n localcount = 0\r\n logical = True\r\n for i in range(r):\r\n if logical:\r\n if tort[i][j] == 'S':\r\n logical = False\r\n localcount = 0\r\n elif tort[i][j] == '.':\r\n tort[i][j] = ' '\r\n localcount += 1\r\n count += localcount\r\n#пробег по столбцам\r\nprint(count)", "r,c=map(int,input().split())\r\nm=[]\r\nfor i in range(r):\r\n s=input()\r\n l=list(s)\r\n m.append(l)\r\nans=0\r\nfor i in range(r):\r\n e=0\r\n for j in range(c):\r\n if(m[i][j]=='S'):\r\n e=1\r\n if(e==0):\r\n for j in range(c):\r\n m[i][j]='1'\r\n ans=ans+1\r\nfor i in range(c):\r\n e=0\r\n for j in range(r):\r\n if(m[j][i]=='S'):\r\n e=1\r\n if(e==0):\r\n for j in range(r):\r\n if(m[j][i]!='1'):\r\n m[j][i]='1'\r\n ans=ans+1\r\nprint(ans)", "cake = []\r\nr,c=map(int, input().split())\r\neaten=[]\r\nbc=[]\r\nfor i in range(r):\r\n row=input()\r\n if \"S\" in row :\r\n cake.append(list(row))\r\n for s in range(c):\r\n if row[s]==\"S\":\r\n bc.append(s)\r\n else:\r\n cake.append(list(row))\r\n for j in range(c):\r\n eaten.append([i,j])\r\nfor k in range(c):\r\n if k in bc:\r\n continue\r\n else:\r\n for z in range(r):\r\n eaten.append([z,k])\r\n \r\ncop=[]\r\nfor zb in eaten:\r\n if eaten.count(zb)==1:\r\n cop.append(zb)\r\n elif not (zb in cop):\r\n cop.append(zb)\r\n \r\nprint(len(cop))", "a,b=map(int,input().split())\r\nc=0;s1,s2=set(),set()\r\nfor i in range(a):\r\n x=input()\r\n for j in range(len(x)):\r\n if x[j]==\"S\":\r\n s1.add(i)\r\n s2.add(j)\r\nprint(a*b-len(s1)*len(s2)) \r\n \r\n\r\n", "cases, b = map(int, input().split())\r\na = cases\r\ncake = []\r\n\r\nwhile cases:\r\n cases -= 1\r\n s = input()\r\n cake.append(list(s))\r\n\r\nnew_arr = list(zip(*cake))\r\n# print(cake)\r\n# print(new_arr)\r\n\r\ncol = 0\r\nrow = 0\r\n\r\nfor i in cake:\r\n if i.count(\"S\") == 0:\r\n col += 1\r\n\r\nfor i in new_arr:\r\n if i.count(\"S\") == 0:\r\n row += 1\r\n\r\nres = col * b + row * a - (col*row)\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "r,c = (map(int,input().split()))\r\nb = []\r\nk = []\r\nfor i in range(r) :\r\n baris = input()\r\n for j in range(c) :\r\n if baris[j]== \"S\" :\r\n b.append(i)\r\n k.append(j)\r\nb = set(b)\r\nk = set(k)\r\nans = (r-len(b))*c+(c-len(k))*(len(b))\r\nprint(ans)\r\n \r\n", "r,c=map(int,input().split())\r\nl=[[0]*c for i in range(r)]\r\n# print(l)\r\ns=[]\r\nfor i in range(r):\r\n\ta=input()\r\n\ts.append(a)\r\n# print(s)\r\nans=0\r\nfor i in range(r):\r\n\tp=0\r\n\tfor j in range(c):\r\n\t\tif(s[i][j]==\".\"):\r\n\t\t\tp+=1\r\n\tif(p==c):\r\n\t\tfor j in range(c):\r\n\t\t\tl[i][j]=1\r\n\t\t\tans+=1\r\n\t\t\tp=0\r\n# print(l)\r\nk=[]\r\n\r\nfor i in range(r):\r\n\tm=[]\r\n\tfor j in range(c):\r\n\t\tm.append(s[i][j])\r\n\tk.append(m)\r\n# print(k)\r\nfor i in range(c):\r\n\tp=0\r\n\tfor j in range(r):\r\n\t\tif(k[j][i]==\".\"):\r\n\t\t\tp+=1\r\n\tif(p==r):\r\n\t\tfor j in range(r):\r\n\t\t\tif(l[j][i]==0):\r\n\t\t\t\tl[j][i]+=1\r\n\t\t\t\tans+=1\r\n\t\t\telse:\r\n\t\t\t\tl[j][i]=1\r\n\t\tp=0\r\n\r\n\r\n\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\ns = ''\r\nsm = 0\r\nfor _ in range(n):\r\n temp = input().strip()\r\n if 'S' in temp:\r\n s += temp\r\n else:\r\n sm += len(temp)\r\n n -= 1\r\n\r\nfor i in range(m):\r\n sm += ('S' not in s[i::m]) * n\r\n\r\nprint(sm)\r\n", "rows, columns = [int(i) for i in input().split()]\r\nmat, row_index, col_index = [],[],[]\r\nfor index_1, r in enumerate(range(rows)):\r\n tmp = []\r\n for index_2, c in enumerate(input()):\r\n if c=='S':\r\n row_index.append(index_1)\r\n col_index.append(index_2)\r\n tmp.append(c)\r\n mat.append(tmp)\r\n\r\nrow, column, ans = 0,0,0\r\nfor i in range(columns):\r\n if i in col_index:\r\n continue\r\n else:\r\n for j in range(rows):\r\n mat[j][i] = 1\r\n ans += 1\r\nfor i in range(rows):\r\n if i in row_index:\r\n continue\r\n else:\r\n for j in range(columns):\r\n if mat[i][j] != 1:\r\n ans += 1\r\nprint(ans)", "import math as m\r\n#from math import comb as nCr\r\nt=input\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=map(int,t().split())\r\n a=list(map(int,t().split()))\r\n'''\r\n\r\nr,c=map(int,t().split())\r\nk=[t() for y in range(r)]\r\nrr=len([1 for i in k if 'S' in i])\r\ncc=len([1 for i in zip(*k) if 'S' in i])\r\nprint(r*c - rr*cc)", "r,c = map(int, input().split())\r\ngrid = [list(input()) for _ in range(r)]\r\nrows,cols = set(),set()\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j]=='S':\r\n rows.add(i)\r\n cols.add(j)\r\n\r\nprint(r*c-len(cols)*len(rows))", "r, c = list(map(int, input().split()))\nsr, sc = 0, 0\nsc_count = set()\nfor _ in range(r):\n row = input()\n if 'S' in row:\n sr += 1\n for i, cell in enumerate(row):\n if cell == 'S':\n sc_count.add(i)\nsc = len(sc_count)\nprint(c * (r - sr) + sr * (c - sc))\n", "r, c = map(int, input().split())\r\ncake = []\r\nfor _ in range(r):\r\n row = input()\r\n cake.append(row)\r\nsafe_rows = sum(1 for row in cake if 'S' not in row)\r\nsafe_cols = sum(1 for j in range(c) if all(cake[i][j] != 'S' for i in range(r)))\r\nmax_cells_eaten = safe_rows * c + safe_cols * r - safe_rows * safe_cols\r\nprint(max_cells_eaten)\r\n", "H, W = input().split()\r\nW = int(W)\r\nH = int(H)\r\n\r\ncake = [list(input()) for i in range(H)]\r\n\r\n# print(cake)\r\n\r\nSLen = 0\r\nEatables = 0\r\n\r\nfor i in range(H):\r\n try:\r\n var = cake[i].index(\"S\")\r\n except ValueError:\r\n SLen += 1\r\n\r\nfor j in range(W):\r\n for i in range(H):\r\n if cake[i][j] == \"S\":\r\n break\r\n else:\r\n Eatables += H - SLen\r\n\r\nprint(SLen * W + Eatables)\r\n", "r, c = map(int, input().split())\r\ns_r = set()\r\ns_c = set()\r\nt = 0\r\nt_r = 0\r\nfor i in range(r):\r\n s = input()\r\n for j in range(c):\r\n if s[j] == \"S\":\r\n if i not in s_r:\r\n s_r.add(i)\r\n t_r += 1\r\n s_c.add(j)\r\nfor i in range(r):\r\n if i not in s_r:\r\n t += c\r\nfor j in range(c):\r\n if j not in s_c:\r\n t += t_r\r\nprint(t)\r\n", "r,c = list(map(int, input().split()))\r\nrow,col = [0]*11,[0]*11\r\nans=0\r\n\r\nfor i in range(r):\r\n s = input()\r\n \r\n for j in range(c):\r\n if s[j]=='S':\r\n row[i]=1\r\n col[j]=1\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i]==0 or col[j]==0:\r\n ans+=1\r\n \r\nprint(ans)", "row, column = [0]*11, [0]*11\r\n\r\nr, c = map(int, input().split())\r\n\r\nfor i in range(r):\r\n s = list(input())\r\n for j in range(c):\r\n if s[j] == \"S\":\r\n row[i] = 1\r\n column[j] = 1\r\n\r\ncnt = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i] == 0 or column[j] == 0:\r\n cnt += 1\r\nprint(cnt)", "n,m = map(int, input().split()) \r\ns = [] \r\nfor i in range(n):\r\n s.append(input()) \r\n \r\ncount_strok = 0 \r\ncount_stolb = 0 \r\n\r\nfor i in range(n): \r\n if 'S' not in s[i]: \r\n count_strok += 1 \r\n \r\nfor i in range(m): \r\n s1 = [] \r\n for j in range(n): \r\n s1.append(s[j][i]) \r\n \r\n if 'S' not in s1: \r\n count_stolb += 1 \r\n \r\nprint(count_strok * m + count_stolb * (n - count_strok))", "row, col = map(int, input(). split())\r\ntab = [[i for i in input()] for j in range(row)]\r\nnum_row = num_col = 0\r\ntab_2 =[]\r\nfor ind, i in enumerate(tab):\r\n if 'S' not in i:\r\n num_row += len(i)\r\n else:\r\n tab_2. append(i)\r\ntmp = 0\r\nif len(tab_2) == 0:\r\n print(num_row)\r\nelse:\r\n for i in range(len(tab_2[0])):\r\n if tmp == 1:\r\n num_col += len(tab_2)\r\n tmp = 0\r\n for j in range(len(tab_2)):\r\n if tab_2[j][i] == 'S':\r\n tmp = 0\r\n break\r\n tmp = 1\r\n if tmp == 1:\r\n num_col += len(tab_2)\r\n print(num_row + num_col)\r\n", "r, c = map(int, input().split())\r\ncan_eat_row = [True] * r\r\ncan_eat_col = [True] * c\r\nfor i in range(r):\r\n row = input()\r\n for j in range(c):\r\n if row[j] == 'S':\r\n can_eat_row[i] = False\r\n can_eat_col[j] = False\r\nnum_cannot_eat = sum(1 for i in range(r) for j in range(c) if not can_eat_row[i] and not can_eat_col[j])\r\nnum_cells = r * c - num_cannot_eat\r\nprint(num_cells)\r\n", "r,c=map(int,input().split())\r\nl=[]\r\nfor i in range(r):\r\n s=input()\r\n l.append(s)\r\nansr=0\r\nfor i in range(r):\r\n cnt=0\r\n for j in range(c):\r\n if l[i][j]==\".\":\r\n cnt+=1\r\n if cnt==c:\r\n ansr+=1\r\nansc=0\r\nfor i in range(c):\r\n cnt=0\r\n for j in range(r):\r\n if l[j][i]==\".\":\r\n cnt+=1\r\n if cnt==r:\r\n ansc+=1\r\nprint(ansr*c+ansc*r-ansr*ansc)\r\n \r\n\r\n", "# 330A - Cakeminator\r\n[r, c], g, p, l, m = list(map(int, input().split())), [], 0, [], 0\r\nfor i in range(r):\r\n g.append(input())\r\n if g[i].count(\"S\") == 0:\r\n p += c\r\n m += 1\r\n else:\r\n k = 0\r\n for j in range(c):\r\n if g[i][j] == \"S\":\r\n l.append(j)\r\n k += 1\r\n if k == g[i].count(\"S\"):\r\n break\r\nn = r-m\r\nfor i in range(c):\r\n if i not in l:\r\n p += n\r\nprint(p)\r\n", "r, c = list(map(int, input().split()))\r\nst = set()\r\ncount = 0\r\ncc = 0\r\nfor _ in range(r):\r\n\ts = list(input())\r\n\tif 'S' not in s:\r\n\t\tcount += len(s)\r\n\t\tcc += 1\r\n\telse:\r\n\t\tfor i in range(c):\r\n\t\t\tif s[i] == 'S':\r\n\t\t\t\tst.add(i)\r\na = (c - len(st)) * (r - cc)\r\ncount += a\r\nprint(count)", "\r\nr,c=map(int,input().split())\r\narr=[]\r\nfor i in range(r):\r\n arr.append(input()) #input\r\nrow=[0]*r\r\ncolumn=[0]*c\r\nfor i in range(r):\r\n for j in range(c):\r\n if arr[i][j]=='S':\r\n row[i]=1\r\n column[j]=1\r\ncake=0 \r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i]==0 or column[j]==0:\r\n cake+=1\r\nprint(cake)\r\n ", "r, c = map(int, input().split())\r\n\r\ncake = []\r\nrow_empty = [True] * r\r\ncol_empty = [True] * c\r\n\r\n\r\nfor i in range(r):\r\n row = input()\r\n cake.append(row)\r\n for j in range(c):\r\n if row[j] == 'S':\r\n row_empty[i] = col_empty[j] = False\r\n\r\nmax_cake = 0\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if row_empty[i] or col_empty[j]:\r\n max_cake += 1\r\n\r\nprint(max_cake)\r\n\r\n\r\n", "r,c = map(int,input().split())\r\narr = []\r\ncount_r, count_c = 0,0\r\nfor i in range(r):\r\n string = input()\r\n brr = []\r\n for i in string:\r\n brr.append(i)\r\n arr.append(brr)\r\nfor i in range(r):\r\n if 'S' not in arr[i]:\r\n count_r += 1\r\nfor i in range(c):\r\n for i2 in range(r):\r\n if arr[i2][i] == 'S':\r\n break\r\n else:\r\n count_c += 1\r\nprint(count_r*c + count_c*r - count_r*count_c)", "n, m = map(int, input().split())\r\nl_1 = [0] * n\r\nl_2 = [0] * m\r\nk = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == \"S\":\r\n l_1[i] = 1\r\n l_2[j] = 1\r\nprint(n * m - l_1.count(1) * l_2.count(1))", "n,m = [int(i) for i in input().split()]\r\n\r\ncake = []\r\neatenBlocks = 0\r\neatenRows = 0\r\n\r\nfor k in range(0, n):\r\n cake.append(input())\r\n\r\n if \"S\" not in cake[k]:\r\n eatenBlocks += m\r\n eatenRows += 1\r\n\r\n\r\nfor j in range(0,m):\r\n canEat = False\r\n for i in range(0,n):\r\n if cake[i][j] != \"S\":\r\n canEat = True\r\n else:\r\n canEat = False\r\n break\r\n if canEat == True:\r\n \r\n eatenBlocks += n-eatenRows\r\n\r\n canEat = False\r\n\r\nprint(eatenBlocks)", "def cellsToConsume(matrix):\r\n columnsToConsume = 0\r\n for i in range(len(matrix)):\r\n strawberryFound = False\r\n for j in range(len(matrix[0])):\r\n if matrix[i][j] == 'S':\r\n strawberryFound = True\r\n break\r\n if not strawberryFound:\r\n columnsToConsume += 1\r\n rowsToConsume = 0\r\n for j in range(len(matrix[0])):\r\n strawberryFound = False\r\n for i in range(len(matrix)):\r\n if matrix[i][j] == 'S':\r\n strawberryFound = True\r\n break\r\n if not strawberryFound:\r\n rowsToConsume += 1\r\n return (len(matrix)) * (rowsToConsume) + (len(matrix[0]) - rowsToConsume) * columnsToConsume\r\n\r\nn, m = map(int, input().split())\r\nmatrix = []\r\nfor _ in range(n):\r\n matrix.append(input())\r\nprint(cellsToConsume(matrix))", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\nb = []\r\nfor i in range(len(a)):\r\n if 'S' not in a[i]:\r\n for j in range(m):\r\n b.append([i, j])\r\nfor i in range(m):\r\n flag = 0\r\n for j in range(n):\r\n if a[j][i] == 'S':\r\n flag = 1\r\n break\r\n if flag != 1:\r\n for j in range(n):\r\n b.append([j, i])\r\nc=[]\r\nfor i in range(len(b)):\r\n if b[i] not in c:\r\n c.append(b[i])\r\nprint(len(c))\r\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nh = [0 for i in range(n)]\r\nv = [0 for i in range(m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'S':\r\n h[i] = 1\r\n v[j] = 1\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '.' and not(h[i]*v[j]):\r\n ans += 1\r\nprint(ans)\r\n", "row, column = map(int, input().split())\r\nrow_store = dict()\r\ncolumn_store = dict()\r\nfor index in range(row):\r\n for index1, character in enumerate(list(input())):\r\n if character == 'S':\r\n row_store[index] = 1\r\n column_store[index1] = 1\r\n\r\ncount_row = 0\r\ntotal = 0\r\nfor index in range(row):\r\n if index not in row_store:\r\n total += column\r\n count_row += 1\r\n\r\nfor index in range(column):\r\n if index not in column_store:\r\n total += row - count_row\r\n\r\nprint(total)", "r,c=map(int,input().split())\r\nrow=[0]*11\r\ncol=[0]*11\r\nfor i in range(r):\r\n ch = input()\r\n for j in range(c):\r\n if ch[j]=='S':\r\n row[i]=1\r\n col[j]=1\r\n\r\ncakes=0\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if row[i]==0 or col[j]==0:\r\n cakes+=1\r\nprint(cakes)\r\n ", "n, m = (int(i) for i in input().split())\r\na = ['0'] * 0\r\nrow = [0] * n\r\ncolumn = [0] * m\r\nfor i in range(n):\r\n a.append(input())\r\n for j in range(m):\r\n if a[i][j] == 'S':\r\n row[i] = 1\r\n column[j] = 1\r\nr = 0\r\nc = 0\r\nfor i in range(n):\r\n if row[i] == 0:\r\n r += 1\r\nfor i in range(m):\r\n if column[i] == 0:\r\n c += 1\r\nprint(r * m + c * n - r * c)\r\n\r\n", "# # ----- Транспортирование 1 ----\r\n# n = int(input())\r\n# a = []\r\n# for i in range(n):\r\n# a.append(list(map(int, input().split())))\r\n\r\n# for i in range(n):\r\n# k = []\r\n# for j in range(n):\r\n# k.append(a[j][i])\r\n# print(*k)\r\n\r\n# # ----- Транспортирование 2 ----\r\n# n = int(input())\r\n# a = []\r\n# for i in range(n):\r\n# a.append(list(map(int, input().split())))\r\n\r\n# for i in range(n - 1, -1, -1):\r\n# k = []\r\n# for j in range(n - 1, -1, -1):\r\n# k.append(a[j][i])\r\n# print(*k)\r\n\r\n# # ----- Транспортирование 3 ----\r\n# n, m = map(int, input().split())\r\n# a = []\r\n# for i in range(n):\r\n# a.append(list(map(int, input().split())))\r\n# print()\r\n# for i in range(n):\r\n# k = []\r\n# for j in range(m - 1, -1, -1):\r\n# k.append(a[i][j])\r\n# print(*k)\r\n\r\n# # ----- Красивая матрица ----\r\n# a = []\r\n# for i in range(5):\r\n# a.append(list(map(int, input().split())))\r\n\r\n# for i in range(5):\r\n# for j in range(5):\r\n# if a[i][j] == 1:\r\n# row = i\r\n# column = j\r\n# print(abs(2 - row) + abs(2 - column))\r\n\r\n\r\n# # ----- Транспортирование 4 ----\r\n# n, m = map(int, input().split())\r\n# a = []\r\n# for i in range(n):\r\n# a.append(list(map(int, input().split())))\r\n# for i in range(n - 1, -1, -1):\r\n# print(*a[i])\r\n\r\n\r\n# # ----- Сумма главной диагонали ----\r\n# n = int(input())\r\n# a = []\r\n# for i in range(n):\r\n# \ta.append(list(map(int, input().split())))\r\n# # # -- 1st ---\r\n# # s = 0\r\n# # for i in range(n):\r\n# # \ts += a[i][i]\r\n# # print(s)\r\n\r\n# # -- 2st ---\r\n# print(sum(a[i][i] for i in range(n)))\r\n\r\n\r\n# # ---- Двумерный массив ---\r\n# n, m = map(int, input().split())\r\n# a = []\r\n# for i in range(n):\r\n# a.append(list(map(int, input().split())))\r\n\r\n# for i in range(n):\r\n# print(sum(i for i in a[i]), end=' ')\r\n\r\n# print()\r\n\r\n# for j in range(m):\r\n# \tb = 0\r\n# \tfor i in range(n):\r\n# \t\tb += a[i][j]\r\n# \tprint(b, end=' ')\r\n\r\n# print('\\n')\r\n\r\n# for i in a:\r\n# \tprint(*i)\r\n\r\n# # ---- Сумма матриц ---\r\n# n, m = map(int, input().split())\r\n\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# input()\r\n\r\n# b = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# for i in range(n):\r\n# \tc = []\r\n# \tfor j in range(m):\r\n# \t\tc.append(a[i][j] + b[i][j])\r\n# \tprint(*c)\r\n\r\n\r\n# from time import *\r\n# # ---- Произведение матриц ---\r\n# n, m, p = map(int, input().split())\r\n# st = time()\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n# # a = list()\r\n# # for i in range(n):\r\n# # a.append([int(j) for j in input().split()])\r\n# input()\r\n#\r\n# b = [list(map(int, input().split())) for s in range(n)]\r\n# # b = list()\r\n# # for i in range(n):\r\n# # b.append([int(j) for j in input().split()])\r\n# for i in range(n):\r\n# for k in range(p):\r\n# pr = []\r\n# for j in range(m):\r\n# pr.append(a[i][j] * b[j][k])\r\n# print(sum(pr), end=' ')\r\n# print()\r\n# print(time() - st)\r\n\r\n# # ---- Семетрична ли матрица ---\r\n# n = int(input('Size: '))\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# b = []\r\n\r\n# for i in range(n):\r\n# \tc = []\r\n# \tfor j in range(n):\r\n# \t\tc += [a[j][i]]\r\n# \tb += [c]\r\n# if a == b:\r\n# \tprint('yes')\r\n# else:\r\n# \tprint('no')\r\n\r\n\r\n# # ---- Семетрична ли матрица ---\r\n# n = int(input())\r\n# a = [list(map(int, input().split())) for k in range(n)]\r\n\r\n# i = 0\r\n# while i < n:\r\n# for j in range(n):\r\n# if a[i][j] != a[j][i]:\r\n# i = n\r\n# print('no')\r\n# break\r\n# if i == n - 1 and j == n - 1:\r\n# print('yes')\r\n# i += 1\r\n\r\n\r\n# # --- Состязания - 1 ---\r\n# n, m = map(int, input().split())\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# sum_score = []\r\n# for i in range(n):\r\n# \tsum_score.append(sum(a[i]))\r\n\r\n# max_score = max(sum_score)\r\n\r\n# print(max_score, sum_score.index(max_score), sep='\\n')\r\n\r\n\r\n# # --- Состязания - 2 ---\r\n# n, m = map(int, input().split())\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# max_stroka = []\r\n\r\n# for i in a:\r\n# \tmax_stroka.append(max(i))\r\n\r\n# print(max(max_stroka))\r\n# print(max_stroka.index(max(max_stroka)), a[max_stroka.index(max(max_stroka))].index(max(max_stroka)))\r\n\r\n\r\n# # --- Состязания - 3 ---\r\n# n, m = map(int, input().split())\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# max_score = 0\r\n# max_sum_stroka = 0\r\n# igrok = 0\r\n\r\n# for i in range(n):\r\n# \tif max(a[i]) > max_score:\r\n# \t\tmax_score = max(a[i])\r\n# \t\tmax_sum_stroka = sum(a[i])\r\n# \t\tigrok = i\r\n# \tif max(a[i]) == max_score and sum(a[i]) > max_sum_stroka:\r\n# \t\tmax_sum_stroka = sum(a[i])\r\n# \t\tigrok = i\r\n\r\n# print(igrok)\r\n\r\n# # --- Миша и негатив ---\r\n# n, m = map(int, input().split())\r\n\r\n# a = [input() for i in range(n)]\r\n\r\n# input()\r\n\r\n# b = [input() for i in range(n)]\r\n\r\n# errors = 0\r\n\r\n# for row in range(n):\r\n# for column in range(m):\r\n# if a[row][column] == b[row][column]:\r\n# errors += 1\r\n# print(errors)\r\n\r\n# # --- A. Матчи ---\r\n# n = int(input())\r\n\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# count = 0\r\n\r\n# for i in range(n):\r\n# \tfor j in range(n):\r\n# \t\tif i != j and a[i][0] == a[j][1]:\r\n# \t\t\tcount += 1\r\n# print(count)\r\n\r\n# # --- Весёлая шутка ---\r\n# h = input()\r\n# g = input()\r\n# l = input()\r\n\r\n# hg = h + g\r\n\r\n# letters = []\r\n# host_gest = []\r\n\r\n# for i in l:\r\n# \tletters.append(i)\r\n# letters.sort()\r\n\r\n# for i in hg:\r\n# \thost_gest.append(i)\r\n# host_gest.sort()\r\n\r\n# if host_gest == letters:\r\n# \tprint('YES')\r\n# else:\r\n# \tprint('NO')\r\n\r\n\r\n# # --- Состязания - 4 ---\r\n# n, m = map(int, input().split())\r\n\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# count = 0\r\n# max_score = 0\r\n# for i in a:\r\n# \tif max(i) > max_score:\r\n# \t\tmax_score = max(i)\r\n# \t\tcount = 1\r\n# \t\tcontinue\r\n# \tif max(i) == max_score:\r\n# \t\tcount += 1\r\n\r\n# print(count)\r\n\r\n\r\n# # --- Морской бой - 2 ---\r\n# n, m = map(int, input().split())\r\n\r\n# mas = list()\r\n# mas.append('.' * (m + 2))\r\n# for i in range(n):\r\n# row = '.' + input() + '.'\r\n# mas.append(row)\r\n# mas.append('.' * (m + 2))\r\n\r\n# count = 0\r\n# for i in range(1, n + 1):\r\n# for j in range(1, m + 1):\r\n# if mas[i][j] == '.' and mas[i][j + 1] == '.' and mas[i][j - 1] == '.' and mas[i + 1][j] == '.' \\\r\n# and mas[i - 1][j] == '.':\r\n# count += 1\r\n# print(count)\r\n\r\n\r\n# # --- Карты ---\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\n# in_used = []\r\n# count = sum(a) / (n / 2)\r\n\r\n# for i in range(n - 1):\r\n# sum_card = 0\r\n# if i in in_used:\r\n# continue\r\n# for j in range(i + 1, n):\r\n# if j in in_used:\r\n# continue\r\n# sum_card = a[i] + a[j]\r\n# if sum_card == count:\r\n# print(i + 1, j + 1)\r\n# in_used += [i] + [j]\r\n# break\r\n\r\n\r\n# # --- Заполнение змейкой ---\r\n# n, m = map(int, input().split())\r\n# k = 0\r\n# s = m\r\n# for i in range(n):\r\n# if i % 2 == 0:\r\n# a = [j for j in range(k, s)]\r\n# k = s\r\n# s += m\r\n# print(*a)\r\n# else:\r\n# a = [j for j in range(k, s)]\r\n# k = s\r\n# s += m\r\n# a.reverse()\r\n# print(*a)\r\n\r\n\r\n# # --- Фотографии ---\r\n# n, m = map(int, input().split())\r\n\r\n# a = ''\r\n# for i in range(n):\r\n# \ta += input().replace(' ', '')\r\n\r\n# if 'C' in a or 'M' in a or 'Y' in a:\r\n# \tprint('#Color')\r\n# else:\r\n# \tprint('#Black&White')\r\n\r\n# # --- Спираль ---\r\n# n = int(input())\r\n# mas = list([0] * n for i in range(n))\r\n# x = 0\r\n# y = -1\r\n# move_x = 0\r\n# move_y = 1\r\n# number = 1\r\n# while number <= n ** 2:\r\n# if 0 <= x + move_x < n and 0 <= y + move_y < n and mas[x + move_x][y + move_y] == 0:\r\n# x += move_x\r\n# y += move_y\r\n# mas[x][y] = number\r\n# number += 1\r\n# else:\r\n# if move_y == 1:\r\n# move_x = 1\r\n# move_y = 0\r\n# elif move_x == 1:\r\n# move_x = 0\r\n# move_y = -1\r\n# elif move_y == -1:\r\n# move_x = -1\r\n# move_y = 0\r\n# elif move_x == -1:\r\n# move_x = 0\r\n# move_y = 1\r\n# for row in mas:\r\n# print(*row)\r\n\r\n# # --- Спираль (моё решение) ---\r\n# n = int(input())\r\n\r\n# mas = list([0] * n for i in range(n))\r\n\r\n# x = 0\r\n# y = -1\r\n# k = 1\r\n# while n > 0:\r\n# for y in range(y + 1, y + 1 + n):\r\n# mas[x][y] = k\r\n# k += 1\r\n# for x in range(x + 1, x + n):\r\n# mas[x][y] = k\r\n# k += 1\r\n# n -= 1\r\n# for y in range(y - 1, y - 1 - n, -1):\r\n# mas[x][y] = k\r\n# k += 1\r\n# n -= 1\r\n# for x in range(x - 1, x - 1 - n, -1):\r\n# mas[x][y] = k\r\n# k += 1\r\n# for row in mas:\r\n# print(*row)\r\n# # print('\\t'.join(map(str, row)))\r\n\r\n\r\n# #n - размерность матрицы n x n\r\n# #mat - результирующая матрица\r\n# #st - текущее значение-счетчик для записи в матрицу\r\n# #m - коеффициент, используемый для заполнения верхней\r\n# #матрицы последующих витков, т.к. одномерные матрицы\r\n# #следующих витков имеют меньше значений\r\n# n = int(input())\r\n# mat = [[0]*n for i in range(n)]\r\n# st, m = 1, 0\r\n# # Заранее присваиваю значение центральному элементу\r\n# # матрицы\r\n# mat[n//2][n//2]=n*n\r\n# for v in range(n//2):\r\n# #Заполнение верхней горизонтальной матрицы\r\n# for i in range(n-m):\r\n# mat[v][i+v] = st\r\n# st+=1\r\n# #i+=1\r\n# #Заполнение правой вертикальной матрицы \r\n# for i in range(v+1, n-v):\r\n# mat[i][-v-1] = st\r\n# st+=1\r\n# #i+=1\r\n# #Заполнение нижней горизонтальной матрицы\r\n# for i in range(v+1, n-v):\r\n# mat[-v-1][-i-1] =st\r\n# st+=1\r\n# #i+=1\r\n# #Заполнение левой вертикальной матрицы\r\n# for i in range(v+1, n-(v+1)):\r\n# mat[-i-1][v]=st\r\n# st+=1\r\n# #i+=1\r\n# #v+=1\r\n# m+=2\r\n# #Вывод результата на экран\r\n# for i in mat:\r\n# print(*i)\r\n\r\n\r\n# --- Тортминатор ---\r\nn, m = map(int, input().split())\r\nst = [input() for _ in range(n)]\r\n\r\ncol = []\r\nfor j in range(m):\r\n\ta = ''\r\n\tfor i in range(n):\r\n\t\ta += st[i][j:j + 1]\r\n\tcol.append(a)\r\ncount = 0\r\ncount_st = 0\r\nfor i in range(n):\r\n\tif 'S' not in st[i]:\r\n\t\tcount += m\r\n\t\tcount_st += 1\r\nfor j in range(m):\r\n\tif 'S' not in col[j]:\r\n\t\tcount += n - count_st\r\nprint(count)\r\n", "n, m = [int(x) for x in input().split(' ')]\r\nforbidden_rows = []\r\nforbidden_columns = []\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append([False] * m)\r\nfor i in range(n):\r\n row = input()\r\n for j in range(m):\r\n c = row[j]\r\n if c == 'S':\r\n forbidden_rows.append(i)\r\n forbidden_columns.append(j)\r\ncnt = 0\r\nfor i in range(n):\r\n if i not in forbidden_rows:\r\n for j in range(m):\r\n if not matrix[i][j]:\r\n cnt += 1\r\n matrix[i][j] = True\r\nfor j in range(m):\r\n if j not in forbidden_columns:\r\n for i in range(n):\r\n if not matrix[i][j]:\r\n cnt += 1\r\n matrix[i][j] = True\r\nprint(cnt)\r\n", "n,m=map(int,input().split());a=[];b=[]\r\nfor i in range(n):\r\n s=str(input())\r\n a.append(list(map(str,s)))\r\np=0\r\nfor i in range(m):\r\n b.append(list(map(str,('0'*n))))\r\nfor i in range(n):\r\n if ('S' in a[i])==False:\r\n p+=m\r\n a[i]=list(map(str,('0'*m)))\r\nfor i in range(n):\r\n for j in range(m):\r\n b[j][i]=a[i][j]\r\nfor i in range(m):\r\n if ('S' in b[i])==False:\r\n p+=b[i].count('.')\r\nprint(p)\r\n", "if __name__ == \"__main__\":\n r, c = input().strip().split()\n r = int(r)\n c = int(c)\n count = 0\n cake = []\n for i in range(r):\n temp = [char for char in input().strip()]\n if 'S' not in temp:\n count += c\n r -= 1\n else:\n cake.append(temp)\n for i in range(c):\n arr = [cake[j][i] for j in range(r)]\n if 'S' not in arr:\n count += r\n print(count)\n\n \t \t \t\t \t\t\t\t \t \t\t\t\t \t \t", "r,c=map(int,input().split())\r\nlis=[]\r\nfor i in range(r):\r\n lis.append(input())\r\n\r\ndicr={}\r\ndicc={}\r\nfor i in range(r):\r\n for j in range(c):\r\n if(lis[i][j]==\"S\"):\r\n dicr[i]=1\r\n dicc[j]=1\r\n#print(lis)\r\n#print(dicr,dicc)\r\ncount=0\r\nfor i in range(r):\r\n for j in range(c):\r\n if(lis[i][j]!=\"S\"):\r\n if(dicr.get(i,0)==0 or dicc.get(j,0)==0):\r\n count+=1\r\nprint(count)\r\n", "r, c= map(int, input().split())\r\nar=[]\r\n\r\nfor i in range(r):\r\n ar.append(input())\r\n\r\narr=[]\r\narc=[]\r\nfor i in range(r):\r\n for j in range(c):\r\n if ar[i][j]==\"S\":\r\n arr.append(i)\r\n arc.append(j)\r\nrc=0\r\ncc=0\r\n\r\nfor i in range(r):\r\n if i not in arr:\r\n rc += 1\r\n\r\nfor i in range(c):\r\n if i not in arc:\r\n cc += (r-rc)\r\n\r\nprint((rc*c)+cc)", "r, c = map(int, input().split())\ns = [[j for j in input().strip()] for i in range(r)]\n\nsr = set()\nsc = set()\nfor i in range(r):\n for j in range(c):\n if s[i][j] == 'S':\n sr.add(i)\n sc.add(j)\nans = 0\nfor i in range(r):\n for j in range(c):\n if s[i][j] == '.' and i not in sr or j not in sc:\n ans += 1\nprint(ans)\n", "n,m=map(int,input().split())\r\na=set()\r\nb=set()\r\n\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]==\"S\":\r\n a.add(i),b.add(j)\r\nprint((n*m)-(len(a)*len(b)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndef solution(mat,r,c):\r\n total = 0\r\n cnt = 0\r\n for i in range(r):\r\n res = 0\r\n for j in range(c):\r\n if mat[i][j] == 'S':\r\n res = 0\r\n break\r\n else:\r\n res += 1\r\n total += res\r\n if res > 0:\r\n cnt += 1\r\n dep = 0\r\n for j in range(c):\r\n res = 0\r\n for i in range(r):\r\n if mat[i][j] == 'S':\r\n res = 0\r\n break\r\n else:\r\n res += 1\r\n total += res\r\n if res > 0:\r\n dep += 1\r\n return (total - dep*cnt) if total >= 0 else 0 \r\n \r\n\r\nr,c = invr()\r\nmat = []\r\nfor i in range(r):\r\n s = insr()\r\n mat.append(s)\r\nprint(solution(mat,r,c))", "x,y = map(int,input().split())\r\n\r\nr = 0\r\nc = 0\r\np = []\r\n\r\nfor i in range(x):\r\n n = input()\r\n if \"S\" not in n:\r\n r+=1\r\n elif \"S\" in n:\r\n for i in range(len(n)):\r\n if n[i]==\"S\" :\r\n if i+1 not in p:\r\n p.append(i+1)\r\n \r\nu = r*y\r\nh = y - len(p)\r\nk = h * x\r\no = (u+k) - (h*r)\r\nprint(o)", "r, c = map(int, input().split())\nrows = set()\ncols = set()\nfor i in range(r):\n row = input()\n for j in range(len(row)):\n if row[j] == 'S':\n rows.add(i)\n cols.add(j)\nedible = 0\nif(r >= c):\n edible += c * (r -len(rows))\n edible += len(rows) * (c - len(cols))\nelse:\n edible += r * (c -len(cols))\n edible += len(cols) * (r - len(rows))\nprint(edible)", "n, m = [int(i) for i in input().split()]\r\ncake = [[i for i in input()] for j in range(n)]\r\ncount = 0\r\nd_count = 0\r\nfor i in range(m):\r\n flag = True\r\n for j in range(n):\r\n if cake[j][i] == \"S\":\r\n flag = False\r\n if flag:\r\n count += n\r\n d_count += 1\r\n\r\nfor i in range(n):\r\n flag = True\r\n for j in range(m):\r\n if cake[i][j] == \"S\":\r\n flag = False\r\n if flag:\r\n count += m - d_count\r\n\r\nprint(count)", "r, c = map(int, input().split())\r\ncake = []\r\ncell = 0\r\nrow = 0\r\nfor i in range(r):\r\n n = input()\r\n if n.find('S') < 0:\r\n cell += n.count('.')\r\n n = n.replace('.', '')\r\n else:\r\n cake.append(list(n))\r\n row += 1\r\nfor j in range(c):\r\n column = []\r\n for i in range(row):\r\n column.append(cake[i][j])\r\n if column.count('S') == 0:\r\n cell += column.count('.')\r\nprint(cell)", "n,m=map(int,input().split())\r\nl=[]\r\nc=o=p=0\r\nfor i in range(n):\r\n l.append(input())\r\n\r\nfor i in range(n):\r\n b=0\r\n for j in range(m):\r\n if l[i][j]=='S':\r\n break\r\n elif l[i][j]=='.' :\r\n b+=1\r\n else:\r\n c+=b\r\n o+=1\r\n\r\nfor j in range(m):\r\n b=0\r\n for i in range(n):\r\n if l[i][j]=='S':\r\n break\r\n elif l[i][j]=='.' :\r\n b+=1\r\n else:\r\n c+=b\r\n p+=1\r\n\r\nprint(c-p*o) ", "import copy\r\n(r, c) = map(int, input().split())\r\nA = []\r\nq = r*c\r\nfor i in range(r):\r\n entries = list(map(str, input().split()))\r\n s = ''.join(entries)\r\n a=[]\r\n for j in range(len(s)):\r\n a.append(s[j])\r\n A.append(a)\r\nfor i in range(r):\r\n x = 0\r\n if(A[i].count('.') == c):\r\n for j in A[i]:\r\n A[i] = list(map(lambda x: x.replace('.', '0'), A[i]))\r\n\r\nB = [[A[j][i] for j in range(len(A))] for i in range(len(A[0]))]\r\nfor i in range(c):\r\n x = 0\r\n if((B[i].count('.') + B[i].count('0')) == r):\r\n for j in B[i]:\r\n B[i] = list(map(lambda x: x.replace('.', '0'), B[i]))\r\ncount = 0\r\nfor i in range(c):\r\n for j in range(r):\r\n if(B[i][j]== 'S' or B[i][j]== '.'):\r\n count +=1\r\nres = q-count\r\nprint(res)\r\n\r\n \r\n\r\n\r\n \r\n \r\n", "r, c = map(int, input().split())\r\na = [list(input()) for _ in range(r)]\r\ncount = 0\r\n\r\nfor i in range(r):\r\n if 'S' not in a[i]:\r\n a[i] = list(''.join(a[i]).replace('.', '+'))\r\n\r\na = list(map(list, zip(*a)))\r\n\r\nfor i in range(c):\r\n if 'S' not in a[i]:\r\n a[i] = list(''.join(a[i]).replace('.', '+'))\r\n\r\n\r\nfor i in a:\r\n count += i.count('+')\r\nprint(count)", "n, m = list(map(int, input().split()))#торминатор\r\narr = []\r\narr1 = [[0]*m for i in range(n)]\r\nfor i in range(n):\r\n arr.append(list(map(str, input())))\r\nfor i in range(n):\r\n count = 0\r\n for j in range(m):\r\n if arr[i][j] == 'S':\r\n count = 1\r\n if count == 0:\r\n for k in range(m):\r\n arr1[i][k]=1\r\nfor i in range(m):\r\n count = 0\r\n for j in range(n):\r\n if arr[j][i] == 'S':\r\n count = 1\r\n if count == 0:\r\n for k in range(n):\r\n arr1[k][i]=1 \r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr1[i][j] == 1:\r\n count +=1\r\nprint(count)", "r, c = tuple(map(int, input().split()))\r\ncake = []\r\ncoords = []\r\ncount = 0\r\n\r\nfor i in range(r):\r\n cake.append(list(input()))\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if cake[i][j] == 'S':\r\n coords.append((i, j))\r\noccupied_rows = [i[0] for i in coords]\r\noccupied_cols = [i[1] for i in coords]\r\nfree_rows = []\r\nfree_cols = []\r\nfor i in range(r):\r\n if i not in occupied_rows:\r\n free_rows.append(i)\r\nfor i in range(c):\r\n if i not in occupied_cols:\r\n free_cols.append(i)\r\n\r\nif free_rows == [] and free_cols == []:\r\n pass\r\nelse:\r\n for i in free_rows:\r\n for j in range(c):\r\n if cake[i][j] == '.':\r\n count += 1\r\n cake[i][j] = 'e'\r\n for j in free_cols:\r\n for i in range(r):\r\n if cake[i][j] == '.':\r\n count+=1\r\nprint(count)\r\n", "'''n=int(input())\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelif n==3:\r\n print(6)\r\nelif n==4:\r\n print(20)\r\nelif n==5:\r\n print(70)\r\nelif n==6:\r\n print(252)\r\nelif n==7:\r\n print(924)\r\nelif n==8:\r\n print(3432)\r\nelif n==9:\r\n print(12870)\r\nelse:\r\n print(48620)\r\nn = int(input())\r\na = [[1] * n for i in range(n)]\r\nfor i in range(1,n):\r\n for z in range(1,n):\r\n a[i][z]=a[i-1][z]+a[i][z-1]\r\nprint(a[-1][-1])\r\ns=input().split()\r\nn = int(s[0])\r\nm=int(s[1])\r\na = [['#'] * m for i in range(n)]\r\nfor i in range(n):\r\n for z in range(m):\r\n if (i+1)%4==0:\r\n if z!=0:\r\n a[i][z]='.'\r\n elif (i+1)%4==2:\r\n if z!=m-1:\r\n a[i][z]='.'\r\nfor i in a:\r\n print(*i,sep='')'''\r\ns=input().split()\r\nr=int(s[0])\r\nc=int(s[1])\r\na=[]\r\ne=0\r\nf=0\r\nfor i in range(r):\r\n d=input()\r\n list(d)\r\n a.append(d)\r\nfor i in a:\r\n if i.find('S')==-1:\r\n e+=1\r\nfor i in range(c):\r\n z=0\r\n for d in range(r):\r\n if a[d][i]=='S':\r\n z=1\r\n if z==0:\r\n f+=1\r\nprint(e*c+f*(r-e))\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n\r\n", "n,m = map(int,input().split())\r\ncake = []\r\nmas = [[False]*m for i in range(n)]\r\nfor i in range(n):\r\n cake.append(input())\r\n\r\nfor i in range(n):\r\n if 'S' not in cake[i]:\r\n for j in range(m):\r\n mas[i][j] = True\r\n\r\nfor j in range(m):\r\n is_find = False\r\n for i in range(n):\r\n if cake[i][j]== 'S':\r\n is_find = True\r\n break\r\n if not is_find:\r\n for i in range(n):\r\n mas[i][j] = True\r\n\r\ncount = 0\r\nfor row in mas:\r\n count += row.count(True)\r\nprint(count)\r\n", "r,c=map(int,input().split())\r\nl=[]\r\nfor x1 in range(r):\r\n l.append(list(str(input())))\r\na=0\r\ne=[]\r\nfor a1 in range(r):\r\n s2=0\r\n for a2 in range(c):\r\n if l[a1][a2]==\".\":\r\n s2+=1\r\n if s2==c:\r\n a+=s2\r\n e.append(a1)\r\nb=0\r\nf=[]\r\nfor b1 in range(c):\r\n s3=0\r\n for b2 in range(r):\r\n if l[b2][b1]==\".\":\r\n s3+=1\r\n if s3==r:\r\n b+=s3\r\n f.append(b1)\r\nprint(a+b-len(e)*len(f))\r\n", "r, c = (int(i) for i in input().split())\na = [[v for v in input()] for _ in range(r)]\nrs = [any(a[i][j] == \"S\" for j in range(c)) for i in range(r)]\ncs = [any(a[i][j] == \"S\" for i in range(r)) for j in range(c)]\nres = 0\nfor i in range(r):\n for j in range(c):\n if not rs[i] or not cs[j]:\n res += 1\nprint(res)\n", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\ntotal = 0\r\ns = []\r\nfor _ in range(a):\r\n i = input()\r\n if 'S' not in i:\r\n total += b\r\n i = i.replace('.', ' ')\r\n s.append(i)\r\nfor i in range(b):\r\n s_ = 0\r\n s__ = 0\r\n for j in s:\r\n\r\n if j[i] == 'S':\r\n s_ += 1\r\n elif j[i] == '.':\r\n s__ += 1\r\n if s_ == 0:\r\n total += s__\r\nprint(total)", "r, c = [int(x) for x in input().split()]\r\ncake = [list(input()) for i in range(r)]\r\n#print(cake)\r\nnum_cells = 0\r\nuncountable = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if 'S' in cake[i]:\r\n col = [row[j] for row in cake]\r\n if col.count('S') > 0:\r\n uncountable += 1\r\nprint((r * c) - uncountable)", "n, m = map(int, input().split())\r\ns, r, c = [], 0, 0\r\nfor i in range(n):\r\n t = input()\r\n s.append(t)\r\n if t.count('S') > 0:\r\n r += 1\r\nfor i in range(m):\r\n k = True\r\n for j in range(n):\r\n k = k and (s[j][i] == '.')\r\n if not k:\r\n c += 1\r\nprint(n * m - r * c)", "def main():\r\n count = 0\r\n colum = []\r\n [r, c] = list(map(int, input().split()))\r\n for i in range(r):\r\n row = input()\r\n if row.find('S') == -1:\r\n count += 1\r\n else:\r\n for j in range(c):\r\n if row[j] == 'S':\r\n colum.append(j)\r\n print(count * c + (c - len(set(colum))) * (r - count))\r\nif __name__ == '__main__':\r\n main()", "r,c=map(int,input().split())\r\nres=0\r\nrr=0\r\nA=[]\r\nfor i in range(r):\r\n A.append(input())\r\nfor i in A:\r\n if not \"S\" in i:\r\n res+=c\r\n rr+=1\r\nfor i in range(c):\r\n for j in range(r):\r\n if A[j][i]==\"S\":\r\n break\r\n if j==r-1:\r\n res += r - rr\r\nprint (res)", "r, c = map(int, input().split())\r\nl = []\r\na = set()\r\nb = set()\r\nfor i in range(r):\r\n l.append(list(input()))\r\n \r\nfor i in range(r):\r\n for j in range(c):\r\n if l[i][j] == 'S':\r\n a.add(i)\r\n b.add(j)\r\nprint(r*c - len(a)*len(b))", "import sys\r\nimport itertools\r\nimport collections\r\n\r\n\r\ndef rs(x=''): return sys.stdin.readline().strip() if len(x) == 0 else input(x).strip()\r\ndef ri(x=''): return int(rs(x))\r\ndef rm(x=''): return map(str, rs(x).split())\r\ndef rl(x=''): return rs(x).split()\r\ndef rmi(x=''): return map(int, rs(x).split())\r\ndef rli(x=''): return [int(x) for x in rs(x).split()]\r\ndef println(val): sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\ndef solve(testCase):\r\n r, c = rmi()\r\n grid = [list(rs()) for _ in range(r)]\r\n visited = [[False for _ in range(c)] for _ in range(r)]\r\n ans = 0\r\n for i in range(r):\r\n monster = False\r\n for j in range(c):\r\n if grid[i][j] == 'S':\r\n monster = True\r\n break\r\n if not monster:\r\n for j in range(c):\r\n if not visited[i][j]:\r\n ans += 1\r\n visited[i][j] = True\r\n for i in range(c):\r\n monster = False\r\n for j in range(r):\r\n if grid[j][i] == 'S':\r\n monster = True\r\n break\r\n if not monster:\r\n for j in range(r):\r\n if not visited[j][i]:\r\n ans += 1\r\n visited[j][i] = True\r\n print(ans)\r\n\r\n\r\nfor _ in range(ri() if 0 else 1):\r\n solve(_ + 1)", "n , m = map(int,input().split())\r\ncount1 = 0\r\nl = []\r\nfor i in range(n):\r\n\ts = input()\r\n\tif \"S\" not in s:\r\n\t\tcount1 += m\r\n\telse:\r\n\t\tl.append(s)\r\nfor j in range(m):\r\n\tcount2 = 0\r\n\tfor x in range(len(l)):\r\n\t\tif l[x][j]!=\"S\":\r\n\t\t\tcount2 += 1\r\n\t\telse:\r\n\t\t\tcount2 = 0\r\n\t\t\tbreak\r\n\tcount1 += count2\t\t\r\nprint(count1)\t\t\t\t", "a,b = map(int, input().split())\r\ns = set()\r\nc = 0 \r\nfor i in range(a):\r\n x = input()\r\n if 'S' in x:\r\n c += 1\r\n for i in range(b):\r\n if x[i] == 'S':\r\n s.add(i)\r\nprint(a*b - c*len(s))", "r, c = [int(i) for i in input().split()]\r\n\r\nrows_eaten = 0\r\ncake = []\r\nfor i in range(r):\r\n s = input()\r\n cake.append(s)\r\n if \"S\" not in s:\r\n rows_eaten += 1\r\n\r\ncolumns_eaten = 0\r\nfor i in range(c):\r\n for j in range(r):\r\n if cake[j][i] == \"S\":\r\n break\r\n else:\r\n columns_eaten += 1\r\n\r\n\r\npieces = (c - columns_eaten) * rows_eaten\r\npieces += columns_eaten * r\r\n\r\nprint(pieces)\r\n", "r, c = [int(i) for i in input().split()]\r\nv = []\r\nx = 0\r\ny = 0\r\n\r\nfor i in range(r):\r\n b = input()\r\n v.append(b)\r\n\r\nfor z in v:\r\n if(\"S\" not in z):\r\n x = x + 1\r\n\r\nfor j in range(c):\r\n isStraw = False\r\n for i in range(r):\r\n if (v[i][j] == \"S\"):\r\n isStraw = True\r\n if isStraw == False:\r\n y = y + 1\r\n\r\na = x * c\r\nb = y * (r - x)\r\n\r\nprint(a + b)", "r,c = map(int, input().split())\ncount = 0\ngrid = []\nfor _ in range(r):\n row = input()\n if 'S' not in row:\n count += c\n else:\n grid.append(list(row))\n\nfor t in zip(* grid):\n if 'S' not in t:\n count += len(t)\nprint(count)\n", "r,c = map(int,input().split())\r\na = []\r\ncounter1 = 0\r\ncounter2 = 0\r\nfor i in range (r):\r\n q = list(input())\r\n a.append (q)\r\nfor i in a:\r\n if 'S' not in i:\r\n counter1 += 1\r\nfor i in range (c):\r\n for j in range (r):\r\n if 'S' == a[j][i]:\r\n break\r\n else:\r\n counter2 += 1\r\nw = counter1 * c + counter2 * r - counter1 * counter2\r\nprint (w)", "r,c=map(int,input().split())\r\na=[input() for i in range(r)]\r\nprint(r*c-len([1 for i in a if 'S' in i])*len([1 for i in zip(*a) if 'S' in i]))", "r,c= input().split()\r\nr=int(r)\r\nc=int(c)\r\n\r\nmat= []\r\ncrow=set()\r\nccol=set()\r\n\r\nfor i in range(r):\r\n x=input()\r\n \r\n for j in range(len(x)):\r\n if x[j]==\"S\":\r\n crow.add(i)\r\n ccol.add(j)\r\n \r\n mat.append(x)\r\nans=0\r\nfor k in range(r):\r\n for l in range(c):\r\n if k in crow and l in ccol:\r\n pass\r\n else:\r\n ans+=1\r\n \r\nprint(ans)\r\n", "data = input().split()\r\n\r\nR, C = int(data[0]), int(data[1])\r\n\r\ncake = [[None] * C] * R\r\n\r\nfor i in range(R):\r\n cake[i] = input()\r\n\r\neaten_cake = 0\r\n\r\n#rows\r\nfor i in range(R):\r\n if cake[i].count('S') == 0:\r\n eaten_cake += C\r\n cake[i] = '1' * C\r\n continue\r\n\r\n#Columns\r\nfor j in range(C):\r\n S_flag = 0\r\n for i in range(R):\r\n if cake[i][j] == 'S':\r\n S_flag = 1\r\n break\r\n if S_flag == 1:\r\n continue\r\n else:\r\n for i in range(R):\r\n if cake[i][j] == '.':\r\n eaten_cake += 1\r\n\r\nprint(eaten_cake)", "game = []\r\ninp=list(map(int,input().split()))\r\nr=inp[0]\r\nc=inp[1]\r\neaten=[]\r\nbc=[]\r\nfor i in range(r):\r\n row=input()\r\n if \"S\" in row :\r\n game.append(list(row))\r\n for s in range(c):\r\n if row[s]==\"S\":\r\n bc.append(s)\r\n else:\r\n game.append(list(row))\r\n for j in range(c):\r\n eaten.append([i,j])\r\nfor k in range(c):\r\n if k in bc:\r\n continue\r\n else:\r\n for z in range(r):\r\n eaten.append([z,k])\r\n#print(eaten)\r\n#print(bc)\r\ncop=[]\r\nfor zb in eaten:\r\n if eaten.count(zb)==1:\r\n cop.append(zb)\r\n elif not (zb in cop):\r\n cop.append(zb)\r\n \r\nprint(len(cop))", "n, m = map(int,input().split())\r\nmat = [[x for x in input()] for x in range(n)]\r\nfor i in range(n):\r\n if ''.join(mat[i]) == '.' * m:\r\n for j in range(m):\r\n mat[i][j] = '+'\r\nfor i in range(m):\r\n cnt = ''\r\n for j in range(n):\r\n cnt += mat[j][i]\r\n if not('S' in cnt):\r\n for k in range(n):\r\n mat[k][i] = '+'\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == '+':\r\n cnt += 1\r\nprint(cnt)", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nh = set()\r\ny = set()\r\nfor n in range(a):\r\n p = input()\r\n for j in range(b):\r\n if p[j] == \"S\":\r\n h.add(n)\r\n y.add(j)\r\nprint((a*b)-(len(h)*len(y)))", "r, c = [int(s) for s in input().split(' ')]\r\nrows = []\r\nr_cnt = 0\r\nc_cnt = 0\r\nfor i in range(r):\r\n row = input()\r\n if row == '.' * c:\r\n r_cnt += 1\r\n rows.append(row)\r\nfor j in range(c):\r\n col = [rows[k][j] for k in range(r)]\r\n if col == ['.'] * r:\r\n c_cnt += 1\r\nprint(r_cnt * c + c_cnt * (r - r_cnt))\r\n", "r,c=map(int, input().split())\r\n\r\nrow=set()\r\ncol=set()\r\n\r\nfor i in range(0,r):\r\n p=input()\r\n\r\n for j in range(0,c):\r\n if p[j]=='S':\r\n row.add(i)\r\n col.add(j)\r\n\r\ncount=r*c\r\nfor i in range(0,r):\r\n for j in range(0,c):\r\n if i in row and j in col:\r\n count-=1\r\n\r\nprint (count)\r\n", "x,y = map(int,input().split())\r\nr,c = 0,[]\r\nfor i in range(x):\r\n l = input()\r\n for k in range(len(l)):\r\n if l[k]==\"S\":\r\n c.append(k)\r\n if \"S\" in l: \r\n r+=1\r\nprint(x*y - r*(len(set(c))))\r\n\r\n", "inp=list(map(int,input().split()))\r\nr,c=inp\r\narr=[]\r\nfor _ in range(r):\r\n s=input()\r\n arr.append(s)\r\nfrom collections import Counter\r\nrow=Counter([])\r\ncol=Counter([])\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 row[i]+=1\r\n col[j]+=1\r\nans=0\r\nfor i in range(len(arr)):\r\n for j in range(len(arr[i])):\r\n if row[i]!=0 and col[j]!=0:\r\n ans+=1\r\nprint (r*c-ans)", "r, c = map(int,input().split())\r\nl=[]\r\nfor i in range(r):\r\n\ts = input()\r\n\tl.append(s)\r\n# print(l)\r\na = []\r\nfor i in range(r):\r\n\tb = 0\r\n\td=[]\r\n\tfor j in range(c):\r\n\t\tif l[i][j] == \"S\":\r\n\t\t\tb=1\r\n\t\telse:\r\n\t\t\td.append(j+1+i*c)\r\n\tif b == 0:\r\n\t\tfor i in d:\r\n\t\t\ta.append(i)\r\nfor i in range(c):\r\n\tb = 0\r\n\td = []\r\n\tfor j in range(r):\r\n\t\tif l[j][i] == \"S\" :\r\n\t\t\tb = 1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\td.append(j*c+i+1)\r\n\tif b == 0:\r\n\t\tfor i in d:\r\n\t\t\ta.append(i)\r\n# print(a)\r\nprint(len(set(a)))", "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\ndef check_poison(r, c, grid, n, m):\n cp = [0,0]\n for i in range(r):\n if grid[i][m] =='S':\n cp[0] = 1\n for i in range(c):\n if grid[n][i]=='S':\n cp[1] = 1\n if sum(cp)<2:\n return False\n return True\n\ndef solution(r,c,grid):\n res = 0\n for i in range(r):\n for j in range(c):\n if not check_poison(r, c, grid, i, j):\n res+=1\n print(res)\n\n\nif __name__=='__main__':\n r,c = L()\n grid = []\n for _ in range(r):\n grid.append(S())\n solution(r,c,grid)", "n, m = map(int, input().split())\r\nboard = [input() for _ in range(n)]\r\nans = 0\r\nIs = []\r\nJs = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if board[i][j] == 'S':\r\n Is.append(i)\r\n Js.append(j)\r\nfor i in range(n):\r\n for j in range(m):\r\n if i in Is and j in Js:\r\n continue\r\n ans += 1\r\nprint(ans)", "n, m = map(int, input().split())\r\nmatrix = [list(input()) for _ in range(n)]\r\ns = set()\r\n\r\nfor i, row in enumerate(matrix):\r\n if \"S\" not in row:\r\n for j, el in enumerate(row):\r\n s.add((i, j))\r\n \r\nfor i, row in enumerate(zip(*matrix)):\r\n if \"S\" not in row:\r\n for j, el in enumerate(row):\r\n s.add((j, i))\r\n \r\nprint(len(s))", "n,k =map(int,input().split())\r\na=[]\r\nc=[]\r\nx=0\r\nd=0\r\nfor i in range (n):\r\n a.append(input())\r\nfor i in range (n-1,-1,-1):\r\n if not \"S\" in a[i]:\r\n x+=len(a[i])\r\n del a[i]\r\n d+=1\r\nfor i in range (k):\r\n b=[]\r\n for j in range (n-d):\r\n b.append(a[j][i])\r\n c.append(b)\r\n c[i]=''.join(c[i])\r\nfor i in range (k-1,-1,-1):\r\n if not \"S\" in c[i]:\r\n x+=len(c[i])\r\n del c[i]\r\n d+=1\r\nprint(x)\r\n\r\n", "size = list(map(int, input().split()))\r\ncake = [input() for i in range(size[0])]\r\n\r\nrow_counter = 0\r\ncolumn_counter = 0\r\n\r\nfor i in range(size[0]): \r\n if 'S' not in cake[i]: \r\n row_counter += 1 \r\n\r\nfor i in range(size[1]): \r\n cake_column = [] \r\n for j in range(size[0]): \r\n cake_column.append(cake[j][i]) \r\n\r\n if 'S' not in cake_column: \r\n column_counter += 1 \r\n\r\nprint(row_counter * size[1] + column_counter * (size[0] - row_counter))", "n,m=map(int,input().split())\r\na=[]\r\nc=c1=0\r\ns=0\r\nfor i in range(n):\r\n k=list(input())\r\n if(k.count(\"S\")==0):\r\n c+=1\r\n s+=m\r\n a.append(k)\r\nfor i in range(m):\r\n l=0\r\n for j in range(n):\r\n if(a[j][i]==\"S\"):\r\n l=1\r\n break\r\n if(l==0):\r\n c1+=1\r\n s+=n\r\nprint(s-c*c1)", "r, c = map(int, input().split())\r\na = [input() for i in range(r)]\r\nb = [[0] * c for i in range(r)]\r\nfor i in range(r):\r\n if 'S' not in a[i]:\r\n for j in range(c):\r\n b[i][j] = 1\r\nfor j in range(c):\r\n is_find = False\r\n for i in range(r):\r\n if a[i][j] == 'S':\r\n is_find = True\r\n break\r\n if not is_find:\r\n for i in range(r):\r\n b[i][j] = 1\r\ncount = 0\r\nfor i in b:\r\n count += i.count(1)\r\nprint(count)", "r, c = map(int, input().split())\r\na = []\r\nl = 0\r\nst = 0\r\nfl = True\r\nfor i in range(r):\r\n a.append(list(input()))\r\nk = 0\r\n\r\nfor i in range(r):\r\n if 'S' not in a[i]:\r\n l += 1\r\n\r\n\r\nfor i in range(c):\r\n for j in range(r):\r\n if a[j][i] == 'S':\r\n fl = False\r\n if fl:\r\n st += 1\r\n else:\r\n fl = True\r\nprint(l * c + st * (r - l))", "r, c = map(int, input().split())\r\nl = []\r\nx = []\r\ny = []\r\ncell = 0\r\nfor i in range(0, r):\r\n s = str(input())\r\n l1 = list(s)\r\n if \"S\" in l1:\r\n l.append(l1)\r\n else:\r\n cell += c\r\nfor j in range(0, c):\r\n flag = True\r\n for i in range(0, len(l)):\r\n if l[i][j] == \"S\":\r\n flag = False\r\n break\r\n if flag:\r\n cell += len(l)\r\nprint(cell)", "import math\r\nfrom collections import defaultdict, Counter, deque\r\n\r\nINF = float('inf')\r\n\r\ndef gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a%b\r\n\treturn a\r\n\r\n\r\ndef primeFactor(n):\r\n\tif n % 2 == 0:\r\n\t\treturn 2\r\n\ti = 3\r\n\twhile (i ** 2) <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn i \r\n\t\ti += 1\r\n\treturn n\r\n\r\ndef main():\r\n\tn, m = map(int, input().split())\r\n\r\n\tmat = []\r\n\tfor i in range(n):\r\n\t\tmat.append(input())\r\n\r\n\tans = 0\r\n\te = defaultdict(int)\r\n\tfor i in range(n):\r\n\t\teaten = 0\r\n\t\tif 'S' not in mat[i]:\r\n\t\t\tfor j in range(m):\r\n\t\t\t\te[(i, j)] = 1\r\n\t\t\t\teaten += 1\r\n\t\t\tans += eaten\r\n\tfor j in range(m):\r\n\t\teaten = 0\r\n\t\tisS = False\r\n\t\tfor i in range(n):\r\n\t\t\tif mat[i][j] == 'S':\r\n\t\t\t\tisS = True\r\n\t\t\t\tbreak\r\n\r\n\t\tif not isS:\r\n\t\t\tfor i in range(n):\r\n\t\t\t\tif e[(i, j)] == 0:\r\n\t\t\t\t\te[i] = 1\r\n\t\t\t\t\teaten += 1\r\n\t\t\tans += eaten\r\n\tprint(ans)\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n\t# t = int(input())\r\n\tt = 1\r\n\tfor _ in range(t):\r\n\t\tmain()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nr, c = map(int, input().split())\r\n\r\n\r\nmaze = []\r\n\r\ntiles = 0\r\ncro = 0\r\n\r\n\r\nfor _ in range(r):\r\n val = [i for i in input()]\r\n maze.append(val)\r\n if all([i == \".\" for i in val]):\r\n tiles += c\r\n cro += 1\r\n\r\nfor j in range(c):\r\n if all(maze[i][j] == \".\" for i in range(r)):\r\n tiles += r - cro\r\n\r\nprint(tiles)\r\n", "r, c = map(int,input().split())\r\ncake = []\r\nfor i in range(r):\r\n cake.append(list(input()))\r\nnr = set()\r\nnc = set()\r\nfor i in range(r):\r\n if 'S' in cake[i]:\r\n nr.add(i)\r\nfor i in range(c):\r\n for j in range(r):\r\n if cake[j][i] == 'S':\r\n nc.add(i)\r\n break\r\n\r\nfor i in range(r):\r\n if i not in nr:\r\n for j in range(c):\r\n cake[i][j] = 'o'\r\nfor i in range(c):\r\n if i not in nc:\r\n for j in range(r):\r\n cake[j][i] = 'o'\r\nret = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if cake[i][j] == 'o':\r\n ret += 1\r\nprint(ret)", "######################################################\n# #\n# LEO's Arena #\n# #\n######################################################\n\n\nimport math\nfrom collections import Counter\nimport random\n\n\ndef isSubSequence(string1, string2, m, n):\n # Base Cases\n if m == 0:\n return True\n if n == 0:\n return False\n\n # strings are matching\n if string1[m - 1] == string2[n - 1]:\n return isSubSequence(string1, string2, m - 1, n - 1)\n\n # If last characters are not matching\n return isSubSequence(string1, string2, m, n - 1)\n\n\ndef Log2(x):\n if x == 0:\n return False\n\n return math.log10(x) / math.log10(2)\n\n\ndef isPowerOfTwo(n):\n return math.ceil(Log2(n)) == math.floor(Log2(n))\n\n\ndef nearest_power_of_two(n):\n power = math.floor(math.log2(n))\n return power\n\n\ndef custom_sort(s, priority_str):\n priority_map = {ch: idx for idx, ch in enumerate(priority_str)}\n return \"\".join(sorted(s, key=lambda x: priority_map.get(x, len(priority_str))))\n\n\ndef get_column(arr, col_index):\n return [row[col_index] if col_index < len(row) else None for row in arr]\n\n\n# chr(96 + int(i))\n\n\n# t = int(input())\nt = 1\n# # n, m = map(int, input().split())\n# # a = list(map(int, input().split()))\n# # a.sort()\nmain_list = []\nflag = False\ntemp_count = 0\n\n\nwhile t != 0:\n n, m = map(int, input().split())\n str_list = []\n ans = 0\n row = 0\n for i in range(n):\n s = input()\n if \"S\" not in s:\n ans += m\n row += 1\n str_list.append(s)\n col = 0\n for i in range(m):\n column_index = i\n result_column = get_column(str_list, column_index)\n\n if \"S\" not in result_column:\n ans += n\n col += 1\n print(ans - (row * col))\n\n t -= 1\n", "r,c=map(int,input().split())\r\np1=[]\r\np3=[]\r\np4=[]\r\nfor i in range(r):\r\n p2=list(input())\r\n for j in range(c):\r\n if(p2[j]!='.'):\r\n p3.append(i)\r\n p4.append(j)\r\n p1.append(p2)\r\n\r\n\r\n\r\nprint(r*c -len(set(p3))*len(set(p4)))\r\n", "n,m = list(map(int,input().split()))\r\na = []\r\nfor _ in range(n):\r\n a.append(input())\r\nrow = set()\r\ncolumn = set()\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == 'S':\r\n row.add(j)\r\n column.add(i)\r\nprint((n-len(column))*m+(m-len(row))*n-(n-len(column))*(m-len(row)))" ]

[ "n = int(input())\r\nline = [int(i) for i in input().split()]\r\n\r\nfor i in range(len(line)):\r\n line[i]+=i\r\nline.sort()\r\nfor i in range(len(line)):\r\n line[i]-=i\r\n\r\nimpossivel = False\r\nfor i in range(len(line)-1):\r\n if(line[i]>line[i+1]):\r\n impossivel = True\r\n break\r\nif(impossivel):\r\n print(\":(\")\r\nelse:\r\n print(\" \".join([str(i) for i in line]))\r\n", "import sys\nclass Person:\n def __init__(self, dollars, index):\n self.dollars = dollars\n self.index = index\n\ndef solve():\n n = int(input())\n given = list(map(int, input().split()))\n people = list()\n for i in range(n):\n people.append(Person(given[i], i))\n people.sort(key = lambda p: p.dollars + p.index)\n res = [0] * n\n for i in range(n):\n res[i] = people[i].dollars + people[i].index - i\n for i in range(n - 1):\n if res[i] > res[i+1]:\n return \":(\"\n return ' '.join(map(str, res))\n\n \ndef run():\n if sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\n print(solve())\n\nrun()", "n = int(input())\nline = list(map(int, input().split()))\n\nfor i in range(n):\n line[i] += i\n\nline.sort()\n\nis_happy = True\nfor i in range(1, n):\n if line[i] == line[i - 1]:\n is_happy = False\n break\n\nif is_happy:\n print(' '.join([str(line[i] - i) for i in range(n)]))\nelse:\n print(':(')\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nv = [a[i] - (n - i + 1) for i in range(n)]\r\nv.sort()\r\na = [v[i] + (n - i + 1) for i in range(n)]\r\n\r\nif a == sorted(a):\r\n print(*a)\r\nelse:\r\n print(':(')\r\n", "#E - Happy Line\r\nimport sys\r\nnLine = int(input())\r\nnMoney = list(map(int, input().split()))\r\ninvariante = []\r\nfor i in range(len(nMoney)):\r\n invariante.append(nMoney[i] + i)\r\ninvariante.sort()\r\n\r\nres = [0] * nLine\r\nfor i in range(nLine):\r\n res[i] = invariante[i] - i\r\nfor i in range(nLine - 1):\r\n if res[i] > res[i+1]:\r\n print(':(')\r\n sys.exit()\r\nprint(*res)", "R = lambda: list(map(int, input().split()))\r\n \r\nn = R()[0]\r\n \r\na = R()\r\n \r\nfor i in range(n):\r\n a[i] += i\r\na = sorted(list(set(a)))\r\nif len(a) != n:\r\n print(':(')\r\nelse:\r\n for i in range(n):\r\n print(a[i] - i, end=' ')", "import math\nimport sys\ninput = sys.stdin.readline\nn = int(input())\na = [int(_) for _ in input().split()]\nfor i in range(n):\n a[i] += i\na.sort()\nfor i in range(n):\n a[i] -= i\nfor i in range(n):\n if a[i] < 0 or (i > 0 and a[i - 1] > a[i]):\n print(':(')\n exit(0)\nprint(' '.join(map(str, a)))\n", "input()\r\nt = sorted(q + i for i, q in enumerate(map(int, input().split())))\r\np = [q - i for i, q in enumerate(t)]\r\nprint(':(' if sorted(p) != p else ' '.join(map(str, p)))", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy\nfrom itertools import chain, dropwhile, permutations, combinations\nfrom collections import defaultdict, deque\n\ndef VI(): return list(map(int,input().split()))\n\ndef run(n,a):\n b = copy.copy(a)\n for i in range(n):\n b[i] -= (n-i)\n b.sort()\n for i in range(n):\n if i<n-1:\n if b[i]==b[i+1]:\n print(\":(\")\n return\n b[i] = str(b[i]+(n-i))\n print(\" \".join(b))\n\n\ndef main(info=0):\n n = int(input())\n a = VI()\n run(n,a)\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nfor i in range(n):\r\n a[i]=a[i]-(n-i)\r\na.sort()\r\nfor i in range(n):\r\n a[i]=a[i]+(n-i)\r\nans=True\r\nfor i in range(n-1):\r\n if (a[i]>a[i+1]):\r\n ans=False\r\n break\r\nif (ans):\r\n for i in range(n):\r\n tmp=(' ' if (i!=n-1) else '\\n')\r\n print(a[i],end=tmp)\r\nelse:\r\n print(\":(\")", "#E - Happy Line\nimport sys\nnLine = int(input())\nnMoney = list(map(int, input().split()))\ninvariante = []\nfor i in range(len(nMoney)):\n invariante.append(nMoney[i] + i)\ninvariante.sort()\n\nres = [0] * nLine\nfor i in range(nLine):\n res[i] = invariante[i] - i\nfor i in range(nLine - 1):\n if res[i] > res[i+1]:\n print(':(')\n sys.exit()\nprint(*res)\n\t \t\t\t \t \t \t\t\t\t \t \t\t", "n=int(input())\nfila=list(map(int, input().split()))\nbreak_ = False\n\nfor i in range(n):\n fila[i] += i \n\nfila = sorted(list(set(fila)))\n\nif len(fila) < n:\n print(\":(\")\n\nelse:\n for j in range(n):\n fila[j] -= j\n\n print(\" \".join(map(str, fila)))\n\n\t\t\t\t\t \t \t \t \t \t \t", "def main():\r\n n = int(input())\r\n a = [int(x) for x in input().split(\" \")]\r\n for i in range(len(a)):\r\n a[i] += i\r\n a.sort()\r\n for i in range(1, len(a)):\r\n a[i] -= i\r\n if a[i] < a[i - 1]:\r\n print(\":(\")\r\n return\r\n for i in range(len(a)):\r\n a[i] = str(a[i])\r\n print(' '.join(a))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n" ]

[ "import math\nn=int(input())\nlt=[2]*(n+1)\nl=[2]\nfor i in range(2,n+2):\n for j in range(2,int(math.sqrt(i))+2):\n if i%j==0:\n break\n else:\n lt[i-1]=1\n l.append(i)\nlt[1]=1\nif n<3:\n print(1)\nelse:\n print(2)\nprint(*lt[1:])\n#print(l)\n \t\t \t \t\t \t \t\t \t \t \t\t\t\t\t", "import sys,math,io,os,time,itertools,collections\r\nmod=10**9+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\npr=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\n#sieve of eratosthenes\r\ndef sieve(n):\r\n prime=[\"1\" for _ in range(n+1)]\r\n p=2\r\n while p*p<=n:\r\n if prime[p]==\"1\":\r\n for k in range(p*p,n+1,p):\r\n prime[k]=\"2\"\r\n p+=1\r\n return prime[2:]\r\n\r\ndef main():\r\n n=int(i())\r\n l=sieve(n+1)\r\n k=2\r\n if n<=2:\r\n k=1\r\n pr(str(k)+\"\\n\")\r\n pr(\" \".join(l)+\"\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "n = int(input())\r\n\r\nk = n + 2\r\n\r\narr = [1] * k\r\n\r\nfor index in range(2, int(k ** 0.5) + 1):\r\n for idx in range(index * index, k, index):\r\n arr[idx] = 2\r\n\r\nprint(len(set(arr[2:])))\r\nprint(*arr[2:])", "from math import sqrt\r\nn=int(input())\r\n\r\nf=0\r\nans=[]\r\nfor k in range(n+2):\r\n\tans.append(\"y\")\r\nfor i in range(2,n+2):\r\n\t\r\n\tif ans[i]==\"y\":\r\n\t\tfor j in range(2*i,n+2,i):\r\n\t\t\tans[j]=\"n\"\r\n\t\t\tf+=1\r\n\r\n\r\nif (f==0):\r\n\tprint (1)\r\nelse:\r\n\tprint (2)\r\n\r\ns=''\r\nfor l in range(2,n+2):\r\n\tif ans[l]==\"y\":\r\n\t\ts+=\"1 \"\r\n\telse:\r\n\t\ts+=\"2 \"\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", "n=100002\r\narr=[1]*n\r\nfor i in range(2,n):\r\n if arr[i]==1:\r\n arr[i]=i\r\n for j in range(i*i,n,i):\r\n arr[j]=i\r\n\r\nn,d,ans=int(input()),{},[]\r\nnums=list(range(2,n+2))\r\nfor i in nums:\r\n lst=set()\r\n while(i>1):\r\n lst.add(arr[i])\r\n i//=arr[i]\r\n if i>=2:\r\n lst.add(i)\r\n k=1\r\n for j in lst:\r\n if j in d.keys():\r\n if d[j]==k:\r\n k+=1\r\n else:\r\n d[j]=k\r\n ans.append(k)\r\nprint(len(set(ans)))\r\nprint(*ans)", "n = int(input())\r\nC = [1]*n\r\n\r\nfor i in range(2, 1+int((n+1)**.5)):\r\n for j in range(i*i, n+2, i):\r\n C[j-2] = 2\r\n\r\nprint(2 - (n<3))\r\nprint(*C)", "def main(n):\r\n prime = [True for i in range(n + 2)]\r\n p = 2\r\n k=1\r\n ans=[1 for i in range(n)]\r\n while (p * p <= n+1):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n + 2, p):\r\n if prime[i]==True:\r\n prime[i]=False\r\n ans[i-2]+=1\r\n k=2\r\n p += 1\r\n print(k)\r\n for i in range(n):\r\n print(ans[i], end=\" \")\r\nn=int(input())\r\nmain(n)\r\n", "n=int(input())\r\nl=[1]*1000001\r\nl[0]=0\r\nl[1]=0\r\nfor i in range(2,1000001):\r\n if l[i]==1:\r\n for j in range(i*i,1000001,i):\r\n l[j]=2\r\nk=set(l[2:n+2])\r\nprint(len(k))\r\nprint(*l[2:n+2])\r\n \r\n", "from math import sqrt\r\nn=int(input())\r\nl=[1]*(n+2)\r\nfor i in range(2,int(sqrt(n+2)+1)):\r\n\tif l[i]==1:\r\n\t\tfor j in range(i*i,n+2,i):\r\n\t\t\tl[j]=2\r\nif n>=3:\r\n\tprint(2)\r\n\tprint(*l[2:n+2])\r\nelse:\r\n\tprint(1)\r\n\tprint(*[1]*n)", "import math\r\ndef soe(n):\r\n is_prime = [True for i in range(n+2)]\r\n is_prime[0] = False\r\n is_prime[1] = False \r\n color = [1 for i in range(n+2)]\r\n for i in range(2,n+2):\r\n if is_prime[i]:\r\n for j in range(2*i,n+2,i):\r\n is_prime[j] = False\r\n color[j] = 2\r\n return color\r\n\r\ncolors = soe(pow(10,5))\r\nn = int(input())\r\nif n > 2:\r\n print(2)\r\nelse:\r\n print(1)\r\nprint(*colors[2:n+2])\r\n", "import math\r\n\r\ndef isPrime(n):\r\n if n == 2:\r\n return True\r\n if n == 1 or n%2 == 0:\r\n return False\r\n \r\n for i in range(3, 1+math.ceil(math.sqrt(n))):\r\n if n%i == 0:\r\n return False\r\n \r\n return True\r\n\r\nn = int(input())\r\n\r\nans = []\r\n\r\nfor i in range(2, n+2):\r\n if isPrime(i):\r\n ans.append(1)\r\n else:\r\n ans.append(2)\r\n\r\nk = 2\r\n\r\nif n < 3:\r\n k = 1\r\n\r\nprint(k)\r\nprint(' '.join(list(map(str, ans))))\r\n\r\n", "\r\n\r\nn = int(input())\r\nl = [1]*(n+2)\r\nfor i in range(2, n+2):\r\n for j in range(i*i, n+2, i):\r\n l[j] = 2\r\nif n > 2:\r\n print(\"2\")\r\nelse:\r\n print(\"1\")\r\nprint(*l[2:])", "a=int(input())\r\nz=[0]+[0]*(a+1)\r\nif a<3:print(1)\r\nelse:print(2)\r\nfor i in range(2,a+2):\r\n if not(z[i]):\r\n for j in range(i,a+2,i):z[j]=2\r\n z[i]=1\r\nprint(*z[2:])\r\n", "def prime(n:int):\r\n for i in range(2, int(n**(0.5))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\nn = int(input())\r\nif n <3:\r\n print(1)\r\n for i in range(n):\r\n print(1,end=\" \")\r\nelse:\r\n print(2)\r\n for i in range(2,n+2):\r\n if prime(i):\r\n print(\"1\", end=\" \")\r\n else:\r\n print(\"2\", end=\" \")\r\n", "n = int(input())\r\nnums = []\r\ndef check(n):\r\n flag = [True] * (n+1)\r\n for i in range(2, n+1):\r\n if flag[i]:\r\n nums.append(i)\r\n j = 0\r\n while nums[j] <= n // i:\r\n flag[nums[j]*i] = False\r\n if i % nums[j] == 0:\r\n break\r\n j += 1\r\n return nums\r\ncheck(n+1)\r\nif n < 3:\r\n print(1)\r\n res = [\"1\"] * n\r\n print(\" \".join(res))\r\nelse:\r\n print(2)\r\n vis = set(nums)\r\n res = []\r\n for i in range(2, n+2):\r\n if i in vis:\r\n res.append(\"2\")\r\n else:\r\n res.append(\"1\")\r\n print(\" \".join(res))", "import math\r\n\r\nt = int(input())\r\nresult = \"\"\r\nif t < 3:\r\n print(1)\r\nelse:\r\n print(2)\r\n\r\nm = t + 2\r\nnums = [True] * m\r\nnums[0] = False\r\nnums[1] = False\r\n\r\nfor i in range(2, int(math.sqrt(m)) + 1):\r\n j = 0\r\n while i ** 2 + j * i < m:\r\n nums[i ** 2 + j * i] = False\r\n j += 1\r\n\r\nfor i in range(2, m):\r\n if nums[i]:\r\n result += \"1 \"\r\n else:\r\n result += \"2 \"\r\n\r\nresult = result[:-1]\r\nprint(result)", "#https://codeforces.com/problemset/problem/776/B\n\nn = int(input())\n\nif n <= 2:\n print(\"1\")\nelse:\n print(\"2\")\n\nfor i in range(2, n + 2, 1):\n prime = True\n for x in range(2, (int(i**(0.5)) + 1), 1):\n if i % x == 0:\n prime = False\n print(2, end=\" \")\n break\n if prime:\n print(1, end=\" \")\n\n", "n = int(input())\nif n <= 2: print(1)\nelse: print(2)\nn+=2\nresult = ['1']*(n)\nfor i in range(2, int(n**0.5) + 1):#siv\n j = 0\n while i ** 2 + j * i < n:\n result[i ** 2 + j * i] = '2'\n j += 1\nprint(\" \".join(result[2:]))", "import sys\r\nfrom math import sqrt\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn = int(inpu())\r\nif n == 1:\r\n prin(\"1\\n1\\n\")\r\nelif n == 2:\r\n prin(\"1\\n1 1\\n\")\r\nelse:\r\n n += 1\r\n prime = [1 if i & 1 == 1 else 2 for i in range(n + 1)]\r\n prime[2] = 1\r\n for i in range(3, int(sqrt(n)) + 1, 2) :\r\n if prime[i]:\r\n for j in range(i*i, n + 1, i) :\r\n prime[j] = 2\r\n prin(f\"2\\n{' '.join(map(str, prime[2:]))}\\n\")", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().strip().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().strip().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().strip().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\nn=int(input())+1\na=[1]*(n+1)\na[0]=2;a[1]=2\nfor i in range(2,n+1):\n if a[i]==1:\n for j in range(2,(n//i)+1):\n a[i*j]=2\nprint(1 if n==2 or n==3 else 2 )\nprint(*a[2:]) \n", "n = int(input())\r\nmark = [1] * n\r\nif n <= 2:\r\n print(1)\r\nelse:\r\n for i in range(int(n ** 0.5) + 1):\r\n if mark[i] == 1:\r\n for j in range(2 * i + 2, n, i + 2):\r\n mark[j] = 2\r\n print(2)\r\nprint(*mark)", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\ndef prime_sieve(n):\r\n \"\"\"returns a sieve of primes >= 5 and < n\"\"\"\r\n flag = n % 6 == 2\r\n sieve = bytearray((n // 3 + flag >> 3) + 1)\r\n for i in range(1, int(n**0.5) // 3 + 1):\r\n if not (sieve[i >> 3] >> (i & 7)) & 1:\r\n k = (3 * i + 1) | 1\r\n for j in range(k * k // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n for j in range(k * (k - 2 * (i & 1) + 4) // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n return sieve\r\n\r\n\r\ndef prime_list(n):\r\n \"\"\"returns a list of primes <= n\"\"\"\r\n res = []\r\n if n > 1:\r\n res.append(2)\r\n if n > 2:\r\n res.append(3)\r\n if n > 4:\r\n sieve = prime_sieve(n + 1)\r\n res.extend(3 * i + 1 | 1 for i in range(1, (n + 1) // 3 + (n % 6 == 1)) if not (sieve[i >> 3] >> (i & 7)) & 1)\r\n return res\r\n \r\n \r\ndef process(n):\r\n P = prime_list(n+1)\r\n answer = [2 for i in range(n+2)]\r\n answer[1] = 1 \r\n for x in P:\r\n answer[x] = 1 \r\n answer = answer[2:]\r\n m = max(answer)\r\n sys.stdout.write(f'{m}\\n')\r\n answer = ' '.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\n \r\n \r\n \r\nn = int(input())\r\nprocess(n)", "x = int(input())\np = []\nif x > 2:\n print(2)\nelse:\n print(1)\nfor i in range(2, x + 2):\n new = False\n for j in p:\n if not i % j:\n new = True\n break\n if new:\n print(2, end=' ')\n else:\n print(1, end=' ')\n p.append(i)", "n=int(input())\r\nll=[1]\r\nfor i in range(3,n+2):\r\n flag=False\r\n t=2\r\n while t*t<=i:\r\n if i%t==0:\r\n flag=True\r\n break\r\n else:\r\n t+=1\r\n if not flag:\r\n ll.append(1)\r\n else:\r\n ll.append(2)\r\nif n>2:\r\n print(2)\r\n print(*ll)\r\nelse:\r\n print(1)\r\n print(*ll)", "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\nres = [0] * n\r\nfor i in range(n) :\r\n if res[i] == 0 :\r\n res[i] = 1\r\n for j in range(i + (i + 2), n, i + 2) :\r\n res[j] = 2\r\nprint(2 if n > 2 else 1)\r\nprint(\" \".join(str(i) for i in res))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n = int(input())\r\nn += 2\r\nu = [1] * n\r\nfor i in range(2, n):\r\n if u[i] == 1:\r\n for j in range(i*i, n, i):\r\n u[j] = 2\r\n\r\nprint(max(u[2:]))\r\nprint(' '.join(map(str, u[2:])))\r\n", "n=int(input())+2\r\nans=[1]*n\r\nfor i in range(2,n):\r\n for j in range(i*i,n,i):\r\n ans[j]=2\r\nprint(len(set(ans[2:])))\r\nprint(*ans[2:])", "import math\n\n# print(\"Input n\")\nn = int(input())\n\ndef isPrime(n):\n for i in range(2, int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n return True\n\nif n == 1:\n print(1)\n print(1)\nelif n == 2:\n print(1)\n print(\"1 1\")\nelse:\n print(2)\n answerlist = []\n for i in range(2, n+2):\n if isPrime(i):\n answerlist.append(\"1\")\n else:\n answerlist.append(\"2\")\n print(\" \".join(answerlist))\n\n\n \n", "\r\nn=int(input())\r\nval=['a']*2+[1]*(n)\r\ni=2\r\nwhile i*i<=n+1:\r\n if val[i]:\r\n for j in range(2*i,len(val),i):\r\n val[j]=0\r\n i+=1\r\nans=[]\r\nfor i in val:\r\n if i==1:\r\n ans.append(1)\r\n elif i==0:\r\n ans.append(2)\r\nj=len(set(ans)) \r\nprint(j)\r\nprint(*ans) \r\n", "import math\n\nsize = int(input())\nresult = \"\"\nif size < 3:\n print(1)\nelse:\n print(2)\n\nm = size + 2\nnumbers = [True] * m\nnumbers[0] = False\nnumbers[1] = False\n\nfor i in range(2, int(math.sqrt(m)) + 1):\n j = 0\n while i ** 2 + j * i < m:\n numbers[i ** 2 + j * i] = False\n j += 1\n\nfor i in range(2, m):\n if numbers[i]:\n result += \"1 \"\n else:\n result += \"2 \"\n\nresult = result[:-1]\nprint(result)\n\n \t\t \t\t\t \t\t\t \t \t \t \t \t \t\t\t", "import math\r\ndef isPrime(n):\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if (n%i) == 0:\r\n return False\r\n return True\r\nn=int(input())\r\nm,ans=2,[]\r\nfor i in range(2,n+2):\r\n if isPrime(i):\r\n ans.append(1)\r\n else:\r\n ans.append(2)\r\nprint(len(set(ans)))\r\nprint(*ans)", "from math import sqrt\r\n\r\ndef paintJewels(n: int):\r\n\tisPrime = [True for i in range(n + 1)]\r\n\tnsqrt = int(sqrt(n))\r\n\tfor i in range(2, nsqrt + 1):\r\n\t\tif isPrime[i]:\r\n\t\t\tfor j in range(i * i, n + 1, i):\r\n\t\t\t\tisPrime[j] = False\r\n\tif n - 1 > 2:\r\n\t\tprint('2')\r\n\telse:\r\n\t\tprint('1')\r\n\tfor i in range(2, n + 1):\r\n\t\tif isPrime[i]:\r\n\t\t\tprint('1', end=' ')\r\n\t\telse:\r\n\t\t\tprint('2', end=' ')\r\n\r\nN = int(input().strip())\r\npaintJewels(N + 1)", "k=int(input())+2\nar=[1]*k\nfor i in range(2,k):\n for j in range(i*i,k,i):\n ar[j]=2\nprint(len(set(ar[2:])))\nprint(*ar[2:])\n \t \t\t\t\t \t\t\t \t\t \t\t \t \t", "n = int(input())\r\nN = n+2\r\nis_prime = [1]*N\r\n# We know 0 and 1 are composites\r\nis_prime[0] = 0\r\nis_prime[1] = 0\r\n\r\ndef sieve():\r\n \"\"\"\r\n We cross out all composites from 2 to sqrt(N)\r\n \"\"\"\r\n i = 2\r\n # This will loop from 2 to int(sqrt(x))\r\n while i*i <= N:\r\n # If we already crossed out this number, then continue\r\n if is_prime[i] == 0:\r\n i += 1\r\n continue\r\n\r\n j = 2*i\r\n while j < N:\r\n # Cross out this as it is composite\r\n is_prime[j] = 0\r\n # j is incremented by i, because we want to cover all multiples of i\r\n j += i\r\n\r\n i += 1\r\n\r\nsieve()\r\n\r\nc=0\r\nif(n<5):\r\n c=1\r\n s = \"1 \"\r\n for i in range(2,n+1):\r\n if((i+1)!=4):\r\n s +=\"1 \"\r\n else:\r\n s +=\"2 \"\r\n c+=1\r\n \r\n print(c)\r\n print(s)\r\nelse:\r\n print(\"2\")\r\n # print(is_prime)\r\n s= \"\"\r\n i=1\r\n for i in range(1,n+1):\r\n k = i+1\r\n if(is_prime[k] == 1):\r\n s+=\"1 \"\r\n else:\r\n s+=\"2 \"\r\n print(s)\r\n ", "n = int(input())\r\nans = [0 for _ in range(n+2)]\r\nfor x in range(2, n+2):\r\n if ans[x]:\r\n continue\r\n ans[x] = 1\r\n for z in range(2*x, n+2, x):\r\n ans[z] = 2\r\nprint(len(set(ans[2:])));print(*ans[2:])", "import math\n\nn = int(input())\nif n == 1:\n print(1)\n print(1)\n exit(0)\nprime = [2]\nans = [1]\nfor i in range(3, n+2):\n curr = 0\n sq = math.floor(math.sqrt(i))\n isPrime = True\n while curr < len(prime) and prime[curr] <= sq:\n if i % prime[curr] == 0:\n isPrime = False\n break\n curr += 1\n if isPrime:\n prime.append(i)\n ans.append(1)\n else:\n ans.append(2)\n\nprint(2 if n > 2 else 1)\nprint(' '.join(map(str, ans)))\n", "def sherlock(N):\r\n spf=[1]*(N+2)\r\n p=2\r\n\r\n while (p*p<=N+2):\r\n if spf[p]==1:\r\n for j in range(p*p,N+2,p):\r\n if spf[j]==1:\r\n spf[j]=2\r\n\r\n p+=1\r\n return spf\r\n\r\n# print(len(set(spf[2:])))\r\n# for i in spf[2:]:\r\n# print(i,end='')\r\n\r\nif __name__=='__main__':\r\n N=int(input())\r\n spf=sherlock(N)\r\n print(len(set(spf[2:])))\r\n for i in spf[2:]:\r\n print(i,end=' ') \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef solve(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i == 0:\r\n return 2\r\n return 1\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\n print(1)\r\nelif n == 2:\r\n print(1)\r\n print(1, 1)\r\nelse:\r\n print(2)\r\n for i in range(2, n+2):\r\n print(solve(i), end=' ')", "def is_prime(n):\n if n == 1:\n return False\n for i in range(2, int(n**(1/2))+1):\n if n % i == 0:\n return False\n return True\n\nn = int(input())\nans = []*(n)\nbool = True\nfor i in range(2, n+2):\n if is_prime(i):\n ans.append(1)\n else:\n bool = False\n ans.append(2)\nif bool:\n print(1)\nelse:\n print(2)\nprint(*ans)", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n sieve=[0]*100005\r\n for i in range(2,n+2):\r\n if sieve[i]==0:\r\n j=2*i\r\n while j<n+2:\r\n sieve[j]=1\r\n j+=i\r\n if n<=2:\r\n print(1) \r\n else:\r\n print(2)\r\n for i in range(2,n+2):\r\n if sieve[i]:\r\n print(\"2\",end=\" \")\r\n else:\r\n print(\"1\",end=\" \")\r\n \r\nobj=solve()", "\r\nN=100001\r\nprimes=[True for i in range(N+1)]\r\ni=2\r\nwhile i*i<=N:\r\n if primes[i]:\r\n for j in range(i*i,N+1,i):\r\n primes[j]=False\r\n i+=1\r\nn=int(input())\r\nif n > 2:\r\n print(\"2\")\r\nelse:\r\n print(\"1\")\r\n\r\nfor i in range(2, n + 2):\r\n if primes[i]:\r\n print(\"1\", end=\" \")\r\n else:\r\n print(\"2\", end=\" \")", "import sys\r\n# sys.stdin = open('input.txt','r')\r\nn = int(input())\r\nA = [True]*(n+2)\r\nfound = False\r\ndef solve():\r\n\tfor i in range(2,n+2):\r\n\t\tif A[i] == True:\r\n\t\t\tfor j in range(i+i,n+2,i):\r\n\t\t\t\tA[j] = False\r\n\r\nsolve()\r\nif n > 2:\r\n\tprint(2)\r\nelse:\r\n\tprint(1)\r\nfor i in range(2,n+2):\r\n\tif A[i] == True:\r\n\t\tprint(1,end=' ')\r\n\telse:\r\n\t\tprint(2,end=' ')", "# LUOGU_RID: 105868192\nimport math\n\ndef is_prime(x):\n if x <= 1:\n return False\n if x == 2 or x == 3:\n return True\n if x % 6 != 1 and x % 6 != 5:\n return False\n for i in range(5, int(math.sqrt(x))+1, 6):\n if x % i == 0 or x % (i+2) == 0:\n return False\n return True\n\nn = int(input().strip())\nif n <= 2:\n print(1)\n for i in range(1, n+1):\n print(1)\nelse:\n print(2)\n for i in range(2, n+1):\n if is_prime(i):\n print(1, end=' ')\n else:\n print(2, end=' ')\n if is_prime(n+1):\n print(1)\n else:\n print(2)\n", "def SieveOfEratosthenes(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 i in range(p * 2, n+1, p):\r\n\t\t\t\tprime[i] = False\r\n\t\tp += 1\r\n\tnuPrime = prime[2:n]\r\n\treturn nuPrime\r\n\r\nn = int(input())\r\n\r\nprime = SieveOfEratosthenes(n+2)\r\n\r\nif n == 1:\r\n\tprint(1)\r\n\tprint(1)\r\nelif n == 2:\r\n\tprint(1)\r\n\tprint(\"1 1\")\r\nelse:\r\n\tprint(2)\r\n\tfor i in range(n):\r\n\t\tif(prime[i]):\r\n\t\t\tprint('1 ', end='')\r\n\t\telse:\r\n\t\t\tprint('2 ', end='')\r\n", "import math\nt = int(input())\n\nm = t+ 2\n\na = [0] * m\n# b = [[] for i in range(m)]\n\nc = 1\n\nfor i in range(2, m):\n if a[i] == 0:\n a[i] = 1\n for j in range(2, m):\n k = i * j\n if k >= m:\n break\n c = 2\n a[k] = c\n # b[k].append(i)\n\nprint(c)\nprint(*a[2:], sep=' ')\n\n# print(a[2:])\n# for i, v in enumerate(b):\n# print(i, v)", "n = int(input())\r\na = [1 for _ in range(n + 2)]\r\nouts = \"1\\n\"\r\nif n > 2:\r\n outs = \"2\\n\"\r\nfor i in range(2, n + 2):\r\n outs += str(a[i]) + \" \"\r\n if a[i] == 1:\r\n for j in range(i * 2, n + 2, i):\r\n a[j] = 2\r\nprint(outs)", "#776B\r\nfrom math import sqrt\r\nn = int(input())\r\nnums = [1]*n\r\nfor i in range(2,n+2):\r\n if nums[i-2]:\r\n for j in range(2,(n+1)//i+1):\r\n nums[i*j-2] = 0\r\nif n > sum(nums):\r\n print(2)\r\nelse:\r\n print(1)\r\nfor i in range(n):\r\n if nums[i]:\r\n print(1, end=\" \")\r\n else:\r\n print(2, end=\" \")", "from sys import stdout, stdin\r\nimport math\r\nr = lambda: int(input())\r\nra = lambda: [*map(int, input().split())]\r\nraw = lambda: [*stdin.readline()]\r\nout = lambda a: stdout.write(\"\".join(a))\r\n\r\ndef s(a):\r\n if a<=1: return False\r\n else:\r\n for i in range(2, int(math.sqrt(a))+1):\r\n if a%i==0:\r\n return False\r\n return True\r\n\r\nn = r()\r\ndi = {}\r\nk = 1\r\nres = ''\r\np = [i+2 for i in range(n)]\r\nfor i in range(n):\r\n if s(p[i]):\r\n res +='1 '\r\n else:\r\n res+='2 '\r\nif '2' in res: k = 2\r\nprint(k)\r\nout(res)\r\n\r\n", "import math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n sieve = [True] * 100005\r\n sieve[0] = False\r\n sieve[1] = False\r\n\r\n for i in range(2, int(math.sqrt(100005)) + 1):\r\n if (sieve[i]):\r\n for j in range(2 * i, 100005, i):\r\n sieve[j] = False\r\n\r\n if n == 1:\r\n print(\"1\\n1\")\r\n\r\n elif n == 2:\r\n print(\"1\\n1 1\")\r\n\r\n else:\r\n print(\"2\")\r\n for i in range(2, n + 2):\r\n if(sieve[i]):\r\n print(\"1\", end=\" \")\r\n else:\r\n print(\"2\", end=\" \")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\n\r\narr=[]\r\n\r\nfor i in range(n+2):\r\n\tarr.append(1)\r\n\r\nx=2\r\n\r\nwhile(x*x<=n+1):\r\n\r\n\tif(arr[x]==1):\r\n\r\n\t\tif(2*x<=n+1):\r\n\r\n\t\t\tfor j in range(x*2,n+2,x):\r\n\t\t\t\tarr[j]=2\r\n\r\n\tx+=1\r\n\r\nif(n==1 or n==2):\r\n\tprint(1)\r\nelse:\r\n\tprint(2)\r\nfor y in range(2,n+2):\r\n\tprint(arr[y],end=\" \")", "sieve=[True]*100005\r\nprime=[]\r\nfor i in range(2,100005):\r\n if(sieve[i]):\r\n prime.append(i)\r\n for j in range(i*i,100005,i):\r\n sieve[j]=False\r\nn=int(input())\r\nif(n<=2):\r\n print(1)\r\n print(\"1 \"*n)\r\nelse:\r\n print(2)\r\n for i in range(2,n+2):\r\n print(sieve[i]+1,end=\" \")", "n=int(input())\r\na=[1]*(n+2)\r\nfor i in range(2,n+2):\r\n if a[i]!=2:\r\n j=2*i\r\n while j<=n+1:\r\n a[j]=2\r\n j=j+i\r\nif n>2:\r\n print(\"2\")\r\nelse:\r\n print(\"1\")\r\nc=a[2 :]\r\nprint(*c,sep=\" \")", "n = int(input())\r\nif n <= 2:\r\n print(1)\r\n print(*([1]*n))\r\nelse:\r\n print(2)\r\n for k in range(2,n+2):\r\n for i in range(2,int(k**0.5)+1):\r\n if k % i == 0:\r\n print(2,end=' ')\r\n break\r\n else:\r\n print(1,end=' ')", "n = int(input())+1\r\nans = [1]*(n+1)\r\nprime = [True]*(n+1)\r\nfor i in range(2,n+1):\r\n if prime[i]:\r\n for j in range(i*i,n+1,i):\r\n prime[j]=False\r\nif n ==2:\r\n print(1)\r\n print(1)\r\nelif n ==3:\r\n print(1)\r\n print(1,1)\r\nelse:\r\n print(2)\r\n for i in range(2,n+1):\r\n if prime[i]:\r\n print(1,end=\" \")\r\n else:\r\n print(2, end=\" \")", "n=int(input())\r\nsieve=[1]*(n+2)\r\nsieve[0]=0\r\nfor i in range(2,n+2):\r\n\tsieve[i]=i\r\n\r\nfor i in range(2,int((n+2)**0.5)+1):\r\n\tif sieve[i]==i:\r\n\t\tfor j in range(i*i,n+2,i):\r\n\t\t\tif sieve[j]==j:\r\n\t\t\t\tsieve[j]=i\r\nl1=[]\r\ndic={}\r\ncount=1\r\nfor i in range(2,n+2):\r\n\tif sieve[i]==i:\r\n\t\tdic[i]=count\r\n\t\tl1.append(count)\r\n\telse:\r\n\t\tl1.append(2)\r\nprint(len(set(l1)))\r\nprint(*l1)", "n = int(input())\r\nt = [1] * (n+2)\r\nfor i in range(2, n+2):\r\n for j in range(i * i, n+2, i):t[j] = 2\r\nif n>2:\r\n print(2)\r\nelse:\r\n print(1)\r\nprint(*t[2:])", "n=int(input())\r\nif n>2:\r\n l=[0 for i in range(n)]\r\n i=0\r\n while i<n:\r\n if l[i]==0:\r\n c=1\r\n l[i]=c\r\n for j in range((i+2)*(i+2)-2,n,i+2):\r\n if l[j]==0:\r\n l[j]=2\r\n i+=1\r\n print(2)\r\n print(*l)\r\nelse:\r\n print(1)\r\n l=[1]*n\r\n print(*l)\r\n", "n=int(input())\r\nprimes=[0]*(n+2)\r\nfor i in range(2,n+2):\r\n if not primes[i]:\r\n for j in range(2*i,n+2,i):\r\n primes[j]=1\r\nif n>2:\r\n print(2)\r\nelse:\r\n print(1)\r\nfor k in range(2,n+2):\r\n if not primes[k]:\r\n print(1,end=' ')\r\n else:\r\n print(2,end=' ')", "\r\nimport math as ma\r\n\r\nn = int(input())\r\n\r\n#primes = array.array('b', )\r\n\r\nmaxN = 100001\r\nprimes = [0]*(n+2)\r\ncolor = [0]*(n+2)\r\n\r\nc = 1\r\n\r\nfor p in range(2, n+2):\r\n if (primes[p] == 0):\r\n for l in range(p, n+2-p, p):\r\n primes[p+l]=1\r\n \r\nncolors = 1\r\nfor p in range(2, n+2):\r\n if (primes[p] == 0):\r\n color[p] = 1\r\n else: \r\n color[p] = 2\r\n ncolors = 2\r\n \r\nprint(ncolors)\r\nfor p in range(2, n+2):\r\n print(color[p], end =\" \")\r\n\r\n\r\n\r\n", "from sys import stdin, stdout\ndef get_ints(): return map(int, stdin.readline().split())\ndef PRINT(s): stdout.write(s + '\\n')\n# n = int(stdin.readline())\n# arr = [int(x) for x in stdin.readline().split()]\n\ndef logic(n):\n if n <= 2:\n PRINT('1')\n if n == 1:\n PRINT('1')\n else:\n PRINT('1 1')\n return\n \n PRIME = [True]*(n+1)\n\n p = 2\n while p <= (n+1)**(1/2):\n for i in range(2*p, n+2, p):\n PRIME[i-1] = False\n #update p\n p += 1\n while PRIME[p-1] == False:\n p += 1\n PRINT('2')\n PRINT(' '.join([['2','1'][PRIME[i]] for i in range(1,n+1)]))\n\nn = int(stdin.readline())\nlogic(n)\n\n\n", "n=int(input())\r\nl=list(range(2,n+2))\r\nl=[0,0]+l\r\nfor i in range(2,n+2):\r\n if 2*l[i]>n+1 or (i!=2 and l[i]==2):\r\n continue\r\n for j in range(2*l[i],n+2,l[i]):\r\n if l[j]>2:\r\n l[j]=2\r\nfor i in range(2,n+2):\r\n if l[i]>2 :\r\n l[i]=1\r\nl[2]=1\r\nprint(len(set(l))-1)\r\nfor i in range(2,n+2):\r\n print(l[i],end=\" \")\r\n", "a=[0]*100002\r\nfor i in range(2,100002):\r\n if not a[i]:\r\n j=2*i\r\n while j<=100001:\r\n a[j]=1\r\n j+=i\r\nn=int(input())\r\nif n<=2:\r\n print('1')\r\nelse:\r\n print('2')\r\nfor i in range(2,n+2):\r\n print(a[i]+1,end=' ')", "n = int(input())\r\na = [1]*(n+2)\r\nif n < 3:\r\n print(1)\r\n b = [1]*n\r\n print(*b)\r\nelse:\r\n for i in range(2, n+2):\r\n if a[i] == 2:\r\n continue\r\n else: \r\n for j in range(i+i, n+2, i):\r\n a[j] = 2 \r\n print(2)\r\n print(*a[2:])", "from math import sqrt\r\nfrom itertools import count, islice\r\n\r\n\r\ndef is_prime(n):\r\n return n > 1 and all(n % i for i in islice(count(2), int(sqrt(n) - 1)))\r\n\r\n\r\nnumbers = [n + 1 for n in range(1, int(input()) + 1)]\r\nif len(numbers) > 2:\r\n print(2)\r\nelse:\r\n print(1)\r\nfor num in numbers:\r\n if is_prime(num):\r\n print(1)\r\n elif not is_prime(num):\r\n print(2)\r\n", "'''input\r\n10\r\n'''\r\ndef prime_sieve():\r\n\tsieve=[1]*1000001\r\n\tsieve[0]=0\r\n\tsieve[1]=0\r\n\tfor i in range(2,1001):\r\n\t if(sieve[i]==1):\r\n\t for j in range(i*i,1000001,i):\r\n\t sieve[j]=0\r\n\treturn sieve\r\nsieve=prime_sieve()\r\nn=int(input())\r\nif n==1 or n==2:\r\n\tprint(1)\r\n\tl=[1]*n\r\nelse:\r\n\tl=[]\r\n\tfor i in range(2,n+2):\r\n\t\t#print(i)\r\n\t\tif sieve[i]==1:\r\n\t\t\tl.append(1)\r\n\t\telse:\r\n\t\t\tl.append(2)\r\n\tprint(2)\r\nprint(*l)", "def sievearray(n):\r\n sieve=[1 for i in range(n+1)]\r\n primesum=[0 for i in range(n+1)]\r\n sieve[0]=0\r\n sieve[1]=0\r\n i=2\r\n while i*i<=n:#sieve array\r\n if sieve[i]==1:\r\n for j in range(i*i,n+1,i):\r\n sieve[j]=0\r\n i+=1\r\n return sieve\r\nn=int(input())\r\nsieve=sievearray(n+2)\r\nif n>2:\r\n print(2)\r\nelse:\r\n print(1)\r\nfor i in range(2,n+2):\r\n if sieve[i]==1:\r\n print(1,end=\" \")\r\n else:\r\n print(2,end=\" \")\r\n", "maxN = 100001\r\nisPrime = [1] * (maxN + 1)\r\nisPrime[0], isPrime[1] = 0, 0\r\ni = 2\r\nwhile i * i <= maxN:\r\n if isPrime[i]:\r\n j = i\r\n while i * j <= maxN:\r\n isPrime[i*j] = 0\r\n j += 1\r\n i += 1\r\n\r\n\r\nn = int(input())\r\nprimes, non_primes = 0, 0\r\nfor num in range(2, n+2):\r\n if isPrime[num]:\r\n primes += 1\r\n else:\r\n non_primes += 1\r\n\r\nif not non_primes:\r\n print(1)\r\nelse:\r\n print(2)\r\n\r\nfor num in range(2, n+2):\r\n if isPrime[num]:\r\n print(1, end=' ')\r\n else:\r\n print(2, end=' ')\r\n", "#begin of codeforces template\r\n# (don't delete):\r\n# \r\n# from collections import *\r\n# from heapq import *\r\n# import bisect\r\n#\r\n#t = int(input()) #input number of test cases\r\n#for _ in range(t): #iter for test cases\r\n# n = int(input()) #input int\r\n# n,m = map(int,input().split()) #input tuple\r\n# L = list(map(int,input().split())) #input list\r\n# s = input() #input string\r\n# ans = solve(s,L) #solve\r\n# print(ans)\r\n#\r\n#end of codeforces template\r\n\r\nfrom collections import *\r\nimport math\r\n\r\ninf = float(\"inf\")\r\n\r\ndef get_primes(n=100000):\r\n flag = False\r\n prime_number = [2]\r\n for i in range(3, n, 2):\r\n edge = math.ceil(math.sqrt(i))+1\r\n for j in prime_number:\r\n if i % j == 0:\r\n flag = True\r\n break\r\n if j >= edge:\r\n flag = False\r\n break\r\n if not flag:\r\n prime_number.append(i)\r\n return prime_number\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\n print(1)\r\nelif n == 2:\r\n print(1)\r\n print(1,1)\r\nelse:\r\n primes = set(get_primes(n+1))\r\n print(2)\r\n ans = []\r\n for i in range(2,n+2):\r\n ans.append(\"1\" if i in primes else \"2\")\r\n print(\" \".join(ans))", "def finderPrime(N = 1000006):\r\n #creating result array\r\n result = [True]*(N+1)\r\n\r\n #first mark 1 as a non prime bumber\r\n #TC - O(N log log N)\r\n result[0],result[1] = False,False\r\n\r\n #iterating 2 to N \r\n for i in range(2,N+1):\r\n if result[i]:\r\n for j in range(2*i,N+1,i):\r\n result[j] = False\r\n\r\n return result\r\n \r\nfinal_array = finderPrime()\r\nn = int(input())\r\nprimeCount, nonPrimeCount = 0, 0 \r\n#now start the procesiing \r\nfor i in range(2,n+2):\r\n if final_array[i]:\r\n primeCount += 1 \r\n else:\r\n nonPrimeCount += 1\r\n\r\n#process the first part\r\nif nonPrimeCount == 0:\r\n print(\"1\")\r\nelse:\r\n print(\"2\")\r\n\r\n#process the second part\r\nfor i in range(2,n+2):\r\n if final_array[i]:\r\n print(\"1\",end=\" \")\r\n else:\r\n print(\"2\",end=\" \")\r\n ", "n1 = int(input())\r\nn = n1 + 1\r\nall = []\r\nans = []\r\nfor v in range(2, n + 1):\r\n all.append(v)\r\nprimes = [i for i in range(n + 1)]\r\nprimes[1] = 0\r\ni = 2\r\nwhile i <= n ** (1 / 2):\r\n\r\n if primes[i] != 0:\r\n j = i + i\r\n while j <= n:\r\n primes[j] = 0\r\n j = j + i\r\n i += 1\r\nprimes = [i for i in primes if i != 0]\r\n\r\n\r\n\r\ndef prime_f(x):\r\n if x in primes: return 1\r\n if x % 2 == 0: return 2\r\n i = 3\r\n while x % i != 0 and i * i <= x:\r\n i += 2\r\n if i * i <= x: return i\r\n return x\r\n\r\nif n1 == 1 or n1 == 2:\r\n print(1)\r\nelse:\r\n print(2)\r\nfor i in all:\r\n if i in primes:\r\n print(1, end = ' ')\r\n else:\r\n print(2, end=' ')", "def ans(l):\r\n a = [1] * (l+1)\r\n a[0] = a[1] = 2\r\n for i in range(2, l+1):\r\n if a[i] == 1:\r\n for j in range(i*i, l+1, i):\r\n a[j] = 2\r\n return a\r\n\r\nl=int(input())\r\nif l==1:\r\n print(1)\r\n print(1)\r\nelif l==2:\r\n print(1)\r\n print(1, 1)\r\nelse: \r\n print(2)\r\n a = ans(l+1)\r\n print(*a[2:])", "def SieveOfEratosthenes(n):\r\n all_prime = []\r\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]:\r\n\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 p in range(2, n):\r\n if prime[p]:\r\n all_prime.append(p)\r\n return all_prime\r\n\r\nc = 1\r\nn = int(input())\r\nr = SieveOfEratosthenes(n+2)\r\nl = [0]*(n+2)\r\n\r\nif n > 2:\r\n c = 2\r\nfor i in r:\r\n l[i]= 1\r\n\r\nfor j in range(n+2):\r\n if l[j]==0:\r\n l[j] = 2\r\n\r\nprint(c)\r\nprint(*l[2:])", "# import sys\r\n# input=sys.stdin.readline\r\nimport math\r\nimport bisect\r\n\r\ndef SieveOfEratosthenes(num):\r\n prime = [True for i in range(num+1)]\r\n# boolean array\r\n p = 2\r\n c=2\r\n while (p * p <= num):\r\n \r\n # If prime[p] is not\r\n # changed, then it is a prime\r\n if (prime[p] == True):\r\n \r\n # Updating all multiples of p\r\n for i in range(p * p, num+1, p):\r\n prime[i] = False\r\n p += 1\r\n # Print all prime numbers\r\n # for p in range(2, num+1):\r\n # if prime[p]:\r\n # print(p)\r\n return prime\r\nn=int(input())\r\nprime=SieveOfEratosthenes(n+1)\r\nif(n<=2):\r\n print(1)\r\nelse:\r\n print(2)\r\nfor i in range(2,n+2):\r\n if prime[i]:\r\n print(1,end=\" \")\r\n else:\r\n print(2,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 \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \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 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 return prime\r\n \r\nn=int(input())\r\nx=SieveOfEratosthenes(n+1)\r\n\r\nl = [0]*n\r\nfor i in range(2,n+2):\r\n if(x[i]==True):\r\n l[i-2]=1\r\n else:\r\n l[i-2]=2\r\nif(False in x):\r\n print(2)\r\nelse:\r\n print(1)\r\nfor i in l:\r\n print(i,end=' ')\r\nprint()", "n=int(input())\r\n\r\nq=[1 for i in range(n+2)]\r\n\r\nfor i in range(2,n+2,1):\r\n if q[i]==1:\r\n for j in range(i*i,n+2,i):\r\n q[j]=2\r\nprint(max(q))\r\nprint(*q[2:])\r\n", "from math import sqrt\r\ndef isprime(t):\r\n\tfor i in range(2,int(sqrt(t))+1):\r\n\t\tif t%i==0:\r\n\t\t\treturn 0\r\n\treturn 1 \r\nn = int(input())\r\ns = []\r\ncnt = 1\r\nr = []\r\n\r\nfor i in range(2,n+2):\r\n\tif isprime(i):\r\n\t\tr.append(1)\r\n\telse:\r\n\t\tr.append(2)\r\nprint(max(r),\"\\n\",*r)", "x = int(input())\r\n\r\nif x <= 2:\r\n print(1)\r\nelse:\r\n print(2)\r\n\r\nprime = [True for i in range(x+2)]\r\np = 2\r\nwhile (p * p <= x+1):\r\n if (prime[p] == True):\r\n for i in range(p * p, x+2, p):\r\n prime[i] = False\r\n p += 1\r\n\r\n\r\nfor i in range(2, x+2):\r\n if prime[i]:\r\n print(1, end=\" \")\r\n else:\r\n print(2, end=\" \")\r\n\r\nprint()", "def seive_of_eratosthenes(n):\n prime = [True for i in range(n+1)]\n p = 2\n while p*p <= n:\n if prime[p]:\n for i in range(p*p, n+1, p):\n prime[i] = False\n p += 1\n return prime\n\nn = int(input())\nprime = seive_of_eratosthenes(n+1)\nans = []*(n)\nbool = True\nfor i in range(2, n+2):\n if prime[i]:\n ans.append(1)\n else:\n bool = False\n ans.append(2)\nif bool:\n print(1)\nelse:\n print(2)\nprint(*ans)", "n=int(input())\r\nprime=[0 for i in range(n+2)]\r\np=2\r\nwhile(p*p<=n+1):\r\n if(prime[p]==0):\r\n \tfor i in range(p*p,n+2,p):\r\n prime[i]=1\r\n p=p+1\r\nif n<3:\r\n\tprint(1)\r\nelse:\r\n\tprint(2)\r\nfor i in range(2,n+2):\r\n\tprime[i]=(prime[i]+1)\r\ns=' '.join(str(e) for e in prime[2:n+2])\r\nprint(s)\r\n", "import math\r\n\r\nn = int(input())\r\nn+=1\r\n\r\n\r\nprime = [True for i in range (n+1)]\r\ncolor = [1 for i in range (n+1)]\r\nprime[1] = False\r\n\r\nlim = math.floor(math.sqrt(n))\r\nfor i in range(2,lim+1):\r\n\tif(prime[i]==True):\r\n\t\tp = i*i\r\n\t\twhile(p<=n):\r\n\t\t\tprime[p]=False\r\n\t\t\tcolor[p] = color[i]+1\r\n\t\t\t\r\n\t\t\tp+=i\r\n\r\n\r\n\r\n\r\n\r\nk = max(color)\r\nprint(k)\r\nfor i in range(2,n+1):\r\n\tprint (color[i], end = ' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#User function Template for python3\r\n\r\nclass Solution:\r\n def __init__(self):\r\n self.sieve=[]\r\n self.spf=[]\r\n def buildsieve(self,n):\r\n self.spf=[-1]*(n-2)\r\n a=[-1]*(n-2)\r\n \r\n for i in range(0,n-2):\r\n fac=i+2\r\n #print(i,\".\",a[i],a)\r\n if(a[i]==-1):\r\n while(i+fac<n-2):\r\n if(a[i+fac]==-1):\r\n self.spf[i+fac]=0\r\n a[i+fac]=0\r\n i=i+fac\r\n \r\n self.sieve=a\r\n \r\n def primeFactors(self, N):\r\n\r\n if(len(self.sieve)<1):\r\n self.buildsieve(N+5)\r\n if(N>2):\r\n print(2)\r\n else:\r\n print(1)\r\n for i in range(0,N):\r\n if(self.sieve[i]==0):\r\n print(2,end=\" \")\r\n else:\r\n print(1,end=\" \")\r\n\r\nob=Solution()\r\nob.primeFactors(int(input()))\r\n", "def sieve(N):\r\n primeNumbers = [True]*(N+1)\r\n primeNumbers[0] = False\r\n primeNumbers[1] = False\r\n i = 2\r\n while i*i <= N:\r\n j = i\r\n if primeNumbers[j]:\r\n while j*i <= N:\r\n primeNumbers[j*i] = False\r\n j += 1\r\n i += 1\r\n return primeNumbers\r\n\r\n\r\ndef countColor(N):\r\n primes = sieve(pow(10, 6))\r\n if N > 2:\r\n print(\"2\")\r\n else:\r\n print(\"1\")\r\n print(end=\"\")\r\n for i in range(2, N+2):\r\n if primes[i]:\r\n print(\"1\", end=\" \")\r\n else:\r\n print(\"2\", end=\" \")\r\n # print(end=\"\")\r\n\r\n\r\nN = int(input())\r\ncountColor(N)\r\n", "def isPrime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(1 if isPrime(i+2) else 2)\r\nprint(len(list(set(l))))\r\nprint(*l)", "n=int(input())\r\na=[1 for i in range(n+2)]\r\nfor i in range(2,int(n**0.5)+2):\r\n if a[i]!=2:\r\n for j in range(i*2,n+2,i):a[j]=2\r\nprint(len(set(a)))\r\nprint(*a[2:])", "x=int(input())\r\np=[]\r\nif x>2:\r\n print(2)\r\nelse:\r\n print(1)\r\nfor i in range(2,x+2):\r\n n=False\r\n for j in p:\r\n if not i%j:\r\n n=True\r\n break\r\n if n:\r\n print(2,end=' ')\r\n else:\r\n print(1,end=' ')\r\n p.append(i)", "def solve (n) :\r\n colorNum = 1\r\n ans = [1]*n\r\n index = 0\r\n \r\n while index < n :\r\n if ans[index] == 1 :\r\n prime = index+2\r\n multiples = 2\r\n tar = prime*multiples\r\n while tar <= n+1 :\r\n if colorNum == 1 :\r\n colorNum = 2\r\n ans[tar-2] = 2\r\n multiples += 1\r\n tar = prime*multiples\r\n index += 1\r\n \r\n print(colorNum)\r\n for i in ans :\r\n print (i,end = \" \")\r\n \r\n \r\n \r\n \r\n \r\n \r\nn = int(input())\r\nsolve(n)\r\n \r\n ", "m = int(input())\nres = [0]*(m+2)\nfor x in range(2,m+2):\n if res[x] == 0:\n for y in range(2*x,m+2,x):\n if res[y] == res[x]:\n res[y] = 2\nres = res[2: ]\nfor x in range(len(res)):\n if res[x] == 0:\n res[x] = 1\nprint(max(res))\nfor x in res:\n print(x,end=\" \")\n\t \t\t\t\t\t \t \t\t \t\t\t \t\t \t \t", "# https://codeforces.com/problemset/problem/776/B\n\nn = int(input())\n\n# Sieve of Eratosthenes.\nsieve = [0 for x in range(n + 5)]\nfor i in range(2, n + 2):\n if sieve[i] is 0:\n j = 2 * i\n while (j <= n + 1):\n sieve[j] = 1\n j += i\n\n# Only two colors are needed since in 1D we can alternate between two.\nif n > 2:\n print(2)\nelse:\n print(1)\n\nfor s in range(2, n + 2):\n if sieve[s] is 0:\n print(1, end = ' ')\n else:\n print(2, end = ' ')\n", "n = int(input())\nprimes = [True] * (n + 2)\nfor i in range(2, (n+1)//2 + 1):\n for j in range(2, (n+1)//i +1):\n primes[i*j] = False\nif n <= 2:\n print(1)\nelse:\n print(2)\nfor i in range(2, n+2):\n if primes[i]:\n print(1, end=' ')\n else:\n print(2, end=' ')\n\n\n", "def Sieve(n):\r\n l=[True for i in range(n+1)]\r\n p=2\r\n while(p*p<=n):\r\n if(l[p]):\r\n for i in range(p*p,n+1,p):\r\n l[i]=False\r\n p+=1\r\n for i in range(n+1):\r\n if(l[i]):\r\n l[i]=1\r\n else:\r\n l[i]=2\r\n return l\r\nn=int(input())\r\nif(n==1):\r\n print(1)\r\n print(1)\r\nelif(n==2):\r\n print(1)\r\n print(1,1)\r\nelse:\r\n print(2)\r\n print(*Sieve(n+1)[2:])", "import math\r\n\r\nn = int(input())\r\nanswer = \"\"\r\nif n < 3:\r\n print(1)\r\nelse:\r\n print(2)\r\n\r\nm = n + 2\r\nnumbers = [True] * m\r\nnumbers[0] = False\r\nnumbers[1] = False\r\n\r\nfor i in range(2, int(math.sqrt(m)) + 1):\r\n j = 0\r\n while i ** 2 + j * i < m:\r\n numbers[i ** 2 + j * i] = False\r\n j += 1\r\n\r\nfor i in range(2, m):\r\n if numbers[i]:\r\n answer += \"1 \"\r\n else:\r\n answer += \"2 \"\r\n\r\nanswer = answer[:-1]\r\nprint(answer)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/776/B\n\nimport math\n\n\n# returns a list of all prime numbers <= limit\n# limit must be a positive number.\ndef sieve_of_eratosthenes(limit):\n # 0, 1 are not prime\n is_prime_array = [False] * 2 + [True] * (limit - 1)\n\n for num in range(2, int(math.sqrt(limit)) + 1):\n if is_prime_array[num]:\n # go through every multiple of num (excluding num itself) and make it not prime\n is_prime_array[num * 2::num] = [False] * len(is_prime_array[num * 2::num])\n\n return set(num for num in range(len(is_prime_array)) if is_prime_array[num])\n\nn = int(input())\n\ns_p = sieve_of_eratosthenes(n + 2)\n\n\nprint(1 if n <= 2 else 2)\nfor i in range(2, n + 2):\n if i in s_p:\n print(\"1\", end = \" \")\n else:\n print(\"2\", end = \" \")\n", "def main():\n n = int(input())\n primes = [True for i in range(n)]\n for i in range(n):\n if primes[i]:\n j = 1+ i\n while True:\n index = i + (i+2) * j\n if index >= n:\n break\n primes[index] = False\n j += 1\n if n<=2:\n print(1)\n else:\n print(2)\n for prime in primes:\n if prime:\n print(1,end=\" \")\n else:\n print(2,end=\" \")\n\n print()\n\n\nif __name__ ==\"__main__\":\n main()\n", "n = int(input()) + 2\r\nC = [1] * n\r\nfor i in range(2, n):\r\n for j in range(i * i, n, i):\r\n C[j] = 2\r\nprint(len(set(C[2:])))\r\nprint(*C[2:])", "n = int(input())\r\ncolors = [1 for i in range(n+2)]\r\nfor i in range(2, n+2):\r\n if colors[i]:\r\n j = 2\r\n while j*i <= n+1:\r\n colors[i*j] = 0\r\n j += 1\r\nx = min(colors[2:])\r\nif x == 0:\r\n print(2)\r\nelse:\r\n print(1)\r\n\r\nfor i in range(2, n+2):\r\n y = colors[i]\r\n if y == 0:\r\n y = 2\r\n print(y, end=' ')\r\n\r\n\r\n", "from sys import stdin,stdout\r\ndef simplesieve(n):\r\n prime=[]\r\n mark=[1]*(n+1)\r\n p=2\r\n while (p*p<=n):\r\n if mark[p]:\r\n for i in range(p*p,n+1,p):\r\n mark[i]=0\r\n p+=1\r\n return mark\r\nn=int(input())\r\na=simplesieve(n+1)\r\nk=2\r\nb=[]\r\nfor i in range(2,n+2):\r\n if(a[i]==1):\r\n b.append(1)\r\n else:\r\n b.append(2)\r\nprint(len(set(b)))\r\nprint(*b)", "n=int(input())\r\nprime = [True for i in range(n+3)]\r\ndef SieveOfEratosthenes(n):\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 += 1\r\nSieveOfEratosthenes(n+2)\r\np=[]\r\nfor i in range(2,n+2):\r\n if(prime[i]):\r\n p.append(1)\r\n else:\r\n p.append(2)\r\ns=set(p)\r\nprint(len(s))\r\nfor i in range(0,len(p)):\r\n print(p[i],end=' ')", "def find_sev(mx):\r\n sev = [0] * (mx+1) \r\n sev[0], sev[1] = 1, 1\r\n i = 2\r\n while i * i <= mx:\r\n if sev[i] == 0:\r\n j = i\r\n while j * i <= mx:\r\n sev[j * i] = 1\r\n j += 1\r\n i += 1\r\n return sev\r\nn = int(input())\r\nsev = find_sev(n+1)\r\nif n <= 2:\r\n print(1)\r\nelse:\r\n print(2)\r\nprint(\" \".join(map(lambda x: str(x+1), sev[2:])))", "n = int(input().strip())\r\nq = [i for i in range(n+2)]\r\nq[1]=0\r\ncolor = [1 for i in range(n+2)]\r\ni = 2\r\nwhile i < n+2:\r\n if q[i] != 0:\r\n for j in range(i*2,n+2,i):\r\n q[j] = 0\r\n color[j] = color[i]+1\r\n i += 1\r\nprint(len(set(color)))\r\nprint(*color[2:])", "sieve = [False for _ in range(100005)]\n\nn = int(input())\n\nfor i in range(2, n+2):\n\tif(not sieve[i]):\n\t\tj = 2 * i\n\t\twhile j <= (n+1):\n\t\t\tsieve[j] = True;\n\t\t\tj += i\n\nif n > 2:\n\tprint(\"2\")\nelse:\n\tprint(\"1\")\n\nfor i in range(2,n+2):\n\tprint(\"1\" if not sieve[i] else \"2\", end=\" \")\n", "def prime(n):\r\n if n==1:\r\n print(1)\r\n print(1)\r\n return\r\n if n==2:\r\n print(1)\r\n print(1,1)\r\n return\r\n arr = list(range(2, n + 2))\r\n for i in range(len(arr)):\r\n p=arr[i]\r\n if p==True or p==False:\r\n continue\r\n arr[i]=True\r\n for j in range(p*p,n+2,p):\r\n arr[j-2]=False\r\n\r\n d={True:1,False:2}\r\n for i in range(len(arr)):\r\n arr[i]=d[arr[i]]\r\n print(2)\r\n print(*arr)\r\n\r\n\r\n\r\nprime(int(input()))\r\n", "def smallest_prime_fac(n): # Smallest prime factor using Sieve of Eratosthenes\r\n prime = [1 for i in range(0, n+1)]\r\n\r\n for i in range(2, n+1):\r\n if prime[i] == 1:\r\n prime[i] = i\r\n for j in range(i*i, n+1, i):\r\n prime[j] = i\r\n \r\n return prime \r\n\r\nn = int(input())\r\n\r\nspf = smallest_prime_fac(n+2)\r\n\r\nseq = [0 for i in range(0, n+2)]\r\n\r\nfor i in range(2, n+2):\r\n seq[i] = seq[spf[i]] + 1 \r\n\r\nprint(max(set(seq[2:])))\r\nprint(*seq[2:], sep=\" \")", "n = int(input())\r\nisprime = [1]*(n+2)\r\nisprime[0] = isprime[1] = 0\r\ni = 2\r\nwhile i*i <= (n+1):\r\n if isprime[i]:\r\n j = i*i\r\n while j <= (n+1):\r\n isprime[j] = 0\r\n j += i\r\n i += 1\r\n\r\nif n == 1:\r\n print(1)\r\n print(1)\r\nelif n == 2:\r\n print(1)\r\n print(1,1,sep=\" \")\r\nelse:\r\n print(2)\r\n for i in range(2,n+2):\r\n if isprime[i] == 1:\r\n print(1,end=\" \")\r\n else:\r\n print(2,end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def sieve(n):\r\n\tmark = [True]*(n+1)\r\n\tp = 2\r\n\twhile p*p<=n:\r\n\t\tif mark[p]:\r\n\t\t\tfor i in range(p*p,n+1,p):\r\n\t\t\t\tmark[i] = False\r\n\t\tp+=1\r\n\tfor i in range(2,n+1):\r\n\t\tif mark[i]:\r\n\t\t\tprint(1,end=\" \")\r\n\t\telse:\r\n\t\t\tprint(2,end=\" \")\r\nn = int(input())\r\nif n==1 or n==2:\r\n\tprint(1)\r\nelse:\r\n\tprint(2)\r\nsieve(n+1)", "def sieve(n):\r\n prime=[1]*(n+1)\r\n prime[0]=0\r\n prime[1]=0\r\n i=2\r\n while(i*i<=n):\r\n if(prime[i] ==1):\r\n for j in range(i**2,n+1,i):\r\n prime[j]=0\r\n i+=1\r\n return prime\r\n\r\nn = int(input())\r\na = sieve(n+1)\r\ntotal=[]\r\nfor i in range(2,n+2):\r\n if(a[i]==1):\r\n total.append(1)\r\n else:\r\n total.append(2)\r\nprint(len(set(total)))\r\nfor i in total:\r\n print(i,end=\" \")\r\nprint()", "n=int(input())\r\nseive=[1]*(n+2)\r\nseive[0]=-1\r\nseive[1]=-1\r\nfor i in range(n+2):\r\n if seive[i]==1:\r\n for j in range(i*2,n+2,i):\r\n seive[j]=2 \r\nif(n==1 or n==2):\r\n print(1)\r\n for i in range(2,n+2):\r\n print(seive[i],end=' ')\r\nelif(n==0):\r\n print(0)\r\nelse:\r\n print(2)\r\n for i in range(2,n+2):\r\n print(seive[i],end=' ')", "n = int(input())\narr = [1] * n\nfor i in range(2, n + 2):\n if arr[i - 2]:\n for j in range(i * i, n + 2, i):\n arr[j - 2] = 0\nprint(len(set(arr)))\nprint(' '.join(('1' if arr[i - 2] == 1 else '2') for i in range(2, n + 2)))", "n=int(input())\nimport math\nprime={}\nfor i in range(1,n+1):\n\tprime[i+1]=1\n\n\n\n\n\nfor i in range(2,n+2):\n\tfor j in range(i*i,n+2,i):\n\t\n\t\tprime[j]=2\n\n\n\n\n\nans=[]\nfor j in prime.values():\n\tans.append(j)\ns=set(ans)\nprint(len(s))\nprint(*ans)\n\n", "vis = [0] * int(1e5+3)\r\n\r\ndef sieve():\r\n for i in range(2, int(1e5+3)):\r\n if vis[i]:\r\n continue\r\n j = i * i\r\n while j < int(1e5+3):\r\n vis[j] = 1\r\n j += i\r\n\r\nsieve()\r\nn = int(input())\r\nprint(1 if n <= 2 else 2)\r\nfor i in range(2, n+2):\r\n vis[i] += 1\r\nprint(*vis[2:n+2])\r\n", "def SOE(n):\r\n isPrime = [1] * (n+1)\r\n isPrime[0] = isPrime[1] = 2\r\n for i in range(2, n+1):\r\n if isPrime[i] == 1:\r\n for j in range(i*i, n+1, i):\r\n isPrime[j] = 2\r\n return isPrime\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\n print(1)\r\nelif n == 2:\r\n print(1)\r\n print(1, 1)\r\nelse:\r\n print(2)\r\n a = SOE(n+1)\r\n print(*a[2:])\r\n ", "n = int(input())\r\n\r\nprime = [True]*(n+5)\r\ni = 2\r\nwhile i*i<=n+1:\r\n if prime[i] == True:\r\n j = i*2\r\n while j<=n+1:\r\n prime[j] = False\r\n j += i\r\n i += 1\r\nif n == 1:\r\n print(1)\r\n print(1)\r\nelif n == 2:\r\n print(1)\r\n print(1,1)\r\nelse:\r\n l = []\r\n for i in range(2,n+2):\r\n if prime[i]:\r\n l.append(1)\r\n else:\r\n l.append(2)\r\n print(2)\r\n print(*l)", "def get_primes(n):\n m = n+2\n numbers = ['1'] * m\n for i in range(2, int(n**0.5 + 1)):\n if numbers[i] == '1':\n for j in range(i*i, m, i):\n numbers[j] = '2'\n return numbers[2:]\n\nentrada = int(input()) #Número de peças\n\nif entrada == 1:\n print(\"1\\n1\")\n\nelif entrada == 2:\n print(\"1\\n1 1\")\n\nelif entrada == 3:\n print(\"2\\n1 1 2\")\n\nelse:\n print(\"2\")\n print(\" \".join(get_primes(entrada)))", "num=[0]*100009\r\nn=int(input())\r\nm=1\r\nfor i in range(2,n+2,1):\r\n if num[i]==0:\r\n num[i]=1\r\n for j in range(i+i,n+2,i):\r\n num[j]=2\r\n m=2\r\nprint(m)\r\nfor i in range(2,n+2,1):\r\n print(num[i],end=\" \")\r\n \r\n", "n=int(input())\r\na=[0]*(n+2)\r\nfor i in range(2,n+2):\r\n for j in range(i,n+2,i):\r\n a[j]+=1\r\nif n>2:print(2)\r\nelse:print(1)\r\nfor i in range(2,n+2):\r\n if a[i]==1:\r\n print(1,end=' ')\r\n else:\r\n print(2,end=' ')", "n = int(input())\nsieve = [False]*(n+2)\ntwo = False\nfor i in range(2,n+2):\n if not sieve[i]:\n for j in range(2,(n+1)//i + 1): # To hit one below\n sieve[i*j] = True\n two = True\n# paint prime numbers with different and others with different colors\nif two:\n print(2)\nelse:\n print(1)\nfor i in range(2, n+2):\n print((sieve[i] == True)*2 + (sieve[i] == False)*1, end=' ')", "N = 1000010\r\np=[1]*N\r\nfor i in range(2, N):\r\n if 1 == p[i]:\r\n for j in range(i * i, N, i):\r\n p[j] = 2\r\nn = int(input())\r\nans = p[2:n+2]\r\nprint(len(set(ans)))\r\nprint(*ans)\r\n \r\n ", "def 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\nn = int(input().strip())\narr = [1 if isPrime(i) else 2 for i in range(2, n+2)]\nprint(max(arr))\nprint(*arr)", "def solve():\r\n size = int(input())\r\n seive = [True for _ in range(size + 2)]\r\n seive[0] = False\r\n seive[1] = False\r\n\r\n i = 2\r\n\r\n while ((i * i) <= (size + 2)):\r\n if seive[i]:\r\n start = i * i\r\n for j in range(start, size + 2, i):\r\n seive[j] = False\r\n i += 1\r\n\r\n if size <= 2:\r\n print(1)\r\n else:\r\n print(2)\r\n colors = []\r\n for idx in range(2,size + 2):\r\n if seive[idx]:\r\n colors.append(1)\r\n else:\r\n colors.append(2)\r\n\r\n print(*colors)\r\n\r\nsolve()\r\n\r\n", "import math\r\n\r\ndef f(n):\r\n if n == 2:\r\n return 1\r\n if n%2==0:\r\n return 2\r\n root = int(math.sqrt(n))\r\n for i in range(3,root+2):\r\n if n%i==0:\r\n return 2\r\n return 1\r\n\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(\"1\")\r\n print(\"1\")\r\nelif n == 2:\r\n print(\"1\")\r\n print(\"1 1\")\r\nelse:\r\n print(\"2\")\r\n for i in range(2,n+2):\r\n print(f(i),end=\" \")\r\n print()", "\r\nN = 1000010\r\nprimes = [1] * N\r\nfor i in range(2, N):\r\n if 1 == primes[i]:\r\n for j in range(i * i, N, i):\r\n primes[j] = 2\r\nn = int(input())\r\nans = primes[2:n+2]\r\nprint(len(set(ans)))\r\nprint(*ans)\r\n\r\n\r\n", "n=int(input())\r\nl=[1]*(n+2)\r\nfor i in range(2,n+2):\r\n if l[i]:\r\n for j in range(i*i, n+2, +i):\r\n l[j]=0\r\nif n<=2:\r\n print('1')\r\nelse: print(\"2\")\r\nfor i in range(2,n+2):\r\n if(l[i]):\r\n print(\"1\", end=' ')\r\n else:\r\n print(\"2\", end=' ')", "n = int(input())\r\nif n == 1 or n == 2:\r\n print(1)\r\n print(*[1] * n)\r\nelse:\r\n prime = [1] * (n + 2)\r\n prime[0] = prime[1] = 0\r\n i = 2\r\n while i * i <= n + 1:\r\n if prime[i] != 2:\r\n for j in range(i * i, n + 2, i):\r\n prime[j] = 2\r\n i += 1\r\n print(2)\r\n print(*prime[2:])", "n = int(input())\r\nA=[1]*(n+2)\r\nfor i in range(2,int((n+2)**0.5)+1):\r\n if(A[i]==1):\r\n for j in range(i*i,n+2,i):\r\n A[j] = 2\r\nprint(len(set(A)))\r\nprint(*A[2:])\r\n\r\n\r\n \r\n", "def sieve(n):\r\n if n == 1:\r\n return [1, 1]\r\n l1 = [1 for _ in range(n + 1)]\r\n l1[0], l1[1] = -1, -1\r\n for i in range(2, int(n ** 0.5) + 1):\r\n for j in range(i * i, n + 1, i):\r\n l1[j] = 2\r\n return l1\r\n\r\n\r\nn = int(input())\r\nif n < 3:\r\n print(1)\r\nelse:\r\n print(2)\r\nfor i in sieve(n + 1)[2:]:\r\n print(i, end=' ')", "n = int(input())\narr = [1 for _ in range(n + 2)]\n\n\ndef prime():\n for i in range(2, n+2):\n if arr[i] == 2:\n continue\n for j in range(i*i, n+2, i):\n arr[j] = 2\n return\n\n\nprime()\n\nif len(arr) > 4:\n print(2)\nelse:\n print(1)\nfor i in range(2, n+2):\n print(arr[i], end=\" \")\nprint()\n\n \t \t\t\t\t \t\t \t \t \t \t \t \t", "import math\r\n\r\ndef sieve(n):\r\n ass = []\r\n is_prime = [True]*(n+1)\r\n is_prime[0] = False\r\n is_prime[1] = False\r\n\r\n for i in range(2, int(math.sqrt(n))+1):\r\n if not is_prime[i]:\r\n continue\r\n for j in range(i*2, n+1, i):\r\n is_prime[j] = False\r\n for i in range(n+1):\r\n if is_prime[i]:\r\n ass.append(i)\r\n return(ass)\r\n\r\nn = int(input())\r\nP = sieve(n+5)\r\nans = [-1]*(n+2)\r\nfor i in range(2, n+2):\r\n if i in P:\r\n ans[i] = 1\r\n else:\r\n ans[i] = 2\r\nprint(len(set(ans[2:])))\r\nprint(*ans[2:])\r\n", "from sys import stdin, stdout\ncin = stdin.readline\ncout = stdout.write\nmp = lambda:list(map(int, cin().split()))\n\nn, = mp()\n\nprime = [1]*(n+2)\nfor i in range(2, n+2):\n\tif prime[i] == 1:\n\t\tfor j in range(i+i, n+2, i):\n\t\t\tprime[j] = 2\nif n<=2:\n\tcout('1\\n')\nelse:\n\tcout('2\\n')\nfor i in range(2, n+2):\n\tcout(str(prime[i]) + ' ')\n \t\t \t \t\t \t\t \t\t \t\t \t\t\t \t" ]

[ "import re\n\ndef proc(msgs):\n\tchg = False\n\tfor i, msg in enumerate(msgs):\n\t\tif msg[0] != '?': continue\n\t\tppn = msg[1]\n\t\tif i > 0: ppn.discard(msgs[i-1][0])\n\t\tif i != len(msgs)-1: ppn.discard(msgs[i+1][0])\n\t\tif len(ppn) == 1:\n\t\t\tmsg[0] = ppn.pop()\n\t\t\tchg = True\n\treturn chg\n\ndef is_valid(msgs):\n\tfor i, msg in enumerate(msgs):\n\t\tif msg[0] == '?' or (i > 0 and msg[0] == msgs[i-1][0]) or (i != len(msgs)-1 and msg[0] == msgs[i+1][0]):\n\t\t\treturn False\n\treturn True\n\nTC = int(input())\nfor tc in range(0, TC):\n\tN = int(input())\n\tpersons = set(input().split())\n\tM = int(input())\n\tmsgs = []\n\tfor m in range(M):\n\t\tline = input()\n\t\tm1 = re.match(r'(.*)\\:(.*)', line)\n\t\tppn = set(persons)\n\t\tfor un in re.findall(r'[a-zA-Z0-9]+', m1.group(2)):\n\t\t\tppn.discard(un)\n\t\tmsgs.append([m1.group(1), ppn, m1.group(2)])\n\twhile True:\n\t\tif proc(msgs): continue\n\t\tchgt = False\n\t\tfor msg in msgs:\n\t\t\tif msg[0] == '?' and len(msg[1]) > 0:\n\t\t\t\tmsg[0] = msg[1].pop()\n\t\t\t\tchgt = True\n\t\t\t\tbreak\n\t\tif not chgt: break\n\tif is_valid(msgs):\n\t\tfor msg in msgs:\n\t\t\tprint('%s:%s' % (msg[0], msg[2]))\n\telse:\n\t\tprint('Impossible')\n\n\n\n\n# Made By Mostafa_Khaled", "#!/usr/bin/env python3\n\nimport re, sys\n\ndef debug(*msg):\n print(*msg, file=sys.stderr)\n\ndef solve():\n def parse(line):\n mo = re.match(r'(.*?):(.*)', line)\n assert(mo)\n name, text = mo[1], mo[2]\n if name == '?':\n speaker = -1\n else:\n assert (name in revP)\n speaker = revP[name]\n appears = [False] * n\n for x in re.findall(r'\\w+', text):\n if x in revP:\n appears[revP[x]] = True\n return (speaker, text, appears)\n\n def add_hist(j):\n for hist in prev:\n if hist and hist[len(hist) - 1] == j:\n continue\n cur.append(hist + [j])\n return\n\n n = int(input())\n P = input().strip().split()\n revP = {P[i] : i for i in range(n)}\n m = int(input())\n lines = []\n for i in range(m):\n lines.append(sys.stdin.readline().strip())\n cur = [[]]\n texts = []\n for i in range(m):\n prev = cur\n cur = []\n (speaker, text, appears) = parse(lines[i])\n texts.append(text)\n if speaker >= 0:\n add_hist(speaker)\n else:\n for j in range(n):\n if not appears[j]:\n add_hist(j)\n if not cur:\n print(\"Impossible\")\n return\n debug(\"cur=\", cur, \"texts=\", texts, \"revP=\", revP)\n for i in range(m):\n print(f'{P[cur[0][i]]}:{texts[i]}')\n \n\n\ndef main():\n t = int(input())\n for tt in range(t):\n solve()\n\nmain()\n", "import re\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n names = set(input().split())\r\n m = int(input())\r\n dp = []\r\n a = []\r\n for i in range(m): a.append(input())\r\n for i in range(m):\r\n sender, msg = a[i].split(':')\r\n ls = set(filter(None, re.split('\\W+',msg)))\r\n dp.append((names if sender == '?' else set([sender])) - ls)\r\n if i and len(dp[i-1]) == 1: dp[i] -= dp[i-1]\r\n # print(dp[i]);\r\n if any([len(p) == 0 for p in dp]): print(\"Impossible\")\r\n else:\r\n res = []\r\n for i in reversed(range(m)):\r\n res.append(dp[i].pop())\r\n if i > 0: dp[i-1].discard(res[-1])\r\n for i in range(m): \r\n sender, msg = a[i].split(':')\r\n sender = res[m-i-1]\r\n print(sender+':'+msg)" ]

[ "from collections import defaultdict\r\nfrom math import gcd\r\nfrom sys import stdin\r\n\r\ninput = stdin.readline\r\n\r\nclass SparseTable:\r\n def __init__(self, data, func=max):\r\n self.func = func\r\n self.data = [list(data)]\r\n i, n = 1, len(data)\r\n while 2 * i <= n:\r\n prev = self.data[-1]\r\n curr = []\r\n for j in range(n - 2 * i + 1):\r\n curr.append(func(prev[j], prev[j + i]))\r\n self.data.append(curr)\r\n i <<= 1\r\n\r\n def query(self, l, r):\r\n \"\"\"func of data[l..r]; O(1)\"\"\"\r\n depth = (r - l + 1).bit_length() - 1\r\n return self.func(self.data[depth][l], self.data[depth][r - (1 << depth) + 1])\r\n\r\n def __getitem__(self, idx):\r\n return self.data[0][idx]\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n seg_gcd = SparseTable(l, func=gcd)\r\n seg_min = SparseTable(l, func=min)\r\n ans = []\r\n low, high = 1, n+1\r\n while low < high:\r\n curr = []\r\n mid = low + (high - low) // 2\r\n # print(mid)\r\n for i in range(n - mid + 1):\r\n currGcd = seg_gcd.query(i, i + mid -1)\r\n currMin = seg_min.query(i, i + mid -1)\r\n if currMin == currGcd:\r\n curr.append(i + 1)\r\n if curr:\r\n low = mid + 1\r\n ans = curr\r\n else:\r\n high = mid\r\n print(len(ans), low - 2)\r\n print(*ans)\r\n\r\n\r\nsolve()\r\n", "def gcd(a, b):\r\n if a > b:\r\n a, b = b, a\r\n if b % a==0:\r\n return a\r\n return gcd(b % a, a)\r\n\r\ndef process(A):\r\n n = len(A)\r\n answer = [0, [1]]\r\n working = [[A[0], 0]]\r\n current = {A[0]: 0}\r\n for i in range(1, n):\r\n next_working = []\r\n next_current = {}\r\n for g, index in working:\r\n g = gcd(g, A[i])\r\n if len(next_working) == 0 or next_working[-1][0] < g:\r\n next_working.append([g, index])\r\n if next_working[-1][0] < A[i]:\r\n next_working.append([A[i], i])\r\n working = next_working\r\n for g in current:\r\n if A[i] % g==0:\r\n diff = i-current[g]\r\n if diff > answer[0]:\r\n answer = [diff, []]\r\n if diff==answer[0]:\r\n answer[1].append(current[g]+1)\r\n next_current[g] = current[g]\r\n if A[i] not in next_current:\r\n index = working[-1][1]\r\n next_current[A[i]] = index\r\n diff = i-index\r\n if diff > answer[0]:\r\n answer = [diff, []]\r\n if diff==answer[0]:\r\n answer[1].append(index+1)\r\n current = next_current\r\n return answer\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\na1, a2 = process(A)\r\nprint(f'{len(a2)} {a1}') \r\nprint(' '.join(map(str, a2))) ", "import math\r\n#import math \r\n#------------------------------warmup----------------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n#-------------------game starts now---------------------------------------------------- \r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=lambda a,b:math.gcd(a,b)):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n if start == stop:\r\n return self.__getitem__(start)\r\n stop += 1\r\n start += self._size\r\n stop += self._size\r\n \r\n res = self._default\r\n while start < stop:\r\n if start & 1:\r\n res = self._func(res, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res = self._func(res, self.data[stop])\r\n start >>= 1\r\n stop >>= 1\r\n return res\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\nclass SegmentTree1:\r\n def __init__(self, data, default=9999999999999999999999999999999, func=lambda a,b:min(a,b)):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n if start == stop:\r\n return self.__getitem__(start)\r\n stop += 1\r\n start += self._size\r\n stop += self._size\r\n \r\n res = self._default\r\n while start < stop:\r\n if start & 1:\r\n res = self._func(res, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res = self._func(res, self.data[stop])\r\n start >>= 1\r\n stop >>= 1\r\n return res\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns2=SegmentTree(l)\r\ns1=SegmentTree1(l)\r\ns=0\r\ne=0\r\nd=dict()\r\nd1=dict()\r\ned=[]+l[::-1]\r\ns3=SegmentTree(ed)\r\ns4=SegmentTree1(ed)\r\nd2=dict()\r\nwhile(s<n):\r\n if s in d1:\r\n d1[s]=e-s-1\r\n else:\r\n d1.update({s:e-s-1})\r\n if e==n:\r\n e-=1\r\n s+=1\r\n if s2.query(s,e)==s1.query(s,e):\r\n e+=1\r\n else:\r\n s+=1\r\n if s>e:\r\n e+=1\r\n if e>n-1:\r\n e=n\r\nif s in d1:\r\n d1[s]=e-s-1\r\nelse:\r\n d1.update({s:e-s-1})\r\ne=0\r\ns=0\r\nwhile(s<n):\r\n if s in d2:\r\n d2[n-1-s]=e-s-1\r\n else:\r\n d2.update({n-1-s:e-s-1})\r\n if e==n:\r\n e-=1\r\n s+=1\r\n if s3.query(s,e)==s4.query(s,e):\r\n e+=1\r\n else:\r\n s+=1\r\n if s>e:\r\n e+=1\r\n if e>n-1:\r\n e=n\r\nif s in d2:\r\n d2[n-1-s]=e-s-1\r\nelse:\r\n d2.update({n-1-s:e-s-1})\r\nans=0\r\n#print(d1,d2)\r\nfor j in d1:\r\n if j in d2: \r\n if 0<=j+d1[j]<n and 0<=j-d2[j]<n and 0<=j<n and s2.query(j,j+d1[j])==s2.query(j-d2[j],j):\r\n d1[j]+=d2[j]\r\n ans=max(ans,d1[j])\r\nfor j in d2:\r\n ans=max(ans,d2[j])\r\ns=0\r\ne=s+ans\r\nw=[] \r\nwhile(e<n):\r\n if s2.query(s,e)==s1.query(s,e):\r\n w.append(s+1)\r\n s+=1\r\n e+=1\r\nprint(len(w),ans)\r\nprint(*w,sep=' ')", "import math\r\n# import collections\r\n# from itertools import permutations\r\n# from itertools import combinations\r\n# import sys\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n\r\n'''def is_prime(n):\r\n j=2\r\n while j*j<=n:\r\n if n%j==0:\r\n return 0\r\n j+=1\r\n return 1'''\r\n\r\n\r\n'''def gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x'''\r\n\r\n'''fact=[]\r\ndef factors(n) :\r\n \r\n i = 1\r\n while i <= math.sqrt(n):\r\n \r\n if (n % i == 0) :\r\n \r\n if (n / i == i) :\r\n fact.append(i)\r\n\r\n else :\r\n \r\n fact.append(i)\r\n fact.append(n//i)\r\n i = i + 1'''\r\n\r\n\r\ndef prob():\r\n \r\n n = int(input())\r\n n+=1\r\n # s=input()\r\n l=[1]\r\n l+=[int(x) for x in input().split()]\r\n l+=[1]\r\n # a,b = list(map(int , input().split()))\r\n\r\n p = [True]*n\r\n\r\n s=0\r\n\r\n q = [i for i in range(1,n)]\r\n\r\n for i in range(1,n):\r\n\r\n if p[i]:\r\n a=i\r\n b=i\r\n d=l[i]\r\n\r\n if d==1:\r\n s,q = n-2 , [1]\r\n break\r\n\r\n while l[a-1] % d == 0:\r\n a-=1\r\n\r\n while l[b+1] % d == 0:\r\n b+=1\r\n p[b]=False\r\n\r\n d = b-a\r\n\r\n if d>s:\r\n s,q = d,[a]\r\n elif d==s and s!=0:\r\n q.append(a)\r\n \r\n print(len(q) , s)\r\n print(*q)\r\n \r\n\r\n\r\nt=1\r\n# t=int(input())\r\n\r\nfor _ in range(0,t):\r\n prob()", "from collections import deque \r\nn = int(input()) \r\nl = list(map(int, input().split())) \r\nst = deque() \r\nfl = [] \r\nfor i in range (n) : \r\n fl.append((i , i)) \r\ncur = None\r\ni = 0 \r\nans = [] \r\nsiz = -1 \r\nwhile i < n : \r\n y = l[i] \r\n if st : \r\n while st and l[st[-1]] % y == 0 :\r\n ind = st[-1]\r\n fl[i]= (fl[ind][0], i)\r\n st.pop() \r\n \r\n st.append(i) \r\n cur = i\r\n i += 1 \r\n while i < n and l[i] % y == 0 : \r\n st.append(i)\r\n fl[cur] = (fl[cur][0], i)\r\n i+= 1\r\n if siz < fl[cur][1] - fl[cur][0] : \r\n ans = [fl[cur][0]]\r\n siz = fl[cur][1] - fl[cur][0] \r\n elif siz == fl[cur][1] - fl[cur][0] : \r\n ans.append(fl[cur][0]) \r\n \r\n\r\n else:\r\n cur = i \r\n while i < n and l[i] % y == 0 : \r\n st.append(i)\r\n fl[cur] = (fl[cur][0], i)\r\n i+= 1\r\n if siz < fl[cur][1] - fl[cur][0] : \r\n ans = [fl[cur][0]]\r\n siz = fl[cur][1] - fl[cur][0] \r\n elif siz == fl[cur][1] - fl[cur][0] : \r\n ans.append(fl[cur][0]) \r\n \r\n\r\n\r\nprint(len(ans), siz) \r\nfor el in ans : \r\n print(el + 1 , end = \" \")\r\n\r\n \r\n \r\n\r\n\r\n\r\n" ]

[ "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\nb = [str(c - ((c + 1) % 2)) for c in a]\r\nprint(' '.join(b))\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nfor i in a:\r\n print(i-1+i%2,end=' ')", "input()\r\nprint(*[x-1 if x%2 == 0 else x for x in map(int, input().split())])", "n=int(input())\r\nl=[]\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n a.append(l[i]-1)\r\n else:\r\n a.append(l[i])\r\nprint(\" \".join(map(str,a)))\r\n", "a = int(input())\r\nn = list(map(int,input().split()))\r\nfor i in n:\r\n if i%2==0:\r\n print(i-1,end = ' ')\r\n elif i%2==1:\r\n print(i,end = ' ')\r\n", "n = int(input())\narr = [int(x) for x in input().split()][:n]\nfor i in range(n):\n if arr[i] % 2 == 0: print(arr[i] - 1, end=' ')\n else: print(arr[i], end=' ')\nprint()\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\nli = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n if li[i]&1:\r\n li[i] = li[i]\r\n else:\r\n li[i] = li[i]-1\r\nprint(*li)", "n= int(input())\r\na=list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i]=a[i]-(1-a[i]%2)\r\nprint(*a)", "input()\r\nn = list(map(int, input().split()))\r\nfor i in range(len(n)):\r\n if n[i] % 2 == 0:\r\n n[i] -= 1\r\nprint(*n)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nfor x in a:\r\n s.add(x)\r\n s.add(x + 1)\r\n s.add(x - 1)\r\nfor x in sorted(s):\r\n for i in range(n):\r\n if a[i] == x:\r\n a[i] = (x - 1 if x % 2 == 0 else x + 1)\r\nprint(*a)", "n = int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(1&a[i]==0):\r\n a[i]-=1\r\nprint(*a)", "n = int(input())\n \nvalues = list(map(int,input().strip().split()))[:n]\n# print(values)\n\nfor count, each in enumerate(values):\n if values[count] %2 == 0:\n values[count] = values[count]-1\n\nprint(*(each for each in values))\n\t \t\t \t\t \t\t \t\t \t\t\t\t\t\t", "def answer():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n ans=\"\"\r\n i=0\r\n while i<len(a):\r\n if n:\r\n if a[i]%2==0:\r\n a[i]-=1\r\n i+=1\r\n j=0\r\n for x in a:\r\n j+=1\r\n ans+=str(x)\r\n if j!=len(a):\r\n ans+=\" \"\r\n \r\n print(ans)\r\nanswer()", "n = int(input())\r\na = list(map(int , input().split()))\r\nlst = []\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n lst.append(a[i]-1)\r\n elif a[i] % 2 != 0:\r\n lst.append(a[i])\r\nprint(*lst)", "n = int(input())\na = list(map(int, input().split()))\ns = sorted(list(set(a)))\n\nfor i in range(len(s)):\n if s[i] % 2:\n a[:] = [x if x != s[i] + 1 else s[i] for x in a]\n else:\n a[:] = [x if x != s[i] else s[i] - 1 for x in a]\nprint(*a)\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor x in arr:\r\n print(x if x % 2 else x - 1, end=\" \")\r\n", "n=int(input())\r\nnlist=list(map(int,input().split()))\r\nfor i in range(n):\r\n if nlist[i]%2==0:\r\n nlist[i]-=1\r\nprint(' '.join([str(x) for x in nlist]))", "n=int(input())\r\nar=list(map(int,input().split()))\r\nfor i in range(n):\r\n if ar[i]%2==0:\r\n ar[i]-=1\r\nprint(' '.join(str(i) for i in ar)) ", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n if(li[i] % 2 == 0):\r\n li[i] = li[i]-1\r\nfor i in li:\r\n print(i,end = \" \")", "z=input\r\nmod = 10**9 + 7\r\nfrom string import *\r\nfrom collections import *\r\nfrom queue import *\r\nfrom sys import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom bisect import *\r\nfrom collections import Counter as cc\r\nfrom math import factorial as f\r\ndef lcd(xnum1,xnum2):\r\n 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:\r\n return 0\r\n return 1\r\n\r\n################################################################################\r\n\r\n\"\"\"\r\n\r\nled=(6,2,5,5,4,5,6,3,7,6)\r\n\r\nvowel={'a':0,'e':0,'i':0,'o':0,'u':0}\r\n\r\ncolor4=[\"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\" ,\"OYGBIV\",'ROYGBIV' ]\r\n\r\n\"\"\"\r\n\r\n###########################---START-CODING---###############################################\r\n\r\nn=int(z())\r\n\r\nl=list(map(int,z().split()))\r\n\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n l[i]-=1\r\n\r\nprint(*l)\r\n\r\n\r\n", "input()\r\nprint(*(x if x%2 else x-1 for x in map(int,input().split())))", "t = int(input())\r\na = input().split()\r\nfor i in range(t):\r\n if int(a[i])%2 == 0:\r\n a[i] = str(int(a[i]) - 1)\r\nfor i in a:print(i,end=\" \")", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n if a[i]%2==0: a[i]=a[i]-1\r\nfor i in range(n):\r\n if i == n-1:\r\n print(a[i])\r\n else:\r\n print(a[i], end = \" \")", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2 == 1:\r\n for x in a:\r\n if a[i] == x:\r\n a[i] = x+1\r\n break\r\nfor i in range(n):\r\n if a[i]%2 == 0:\r\n for x in a:\r\n if a[i] == x:\r\n a[i] = x-1\r\n break\r\nfor i in a:\r\n print(i,end = \" \")\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n l[i]=l[i]-1\r\nprint(*l)", "import math\r\n \r\n# from functools import reduce\r\n# from math import comb # n! / (k! * (n - k)!)\r\n# from collections import defaultdict\r\nfrom sys import stdout\r\n \r\n \r\nNO = 'NO'\r\nYES = 'YES'\r\nMOD = 1000000007\r\nALPH = 'abcdefghijklmnopqrstuvwxyz'\r\n \r\ndef input_int():\r\n return int(input())\r\n \r\ndef input_list():\r\n return input().split(' ')\r\n \r\ndef input_list_int():\r\n return list(map(int, input_list()))\r\n \r\ndef list_int_to_str(a, sep = ' '):\r\n return sep.join(str(x) for x in a) \r\n\r\nglobal_ans = []\r\ndef pr(a):\r\n global_ans.append(a)\r\n\r\ndef solve():\r\n n = input_int()\r\n a = input_list_int()\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n a[i] -= 1\r\n pr(list_int_to_str(a))\r\n\r\n\r\n \r\n\r\nquery_count = 1\r\n# query_count = input_int()\r\n\r\n\r\nwhile query_count:\r\n query_count -= 1\r\n solve()\r\nfor global_ans_line in global_ans:\r\n print(global_ans_line)\r\n\r\n", "def solution(a):\r\n b = []\r\n for i in a:\r\n if i%2 == 0:\r\n b.append(i-1)\r\n else:\r\n b.append(i)\r\n return b\r\n \r\n\r\n\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nfor i in solution(a):\r\n print(i,end=' ')", "x=int(input())\r\nlst=[int(i) for i in input().split()]\r\nlst1=[]\r\nfor j in range(len(lst)):\r\n s=0\r\n if lst[j]%2==0:\r\n s=lst.index(lst[j])\r\n lst.insert(s,lst[j]-1)\r\n lst.pop(s+1)\r\n\r\nfor k in range(len(lst)):\r\n print(lst[k],end=\" \")", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n a[i]-=1\r\nprint(*a)", "input()\nprint(*[~-int(n) | 1 for n in input().split()])\n", "n = input()\r\nfor i in map(int, input().split()) :\r\n print(i - 1 + i % 2, end = \" \")", "# coding: utf-8\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = [x if x % 2 else x - 1 for x in a]\r\n\r\nprint(*b, sep = ' ')", "n=int(input())\r\nA=list(map(int,input().split()))\r\nB=[]\r\nfor i in range(n):\r\n if A[i]%2==0:\r\n B.append(A[i]-1)\r\n else:\r\n B.append(A[i])\r\nprint(*B)", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')[1].split()\r\n out = []\r\n for i in inp:\r\n out.append(int(i)%2 and i or int(i)-1)\r\n return out\r\n \r\nprint(*main())", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n a[i]-=1\r\nprint(*a)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in arr:\r\n print(i if i%2==1 else i-1,end=\" \")", "#for _ in range(int(input())):\r\nn=int(input())\r\n #n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\ni=0\r\nwhile(i<n):\r\n if(i<n-1 and a[i]%2!=0 and a[i]+1==a[i+1]):\r\n b.extend([a[i],a[i]])\r\n i+=1\r\n elif(a[i]%2==0):\r\n b.append(a[i]-1)\r\n else:\r\n b.append(a[i])\r\n i+=1\r\nfor i in b:\r\n print(i,end=\" \")\r\n ", "n, a = int(input()), (int(i) for i in input().split())\nres = (i if i & 1 == 1 else i - 1 for i in a)\nprint(*res)\n", "def main():\n n = int(input())\n x = [int(i) for i in input().split()]\n ans =[]\n for i in x:\n if i%2==0:\n ans.append(i-1)\n else:\n ans.append(i)\n print(*ans)\nmain()\n\n", "def sint():\r\n return (int(input()))\r\n\r\ndef sints():\r\n return (map(int, input().split()))\r\n\r\ndef sara():\r\n return (list(map(int,input().split())))\r\n\r\ndef sstr():\r\n s = input()\r\n return (list(s[:len(s)]))\r\n\r\ndef main():\r\n \r\n n = sint()\r\n ara = sara()\r\n \r\n for i in ara:\r\n if i%2:\r\n print(i, end = ' ')\r\n else:\r\n print(i-1, end = ' ')\r\n print('')\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n \r\n \r\n \r\n", "n,a=int(input()),[int(i)-(not(int(i)&1)) for i in input().split()];print(*a)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range (n):\r\n if(arr[i]%2==0):\r\n print(arr[i]-1,end=\" \")\r\n else:\r\n print(arr[i],end=\" \")", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nz=max(a)\r\nfor y in a:\r\n if z%2==0:\r\n if y%2!=0:\r\n l.append(y)\r\n else :\r\n l.append(y-1)\r\n else :\r\n if y!=z:\r\n if y%2!=0:\r\n l.append(y)\r\n else :\r\n l.append(y-1)\r\n else :\r\n l.append(y)\r\nprint(*l,sep=\" \")", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nans = []\r\nfor i in a:\r\n if i % 2 == 0:\r\n ans.append(i - 1)\r\n else:\r\n ans.append(i)\r\nprint(*ans)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ntc = 1\r\n\r\nfor tests in range(tc):\r\n n = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n for i in range(n):\r\n if not arr[i]&1 :\r\n arr[i] -= 1\r\n \r\n print(*arr)", "N = int(input())\r\nA = [int(i) for i in input().split()]\r\nfor i in range(N):\r\n if A[i]&1 == 0:\r\n A[i]-=1\r\nprint(*A)\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\nfor j in range(n):\r\n if array[j] % 2 == 0:\r\n array[j] -= 1\r\nfor x in array:\r\n print(x, end=\" \")\r\n", "z,zz=input,lambda:list(map(int,z().split()))\r\nzzz=lambda:[int(i) for i in stdin.readline().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\nfrom itertools import permutations as permu\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 \r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=True\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\n\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\nnum=1\r\n\r\n#num=int(z())\r\n\r\nfor _ in range( num ):\r\n n=int(z())\r\n for i in zzz():\r\n if i%2==0:\r\n print(i-1)\r\n else:print(i)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nl=list(map(int,input().split()))\r\nnm=0\r\nfor i in range(n):\r\n\tnm=l[i]\r\n\tif nm%2==0:\r\n\t\tnm=nm-1\r\n\t\tl[i]=nm\r\nprint(*l)", "from math import gcd\r\n\r\nfrom typing import List\r\n\r\n\r\ndef printList(nums: list):\r\n nums = list(map(lambda x: str(x), nums))\r\n print(\" \".join(nums))\r\n\r\n\r\ndef readStrings() -> List[str]:\r\n return input().split(\" \")\r\n\r\n\r\ndef readInt() -> int:\r\n return int(input())\r\n\r\n\r\ndef readInts() -> List[int]:\r\n return list(map(lambda x: int(x), readStrings()))\r\n\r\n\r\ndef readOtherNumericTypes(func) -> list:\r\n return list(map(func, readStrings()))\r\n\r\n\r\ndef isEven(num: int) -> bool:\r\n return num % 2 == 0\r\n\r\n\r\ndef isPositive(num: int) -> bool:\r\n return num > 0\r\n\r\n\r\ndef isPositiveOrZero(num: int) -> bool:\r\n return isPositive(num) or num == 0\r\n\r\n\r\ndef digits(num: int) -> int:\r\n return len(str(num))\r\n\r\n\r\ndef firstDigit(num: int) -> int:\r\n return int(str(num)[0])\r\n\r\n\r\ndef replace(num: int):\r\n if isEven(num):\r\n return num - 1\r\n return num\r\n\r\n\r\ninput()\r\nvalues = readInts()\r\nvalues = list(map(lambda x: replace(x), values))\r\nprintList(values)\r\n", "n = int(input())\r\nl = list(map(int , input().split()))\r\n\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n l[i]=l[i]-1\r\n \r\nprint(*l)", "n = int(input())\r\nlst = list(map(int, input().strip().split()))[:n]\r\nfl = False\r\nfor i in lst:\r\n if (fl):\r\n print(\" \", end=\"\")\r\n if (i % 2 == 0):\r\n i -= 1\r\n print(i, end=\"\")\r\n fl = True", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(' '.join(map(str, [a[i] - 1 if a[i] % 2 == 0 else a[i] for i in range(a.__len__())])))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n arr[i]=arr[i]-1\r\nprint(*arr)", "n = int(input())\na = list(map(int,input().strip().split()))[:n]\n\nfor i in range(n) :\n if a[i] % 2 == 0 :\n a[i] -= 1\nprint(*a)", "n = int(input())\r\na = input().split(' ')\r\nb = []\r\nfor i in range(n):\r\n if int(a[i])%2 == 0:\r\n b.append(str(int(a[i])-1))\r\n else:\r\n b.append(a[i])\r\nprint(' '.join(b))", "def solve(test):\r\n ans = 1\r\n n = int(input())\r\n\r\n a = list(map(int, input().split()))\r\n for i in range(n):\r\n print(a[i] if a[i] % 2 > 0 else a[i] - 1, end = ' ')\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "n = int(input())\na = list(map(int, input().split()))\na[:] = [x - (1 - x % 2) for x in a]\nprint(*a)", "from sys import stdin, stdout \r\nfrom functools import cache \r\nfrom math import gcd, lcm, log2, log10, log, ceil, floor, sqrt\r\n\r\ndef rs(): return stdin.readline().strip()\r\ndef ri(): return int(rs())\r\ndef rn(): return map(int, rs().split())\r\ndef rl(): return list(rn())\r\ndef rf(): return map(float, rs().split())\r\n\r\nflag = 0 \r\n\r\ndef solve():\r\n n = ri()\r\n a = rl()\r\n ans = [0] * n \r\n for i in range(n):\r\n if (a[i] & 1) == 0:\r\n ans[i] = a[i] - 1 \r\n else: \r\n ans[i] = a[i]\r\n print(*ans)\r\n return None\r\n\r\ndef main():\r\n for _ in range(ri()):\r\n solve()\r\n\r\nif flag:\r\n main()\r\nelse:\r\n solve()\r\n", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\na=[]\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n a.append(str(s[i]-1))\r\n else:\r\n a.append(str(s[i]))\r\nprint(' '.join(a))", "import random\r\nimport sys\r\n\r\n\r\n# sys.setrecursionlimit(10**8)设置最大递归次数\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n self.random_seed = random.randint(0, 10 ** 9 + 7)\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def ceil(a, b):\r\n return a // b + int(a % b != 0)\r\n\r\n def hash_num(self, x):\r\n return x ^ self.random_seed\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n def inter_ask(self, lst):\r\n # CF交互题输出询问并读取结果\r\n self.st(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n # 记得任何一个输出之后都要 sys.stdout.flush() 刷新\r\n return res\r\n\r\n def inter_out(self, lst):\r\n # CF交互题输出最终答案\r\n self.st(lst)\r\n sys.stdout.flush()\r\n return\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n = ac.read_int()\r\n nums = ac.read_list_ints()\r\n nums = [num - int(num%2==0) for num in nums]\r\n ac.lst(nums)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "num = int(input())\r\nli = list(map(int,input().split()))\r\nli2 = []\r\nfor i in range(num):\r\n if li[i]%2==0:\r\n li2.append(li[i]-1)\r\n else:\r\n li2.append(li[i])\r\nprint(*li2)", "n = int(input())\na = list(map(int, input().split()))\nb=[]\nfor item in a:\n if item%2 == 0:\n b.append(item-1)\n else:\n b.append(item)\n\nfor i in b:\n print(i,end=\" \")\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n print(*[a if a % 2 == 1 else a - 1 for a in A])\r\n \r\n \r\nfor _ in range(1):\r\n main()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = [a[i] - (a[i] % 2 ^ 1) for i in range(n)]\r\nprint(*b)", "def solve(n, t):\r\n\r\n for i in range(n):\r\n if t[i] % 2 == 0:\r\n t[i] -= 1\r\n \r\n return ' '.join(list(map(str, t)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n t = list(map(int, input().split()))\r\n print(solve(n, t))", "from collections import deque\r\n\r\nn = int(input())\r\narray = list(map(int, input().split()))\r\narray = deque(array)\r\nfor i in range(n):\r\n element = array[i]\r\n if element % 2 == 0:\r\n while element in array:\r\n idx = array.index(element)\r\n array[idx] = element - 1\r\n else:\r\n continue\r\nprint(*array)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(0,n):\r\n\tif a[i]%2==0:\r\n\t\tans.append(a[i]-1)\r\n\telse:\r\n\t\tans.append(a[i])\r\nprint(*ans)", "input()\narr = [int(x) for x in input().split()]\nfor num in arr:\n\tif num%2 == 0:\n\t\tprint(num-1,end=' ')\n\telse:\n\t\tprint(num,end=' ')\nprint()", "# https://codeforces.com/problemset/problem/1006/A\r\n\r\n_ = input()\r\n\r\nfor i in map(int, input().split()):\r\n if i % 2 == 1:\r\n print(i, end=\" \")\r\n else:\r\n print(i - 1, end=\" \")\r\n\r\n", "def solve(n,ar):\n\n for i in range(n):\n if ar[i] % 2 == 0:\n ar[i] -= 1\n else:\n continue\n\n print(\" \".join(map(str, ar)))\n\nif __name__ == '__main__':\n n = int(input())\n ar = list(map(int, input().split()))\n solve(n,ar)", "import sys\nfrom collections import defaultdict\ninput = sys.stdin.readline\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n \n ans = []\n\n for x in a:\n if x % 2 == 0:\n ans.append(x - 1)\n\n else: ans.append(x)\n\n print(\" \".join(map(str, ans)))\n\nmain()\n", "n=int(input())\r\na=[0]*(n+10)\r\n \r\na=list(map(int, input().split()))\r\nc=int(n-1)\r\nfor i in range(0,n):\r\n \r\n if a[i]%2==0:\r\n a[i]-=1\r\n \r\nfor i in range(0,c):\r\n print(a[i], end=\" \")\r\nprint(a[n-1], end=\" \")", "def main():\r\n n = input()\r\n print(' '.join([str(i) if int(i) % 2 == 1 else str(int(i) - 1) for i in input().split()]))\r\nmain()", "a = int(input())\r\nn = list(map(int,input().split()))\r\nfor i in n:\r\n if i%2 == 0:\r\n print(i-1,end=' ')\r\n else:\r\n print(i,end=' ')\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nfor temp in nums:\r\n if temp & 1:\r\n print(temp, end=\" \")\r\n else:\r\n print(temp - 1, end=\" \")\r\nprint()", "\r\nfrom sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\n\r\nfor i in arr:\r\n if i%2==0:\r\n print(i-1,end=\" \")\r\n else:\r\n print(i,end=\" \") ", "#!/usr/bin/env python3\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn = get(int)\nprint(*gets(lambda x: int(x) - 1 | 1))\n", "n= int(input())\nlis= input().split(\" \")\nlis= list(map(int, lis))\n\nfor i in range(n):\n if lis[i]%2==0:\n lis[i]=lis[i]-1\n\nprint(*lis)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in l:\r\n if i%2==0:\r\n ans.append(i-1)\r\n else:\r\n ans.append(i)\r\nprint(*ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor j in range(len(l)):\r\n if (l[j] % 2 == 0):\r\n l[j] = l[j] - 1\r\n else:\r\n l[j] = l[j]\r\nprint(*l)", "a=int(input())\r\nb=map(int,input().split())\r\nfor i in b:\r\n print(i-1+i%2,end=\" \")\r\n \r\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nfor i in range(len(ai)):\r\n if ai[i]%2 != 0:\r\n ai[i] = ai[i] + 1\r\nfor i in range(len(ai)):\r\n if ai[i]%2 == 0:\r\n ai[i] = ai[i] - 1\r\nprint(*ai)", "n=int(input())\r\nl=list(map(int,input().strip().split()[:n]))\r\nfor x in range(len(l)):\r\n\tif l[x]%2==0:\r\n\t\tl[x]=l[x]-1\r\nprint(*l)", "from collections import defaultdict, deque\r\nfrom heapq import heappush, heappop\r\nfrom math import inf\r\n\r\nri = lambda : map(int, input().split())\r\n\r\ndef solve():\r\n n = int(input())\r\n A = list(ri())\r\n for x in A:\r\n if x % 2 == 0:\r\n print(x-1, end = \" \")\r\n else:\r\n print(x, end = \" \")\r\n print()\r\n\r\nt = 1\r\n#t = int(input())\r\nwhile t:\r\n t -= 1\r\n solve()\r\n\r\n", "if __name__ == '__main__':\n input()\n a = [int(i) for i in input().strip().split()]\n for i in range(len(a)):\n if a[i] % 2 == 0:\n a[i] -= 1\n print(' '.join([str(i) for i in a]))\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if li[i] % 2 == 0:\r\n li[i] -= 1\r\n print(li[i], end=\" \")\r\nprint(end=\"\\n\")", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef solve():\n\tn = int(read())\n\ta = map(int, read().split())\n\tprint(\" \".join(map(str, [x-1 if x%2==0 else x for x in a])))\n\nsolve()\n\n", "n = int(input())\r\narr = map(int, input().split())\r\nfor x in arr:\r\n print(x - int(x % 2 == 0), end=\" \")\r\n", "n = int(input())\r\na = [int(c) for c in input().split()]\r\na = list(map(lambda x: x+(x & 1)-1,a))\r\nprint(*a)", "n=input()\r\nprint(*list(map(lambda x: int(x)-(int(x)%2==0), input().split())))", "n=int(input())\r\nl1=list(map(int,input().split()))\r\n#l2=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tprint(l1[i] if l1[i]%2==1 else l1[i]-1,'',end=\"\")\r\n\t", "n=int(input())\r\nli=list(map(int,input().split()))\r\nfor i in range(n):\r\n if li[i]%2==0:\r\n li[i]-=1\r\nprint(\" \".join([str(ele) for ele in li]))", "n = int(input())\r\ns = list(map(int, input().split()))\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n s[i] -= 1\r\nprint(*s)", "def solve(n, arr):\r\n for i in range(0, n):\r\n if arr[i] % 2 == 0:\r\n arr[i] -= 1\r\n return \" \".join(str(_) for _ in arr)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n arr = list(map(int, input().split(\" \")))\r\n print(solve(n, arr))\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n a[i]-=1\r\nprint(*a)", "#%%1006a Adjacent replacements\r\ninput()\r\nprint(*[i - [0,1][i%2-1] for i in map(int,input().split())])\r\n", "n = int(input())\nA = list(map(int, input().split()))\nans = []\nfor a in A:\n if a%2 == 0:\n ans.append(a-1)\n else:\n ans.append(a)\nprint(*ans)\n", "input()\r\nfor i in map(int,input().split()):\r\n\tprint(i if i%2 else i-1,end=' ')", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in arr:\r\n if i % 2 == 0:\r\n print(i - 1, end = \" \")\r\n else:\r\n print(i, end = \" \")", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nfor num in nums:\r\n if num % 2 == 0:\r\n print(num-1, end = \" \")\r\n else:\r\n print(num, end = \" \")", "a=int(input())\r\nt=[int(i) for i in input().split()]\r\nfor z in range(a):\r\n if t[z]%2==0:t[z]=t[z]-1\r\n print(t[z], end=' ')", "number_of_testcases = 1 #int(input())\r\nfor _ in range(number_of_testcases):\r\n number_of_elements = int(input())\r\n array_elements = list(map(int,input().split()))\r\n for i in range(number_of_elements):\r\n if array_elements[i]%2==0:\r\n array_elements[i]=array_elements[i] - 1\r\n else:\r\n array_elements[i]=array_elements[i] \r\n \r\n print(*array_elements)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=\"\"\r\nfor i in l:\r\n if(i%2==0):\r\n i-=1\r\n s+=str(i)+\" \"\r\nprint(s)\r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nfor i in k:\r\n if i%2==0 and i!=1:\r\n print(i-1,end=' ')\r\n else:\r\n print(i,end=' ')\r\n", "# LUOGU_RID: 101777347\nn, *a = map(int, input().split())\r\nprint(*[x + x % 2 - 1 for x in map(int, input().split())])", "n = input()\r\nfor x in input().split():\r\n x = int(x)\r\n print(x if x%2 else x-1, end = ' ')\r\n", "import sys\r\ndef get_list ():\r\n return list (map (int, sys.stdin.readline ().strip ().split ()))\r\nn = int (input ())\r\nli = get_list ()\r\nans = []\r\nfor i in li:\r\n if i%2 == 1:\r\n ans.append (i)\r\n else:\r\n ans.append (i - 1)\r\nprint (*ans)\r\n", "n=int(input())\r\nls=list(map(int,input().split(\" \")))\r\nrs=[x-1 if x%2==0 else x for x in ls]\r\nprint(*rs)", "n = int(input())\nlst = [int(x) for x in input().split()][:n]\nfor i in range(n):\n\tif lst[i] % 2 == 0: lst[i] -= 1\nprint(*lst)\n \t\t \t\t \t\t \t \t \t \t\t\t \t \t", "n=int(input())\na=list(map(int,input().split()))\nfor i in range(n):\n a[i]-=(a[i]+1)%2\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(len(a)):\n if a[i] % 2 == 0:\n a[i] -=1\nfor j in a:\n print(j,end=' ')\n", "n=int(input())\r\na=[int(x) for x in input().split(\" \")]\r\nfor x in a:\r\n if x%2==0:\r\n print(x-1,end=' ')\r\n else:\r\n print(x,end=' ')", "a = int(input())\r\nc = list(map(int,input().split()))\r\nres = \"\"\r\nfor i in c:\r\n if i % 2 != 0:\r\n res += str(i)+\" \"\r\n else:\r\n res += str(i-1)+\" \"\r\nprint(res)\r\n ", "from math import *\r\n\r\n#from math import factorial as fact, comb as ncr \r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom collections import Counter as ctr\r\nfrom collections import deque as dq\r\n\r\nfrom array import array\r\nfrom re import search\r\n\r\nli=lambda : list(map(int,input().split()))\r\narr=lambda a: array('i',a)\r\nbi=lambda n: bin(n).replace(\"0b\", \"\")\r\nyn=lambda f: print('NYOE S'[f::2])\r\nsbstr=lambda a,s: search('.*'.join(a),s)\r\n\"\"\"\r\ndef isprime(a):\r\n if a==2: return True\r\n elif a%2==0: return False\r\n n=3\r\n while n<=a**0.5:\r\n if a%n==0:\r\n return False\r\n n+=2\r\n return True\r\n\"\"\"\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n n=int(input())\r\n a=li()\r\n for i in range(n):\r\n if not a[i]%2:\r\n a[i]-=1\r\n print(*a)\r\n \r\nsolve()", "def solve():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n return [i - (i % 2 == 0) for i in a]\r\nprint(*solve())", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(0,len(a)):\r\n if(a[i]%2==0):\r\n a[i]=a[i]-1\r\n else:\r\n pass\r\nprint(*a)", "n = int(input())\nL = list(map(int,input().split()))\nX = []\nfor i in range(n):\n if L[i]%2 == 1:\n X.append(L[i])\n else:\n X.append(L[i] - 1)\nprint(*X)\n", "# JAI SHREE RAM\r\n\r\nimport math; from collections import *\r\nimport sys; from functools import reduce\r\n\r\n# sys.setrecursionlimit(10**6)\r\ndef get_ints(): return map(int, input().strip().split())\r\ndef get_list(): return list(get_ints())\r\ndef get_string(): return list(input().strip().split())\r\ndef printxsp(*args): return print(*args, end=\"\")\r\ndef printsp(*args): return print(*args, end=\" \")\r\n\r\nUGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)\r\n\r\n# sys.stdin=open(\"input.txt\",\"r\");sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n# for _testcases_ in range(int(input())):\r\nn = int(input())\r\nli = get_list()\r\nfor i in li:\r\n if not i & 1: i -= 1\r\n printsp(i)\r\n\r\n\r\n'''\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\nTHE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )\r\nLink may be copy-pasted here if it's taken from other source.\r\nDO NOT PLAGIARISE.\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\n'''", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n\tif(l[i]%2==0):\r\n\t\tl[i]-=1\r\nfor i in l:\r\n\tprint(i,end=' ')\r\n", "t, lst = int(input()), list(map(int, input().split()))\r\nfor x in lst:\r\n if x % 2 == 0: print(x - 1, end = \" \")\r\n else: print(x, end = \" \")", "while True:\r\n try:\r\n s = input()\r\n s = list(map(int, input().split(' ')))\r\n for i in range(len(s)) :\r\n if s[i] % 2 == 0:\r\n s[i] = s[i]-1\r\n print(\" \".join(list(map(str, s))))\r\n except:\r\n break", "int(input())\r\nfor i in list(map(int, input().split())):\r\n if i%2:\r\n print(i, end = ' ')\r\n else:\r\n print(i-1, end = ' ')", "n = int(input())\r\nl = list(map(int,input().split()))\r\n# def replace(l,a,b):\r\n# \tfor i in range(len(l)):\r\n# \t\tif l[i]==a:\r\n# \t\t\tl[i]=b\r\n# \treturn l \r\n# # l = replace(l,1,2)\r\n# l = replace(l,2,1)\r\n# # l = replace(l,3,4)\r\n# l = replace(l,4,3)\r\n# # l = replace(l,5,6)\r\n# l = replace(l,6,5)\r\n# l = replace(l,10**9,10**9 - 1)\r\n# print(l)\r\n\r\nfor i in range(n):\r\n\tif l[i]%2==0:\r\n\t\tl[i]-=1\r\nprint(*l)", "n = input()\r\nw = [int(i) for i in input().split()]\r\nfor i in w:\r\n print(i if i%2==1 else i-1, end=' ')\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n l[i] = str(l[i] - 1)\r\n else:\r\n l[i]=str(l[i])\r\nprint(\" \".join(l))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i,x in enumerate(l):\r\n\tif x&1:\r\n\t\tans.append(x)\r\n\telse:\r\n\t\tans.append(x-1)\r\nprint(*ans)\r\n", "n = int(input())\r\ndat = list(map(int , input().split()))\r\nfor i in range(len(dat)):\r\n if dat[i] != 1:\r\n if dat[i] % 2 == 0:\r\n dat[i] = dat[i]-1\r\nprint(*dat)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\nfor i in data:\r\n if i % 2 == 0:\r\n print(i - 1, end=' ')\r\n else:\r\n print(i, end=' ')", "input()\r\na=list(map(int,input().split()))\r\nprint(*list(i if i%2 else i-1 for i in a))", "a = int(input())\r\n*q, = map(int, input().split(' '))\r\ns = ''\r\nfor i in q:\r\n if i % 2 == 0:\r\n s += str(i - 1) + ' '\r\n else:\r\n s += str(i) + ' '\r\nprint(s)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(len(a)):\r\n\tif a[i]%2==0:\r\n\t\ta[i]-=1\r\nprint(*a)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nfor i in range(n) :\r\n if arr[i]%2==0 :\r\n arr[i] -=1\r\nprint(\" \".join(map(str,arr)))\r\n\r\n", "n = int(input())\noutput = []\nfor i in input().split():\n output.append((int(i) - 1) // 2 * 2 + 1)\n\nprint(*output)", "def adjacent_replacements(n, arr):\r\n for x in range(0, n):\r\n if arr[x]%2 == 0:\r\n arr[x] = arr[x]-1\r\n return arr\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nans = adjacent_replacements(n, arr)\r\nprint(*ans)", "n = int(input())\r\nx = list(map(int, input().split()))[:n]\r\nfor i in x:\r\n if i % 2 == 0:\r\n print(i-1, end=\" \")\r\n else:\r\n print(i, end=\" \")", "n = int (input())\r\nk = list(map(int , input().split()))\r\n\r\nfor x in range ( len(k)): \r\n if k[x]%2!=0 : \r\n print (k [x] )\r\n else: \r\n print (k[x]-1 )", "input()\r\nprint(*(i+i%2-1for i in map(int,input().split())))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n a[i] -= (a[i] % 2 == 0)\r\nprint(*a)", "n=int(input())\r\nA=[int(item)for item in input().split()]\r\nfor i in range(n):\r\n if(A[i]%2==0):\r\n A[i]-=1\r\n if(i==n-1):\r\n print(A[i])\r\n else:\r\n print(A[i],end=\" \")\r\n", "# https://codeforces.com/contest/1006\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\ndef solve_case():\n _ = int(input())\n a = list(map(int, input().split()))\n\n print(*[x if x & 1 else x - 1 for x in a])\n\n\nsolve_case()\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nprint(*[ i-int(i%2==0) for i in a])\r\n", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\n\r\nfor i in range(n):\r\n if(arr[i]%2==0):\r\n arr[i] -= 1\r\n\r\n print(arr[i], end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-16 00:04:24\nLastEditTime: 2021-11-16 00:11:27\nDescription: Adjacent Replacements\nFilePath: CF1006A.py\n'''\n\n\ndef func():\n _ = int(input())\n lst = list(map(int, input().strip().split()))\n lst = list(map(str, map(lambda num: (num - 1) if num % 2 == 0 else num, lst)))\n print(\" \".join(lst))\n\n\nif __name__ == '__main__':\n func()\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n l[i]-=1\r\nprint(*l)", "n = int(input())\n\n# input the array\narr = [int(x) for x in input().split()]\n\nfor i in range(len(arr)):\n if arr[i] % 2 == 0:\n arr[i] = arr[i] - 1\n\n[print(x, end=\" \") for x in arr]\n\n \t\t \t \t \t \t \t \t \t \t", "n=int(input())\r\ns=' '\r\nx=[int(w) for w in input().split()]\r\nfor i in range(n):\r\n if x[i]%2==0:\r\n x[i]+=-1\r\nprint(s.join(list(map(str,x))))", "input()\r\nprint(\" \".join([[str(k-1),str(k)][k%2] for k in map(int,input().split())]))\r\n ", "num = int(input())\r\nli = list(map(int,input().split()))\r\nfor i in range(num):\r\n if li[i]%2==0:\r\n li[i] = li[i]-1\r\nprint(*li)", "n = int(input())\narr = [int(x) for x in input().split()][:n]\nans = []\nfor i in range(n):\n if arr[i] % 2 == 0: ans.append(arr[i] - 1)\n else: ans.append(arr[i])\nprint(*ans)\n\t\t\t\t\t\t\t \t\t\t\t\t \t \t\t\t \t\t \t", "x = int(input())\r\narr = [*map(int, input().split())]\r\nfor i in range(x):\r\n arr[i] = arr[i]-1 if arr[i] % 2 == 0 else arr[i]\r\nprint(*arr)", "n=int(input())\nm=[int(n) for n in input().split()]\nfor e in m:\n print((e - 1)|1,end=' ')\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\nB=[]\r\nfor a in A:\r\n if a%2==1:\r\n B.append(a)\r\n else:\r\n B.append(a-1)\r\n\r\nprint(*B)", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\n\r\ninput = sys.stdin.readline\r\ndef inar():\r\n return [int(el) for el in input().split()]\r\ndef main():\r\n n=int(input())\r\n arr=inar()\r\n for i in range(n):\r\n if arr[i]%2==0:\r\n arr[i]-=1\r\n print(*arr)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n", "n = int(input())\r\nnums = (map(int,input().split()))\r\nans = []\r\nfor num in nums:\r\n\tif num % 2 == 0:\r\n\t\tans.append(num-1)\r\n\telse:\r\n\t\tans.append(num)\r\nprint(*ans)", "n = int(input())\r\narr = input().split(' ')\r\nfor i in range(n):\r\n if not int(arr[i])%2:\r\n arr[i] = str(int(arr[i]) - 1)\r\nprint(' '.join(arr)) ", "n=int(input())\r\na=input()\r\na=a.split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n if a[i]%2==0: a[i]-=1\r\n print(a[i],end=\" \")\r\n", "a = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(a):\r\n if l[i] % 2 == 0:\r\n l[i] -= 1\r\n\r\nprint(*l)", "n=int(input())\r\nl=map(int, input().split())\r\nfor x in l:\r\n\tif x%2==0:x-=1\r\n\tprint(x, end=\" \")\r\nprint()", "from sys import stdin, stdout \r\nimport sys,heapq,io, os\r\nfrom collections import defaultdict as D\r\nfrom collections import deque\r\ndef II():\r\n return map(int,input().split())\r\ndef Ii():\r\n return int(input())\r\ndef infi():\r\n return float(\"Inf\")\r\ndef mino():\r\n return -1\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n \r\na=int(input())\r\ns=list(II())\r\nfor i in range(len(s)):\r\n if s[i]%2==0:\r\n s[i]-=1\r\nprint(*s)", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nans = [x if x%2 == 1 else x - 1 for x in arr]\r\n\r\nprint(*ans)", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nn=int(input())\r\nl=list(map(int, input().split()))\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n l[i]-=1\r\n else:\r\n l[i] = l[i]\r\nl1 = \" \".join(map(str, l))\r\nprint(l1)", "input()\r\nnums = map(int, str(input()).split(' '))\r\nprint(' '.join(map(str, map(lambda x: x if x % 2 == 1 else x - 1, nums))))", "x = int(input())\r\ny = list(map(int, input().split()))\r\n\r\nfor i in range(x):\r\n if y[i] % 2 == 0 :\r\n y[i] = y[i] -1\r\n\r\nprint(*y)", "input()\r\nprint(' '.join([str(i - (i + 1) % 2) for i in map(int, input().split())]))", "def string_to_list(s, char):\r\n collector = \"\"\r\n output_list = []\r\n for i in range(len(s)):\r\n if s[i] != char:\r\n collector += s[i]\r\n if i == len(s) - 1:\r\n output_list.append(int(collector))\r\n else:\r\n output_list.append(int(collector))\r\n collector = \"\"\r\n return output_list\r\n\r\n\r\n#print(string_to_list(\"2 -1 -1\", \" \"))\r\n\r\n\r\ndef list_to_string(l, char):\r\n output_string = \"\"\r\n for i in range(len(l) - 1):\r\n output_string += str(l[i]) + char\r\n output_string += str(l[-1])\r\n return output_string\r\n\r\n\r\ndef quick_sort(l):\r\n def partition(l, start, end):\r\n pivot = l[end]\r\n i = start\r\n for j in range(start, end):\r\n if l[j] <= pivot:\r\n l[j], l[i] = l[i], l[j]\r\n i += 1\r\n l[end], l[i] = l[i], l[end]\r\n return i\r\n\r\n def recutrsion_part(l, start, end):\r\n if len(l) < 2:\r\n return l\r\n elif not start >= end:\r\n p = partition(l, start, end)\r\n recutrsion_part(l, start, p - 1)\r\n recutrsion_part(l, p + 1, end)\r\n recutrsion_part(l, 0, len(l) - 1)\r\n return l\r\n\r\n\r\ndef mergesort(l):\r\n def merge(l_1, l_2):\r\n output_list = []\r\n i, j = 0, 0\r\n while i < len(l_1) and j < len(l_2):\r\n if l_1[i] < l_2[j]:\r\n output_list.append(l_1[i])\r\n i += 1\r\n else:\r\n output_list.append(l_2[j])\r\n j += 1\r\n if j == len(l_2):\r\n output_list += l_1[i:]\r\n else:\r\n output_list.append(l_2[j:])\r\n return output_list\r\n\r\n def sorty(l):\r\n if len(l) < 2:\r\n return l\r\n else:\r\n mid = len(l) // 2\r\n left = sorty(l[:mid])\r\n rit = sorty(l[mid:])\r\n return merge(left, rit)\r\n return sorty(l)\r\n\r\n\r\ndef minimum(l):\r\n minim = l[0]\r\n for i in l:\r\n if minim > i:\r\n minim = i\r\n return minim\r\n\r\n\r\ndef maximum(l):\r\n maxim = l[0]\r\n for i in l:\r\n if maxim < i:\r\n maxim = i\r\n return maxim\r\n\r\n\r\ndef list_reverse(l):\r\n def recursion(l, start, end):\r\n if start >= end:\r\n return l\r\n else:\r\n l[start], l[end] = l[end], l[start]\r\n return recursion(l, start + 1, end - 1)\r\n return recursion(l, 0, len(l) - 1)\r\n\r\n\r\ndef max_min(x, y):\r\n if x > y:\r\n return y, x\r\n return x, y\r\n\r\ndef are_elements_equal(l):\r\n intermediate = l[0]\r\n for i in l:\r\n if intermediate != i:\r\n return False\r\n intermediate = i\r\n return True\r\n\r\n\r\ndef recursion_function(l):\r\n if are_elements_equal(l):\r\n return len(l)\r\n else:\r\n return 1\r\n\r\n\r\ndef main_function():\r\n n = input()\r\n l = string_to_list(input(), \" \")\r\n output_list = []\r\n stairways = 0\r\n interm = 0\r\n for i in range(len(l)):\r\n if not l[i] % 2:\r\n l[i] -= 1\r\n \r\n return list_to_string(l, \" \")\r\n\r\n\r\nprint(main_function())", "def main():\r\n size = input()\r\n \r\n for i in input().split():\r\n i = int(i)\r\n \r\n if i & 1:\r\n print(i, end=' ')\r\n else:\r\n print(i - 1, end=' ')\r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nlst = list(map(int,input().strip().split()))[:n]\r\nnl = []\r\nfor i in lst:\r\n if i%2==0:\r\n nl.append(i-1)\r\n else:\r\n nl.append(i)\r\nfor j in nl:\r\n print(j,end=\" \")", "\r\nn = int(input())\r\n\r\nseq = list( map(lambda a: int(a) , input().split(' ', -1)) )\r\nseq = list( map(lambda a: a - 1 if a % 2 == 0 else a, seq) )\r\n\r\nfor s in seq:\r\n print(s, end=' ')", "n = int(input())\r\n\r\narr = tuple(map(int, input().split()))\r\n\r\nfor v in arr:\r\n\r\n if v % 2:\r\n print(v, end=\" \")\r\n \r\n else:\r\n print(v-1, end=\" \")\r\n\r\nprint()", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[ i-1 if i%2==0 else i for i in a ]\r\nprint(' '.join(map(str,b)))", "input()\r\nfor i in map(int, input().split()):\r\n print(i if i%2!= 0 else i-1, end=\" \")", "# cook your dish here\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n a[i] = a[i] - 1\r\nprint(*a)", "input();*r,=map(int,input().split());print(*[i-[1,0][i%2] for i in r])", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range (n):\r\n if a[i]%2==0:\r\n a[i]-=1\r\nfor i in a:\r\n print(i, end=\" \")", "# 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 = int(input())\r\nll = list(map(int, input().split()))\r\nfor i in range(len(ll)):\r\n if ll[i]%2==0:\r\n ll[i]-=1\r\n \r\nprint(*ll)", "n=int(input())\r\na=[int(a) for a in input().split()]\r\nfor _ in range(n):\r\n if a[_]%2==0:\r\n a[_]=a[_]-1\r\nprint(*a)", "T = int(input())\r\nlst = [int(k) for k in input().split(' ') if k]\r\nfor i in lst:\r\n if i%2==0:\r\n print(i-1,end=' ')\r\n else:print(i,end=' ')", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na = [x - 1 if x % 2 == 0 else x for x in a]\r\n\r\nprint(*a, sep=' ')", "n = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\noutput = \"\"\r\n\r\nfor v in arr:\r\n\r\n if v % 2:\r\n output += str(v)\r\n output += \" \"\r\n\r\n else:\r\n output += str(v - 1)\r\n output += \" \"\r\n\r\noutput.strip()\r\n\r\nprint(output)", "# Hydro submission #6151afe7e1e9420537150298@1632743400038\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\n# print(a)\r\nb = []\r\n\r\n# a = [1,2 ,4 ,5 ,10]\r\n\r\nfor i in a:\r\n # print(i)\r\n if i%2==0:\r\n i = i-1\r\n # print(i)\r\n else:\r\n i=i\r\n b.append(i)\r\n# print(str(b))\r\n# b = str(b)\r\nfor i in b:\r\n print(i,end=' ')", "n = int(input())\na = [int(x) for x in input().split()]\nfor x in a:\n print(x if x % 2 else x - 1, end=' ')\nprint()", "n=int(input())\r\nA=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(len(A)):\r\n if A[i]%2==0:\r\n A[i]-=1\r\nfor i in range(len(A)):\r\n m.append(str(A[i]))\r\nprint(' '.join(m))", "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=t()\r\n a=list(ll())\r\n d={}\r\n for i in range(n):\r\n if a[i]%2==0:\r\n a[i]-=1\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n print(*a)\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", "n = int(input())\r\na = input()\r\naL = list(map(int, a.split()))\r\nr = list(map(lambda item: item - 1 if item % 2 == 0 else item, aL))\r\nprint(\" \".join(str(i) for i in r))", "n=int(input())\nl=list(map(int,input().split()))\nm=[]\nfor i in l:\n if i%2==0:\n m.append(i-1)\n else:\n m.append(i)\nfor i in m:\n print(i,end=\" \")\n", "# cook your dish here\r\n\r\n# from math import factorial, ceil, pow, sqrt, floor, gcd\r\nfrom sys import stdin, stdout\r\n\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\n# import sympy\r\n# from itertools import permutations\r\n# import numpy as np\r\n\r\n# n = int(stdin.readline())\r\n# stdout.write(str())\r\n# s = stdin.readline().strip('\\n')\r\n# map(int, stdin.readline().split())\r\n# l = list(map(int, stdin.readline().split()))\r\n\r\nfor _ in range(1):\r\n#for _ in range(int(stdin.readline())):\r\n n = int(stdin.readline())\r\n l = list(map(int, stdin.readline().split()))\r\n for i in range(n):\r\n l[i] -= (l[i] % 2 == 0)\r\n\r\n print(*l)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=[]\r\nfor i in a:\r\n if i%2==0:\r\n ans.append(i-1)\r\n else:\r\n ans.append(i)\r\nprint(*ans,sep=\" \")\r\n", "n = int(input())\r\na = input().split()\r\nfor i in a:\r\n i = int(i)\r\n if i % 2 == 0:\r\n i -= 1\r\n print(i, end=\" \")\r\n", "# 1006A\r\n# https://codeforces.com/problemset/problem/1006/A\r\ndef findNthMin(arr, n):\r\n sortedArr = list(sorted(set(arr)))\r\n return sortedArr[n-1]\r\n\r\ncnt = int(input())\r\nnumbers = [int(i) for i in input().split(' ')]\r\nmx = max(numbers) + 1\r\ncurMin = 0\r\nminNth = 1\r\nwhile curMin < mx:\r\n curMin = findNthMin(numbers, minNth)\r\n if curMin % 2 == 1:\r\n numbers = [item+1 if item==curMin else item for item in numbers]\r\n numbers = [item-1 if item==curMin+1 else item for item in numbers]\r\n curMin += 2\r\n else:\r\n numbers = [item-1 if item==curMin else item for item in numbers]\r\n curMin += 1\r\n minNth += 1\r\n \r\nprint(*numbers)", "query = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(query):\r\n\tif not a[i]%2:\r\n\t\ta[i]-=1\r\nprint(\" \".join(map(str, a[:query])))", "\"\"\" 616C \"\"\"\r\n\"\"\" 1152B \"\"\"\r\n# import math\r\n# import sys\r\ndef main():\r\n\t# n ,m= map(int,input().split())\r\n\t# arr = list(map(int,input().split()))\r\n\t# b = list(map(int,input().split()))\r\n\t# n = int(input())\r\n\t# TODO:\r\n\t# 1> LEETCODE FIRST PROBLEM WRITE\r\n\t# 2> VALERYINE AND DEQUEUE\r\n\tn = int(input())\r\n\tarr = list(map(int,input().split()))\r\n\tfor i in range(n):\r\n\t\tif arr[i]%2==0:\r\n\t\t\tarr[i]-=1\r\n\tprint(*arr)\r\n\t\r\n\treturn\r\n\t\t\r\nmain()\r\n# def test():\r\n# \tt = int(input())\r\n# \twhile t:\r\n# \t\tmain()\r\n# \t\tt-=1\r\n# test()\r\n", "int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nfor n, e in enumerate(lst):\r\n if e % 2 == 0:\r\n lst[n] = e - 1\r\n\r\nprint(*lst)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor val in l:\r\n if val%2==0:\r\n print(val-1,end=\" \")\r\n else:\r\n print(val,end=\" \")\r\nprint()", "n=int(input())\r\na=list(map(int,input().strip().split(' ')))\r\n\r\nfor x in a:\r\n if x%2==0:\r\n print(x-1,end=' ')\r\n else:\r\n print(x,end=' ')\r\n \r\n", "t=int(input())\r\nls=[int(i) for i in input().split()]\r\n\r\nfor i in range(len(ls)):\r\n if ls[i]%2==0:\r\n ls[i]-=1\r\nprint(*ls)\r\n", "n=int(input())\r\na=[int(x)for x in input().rstrip().split()]\r\nfor i in range(0,n):\r\n if a[i]%2==0:\r\n a[i]=a[i]-1\r\nfor i in a:\r\n print(i,end=\" \")\r\n \r\n", "def main():\r\n n = int(input())\r\n nums = list(map(int, input().split()))\r\n for i in range(len(nums)):\r\n if nums[i] %2 == 0:\r\n nums[i] -= 1\r\n \r\n print(*nums)\r\n\r\nmain()\r\n\r\n# import sys, threading \r\n# if __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()", "n = int(input())\r\nA = list(map(int,input().split()))\r\nfor i in range(n):\r\n if(A[i]&1):\r\n continue\r\n A[i]-=1\r\nprint(*A)", "from collections import Counter, defaultdict\r\n\r\nBS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfrom math import floor, ceil,pi\r\nimport sys\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,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919\r\n]\r\nimport timeit\r\ndef primef(n, plst = []):\r\n if n==1:\r\n return plst\r\n else:\r\n for m in primes:\r\n if n%m==0:\r\n return primef(n//m, plst+[m])\r\n return primef(1, plst+[n])\r\n\r\ndef lmii():\r\n return list(map(int, input().split()))\r\n\r\ndef ii():\r\n return int(input())\r\n\r\ndef countOverlapping(string,sub):\r\n count = start = 0\r\n while True:\r\n start = string.find(sub, start)+1\r\n if start > 0:\r\n count += 1\r\n else:\r\n return count\r\n\r\nn = ii()\r\nnums = lmii()\r\nnums = [i if i%2==1 else i-1 for i in nums]\r\nprint(*nums)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nl1=[]\r\nfor i in l:\r\n if i%2==0:\r\n l1.append(i-1)\r\n else:\r\n l1.append(i)\r\nfor i in l1:\r\n print(i,end=' ')", "n = int(input())\r\nlist_ = list(map(int, input().split()))[:n]\r\nfor i in range(len(list_)):\r\n if list_[i] % 2 == 0:\r\n list_[i] -= 1\r\nprint(*list_)", "n =int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n print(a[i]-1,end=' ')\r\n else:\r\n print(a[i],end=' ')\r\n\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nfor i in range(len(arr)):\r\n if arr[i]%2==0:\r\n arr[i]=arr[i]-1\r\nprint(*arr)", "import sys\r\nsc = sys.stdin.readline\r\nn=int(sc())\r\narr=list(map(int,sc().rstrip().split()))\r\nfor e in range(n):\r\n if arr[e]%2==0:\r\n arr[e]-=1\r\n sys.stdout.write(str(arr[e])+\" \") \r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in a:\r\n if i%2==0:\r\n l.append(i-1)\r\n else:\r\n l.append(i)\r\nl=[str(u) for u in l]\r\nprint(' '.join(l))", "n = int(input())\r\nl = list(map(int,input().split(' ')))\r\nfor i in range(len(l)):\r\n if l[i]%2 == 0:\r\n l[i] = l[i]-1\r\n print(l[i],end=\" \")", "n = int(input())\r\narr = [int(elem) for elem in input().split()]\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n arr[i]-=1\r\nprint(' '.join([str(elem) for elem in arr]))", "n=int(input())\r\na=[*map(int,input().split())]\r\nfor i in range(n):a[i]-=a[i]%2==0\r\nprint(*a)", "n = int(input())\r\na = list(map(int,input().split()))\r\nl = list()\r\nfor i in a:\r\n if i % 2 == 0:\r\n l.append(i-1)\r\n else: l.append(i)\r\nprint(*l)", "from collections import deque\r\n\r\nn = int(input())\r\narray = deque(map(int, input().split()))\r\nfor i in range(n):\r\n element = array[i]\r\n if element % 2 == 0:\r\n array[i] = element - 1\r\nprint(*array)\r\n", "# Adjacent Replacements\ndef replac(arr):\n for n, i in enumerate(arr):\n if(i % 2 == 0):\n arr[n] -= 1\n for i in arr:\n print(i, \"\" , end = \"\")\n print()\n\n\nn = int(input())\nx = list(map(int, input().rstrip().split()))\nreplac(x)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = set()\r\nfor i in l:\r\n s.add(i-1)\r\n s.add(i+1)\r\n s.add(i)\r\nfor i in sorted(s):\r\n flag = True\r\n if i % 2 != 0:\r\n flag = False\r\n for j in range(len(l)):\r\n if l[j] == i and flag:\r\n l[j] -= 1\r\n elif l[j] == i:\r\n l[j] += 1\r\nprint(*l)", "from sys import stdin\r\n_input = stdin.readline\r\n_range, _int, _set = range, int, set\r\ndef solution():\r\n n = _int(_input())\r\n arr = [_int(i) for i in _input().split()]\r\n classifier = _set(arr)\r\n for i in _range(n):\r\n if arr[i] != 1 and arr[i] % 2 == 0:\r\n arr[i] -= 1\r\n\r\n\r\n print(*arr)\r\n\r\n\r\nsolution()\r\n", "n1 = int(input())\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\n\r\n\r\n\r\nfor i in range(len(list1)):\r\n if list1[i] % 2 == 0:\r\n temp = list1[i]\r\n list1[i] = temp-1\r\n \r\n\r\nfinal = []\r\nfor i in list1:\r\n final.append(str(i))\r\nprint(' '.join(final))", "n = int(input())\r\na = input().split()\r\n\r\nnumbers = []\r\n\r\nfor item in a:\r\n numbers.append(int(item))\r\n\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n numbers[i] = numbers[i] - 1\r\n\r\n\r\nfor final in numbers:\r\n print(int(final), end=' ')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n\tif a[i]%2==0:\r\n\t\tprint(a[i]-1, end = ' ')\r\n\telse:\r\n\t\tprint(a[i], end = ' ')\r\n\t\t" ]

[ "#cycle detection\r\ndef dfs(node,par):\r\n seen[node] = 1\r\n for each in adj[node]:\r\n if seen[each] == 0:\r\n if dfs(each,node) == True: return True\r\n else:\r\n if each != par: return True\r\n return False\r\n\r\nn,m = map(int,input().split())\r\nadj = [list() for i in range(n+1)]\r\nseen = [0] * (n+1)\r\nfor _ in range(m):\r\n a,b = map(int,input().split())\r\n\r\n adj[a].append(b)\r\n adj[b].append(a)\r\nans = 0\r\n\r\nfor i in range(1,n):\r\n if seen[i] == 0:\r\n\r\n if not dfs(i,i):\r\n ans += 1\r\n \r\nprint(ans)\r\n", "import sys\r\nfrom math import sqrt, gcd, ceil, log\r\n# from bisect import bisect, bisect_left\r\nfrom collections import defaultdict, Counter, deque\r\n# from heapq import heapify, heappush, heappop\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\nsys.setrecursionlimit(200000)\r\n\r\n\r\ndef main(): \r\n\tn, m = read()\r\n\tadj = defaultdict(list)\r\n\tvisited = defaultdict(int)\r\n\t# visited\r\n\tfor i in range(m):\r\n\t\tx, y = read()\r\n\t\tadj[x].append(y)\r\n\t\tadj[y].append(x)\r\n\r\n\tdef dfs(ver):\r\n\t\tparent = defaultdict(int)\r\n\t\tstk = [(ver,0)]\r\n\t\tvisited[ver] = 1\r\n\t\tparent[ver] = 0\r\n\t\twhile stk:\r\n\t\t\tnode, par = stk.pop()\r\n\t\t\tfor child in adj[node]:\r\n\t\t\t\tif child == par:continue\r\n\t\t\t\telif not visited[child]:\r\n\t\t\t\t\tvisited[child] = 1\r\n\t\t\t\t\tparent[child] = node\r\n\t\t\t\t\tstk.append((child, node))\r\n\t\t\t\telif parent[child] != node:\r\n\t\t\t\t\treturn(0)\r\n\t\treturn(1)\r\n\r\n\tans = 0\r\n\tfor i in range(1, n+1):\r\n\t\tif not visited[i]:\r\n\t\t\tans += dfs(i)\r\n\t\t\t# print(i, visited)\r\n\tprint(ans)\r\n\t\t# \r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "import io,os\r\nfrom sys import stdout\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nout = stdout.write\r\nn, m = map(int, input().split())\r\nparent = [i for i in range(0, n + 1)]\r\nsize = [1]*(n + 1)\r\nedges = [0] * (n + 1)\r\ndef find(a):\r\n if (a == parent[a]): return a\r\n a = find(parent[a])\r\n return a\r\n\r\ndef union(a, b):\r\n a, b = find(a), find(b)\r\n if (a != b):\r\n if (size[a] < size[b]):\r\n a, b = b, a\r\n size[a], size[b] = size[a] + size[b], 0\r\n parent[b] = parent[a]\r\n edges[a] += edges[b]\r\n edges[a] += 1\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n union(a, b)\r\n\r\nans = 0\r\n\r\nfor i in range (1, n + 1):\r\n if (edges[i] == size[i] - 1):\r\n ans += 1\r\n\r\nout(str(ans) + '\\n')\r\n", "visited = {}\r\ndef BFS(V, Adj):\r\n connected_components = []\r\n for s in V:\r\n if s not in visited:\r\n visited[s] = True\r\n parent = {s : None}\r\n level = {s : None}\r\n frontier = [s]\r\n level_val = 1\r\n next1 = []\r\n while frontier:\r\n for u in frontier:\r\n for vertex in Adj[u]:\r\n if vertex not in parent:\r\n parent[vertex] = u\r\n level[vertex] = level_val\r\n visited[vertex] = True\r\n next1.append(vertex)\r\n frontier = next1\r\n level_val += 1\r\n next1 = []\r\n connected_components.append(list(parent.keys()))\r\n return connected_components\r\n\r\nn, m = map(int, input().split())\r\nvertices = [i for i in range(1, n+1)]\r\nadj_list = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n a,b = map(int, input().split())\r\n adj_list[a].append(b)\r\n adj_list[b].append(a)\r\nconnected_components = BFS(vertices, adj_list)\r\nans = 0\r\nfor i in connected_components:\r\n vert_count = len(i)\r\n edges = 0\r\n for vertex in i:\r\n edges += len(adj_list[vertex])\r\n edges = edges//2\r\n if vert_count > edges:\r\n ans += vert_count - edges\r\nprint(ans)\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nfrom collections import defaultdict\r\nclass UnionFind():\r\n def __init__(self,n):\r\n self.n=n\r\n self.parents=[-1]*n\r\n def find(self,x):\r\n if self.parents[x]<0:\r\n return x\r\n else:\r\n self.parents[x]=self.find(self.parents[x])\r\n return self.parents[x]\r\n def union(self,x,y):\r\n x=self.find(x)\r\n y=self.find(y)\r\n if x==y:\r\n return\r\n if self.parents[x]>self.parents[y]:\r\n x,y=y,x\r\n self.parents[x]+=self.parents[y]\r\n self.parents[y]=x\r\n def size(self,x):\r\n return -self.parents[self.find(x)]\r\n def members(self,x):\r\n root=self.find(x)\r\n return [i for i in range(self.n) if self.find(i)==root]\r\n def roots(self):\r\n return [i for i,x in enumerate(self.parents) if x<0]\r\nn,m=map(int,input().split())\r\ng=[[] for i in range(n)]\r\nuf=UnionFind(n)\r\narr=[]\r\nfor _ in range(m):\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 if uf.find(u-1)==uf.find(v-1):\r\n arr.append(u-1)\r\n uf.union(u-1,v-1)\r\nl=set()\r\nfor x in arr:\r\n l.add(uf.find(x))\r\nres=len(uf.roots())-len(l)\r\nprint(res)", "n,m=map(int,input().split())\r\nG=[set() for i in range(n)]\r\ndegree=[0 for i in range(n)]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x-=1\r\n y-=1\r\n degree[x]+=1\r\n degree[y]+=1\r\n G[x].add(y)\r\n G[y].add(x)\r\nvisited=[False for i in range(n)]\r\nfor x in range(n):\r\n if not visited[x]:\r\n while degree[x]==1:\r\n visited[x]=True\r\n y=G[x].pop()\r\n G[y].remove(x)\r\n degree[y]-=1\r\n degree[x]=2\r\n x=y\r\nans=0\r\nfor i in range(n):\r\n if degree[i]==0:\r\n ans+=1\r\nprint(ans)\r\n", "\r\nn,m=map(int,input().split())\r\n\r\nciudades = {}\r\nvisitados = set()\r\nciudades_separadas = 0\r\nfoo = True\r\n\r\ndef dfs(n,p):\r\n global foo, visitados\r\n visitados.add(n)\r\n for c in ciudades[n]:\r\n if (c == p): continue\r\n if c in visitados: foo = False\r\n else: dfs(c,n)\r\n if not foo: return\r\n \r\n if not foo: return\r\n\r\nciudades = {i:[] for i in range(0,n+10)}\r\n \r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n ciudades[x].append(y)\r\n ciudades[y].append(x)\r\n\r\nfor i in range(1,n+1):\r\n if i not in visitados:\r\n foo = True\r\n dfs(i,-1)\r\n if foo: ciudades_separadas += 1 \r\n \r\n\r\nprint(ciudades_separadas)\r\n \r\n", "from collections import deque\n\ndef reform(n, m, R):\n E = [[] for _ in range(n)]\n for i, j in R:\n E[i-1].append(j-1)\n E[j-1].append(i-1)\n\n V = [False] * n\n s = 0\n for i in range(n):\n if V[i]:\n continue\n D = deque()\n D.append((None, i))\n V[i] = True\n f = False\n while D:\n i, j = D.pop()\n for k in E[j]:\n if k == i:\n continue\n if V[k]:\n f = True\n else:\n D.append((j, k))\n V[k] = True\n if not f:\n s += 1\n return s\n\n\ndef main():\n n, m = readinti()\n R = readinttl(m)\n print(reform(n, m, R))\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", "import sys\n \nsys.setrecursionlimit(200000)\n \nn, m = map(int, input().split())\n \ngraph = [[] for _ in range(n)]\nnotused = [True for _ in range(n)]\n \nfor _ in range(m):\n x, y = map(int, input().split())\n x -= 1\n y -= 1\n graph[x].append(y)\n graph[y].append(x)\n \ndef dfs(x, pre):\n if notused[x]:\n notused[x] = False\n res = True\n for i in graph[x]:\n if pre != i:\n res = res and dfs(i, x)\n return res\n else:\n return False\n \nk = 0\nfor j in range(n):\n if notused[j]:\n if dfs(j, -1):\n k += 1\n \nprint(k)\n\t \t\t\t\t \t\t\t\t\t\t\t \t \t\t \t\t \t", "from collections import deque\r\nimport sys\r\nn, m = map(int, sys.stdin.readline().split())\r\nvertices = [[] for i in range(n + 1)]\r\nvisit = [0] * (n + 1)\r\nfor i in range(m):\r\n a, b = map(int, sys.stdin.readline().split())\r\n vertices[a].append(b)\r\n vertices[b].append(a)\r\n\r\n\r\ndef bfs(v):\r\n visit[v] = 1\r\n label = 0\r\n while queue:\r\n v, p = queue.popleft()\r\n for u in vertices[v]:\r\n if not visit[u]:\r\n visit[u] = 1\r\n queue.append((u, v))\r\n elif u != p:\r\n label = 1\r\n return label\r\n\r\n\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if not visit[i]:\r\n queue = deque()\r\n queue.append((i, 0))\r\n if not visit[i] and not bfs(i):\r\n ans += 1\r\n \r\nsys.stdout.write(str(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\n\r\nc = 0\r\nx = [0]*(n+1)\r\nfor i in range(1, n+1):\r\n if len(d[i]) == 0:\r\n c += 1\r\n elif x[i] == 0:\r\n x[i] = 1\r\n q = [i]\r\n s = set()\r\n f = 0\r\n while q:\r\n a = q.pop()\r\n s.add(a)\r\n f += len(d[a])\r\n for j in d[a]:\r\n if x[j] == 0:\r\n x[j] = 1\r\n q.append(j)\r\n f //= 2\r\n if f < len(s):\r\n c += 1\r\nprint(c)", "import sys\r\nfrom collections import defaultdict, Counter\r\nfrom collections import deque\r\nfrom types import GeneratorType\r\n\r\n \r\ndef construct_adj_list(edges):\r\n adj_list = defaultdict(list)\r\n for src, dst in edges:\r\n adj_list[src].append(dst)\r\n adj_list[dst].append(src)\r\n return adj_list\r\n \r\ndef get_num_isolated_cities_in_segment(current, adj_list, visited):\r\n queue = deque()\r\n visited[current] = True\r\n queue.append((current, -1))\r\n loop_found = False\r\n while queue:\r\n current, parent = queue.pop()\r\n for child in adj_list[current]:\r\n if child != parent:\r\n if visited[child]:\r\n loop_found = True\r\n else:\r\n queue.append((child, current))\r\n visited[child] = True\r\n return not loop_found\r\n\r\n \r\ndef solve(edges, n):\r\n adj_list = construct_adj_list(edges)\r\n visited = [False] * n\r\n num_isolated_cities = 0\r\n for current in range(n):\r\n if not visited[current]:\r\n num_isolated_cities += get_num_isolated_cities_in_segment(current, adj_list, visited) \r\n return num_isolated_cities\r\n \r\n \r\nif __name__ == \"__main__\":\r\n n, m = list(map(int, input().split()))\r\n \r\n edges = []\r\n for _ in range(m):\r\n src, dst = list(map(int, input().split()))\r\n edges.append((src-1, dst-1))\r\n print(solve(edges, n))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,M = map(int, input().split())\r\nP = [[] for _ in range(N)]\r\nfor _ in range(M):\r\n u,v = map(int, input().split())\r\n u-=1;v-=1\r\n P[u].append(v)\r\n P[v].append(u)\r\n \r\ncolor=0\r\ncircle = set()\r\nseen = [0]*N\r\nfor i in range(N):\r\n if seen[i]:continue\r\n color+=1\r\n v = [(i,-1)]\r\n while v:\r\n idx,p = v.pop()\r\n if seen[idx]:continue\r\n seen[idx] = 1\r\n \r\n for j in P[idx]:\r\n if seen[j] and j!=p:\r\n circle.add(color)\r\n if j==p or seen[j]:continue\r\n v.append((j,idx))\r\n \r\nprint(color-len(circle))\r\n \r\n\r\n ", "\n\ndef solve():\n\tn,m = map(int,input().split())\n\tadj = [[]for i in range(n+1)]\n\tfor i in range(m):\n\t\ta,b = map(int,input().split())\n\t\tadj[a].append(b)\n\t\tadj[b].append(a)\n\tdef dfs(s,par):\n\t\tvisited[s] = True\n\t\tfor i in adj[s]:\n\t\t\tif i==par:\n\t\t\t\tcontinue\n\t\t\telif visited[i]:\n\t\t\t\treturn True\n\t\t\telse:\n\t\t\t\tif dfs(i,s):\n\t\t\t\t\treturn True\n\t\treturn False\n\tvisited = [False]*(n+1)\n\tans = 0\n\tfor i in range(1,n+1):\n\t\tif not visited[i]:\n\t\t\tif not dfs(i,-1):\n\t\t\t\tans+=1\n\tprint(ans)\n\n\n\n\n\n\n# number of test cases\nt = 1\n#t = int(input())\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "import sys,threading\r\ninput =sys.stdin.readline\r\nsys.setrecursionlimit(10**7)\r\nthreading.stack_size(2**27)\r\nfrom collections import defaultdict\r\n \r\n#!---------------------------------!#\r\n \r\n \r\nadj=defaultdict(list) ; vis=set()\r\ndef dfs(node,parent):\r\n boool=False\r\n vis.add(node)\r\n for child in adj[node]:\r\n if child!=parent:\r\n if child in vis:\r\n boool=True\r\n continue\r\n boool=boool or dfs(child,node)\r\n return boool\r\ndef main():\r\n global adj,vis\r\n n,m=map(int,input().split())\r\n vis=set();cnt=0\r\n for _ in range(m):\r\n u,v=map(int,input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n for child in range(1,n+1):\r\n if len(adj)==0:cnt+=1;continue\r\n if child not in vis:\r\n if not dfs(child,-1):cnt+=1\r\n print(cnt)\r\n \r\nif __name__ == '__main__':\r\n t = threading.Thread(target=main)\r\n t.start()\r\n t.join()", "n,m=map(int,input().split())\r\ne=[[] for i in range(n+1)]\r\nf=[0]*(n+1); ans=0\r\nfor i in range(m):\r\n po,ki=map(int,input().split())\r\n e[po].append(ki); e[ki].append(po)\r\nfor i in range(1,n+1):\r\n if f[i]: continue\r\n ch=[(i,0)]; f[i]=1; fl=1\r\n while ch!=[]:\r\n nom,pre=ch.pop()\r\n for x in e[nom]:\r\n if x==pre: continue\r\n if f[x]==1: fl=0\r\n if f[x]==0: ch.append((x,nom)); f[x]=1\r\n ans+=fl \r\nprint(ans)" ]

[ "n,m=map(int,input().split());x,y=[],[];b=0\r\nfor i in range(n):\r\n\tt=list(map(int,input().split()))\r\n\tfor j in range(m):\r\n\t\tif t[j]==1:y.append(j+1);x.append(i+1)\r\nfor i in y:\r\n\tif i==1 or i==m:b=2;break\r\nfor i in x:\r\n\tif i==1 or i==n:b=2;break\r\nif b==2:print(2)\r\nelse:print(4)", "n, m = map(int, input().split())\r\nmatrix = [[] for i in range(n)]\r\nfor i in range(n):\r\n matrix[i] = list(map(int, input().split()))\r\nflag = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == 1:\r\n if i == 0 or i == n - 1 or j == 0 or j == m - 1:\r\n flag = 1\r\n\r\nif flag == 0:\r\n print(4)\r\nelse:\r\n print(2)", "class CodeforcesTask359ASolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.board = []\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.board.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n if 1 in self.board[0] or 1 in self.board[-1]:\n self.result = \"2\"\n elif 1 in [x[0] for x in self.board] or 1 in [x[-1] for x in self.board]:\n self.result = \"2\"\n else:\n self.result = \"4\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask359ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n, m = list(map(int, input().split()))\r\ngood_cells = []\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n for j, element in enumerate(row):\r\n if element == 1:\r\n good_cells.append((i,j))\r\n\r\n\r\ndef ismarginal(cell):\r\n x, y = cell\r\n if x == 0 or x == n-1:\r\n return True\r\n elif y == 0 or y == m-1:\r\n return True\r\n return False\r\n\r\ncondition = False\r\nfor cell in good_cells:\r\n if ismarginal(cell):\r\n condition = True\r\n break\r\nif condition:\r\n print(2)\r\nelse:\r\n print(4)\r\n", "n, m = map(int, input().split());\ndata = [[0] * m] * n;\n\nfor i in range(0, n):\n data[i] = list(map(int, input().split()));\n\nflag = 1;\nfor i in range(0, n):\n if (data[i][0] == 1 or data[i][m - 1] == 1):\n flag = 0;\nfor i in range(0, m):\n if (data[0][i] == 1 or data[n - 1][i] == 1):\n flag = 0;\n\nprint(2 + flag * 2);\n\n\n\n\n\n", "n,m=map(int,input().split())\r\nans=4\r\nimport sys\r\nfor i in range(n):\r\n l1=list(map(int,input().split()))\r\n if i==0 or i==n-1:\r\n if l1.count(1)>0:\r\n ans=2\r\n print(2)\r\n sys.exit()\r\n else :\r\n if l1[0]==1 or l1[m-1]==1:\r\n print(2)\r\n sys.exit()\r\n \r\nprint(4)", "r, c = [int(x) for x in input().split()]\r\nl = []\r\nfor i in range(1, r+1):\r\n a = [int(x) for x in input().split()]\r\n y = 1\r\n for j in a:\r\n if j == 1:\r\n l.append([i, y])\r\n y += 1\r\nfor i in l:\r\n if i[0] == 1 or i[0] == r or i[1] == 1 or i[1] == c:\r\n print(2)\r\n exit()\r\nprint(4)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nans = 4\r\nfor i in range(n):\r\n s = input()[:-1].replace(' ','')\r\n if i == 0 or i == n-1:\r\n if '1' in s:\r\n ans = 2\r\n break\r\n if s[0] == '1' or s[-1] == '1':\r\n ans = 2\r\n break\r\nprint(ans)\r\n", "n, m = [int(i) for i in input().split()]\r\n\r\nc = 4 # initial count\r\n\r\nfor i in range(n):\r\n\tx = [int(j) for j in input().split()]\r\n\tif i==0 and any(x):\r\n\t\tc = 2\r\n\telif i==n-1 and any(x):\r\n\t\tc = 2\r\n\telif x[0] or x[-1]:\r\n\t\tc = 2\r\n\t\t\r\nprint(c)", "n,m=map(int,input().split())\r\na=[]\r\nfor x in range(n):\r\n a.append([int(i)for i in input().split()])\r\nok=0\r\nok |= sum(a[0])\r\nok |= sum(a[-1])\r\nfor row in a:\r\n ok |= row[0]+row[-1]\r\nprint(2 if ok else 4)", "n,m=(int(i) for i in input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append([int(i) for i in input().split()])\r\nc=0\r\nfor i in range(m):\r\n if(l[0][i]==1):\r\n c=1\r\n break\r\nfor i in range(n):\r\n if(l[i][0]==1):\r\n c=1\r\n break\r\nfor i in range(n):\r\n if(l[i][m-1]==1):\r\n c=1\r\n break\r\nfor i in range(m):\r\n if(l[n-1][i]==1):\r\n c=1\r\n break\r\nif(c==1):\r\n print(2)\r\nelse:\r\n print(4)", "n, m = map(int, input().split())\r\na = []\r\ng = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 1:\r\n g.append((i, j))\r\nl = len(g)\r\ntwo = False\r\nfor i in range(l):\r\n if g[i][0] == 0 or g[i][1] == 0 or g[i][0] == (n - 1) or g[i][1] == (m - 1):\r\n two = True\r\n break\r\nif two:\r\n print(2)\r\nelse:\r\n print(4)\r\n", "n, m = map(int, input().split())\r\n\r\nrows = []\r\ncols = [\"\"]*m\r\nfor i in range(n):\r\n\trow = input().split()\r\n\trows.append(row)\r\n\tfor j in range(m):\r\n\t\tcols[j]+= row[j]\r\n\r\nif '1' in rows[0] or '1' in cols[0] or '1' in cols[-1] or '1' in rows[-1]:\r\n\tprint(2)\r\nelse:\r\n\tprint(4)", "row = input().split()\r\n\r\nn = int(row[0])\r\nm = int(row[1])\r\n\r\nborder = False\r\nfor i in range(n):\r\n newRow = input().split()\r\n if i == 0 or i == n-1:\r\n if '1' in newRow: border = True\r\n elif newRow[0] ==\"1\" or newRow[m-1]==\"1\": border = True\r\n\r\n\r\nif border:print('2')\r\nelse: print('4')", "a,b=map(int,input().split())\r\nl=[input().split() for x in range(a)]\r\nfor i in range(a):\r\n for j in range(b):\r\n if l[i][j]==\"1\":\r\n if i==0 or j==0 or i+1==a or j+1==b:\r\n print(2)\r\n exit()\r\n\r\nprint(4) \r\n", "n, m = map(int, input().split())\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nflag = False\r\nfor i in range(n):\r\n if data[i][0] == 1 or data[i][m - 1] == 1:\r\n flag = True\r\n break\r\n\r\nfor i in range(m):\r\n if data[0][i] == 1 or data[n - 1][i] == 1:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(2)\r\nelse:\r\n print(4)", "n, m = (int(i) for i in input().split())\nres = 4\nfor r in range(n):\n s = input()\n if r % (n - 1) == 0 and (s[0] == \"1\" or s[-1] == \"1\"):\n res = 1\n elif (r % (n - 1) == 0 and \"1\" in s) or (s[0] == \"1\" or s[-1] == \"1\"):\n res = min(res, 2)\nprint(res)\n", "\r\nn, m = map(int, input().split())\r\nvalues = []\r\nfor i in range(n):\r\n values.append([int(k) for k in input().split()])\r\n\r\ndef checkRows(x,n):\r\n return 1 in x[0] or 1 in x[n-1]\r\n\r\ndef checkCol(x,n,m):\r\n are = False\r\n for i in range(n):\r\n if x[i][0] ==1 or x[i][m-1] ==1:\r\n are = True\r\n break\r\n return are\r\n \r\nif checkRows(values, n) or checkCol(values, n, m):\r\n print(2)\r\nelse:\r\n print(4)\r\n", "n,m = list(map(int,input().split(\" \")))\r\ng = []\r\ngood = []\r\nfor i in range(n):\r\n g.append(input().split(\" \"))\r\n for j in range(m):\r\n if g[i][j] == \"1\":\r\n good.append((i,j))\r\n\r\nc = 4\r\n\r\nfor i in good:\r\n if i[0] == 0 or i[1] == 0 or i[0] == n-1 or i[1] == m-1:\r\n c = 2\r\n \r\nprint(c)\r\n", "n, m = map(int, input().split())\r\nA = [list(map(int, input().split())) for i in range(n)]\r\ncount = 4\r\nfor i in range(m):\r\n if A[0][i] == 1 or A[-1][i] == 1:\r\n count = 2\r\nfor i in range(n):\r\n if A[i][0] == 1 or A[i][-1] == 1:\r\n count = 2\r\nprint(count)", "n, m = [int(x) for x in input().split()]\nl = []\n\nfor i in range(n):\n row = [int(x) for x in input().split()]\n l.append( row )\n\nfound = False\nfor i in range(n):\n for j in range(m):\n if l[i][j]==1:\n if i==0 or i==n-1 or j==0 or j==m-1:\n found = True\n print(\"2\")\n break\n if found:\n break\n\nif not found:\n print(\"4\")\n", "rows, columns = [int(x) for x in input().split()]\r\ntable = []\r\ncount = 0\r\nfor i in range(rows):\r\n table.append([int(x) for x in input().split()])\r\nfor test in table[0]:\r\n if test == 1:\r\n count += 1\r\nfor test in table[-1]:\r\n if test == 1:\r\n count += 1\r\nfor i in range(rows):\r\n if table[i][0] == 1:\r\n count += 1\r\n elif table[i][-1] == 1:\r\n count += 1\r\nif count >= 1:\r\n print(\"2\")\r\nelse:\r\n print(\"4\")", "n, m = map(int, input().split())\n\ntable = []\nfor i in range(n):\n rows = input().split()\n rows_num = [int(x) for x in rows]\n table.append(rows_num)\n\nisVal = False\nfor i in range(m):\n if table[0][i] == 1 or table[n - 1][i] == 1:\n isVal = True\n\nfor i in range(n):\n if table[i][0] == 1 or table[i][m - 1] == 1:\n isVal = True\n\nif isVal:\n print(2)\nelse:\n print(4)\n", "n,m = map(int,input().split())\r\narr=[]\r\nfor z in range(n):\r\n arr.append([])\r\n arr[z] = [int(i) for i in input().split()]\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j]==1:\r\n if i==0 or i==n-1:\r\n c=1\r\n if j==0 or j==m-1:\r\n c=1\r\nif c:\r\n print(2)\r\nelse:\r\n print(4)", "n, m = map(int, input().split())\r\nans = 4\r\nif '1' in input(): ans = 2\r\nelse:\r\n for i in range(n - 2):\r\n t = input()\r\n if '1' == t[0] or '1' == t[-1]:\r\n ans = 2\r\n break\r\nif '1' in input(): ans = 2\r\nprint(ans)", "n, m = list(map(int,input().split()))\r\n\r\ntable = []\r\nfor i in range(n):\r\n table.append(list(map(int, input().split())))\r\n\r\nhaveonvertical = False\r\nhaveonhorizont = False\r\n\r\nfor x in table:\r\n if x[0]==1 or x[-1]==1:\r\n haveonvertical = True\r\n\r\nfor y in table[0]:\r\n if y == 1:\r\n haveonhorizont = True\r\n\r\nfor y in table[-1]:\r\n if y == 1:\r\n haveonhorizont = True\r\n\r\nif haveonhorizont or haveonvertical:\r\n print(2)\r\nelse:\r\n print(4)\r\n", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().split())\r\nans = 4\r\nfor i in range(1, n + 1):\r\n ind = 1\r\n for v in list(map(int, stdin.readline().split())):\r\n if v and (ind == 1 or ind == m or i == 1 or i == n):\r\n ans = 2\r\n ind += 1\r\nstdout.write(str(ans))", "n, m = [int(x) for x in input().split()]\r\nrows = [[int(x) for x in input().split()] for _ in range(n)]\r\n \r\nif (1 in rows[0]) or (1 in rows[-1]) or any(rows[i][0] == 1 for i in range(n)) or any(rows[i][-1] == 1 for i in range(n)):\r\n print(2)\r\nelse:\r\n print(4)", "#RAVENS\n#TEAM_2\n#ESSI-DAYI_MOHSEN-LORENZO\narr=[]\nn,m = map(int,input().split())\nfor i in range(n):arr.append(list(map(int,input().split())))\nprint(2 if 1 in arr[0] or 1 in arr[n-1] or (any(arr[i][0] for i in range(n))) or (any(arr[i][m-1]for i in range(n))) else 4)", "def solution(a,n,m):\r\n for i in range(n):\r\n if i==0 or i==n-1:\r\n for j in range(1,m-1):\r\n if a[i][j]==1:\r\n print(2)\r\n return\r\n else:\r\n for j in [0,m-1]:\r\n if a[i][j]==1:\r\n print(2)\r\n return\r\n\r\n for i in range(1,n-1):\r\n for j in range(1,m-1):\r\n if a[i][j]==1:\r\n print(4)\r\n return\r\n \r\n\r\n\r\n\r\na=list(map(int,input('').split()))\r\nc=[]\r\nfor i in range(a[0]):\r\n b=list(map(int,input('').split()))\r\n c.append(b)\r\n\r\nsolution(c,a[0],a[1])", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\nc = 0\r\nmid = 0\r\nfor i in range(n):\r\n\ts = input().split()\r\n\tfor j in range(m):\r\n\t\tif(int(s[j]) == 1 and (i==0 or j==0 or i==n-1 or j==m-1)):\r\n\t\t\tc = 1\r\n\t\telif(int(s[j]) == 1):\r\n\t\t\tmid = 1\r\n\r\nif(c == 1):\r\n\tprint(2)\r\nelif(mid==1):\r\n\tprint(4)\r\n", "n,m = map(int,input().split())\r\ncheck = 0\r\nfor i in range(n):\r\n s = input()\r\n if i==0 or i==n-1:\r\n if '1' in s:\r\n check = 1\r\n break\r\n elif s[0]=='1' or s[-1]=='1':\r\n check = 1\r\n break\r\nif check:\r\n print(2)\r\nelse:\r\n print(4)", "# python 3\n\"\"\"\n\"\"\"\n\n\ndef table(n_int: int, m_int: int, table_cells_list: list) -> int:\n boundary_bool = False\n for i in range(n_int):\n for j in range(m_int):\n if table_cells_list[i][j] == 1:\n if i == 0 or i == n_int - 1 or j == 0 or j == m_int - 1:\n boundary_bool = True\n if boundary_bool:\n return 2\n else:\n return 4\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n n, m = list(map(int, input().split()))\n table_cells = [list(map(int, input().split())) for i in range(n)]\n # print(table_cells)\n print(table(n, m, table_cells))\n", "data = input().split()\r\n\r\nN, M = int(data[0]), int(data[1])\r\n\r\ntable = []\r\nfor i in range(N):\r\n table.append(input().split())\r\n\r\nanswer = 0\r\n\r\n## If there's 1 in first or last row or first and last column so answer\r\n## will be : 2\r\n## Otherwise, will equal to 4\r\n\r\n## for first row\r\nif any(e == '1' for e in table[0]):\r\n answer = 2\r\n## for last row\r\nelif any(e == '1' for e in table[-1]):\r\n answer = 2\r\n## for first and last column\r\nelse:\r\n for i in range(N):\r\n if table[i][0] == '1':\r\n answer = 2\r\n elif table[i][-1] == '1':\r\n answer = 2\r\n\r\nif answer == 0:\r\n print('4')\r\nelse:\r\n print(answer)", "\r\na = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\ng = []\r\nfor i in range(n):\r\n g.append(input().split())\r\n\r\nmine = 4\r\nfor i in range(1,n-1):\r\n if g[i][0] == '1' or g[i][m-1] == '1':\r\n mine = 2\r\nfor i in range(1,m-1):\r\n if g[0][i] == '1' or g[n-1][i] == '1':\r\n mine = 2\r\n\r\nprint(mine)", "# cook your dish here\r\nn, m = map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n mat.append(a)\r\n \r\nflag=0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if(mat[i][j]==1):\r\n if(i==0 or j==0 or j == m-1 or i==n-1):\r\n flag=1\r\n\r\nif(flag==1):\r\n print(2)\r\nelse:\r\n print(4)", "n,m=map(int,input().split())\r\nparsa=[]\r\np=0\r\ncounter=0\r\nfor i in range(n):\r\n ali=list(map(int,input().split()))\r\n parsa.append(ali)\r\nfor i in range(n):\r\n for j in range(m):\r\n if parsa[i][j]==1 and (i==0 or i==n-1 or j==0 or j==m-1):\r\n counter+=1\r\nif counter>0 :\r\n print(2)\r\nelse:\r\n print(4)", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n\ta=list(map(int,input().split()))\r\n\tif i==0 or i==n-1:\r\n\t\tif 1 in a:\r\n\t\t\tprint(2)\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif a[0]==1 or a[-1]==1:\r\n\t\t\tprint(2)\r\n\t\t\tbreak\r\nelse:\r\n\tprint(4)", "n,m=map(int,input().split())\nfrom sys import*\nans=4\nfor _ in range(n):\n a=[int(x)for x in input().split()]\n if _==0 or _==n-1:\n if a[0] or a[-1]:print(1);exit()\n else:\n for i in a[1:-1]:\n if i:ans=2\n else:\n if a[0] or a[-1]:\n ans=2\nprint(ans)\n\n\n", "n,m=map(int,input().split())\r\nflag=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n if(i==0 or i==n-1):\r\n if(1 in l):\r\n flag=1\r\n break\r\n elif(l[0]==1 or l[m-1]==1):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(\"2\")\r\nelse:\r\n print(\"4\")", "n , m = (int(x) for x in input().split())\r\nl = []\r\nfor i in range(0, n):\r\n l.append( [int(x) for x in input().split()] )\r\n\r\na = False\r\nif (1 in l[0]) or (1 in l[-1]): a = True\r\n\r\nfor i in range(0,n):\r\n if l[i][0] == 1 or l[i][-1] == 1: \r\n a = True\r\n break\r\n \r\nif a: print(2)\r\nelse: print(4)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=[input().split()for i in range(n)]\r\nb=[*zip(*a)]\r\nprint([4,2]['1'in''.join([*a[0],*a[n-1],*b[0],*b[m-1]])])", "is_tow = False\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n x = list(map(int, input().split()))\r\n for j in range(m):\r\n if x[j]:\r\n if j == 0 or j == m - 1 or i == 0 or i == n - 1:\r\n is_tow = True\r\nprint(2) if is_tow else print(4)\r\n", "n,m=map(int,input().split())\r\nb=[list(map(int, input().split())) for i in range(n)]\r\nfor i in range(n):\r\n if 1 in b[0] or 1 in b[n-1]:\r\n print(2)\r\n break\r\n elif b[i][0]==1 or b[i][m-1]==1:\r\n print(2)\r\n break\r\n elif i==n-1:print(4)\r\n", "#https://codeforces.com/problemset/problem/359/A\nn,m=map(int,input().split())\nboard=[]\nfor i in range(n):\n\tboard.append([int(x) for x in input().split()])\nisGoodOnSide=False\nfor i in range(n):\n\tfor j in range(m):\n\t\tif board[i][j]==1 and (i==0 or i==n-1 or j==0 or j==m-1):\n\t\t\tisGoodOnSide=True\n\t\t\tbreak\nif isGoodOnSide:\n\tprint(2)\nelse:\n\tprint(4)\n", "import math\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n table = [[int(k) for k in input().split(\" \")] for i in range(n)]\r\n good_cell_found_on_the_corner = False\r\n for i in range(n):\r\n for j in range(m):\r\n if (i == 0 or j == 0 or i == n - 1 or j == m - 1) and table[i][j] == 1:\r\n good_cell_found_on_the_corner = True\r\n if not good_cell_found_on_the_corner:\r\n print(4)\r\n else:\r\n print(2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "rows, columns = input().split()\r\nrows = int(rows)\r\ncolumns = int(columns)\r\nrectangle = []\r\nbad = 0\r\nonSide = False\r\nfor i in range(rows):\r\n rectangle.append(input().split())\r\nfor i in range(rows):\r\n for j in range(columns):\r\n if (rectangle[i][j] == '1') and (rectangle[i][j] == rectangle[0][j] or rectangle[i][j] == rectangle[i][0] or rectangle[i][j] == rectangle[i][columns-1] or rectangle[i][j] == rectangle[rows-1][j]):\r\n onSide = True\r\n break\r\n \r\n\r\nif onSide:\r\n print(2)\r\nelse:\r\n print(4)\r\n\r\n", "'''input\n4 3\n0 0 0\n0 0 1\n1 0 0\n0 0 0\n'''\n\nfrom math import sqrt\n\nn, m = map(int, input().split())\n\ntable = []\ngood_cels = []\ncolored = set()\n\nfound = False\ndef solve(n, m):\n for i in range(n):\n s = input().split()\n table.append(s)\n\n for j, elem in enumerate(s):\n if elem != '0':\n if i == 0 or i == n-1 or j == 0 or j == m-1:\n return 2\n\n\n return 4\n\n\n\nprint(solve(n,m))\n\n\n\n\n", "def main():\n n, m = map(int, input().split())\n l = list(tuple(map(int, input().split())) for _ in range(n))\n lt = list(tuple(zip(*l)))\n print(4 - 2 * (any(l[0]) or any(l[-1]) or any(lt[0]) or any(lt[-1])))\n\n\nif __name__ == '__main__':\n main()", "n, m = map(int, input().split())\nA = []\n\nfor i in range(n):\n A.append(list(map(int, input().split())))\n\nfor i in range(n):\n for j in range(m):\n if A[i][j] == 1 and (i in [0, n - 1] or j in [0, m - 1]):\n print(2)\n exit()\nprint(4)\n", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\nif arr[0][0] == 1 or arr[0][m-1] == 1 or arr[n-1][0] == 1 or arr[n-1][m-1] == 1:\r\n print(1)\r\nelse:\r\n flag = 0\r\n for i in range(n):\r\n if arr[i][0] == 1:\r\n flag = 1\r\n if arr[i][m-1] == 1:\r\n flag = 1\r\n for i in range(m):\r\n if arr[0][i] == 1:\r\n flag = 1\r\n if arr[n-1][i] == 1:\r\n flag = 1\r\n if flag == 1:\r\n print(2)\r\n else:\r\n print(4)", "n,m=map(int,input().split())\r\nmatrix=[]\r\nfor i in range(n):\r\n matrix.append(list(map(int,input().split())))\r\nmatrix[0][0]=matrix[0][m-1]=matrix[n-1][m-1]=matrix[n-1][0]=0\r\njav=4\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j]==1:\r\n if i==0 or i == (n-1):\r\n jav=2\r\n elif j==0 or j==m-1 :\r\n jav = 2\r\nprint(jav)", "n , m = [int(x) for x in input().split()]\r\n\r\ndef detect():\r\n if \"1\" in input():\r\n return 2\r\n for row in range(1 , n - 1):\r\n inpt = input()\r\n if \"1\" in [inpt[k] for k in [0 , -1]]:\r\n return 2 \r\n if \"1\" in input():\r\n return 2\r\n return 4\r\n\r\nprint(detect())", "# Link: http://codeforces.com/problemset/problem/359/A\n# Love you Atreyee my life. I cannot live without you. \nn, m = list(map(int, input().rstrip().split()))\nmat = []\ncount1 = 0\ncount2 = 0\nfor i in range(n):\n li = list(map(int, input().rstrip().split()))\n if i == 0 or i == n - 1:\n for j in li:\n if j == 1:\n count1 += 1\n if li[0] == 1 or li[m - 1]==1:\n count2 += 1\nif count1 > 0 or count2 > 0:\n print(2)\nelse:\n print(4)\n\n", "n, m = map(int, input().split())\r\nb = [list(map(int, input().split())) for i in range(n)]\r\nif 1 in b[0] or 1 in b[n - 1]:\r\n print(2)\r\nelse:\r\n for i in range(n):\r\n if b[i][0] == 1 or b[i][m - 1] == 1:\r\n print(2)\r\n break\r\n elif i == n - 1:\r\n print(4)\r\n", "input_str = input()\r\nn, m = int(input_str.split()[0]), int(input_str.split()[1])\r\na = []\r\npoints_wall = []\r\npoints = 0\r\ntemp = list(map(int, input().split()))\r\na.append(temp)\r\npos = temp.index(1) if temp.count(1) else -1\r\nif pos!=-1:\r\n points_wall.append([pos, 0])\r\nfor i in range(n-2):\r\n temp = list(map(int, input().split()))\r\n if temp[0]:\r\n points_wall.append([0, i+1])\r\n if temp[m-1]:\r\n points_wall.append([m-1, i+1]) \r\n points += temp[1:m-1].count(1)\r\n a.append(temp)\r\ntemp = list(map(int, input().split()))\r\na.append(temp)\r\npos = temp.index(1) if temp.count(1) else -1\r\nif pos!=-1:\r\n points_wall.append([pos, n-1])\r\n\r\ndef count(matr, x):\r\n c = 0\r\n for i in range(len(matr)):\r\n c += matr[i].count(x)\r\n return c\r\n \r\n \r\n# 1\r\nif len(points_wall):\r\n print (2)\r\nelse:\r\n if points:\r\n print (4)", "n, m = [int(i) for i in input().split()]\ntop = [int(i) for i in input().split()]\nmid = [int(j) for i in range(1, n - 1) for j in input().split()]\nbot = [int(i) for i in input().split()]\n\nl = (n - 2) * m\nmid = mid[0 : l : m] + mid[m - 1 : l : m]\n\nprint(2) if 1 in top + mid + bot else print(4)\n", "n, m = list(map(int, input().split()))\nmat = []\nfor r in range(n):\n mat.append(list(map(int, input().split())))\n\nborder = False\nfor r in range(n):\n if mat[r][0] or mat[r][-1]:\n border = True\nfor c in range(m):\n if mat[0][c] or mat[-1][c]:\n border = True\n\nif border:\n print(2)\nelse:\n print(4)\n\n", "n,m=map(int,input().split())\r\nl=[]\r\nf=0\r\nfor i in range(n):\r\n l.append(input().split())\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]=='1'):\r\n if((i==0 or i==n-1) or (j==0 or j==m-1)):\r\n f=1\r\n break\r\n if(f==1):\r\n break\r\nif(f==0):\r\n print(4)\r\nelse:\r\n print(2)\r\n", "n, m = map(int, input().split())\r\nfor i in range(n):\r\n lis = list(map(int, input().split()))\r\n if 0 < i < n-1:\r\n if lis[0] == 1 or lis[m-1] == 1:\r\n print(2)\r\n exit()\r\n else:\r\n if 1 in lis:\r\n print(2)\r\n exit()\r\nprint(4)", "r,c = map(int,input().split());a=[]\r\nfor i in range(r): a.append(input().split())\r\nfor i in range(r):\r\n for j in range(c):\r\n if a[i][j]=='1' and (i==0 or j==0 or i==r-1 or j==c-1 ):print(2);quit()\r\nprint(4)", "n, _ = map(int, input().split())\r\n\r\nif '1' in input():\r\n print(2)\r\nelse:\r\n for _ in range(n-2):\r\n s = input()\r\n if s[0]=='1' or s[-1]=='1':\r\n print(2)\r\n break\r\n else:\r\n print(4 - 2*('1' in input()))", "n, m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(n)]\ncol0, col1 = [], []\nfor i in A:\n col0.append(i[0])\n col1.append(i[-1])\nif A[0][0] + A[-1][-1] == 2 or A[0][-1] + A[-1][0] == 2:\n print(1)\nelif 1 in A[0] or 1 in A[-1] or 1 in col0 or 1 in col1:\n print(2)\nelse:\n print(4)\n\n", "n, m = map(int, input().split())\r\n\r\nx = 4\r\n\r\nfor i in range(n):\r\n\tl = input().split()\r\n\t\r\n\tif i in (0, n - 1) and \"1\" in l:\r\n\t\tx = 2\r\n\t\r\n\tif l[0] == \"1\" or l[-1] == \"1\":\r\n\t\tx = 2\r\n\t\t\r\nprint(x)", "'''\ncolour korte hobe kintu both equation meet korte hbe\n\n 0 0 0 \n 0 1 0\n 0 0 0 \n \n0 0 (2,2) (1,1 ) x1 = 1 x2 = 2\n0 1 1 < p <2 \n\nPATTERN khujte hbe\n\ntaile dekha jabe \n4 \n\nar 4 3 er tai 2\n\n00000000\n0 0\n0 0 esober kono jaigai valo cell thaklei answer hobe 2 else 4\n00000000\n\n\n'''\n\n\nn, m = map(int, input().split())\ntable = []\n\nfor i in range(n):\n table.append(input().split())\n\nkoybar_e_rong_kora_lagbe = 4\n\nif any(a== '1' for a in table[0] ) or any(a== '1' for a in table[-1]):\n koybar_e_rong_kora_lagbe = 2\n\nelse:\n for i in range(n):\n if table[i][0]=='1' or table[i][-1]=='1':\n koybar_e_rong_kora_lagbe =2\n\n\n\nprint(koybar_e_rong_kora_lagbe)\n\n\n\n\t\t\t\t\t \t \t\t\t \t \t\t\t \t \t \t\t\t\t\t \t\t", "n,m = list(map(int, input().split()))\r\nlst=[]\r\nf=1\r\n\r\nfor i in range(n):\r\n x = list(map(int, input().split()))\r\n lst.append(x) \r\n\r\nif lst[0].count(1)>0 or lst[n-1].count(1)>0:\r\n f=0\r\n \r\nif f:\r\n for i in range(n):\r\n for j in [0,m-1]:\r\n if lst[i][j]:\r\n f=0\r\n break\r\n \r\nif f:\r\n print(4)\r\nelse:\r\n print(2)", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(input().split())\r\na = 4\r\nfor i in range(1,n-1):\r\n if l[i][0]=='1' or l[i][m-1]=='1':\r\n a = 2\r\nfor j in range(1,m-1):\r\n if l[0][j]=='1' or l[n-1][j]=='1':\r\n a = 2\r\nprint(a)\r\n", "n, m = map(int, input().split())\na = [input().split() for i in range(n)]\nfor i in range(n):\n\tfor j in range(m):\n\t\tif a[i][j] == '1':\n\t\t\tif i == 0 or i + 1 == n or j == 0 or j + 1 == m:\n\t\t\t\tprint(2)\n\t\t\t\texit(0)\nprint(4)", "a, b = map(int, input().split())\r\nrowList = []\r\nideal = False\r\nfor i in range(a):\r\n rowList.append([int(x) for x in input().split()])\r\n\r\nfor j in range(len(rowList[0])):\r\n if rowList[0][j]==1:\r\n ideal = True\r\n\r\nfor k in range(len(rowList[a-1])):\r\n if rowList[a-1][k]==1:\r\n ideal = True\r\n\r\nfor l in range(len(rowList)):\r\n if rowList[l][0]==1:\r\n ideal = True\r\n if rowList[l][b-1]==1:\r\n ideal = True\r\n\r\nif ideal:\r\n print(2)\r\nelse:\r\n print(4)", "n, m = map(int, input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n\tl.append(list(map(int, input().split())))\r\n\r\ny = False\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif l[i][j] == 1 and (i == 0 or i == n - 1 or j == 0 or j == m - 1):\r\n\t\t\ty = True\r\n\t\t\tbreak\r\n\tif y:\r\n\t\tbreak\r\n\r\nif y:\r\n\tprint(2)\r\nelse:\r\n\tprint(4)", "data = input().split()\r\n\r\nN, M = int(data[0]), int(data[1])\r\n\r\ntable = []\r\nfor i in range(N):\r\n table.append(input().split())\r\n\r\nanswer = 0\r\n\r\nif any(e == '1' for e in table[0]):\r\n answer = 2\r\nelif any(e == '1' for e in table[-1]):\r\n answer = 2\r\nelse:\r\n for i in range(N):\r\n if table[i][0] == '1':\r\n answer = 2\r\n elif table[i][-1] == '1':\r\n answer = 2\r\n\r\nif answer == 0:\r\n print('4')\r\nelse:\r\n print(answer)\r\n", "r,c=[int(x) for x in input().split()]\r\nt=r \r\ncount=0\r\nx=[int(x) for x in input().split()]\r\nfor i in range(c):\r\n if x[i]==1:\r\n count+=1 \r\n\r\nfor i in range(1,t-1):\r\n x=[int(x) for x in input().split()]\r\n if x[0]==1 or x[c-1]==1:\r\n count+=1 \r\n \r\nx=[int(x) for x in input().split()]\r\nfor i in range(c):\r\n if x[i]==1:\r\n count+=1 \r\nif count>0:\r\n print(2)\r\nelse:\r\n print(4)\r\n \r\n \r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n mat+=[[int(i) for i in input().split()]]\r\nc=False\r\nif sum(mat[0])>=1:\r\n c=True\r\nif sum(mat[-1])>=1:\r\n c=True\r\nfor i in range(n):\r\n if mat[i][0]==1 or mat[i][-1]==1:\r\n c=True\r\n break\r\nif c:\r\n print(2)\r\nelse:\r\n print(4)\r\n\r\n", "n, m = map(int, input().split())\r\na = [input().split() for _ in range(n)]\r\nb = list(zip(*a))\r\n\r\nprint((4, 2)[sum([x.count('1') for x in [a[0], a[-1], b[0], b[-1]]]) > 0])\r\n", "n, m = map(int, input().split())\r\nx, y = set(), set()\r\nfor i in range(n):\r\n l = list(map(str, input().split()))\r\n for j in range(m):\r\n if l[j] == '1':\r\n x.add(i)\r\n y.add(j)\r\nans = 4\r\nfor i in x:\r\n if i == 0 or i == n-1:\r\n ans = 2\r\n break\r\nfor i in y:\r\n if i == 0 or i == m-1:\r\n ans = 2\r\n break\r\nprint(ans)", "n,m=map(int,input().split())\r\nco=False\r\nL=[]\r\nfor i in range(n):\r\n col=list(map(int,input().split()))\r\n L.append(col)\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if(L[i-1][j-1]==1):\r\n if((i==1 or i==n) or (j==1 or j==m)):\r\n co=True\r\n break\r\n\r\nif co:\r\n print(\"2\")\r\nelse:\r\n print(\"4\")\r\n \r\n", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if i==0 and 1 in a:\r\n c=1\r\n elif i==n-1 and 1 in a:\r\n c=1\r\n elif a[0]==1 or a[m-1]==1:\r\n c=1 \r\nif c==1:\r\n print(2)\r\nelse:\r\n print(4)\r\n\r\n\r\n\r\n", "n,m = map(int, input().split())\r\n\r\nans = 4\r\nfor i in range(n):\r\n line = list(map(int, input().split()))\r\n for j in range(m):\r\n if line[j] == 1 and (i == 0 or i == (n - 1)):\r\n ans = 2\r\n if line[j] == 1 and (j == 0 or j == (m - 1)):\r\n ans = 2\r\nprint(ans)", "import sys\r\na=0\r\nz=list(map(int,input().split()))\r\nfor i in range(z[0]):\r\n v=list(map(int,input().split()))\r\n for j in range(v.count(1)):\r\n if v.index(1)!=0 and v.index(1)!=z[1]-1:\r\n a+=2\r\n if i!=0 and i!=z[0]-1:\r\n a+=2\r\n if a==2:\r\n print(2)\r\n sys.exit(0)\r\n a=0\r\n v[v.index(1)]=0\r\nprint(4) \r\n", "r, c = [int(i) for i in input().split()]\nx = []\nfor _ in range(r):\n a = [int(i) for i in input().split()]\n x.append(a)\n\ndef min_operation():\n def all_color():\n for i in x:\n for j in i:\n if j == 0:\n return False\n return True\n\n if all_color():\n return 0\n if x[0][0] == 1 or x[0][c-1] == 1 or x[r-1][0] == 1 or x[r-1][c-1] == 1:\n return 1\n\n for i in range(r):\n if x[i][0] == 1 or x[i][c-1] == 1:\n return 2\n for i in range(c):\n if x[0][i] == 1 or x[r-1][i] == 1:\n return 2\n return 4\nprint(min_operation())\n", "def solve():\r\n n,m=map(int,input().split());a=[];flag=False\r\n for i in range(n):\r\n x=input()\r\n if i==0 and '1' in x:flag=True\r\n if not flag and i==n-1 and '1' in x:flag=True\r\n if not flag and 0<i<n-1 and x[0]=='1' or x[-1]=='1':flag=True\r\n if flag:print(2) \r\n if not flag :print(4)\r\n \r\nsolve()", "m, n = [int(i) for i in input().split()]\r\nl=[]\r\n\r\nfor i in range(m): l.append(input().split())\r\n\r\nif \"1\" in l[0] or \"1\" in l[-1] or \"1\" in [i[-1] for i in l] or \"1\" in [i[0] for i in l]: print(2)\r\nelse: print(4)", "n,m = map(int,input().split())\r\nt = []\r\nfor i in range(n):\r\n\tt.append(list(map(int,input().split())))\r\n\tif t[i][0] == 1 or t[i][-1] == 1 or i == 0 and 1 in t[i] or i == n-1 and 1 in t[i]:\r\n\t\tprint(2)\r\n\t\texit()\r\nprint(4)", "'''\r\nCreated on Jan 28, 2015\r\n\r\n@author: mohamed265\r\n'''\r\nt = input().split()\r\nn = int(t[0])\r\nm = int(t[1])\r\nslon = 9999\r\nfor i in range(n):\r\n t = input().split()\r\n for j in range(m):\r\n if t[j] == '1':\r\n if i == 0 or i == n - 1 or j == 0 or j == m - 1:\r\n slon = 2\r\n else:\r\n slon = min(4, slon)\r\nprint(slon)", "alpha= input().split()\nn= int(alpha[0])\nm=int(alpha[1])\nisTwo=False\nfor i in range(n):\n y=input().split()\n for j in range(len(y)) :\n if int(y[j])==1:\n if i == 0 or i == (n-1):\n isTwo=True\n if j==0 or j == (m-1):\n isTwo=True\n\nif isTwo:\n print(2)\nelse:\n print(4)", "import sys,random,math\n'''\ndef gcd(x,y):\n if y==0:\n return x\n else:\n return gcd(y,x%y)\n\ndef pollard(n):\n i = 1\n x = random.randint(0,n-1)\n y = x\n k = 2\n while True:\n i = i+1\n x = (x*x - 1)%n\n d = gcd(y-x,n)\n if d!=1 and d!=n:\n print(d)\n if i == k:\n y = x\n k = 2*k\n\n'''\nn, m = map(int,input().split())\nuh = []\nfor i in range(n):\n a = list(map(int,input().split()))\n uh.append(a)\nif uh[0][0] == 1 or uh[0][m-1] == 1 or uh[n-1][0] == 1 or uh[n-1][m-1] == 1:\n print(1)\n sys.exit()\nelse:\n for i in range(n):\n if uh[i][0] == 1 or uh[i][m-1] == 1:\n print(2)\n sys.exit()\n for i in range(m):\n if uh[0][i] == 1 or uh[n-1][i] == 1:\n print(2)\n sys.exit()\nprint(4)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n,m=map(int,input().split())\r\nL=[list(map(int,input().split())) for i in range(n)]\r\nk=0\r\nfor i in range(1,n-1) :\r\n if L[i][0]==1 or L[i][-1]==1 :\r\n k+=1\r\nfor j in range(1,m-1) :\r\n if L[0][j]==1 or L[-1][j]==1 :\r\n k+=1\r\nif k>0 :\r\n print(2)\r\nelse :\r\n print(4)\r\n \r\n", "\nn,m = map(int,input().split())\n\nlist = []\nfor i in range(n):\n\n k = input()\n list.append(k.split())\n# print(list)\ntemp = 0\nfor i in range(n):\n\n for j in range(m):\n\n if list[i][j] == '1':\n if i == 0 or j == 0 or j == m-1 or i == n-1:\n temp = 1\n\nif temp == 1:\n print(2)\n\nelse:\n print(4)\n\n\n\n\n", "input_string = input().split()\r\nn = int(input_string[0])\r\nm = int(input_string[1])\r\n\r\nx = []\r\nfor i in range(0, n):\r\n a = input().split()\r\n x.append(a)\r\n\r\nans = 4\r\nfor i in range(0, n):\r\n if ans == 1:\r\n break\r\n for j in range(0, m):\r\n if(x[i][j] == '1'):\r\n if(i == 0 and j == 0 or (i == 0 and j == m-1) or (i == n-1 and j == 0) or ( i == n-1 and j == m-1)):\r\n ans = 1\r\n break\r\n if(i == 0 or i == n-1 or j == 0 or j == m-1):\r\n ans = 2\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nA = [input().split() for i in range(n)]\r\nT = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j] == '1' and (i == 0 or j == 0 or i == n - 1 or j == m - 1):\r\n T = True\r\nif T:\r\n print(2)\r\nelse:\r\n print(4)\r\n", "nm = list(map(int, input().strip().split()))\r\nn = nm[0]\r\nm = nm[1]\r\nval = False\r\ntable = []\r\nfor i in range(n):\r\n row = list(map(int, input().strip().split()))\r\n table.append(row)\r\nfor i in [0, n -1]:\r\n for j in range(m):\r\n if table[i][j] == 1:\r\n val = True\r\n break\r\nif not val:\r\n for j in [0, m - 1]:\r\n for i in range(1, n - 1):\r\n if table[i][j] == 1:\r\n val = True\r\n break\r\nif val:\r\n print(2)\r\nelse:\r\n print(4)", "n,m=map(int,input().split())\r\nlist1=[]\r\nfor i in range(n):\r\n ll=list(map(int,input().split()))\r\n list1.append(ll)\r\nf=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(list1[i][j]==1):\r\n if(i==0 or i==n-1 or j==0 or j==m-1):\r\n f=1\r\n \r\nif(f==0):\r\n print(4)\r\nelse:\r\n print(2)", "import sys\r\n\r\nn, m, *l = map(int, sys.stdin.read().split())\r\nn = int(n)\r\nm = int(m)\r\nr = 4\r\nl.reverse()\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n x = l.pop()\r\n if x == 1 and (i==0 or i==n-1 or j ==0 or j==m-1):\r\n r = 2\r\n\r\nprint(r)", "n, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a.append([int(i) for i in input().split()])\r\nok = 0\r\nok |= sum(a[0])\r\nok |= sum(a[-1])\r\nfor row in a:\r\n ok |= row[0] + row[-1]\r\nprint(2 if ok else 4)", "n, m = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append([])\r\n l[i] = list(map(int, input().split()))\r\ncheck = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == 1:\r\n if (i == 0 or i == n-1) or (j == 0 or j == m-1):\r\n check = 1\r\nif check == 0:\r\n print(4)\r\nelse:\r\n print(2)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n lx=[]\r\n ly=[]\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if(k[i][j]==1):\r\n lx.append(i)\r\n ly.append(j)\r\n \r\n f=0\r\n for i in range(len(lx)):\r\n if(lx[i]==0 or lx[i]==n-1):\r\n f=1\r\n for i in range(len(ly)):\r\n if(ly[i]==0 or ly[i]==m-1):\r\n f=1\r\n if(f==1):\r\n return 2\r\n else:\r\n return 4\r\n return\r\nn,m=map(int,input().split())\r\nk=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n k.append(a)\r\nprint(exe())", "a , b = map(int , input().split())\r\nr = lambda : list(map(int, input().split()))\r\narr = [r() for _ in range(a)]\r\n\r\nf = False\r\nfor i in range(a):\r\n for j in range(b):\r\n if arr[i][j] == 1 and (i==0 or i==a-1 or j==0 or j==b-1):\r\n f = True\r\n break\r\n\r\n\r\nprint(2 if f else 4)", "n, m = map(int,input().split())\na = []\nfor i in range(n) :\n a.append(input().split())\nans = 4\nfor i in range(n) :\n for j in range(m) :\n if a[i][j] != '1' :\n continue\n if i == 0 or i == n-1 or j == 0 or j == m-1 :\n ans = 2\nprint(ans)\n", "data = input().split()\n\nN, M = int(data[0]), int(data[1])\n\ntable = []\nfor i in range(N):\n table.append(input().split())\n\nanswer = 0\n\n## for first row\nif any(e == '1' for e in table[0]):\n answer = 2\n## for last row\nelif any(e == '1' for e in table[-1]):\n answer = 2\n## for first and last column\nelse:\n for i in range(N):\n if table[i][0] == '1':\n answer = 2\n elif table[i][-1] == '1':\n answer = 2\n\nif answer == 0:\n print('4')\nelse:\n print(answer)\n \n", "n, m = input().split()\r\na = [input().split() for _ in range(int(n))]\r\nb = list(zip(*a))\r\n\r\nprint((4, 2)[any([x.count('1') for x in [a[0], a[-1], b[0], b[-1]]])])\r\n", "n, m = [int(x) for x in input().split()]\narr = []\nfor i in range(n):\n line = [int(x) for x in input().split()]\n arr.append(line)\nfor i in range(n):\n if arr[i][0] == 1 or arr[i][m-1] == 1:\n print('2')\n quit()\nfor j in range(m):\n if arr[0][j] == 1 or arr[n-1][j] == 1:\n print('2')\n quit()\nprint('4')\n", "'''\r\n\r\n2nd python code\r\n\r\n'''\r\ndim = [int(x) for x in input().split()]\r\nflag = 0\r\n\r\na=[]\r\nfor i in range( dim[0] ) :\r\n a=[int(y) for y in input().split()]\r\n if i == 0 or i == dim[0]-1 :\r\n for j in range(1,dim[1]-1):\r\n if(a[j]==1):\r\n flag = 1;\r\n if a[0] == 1 or a[dim[1]-1] == 1 :\r\n flag =1\r\n \r\nif flag ==1 :\r\n print(2)\r\nelse:\r\n print(4)\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n l.append(x)\r\nx1=[]\r\ny1=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]==1):\r\n x1.append(i)\r\n y1.append(j)\r\nif(0 in x1 or 0 in y1 or m-1 in y1 or n-1 in x1):\r\n print(2)\r\nelse:\r\n print(4)", "def check_availability(element, collection: iter):\r\n return element in collection\r\n\r\n\r\nn, m = input().split()\r\nm = int(m)\r\nn = int(n)\r\nrow = []\r\ncol = []\r\nflag = 0\r\nfor i in range(n):\r\n row = []\r\n row = list(map(int, input().split()))\r\n if(row[0] == 1 or row[m-1] == 1):\r\n flag = 10\r\n col.append(row)\r\nif check_availability(1, col[0]) or check_availability(1, col[n-1]):\r\n flag = 10\r\nif flag == 10:\r\n ans = 2\r\nelse:\r\n ans = 4\r\n\r\nprint(ans)\r\n", "#!/usr/bin/env python3\r\n#! -*- coding: utf-8 -*-\r\n\r\n\r\ndef main():\r\n\tn, m = map(int, input().split())\r\n\ta = []\r\n\tfor _ in range(n):\r\n\t\ta.append([int(i) for i in input().split()])\r\n\tok = 0\r\n\tok |= sum(a[0])\r\n\tok |= sum(a[-1])\r\n\tfor row in a:\r\n\t\tok |= row[0] + row[-1]\r\n\tprint(2 if ok else 4)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n,m = list(map(int,input().split()))\r\nmat = []\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n mat.append(l)\r\ndx = [1,-1,0,0]\r\ndy = [0,0,1,-1]\r\nmid = 0\r\nside = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]==1:\r\n cnt = 0\r\n for k in range(4):\r\n nx = i+dx[k]\r\n ny = j+dy[k]\r\n if nx>=0 and nx<n and ny>=0 and ny<m:\r\n cnt+=1\r\n if cnt==4:\r\n mid = 1\r\n if cnt==3:\r\n side = 1\r\nif side==1:\r\n print(2)\r\nelse:\r\n print(4)", "ip = list(map(int,input().split()))\r\n[n,m] = ip\r\n\r\nlis = []\r\n\r\nfor i in range(n):\r\n ipLis = list(map(int,input().split()))\r\n lis.append(ipLis)\r\n\r\nif n == 1 or m == 1:\r\n print(2)\r\nelse:\r\n flag = 0\r\n for num in lis[0]:\r\n if num == 1:\r\n flag = 1\r\n break\r\n if flag == 1:\r\n print(2)\r\n else:\r\n for num in lis[n-1]:\r\n if num == 1:\r\n flag = 1\r\n break\r\n if flag == 1:\r\n print(2)\r\n else:\r\n for l in lis:\r\n if l[0] == 1 or l[m-1] == 1:\r\n flag = 1\r\n break\r\n if flag ==1 :\r\n print(2)\r\n else:\r\n print(4)", "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\nn,m=get_ints()\r\nans=4\r\nfor i in range(n):\r\n s=get_array()\r\n if((i==0 or i==n-1) and s.count(1)):\r\n ans=2\r\n if s[0]==1 or s[-1]==1:\r\n ans=2\r\n\r\nprint(ans)\r\n ", "n, m = map(int, input().split())\r\nborder = False\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n if (i == 0 or i == n - 1) and 1 in a or a[0] == 1 or a[-1] == 1:\r\n border = True\r\nif border:\r\n print(2)\r\nelse:\r\n print(4)", "# LUOGU_RID: 101541162\n(n, m), *a = [[*(map(int, s.split()))] for s in open(0)]\r\nprint((sum(a[0]) or sum(a[-1]) or any(x[0] + x[-1] for x in a)) and 2 or 4)\r\n", "n,m = map(int,input().split())\r\nl=[]\r\nk=0\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if i==0 or j==0 or i==n-1 or j==m-1:\r\n if l[i][j]==1:\r\n k=1\r\n break\r\nif k:\r\n print('2')\r\nelse:\r\n print('4')", "n, m = map(int, input().split())\r\na = []\r\nnumber_of_operations = 0\r\n\r\nfor _ in range(n):\r\n row = input().split()\r\n a.append(row)\r\n if row[0] == '1' or row[-1] == '1':\r\n number_of_operations = 2\r\n\r\nif '1' in a[0] or '1' in a[-1]:\r\n number_of_operations = 2\r\n\r\nprint(4 if not(number_of_operations) else 2)\r\n", "n,m = map(int,input().split())\r\n\r\nfor j in range(n):\r\n arr = list(map(int,input().split()))\r\n if j!=0 and j!=n-1:\r\n if arr[0] or arr[-1]:\r\n print(2)\r\n break\r\n \r\n else:\r\n arr.pop()\r\n arr = arr[1:]\r\n \r\n if any(arr) :\r\n print(2)\r\n break\r\n\r\nelse:\r\n print(4)\r\n\r\n ", "inp = input().split()\n\nn, m = [int(i) for i in inp]\n\nmat = []\n\nfor i in range(n):\n inp = input().split()\n mat.append(inp)\n\nfor i in range(n):\n if mat[i][0] == '1' or mat[i][m-1] == '1':\n #print (i, n, mat[i][0], mat[i][n-1])\n print (2)\n exit()\n\nfor i in range(m):\n if mat[0][i] == '1' or mat[n-1][i] == '1':\n #print (i, n, mat[i][0], mat[i][n-1])\n print (2)\n exit()\n\nprint (4)\n", "n, m = list(map(int, input().split()))\r\ntable = []\r\n\r\nfor _ in range(n):\r\n table.append(list(map(int, input().split())))\r\n shortcut = False\r\n\r\nif 1 in table[0] or 1 in table[n-1]:\r\n shortcut = True \r\nelse:\r\n for row in table[1:n-1]:\r\n if row[0] or row[m-1]:\r\n shortcut = True\r\n break\r\nif shortcut:\r\n print(2)\r\nelse:\r\n print(4)", "def Horizontal(R,n,m):\r\n for i in range (0,m): \r\n if (R[0][i]==1 or R[n-1][i]==1):\r\n return True\r\n return False\r\n\r\ndef Vertical(R,n,m):\r\n for i in range (0,n):\r\n if ((R[i][0]==1) or (R[i][m-1]==1)):\r\n return True\r\n return False\r\n\r\ndef Respuesta(R,n,m):\r\n if (R[0][0]== 1 or R[n-1][0]== 1 or R[0][m-1]== 1 or R[n-1][m-1]== 1):\r\n return 1\r\n elif(Horizontal(R,n,m) or Vertical(R,n,m)):\r\n return 2\r\n else:\r\n return 4\r\n\r\nL = input().split()\r\nn = int(L[0])\r\nm = int(L[1])\r\nR = []\r\n\r\nfor i in range (0,n):\r\n A = input().split()\r\n A = list(map(int, A))\r\n R.append(A)\r\n \r\nprint(Respuesta(R,n,m))\r\n", "# Problem Link: https://codeforces.com/problemset/problem/359/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\ndef countCells(colored, cell, corner):\r\n count = 0\r\n r_min = min(cell[0], corner[0])\r\n r_max = max(cell[0], corner[0])\r\n c_min = min(cell[1], corner[1])\r\n c_max = max(cell[1], corner[1])\r\n\r\n for i in range(r_min, r_max + 1):\r\n for j in range(c_min, c_max + 1):\r\n if colored[i][j] == False:\r\n count = count + 1\r\n \r\n return count\r\n\r\ndef color(colored, from_to):\r\n cell = from_to[0]\r\n corner = from_to[1]\r\n\r\n r_min = min(cell[0], corner[0])\r\n r_max = max(cell[0], corner[0])\r\n c_min = min(cell[1], corner[1])\r\n c_max = max(cell[1], corner[1])\r\n\r\n for i in range(r_min, r_max + 1):\r\n for j in range(c_min, c_max + 1):\r\n colored[i][j] = True\r\n\r\n return colored\r\n\r\ndef done(colored):\r\n for row in colored:\r\n for cell in row:\r\n if not cell:\r\n return False\r\n return True\r\n\r\n\r\nn, m = map(int, input().split())\r\ntable = [list(map(int, input().split())) for i in range(n)]\r\n\r\ngood_cells = []\r\ncolored = [[False for i in range(m)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if table[i][j] == 1:\r\n good_cells.append([i, j])\r\n\r\noperations = 0\r\nwhile not done(colored): \r\n max_count = 0\r\n to_color = []\r\n for cell in good_cells:\r\n lu_count = countCells(colored, cell, [0, 0])\r\n ru_count = countCells(colored, cell, [0, m-1])\r\n lb_count = countCells(colored, cell, [n-1, 0])\r\n rb_count = countCells(colored, cell, [n-1, m-1])\r\n \r\n if (lu_count > max_count):\r\n max_count = lu_count\r\n to_color = [cell, [0, 0]]\r\n\r\n if (ru_count > max_count):\r\n max_count = ru_count\r\n to_color = [cell, [0, m-1]]\r\n\r\n if (lb_count > max_count):\r\n max_count = lb_count\r\n to_color = [cell, [n-1, 0]]\r\n \r\n if (rb_count > max_count):\r\n max_count = rb_count\r\n to_color = [cell, [n-1, m-1]]\r\n\r\n colored = color(colored, to_color) \r\n operations += 1\r\n\r\n\r\nprint(operations)", "n, m = map(int, input().split())\r\narr = [input().split() for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '1':\r\n if i == 0 or i + 1 == n or j == 0 or j + 1 == m:\r\n print(2)\r\n exit()\r\nprint(4)\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nx=0\r\nfor i in range(n):\r\n l=[int(i) for i in input().split()]\r\n arr.append(l)\r\nfor i in range(n):\r\n for j in range(m):\r\n if i==0 and arr[0][j]==1:\r\n x=2\r\n break\r\n elif j==0 and arr[i][j]==1:\r\n x=2\r\n break\r\n elif i==n-1 and arr[n-1][j]==1:\r\n x=2\r\n break\r\n elif j==m-1 and arr[i][m-1]==1:\r\n x=2\r\n break \r\nif x==2:\r\n print(x)\r\nelse:\r\n print(4) ", "n, m = map(int, input().split())\r\n\r\nflag = False\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nif sum(daf) > 0:\r\n flag = True\r\n\r\nif n >= 2:\r\n for i in range(n - 2):\r\n daf = input()\r\n if daf[0] == '1' or daf[-1] == '1':\r\n flag = True\r\n \r\n daf = list(map(int, input().split()))\r\n\r\n if sum(daf) > 0:\r\n flag = True\r\n\r\nif flag:\r\n print(2)\r\nelse:\r\n print(4)\r\n", "n,m = list(map(int,input().split()))\r\nfor i in range(n):\r\n\ta = list(map(int,input().split()))\r\n\tif (i == 0 or i == n-1) and 1 in a:\r\n\t\tprint(2)\r\n\t\texit()\r\n\tif a[0] == 1 or a[-1] == 1:\r\n\t\tprint(2)\r\n\t\texit()\r\nprint(4)", "n,m = [int(i) for i in input().split()]\r\nA = []\r\nfor i in range(n):\r\n A.append([int(i) for i in input().split()])\r\nn-=1\r\nm-=1\r\nans = 4\r\nfor i in range(1, n):\r\n if A[i][0] == 1 and A[i-1][m] == 1 or A[i][m] == 1 or A[i+1][m] == 1:\r\n ans = min(ans,2)\r\n break\r\n elif A[i][m] == 1 and A[i-1][0] == 1 or A[i][0] == 1 or A[i+1][0] == 1:\r\n ans = min(ans,2)\r\n break\r\nfor i in range(1, m):\r\n if A[0][i] == 1 and A[n][i-1] == 1 or A[n][i] == 1 or A[n][i+1] == 1:\r\n ans = min(ans,2)\r\n break\r\n elif A[n][i] == 1 and A[0][i-1] == 1 or A[0][i] == 1 or A[0][i+1] == 1:\r\n ans = min(ans,2)\r\n break\r\nfor i in range(1, n):\r\n if A[i][0] == 1 or A[i][m] == 1:\r\n for i in range(1, m):\r\n if A[0][i] == 1 or A[n][i] == 1:\r\n ans = min(ans,3)\r\n break\r\nif ans == 4:\r\n for i in range(n):\r\n for j in range(m):\r\n if A[i][j] == 1:\r\n ans = 4\r\nprint(ans)", "n, m = map(int, input().split())\r\ntable = [input().split(' ') for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if table[i][j] == '1' and (i==0 or i==n-1 or j==0 or j==m-1):\r\n print(2)\r\n exit()\r\n\r\nprint(4)\r\n", "n,m=map(int,input().split())\r\nl=[list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n if (i==0 or i==n-1) and sum(l[i]): print(2); break\r\n elif l[i][0]==1 or l[i][-1]==1: print(2); break\r\nelse: print(4)\r\n", "def solve(a):\n\tcheck2 = [x + y for x, y in zip(a[0], a[-1])]\n\tif any(check2):\n\t\treturn 2\n\tcheckn = [sum(l) for l in zip(*a)]\n\tif any(check2) and any(checkn):\n\t\treturn 3\n\treturn 4\n\nn, m = [int(x) for x in input().split()]\na = []\nfor i in range(n):\n\ta.append([int(x) for x in input().split()])\nprint(min(solve(a), solve(list(zip(*a)))))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nS = [list(map(int, input().split())) for i in range(n)]\r\nflag = False\r\nfor i in [0, n - 1]:\r\n for j in range(m):\r\n if S[i][j] == 1:\r\n print(2)\r\n exit()\r\n\r\nfor j in [0, m - 1]:\r\n for i in range(n):\r\n if S[i][j] == 1:\r\n print(2)\r\n exit()\r\nprint(4)\r\n", "n,m=map(int,input().split())\nL=[]\nC=[]\nfor i in range(n):\n L.append(list(map(int,input().split())))\ncase=False\nfor i in range(n):\n if(L[i][0]==1 or L[i][m-1]==1):\n case=True\nfor i in range(m):\n if(L[0][i]==1 or L[n-1][i]==1):\n case=True\nif(case):\n print(2)\nelse:\n print(4)\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v, w):\r\n return (u * z + v) * z + w\r\n\r\ndef update1(x, c):\r\n i = x ^ l1\r\n tree1[i], color1[i] = x, c\r\n i >>= 1\r\n for _ in range(w):\r\n j, k = i << 1, i << 1 ^ 1\r\n if color1[j] ^ c:\r\n tree1[i] = tree1[k]\r\n elif color1[k] ^ c:\r\n tree1[i] = tree1[j]\r\n else:\r\n tree1[i] = min(tree1[j], tree1[k])\r\n color1[i] = c\r\n i >>= 1\r\n return\r\n\r\ndef update2(x, c):\r\n i = x ^ l1\r\n tree2[i], color2[i] = x, c\r\n i >>= 1\r\n for _ in range(w):\r\n j, k = i << 1, i << 1 ^ 1\r\n if color2[j] ^ c:\r\n tree2[i] = tree2[k]\r\n elif color2[k] ^ c:\r\n tree2[i] = tree2[j]\r\n else:\r\n tree2[i] = max(tree2[j], tree2[k])\r\n color2[i] = c\r\n i >>= 1\r\n return\r\n\r\ndef xor_max1(x, r, c):\r\n i = 1\r\n if color1[i] ^ c or not tree1[i] < r:\r\n return 0\r\n for _ in range(w):\r\n j, k = i << 1, i << 1 ^ 1\r\n if color1[j] ^ c:\r\n f0 = 1\r\n elif color1[k] ^ c:\r\n f0 = 0\r\n elif tree1[k] < r and x ^ x0[tree1[j]] < x ^ x0[tree1[k]]:\r\n f0 = 1\r\n else:\r\n f0 = 0\r\n i = i << 1 ^ f0\r\n return x ^ x0[i ^ l1]\r\n\r\ndef xor_max2(x, l, c):\r\n i = 1\r\n if color2[i] ^ c or not tree2[i] > l:\r\n return 0\r\n for _ in range(w):\r\n j, k = i << 1, i << 1 ^ 1\r\n if color2[j] ^ c:\r\n f0 = 1\r\n elif color2[k] ^ c:\r\n f0 = 0\r\n elif tree2[j] > l and x ^ x0[tree2[k]] < x ^ x0[tree2[j]]:\r\n f0 = 0\r\n else:\r\n f0 = 1\r\n i = i << 1 ^ f0\r\n return x ^ x0[i ^ l1]\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nx0 = [0] * (max(a) + 5)\r\nfor i in range(1, len(x0)):\r\n x0[i] = x0[i - 1] ^ i\r\nl0, r0 = [0] * m, [0] * m\r\nm1 = 432\r\nm2 = n // m1 + 3\r\nq = []\r\ns0 = [0] * (m2 + 1)\r\nans = [0] * m\r\nz = max(m, n) + 5\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n l, r = l - 1, r - 1\r\n if l // m1 == r // m1:\r\n ans0 = 0\r\n for j in range(l, r + 1):\r\n u = a[j]\r\n for k in range(j, r + 1):\r\n v = a[k]\r\n ans1 = x0[u - 1] ^ x0[v] if u <= v else x0[u] ^ x0[v - 1]\r\n ans0 = max(ans0, ans1)\r\n ans[i] = ans0\r\n continue\r\n l0[i], r0[i] = l, r\r\n x = l // m1\r\n q.append(f(x, r, i))\r\n s0[x + 1] += 1\r\nma = [0] * n\r\nfor i in range(n):\r\n mai, u = 0, a[i]\r\n for j in range(i, min(i // m1 * m1 + m1, n)):\r\n v = a[j]\r\n maj = x0[u - 1] ^ x0[v] if u <= v else x0[u] ^ x0[v - 1]\r\n mai = max(mai, maj)\r\n ma[i] = mai\r\nfor i in range(n - 2, -1, -1):\r\n if (i + 1) % m1:\r\n ma[i] = max(ma[i], ma[i + 1])\r\nfor i in range(1, m2 + 1):\r\n s0[i] += s0[i - 1]\r\nw = (max(a) + 1).bit_length()\r\nl1 = pow(2, w)\r\nl2 = 2 * l1\r\ninf = pow(10, 9) + 1\r\ntree1, color1 = [inf] * l2, [-1] * l2\r\ntree2, color2 = [-inf] * l2, [-1] * l2\r\nq.sort()\r\nfor c in range(m2):\r\n if s0[c] == s0[c + 1]:\r\n continue\r\n r = (c + 1) * m1\r\n c10, c11, c20, c21 = inf, inf, -inf, -inf\r\n ans0 = 0\r\n for i in range(s0[c], s0[c + 1]):\r\n j = q[i] % z\r\n ll, rr = l0[j], r0[j]\r\n while r <= rr:\r\n ar = a[r]\r\n x1, x2 = x0[ar], x0[ar - 1]\r\n if x1 > 1:\r\n update2(ar, c)\r\n elif x1 == 0:\r\n c20 = max(c20, ar)\r\n elif x1 == 1:\r\n c21 = max(c21, ar)\r\n if x2 > 1:\r\n update1(ar - 1, c)\r\n elif x2 == 0:\r\n c10 = min(c10, ar - 1)\r\n elif x2 == 1:\r\n c11 = min(c11, ar - 1)\r\n ans0 = max(ans0, xor_max1(x1, ar, c), xor_max2(x2, ar - 1, c))\r\n if c10 < ar:\r\n ans0 = max(ans0, x1)\r\n if c11 < ar:\r\n ans0 = max(ans0, x1 ^ 1)\r\n if ar - 1 < c20:\r\n ans0 = max(ans0, x2)\r\n if ar - 1 < c21:\r\n ans0 = max(ans0, x2 ^ 1)\r\n r += 1\r\n ans1 = max(ma[ll], ans0)\r\n for l in range(ll, (c + 1) * m1):\r\n al = a[l]\r\n x1, x2 = x0[al], x0[al - 1]\r\n ans1 = max(ans1, xor_max1(x1, al, c), xor_max2(x2, al - 1, c))\r\n if c10 < al:\r\n ans1 = max(ans1, x1)\r\n if c11 < al:\r\n ans1 = max(ans1, x1 ^ 1)\r\n if al - 1 < c20:\r\n ans1 = max(ans1, x2)\r\n if al - 1 < c21:\r\n ans1 = max(ans1, x2 ^ 1)\r\n ans[j] = ans1\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "for _ in range(int(input())):\r\n print(max(0, int(input()) - 2))\r\n", "for i in range(int(input())):\r\n x = int(input())\r\n print(max(0,x-2))", "import sys\r\ninputs,first = sys.stdin.readlines(),True\r\nfor i in inputs:\r\n\tif first:\r\n\t\tfirst = False\r\n\telse:\r\n\t\tprint(max(0,int(i)-2))", "t = int(input())\r\nwhile (t > 0):\r\n t -= 1\r\n n = int(input()) - 2\r\n print(n if n > 0 else 0)", "t=int(input())\r\nfor test in range(t):\r\n n=int(input())\r\n print(max(0,n-2))", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n print(max(0,(n-2)))", "a=int(input())\ni=1\nwhile i<=a:\n b=int(input())\n print(max(0,b-2))\n i=i+1", "t=int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n print(n-2 if n>=2 else 0)", "# LUOGU_RID: 111050302\nfrom sys import stdin \ninput = stdin.readline \n\nT = int(input()) \nfor _ in range(T) : \n n = int(input()) \n print(0 if n <= 2 else n - 2)", "t = int(input())\r\n\r\na = []\r\nfor i in range(0,t):\r\n x = int(input())\r\n if x>=2:\r\n a.append(x-2)\r\n else:\r\n a.append(0)\r\n\r\nfor i in range(0,t):\r\n print(a[i])\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n print(max(0, int(input())-2))\r\n", "# LUOGU_RID: 91028529\nt=int(input())\nfor i in range(t):\n n=int(input())\n print(0 if n==1 else n-2)", "t=int(input())\n\nfor i in range(t):\n \n n = int(input())\n print(max(n-2,0))\n\n \t\t \t \t \t \t \t\t \t\t \t\t\t", "for i in range(0,int(input())):\n x=int(input())\n if(x>1):\n print(x-2)\n else:\n print(0)", "for _ in range(int(input())):\r\n n = int(input())\r\n print(n - 2 if n-2 >= 0 else 0)", "t = int(input())\r\nwhile t > 0:\r\n a = int(input())\r\n if a < 2:\r\n print(0)\r\n else:\r\n print(a - 2)\r\n t = t - 1", "t = int(input())\ncount=0\n\nwhile count != t:\n n = int(input())\n if n >= 3:\n print(n-2)\n else: \n print(0)\n\n count+=1\n \t \t \t\t \t\t \t \t\t \t\t \t\t", "t = int(input())\r\nwhile t :\r\n t -= 1\r\n n = int(input())\r\n print(max(0,n-2))", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\ndef fg():\r\n return int(input())\r\ndef fgh():\r\n return [int(xx) for xx in input().split()]\r\nM = 10 ** 9 + 7\r\nfor _____ in range(fg()):\r\n n = fg()\r\n print(max(0, n - 2))", "t = int(input())\nwhile t > 0:\n a = int(input())\n if a < 2: print(0)\n else: print(a - 2)\n t = t - 1", "def party(lst):\r\n a = list()\r\n for i in range(len(lst)):\r\n if lst[i] < 3:\r\n a.append(0)\r\n else:\r\n a.append(lst[i] - 2)\r\n return a\r\n\r\n\r\nt = int(input())\r\nc = list()\r\nfor i in range(t):\r\n numb = int(input())\r\n c.append(numb)\r\nprint(*party(c), sep='\\n')\r\n", "for _ in range(int(input())):\r\n n = int(input())\r\n print(n-2 if n>=2 else 0)", "import sys\r\n\r\nt = int(sys.stdin.readline())\r\n\r\nfor _ in range(t):\r\n print(str(max(0, int(sys.stdin.readline()) - 2)))\r\n", "t = int(input())\r\nfor i in range(t):\r\n inp = int(input())\r\n if inp == 1:\r\n print(0)\r\n else:\r\n print(inp-2)", "t=int(input())\nfor i in range(t):\n n=int(input())\n if (n<2): print(0)\n else: print(n-2)", "num_tests = int(input())\nresults = num_tests * [None]\n\nfor i in range(num_tests):\n n = int(input())\n results[i] = max(0, n-2)\n\nprint('\\n'.join(map(str, results)))\n", "T = int(input())\n\nfor i in range(T):\n a = int(input())\n print(max(0,a-2))", "# LUOGU_RID: 131740111\nt = int(input())\nfor i in range(t):\n a = int(input())\n if a < 2:\n print(0)\n else:\n print(a-2)", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n if n>2:\r\n sys.stdout.write(str(n-2)+'\\n')\r\n else:\r\n sys.stdout.write('0\\n')", "for _ in range(int(input())):print(max(0,int(input())-2))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfor _ in range(int(input())):\r\n\tN = int(input())\r\n\tprint(max(0,N-2))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nt=int(input())\r\nfor tests in range(t):\r\n n=int(input())\r\n print(max(0,n-2))\r\n", "import sys\r\nimport math\r\n\r\n\r\ndef ii(): return int(input()) # input int 1\r\n\r\n\r\ndef il(): return input().split(' ') # input list\r\n\r\n\r\n# input list of int: [1, 2, 3, ...]\r\ndef ili(): return [int(i) for i in input().split(' ')]\r\n\r\n\r\n# input list of int splited: (a, b, c, ...)\r\ndef ilis(): return (int(i) for i in input().split(' '))\r\n\r\n\r\ndef ip():\r\n return input()\r\n\r\n\r\ndef op(l):\r\n print(l)\r\n sys.stdout.flush()\r\n\r\n\r\ndef gcd(a, b): return a if b == 0 else gcd(b, a % b)\r\n\r\n\r\ndef extgcd(a, b, x=0, y=0):\r\n if b == 0:\r\n return (a, 1, 0)\r\n d, m, n = extgcd(b, a % b, x, y)\r\n return (d, n, m-(a//b)*n)\r\n\r\n\r\ndef main():\r\n T = ii()\r\n for t in range(T):\r\n n = ii()\r\n if n <= 2:\r\n op(0)\r\n else:\r\n op(n-2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "print('\\n'.join(str(max(int(input()) - 2, 0)) for i in range(int(input()))))", "import sys\r\nk = 0\r\nfor line in sys.stdin:\r\n if k == 0:\r\n T = int(line)\r\n k += 1\r\n else:\r\n n = int(line)\r\n if n > 1:\r\n print(n - 2)\r\n else:\r\n print(0)\r\n", "for i in range(int(input())):\r\n n = int(input())\r\n print(n - 2 if n > 2 else 0)", "from sys import *\r\ninput=stdin.buffer.readline\r\nfor u in range(int(input())):\r\n n=int(input())\r\n print(max(0,n-2))", "t = int(input())\r\nwhile(t>0):\r\n t-=1\r\n n= int(input())\r\n print(max(0,n-2))", "t = int(input())\r\n \r\ncount = 0\r\nwhile count < t:\r\n n = int(input())\r\n if n <= 2:\r\n print(0)\r\n else:\r\n print(n - 2)\r\n count += 1", "test_case = int(input());\r\nwhile test_case > 0:\r\n people = int(input());\r\n if people>2:\r\n people=people-2;\r\n else:\r\n people=0;\r\n print(people);\r\n test_case -= 1", "for _ in range(int(input())): print(max(int(input())-2,0))", "def main():\r\n z = int(input())\r\n while z > 0:\r\n n = int(input())\r\n print(n - 2 if n > 2 else 0)\r\n z -= 1\r\n\r\nif __name__ == \"__main__\":\r\n main()", "ou = []\nfor _ in range(int(input())):\n n = int(input())\n ou.append(max(0, n-2))\nfor i in ou:\n print(i)\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 * m + v\r\n\r\ndef bfs(x1, y1, x2, y2):\r\n q1, q2 = [], []\r\n q1.append((x1, y1))\r\n dist = [inf] * l\r\n dist[f(x1, y1)] = 0\r\n d = 0\r\n while q1:\r\n for i, j in q1:\r\n for di, dj in v:\r\n ni, nj = i, j\r\n for _ in range(k):\r\n ni += di\r\n nj += dj\r\n u = f(ni, nj)\r\n if not 0 <= ni < n or not 0 <= nj < m or s[u] & 1:\r\n break\r\n if dist[u] < d + 1:\r\n break\r\n elif dist[u] ^ (d + 1):\r\n dist[u] = d + 1\r\n q2.append((ni, nj))\r\n q1, q2 = q2, []\r\n d += 1\r\n return dist[f(x2, y2)]\r\n\r\nn, m, k = map(int, input().split())\r\ns = []\r\nfor _ in range(n):\r\n s0 = list(input().rstrip())\r\n for i in s0:\r\n s.append(i)\r\nx1, y1, x2, y2 = map(int, input().split())\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nl = n * m\r\ninf = pow(10, 9) + 1\r\nans = bfs(x1 - 1, y1 - 1, x2 - 1, y2 - 1)\r\nans = (ans + 1) % (inf + 1) - 1\r\nprint(ans)", "import sys\nimport io, os\ninput = sys.stdin.readline\n\nINF = 10**18\n\ndef main():\n h, w, k = map(int, input().split())\n C = [input().rstrip() for i in range(h)]\n x1, y1, x2, y2 = map(int, input().split())\n x1, y1, x2, y2 = x1-1, y1-1, x2-1, y2-1\n #print(C)\n from collections import deque\n q = deque()\n q.append((x1, y1))\n dist = [[INF]*w for i in range(h)]\n dist[x1][y1] = 0\n while q:\n x, y = q.popleft()\n if x == x2 and y == y2:\n print(dist[x][y])\n exit()\n for dx, dy in (0, 1), (1, 0), (0, -1), (-1, 0):\n for i in range(1, k+1):\n nx, ny = x+dx*i, y+dy*i\n if nx < 0 or h <= nx:\n break\n if ny < 0 or w <= ny:\n break\n if C[nx][ny] == '#':\n break\n if dist[nx][ny] <= dist[x][y]:\n break\n if dist[nx][ny] == dist[x][y]+1:\n continue\n dist[nx][ny] = dist[x][y]+1\n q.append((nx, ny))\n #print(dist)\n print(-1)\n\nif __name__ == '__main__':\n main()\n", "#python\nn,m,k=map(int,input().split())\ngrid=[list(input())for _ in range(n)]\ndist=[[10**9]*m for _ in range(n)]\nx1,y1,x2,y2=map(int,input().split())\nx1,y1,x2,y2=x1-1,y1-1,x2-1,y2-1\ndr=[[-1,0],[1,0],[0,-1],[0,1]]\ncur=0\nq=[]\nq.append((x1,y1))\ndist[x1][y1]=0\nwhile cur<len(q):\n cx,cy=q[cur]\n if (cx,cy)==(x2,y2):break\n for dx,dy in dr:\n for i in range(1,k+1):\n nx,ny=dx*i+cx,dy*i+cy\n if not (0<=nx<n and 0<=ny<m and grid[nx][ny]=='.' and dist[nx][ny]>dist[cx][cy]):\n break\n if dist[nx][ny]>dist[cx][cy]+1:\n dist[nx][ny]=dist[cx][cy]+1\n q.append((nx,ny))\n cur+=1\nif dist[x2][y2]==10**9:print(-1)\nelse:print(dist[x2][y2])\n", "n,m,k=map(int,input().split())\r\ncell=[[] for j in range(n+1)]\r\nfor i in range(1,n+1):\r\n cell[i]=[0]+list(input())\r\nx1,y1,x2,y2=map(int,input().split())\r\ndis=[[10**6]*(m+1) for i in range(n+1)]\r\nq=[]\r\nnum=0\r\nmove=[[-1,0],[1,0],[0,-1],[0,1]]\r\nq.append((x1,y1))\r\ndis[x1][y1]=0\r\nwhile num<len(q):\r\n x,y=q[num]\r\n if (x,y)==(x2,y2):\r\n break\r\n for mx,my in move:\r\n for i in range(1,k+1):\r\n nx,ny=mx*i+x,my*i+y\r\n if not (1<=nx<=n and 1<=ny<=m and cell[nx][ny]==\".\" and dis[nx][ny]>dis[x][y]):\r\n break\r\n if dis[nx][ny]>dis[x][y]+1:\r\n dis[nx][ny]=dis[x][y]+1\r\n q.append((nx,ny))\r\n num+=1\r\nif dis[x2][y2]==10**6:\r\n print(-1)\r\nelse:\r\n print(dis[x2][y2])\r\n", "m, n, k = list(map(int, input().split()))\r\ngrid = []\r\nfor _ in range(m):\r\n grid.append(input())\r\nx1, y1, x2, y2 = list(map(int, input().split()))\r\nx1 -= 1\r\ny1 -= 1\r\nx2 -= 1\r\ny2 -= 1\r\ndir = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\nvisit = [False]*(4*m*n)\r\nfrom collections import deque\r\nq = deque([(x1, y1)])\r\nfor i in range(4):\r\n visit[i*m*n + x1*n + y1] = True\r\ncnt = 0\r\nwhile q:\r\n for _ in range(len(q)):\r\n x, y = q.popleft()\r\n if x == x2 and y == y2:\r\n print(cnt)\r\n exit()\r\n for i in range(4):\r\n for j in range(1, k + 1):\r\n dx = j * dir[i][0] + x\r\n dy = j * dir[i][1] + y\r\n temp = i*m*n + dx*n + dy\r\n if 0 <= dx < m and dy >= 0 and dy < n and grid[dx][dy] != \"#\" and not visit[temp]:\r\n visit[temp] = True\r\n q.append((dx, dy))\r\n else:\r\n break\r\n cnt += 1\r\nprint(-1)", "# Problem: 方格迷宫\r\n# Contest: AcWing\r\n# URL: https://www.acwing.com/problem/content/4946/\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nfrom collections import deque\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\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\nDIRS = [(0, 1), (1, 0), (-1, 0), (0, -1)]\r\n\r\n\r\n# 6177 ms\r\ndef solve():\r\n n, m, k = RI()\r\n g = []\r\n for _ in range(n):\r\n s, = RS()\r\n g.append(s)\r\n x1, y1, x2, y2 = RI()\r\n if x1 == x2 and y1 == y2:\r\n return print(0)\r\n x1 -= 1\r\n x2 -= 1\r\n y1 -= 1\r\n y2 -= 1\r\n dis = [[[inf] * m for _ in range(n)] for _ in range(4)]\r\n dis[0][x1][y1] = 0\r\n dis[1][x1][y1] = 0\r\n dis[2][x1][y1] = 0\r\n dis[3][x1][y1] = 0\r\n q = deque([(0, x1, y1), (1, x1, y1), (2, x1, y1), (3, x1, y1)])\r\n while q:\r\n dr, x, y = q.popleft()\r\n d = dis[dr][x][y]\r\n d += 1\r\n for i, (dx, dy) in enumerate(DIRS):\r\n for s in range(1, k + 1):\r\n a, b = x + dx * s, y + dy * s\r\n if 0 <= a < n and 0 <= b < m and g[a][b] == '.':\r\n if a == x2 and b == y2:\r\n return print(d)\r\n if d < dis[i][a][b]:\r\n dis[i][a][b] = d\r\n q.append((i, a, b))\r\n else:\r\n break\r\n else:\r\n break\r\n\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n" ]

[ "from sys import stdin,stdout\r\n# from os import _exit\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\ns = input().strip()\r\n\r\nfor i in range(len(s)):\r\n k = s[i]\r\n a = ord(k)\r\n print(270*\".\"+\"\\n\")\r\n print(\"...\")\r\n print(a*\"X\"+(267-a)*\".\"+\"\\nX.X\")\r\n print(a*\"X\"+\"X.\"+(265-a)*\"X\"+\"\\n\")\r\n print(270*\".\"+\"\\nX\")\r\n print(268*\".\"+\"X\\nX\")\r\n print(269*\".\"+\"\\n\")\r\n print(270*\".\"+\"\\n\")\r\n print(a*\"X.\")\r\n print((270-2*a)*\".\"+\"\\n\")\r\n", "# LUOGU_RID: 101739068\nans = ''\r\nfor i in map(ord, input()):\r\n ans += '..\\n.X\\n' * (256 - i) + '.X\\n' + '..\\n.X\\n' * i\r\nprint(ans)\r\n", "for i in map(ord, input()) : print(\"..\\n.X\\n\" * (256 - i) + \".X\\n\" + \"..\\n.X\\n\" * i, end = \"\")", "s = input()\r\n\r\nfor c in s:\r\n\tfor i in range(256 - ord(c)):\r\n\t\tprint(\"...\\n.X.\")\r\n\tprint(\".X.\")\r\n\tfor i in range(ord(c)):\r\n\t\tprint(\"...\\n.X.\")", "for i in map(ord,input()):print(\"..\\n.X\\n\"*(256-i)+\".X\\n\"+\"..\\n.X\\n\"*i,end=\"\")" ]

[ "n,k=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nx=0\r\nxx=100000001\r\nindex=0\r\nfor i in range(k):\r\n s=0\r\n for j in range(x,n,k):\r\n s+=list1[j]\r\n if(s<xx):\r\n xx=s\r\n index=x\r\n x+=1\r\nprint(index+1)", "n, k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 10 ** 9\r\nsol = -1\r\nfor i in range(k):\r\n x = n // k;\r\n y = i;\r\n tmp = 0\r\n while(x):\r\n tmp += a[y]\r\n y += k\r\n y %= n\r\n x -= 1\r\n if tmp < ans:\r\n ans = tmp\r\n sol = i + 1\r\n \r\n \r\nprint(sol);", "def todo_list(end, k, arr):\n\tcount = 0\n\tstart = 0\n\tresult = 100000*1000000\n\twhile count != k:\n\t\tb = 0\n\t\tfor x in range(start, end, k):\n\t\t\tb += arr[x]\n\t\tif b < result:\n\t\t\tresult = b\n\t\t\tans = start+1\n\t\tstart += 1\n\t\tcount += 1\n\n\treturn ans\n\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\nprint(todo_list(n, k, arr))", "def main():\n n, k = map(int, input().split())\n aa = list(map(int, input().split()))\n res = [sum(aa[i::k]) for i in range(k)]\n print(min(range(k), key=res.__getitem__) + 1)\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nind = [x for x in range(0,n,k)]\r\nm=1e8\r\nmi=0\r\nfor i in range(0,k):\r\n x=sum(a[i+j] for j in ind)\r\n if x<m:\r\n m=x\r\n mi=i \r\nprint(mi+1)", "_, k = map(int, input().split())\nv, s = map(int, input().split()), [0] * k\n\nfor (i, x) in enumerate(v):\n s[i % k] += x\n\nprint(min([(x, i) for i, x in enumerate(s)])[1] + 1)\n", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ntemp=l[:]\r\nl=l+l \r\nmini=10**9 \r\ndef check(arr): \r\n sm=0 \r\n sm=sum([arr[i] for i in range(0,n,k)])\r\n return sm \r\nfor i in range(k,2*n):\r\n l[i]+=l[i-k]\r\n#print(l)\r\nfor i in range(n-k,2*n):\r\n if l[i]<mini:\r\n #print(mini)\r\n # print(l[i])\r\n mini=l[i]\r\n # print(l[i],i)\r\n ans=i-(n-k)+1 \r\nprint(ans)", "def start():\r\n n,k = [int(i) for i in input().split()]\r\n l = [int(i) for i in input().split()]\r\n ssum = []\r\n for i in range(k):\r\n xsum = 0\r\n for j in range(i,n,k):\r\n xsum += l[j]\r\n ssum.append(xsum)\r\n print(ssum.index(min(ssum))+1)\r\n\r\n\r\n\r\ntc=1\r\n# tc=int(input())\r\nwhile tc:\r\n start()\r\n tc=tc-1", "from functools import reduce\r\n\r\nn, k = list(map(int, input().split(' ')))\r\nnums = list(map(int, input().split(' ')))\r\n\r\nres = []\r\nfor i in range(k):\r\n sum = 0\r\n for j in range(int(n / k)):\r\n sum += nums[i + j * k]\r\n res.append(sum)\r\n\r\nprint(res.index(min(res)) + 1) \r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmn=10000000000\r\nidx=0\r\nfor i in range(k):\r\n x=0\r\n for j in range(i,n,k): \r\n x+=l[j]\r\n if x<mn:idx=i;mn=x\r\n\r\n\r\n\r\nprint(idx+1) ", "def inp(n):\r\n if n == 1:\r\n return map(int, stdin.readline().split())\r\n elif n == 2:\r\n return map(float, stdin.readline().split())\r\n else:\r\n return map(str, stdin.readline().split())\r\n\r\n\r\ndef arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef sum_arr(ix):\r\n if ix < k:\r\n mem[ix] = (n // k) * sum(a[ix::k])\r\n return mem[ix]\r\n else:\r\n return mem[ix % k]\r\n\r\n\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\n\r\nn, k = inp(1)\r\na, mi, ans, mem = arr_inp(), float('inf'), 1, defaultdict(int)\r\n\r\nfor i in range(n):\r\n new = sum_arr(i)\r\n if new < mi:\r\n mi, ans = new, i + 1\r\n\r\nprint(ans)\r\n", "from heapq import *\r\nfrom queue import *\r\nfrom math import *\r\nimport sys, bisect\r\n\r\nfrom collections import Counter, defaultdict\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nN, K = inl()\r\nA = inl()\r\n\r\nans = []\r\nfor start in range(K):\r\n total = 0\r\n for i in range(N // K):\r\n total += A[(start + i * K) % N]\r\n ans.append(total)\r\n\r\nprint(ans.index(min(ans)) + 1)\r\n", "R = lambda :map(int,input().split())\nn,k = R()\ns = list(R())\na = 0\nb = float('inf')\nfor i in range(k):\n c = sum(s[i::k])\n if c<b:\n a = i+1\n b = c\nprint(a)\n\n", "n , k = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\nd = []\r\nfor i in range(0,k):\r\n d.append(sum(l[i::k]))\r\n\r\nprint(d.index(min(d))+1)\r\n ", "n, k = map(int, input().split())\r\nmas = list(map(int, input().split()))\r\ndictionary = dict()\r\nfor i in range(k):\r\n count = 0\r\n for g in range(n//k):\r\n count += mas[i + k * g]\r\n dictionary[i+1] = count\r\n\r\nmini = 10000000000000000\r\nkeye = 10000000000000000\r\nfor key, value in dictionary.items():\r\n if value < mini:\r\n keye = key\r\n mini = value\r\n\r\nprint(keye)\r\n", "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 ,math\r\n#why sorting suffix array although we go through the whole array any way till we find the pattern\r\n#------------------------------------=\r\nx,y = map(int ,rd().split())\r\nm =0\r\nmylist = list(map(int,rd().split()))\r\nfor i in range(y,len(mylist)):mylist[i%y]+=mylist[i]\r\nfor i in range(y):\r\n if mylist[i] < mylist[m] : m = i\r\nprint(m+1) ", "a,b = map(int,input().split())\r\nc= list(map(int,input().split()))\r\nans = 0\r\nmini = sum(c)\r\nfor i in range(b):\r\n d = i \r\n su = 0 \r\n while(d<a):\r\n\r\n su+=c[d]\r\n d+=b\r\n if su < mini:\r\n\r\n mini = su\r\n ans = i\r\nprint(ans+1)", "def zip_sorted(a,b):\n\n\t# sorted by a\n\ta,b = zip(*sorted(zip(a,b)))\n\t# sorted by b\n\tsorted(zip(a, b), key=lambda x: x[1])\n\n\treturn a,b\n\nimport sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\nS = lambda : list(map(str,input().split()))\n\nn,k = I()\na = I()\n\nb = a+a\n\nmin_index = 0\nmin_sum = sum(a)+1\nfor i in range(k):\n\tj = i\n\tsum1 = 0\n\twhile j<n:\n\t\tsum1 = sum1 + a[j]\n\t\tj = j + k \n\tif sum1<min_sum:\n\t\tmin_index = i+1\n\t\tmin_sum = sum1\n\t\nprint(min_index)", "n,k=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nmin1=1000000000000000\r\nans=1\r\nfor i in range(k):\r\n sum1=0\r\n j=i\r\n while(j<n):\r\n sum1+=li[j]\r\n j+=k \r\n #print(sum1,i) \r\n if(sum1<min1):\r\n ans=i+1\r\n min1=sum1\r\nprint(ans)", "import math\r\nimport sys\r\n\r\n#n = int(input())\r\n#n, m = map(int, input().split())\r\n#d = list(map(int, input().split()))\r\nn, m = map(int, input().split())\r\nd = list(map(int, input().split()))\r\n\r\np = 0\r\nr = 10**8 + 1\r\nfor i in range(m):\r\n tp = i\r\n tm = 0\r\n while tp < n:\r\n tm += d[tp]\r\n tp += m\r\n if r > tm:\r\n r = tm\r\n p = i\r\nprint(p + 1) \r\n\r\n\r\n", "n, k = map(int, input().split()); l = [0]*k; ind = 0\r\nfor i in input().split():l[ind%k] += int(i); ind += 1\r\nprint(l.index(min(l))+1)", "import sys\r\nimport math\r\n\r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvmin = 1000000000\r\nrez = 0\r\nfor i in range(k):\r\n vsum = 0\r\n vvmin = 1001\r\n for j in range(i, n, k):\r\n vsum += an[j]\r\n \r\n if(vsum < vmin):\r\n vmin = vsum\r\n rez = i + 1\r\n \r\nprint(rez)\r\n \r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nminsum = sum(a)\r\nimin = 0\r\nfor i in range(k):\r\n if sum(a[i::k]) < minsum:\r\n minsum = sum(a[i::k])\r\n imin = i\r\n\r\nprint(imin + 1)\r\n", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nfrom collections import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nn,k=RI()\nv=[0]*k\na=RI()\nfor i in range(n):\n v[i%k]+=a[i]\nminInd=0\nfor i in range(k):\n if v[i]<v[minInd]:\n minInd=i\nprint(minInd+1)\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\ndef solve(n,k,arr):\r\n\tout = [0]*k;\r\n\tfor i in range(n):out[i%k] += arr[i];\r\n\tprint(out.index(min(out))+1)\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nn,k = get_int()\r\narr = int_arr()\r\nsolve(n,k,arr)", "from heapq import heappush,heappop\r\nfrom collections import deque\r\n\r\n#t = int(input())\r\nt = 1\r\nfor tc in range(1,t+1):\r\n #n = int(input())\r\n n,k = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n #s = input()\r\n \r\n ans = float(\"inf\")\r\n ind = -1\r\n\r\n for i in range(k):\r\n j = i\r\n s = 0\r\n while j<n:\r\n s+=a[j]\r\n j+=k\r\n if ans>s:\r\n ans=s\r\n ind=i\r\n print(ind+1)", "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,k = rinput()\r\nA = rlinput()\r\nans = []\r\nindex = 0\r\nfor i in range(k):\r\n cur = 0\r\n for j in range(i,n,k):\r\n cur += A[j]\r\n ans.append(cur)\r\n if i == 0:\r\n min = cur\r\n index = 1\r\n else:\r\n if cur < min:\r\n min = cur\r\n index = i + 1\r\nprint(index)\r\n", "def read():\r\n n, k = list(map(int, input().split()))\r\n powers = list(map(int, input().split()))\r\n return n, k, powers\r\n\r\n\r\ndef get_min_power(n, k, powers):\r\n start_task = 0\r\n mins = []\r\n for i in range(k):\r\n s = 0\r\n for j in range(i, n, k):\r\n s += powers[j]\r\n mins.append(s)\r\n task = min(mins)\r\n return mins.index(task) + 1\r\n\r\ndef main():\r\n n, k, powers = read()\r\n print(get_min_power(n, k, powers))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmin, sum, pos = 0, 0, 0\r\nfor i in range(k):\r\n sum = 0\r\n for j in range(i, n, k):\r\n sum += a[j]\r\n if i == 0:\r\n min = sum\r\n elif sum < min:\r\n min = sum\r\n pos = i\r\nprint(pos + 1)\r\n", "n,k = list(map(int, input().split()))\r\narr = [int(x) for x in input().split(' ')]\r\nnum = 10000000000\r\nfor i in range(0,k):\r\n sum = 0\r\n for j in range(0,int(n/k)):\r\n sum += arr[j*k+i]\r\n if sum < num:\r\n num = sum\r\n ans = i + 1\r\nprint(str(ans))", "n,k=map(int,input().split())\r\n\r\na = list(map(int,input().strip().split()))[:n]\r\nb = []\r\nfor i in range(k):\r\n b.append(0)\r\nfor i in range(n):\r\n b[i%k]+=a[i]\r\nc = b.index(min(b))\r\nprint(c+1)\r\n", "import math\r\n\r\ndef ni():\r\n return int(input())\r\ndef vals():\r\n return list(map(int, input().split()))\r\ndef nextLine():\r\n return input()\r\n\r\nn, k= vals()\r\na = vals()\r\n\r\ncnt = [0 for i in range(k)]\r\n\r\nfor i in range(n):\r\n cnt[i % k] += a[i]\r\n\r\nchoice = -1\r\nmx = int(1e18)\r\nfor i in range(k):\r\n if cnt[i] < mx:\r\n choice = i + 1\r\n mx = cnt[i]\r\nprint(choice)", "n,k=map(int,input().split())\n\nA=list(map(int,input().split()))\nL=[]\nfor i in range(k):\n s=0\n for j in range(i,n,k):\n s+=A[j]\n L.append(s)\n\nx=min(L)\n\nprint(L.index(x)+1)\n \n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * k\r\nfor i in range(n):\r\n b[(i + 1) % k] += a[i]\r\nb = b[1:] + [b[0]]\r\nprint(b.index(min(b)) + 1)", "'''\r\nCreated on Nov 24, 2013\r\n\r\n@author: Ismael\r\n'''\r\n\r\nimport sys\r\n\r\ndef readInputs():\r\n global n,k,tab\r\n (n,k) = map(int,f.readline().split())\r\n tab = list(map(int,f.readline().split()))\r\n #print(n,k)\r\n #print(tab)\r\n\r\ndef solve():\r\n tabCum = n*[0]\r\n for i in range(k):\r\n tabCum[i] = tab[i]\r\n j = (i + k)%n\r\n while(j != i):\r\n tabCum[i] += tab[j]\r\n j = (j + k)%n\r\n iMin = 0\r\n valMin = tabCum[0]\r\n for i in range(1,k):\r\n if(tabCum[i]<valMin):\r\n valMin = tabCum[i]\r\n iMin = i\r\n return iMin+1\r\n\r\ndef main():\r\n global f\r\n f = sys.stdin\r\n readInputs()\r\n print(solve())\r\n \r\nmain()", "from sys import *\r\ninput = lambda:stdin.readline()\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn,k = get_int()\r\narr = int_arr()\r\n\r\nres = [0] * k\r\nfor i in range(n):\r\n res[i % k] += arr[i]\r\n\r\nprint(res.index(min(res)) + 1)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\nans = 10**9\r\nbestI = 0\r\nfor i in range(k):\r\n score = 0\r\n r = n // k\r\n while r > 0:\r\n score += a[i]\r\n i += k\r\n if i >= n:\r\n i -= n\r\n r -= 1\r\n if score < ans:\r\n ans = score\r\n bestI = i+1\r\n \r\nprint(bestI)", "n, k = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\ns = [0 for i in range(k)]\r\n\r\nfor i in range(len(a)):\ts[i % k] += a[i]\r\n\r\nj = 0\r\nfor i in range(k):\r\n\tif s[i] < s[j]: j = i\r\n\r\nprint(j + 1)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nhash = {}\r\n\r\nfor i in range(n):\r\n try:\r\n hash[i%k]\r\n except:\r\n hash[i%k] = [0,i]\r\n\r\n hash[i%k][0]+=l[i]\r\n else:\r\n hash[i%k][0]+=l[i]\r\nmin = 10**10\r\nfor i in hash.keys():\r\n if hash[i][0]<min:\r\n min = hash[i][0]\r\n ans = hash[i][1]\r\nprint(ans+1)\r\n\r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nmin1=100000000000\r\nc=0\r\nfor i in range(k):\r\n sum1=sum(arr[i::k])\r\n # print(sum1)\r\n if sum1<min1:\r\n c=i\r\n min1= sum1\r\nprint(c+1)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmin=1000000000\r\nind=0\r\nfor i in range(k):\r\n sum=0\r\n for j in range(0,n,k):\r\n sum+=a[(i+j)%n]\r\n if sum<min:\r\n min=sum\r\n ind=i+1\r\nprint(ind)", "def mi():\r\n return map(int, input().split())\r\nn,k = mi()\r\na = list(mi())\r\ndp = [0]*k\r\nfor i in range(k):\r\n for j in range(i, n, k):\r\n dp[i]+=a[j]\r\nprint (1+dp.index(min(dp)))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))*2\r\nfor i in range(n+n-k-1, -1,-1):a[i]+=a[i+k]\r\nmi,mm=0,float(\"inf\")\r\nfor i in range(n):\r\n x=a[i]-a[i+n]\r\n if mm>x:mi=i;mm=x\r\nprint(mi+1)", "[n,k] = [int(x) for x in input().split(' ')]\nA = [int(x) for x in input().split(' ')]\n\nm = -1\nvalm = 10**10\n\nfor i in range(k):\n temp = sum([A[(k*j + i)%n] for j in range(n//k)])\n if temp < valm:\n valm = temp\n m = i\n\nprint(m+1)\n\n\n \t\t\t \t \t\t\t \t \t \t\t\t\t \t", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nans=float(\"inf\")\r\nx=-1\r\nfor i in range(0,k):\r\n t=a[i]\r\n j=i+k\r\n while j<n:\r\n t+=a[j]\r\n j+=k\r\n if t<ans:\r\n ans=t\r\n x=i+1\r\nprint(x)\r\n", "\r\nn,m = input().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\narr=list()\r\narr = list(map(int, input().split()))\r\nfor i in range(n):\r\n arr.append(arr[i])\r\n\r\nd=[None]*2*n\r\nmn=10000000000000000\r\nj=0\r\nfor i in range(2*n):\r\n if i-m>=0:\r\n d[i]=d[i-m]+arr[i]\r\n else:\r\n d[i]=arr[i]\r\n if i>=n:\r\n if mn > d[i]-d[i-n]:\r\n mn = d[i]-d[i-n]\r\n j=i-n\r\n\r\n\r\nprint(j+1)", "import math\r\n\r\ndef optimum_starting_task():\r\n\tn, k = map(int, input().split())\r\n\ttasks = list(map(int, input().split()))\r\n\r\n\tmin_told_off = [math.inf, 0]\r\n\tfor index in range(k):\r\n\t\ttemp_told_off = 0\r\n\t\tfor j in range(index, n, k):\r\n\t\t\ttemp_told_off += tasks[j]\r\n\r\n\t\tif temp_told_off < min_told_off[0]:\r\n\t\t\tmin_told_off = [temp_told_off, index+1]\r\n\r\n\tprint(min_told_off[1])\r\n\r\n\r\noptimum_starting_task()", "n,k=map(int,input().split())\r\ntasks=list(map(int,input().split()))\r\nc=[]\r\nt=0\r\nN=n\r\nif n%k==0:\r\n N=k\r\n\r\nfor i in range(N):\r\n j=i\r\n x=0\r\n t=0\r\n # print(i+1,\" : \",end='')\r\n while t+k<=n:\r\n if j>=n:\r\n j=j-n\r\n x=x+tasks[j]\r\n # print(j+1,end=\"\")\r\n t=t+k\r\n j+=k\r\n c.append(x)\r\n # print(\" : \",x)\r\nmin=c[0]\r\npos=0\r\n# print(c)\r\nfor i in range(N):\r\n if c[i]<min:\r\n pos=i\r\n min=c[i]\r\nprint(pos+1)\r\n\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nxx = [0 for _ in range(k)]\nfor i in range(n):\n\txx[i % k] += a[i]\nprint(xx.index(min(xx)) + 1)\n", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n a=lst()\r\n sm=[0]*k\r\n for i in range(n):\r\n sm[i%k]+=a[i]\r\n p=0\r\n for i in range(k):\r\n if sm[i]<sm[p]:\r\n p=i\r\n print(p+1)", "R=lambda:map(int,input().split())\r\nn,k=R()\r\na=list(R())\r\ns=0\r\ne=0\r\nfor i in range(k):\r\n d=(n/k)-1\r\n e=i+k\r\n while(d>0):\r\n s+=a[e]\r\n e+=k\r\n d-=1\r\n a[i]+=s\r\n s=0\r\nb=[i for i in a[:k]]\r\nprint(b.index(min(b))+1)\r\n\r\n\r\n\r\n \r\n ", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nfor i in range(len(l)):\r\n if (i-k)>=0:\r\n l[i]+=l[i-k]\r\n\r\nh = 9999999999999\r\nind=-1\r\nfor i in range(len(l)-k,n):\r\n if l[i]<h:\r\n h = l[i]\r\n ind=i\r\nprint((ind%k)+1)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\npergroup = n//k\r\nb = [0]*k\r\ni,j = 0,0\r\nwhile i < n:\r\n b[j] += a[i]\r\n j = (j+1) % k\r\n i += 1\r\nmintime = min(b)\r\nfor i in range(len(b)):\r\n if b[i] == mintime:\r\n break\r\nprint(i+1)", "n,k=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nr=100000000000\r\n\r\nfor i in range(n):\r\n if l[i]==0:\r\n break;\r\n j=i\r\n sum=0\r\n while j<n:\r\n sum=sum+l[j]\r\n l[j]=0\r\n j=j+k\r\n if(r>sum):\r\n idx=i\r\n r=sum\r\nprint(idx+1)", "n,k=map(int,input().split())\r\nmi=pow(10,8)+5\r\na=list(map(int,list(input().split())))\r\na.extend(a)\r\nx=n//k\r\nindx=n\r\nfor i in range(1,k+1):\r\n total=0\r\n p=i-1\r\n for j in range(x):\r\n total=total+a[p]\r\n p=p+(k)\r\n if total<mi:\r\n mi=total\r\n indx=i\r\n elif total==mi:\r\n indx=min(indx,i)\r\nprint(indx)\r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n, k = get_ints_in_variables()\r\n arr = get_ints_in_list()\r\n start = 0\r\n end = n\r\n sm = 0\r\n count = 0\r\n while start < end:\r\n sm += arr[start]\r\n start += k\r\n count += 1\r\n idx = 0\r\n res = sm\r\n for i in range(1, n):\r\n st = i\r\n en = n\r\n sm = 0\r\n ct = 0\r\n while st < en:\r\n sm += arr[st]\r\n ct += 1\r\n st += k\r\n if ct == count:\r\n if sm < res:\r\n res = sm\r\n idx = i\r\n else:\r\n break\r\n print(idx+1)\r\n\r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n, k = map(int, input().split())\r\nxs = list(map(int, input().split()))\r\n\r\nres = (10**9, -1)\r\n\r\nfor i in range(k):\r\n\ts = 0\r\n\tfor j in range(i, n, k):\r\n\t\ts+=xs[j]\r\n\tres = min(res, (s, i+1))\r\n\r\nprint(res[1])", "R = lambda :map(int,input().split())\r\nn,k = R()\r\ns = list(R())\r\na = 0\r\nb = float('inf')\r\nfor i in range(k):\r\n c = sum(s[i::k])\r\n if c<b:\r\n a = i+1\r\n b = c\r\nprint(a)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(min((sum(arr[i::k]), i) for i in range(k))[1] + 1)\r\n", "\r\nn, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nprint(min((sum(t[i :: k]), i) for i in range(k))[1] + 1)\r\n", "n, k = [int(x) for x in input().split()]\r\nlist1 = [int(x) for x in input().split()]\r\n\r\n\r\nans = 9999999999\r\nind = n+3\r\n\r\nfor i in range(n):\r\n temp = 0\r\n for j in range(i, n, k):\r\n temp += list1[j]\r\n if temp < ans:\r\n ans = temp\r\n ind = i\r\n if j == n-1:\r\n break\r\n \r\nprint(ind + 1)\r\n \r\n \r\n ", "n , k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nans = []\r\nfor i in range(k):\r\n f = i\r\n res = 0\r\n for j in range(i , i +n , k ):\r\n res += a[j]\r\n\r\n ans.append([f , res])\r\n\r\n#print(ans)\r\nans = sorted(ans , key= lambda x :x[1])\r\n\r\nz = ans[0][0]\r\nprint(z + 1 )\r\n", "def main():\r\n n, k = map(int, input().split())\r\n a = [0] * k\r\n\r\n l=list(map(int,input().split()))\r\n for i in range(n):\r\n a[i % k] += l[i]\r\n\r\n m = 0\r\n for i in range(1, k):\r\n if a[i] < a[m]:\r\n m = i\r\n\r\n print(m + 1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = list(map(int, input().split()))\r\nnum = list(map(int, input().split()))\r\ndp = [0] * (2 * n)\r\nfor i in range(n - 1, -1, -1):\r\n dp[i] = dp[i + k] + num[i]\r\nans = 2**100\r\nfor i in range(0, k):\r\n ans = min(ans, dp[i])\r\nprint(dp.index(ans) + 1)", "n, k = map(int, input().split())\r\nif n == 1:\r\n print(input())\r\n exit()\r\n\r\ntasks = list(map(int, input().split()))\r\nstarting_pts = [0]*k\r\n\r\nfor i in range(n):\r\n starting_pts[i%k] += tasks[i]\r\nprint(starting_pts.index(min(starting_pts))+1)", "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\nn, k = rinput()\r\na = get_list()\r\nans = []\r\nfor i in range(k):\r\n\tl = a[i::k]\r\n\tans.append([i+1, sum(l)])\r\n\r\nans.sort(key=lambda x:x[1])\r\nprint(ans[0][0])", "\r\n\"\"\"\r\n6 2\r\n3 2 1 6 5 4\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nans = []\r\nminn = 123456567\r\nkey = 0\r\nfor i in range(k):\r\n j = i\r\n summ = 0\r\n while j < n:\r\n summ += l[j]\r\n j += k\r\n if(summ < minn):\r\n minn = summ\r\n key = i\r\nprint(key + 1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nif k > n/2:\r\n print(w.index(min(w))+1)\r\nelse:\r\n d = [1e9, -1]\r\n for i in range(k):\r\n c = 0\r\n for j in range(i, n, k):\r\n c += w[j]\r\n if c < d[0]:\r\n d = [c, i+1]\r\n print(d[1])", "\r\nl = input().split()\r\ntasks = int(l[0])\r\nincrement = int(l[1])\r\n\r\nli = list(map(int, input().split()))\r\nstartsum = -2\r\nwholesum = 0\r\n\r\nfor i in range(increment):\r\n\tsum = 0\r\n\tfor j in range(int(tasks/increment)):\r\n\t\tsum += li[(i + (j * increment)) % tasks]\r\n\tif startsum == -2:\r\n\t\twholesum = sum\r\n\t\tstartsum = i + 1\r\n\telse:\r\n\t\tif sum < wholesum:\r\n\t\t\twholesum = sum\r\n\t\t\tstartsum = i + 1\r\n\r\nprint(startsum)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=float(\"inf\")\r\nres=-1\r\nfor i in range(k):\r\n j=i\r\n temp=0\r\n c=n//k\r\n while c:\r\n j%=n\r\n temp+=arr[j]\r\n j+=k\r\n c-=1\r\n if temp<ans:\r\n ans=temp\r\n res=i\r\n\r\nprint(res+1)", "__author__ = 'Lipen'\r\n\r\ndef actions(n, k, a):\r\n\tsmin = -1\r\n\tanswer = 1\r\n\r\n\tfor i in range(k):\r\n\t\ts = sum(a[i::k])\r\n\t\tif s<smin or smin==-1:\r\n\t\t\tsmin=s\r\n\t\t\tanswer=i+1\r\n\r\n\treturn answer\r\n\r\ndef main():\r\n\tn,k = list(map(int, input().split()))\r\n\ta = list(map(int, input().split()))\r\n\r\n\tprint(actions(n, k ,a))\r\n\r\nif __name__=='__main__': main()", "n, k = map(int, input().split())\r\nans = [0] * k\r\nind = 0\r\nfor i in input().split():\r\n\ti = int(i)\r\n\tans[ind % k] += i\r\n\tind += 1\r\n\t#print(i % k, i)\r\n#print(ans)\r\nprint(ans.index(min(ans)) + 1)", "import sys\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=[0]*k\r\nfor i in range(n):\r\n r[i%k]=r[i%k]+a[i]\r\nb=min(r)\r\nprint(r.index(b)+1)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = []\r\nfor i in range(k):\r\n f = i\r\n res = 0\r\n for j in range(i,i+n,k):\r\n res += l[j]\r\n ans.append([f,res])\r\nans = sorted(ans, key=lambda x:x[1])\r\nfinal = ans[0][0]\r\nprint(final+1)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndp=[0]*k \r\nfor i in range(n):\r\n m=i%k \r\n dp[m]+=a[i]\r\ng=1000000000\r\nl=0\r\nfor i in range(k):\r\n if g>dp[i]:\r\n g=dp[i]\r\n l=i\r\nprint(l+1)" ]

[ "import sys\r\n\r\nk, n = map(int, input().split())\r\ns = [list(word.rstrip()) for word in sys.stdin]\r\n\r\ndouble = True if max(s[0].count(chr(i+97)) for i in range(26)) > 1 else False\r\ndiff = [set() for _ in range(k)]\r\ndiff_cnt = [0]*k\r\nfor i in range(1, k):\r\n for j in range(n):\r\n if s[0][j] != s[i][j]:\r\n diff[i].add(j)\r\n diff_cnt[i] += 1\r\n if diff_cnt[i] > 4:\r\n print(-1)\r\n exit()\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n s[0][i], s[0][j] = s[0][j], s[0][i]\r\n for x in range(1, k):\r\n w = [y for y in diff[x] | {i, j} if s[0][y] != s[x][y]]\r\n if double and len(w) == 0:\r\n continue\r\n if len(w) == 2 and s[0][w[0]] == s[x][w[1]] and s[0][w[1]] == s[x][w[0]]:\r\n continue\r\n break\r\n else:\r\n print(''.join(s[0]))\r\n exit()\r\n s[0][i], s[0][j] = s[0][j], s[0][i]\r\n\r\nprint(-1)\r\n" ]

[ "from math import hypot, atan2, cos, sin, sqrt, pi\nimport sys\n\nmapInt = lambda:map(int,sys.stdin.buffer.readline().split())\n\nN, Q = mapInt()\n\n# Get points from input\npoints = {}\nfor n in range(N) :\n x, y = mapInt()\n points[n+1] = [x,y]\n\n# Calculate COM (centroid)\ncentroid = [0,0]\nA = 0\nfor n in range(1,N+1) :\n w = points[n][0]*points[n%N+1][1] - points[n%N+1][0]*points[n][1]\n centroid[0] += (points[n][0] + points[n%N+1][0])*w\n centroid[1] += (points[n][1] + points[n%N+1][1])*w\n A += w\n\ncentroid[0] /= 3*A\ncentroid[1] /= 3*A\n\n# Move all points such that COM is at origin\nfor i in points.keys() :\n points[i][0] -= centroid[0]\n points[i][1] -= centroid[1]\n\n# atan2(x, -y) to use negative y as reference\n\ntotAng = 0\npins = [1,2]\n\nfor q in range(Q) :\n inp = list(mapInt())\n\n if inp[0] == 1 :\n f, t = inp[1],inp[2]\n if pins[0] == pins[1] == f :\n pins[0] = t\n continue\n elif pins[0] == f :\n pivot = pins[1]\n pins[0] = t\n else :\n pivot = pins[0]\n pins[1] = t\n\n x, y = points[pivot]\n centroid[0] += sin(totAng + atan2(x,-y))*hypot(x,y)\n centroid[1] += (-cos(totAng + atan2(x,-y)) - 1)*hypot(x,y)\n totAng = pi-atan2(x,-y)\n\n elif inp[0] == 2 :\n x, y = points[inp[1]]\n pointX = sin(totAng + atan2(x,-y))*hypot(x,y) + centroid[0]\n pointY = -cos(totAng + atan2(x,-y))*hypot(x,y) + centroid[1]\n\n print (\"%0.20f %0.20f\" % (pointX, pointY))\n\n", "import sys\r\nread=lambda:map(int,sys.stdin.buffer.readline().split())\r\nfrom math import *\r\nn,q=read()\r\nx,y=[],[]\r\ncx,cy=0,0\r\ndeg=0\r\np1,p2=0,1\r\ndef pos(i):\r\n\treturn (cx+x[i]*cos(deg)-y[i]*sin(deg),cy+y[i]*cos(deg)+x[i]*sin(deg))\r\nfor i in range(n):\r\n\t_x,_y=read()\r\n\tx.append(_x);y.append(_y)\r\ns=0\r\nfor i in range(2,n):\r\n\t_s=(x[i]-x[0])*(y[i-1]-y[0])-(y[i]-y[0])*(x[i-1]-x[0])\r\n\tcx+=(x[0]+x[i]+x[i-1])/3*_s\r\n\tcy+=(y[0]+y[i]+y[i-1])/3*_s\r\n\ts+=_s\r\ncx/=s;cy/=s\r\nfor i in range(n): x[i]-=cx;y[i]-=cy\r\nfor i in range(q):\r\n\tv=list(read())\r\n\tif v[0]==1:\r\n\t\tif p1==v[1]-1: p1,p2=p2,None\r\n\t\telse: p1,p2=p1,None\r\n\t\tcx,cy=pos(p1);cy-=hypot(x[p1],y[p1])\r\n\t\tdeg=pi/2-atan2(y[p1],x[p1]);p2=v[2]-1\r\n\telse:\r\n\t\tprint(\"%.15f %.15f\"%pos(v[1]-1))", "#!/usr/bin/env python3\n\n\nfrom math import hypot\n\n[n, q] = map(int, input().strip().split())\nxys = [tuple(map(int, input().strip().split())) for _ in range(n)]\nqis = [tuple(map(int, input().strip().split())) for _ in range(q)]\n\ndxys = [(xys[(i + 1) % n][0] - xys[i][0], xys[(i + 1) % n][1] - xys[i][1]) for i in range(n)]\n\nS = 3 * sum((x*dy - y*dx) for (x, y), (dx, dy) in zip(xys, dxys))\nSx = sum((dx + 2*x) * (x*dy - y*dx) for (x, y), (dx, dy) in zip(xys, dxys))\nSy = sum((dy + 2*y) * (x*dy - y*dx) for (x, y), (dx, dy) in zip(xys, dxys))\n#Sy = sum((2*dx*dy + 3*x*dx + 3*x*dy + 6*x*y)*dy for (x, y), (dx, dy) in zip(xys, dxys))\nfor p in [2, 3]:\n\twhile S % p == Sx % p == Sy % p == 0:\n\t\tS //= p\n\t\tSx //= p\n\t\tSy //= p\n\nxyms = [(S*x - Sx, S*y - Sy) for x, y in xys]\nhs = [hypot(x, y) for x, y in xyms]\n\ndef to_coord(x, y):\n\treturn (x + Sx) / S, (y + Sy) / S\n\nhangs = (0, 1)\nhang_on = None\ncx, cy = 0.0, 0.0\n\n# hang on u\ndef get_v(v):\n\tif hang_on is None:\n\t\treturn xyms[v]\n\telse:\n\t\tux, uy = xyms[hang_on]\n\t\tvx, vy = xyms[v]\n\t\th = hs[hang_on]\n\t\treturn ((uy * vx - ux * vy) / h, (ux * vx + uy * vy) / h)\n\n#def ss(v1, v2):\n#\treturn tuple(vi + vj for vi, vj in zip(v1, v2))\n\n#def disp():\n#\tprint ('hangs on', hang_on, 'of', hangs)\n#\tprint ('center', to_coord(cx, cy))\n#\tprint ({i: to_coord(*ss(get_v(i), (cx, cy))) for i in range(n)})\n\t\n#disp()\nfor qi in qis:\n\tif qi[0] == 1:\n\t\t_, f, t = qi # 1-indexation\n\t\ts = hangs[1 - hangs.index(f - 1)]\n\t\tdx, dy = get_v(s)\n\t\tcx += dx\n\t\tcy += dy - hs[s]\n\t\thang_on = s\n\t\thangs = (s, t - 1)\n#\t\tprint ('{} --> {}'.format(f - 1, t - 1))\n#\t\tdisp()\n\telse:\n\t\t_, v = qi # 1-indexation\n\t\tdx, dy = get_v(v - 1)\n\t\tprint (*to_coord(cx + dx, cy + dy))\n" ]

[ "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Dec 7 14:01:59 2022\r\n\r\n@author: 86138\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\nli=list(map(int,input().split()))\r\ns=set();dp=[0]*n;p=0\r\nfor i in range(n-1,-1,-1):\r\n if li[i] not in s:\r\n p+=1\r\n s.add(li[i]);dp[i]=p\r\nli_1=[]\r\nfor j in range(m):\r\n a=int(input());li_1.append(dp[a-1])\r\nprint('\\n'.join(map(str,li_1)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n array:list[int] = []\r\n queries:list[int] = []\r\n _, QUERY_LEN = map(int, input().split())\r\n array = list(map(int, input().split()))\r\n queries = [int(input()) for _ in range(QUERY_LEN)]\r\n\r\n\r\n answers:list[int] = []\r\n answerTable:list[int] = [0]*len(array)\r\n elementSet:set[int] = set()\r\n for index in range(len(array)-1, 0-1, -1) :\r\n elementSet.add(array[index])\r\n answerTable[index] = len(elementSet)\r\n answers = [answerTable[query-1] for query in queries]\r\n\r\n\r\n print(\"\\n\".join(map(str, answers)))\r\n\r\nmain()", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n, m = map(int, stdin.readline().split())\r\n A = [int(x) for x in stdin.readline().split()]\r\n\r\n res = [0] * n\r\n seen = set()\r\n\r\n for i in range(n - 1, -1, -1):\r\n seen.add(A[i])\r\n res[i] = len(seen)\r\n\r\n for _ in range(m):\r\n i = int(stdin.readline())\r\n print(res[i - 1])\r\n\r\n\r\nsolve()\r\n", "n, m = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nindexes = [int(input()) - 1 for i in range(m)]\r\nmin_index = min(indexes)\r\ndistinct_nums = {}\r\noutputs = [0]\r\ni = n - 1\r\nwhile i >= min_index:\r\n if distinct_nums.get(nums[i]):\r\n outputs.append(outputs[-1])\r\n else:\r\n distinct_nums[nums[i]] = 1\r\n outputs.append(outputs[-1] + 1)\r\n i -= 1\r\noutputs.reverse()\r\nfor i in indexes:\r\n print(outputs[i - min_index])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()));b=set()\r\nfor i in range(n):b.add(a[~i]);a[~i]=len(b)\r\nfor i in ' '*m:print(a[int(input())-1])\r\n", "n,m=[int(a) for a in input().split()]\r\narray=[0]+[int(b) for b in input().split()]+[0]\r\naset=set()\r\nfor j in range(n,0,-1):\r\n aset.add(array[j]);array[j]=len(aset)\r\nfor k in range(1,m+1):\r\n l=int(input())\r\n print(array[l])", "n,m=map(int,input().split())\r\ns=[int(x) for x in input().split()]\r\nt=set()\r\nans=[]\r\np=0\r\nfor a in reversed(s):\r\n if a not in t:\r\n p+=1\r\n t.add(a)\r\n ans.append(p)\r\nfor i in range(m):\r\n k=n-int(input())\r\n print(ans[k])", "n,m=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\ntemp=set()\r\nans=[0]*n\r\nfor i in range(n-1,-1,-1):\r\n temp.add(nums[i])\r\n ans[i]=len(temp)\r\nfor _ in range(m):\r\n print(ans[int(input())-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 Sereja_and_Suffixes():\r\n n,m = invr()\r\n sequence = inlt()\r\n \r\n uniqueElementsCount = [0]*n\r\n uniqueElementsSet = set()\r\n index_from_back = n-1 \r\n\r\n while index_from_back >= 0:\r\n uniqueElementsSet.add(sequence[index_from_back])\r\n uniqueElementsCount[index_from_back] = len(uniqueElementsSet)\r\n index_from_back -= 1\r\n\r\n outputStr= ''\r\n for i in range(m):\r\n li = inp()\r\n outputStr += str(uniqueElementsCount[li-1]) + '\\n'\r\n\r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n return\r\n\r\n\r\nSereja_and_Suffixes()", "n, m = map(int, input().split())\r\narray = [0] + [int(_) for _ in input().split()]\r\nindex = [False] * 100001\r\nans = [0] * (n + 2)\r\nfor i in range(n, 0, -1):\r\n ans[i] = ans[i+1]\r\n if not index[array[i]]:\r\n ans[i] += 1\r\n index[array[i]] = True\r\n\r\nout = [0] * m\r\nfor j in range(m):\r\n out[j] = str(ans[int(input())])\r\nprint('\\n'.join(out))\r\n", "n,m=map(int,input().split())\r\narray=input().split()\r\narray_new=set()\r\nfor i in range(n):\r\n array_new.add(array[n-i-1])\r\n array[n-i-1]=len(array_new)\r\nfor ii in range(m):\r\n l=int(input())\r\n print(array[l-1])\r\n \r\n ", "from sys import stdin, stdout \r\n\r\nn,m=map(int,stdin.readline().split())\r\nl=list(map(int,stdin.readline().split()))\r\nlis=[0]*((10**5)+1)\r\nv=0\r\ni=len(l)-1\r\narr=[]\r\nwhile i >= 0 :\r\n k=l[i]\r\n if lis[k] == 0 :\r\n v+=1\r\n lis[k]=v\r\n arr.append(lis[k])\r\n else :\r\n lis[k]=v\r\n arr.append(lis[k])\r\n i-=1\r\nfor i in range(m):\r\n p=int(stdin.readline())\r\n p=len(arr)-p\r\n print(arr[p])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 31 17:42:07 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\nflags = [True]*100001\r\na,l = map(int,input().split())\r\na_ = [int(element) for element in input().split()]\r\ncounters = [0]*a\r\ncounter = 0\r\nfor i in range(a-1,-1,-1):\r\n if flags[a_[i]]:\r\n counter += 1\r\n flags[a_[i]] = False\r\n counters[i] += counter\r\nfor i in range(l):\r\n print(counters[int(input())-1])", "exist = [False] * 100002\r\nn, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\ndistinct = [0] * 100001\r\nfor i in range(n - 1, -1, -1):\r\n if not exist[array[i]]:\r\n exist[array[i]] = True\r\n distinct[i] = distinct[i + 1] + 1\r\n else:\r\n distinct[i] = distinct[i + 1]\r\nfor i in range(0, m):\r\n l_ = int(input())\r\n print(distinct[l_ - 1])\r\n# 化院 荆屹然 2300011884\r\n", "n, m = map(int, input().split())\r\nmas = [int(el) for el in input().split()]\r\nst = set()\r\npostf = [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n st.add(mas[i])\r\n postf[i] = len(st)\r\nfor i in range(m):\r\n print(postf[int(input()) - 1])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndi={a[n-1]:True}\r\ndp=[1]*n\r\nfor i in range(n-2,-1,-1):\r\n if a[i] in di:\r\n dp[i]=dp[i+1]\r\n\r\n else:\r\n di[a[i]]=True\r\n dp[i]=dp[i+1]+1\r\n\r\nfor _ in range(m):\r\n print(dp[int(input())-1])", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nnum = 0\r\nnumber = set()\r\nl = []\r\n\r\nfor i in range(n-1,-1,-1):\r\n if a[i] in number:\r\n num = num\r\n else:\r\n num = num + 1\r\n number.add(a[i])\r\n l.append(num)\r\n\r\nfor m1 in range(m):\r\n i_l = int(input())\r\n print(l[n-i_l])", "n,m=map(int,input().split())\r\nrw=[int(x) for x in input().split()]\r\ndp=[0]*(1+n)\r\nchk=set()\r\nfor i in range(n-1,-1,-1):\r\n if rw[i] not in chk:\r\n dp[i]=dp[i+1]+1\r\n chk.add(rw[i])\r\n else:\r\n dp[i]=dp[i+1]\r\nfor i in range(m):\r\n print(dp[-1+int(input())])", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\nk={}\r\nquick=[]\r\nd=0\r\nfor i in l:\r\n if i not in k.keys():\r\n k[i]=1\r\n d+=1\r\n quick.append(d)\r\nfor i in range(m):\r\n print(quick[-int(input())])", "n,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nlst=[]\r\nfor _ in range(m):\r\n lst.append(int(input())-1) #把序号对应到索引\r\nnew_lst=sorted(lst)\r\n#ans=[0]*(n+1)\r\nans={} #ans的key对应的是a的第几个元素\r\n\r\nsuffix=set(a[new_lst[m-1]:n])\r\nans[new_lst[m-1]]=len(suffix)\r\nfor i in range(m-2,-1,-1):\r\n suffix.update(a[new_lst[i]:new_lst[i+1]])\r\n #print(suffix)\r\n ans[new_lst[i]]=len(suffix)\r\n\r\n#print(ans)\r\nfor i in range(m):\r\n #print(lst[i])\r\n print(ans[lst[i]])\r\n\r\n", "def mai(n,lis):\r\n dis=set();ans=[];count=0\r\n for i in range(n-1,-1,-1):\r\n if lis[i] not in dis:\r\n count+=1\r\n dis.add(lis[i])\r\n ans.append(count)\r\n return ans[::-1]\r\n\r\n\r\nn,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nlis=mai(n,lis)\r\nfor i in range(m):\r\n ind=int(input())\r\n print(lis[ind-1])", "n,m=map(int,input().split())\r\na=[int(i)for i in input().split()]\r\n\r\nd=set()\r\ns=[]\r\nfor i in reversed(a):\r\n d.add(i)\r\n s.append(len(d))\r\n\r\nfor i in range(m): print(s[-int(input())])", "n,m=map(int,input().split())\r\nl=[int(c) for c in input().split()]\r\ndp=[0]*(n-1)+[1]\r\nse={l[n-1]}\r\nfor i in reversed(range(n-1)):\r\n if l[i] in se:\r\n dp[i]=dp[i+1]\r\n else:\r\n dp[i]=dp[i+1]+1\r\n se.add(l[i])\r\nfor k in range(m):\r\n inp=int(input())\r\n print(dp[inp-1])", "n,m = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nsett = set()\r\nnum = []\r\nt = 0\r\nfor i in range(n-1,-1,-1):\r\n if lst[i] not in sett:\r\n t+=1\r\n sett.add(lst[i])\r\n num.append(t)\r\n else:\r\n t+=0\r\n num.append(t)\r\nnum.reverse()\r\nfor i in range(m):\r\n am = int(input())\r\n print(num[am-1])", "import sys\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\na = list(map(lambda q:int(q), input().split(\" \")))\r\nr =set()\r\nfor i in range(n):\r\n r.add(a[n-i-1])\r\n a[n-i-1]=len(r)\r\nfor i in range(m):\r\n l=int(input())\r\n print(a[l-1])\r\n\r\n", "n, m = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\nquests = []\r\nfor i in range(m):\r\n quests.append(int(input()))\r\nmx = max(quests)\r\nmn = min(quests)\r\nbucket = [False] * (10 ** 5 + 2)\r\ndp = [0] * (10 ** 5 + 2)\r\nfor i in range(mx - 1, n):\r\n if not bucket[num[i]]:\r\n bucket[num[i]] = True\r\n dp[mx] += 1\r\nfor i in range(mx - 1, mn - 1, -1):\r\n if not bucket[num[i - 1]]:\r\n dp[i] = dp[i + 1] + 1\r\n bucket[num[i - 1]] = True\r\n else:\r\n dp[i] = dp[i + 1]\r\nfor i in quests:\r\n print(dp[i])\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nprefix = [0] * n\nseen = set()\nfor i in range(n-1, -1, -1):\n seen.add(a[i])\n prefix[i] = len(seen)\n\nfor _ in range(m):\n l = int(input())\n print(prefix[l-1] - prefix[-1] + 1)\n\n", "n,m = [int(x) for x in input().split()]\r\narray = list(map(int,input().split()))\r\nlable = []\r\nnew_array = set(array)\r\narray.reverse()\r\ncount = 0\r\nfor x in range(n):\r\n if array[x] in new_array:\r\n count = count + 1\r\n new_array.remove(array[x])\r\n lable.append(count)\r\nlable.reverse()\r\nfor _ in range(m):\r\n a = int(input())\r\n print(lable[a-1])\r\n#终于过了 这应该是一维dp吧，感觉不dp必定超时", "# https://codeforces.com/problemset/problem/368/B\r\n\r\nimport sys\r\n\r\n\r\ndef check(seq, cmds):\r\n s = set()\r\n k = [0 for _ in range(len(seq))]\r\n for i in range(len(seq)-1, -1, -1):\r\n s.add(seq[i])\r\n k[i] = len(s)\r\n \r\n for cmd in cmds:\r\n print(k[cmd-1])\r\n\r\nr = tuple(line for line in sys.stdin)\r\nseq = tuple(map(int, r[1].split()))\r\ncmds = tuple(map(int, r[2:]))\r\ncheck(seq, cmds)", "n, m = map(int, input().split())\r\nelements_list = list(map(int, input().split()))\r\nresult_list = list()\r\ns = set()\r\nans = [0] * n\r\n\r\nfor i in reversed(range(n)):\r\n if elements_list[i] not in s:\r\n s.add(elements_list[i])\r\n ans[i] = len(s)\r\n\r\nfor _ in range(m):\r\n z = int(input())\r\n result = ans[z - 1]\r\n result_list.append(result)\r\n\r\nfor x in result_list:\r\n print(x)\r\n", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\ns = set()\r\nfor i in range(1, n + 1):\r\n\ts.add(a[-i])\r\n\ta[-i] = len(s)\r\nfor _ in range(m):\r\n\tl = int(input())\r\n\tprint(a[l - 1])", "n,m = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\n\r\ncount = [0]*n\r\ndp = [0]*10**5\r\nfor i in range(n):\r\n if i == 0:\r\n count[-1] = 1\r\n dp[a[-1]-1] = 1\r\n else:\r\n if dp[a[n-1-i]-1] == 0:\r\n count[n-1-i] = count[n-i]+1\r\n dp[a[n-1-i]-1] = 1\r\n else:\r\n count[n-1-i] = count[n-i]\r\n\r\nfor _ in range(m):\r\n print(count[int(input())-1])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndp=[0]*(max(a)+1)\r\ns=[0]*(n+1)\r\n#b从1开始至最后一个数，最后一个数是1，而b=1时，是整个列表去重求len\r\nfor i in range(1,len(a)+1):\r\n if dp[a[-i]]==0:\r\n dp[a[-i]]+=1\r\n s[-i]=s[-i+1]+1\r\n else:\r\n s[-i]=s[-i+1]\r\nfor i in range(m):\r\n b=int(input())\r\n print(s[b])", "# -*- coding: utf-8 -*-\n\"\"\"Untitled0.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1_9OVzDPPHfXqUJ4iey71tgQjHg8urO5i\n\"\"\"\n\nn,m = input().split()\nn=int(n)\nm=int(m)\nans = list([0]*100001)\nc = list([0]*100001)\na = list(input().split())\nfor i in range(n):\n a[i]=int(a[i])\nans[n]=1;\nc[a[n-1]]=1;\nfor i in range(n-1,0,-1):\n c[a[i-1]]+=1;\n if c[a[i-1]]==1:\n ans[i]=ans[i+1]+1\n else:\n ans[i]=ans[i+1];\nfor i in range(m):\n x = int(input())\n print(ans[x])", "while True:\n try:\n n, m = map(int, input().split())\n S = list(map(int, input().split()))\n ans = [0] * (n + 1)\n T = {}\n \n for i in range(n - 1, -1, -1):\n if S[i] not in T:\n ans[i] = ans[i + 1] + 1\n T[S[i]] = 1\n else:\n ans[i] = ans[i + 1]\n \n for _ in range(m):\n tmp = int(input())\n print(ans[tmp - 1])\n \n except EOFError:\n break\n\n \t\t\t\t\t\t \t \t \t\t \t\t \t \t \t", "from collections import defaultdict\r\n\r\n\r\nn, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\narray_l = []\r\nfor i in range(m):\r\n array_l.append(int(input()))\r\nnot_in_right = defaultdict(lambda: 1)\r\ndp = [0] * (n + 1)\r\ndp[n] = 1\r\nfor l in range(n - 1, min(array_l) - 1, -1):\r\n not_in_right[array[l]] = 0\r\n dp[l] = dp[l + 1] + not_in_right[array[l - 1]]\r\nfor l in array_l:\r\n print(dp[l])", "n,m=(int(k) for k in input().split())\r\na=[int(p) for p in input().split()]\r\n\r\nspace=[0]*(n+1)\r\nnum=[0]*(max(a)+1)\r\nfor i in range(1,n+1):\r\n x=a[-i]\r\n if num[x]==0:\r\n num[x]+=1\r\n space[i]=space[i-1]+1\r\n else:\r\n space[i]=space[i-1]\r\n\r\nfor j in range(m):\r\n k=int(input())\r\n print(space[n-k+1])", "n,m=list(map(int,input().split(' ')))\r\na=list(map(int,input().split(' ')))\r\na.reverse()\r\nb=set()\r\nn=[]\r\nfor i in a:\r\n b.add(i)\r\n n.append(len(b))\r\nn.reverse()\r\n# print(n)\r\n\r\nfor _ in range(m):\r\n l=int(input())\r\n print(n[l-1])", "n, m = map(int, input().split())\r\nelements_list = list(map(int, input().split()))\r\n\r\ns = set()\r\nans = [0] * n\r\n\r\n# Compute distinct counts\r\nfor i in reversed(range(n)):\r\n if elements_list[i] not in s:\r\n s.add(elements_list[i])\r\n ans[i] = len(s)\r\n\r\n# Process queries\r\nfor _ in range(m):\r\n z = int(input())\r\n print(ans[z-1])\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=list(reversed(a))\r\nl,lt,ans=[],set(),{}\r\nfor _ in range(m):\r\n l.append(n-int(input()))\r\nl_=l[:]\r\nl_.sort()\r\nl_=[0]+l_\r\nfor i in range(m):\r\n for j in range(l_[i],l_[i+1]+1):\r\n lt.add(a[j])\r\n ans[l_[i+1]]=len(lt)\r\nfor _ in l:\r\n print(ans[_])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# 初始化 dp 和 seen\r\ndp = [0] * n\r\nseen = set()\r\n\r\n# 从后往前遍历数组 a\r\nfor i in range(n-1, -1, -1):\r\n # 如果当前数字还没有在 seen 中\r\n if a[i] not in seen:\r\n seen.add(a[i])\r\n if i < n-1:\r\n dp[i] = dp[i+1] + 1\r\n else:\r\n dp[i] = 1\r\n else:\r\n if i < n-1:\r\n dp[i] = dp[i+1]\r\n\r\n# 对于每个查询 li，输出结果\r\nfor _ in range(m):\r\n li = int(input())\r\n print(dp[li-1])\r\n", "n, m = [int(i) for i in input().split()]\r\narr = list(map(int, input().split()))\r\ndistinct = set()\r\nfor i in range(1, n + 1):\r\n distinct.add(arr[-i])\r\n arr[-i] = len(distinct)\r\nfor j in range(m):\r\n print(arr[int(input()) - 1])", "n,m=map(int,input().split())\r\nL=list(map(int,input().split()))\r\ns=set()\r\ndp=[]\r\nfor i in range(len(L)-1,-1,-1):\r\n if i==len(L)-1:\r\n s.add(L[i])\r\n dp.append(1)\r\n else:\r\n if L[i] not in s:\r\n s.add(L[i])\r\n dp.append(dp[len(L)-i-2]+1)\r\n else:\r\n dp.append(dp[len(L)-i-2])\r\nfor mi in range(m):\r\n q=int(input())\r\n print(dp[len(L)-q])", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndp=set()\r\nans=[]\r\nfor i in range(n-1,-1,-1):\r\n dp.add(l[i])\r\n ans.append(len(dp))\r\nans.reverse()\r\nfor _ in range(m):\r\n print(ans[int(input())-1])\r\n \r\n \r\n \r\n \r\n ", "# LUOGU_RID: 131981906\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.reverse()\r\nnum=set()\r\nlength=[]\r\nfor i in a:\r\n num.add(i)\r\n length.append(len(num))\r\nfor i in range(m):\r\n l=int(input())\r\n print(length[n-l])", "n, m =map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndistinct_numbers=set()\r\nmy_dict = {}\r\nresult = []\r\nfor i in range(len(arr)-1,-1,-1):\r\n distinct_numbers.add(arr[i])\r\n my_dict[i] = len(distinct_numbers)\r\nfor _ in range(m):\r\n l = int(input())\r\n result.append(my_dict[l-1])\r\nfor letter in result:\r\n print(letter)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 28 00:04:15 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nmemo={}\r\nresult=[0]*n\r\nfor i in range(n):\r\n if a[i] in memo:\r\n memo[a[i]]+=1\r\n else:\r\n memo[a[i]]=1\r\nfor i in range(n):\r\n if memo[a[i]]==1:\r\n memo.pop(a[i])\r\n result[i]+=1\r\n else:\r\n memo[a[i]]-=1\r\n result[i]+=len(memo)\r\nfor _ in range(m):\r\n li=int(input())\r\n print(result[li-1])", "n, m = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\nuniques = set()\r\nvals = [0 for i in range(len(nums))]\r\n\r\nfor i in reversed(range(n)):\r\n uniques.add(nums[i])\r\n vals[n - 1 - i] = len(uniques)\r\n\r\nans = []\r\nfor i in range(m):\r\n x = int(input())\r\n ans.append(vals[n-x])\r\n\r\nprint(*ans, sep='\\n')\r\n", "a,b=map(int,input().split())\r\nnumbers=[int(x) for x in input().split()]\r\nhaha=set()\r\nfor i in range(a):\r\n haha.add(numbers[a-i-1])\r\n numbers[a-i-1]=len(haha)\r\nfor i in range(b):\r\n print(numbers[int(input())-1])", "#梁慧婷 2300012153 生命科学学院\r\nn,m = map(int,input().split())\r\narray = input().split()\r\nnumbers = set()\r\nanswer = []\r\nfor x in range(n):\r\n numbers.add(array[-(x+1)])\r\n answer.append(len(numbers))\r\nfor i in range(m):\r\n l = int(input())\r\n print(answer[-l])", "n,m=map(int, input().split())\r\nl1=[int(x) for x in input().split()]\r\ns1=set()\r\nnum=0\r\nans=[]\r\nfor i in reversed(l1):\r\n if i not in s1:\r\n s1.add(i)\r\n num+=1\r\n ans.append(num)\r\nans.reverse()\r\nfor i in range(m):\r\n x=int(input())\r\n print(ans[x-1])", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=set()\r\na=a[::-1]\r\ns.add(a[0])\r\nans=[1,]+[0]*(n-1)\r\nfor i in range(1,n):\r\n\tif a[i] in s:\r\n\t\tans[i]=ans[i-1]\r\n\telse:\r\n\t\ts.add(a[i])\r\n\t\tans[i]=ans[i-1]+1\r\nans=ans[::-1]\r\nfor i in range(m):\r\n\tq=int(input())\r\n\tprint(ans[q-1])", "from collections import defaultdict\n\nn, m = map(int, input().split())\n\na = list(map(int, input().split()))\n\n\ndp = [0] * (len(a) + 2)\ndp[-1] = 1\nfreq = defaultdict(int)\nfreq.setdefault(0)\n\ni = len(a) - 1\nfor num in reversed(a):\n if not num in freq:\n dp[i] = dp[i + 1] + 1\n else:\n dp[i] = dp[i + 1]\n\n freq[num] += 1\n\n i -= 1\n\nfor num in range(m):\n l = int(input())\n print(dp[l - 1])\n", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=defaultdict(int)\r\n\r\np=0\r\ne=[]\r\nfor q in range(1,n+1):\r\n if d[c[-q]]==0:\r\n d[c[-q]]=1\r\n p+=1\r\n e.append(p)\r\n \r\nfor i in range(m):\r\n l=int(input())\r\n print(e[n-l])", "n,m = map(int, input().split())\r\nelements = list(map(int, input().split()))\r\ndp = [0]*(n+1)#先dp最后直接输出结果\r\nnumber = {}\r\nfor i in range(1,n+1):\r\n if elements[-i] not in number:#从倒数第一位开始判断\r\n dp[i] = dp[i-1]+1#dp[i]表示从倒数第i位开始到结束的不同数字的个数\r\n number[elements[-i]] = 1\r\n else:\r\n dp[i] = dp[i-1]\r\nfor i in range(m):\r\n l = int(input())\r\n print(dp[-l])\r\n\r\n", "from sys import stdin\r\n\r\n# https://codeforces.com/problemset/problem/368/B\r\n\r\ndef inp():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef iinp():\r\n\treturn int(inp())\r\n\r\ndef mp():\r\n\treturn map(int, inp().split())\r\n\r\ndef liinp():\r\n\treturn list(mp())\r\n\r\nif __name__==\"__main__\":\r\n n, m = liinp()\r\n A = liinp()\r\n\r\n suffix = [0 for _ in range(n)]; suffix[-1] = 1\r\n seen = {A[-1]}\r\n\r\n for i in range(n-2, -1, -1):\r\n if A[i] not in seen:\r\n seen.add(A[i])\r\n suffix[i] = suffix[i+1] + 1\r\n else:\r\n suffix[i] = suffix[i+1]\r\n\r\n for _ in range(m):\r\n l = iinp()\r\n print(suffix[l-1])\r\n ", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# create a dictionary to store the frequency of each number\r\nfreq = {}\r\nfor i in range(n-1, -1, -1):\r\n freq[a[i]] = 1\r\n a[i] = len(freq)\r\n \r\n# loop through the positions and print the answer\r\nfor i in range(m):\r\n l = int(input())\r\n print(a[l-1])\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndp=[]\r\njihe=set()\r\no=0\r\nfor i in reversed(a):\r\n if i not in jihe:\r\n jihe.add(i)\r\n o+=1\r\n\r\n dp.append(o)\r\nfor t in range(m):\r\n k=int(input())\r\n print(dp[n-k])\r\n\r\n\r\n", "from collections import defaultdict\r\ndef solve(n,l):\r\n d=defaultdict(int)\r\n c=0\r\n k=[]\r\n for i in range(n-1,-1,-1):\r\n if d[l[i]]==0:\r\n d[l[i]]+=1\r\n c+=1\r\n k.append(c) \r\n return k\r\n\r\n\r\n\r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nres=solve(n,l)\r\nfor i in range(m):\r\n t=int(input())\r\n print(res[n-t])\r\n \r\n", "from collections import defaultdict as dd\r\nn,m = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\ns = set()\r\ndp = [0,]\r\nfor i in range(n-1,-1,-1):\r\n if(arr[i] not in s):\r\n dp.append(dp[-1]+1)\r\n s.add(arr[i])\r\n else:\r\n dp.append(dp[-1])\r\nfor _ in range(m):\r\n\tq = int(input())\r\n\tprint(dp[n-q+1])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 10 16:32:06 2022\r\n\r\n@author: 帝落梦魂\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nx = [0]\r\ny = set()\r\na.reverse()\r\nfor i in a:\r\n y.add(i)\r\n x.append(len(y))\r\nout = ''\r\nfor i in range(m):\r\n out = out + f'{x[n-int(input())+1]}\\n'\r\nprint(out)", "n, m = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\nans = [1] * n\nt = dict()\nt[q[-1]] = 1\nfor i in range(n-1-1, -1, -1):\n\ttemp = 0\n\ttry:\n\t\ttemp = t[q[i]]\n\texcept KeyError:\n\t\tt[q[i]] = 1\n\t\ttemp = 0\n\tans[i] = ans[i+1] + (1 if not temp else 0)\nout = []\nfor i in range(m):\n\tl = int(input())\n\tout.append(ans[l-1])\nprint(\"\\n\".join(map(str, out)))\n\t \t\t\t \t \t \t \t\t\t \t\t\t \t \t", "num, n = map(int, input().split())\r\nnumber = []\r\nresult = [0]*num\r\ndone = set()\r\nnumber = number+list(map(int, input().split()))\r\nfor i in range(1, num+1):\r\n if number[-i] not in done:\r\n result[-i] = result[-i+1] + 1\r\n else:\r\n result[-i] = result[-i+1]\r\n done.add(number[-i])\r\nfor j in range(n):\r\n print(result[int(input())-1])\r\n", "n, m = map(int, input().split())\r\nnum_lis = list(map(int, input().split()))\r\n\r\ndistinct_count = {}\r\nresult = []\r\n\r\nfor i in range(n-1, -1, -1):\r\n distinct_count[num_lis[i]] = True\r\n result.append(len(distinct_count))\r\n\r\nresult.reverse()\r\n\r\nfor i in range(m):\r\n li = int(input())\r\n print(result[li-1])\r\n", "n, m=map(int, input().split())\r\na=input().split()\r\nb=set()\r\n\r\nfor i in range(n):\r\n b.add(a[~i])\r\n a[~i] = len(b)\r\n \r\nfor _ in ' ' * m:\r\n print(a[int(input())-1])", "N, M = map(int,input().split()); S = list(map(int,input().split())); res, dist = [0] * (N + 1), set()\r\nfor i in range(N-1, -1, -1): dist.add(S[i]); res[i] = len(dist)\r\nfor _ in range(M): Q = int(input()); print(res[Q-1])", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nb = [1]\r\ns = set()\r\ns.add(a[0])\r\n\r\nfor i in range(1, n):\r\n\tif a[i] not in s:\r\n\t\tb.append(b[i-1] + 1)\r\n\t\ts.add(a[i])\r\n\telse:\r\n\t\tb.append(b[i-1])\r\n\r\n\r\nfor _ in range(m):\r\n\tx = int(input())\r\n\tprint(b[n-x])", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\n\r\nprefix_distincts = [0] * n\r\nvisited = set()\r\n\r\nfor i in range(n - 1, -1, -1):\r\n visited.add(a[i])\r\n prefix_distincts[i] = len(visited)\r\n\r\nfor i in range(m):\r\n l = int(input()) - 1\r\n print(prefix_distincts[l])\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n# 反向遍历\nchecklist = reversed(a)\nnumset = set()\nreslist = []\nfor k in checklist:\n numset.add(k)\n reslist.append(len(numset))\nfor i in range(m):\n print(reslist[n - int(input())])\n", "from sys import stdin, stdout\r\n\r\n\r\ndef main():\r\n m, n = map(int, stdin.readline().split())\r\n a = [int(v) for v in stdin.readline().split()]\r\n l = [int(v) for v in stdin.readlines()]\r\n res, ans = [], []\r\n d = set()\r\n \r\n for e in reversed(a):\r\n d.add(e)\r\n res.append(len(d))\r\n\r\n for e in l:\r\n ans.append(str(res[m-e]))\r\n\r\n stdout.write('\\n'.join(ans) + '\\n')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "tamanho, entradas = map(int, input().split())\narray = list(map(int, input().split()))\naux = [0] * tamanho\nultima_ocorrencia = {}\n\nfor i in range(tamanho-1, -1, -1):\n if i == tamanho-1:\n aux[i] = 1\n ultima_ocorrencia[array[i]] = i\n elif array[i] not in ultima_ocorrencia:\n aux[i] = aux[i+1] + 1\n ultima_ocorrencia[array[i]] = i\n else:\n aux[i] = aux[i+1]\n\nfor i in range(entradas):\n num = int(input())\n print(aux[num-1])\n\n\n\t\t \t\t \t \t \t\t\t\t\t\t \t \t \t \t \t", "n,m = map(int,input().split())\r\nresult = [0] * (n+1)\r\ndis_num = set()\r\nnums = list(map(int,input().split()))[::-1]\r\nfor i in range(1,n+1):\r\n dis_num.add(nums[i-1])\r\n result[i] = len(dis_num)\r\nfor _ in range(m):\r\n print(result[n-int(input())+1])\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\ni=1\r\ns=0\r\nfor tot_num in B:\r\n tot_num-=s\r\n while i<=n:\r\n if tot_num<=A[i-1]:\r\n j=tot_num\r\n break\r\n else:\r\n tot_num-=A[i-1] \r\n s+=A[i-1]\r\n i+=1\r\n print(i,j)\r\n\r\n\r\n\r\n#from collections import Counter\r\nn,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nfor _ in range(m):\r\n #C=[]\r\n #j=0\r\n l=int(input())\r\n #print(len(Counter(A[l-1:])))\r\n #for i in range(l-1,n):\r\n # if A[i] not in C:\r\n # C.append(A[i])\r\n # j+=1\r\n #print(len(set(A[l-1:])))\r\n\r\n\r\nn,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=[]\r\nfor _ in range(m):\r\n B.append(int(input()))\r\n\r\n#D=sorted(B,reverse=True)\r\nd=[0]*m\r\nC=[]\r\nj=0\r\ni=n-1\r\n#for l in D:\r\nfor king in range(m): #l is B[-king-1]\r\n while i>=B[-king-1]-1:\r\n if A[i] not in C:\r\n C.append(A[i])\r\n j+=1\r\n i-=1\r\n d[-king-1]=j\r\nfor l in d:\r\n print(l)\"\"\"\r\n\r\n\r\n\r\n# Read input values\r\nn, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\nqueries = []\r\nfor _ in range(m):\r\n queries.append(int(input()))\r\nans=[]\r\n\r\nd=set()\r\nfor i in range(n):\r\n d.add(array[-i-1])\r\n ans.append(len(d))\r\nfor l in queries:\r\n print(ans[-l])\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndp=[0]*n\r\nt={}\r\nfor i in range(n-1,-1,-1):\r\n if a[i] not in t:\r\n t[a[i]]=1\r\n else:\r\n t[a[i]]+=1\r\n dp[i]=len(t)\r\nfor i in range(m):\r\n l=int(input())\r\n print(dp[l-1])", "# 2300012142 林烨\r\nn,m = map(int,input().split())\r\narray = [int(i) for i in input().split()]\r\na = [0]*100001\r\na_count = []\r\nout = 0\r\nfor i in array[::-1]:\r\n if not a[i]:\r\n out += 1\r\n a[i] = 1\r\n a_count.append(out)\r\n\r\nfor i in range(m):\r\n x = int(input())\r\n print(a_count[n-x])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncontador = [0] * n\r\n\r\nconjunto = set()\r\n\r\nfor i in range(n-1, -1, -1):\r\n conjunto.add(a[i])\r\n contador[i] = len(conjunto)\r\n\r\nfor i in range(m):\r\n l = int(input()) - 1\r\n print(contador[l])", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n \r\naux = set()\r\ndp = [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n aux.add(arr[i])\r\n dp[i] = len(aux)\r\n \r\nfor i in range(m):\r\n j = int(input()) - 1\r\n print(dp[j])\r\n", "n, m = map(int, input().split())\n\nnumbers = list(map(int, input().split()))\n\ns = set()\nunique = [0] * n\n\nindecies = [0] * m\n\nfor i in range(m):\n indecies[i] = int(input()) - 1\n\nfor i in range(n-1, -1, -1):\n s.add(numbers[i])\n unique[i] = len(s)\n\n\nfor i in range(m):\n print(unique[indecies[i]])\n\n\t\t \t\t \t\t \t\t \t\t\t \t\t\t\t\t", "def solution():\n n,m = map(int, input().split())\n arr = list(map(int, input().split()))\n _set = set()\n for i in range(len(arr))[::-1]:\n _set.add(arr[i])\n arr[i] = len(_set)\n\n for _ in range(m):\n val = int(input())\n print(arr[val - 1])\n \n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\nmain()\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\noutput = []\r\nmain_set = set()\r\noutput1 = {}\r\n\r\nfor i in range(m):\r\n output.append(int(input()))\r\n\r\nfor i in reversed(range(len(a))):\r\n main_set.add(a[i])\r\n output1[i] = len(main_set)\r\n\r\nfor i in output:\r\n print(output1[i-1])\r\n", "n,m=list(map(int,input().split()))\r\nj=list(map(int,input().split()))\r\nq={}\r\nk=set()\r\nfor i in range(len(j)-1,-1,-1):\r\n k.add(j[i])\r\n q[i]=len(k)\r\nfor i in range(m):\r\n h=int(input())\r\n print(q[h-1])", "n, m = map(int,input().split())\r\na = input().split()\r\nb = set()\r\nfor i in range(n):\r\n b.add(a[n-i-1])\r\n a[n-i-1]=len(b)\r\nfor j in range(m):\r\n print(a[int(input())-1])", "'''10 10\r\n1 2 3 4 1 2 3 4 100000 99999\r\n1\r\n2\r\n3\r\n4\r\n5\r\n6\r\n7\r\n8\r\n9\r\n10\r\n'''\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))[::-1]\r\ns=set()\r\nout=[]\r\n\r\nfor i in a:\r\n\ts.add(i) # ignore duplicate elements If found any duplicate \r\n\tout.append(len(s)) #length of the unique elements \r\n\t\r\nfor j in range(m):\r\n\tt=int(input())\r\n\tprint(out[n-t]) # output index for unique elements ", "n,m=map(int,input().split())\r\nll=list(map(int,input().split()))\r\nc=[]\r\ns=set()\r\nfor i in range(n)[::-1]:\r\n s.add(ll[i])\r\n c.append(len(s))\r\nfor i in range(m):\r\n l=int(input())\r\n print(c[-l])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * n\r\ndistinct = set()\r\nfor i in range(n-1, -1, -1):\r\n distinct.add(a[i])\r\n count[i] = len(distinct)\r\n\r\nfor i in range(m):\r\n l = int(input()) - 1\r\n print(count[l])", "n,m = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nused = set({ai[-1]})\r\nl1 = []\r\nfor i in range(n):\r\n l1.append(0)\r\nl1[-1]=1\r\nfor i in range(1,n):\r\n if ai[-i-1] in used:\r\n l1[-i-1]=l1[-i]\r\n else:\r\n l1[-i-1]=l1[-i]+1\r\n used.add(ai[-i-1])\r\nfor i in range(m):\r\n l = int(input())\r\n print(l1[l-1])", "n,m=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nc=set()\r\nb=0\r\ndp=[]\r\nfor i in reversed(a):\r\n if i not in c:\r\n c.add(i)\r\n b+=1\r\n dp.append(b)\r\nfor i in range(m):\r\n l=int(input())\r\n pos=n-l\r\n print(dp[pos])\r\n", "n,m = map(int,input().split())\r\nlst = input().split()\r\nb = set()\r\ndp = [0]*(n)\r\nfor i in range(n):\r\n b.add(lst[~i])\r\n dp[~i] = len(b)\r\nfor _ in range(m):\r\n print(dp[int(input())-1])\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))[::-1]\r\ns, res = set(), [0] * n\r\nfor i in range(n):\r\n s.add(arr[i])\r\n res[i] = len(s)\r\nfor i in range(m):\r\n print(res[n - int(input())])", "n,m=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\ns=set()\r\ndp=[0]*(n+1)\r\nfor i in range(n-1,-1,-1):\r\n if l[i] not in s:\r\n s.add(l[i])\r\n dp[i+1]=1\r\nfor i in range(n,0,-1):\r\n dp[i-1]+=dp[i]\r\nfor i in range(m):\r\n a=int(input())\r\n print(dp[a])", "n,m = map(int,input().split())\r\naList=list(map(int,input().split()))\r\nlList = []\r\nfor i in range(m):\r\n lList.append(int(input()))\r\n \r\nsum = list(map(lambda x: 0, range(100000)))\r\n# dic1都是用于统计每个数字出现次数的字典\r\ndic1 = {}\r\ncnt=0\r\n# 如果没有字典中就添加，有在字典中就value+1\r\nfor i in aList:\r\n if i not in dic1:\r\n cnt = cnt + 1\r\n dic1[i] = 1\r\n else:\r\n dic1[i] = dic1[i]+1\r\n\r\n# print(dic1)\r\n# print(dic2)\r\n# 计算第1个\r\ndic1[aList[0]] = dic1[aList[0]] -1\r\nsum[0]=cnt\r\n\r\n# sum值计算\r\nfor i in range(1,n):\r\n # 因为此时aList[i-1] 没有在接下来的区间中出现\r\n if (dic1[aList[i-1]] == 0):\r\n sum[i] = sum[i-1] - 1\r\n dic1[aList[i]] = dic1[aList[i]]-1\r\n else: # 说明在接下来的区间中还会出现，那么我们直接继承 sum[i-1] 即可\r\n sum[i] = sum[i-1]\r\n dic1[aList[i]] = dic1[aList[i]]-1\r\n\r\n# print(sum)\r\n\r\nresult = []\r\nfor i in lList:\r\n result.append(str(sum[i-1]))\r\n # print(sum[i-1])\r\n\r\n# 数组转为字符串，用join输出\r\nprint(\"\\n\".join(result))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\ndp=[1]\r\nmat=[]\r\nfor i in range(0,100001):\r\n\tmat.append(0)\r\nmat[l[0]]=1\r\nfor i in range(1,n):\r\n\tif mat[l[i]]==0:\r\n\t\tdp.append(dp[i-1]+1)\r\n\t\tmat[l[i]]=1\r\n\telse:\r\n\t\tdp.append(dp[i-1])\r\ndp.reverse()\r\nfor i in range(0,m):\r\n\ta=int(input())\r\n\tprint(dp[a-1])\r\n\t\r\n", "\r\ndef main():\r\n n, m = list(map(int, input().split()))\r\n dp = [0] * n\r\n a = list(map(int, input().split()))\r\n tmp = set()\r\n for i in range(n-1, -1, -1):\r\n tmp.add(a[i])\r\n dp[i] = len(tmp)\r\n\r\n for i in range(m):\r\n l = int(input())\r\n l -= 1\r\n print(dp[l])\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "(n, m) = map(int, input().rstrip().split())\narr = list(map(int, input().rstrip().split()))\ntests = []\n\nhm1 = {}\nbois = [0 for _ in range(m)]\n\nfor i in range(m):\n tests.append(int(input()))\n hm1[tests[-1]] = i\n bois[i] = tests[-1]\n \n\n\ntests.sort()\nres = [0 for _ in range(m)]\nprev = n\nstore = set()\nwhile (tests):\n curr = tests.pop()\n\n for i in arr[curr-1:prev]:\n store.add(i)\n \n res[hm1[curr]] = len(store)\n prev = curr\n\nfor i in range(m):\n print(res[hm1[bois[i]]])\n\n\n\n\n\n\n\n", "n,m = map(int,input().split())\r\naList =list(map(int,input().split()))\r\naList = [0] + aList\r\n\r\n\r\nlList = []\r\nfor i in range(m):\r\n lList.append(int(input()))\r\n\r\n\r\ndpList = [0] * (n+1)\r\nnumList = [0] * (100000+1)\r\n\r\ndpList[n] = 1\r\nnumList[aList[n]] = 1\r\n\r\nfor i in range(n-1,0,-1):\r\n dpList[i] = dpList[i+1] + 1 - numList[aList[i]]\r\n numList[aList[i]] = 1\r\n\r\n\r\nresult = []\r\nfor loc in lList:\r\n result.append(str(dpList[loc]))\r\n\r\n# 数组转为字符串，用join输出\r\nprint(\"\\n\".join(result))", "n, m = map(int, input().split(\" \"))\r\narr = list(map(int, input().split(\" \")))\r\nelements = set()\r\ndp = [0 for i in range(n)]\r\nfor j in reversed(range(n)):\r\n elements.add(arr[j])\r\n dp[j] = len(elements)\r\nfor i in range(m):\r\n l = int(input())\r\n print(dp[l-1])\r\n", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nquery = []\r\nsetQuery = set()\r\nfor i in range(m):\r\n q = int(input())\r\n query.append(q)\r\n setQuery.add(q)\r\nHash = {}\r\nunique =set()\r\n\r\nfor i in range(n-1, -1, -1):\r\n unique.add(a[i])\r\n if i+1 in setQuery:\r\n Hash[i+1] = len(unique)\r\n\r\nfor i in query:\r\n print(Hash[i])", "n,m=map(int,input().split())\na=input().split()\nb=set()\nfor i in range(n-1,-1,-1):\n b.add(a[i])\n a[i]=str(len(b))\nfor i in range (m):\n print(a[int(input())-1])\n\t \t\t \t\t \t\t\t \t\t \t\t\t\t \t\t\t \t\t \t", "n , m = map(int , input().split())\r\narr = list(map(int , input().split()))\r\nbrr = [1]*n\r\njh = {arr[n-1]}\r\nfor _ in range(1,n):\r\n t = n-1-_\r\n if arr[t] in jh:\r\n brr[t] = brr[t+1]\r\n else:\r\n jh.add(arr[t])\r\n brr[t] = brr[t+1]+1\r\nfor i in range(m):\r\n l = int(input())\r\n print(brr[l-1])\r\n", "n,m=map(int,input().split())\r\narray=[int(i) for i in input().split()]\r\n\r\nbiao=[True for i in range(100001)]\r\nbiao[array[n-1]]=False\r\ndp=[0]*(n-1)+[1]\r\n\r\nfor i in reversed(range(n-1)):\r\n if biao[array[i]]==False:\r\n dp[i]=dp[i+1]\r\n else:\r\n dp[i]=dp[i+1]+1\r\n biao[array[i]]=False\r\n\r\nfor _ in range(m):\r\n l=int(input())\r\n print(dp[l-1])\r\n", "n,m = map(int,input().split())\r\nL = list(map(int,input().split()))\r\ndistinct = set()\r\nl = 0\r\ncnt = [0] * n\r\nfor i in range(n-1,-1,-1):\r\n if not(L[i] in distinct):\r\n distinct.add(L[i])\r\n l += 1\r\n cnt[i] = l\r\nfor _ in range(m):\r\n i = int(input())\r\n print(cnt[i - 1])", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nl = [0]*(n+1)\r\nno_repeat = set()\r\nfor i in range(n-1, -1, -1):\r\n l[i] = l[i+1]\r\n if a[i] not in no_repeat:\r\n l[i] += 1\r\n no_repeat.add(a[i])\r\nfor i in range(m):\r\n print(l[int(input())-1])", "s = set()\r\nn = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = []\r\nfor i in range(n[0]-1,-1,-1):\r\n s.add(b[i])\r\n b[i] = len(s)\r\nfor i in range(n[1]):\r\n print(b[int(input())-1])\r\n \r\n", "n,m=map(int,input().split())\r\narray=[int(x) for x in input().split()]\r\nanswer=[0]*n\r\ns=set()\r\nfor i in range(n):\r\n s.add(array[~i])\r\n answer[~i]=len(s)\r\nfor t in range(m):\r\n print(answer[int(input())-1])", "n,m = map(int,input().split())\r\nnumber = list(map(int,input().split()))\r\na = set()\r\nans = []\r\nfor i in range(n-1,-1,-1):\r\n if number[i] not in a:\r\n a.add(number[i])\r\n number[i] = len(a)\r\nfor i in range(m):\r\n ans.append(number[int(input())-1])\r\nfor i in ans:\r\n print(i)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 25 21:20:09 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nls = list(map(int,input().split()))\r\n\r\ns = [0]*100007\r\nvalue = [0]*100007\r\nfor j in range(n-1,-1,-1) :\r\n if s[ls[j]] == 0 :\r\n s[ls[j]] = 1\r\n value[j] = value[j+1]+1\r\n else:\r\n value[j] = value[j+1]\r\n\r\nend = []\r\nfor i in range(m) :\r\n l = int(input())\r\n end.append(value[l-1])\r\nfor _ in end :\r\n print(_)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[0]*n\r\ns=set()\r\nfor i in range(n):\r\n s.add(a[-1-i])\r\n l[-1-i]=len(s)\r\nfor _ in range(m):\r\n print(l[int(input())-1])", "n, m = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nd = {}\r\nans = []\r\nnum = 0\r\nfor i in range(n-1, -1, -1):\r\n if lst[i] in d.keys():\r\n ans.append(num)\r\n else:\r\n num += 1\r\n d[lst[i]] = 1\r\n ans.append(num)\r\nfor i in range(m):\r\n index = int(input())\r\n print(ans[n - index])", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ndp = [0] * (n+1)\r\ndp[0] = len(list(set(arr)))\r\ndistinct = defaultdict(int)\r\nfor i in range(n):\r\n distinct[arr[i]] += 1\r\nfor i in range(n):\r\n distinct[arr[i]] -= 1\r\n if not distinct[arr[i]]:\r\n distinct[arr[i]] = True\r\n dp[i+1] = dp[i] - 1\r\n else:\r\n dp[i+1] = dp[i]\r\nfor i in range(m):\r\n x = int(input())\r\n print(dp[x-1])\r\n ", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nans = [0]*n\r\ns = set()\r\nfor i in range(n-1, -1, -1):\r\n s.add(a[i])\r\n ans[i] = len(s)\r\nfor _ in range(m): \r\n print(ans[int(input())-1])", "n,m = [int(a) for a in input().split()]\r\nli = [int(x) for x in input().split()]\r\ns = set()\r\nc = 0\r\nlis = []\r\nfor i in range(1,n+1):\r\n if li[-i] not in s:\r\n c = c+1\r\n s.add(li[-i])\r\n lis.append(c)\r\nfor i in range(m):\r\n ans = n-int(input())\r\n print(lis[ans])", "# 2300012142 林烨\r\nn,m = map(int,input().split())\r\narray = list(map(int,input().split()))\r\na = set()\r\na_count = []\r\nout = 0\r\nfor i in array[::-1]:\r\n if i not in a:\r\n a.add(i)\r\n out += 1\r\n a_count.append(out)\r\n\r\nfor i in range(m):\r\n x = int(input())\r\n print(a_count[n-x])", "n, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nM = {}\r\nfor a in A:\r\n M[a] = 0\r\nB = []\r\ns = 0\r\nfor i in range(n):\r\n if M[A[n-1-i]] == 0:\r\n M[A[n-1-i]] = 1\r\n s += 1\r\n B.append(s)\r\n else:\r\n B.append(s)\r\nB.reverse()\r\nfor i in range(m):\r\n l_i = int(input())\r\n print(B[l_i-1])\r\n", "\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n \r\ns = set()\r\nans = [0] * n\r\n \r\nfor i in range(n-1, -1, -1):\r\n s.add(arr[i])\r\n ans[i] = len(s)\r\n \r\nfor _ in range(m):\r\n l = int(input())\r\n print(ans[l-1])", "n,m=map(int,input().split())\nL=list(map(int,input().split()))\nD=[0]*n\na=set()\nfor i in range(n-1,-1,-1):\n a.add(L[i])\n D[i]=len(a)\nfor i in range(m):\n k=int(input())-1\n print(D[k])", "def solution():\r\n n,m = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n s = set()\r\n ans = [0] * n\r\n for i in range(n-1,-1,-1):\r\n s.add(a[i])\r\n ans[i] = len(s)\r\n for i in range(m):\r\n x = int(input())\r\n print(ans[x-1])\r\nsolution()", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set()\r\nl = []\r\n\r\nfor i in range(n-1, -1, -1):\r\n s.add(a[i])\r\n l.append(len(s))\r\n\r\nl = l[::-1]\r\n\r\nfor _ in range(m):\r\n print(l[int(input()) - 1])\r\n \r\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))[::-1]\r\narr2=[]\r\ns=set()\r\nfor j in arr:\r\n s.add(j)\r\n arr2.append(len(s))\r\narr2=arr2[::-1]\r\n\r\nfor i in range(m):\r\n print(arr2[int(input())-1])", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\nn,m = map(int,input().split())\r\nnum_list = list(map(int,input().split()))\r\noriginal_list = []\r\nfor i in range(m):\r\n original_list.append(int(input()))\r\ntimes_list = []\r\nnum_dict = {}\r\nl = n - 1\r\nadd_up = 0\r\nwhile l >= 0:\r\n if num_list[l] not in num_dict:\r\n num_dict[num_list[l]] = 1\r\n add_up += 1\r\n times_list.append(add_up)\r\n l -= 1\r\n\r\nfor i in original_list:\r\n print(times_list[-i])", "n,m = map(int,input().split())\r\nli = [int(a) for a in input().split()]\r\nsett = set()\r\nfor i in range(1,n+1):\r\n sett.add(li[n-i])\r\n li[n - i] = len(sett)\r\nfor _ in range(m):\r\n print(li[int(input())-1])", "#Q\nn, m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nd = set()\nt = [0]*n\nc = int(0)\nfor i in range(n-1, -1, -1):\n if (a[i] not in d):\n d.add(a[i])\n c+=1\n t[i]=c\nfor i in range(m):\n l = int(input())\n print(t[l-1])\n\t \t\t \t \t\t\t \t \t\t \t\t", "n, m = [int(i) for i in input().split()]\r\nns = [int(i) for i in input().split()]\r\nset_ns = set()\r\nres = []\r\n\r\n# add to a set rare to front\r\nx = 0\r\nfor i in range(len(ns) - 1, -1, -1):\r\n if ns[i] not in set_ns:\r\n x += 1\r\n set_ns.add(ns[i])\r\n res.append(x)\r\n\r\nres.append(x)\r\nfor i in range(m):\r\n mm = int(input())\r\n print(res[n - mm])", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ndp=[0 for i in range(100000)]\r\nl=[]\r\nans=[]\r\nfor i in range(n):\r\n dp[lst[i]-1]+=1\r\n\r\n \r\ni=0;\r\noutput=len(set(lst))\r\n\r\nwhile i<n :\r\n dp[lst[i]-1]-=1\r\n ans.append(output)\r\n if dp[lst[i]-1]==0:\r\n output-=1\r\n i+=1\r\n \r\nfor _ in range(m):\r\n a=int(input())\r\n print(ans[a-1])", "n,m = map(int,input().split())\r\nque = list(map(int,input().split()))\r\ndif = [0]*n\r\ns = set()\r\ncnt = 0\r\nfor i in range(n-1,-1,-1):\r\n if que[i] not in s:\r\n s.add(que[i])\r\n cnt+=1\r\n dif[i]=cnt\r\nfor _ in range(m):\r\n index = int(input())\r\n print(dif[index-1])", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ns = {arr[-1]}\r\nanswer = {}\r\nrec = 1\r\nanswer[n] = 1\r\nfor i in range(n - 2, -1, -1):\r\n if arr[i] not in s:\r\n s.add(arr[i]) #向set中添加元素\r\n rec += 1\r\n answer[i + 1] = rec\r\n else:\r\n answer[i + 1] = rec\r\n\r\nfor ii in range(m):\r\n a = int(input())\r\n print(answer[a])", "n,m=map(int,input().split())\r\na=input().split()\r\nx=set()\r\nfor i in range(n-1,-1,-1):\r\n x.add(a[i])\r\n a[i]=len(x)\r\nfor i in range(m):\r\n print(a[int(input())-1])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()));l=set()\r\nfor i in range(n):\r\n l.add(a[n-i-1])\r\n a[n-i-1]=len(l)\r\nfor j in range(m):\r\n print(a[int(input())-1])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nnum = [0]*n\r\ns = set()\r\nfor i in range(n-1, -1, -1):\r\n s.add(a[i])\r\n num[i] = len(s)\r\nfor i in range(m):\r\n c=int(input())\r\n print(num[c-1])", "def count_distinct_numbers(n, m, array, positions):\n distinct_counts = []\n distinct_numbers = set()\n \n for i in range(n - 1, -1, -1):\n distinct_numbers.add(array[i])\n distinct_counts.append(len(distinct_numbers))\n \n distinct_counts.reverse()\n \n result = []\n for position in positions:\n result.append(distinct_counts[position - 1])\n \n return result\n\n# Read input values\nn, m = map(int, input().split())\narray = list(map(int, input().split()))\npositions = [int(input()) for _ in range(m)]\n\n# Calculate the distinct counts for each position\nresult = count_distinct_numbers(n, m, array, positions)\n\n# Print the results\nfor count in result:\n print(count)\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\na = [int(i) for i in input().split()]\r\ntime = [0]*(10**5+1)\r\ndp = [0]*n\r\ndp[n-1] = 1\r\ntime[a[n-1]]=1\r\nfor i in range(n-2,-1,-1):\r\n if time[a[i]] == 0:\r\n time[a[i]] = 1\r\n dp[i] = dp[i+1]+1\r\n else:\r\n dp[i] = dp[i+1]\r\nfor i in range(m):\r\n print(dp[int(input())-1])", "#王天,2300011878\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount = 0\r\nanss = []\r\nt = set()\r\nfor i in reversed(a):\r\n if i not in t:\r\n count += 1\r\n t.add(i)\r\n anss.append(count)\r\nfor _ in range(m):\r\n print(anss[len(a) - int(input())])", "R=lambda:map(int,input().split());a,b=R();A=[*R()];B=set()\r\nfor i in range(a-1,-1,-1):B.add(A[i]);A[i]=len(B)\r\nfor _ in range(b):print(A[int(input())-1])", "n, m = map(int, input().split());\r\na = input().split();\r\nb = set()\r\nfor i in range(n): b.add(a[~i]);a[~i] = len(b)\r\nfor _ in [0] * m: print(a[int(input()) - 1])", "n,m=input().split()\r\nn=int(n);m=int(m)\r\narray=list(int(k) for k in input().split())\r\nseen=set()\r\nans=[0]*n\r\nfor i in range(n-1,-1,-1):\r\n seen.add(array[i])\r\n ans[i]=len(seen)\r\nfor j in range(m):\r\n print(ans[int(input())-1])", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=[0]*n\r\nnum=set()\r\nans[n-1]=1\r\nnum.add(arr[n-1])\r\nfor i in range(n-1):\r\n if arr[n-i-2] not in num:\r\n ans[n-i-2]=ans[n-i-1]+1\r\n num.add(arr[n-i-2])\r\n else:\r\n ans[n - i - 2] = ans[n - i - 1]\r\nfor i in range(m):\r\n print(ans[int(input())-1])\r\n\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndp = [1]*(n+1)\r\nnum = set()\r\nnum.add(a[-1])\r\nfor i in range(n-2,-1,-1):\r\n if a[i] in num:\r\n temp = 0\r\n else:\r\n temp = 1\r\n num.add(a[i])\r\n dp[i+1] = dp[i+2] +temp\r\nfor _ in range(m):\r\n l = int(input())\r\n print(dp[l])\r\n\r\n", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\nfrom functools import lru_cache\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# sys.stdin = open('input.txt')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\n\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\n\r\n\r\n@lru_cache(None)\r\ndef daa(n):\r\n ct = 0\r\n for x in range(1, int(pow(n, 0.5)) + 1):\r\n if n % x == 0:\r\n ct += 1\r\n if x != n // x:\r\n ct += 1\r\n return ct\r\nn,m=mn()\r\nl=ll()\r\n\r\nk=l[::-1]\r\nne=[0]*(n+1)\r\nd=set()\r\nfor x in range(1,n+1):\r\n if k[x-1] not in d:\r\n ne[x]=ne[x-1]+1\r\n d.add(k[x-1])\r\n else:\r\n ne[x] = ne[x - 1]\r\nne=ne[::-1]\r\nfor x in range(m):\r\n a=nt()\r\n print(ne[a-1])", "n,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ndic = {}\r\ns_t = set()\r\n# s_t.add(2)\r\n# print(s_t,len(s_t))\r\nfor i in range(n-1,-1,-1):\r\n s_t.add(arr[i])\r\n if dic.get(i,-1) == -1:\r\n dic[i] = len(s_t)\r\n\r\nwhile m>0:\r\n i = int(input())\r\n print(dic[i-1]) \r\n m -= 1", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[0]*(100001)\r\nc=[0]*(n+2)\r\nl=0\r\nfor i in range(n):\r\n if b[a[n-1-i]]==0:\r\n b[a[n-1-i]]=1\r\n c[n-i]=c[n-i+1]+1\r\n else:\r\n c[n-i]=c[n-i+1]\r\nfor i in range(m):\r\n print(c[int(input())])", "\"\"\"n,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\ni=1\r\ns=0\r\nfor tot_num in B:\r\n tot_num-=s\r\n while i<=n:\r\n if tot_num<=A[i-1]:\r\n j=tot_num\r\n break\r\n else:\r\n tot_num-=A[i-1] \r\n s+=A[i-1]\r\n i+=1\r\n print(i,j)\r\n\r\n\r\n\r\n#from collections import Counter\r\nn,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nfor _ in range(m):\r\n #C=[]\r\n #j=0\r\n l=int(input())\r\n #print(len(Counter(A[l-1:])))\r\n #for i in range(l-1,n):\r\n # if A[i] not in C:\r\n # C.append(A[i])\r\n # j+=1\r\n #print(len(set(A[l-1:])))\r\n\r\n\r\nn,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=[]\r\nfor _ in range(m):\r\n B.append(int(input()))\r\n\r\n#D=sorted(B,reverse=True)\r\nd=[0]*m\r\nC=[]\r\nj=0\r\ni=n-1\r\n#for l in D:\r\nfor king in range(m): #l is B[-king-1]\r\n while i>=B[-king-1]-1:\r\n if A[i] not in C:\r\n C.append(A[i])\r\n j+=1\r\n i-=1\r\n d[-king-1]=j\r\nfor l in d:\r\n print(l)\"\"\"\r\n\r\ndef distinct_numbers(n, m, array, queries):\r\n answer = []\r\n distinct_nums = {}\r\n \r\n for i in range(n-1, -1, -1):\r\n distinct_nums[array[i]] = True\r\n answer.append(len(distinct_nums))\r\n \r\n answer.reverse() # Reverse the answer list to match the order of queries\r\n \r\n for query in queries:\r\n print(answer[query-1])\r\n\r\n# Read input values\r\nn, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\nqueries = []\r\nfor _ in range(m):\r\n queries.append(int(input()))\r\n\r\n# Solve the problem\r\ndistinct_numbers(n, m, array, queries)\r\n \r\n", "n, m = map(int, input().split())\r\narray = [int(i) for i in input().split()]\r\ndif = set()\r\nanswers = []\r\nfor i in range(n)[::-1]:\r\n dif.add(array[i])\r\n answers.append(len(dif))\r\nfor i in range(m):\r\n question = int(input())\r\n print(answers[-question])", "n,m=map(int,input().split());a=input().split();b=set()\r\nfor i in range(n):b.add(a[~i]);a[~i]=len(b)\r\nfor _ in [0]*m:print(a[int(input())-1])", "# https://codeforces.com/problemset/problem/368/B\n\nseen = set()\nn, m = input().split(\" \")\nn = int(n)\nm = int(m)\nvalues = input().split(\" \")\nresult = [0] * len(values)\n\nfor i in range(len(values) - 1, -1, -1):\n v = values[i]\n seen.add(v)\n result[i] = len(seen)\n\nfor _ in range(m):\n index = int(input()) - 1\n print(result[index])", "n,m =list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nl=[int(input()) for _ in range(m)]\r\ndictionary={}\r\ncount=[0]*n\r\nfor i,j in enumerate(reversed(a)):\r\n dictionary[j]=1\r\n count[n-i-1]=len(dictionary)\r\nfor i in l:\r\n print(count[i-1])", "n, m = map(int, input().split())\r\nchart = input().split()\r\na = set()\r\nfor i in range(n):\r\n a.add(chart[n-i-1])\r\n chart[n-i-1] = len(a)\r\nfor i in range(m):\r\n l = int(input())\r\n print(chart[l-1])", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nans=[0]\r\naa=set()\r\nfor l in range(1,n+1):\r\n if not a[-l] in aa:\r\n ans.append(ans[-1]+1)\r\n aa.add(a[-l])\r\n else:\r\n ans.append(ans[-1])\r\nfor k in range(m):\r\n print(ans[-int(input())])", "import sys\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\nn,m=mapin()\r\na=list(mapin())\r\nmp=[0]*100001\r\nx=[0]*n\r\nc=0\r\nfor i in range(n-1,-1,-1):\r\n if mp[a[i]]==0:\r\n c+=1\r\n mp[a[i]]=1\r\n x[i]=c\r\nfor i in range(m):\r\n l=int(input())\r\n print(x[l-1])", "n,m=map(int,input().split())\r\nass=list(map(int,input().split()))\r\npro={}\r\nfor i in range(n):\r\n pro[ass[i]]=i\r\ncha=tuple(pro.values())\r\nre=[0]*n\r\nfor i in cha:\r\n re[i]=1\r\nres=[1]*n\r\nfor i in range(2,n+1):\r\n if re[-i]:\r\n res[-i]=res[-i+1]+1\r\n else:\r\n res[-i]=res[-i+1]\r\nfor i in range(m):\r\n l=int(input())\r\n print(res[l-1])", "n,m=map(int,input().split())\r\narray=list(map(int,input().split()))\r\n\r\ndp=[]\r\ntempt=set()\r\nfor i in range(n):\r\n check=array[n-1-i]\r\n tempt.add(check)\r\n dp.append(len(tempt))\r\n\r\nAns=[]\r\nfor i in range(m):\r\n l=int(input())\r\n Ans.append(dp[n-l])\r\n\r\nfor i in Ans:\r\n print(i)", "n,m=map(int,input().split( ))\r\nl=[int(x) for x in input().split( )]\r\n\r\ncount = 0\r\ndp = []\r\nset1 = set()\r\nans = []\r\n\r\nfor a in reversed(l):\r\n if a not in set1:\r\n set1.add(a)\r\n count += 1\r\n dp.append(count)\r\n\r\nfor b in range(m):\r\n temp = len(l)-int(input())\r\n ans.append(dp[temp])\r\n\r\nfor c in ans:\r\n print(c)", "from collections import defaultdict\r\n\r\nn,m = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\ncheck = defaultdict(bool)\r\nans = [0]*(n+1)\r\n\r\nfor i in range(n-1,-1,-1):\r\n now = nums[i]\r\n if not check[now]:\r\n ans[i] = ans[i+1] + 1\r\n check[now] = True\r\n elif check[now]:\r\n ans[i] = ans[i+1]\r\n\r\nfor i in range(m):\r\n l = int(input())\r\n print(ans[l-1])\r\n\r\n", "n,m=map(int,input().split())\r\nq=list(map(int,input().split()))\r\nc=dict()\r\nfor i in range(n):\r\n if q[i] in c.keys():\r\n q[c[q[i]]]=0\r\n c[q[i]]=i \r\nq1=[0]*(n-1)+[1]\r\nfor i in range(n-2,-1,-1):\r\n if q[i]:\r\n q1[i]=q1[i+1]+1\r\n else:\r\n q1[i]=q1[i+1]\r\nfor i in range(m):\r\n print(q1[int(input())-1])\r\n \r\n ", "n,m=map(int,input().split())\r\na=input().split()\r\nb=set()\r\nfor i in range(n):\r\n b.add(a[n-i-1])\r\n a[n-i-1]=len(b)\r\nfor _ in range(m):\r\n print(a[int(input())-1])", "n = list(map(int, input().split()))\r\nlista = list(map(int, input().split()))\r\n\r\nm = n[1]\r\n\r\nsetlist = set()\r\nresposta = []\r\nfor i in range(len(lista)):\r\n resposta.append(0)\r\n \r\n\r\ni = len(lista) - 1\r\nwhile(i >= 0):\r\n setlist.add(lista[i])\r\n resposta[i] = len(setlist)\r\n i-=1\r\n\r\nfor k in range(m):\r\n index = int(input()) - 1\r\n print(resposta[index])\r\n \r\n ", "n,m=list(map(int,input().split()))\r\nj=list(map(int,input().split()))\r\nq={}\r\nk={}\r\nfor i in range(len(j)-1,-1,-1):\r\n k[j[i]]=True\r\n q[i]=len(k)\r\nfor i in range(m):\r\n h=int(input())\r\n print(q[h-1])", "# https://codeforces.com/problemset/problem/368/B\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\na_set = set()\ncounts = []\nfor i in reversed(a):\n a_set.add(i)\n counts.append(len(a_set))\nfor _ in range(m):\n x = int(input())\n print(counts[n-x])\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 9 23:37:31 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\nn,m = [int(l) for l in input().split()]\r\nar = [int(l) for l in input().split()]\r\nc = [0] * max(ar)\r\nb = [0] * n\r\nnum = 0\r\n\r\nfor i in range(n - 1,-1,-1):\r\n if c[ar[i] - 1] == 0:\r\n num += 1\r\n c[ar[i] - 1] = 1\r\n b[i] = num\r\n\r\nfor i in range(m):\r\n print(b[int(input()) - 1])\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 27 21:35:53 2023\r\n\r\n@author: masiyu004\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=set()\r\ns=[0]*n\r\nfor j in range(n-1,-1,-1):\r\n b.add(a[j])\r\n s[j]=len(b)\r\nfor i in range(m):\r\n print(s[int(input())-1])\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndp=[0]\r\nset1=set()\r\nfor i in range(n):\r\n if l[n-1-i] in set1:\r\n dp.append(dp[-1])\r\n else:\r\n dp.append(dp[-1]+1)\r\n set1.add(l[n-1-i])\r\nfor j in range(m):\r\n l1=int(input())\r\n print(dp[n-l1+1])", "if __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n array = list(map(int, input().split()))\r\n s = set()\r\n\r\n for i in range(n - 1, -1, -1):\r\n s.add(array[i])\r\n array[i] = str(len(s))\r\n \r\n print(\"\\n\".join(array[int(input()) - 1] for i in range(m)))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 26 21:31:00 2023\r\n\r\n@author: 2000016913\r\n\"\"\"\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nq = [int(input()) for _ in range(m)]\r\nres = [0]*n\r\nd = set()\r\n\r\nfor i in range(n-1,-1,-1):\r\n d.add(a[i])\r\n res[i] = len(d)\r\n\r\nfor i in q:\r\n print(res[i-1])\r\n", "n,m = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\ndp = [0]*n\r\ns = set()\r\ndp[-1]=1\r\ns.add(l[-1])\r\nfor i in range(n-2,-1,-1):\r\n if l[i] not in s:\r\n dp[i]= dp[i+1]+1\r\n s.add(l[i])\r\n else:\r\n dp[i]=dp[i+1]\r\nfor j in range(m):\r\n k = int(input())\r\n print(dp[k-1])", "n, m = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\nexist = [0] * 100001\r\nans = [0] * n\r\ndistinct = 0\r\nfor i in range(n-1, -1, -1):\r\n if exist[num[i]] == 0:\r\n exist[num[i]] = 1\r\n distinct += 1\r\n ans[i] = distinct\r\nfor _ in range(m):\r\n l = int(input())\r\n print(ans[l-1])", "n, m = [int(_) for _ in input().split()]\r\n\r\narr = [int(_) for _ in input().split()]\r\n\r\nsuffix = [0]*n\r\ns = set()\r\nfor i in range(n-1,-1,-1):\r\n if arr[i] not in s:\r\n if i < n-1:\r\n suffix[i] = suffix[i+1]+1\r\n else:\r\n suffix[i] = 1\r\n else:\r\n suffix[i] = suffix[i+1]\r\n s.add(arr[i])\r\n\r\n\r\nfor _ in range(m):\r\n l = int(input())\r\n\r\n print(suffix[l-1])", "n,m = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nc=0\r\nd=[]\r\nt=set()\r\nfor i in reversed(l):\r\n if i not in t:\r\n c+=1 \r\n t.add(i)\r\n d.append(c)\r\nfor i in range(m):\r\n p=len(l)-int(input())\r\n print(d[p])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ne = set()\r\nfor i in range(n-1, -1, -1):\r\n e.add(a[i])\r\n a[i] = len(e)\r\nfor _ in range(m):\r\n print(a[int(input())-1])", "n,m=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nset1=set()\r\nlist2=[]\r\nfor i in range(-1,-1-n,-1):\r\n set1.add(list1[i])\r\n list2.append(len(set1))\r\nlist2.reverse()\r\nfor i in range(m):\r\n print(list2[int(input())-1])", "#刘乐天 2300012105 生命科学学院\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nunique_counts = [0] * n\r\nunique_set = set()\r\nfor i in range(n - 1, -1, -1):\r\n unique_set.add(a[i])\r\n unique_counts[i] = len(unique_set)\r\n\r\nfor _ in range(m):\r\n l = int(input())\r\n print(unique_counts[l - 1])\r\n", "n, m = [int(k) for k in input().split()]\r\narr = [int(k) for k in input().split()]\r\nq = []\r\nres, obj = [0] * len(arr), {}\r\n\r\n\r\nfor _ in range(m):\r\n q.append(int(input()) - 1)\r\n\r\nfor i in range(len(arr) - 1, -1, -1):\r\n v = arr[i]\r\n if v not in obj:\r\n obj[v] = True\r\n res[i] = len(obj)\r\n\r\nans = [res[k] for k in q]\r\nfor el in ans:\r\n print(el)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 25 20:09:44 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\n\r\n\r\nn , m = map(int,input().split())\r\narray = [int(x) for x in input().split()]\r\ndp = [0]*(n+1) \r\ndp[-1] = 0\r\nbasket = set()\r\nfor i in range(n-1,-1,-1):\r\n if array[i] in basket:\r\n dp[i] = dp[i+1]\r\n else:\r\n basket.add(array[i])\r\n dp[i] = dp[i+1] + 1\r\nfor _ in range(m):\r\n l = int(input())\r\n print(dp[l-1])", "n,m=map(int,input().split())\r\nln=input().split()\r\nl0=[False]*100000\r\nl1=[]\r\nlm=[]\r\nnum=0\r\nfor i in range(m):\r\n lm.append(int(input()))\r\nfor j in range(n):\r\n if not l0[int(ln[-(j+1)])-1]:\r\n l0[int(ln[-(j+1)])-1]=True\r\n num+=1\r\n l1.append(num)\r\nfor k in range(m):\r\n print(l1[n-lm[k]])", "n,m=map(int,input().split())\r\nnums=[int(x) for x in input().split()]\r\nls=[]\r\nfor _ in range(m):\r\n x=int(input())\r\n ls.append(x)\r\ntable=[1 for x in range(n)]\r\na=set([])\r\na.add(nums[n-1])\r\nfor i in range(n-1):\r\n if nums[n-2-i] in a:\r\n table[n-2-i]=table[n-1-i]\r\n else:\r\n a.add(nums[n-2-i])\r\n table[n-2-i]=table[n-1-i]+1\r\nfor x in ls:\r\n print(table[x-1])\r\n", "n,m = map(int, input().split())\r\na = [int(_) for _ in input().split()]\r\n\r\nl = []\r\nfor i in range(m):\r\n l.append(int(input()))\r\n\r\np = []\r\nqq = set()\r\nfor i in range(n):\r\n qq.add(a[-1-i])\r\n p.append(len(qq))\r\np = p[::-1]\r\nfor i in l:\r\n print(p[i-1])", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns=[0]*(n+1)\r\nvis=set()\r\nfor i in range(n-1,-1,-1):\r\n if arr[i] not in vis:\r\n vis.add(arr[i])\r\n s[i]=1+s[i+1]\r\n else:\r\n s[i]=s[i+1]\r\nfor j in range(m):\r\n a=int(input())\r\n print(s[a-1])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=[1]*n\r\nmany={a[-1]}\r\nfor l in range(n-2,-1,-1):\r\n if a[l] not in many:\r\n s[l]=s[l+1]+1\r\n many.add(a[l])\r\n elif a[l] in many:\r\n s[l]=s[l + 1]\r\nfor i in range(m):\r\n L=int(input())-1\r\n print(s[L])", "n, m = map(int, input().split())\r\narr_1 = list(map(int, input().split()))\r\narr_m = []\r\nfor i in range(m):\r\n arr_m.append(int(input()))\r\n\r\ndistinct_counts = [0] * n\r\ndistinct_count = 0\r\nlast_seen = {}\r\n\r\nfor i in range(n-1, -1, -1):\r\n if arr_1[i] not in last_seen:\r\n distinct_count += 1\r\n last_seen[arr_1[i]] = 1\r\n distinct_counts[i] = distinct_count\r\n\r\nfor i in arr_m:\r\n print(distinct_counts[i-1])\r\n", "\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nfor i in range(n):\r\n s.add(l[n-i-1])\r\n l[n-i-1]=len(s)\r\nfor j in range(m):\r\n k=int(input())\r\n print(l[k-1])", "IN = lambda:list(map(int, input().split()))\r\n\r\nn, m = IN()\r\narr = IN()\r\nB = set()\r\nfor i in range(n-1,-1,-1):B.add(arr[i]);arr[i]=len(B)\r\nfor x in range(m): print(arr[int(input())-1])", "# LUOGU_RID: 131355674\na,b=map(int,input().split());c=input().split();d=[1]*a;e={c[-1]:0}\r\nfor i in range(a-2,-1,-1):\r\n if c[i]not in e:e[c[i]]=0;d[i]=d[i+1]+1\r\n else:d[i]=d[i+1]\r\nfor i in range(b):print(d[int(input())-1])", "n,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nflag=0\r\ndp=[]\r\na=set()\r\nfor i in reversed(lis):\r\n if i not in a:\r\n flag+=1\r\n a.add(i)\r\n dp.append(flag)\r\nfor i in range(m):\r\n print(dp[n-int(input())])\r\n", "n,m = map(int,input().split());\r\na = input().split();\r\nb = set()\r\nfor i in range(n):\r\n b.add(a[~i])\r\n a[~i] = len(b)\r\nfor _ in [0] * m:\r\n print(a[int(input()) - 1])", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndp=[0]*(n-1)+[1]\r\nk=[0]*100001\r\nk[l[n-1]]=1\r\nfor i in range(n-2,-1,-1):\r\n if k[l[i]]==1:\r\n dp[i]=dp[i+1]\r\n else:\r\n dp[i]=dp[i+1]+1\r\n k[l[i]]=1\r\n\r\n\r\nfor i in range(m):\r\n print(dp[int(input())-1])\r\n", "n, m = map(int, input().split())\r\nai = list(map(int, input().split()))\r\ndct, ans = {}, []\r\nfor i in range(n - 1, -1, -1):\r\n dct[ai[i]] = True\r\n ans.append(len(dct))\r\nfor i in range(m):\r\n print(ans[n-int(input())])\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = {}\r\nresult = []\r\n\r\nfor i in range(n - 1, -1, -1):\r\n count[a[i]] = 1\r\n result.append(len(count))\r\n\r\nresult.reverse()\r\n\r\nfor _ in range(m):\r\n l = int(input())\r\n print(result[l-1])\r\n", "n,m =map(int,input().split());l=list(input().split())\r\na=set({})\r\nfor i in range(n):\r\n \r\n\ta.add(l[n-i-1])\r\n\tl[n-i-1]=len(a)\r\nfor j in range(m):\r\n\tprint(l[int(input())-1])", "def solve(n, m, a, l):\r\n distinct_counts = [0]*n\r\n visited = [0]*100001\r\n distinct = 0\r\n for i in range(n, 0, -1):\r\n if not visited[a[i-1]]:\r\n distinct += 1\r\n visited[a[i-1]] = 1\r\n distinct_counts[i-1] = distinct \r\n for i in l:\r\n print(distinct_counts[i-1])\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = [int(input()) for _ in range(m)]\r\nsolve(n, m, a, l)\r\n", "n,m = map(int,input().split())\r\nl = input().split()\r\ndp = [0]*(n-1)+[1]\r\nex = {l[-1],}\r\nfor i in range(n-2,-1,-1):\r\n ex.add(l[i])\r\n dp[i] = len(ex)\r\nfor i in range(m):\r\n print(dp[int(input())-1])", "def solve():\r\n n, m = [int(i) for i in input().split()]\r\n a = [int(i) for i in input().split()]\r\n d = [0 for _ in range(n)]\r\n s = set()\r\n for i in range(n - 1, -1, -1):\r\n s.add(a[i])\r\n d[i] = len(s)\r\n for _ in range(m):\r\n print(d[int(input()) - 1])\r\n\r\n\r\nsolve()", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.reverse()\r\ns=set()\r\nl=[]\r\nfor i in a:\r\n s.add(i)\r\n l.append(len(s))\r\nfor j in range(m):\r\n x=int(input())\r\n print(l[n-x])", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\ndict={}\r\nDict={}\r\ndict[n-1]=1\r\nDict[l1[n-1]]=1\r\ni=n-2\r\ncount=1\r\n\r\nwhile i>=0:\r\n if l1[i] in Dict:\r\n dict[i]=count\r\n i-=1\r\n else:\r\n count+=1\r\n dict[i]=count\r\n Dict[l1[i]]=1\r\n i-=1\r\n \r\nfor _ in range(m):\r\n x=int(input())\r\n print(dict.get(x-1))", "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,m = getints()\r\nl = list(getints())\r\nans = [0]*n\r\n\r\nfrom collections import Counter\r\nc = Counter(l)\r\nll = len(c)\r\nans[0] = ll\r\n\r\nfor i in range(1,n):\r\n if c[l[i-1]] == 1: ll -= 1\r\n else: c[l[i-1]] -= 1\r\n ans[i] = ll\r\n\r\nfor _ in range(m): print(ans[int(input())-1])\r\n", "n, m = map(int, input().split())\nli = list(map(int, input().split()))\n\nunique = set()\ndp = []\nwhile li:\n unique.add(li.pop())\n dp.append(len(unique))\n\nfor _ in range(m):\n print(dp[n - int(input())])\n", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nset0 = set()\r\ndict0 = {}\r\nfor i in range(n, 0, -1):\r\n set0.add(lst[i - 1])\r\n dict0[i] = len(set0)\r\nfor _ in range(m):\r\n print(dict0[int(input())])\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = []\r\nfor _ in range(m):\r\n l.append(int(input()) - 1)\r\ns = set()\r\nx = []\r\nfor e in reversed(a):\r\n s.add(e)\r\n x.append(len(s))\r\nx = list(reversed(x))\r\nfor e in l:\r\n print(x[e])\r\n\r\n", "# https://codeforces.com/contest/368\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nc = [False] * (10 ** 5 + 1)\nd = [0] * (n + 1)\nfor i in range(n - 1, -1, -1):\n if c[a[i]]:\n d[i] = d[i + 1]\n else:\n c[a[i]] = True\n d[i] = d[i + 1] + 1\n \nfor _ in range(m):\n l = int(input())\n print(d[l - 1])\n", "n, m = [int(i) for i in input().split()]\r\nk = [int(i) for i in input().split()]\r\ndp = [1]\r\ncnt = [0] * 100001\r\ncnt[k[-1]] = 1\r\nfor i in range(n-2, -1, -1):\r\n if cnt[k[i]] == 0:\r\n cnt[k[i]] += 1\r\n dp.append(dp[-1]+1)\r\n else:\r\n dp.append(dp[-1])\r\ndp.reverse()\r\nfor i in range(m):\r\n print(dp[int(input()) - 1])", "n, m = map(int, input().split())\r\narray = input().split()\r\n\r\ndistinct = 0\r\ndp = []\r\ntset = set()\r\nfor i in reversed(array):\r\n if i not in tset:\r\n distinct += 1\r\n tset.add(i)\r\n dp.append(distinct)\r\nfor _ in range(m):\r\n L = int(input())\r\n id = len(array) - L\r\n print(dp[id])\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))[::-1]\r\nb = []\r\nk = 0\r\nst = set()\r\nfor i in a:\r\n if i in st:\r\n b.append(k)\r\n else:\r\n b.append(k := k + 1)\r\n st.add(i)\r\nb = b[::-1]\r\nfor i in range(m):\r\n print(b[int(input()) - 1])", "def solution():\r\n k=int(input())\r\n print(ans[k-1])\r\n\r\nn,m =map(int,input().split())\r\ns = set()\r\nans=[0]*n\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1,-1,-1):\r\n s.add(l[i])\r\n ans[i]=len(s)\r\nwhile m:\r\n m-=1\r\n solution()\r\n", "n,m=map(int,input().split())\r\narray=list(map(int,input().split()))\r\nitera=set()\r\nflag=[0]*n\r\nfor i in range(n-1,-1,-1):\r\n itera.add(array[i])\r\n flag[i]=len(itera)\r\nfor i in [0]*m:\r\n print(flag[int(input())-1])", "n,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\ns={a[-1]}\r\nans=[1]\r\nfor i in range(1,n):\r\n if a[n-1-i] not in s:\r\n s.add(a[n-1-i])\r\n ans.append(ans[-1]+1)\r\n else:\r\n ans.append(ans[-1])\r\nfor _ in range(m):\r\n l=int(input())\r\n print(ans[-l])", "n,m = map(int,input().split())\r\na = input().split()\r\nb = set()\r\nfor i in range(n-1,-1,-1):\r\n b.add(a[i])\r\n a[i] = len(b)\r\nfor _ in range(m):\r\n print(a[int(input())-1])", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nk = set()\n\nfor i in range(n - 1, -1, -1):\n k.add(a[i])\n a[i] = len(k)\n\nprint('\\n'.join([str(a[int(input()) - 1]) for i in range(m)]))\n\n\t \t \t\t\t\t \t\t\t\t \t \t\t\t \t\t", "n, m = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nuniq, val = set(), [0] * n\nfor i in range(n)[::-1]:\n uniq.add(a[i])\n val[i] = len(uniq)\nfor _ in range(m):\n li = int(input()) - 1\n res = val[li]\n print(res)\n", "import io, os, time \r\n\r\ndef fast_io(): \r\n \r\n # Reinitialize the Input function \r\n # to take input from the Byte Like \r\n # objects \r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline \r\n \r\n # Fast Input / Output \r\n start = time.perf_counter() \r\n \r\n # Taking input as string \r\n s = input().decode() \r\n \r\n # Stores the end time \r\n end = time.perf_counter() \r\n \r\nn, m = map(int, input().split())\r\n\r\ninput_string = input()\r\narr = [int(x) for x in input_string.split()]\r\n\r\nunique_count = [0] * (n + 1)\r\nunique_set = set()\r\nresult = []\r\n\r\nfor i in range(n - 1, -1, -1):\r\n unique_set.add(arr[i])\r\n unique_count[i] = len(unique_set)\r\n\r\nfor _ in range(m):\r\n l = int(input())\r\n result.append(unique_count[l - 1])\r\n\r\nfor count in result:\r\n print(count)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 11:14:34 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(m):\r\n l.append(int(input())-1)\r\nans,s=[0]*(n+1),set()\r\nfor i in range(n-1,-1,-1):\r\n if a[i] not in s:\r\n s.add(a[i])\r\n ans[i]=ans[i+1]+1\r\n else:\r\n ans[i]=ans[i+1]\r\nfor i in l:\r\n print(ans[i])", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndict1={}\r\ncounts=[0]*n\r\ncount=0\r\ni=n-1\r\nwhile True:\r\n if arr[i] not in dict1.keys():\r\n count+=1\r\n dict1[arr[i]]=1\r\n counts[i] = count\r\n if i == 0:\r\n break\r\n i-=1\r\nfor _ in range(m):\r\n l=int(input())\r\n print(counts[l-1])", "# Sereja and Suffixes Difficulty:1100\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\neliminated_arr = set()\r\ndic = {}\r\nans = []\r\nfor i in range(n-1, -1, -1):\r\n eliminated_arr.add(arr[i])\r\n dic[i+1] = len(eliminated_arr)\r\nfor k in range(m):\r\n l = int(input())\r\n ans.append(dic[l])\r\nfor r in range(m):\r\n print(ans[r])\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndistinct_numbers = set()\r\nsums = [0] * n\r\n\r\nfor i in range(n-1, -1, -1):\r\n distinct_numbers.add(a[i])\r\n sums[i] = len(distinct_numbers)\r\n\r\nfor _ in range(m):\r\n l = int(input())\r\n print(sums[l-1])", "n, m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nadic = {}\r\nfor i in range(n):\r\n if a[i] in adic:\r\n adic[a[i]] += 1\r\n else:\r\n adic[a[i]] = 1\r\nans = [0]*n\r\nfor i in range(n):\r\n if a[i] in adic:\r\n if adic[a[i]] == 1:\r\n adic.pop(a[i])\r\n ans[i] += 1\r\n else:\r\n adic[a[i]] -= 1\r\n ans[i] += len(adic)\r\nfor i in range(m):\r\n print(ans[int(input()) - 1])", "n,m=[int(x) for x in input().split()]\r\ns=[int(x) for x in input().split()]\r\ns.reverse()\r\na={}\r\nb={}\r\nfor i in s:\r\n b[i]=0\r\na[0]=1\r\nb[s[0]]=1\r\nfor i in range(1,n):\r\n if b[s[i]]==1:\r\n a[i]=a[i-1]\r\n else:\r\n a[i]=a[i-1]+1\r\n b[s[i]]=1\r\nfor i in range(m):\r\n print(a[n-int(input())])", "n,m=map(int,input().split())\r\naList=list(input().split())\r\ndp=[0]*(n+1)\r\naSet=set()\r\nfor i in range(-2,-n-2,-1):\r\n dp[i]=dp[i+1]+(aList[i+1] not in aSet)\r\n aSet.add(aList[i+1])\r\nfor i in range(m):\r\n print(dp[int(input())-1])", "n,m = map(int,input().split())\r\nda = [int(i) for i in input().split()] \r\nre = [ ]\r\nan = [ ]\r\nop = set()\r\nfor i in range(n-1,-1,-1):\r\n op.add(da[i])\r\n re.append(len(op))\r\nfor _ in range(m):\r\n an.append(re[-int(input())])\r\nprint('\\n'.join(map(str,an)))", "# LUOGU_RID: 93489940\nn,m=input().split()\nn=int(n);m=int(m)\na=[0]+list(map(int,input().split()))\nb=[]\ns=set()\nfor i in range(n,0,-1):\n s.add(a[i])\n b.append(len(s))\nwhile m:\n l=int(input())\n print(b[n-l])\n m-=1", "n,m = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ns = set()\r\n\r\ndp = [0] * n\r\ndp[-1] = 1\r\ns.add(l[-1])\r\nfor i in range(n-2,-1,-1):\r\n dp[i] = dp[i+1] + int(l[i] not in s)\r\n s.add(l[i])\r\n \r\n\r\nfor i in range(m):\r\n pos = int(input())\r\n print(dp[pos-1])", "n,m=[int(i) for i in input().split()]\r\na=input().split()\r\ns=len(set(a))\r\nb=[1]\r\nA={a[-1]}\r\nfor i in range(1,len(a)):\r\n if a[-i-1] in A:\r\n b.append(b[-1])\r\n else:\r\n b.append(b[-1]+1)\r\n A.add(a[-i-1])\r\nfor i in range(m):\r\n x=int(input())\r\n print(b[-x])", "n, m = map(int,input().split()); arr = input().split()\r\nans = []; checked = set(); ansd = {}\r\nfor i in range(n,0,-1):\r\n checked.add(arr[i-1])\r\n ansd[i] = len(checked)\r\nfor _ in range(m):\r\n ans.append(str(ansd[int(input())]))\r\nprint('\\n'.join(ans))", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nindex=n-1\r\nresult={}\r\nchecked=set()\r\ncount=0\r\nwhile index>=0:\r\n if not arr[index] in checked:\r\n checked.add(arr[index])\r\n count+=1\r\n result[index]=count\r\n index-=1\r\nfor i in range(m):\r\n t=int(input())\r\n print(result[t-1])", "n, m = map(int, input().split())\r\na = input().split()\r\nb = set()\r\n\r\nfor i in range(n):\r\n b.add(a[n - i - 1])\r\n a[n - i - 1] = len(b)\r\n\r\nfor _ in range(m):\r\n print(a[int(input()) - 1])\r\n", "a,b=map(int, input().split())\r\nA=input().split()\r\nA.reverse()\r\nB=set()\r\ni=0\r\nC=[]\r\nfor x in A:\r\n if x not in B:\r\n i+=1\r\n B.add(x)\r\n C.append(i)\r\nfor _ in range(b):\r\n print(C[a-int(input())])", "from sys import stdin\n\nn, m = map(int, stdin.readline().strip().split())\narr = list(map(int, stdin.readline().strip().split()))\ncom = [0]*n\n\ns = set()\nn -= 1\nfor i in range(n, -1, -1):\n\ts.add(arr[i])\n\tcom[i] = len(s)\n\nfor _ in range(m):\n a = int(stdin.readline())\n print(com[a-1])\n \t \t \t\t\t\t \t \t \t\t \t \t \t", "n, m = map(int, input().split())\r\nnlst = list(map(int, input().split()))\r\nmlst = []\r\ndic1 = {} # 记录每个数字出现的次数\r\ndic2 = {} # 记录每个数字在某个数之后出现的次数\r\nfor i in range(m):\r\n mlst.append(int(input()))\r\nfor i in range(n-1, -1, -1):\r\n if nlst[i] not in dic1:\r\n dic1[nlst[i]] = 1\r\n dic2[i] = len(dic1)\r\n else:\r\n dic1[nlst[i]] += 1\r\n dic2[i] = len(dic1)\r\nfor i in mlst:\r\n print(dic2[i-1])\r\n\r\n\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\narray = [int(i) for i in input().split()]\r\nnumber = set()\r\nseq,dp = [],{}\r\nfor i in range(0,m):\r\n a = int(input())\r\n number.add(a)\r\n seq.append(a)\r\nnumber = list(number)\r\nnumber.sort()\r\nc = len(number)\r\nnumber.append(n+1)\r\ndis = set()\r\ndiff = {}\r\nfor i in range(c-1,-1,-1):\r\n for j in range(number[i],number[i+1]):\r\n dis.add(array[j-1])\r\n diff[number[i]] = len(dis)\r\nfor i in range(0,m):\r\n print(diff[seq[i]])", "import sys\r\n\r\n\r\ndef solve():\r\n x, y = map(int, sys.stdin.readline().split())\r\n st, check = set(), [0]*x\r\n l = [int(i) for i in sys.stdin.readline().split()][::-1]\r\n for i in range(x):\r\n st.add(l[i])\r\n check[i] = len(st)\r\n check = check[::-1]\r\n for i in range(y):\r\n q = int(sys.stdin.readline())\r\n print(check[q-1])\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "n,m = map(int,input().split())\r\nnum_list = list(map(int,input().split()))\r\nnum_set = set()\r\nans_list = []\r\nfor num in reversed(num_list):\r\n num_set.add(num)\r\n ans_list.append(len(num_set))\r\n\r\nfor count_m in range(m):\r\n l = int(input())\r\n print(ans_list[n-l])\r\n \r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nans=[0]\r\nfor j in range(n):\r\n if l[n-1-j] in s:\r\n ans.append(ans[j])\r\n else:\r\n ans.append(ans[j]+1)\r\n s.add(l[n-1-j])\r\nfor i in range(m):\r\n x=int(input())\r\n print(ans[n+1-x])", "n,m=map(int,input().split())\r\na=[0]+list(map(int,input().split()))\r\ndp=[0]\r\nchongfu=[0]*(10**5+1)\r\n\r\n\r\nfor i in range(n,0,-1):\r\n if chongfu[a[i]]==0:\r\n dp.append(dp[-1]+1)\r\n chongfu[a[i]]=1\r\n else:\r\n dp.append(dp[-1])\r\ndp.reverse()\r\ndp=[0]+dp\r\n\r\nfor i in range(m):\r\n l=int(input())\r\n print(dp[l])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 25 13:42:40 2023\r\n\r\n@author:赵语涵2300012254\r\n\"\"\"\r\nn,m = map(int,input().split())\r\nnum = list(map(int,input().split()))\r\ncheck = {}\r\nfor i in set(num):\r\n check[i]=False\r\ncount = {0:0}\r\nfor i in range(1,n+1):\r\n if check[num[n-i]]:\r\n count[i] = count[i-1]\r\n else:\r\n check[num[n-i]] = True\r\n count[i] = count[i-1]+1\r\nanswers = []\r\nfor i in range(m):\r\n answers.append(count[n+1-int(input())])\r\nfor a in answers:\r\n print(a)", "n, m = [int(x) for x in input().split()]\r\narray = [int(x) for x in input().split()]\r\ndistinct = set()\r\nfor i in range(len(array), 0, -1):\r\n if array[i-1] not in distinct:\r\n distinct.add(array[i-1])\r\n array[i-1] = 1\r\n else:\r\n array[i-1] = 0\r\ntotal = sum(array)\r\nindicator0 = 0\r\narray_ = []\r\nfor o in range(m):\r\n elm = [o, int(input())]\r\n array_.append(elm)\r\narray_.sort(key=lambda e: e[1])\r\nresult = [0] * m\r\nfor j in range(m):\r\n indicator = array_[j][1] - 1\r\n for k in range(indicator0, indicator):\r\n total -= array[k]\r\n indicator0 = indicator\r\n b = array_[j][0]\r\n result[b] = total\r\nfor _ in result:\r\n print(_)\r\n", "n,m =map(int,input().split())\r\nnl=[int(x) for x in input().split()]\r\nout=0\r\ndp=[]\r\ntset=set()\r\nfor i in reversed(nl):\r\n if i not in tset:\r\n out+=1\r\n tset.add(i)\r\n dp.append(out)\r\nfor _ in range(m):\r\n pos=len(nl)-int(input())\r\n print(dp[pos])\r\n", "n,m = [int(x) for x in input().split(\" \")]\r\nali = [int(x) for x in input().split(\" \")]\r\nlli = [0]*n\r\nsh = set()\r\nlens = 0\r\nfor k in range(n-1,-1,-1):\r\n if ali[k] not in sh:\r\n lens+=1\r\n sh.add(ali[k])\r\n lli[k] = lens\r\nfor _ in range(m):\r\n l = int(input())\r\n print(lli[l-1])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndistinct_numbers = set()\r\nanswers = []\r\n\r\nfor i in range(n-1, -1, -1):\r\n distinct_numbers.add(a[i])\r\n answers.append(len(distinct_numbers))\r\n\r\nfor _ in range(m):\r\n li = int(input())\r\n print(answers[n-li])", "n, m = map(int, input().split())\r\ncell = list(map(int, input().split()))\r\nkey = set()\r\nfor i in range(n-1,-1,-1):\r\n key.add(cell[i])\r\n cell[i] = len(key)\r\nfor i in range(m):\r\n k = int(input())\r\n print(cell[k-1])", "#author 沈天健 2300011417\r\nimport sys\r\nfrom collections import defaultdict\r\n\r\ninput=sys.stdin.readline\r\nprint=sys.stdout.write\r\nn,m=map(int,input().split())\r\nlis=[0]+[*map(int,input().split())]\r\ncnt=[0 for _ in range(0,n+1)]\r\ndic=defaultdict(lambda:1)\r\ncnt[n]=1\r\ndic[lis[n]]=0\r\nfor i in range(n-1,1-1,-1):\r\n cnt[i]+=cnt[i+1]+dic[lis[i]]\r\n dic[lis[i]]=0\r\nfor _ in range(1,m+1):\r\n l=int(input())\r\n print(f\"{cnt[l]}\\n\")\r\n \r\n", "shuru = list(map(int , input().split()))\r\nn , m = shuru[0] , shuru[1]\r\nshuju = list(map(int , input().split()))\r\nzidian = {}\r\nshuzu = list(set(shuju))\r\nx = 0\r\ndaan = []\r\nans = []\r\n\r\nfor i in range(len(shuzu)):\r\n zidian[shuzu[i]] = 0\r\n\r\nfor i in range(n - 1 , -1 , -1):\r\n\r\n if zidian[shuju[i]] == 0:\r\n x += 1\r\n daan.append(x)\r\n zidian[shuju[i]] = 1\r\n else:\r\n daan.append(x)\r\n\r\ndaan.reverse()\r\n\r\nfor i in range(m):\r\n a = int(input())\r\n ans.append(daan[a - 1])\r\n\r\nfor i in range(m):\r\n print(str(ans[i]))\r\n\r\n", "n,m=map(int,input().split())\r\nl=input().split()\r\ns=set()\r\nfor i in range(n):\r\n s.add(l[~i])\r\n l[~i]=len(s)\r\nfor _ in range(m):\r\n print(l[int(input())-1])", "#建立一个字典，把整个列表遍历一遍，然后给对应的位置匹配一个值，每次查找的时候只需要通过索引字典即可\r\nn,m=map(int,input().split())\r\nlst=input().split()\r\nqueue=[]\r\ndict={}\r\ndict1={}\r\ncount=0\r\nfor i in range(n-1,-1,-1):\r\n if lst[i] not in dict1.keys():\r\n dict1[lst[i]]=1\r\n count+=1\r\n dict[i+1]=count\r\n else:\r\n dict[i+1]=count\r\n\r\nfor j in range(m):\r\n p=int(input())\r\n print(dict[p])", "n,m=map(int, input().split())\r\nli=list(map(int, input().split()))\r\nq=[]\r\nfor _ in range(m):\r\n q.append(int(input()))\r\nli2=list(reversed(li))\r\nl=len(li2)\r\ndic={}\r\np=set()\r\nco=0\r\nfor k in range(l):\r\n if li2[k] in p:\r\n dic[k]=co\r\n continue\r\n else:\r\n co+=1\r\n dic[k]=co\r\n p.add(li2[k])\r\nfor item in q:\r\n print(dic[l-item])", "n,m=map(int,input().split())\r\nb,c=[],set()\r\nfor x in map(int,reversed(input().split())):\r\n c.add(x)\r\n b.append(len(c))\r\nfor _ in range(m):\r\n print(b[n-int(input())])", "nm = input().split()\nn = int(nm[0])\nm = int(nm[1])\n\na = list(map(int, input().split()))\nresult = []\nunique = set()\nentries = []\n\nfor i in range(len(a)-1, -1, -1):\n unique.add(a[i])\n result.append(len(unique))\n\nresult.reverse()\n\nfor i in range(m):\n entries.append(int(input()))\n\nfor i in range(len(entries)):\n index = entries[i] - 1\n print(result[index])\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\nnum_lst = list(map(int,input().split()))\r\nnum_lst.reverse()\r\nunique_num = set()\r\ndp = []\r\nfor k in num_lst:\r\n unique_num.add(k)\r\n dp.append(len(unique_num))\r\nresult = []\r\nfor _ in range(m):\r\n x = int(input())\r\n result.append(dp[-x])\r\nfor letter in result:\r\n print(letter)", "n,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nnum=[0]*(n+1)\r\nval=[0]*(100001)\r\nfor i in range(n-1,-1,-1):\r\n if val[a[i]]==0:\r\n val[a[i]]=1\r\n num[i]=num[i+1]+1\r\n else:\r\n num[i]=num[i+1]\r\nfor i in range(m):\r\n l=int(input())\r\n print(num[l-1])", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ndic = {}\r\nfor i in a:\r\n dic[i] = 1\r\nb = [0]\r\nj = 1\r\nfor i in a[::-1]:\r\n b.append(b[j-1] + dic[i])\r\n dic[i] = 0\r\n j += 1\r\nb.reverse()\r\nfor i in range(m):\r\n print(b[int(input())-1])\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ndistinct_count = [0] * n\r\ndistinct_set = set()\r\nfor i in range(n - 1, -1, -1):\r\n distinct_set.add(arr[i])\r\n distinct_count[i] = len(distinct_set)\r\n\r\nfor _ in range(m):\r\n l = int(input())\r\n sys.stdout.write(str(distinct_count[l - 1]) + \"\\n\")\r\n", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\ndp = [0] * n\r\ns = set()\r\nfor i in range(len(a)-1, -1, -1):\r\n s.add(a[i])\r\n dp[i] = len(s)\r\nfor i in range(m):\r\n l = int(input())\r\n print(dp[l-1])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nnum=[0 for i in range(n+1)]\r\njudge=set()\r\nfor i in range(n):\r\n if a[n-1-i] in judge:\r\n num[n-1-i]=num[n-i]\r\n else:\r\n num[n-1-i]=num[n-i]+1\r\n judge.add(a[n-1-i])\r\nfor i in range(m):\r\n x=int(input())\r\n print(num[x-1])\r\n ", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nqueries = [int(input()) for _ in range(m)]\r\n\r\n# Create a list to store the number of unique elements from i to n\r\nunique_counts = [0] * n\r\n\r\n# Initialize the last element of the list as 1\r\nunique_counts[-1] = 1\r\n\r\n# Create a set to keep track of unique elements encountered\r\nunique_elements = set()\r\nunique_elements.add(a[-1])\r\n\r\n# Iterate through the array in reverse order\r\nfor i in range(n - 2, -1, -1):\r\n if a[i] not in unique_elements:\r\n unique_elements.add(a[i])\r\n unique_counts[i] = unique_counts[i + 1] + 1\r\n else:\r\n unique_counts[i] = unique_counts[i + 1]\r\n\r\n# Answer the queries\r\nfor query in queries:\r\n print(unique_counts[query - 1])\r\n", "n , m = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\ncount = 0\r\nnDict = {}\r\nans = [0] * n\r\nfor index in range(n - 1 , -1 , -1) :\r\n if nums[index] not in nDict : \r\n nDict[nums[index]] = \"YES\"\r\n count += 1\r\n ans[index] = count \r\nfor testCase in range(m) :\r\n print(ans[int(input()) - 1])", "f=lambda: map(int,input().split())\r\nn,m=f(); *a,=f(); l=[]\r\n\r\ns=set()\r\nfor i in range(n):\r\n s.add(a[~i]); a[~i]=len(s)\r\nfor i in range(m):\r\n print(a[int(input())-1])", "n, m = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\ndp = [0]*n\r\n\r\nSet = set()\r\nfor i in range(n-1,-1,-1):\r\n Set.add(lst[i])\r\n dp[i] = len(Set)\r\n \r\nfor _ in range(m):\r\n l = int(input())\r\n print(dp[l-1])\r\n \r\n \r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * n\r\ns = set()\r\nfor i in range(n - 1, -1, -1):\r\n s.add(a[i])\r\n b[i] = len(s)\r\nfor _ in range(m):\r\n print(b[int(input()) - 1])", "from functools import lru_cache\n\n@lru_cache(maxsize=None)\ndef do():\n for i in range(n-2,-1,-1):\n dp[i]=dp[i+1]+(1-target[li[i]])\n target[li[i]]=1\nn,m=map(int,input().split())\ntarget=[0]*(100001)\ndp=[0]*n\ndp[n-1]=1\nli=list(map(int,input().split()))\ntarget[li[n-1]]=1\ndo()\nans=[]\nfor i in range(m):\n k=int(input())\n ans.append(dp[k-1])\nfor i in ans:\n print(i)", "n, m = map(int, input().split())\nar = [int(x) for x in input().split()]\n\nlarr = [0]*n\n\ns = set()\nfor i in range(n-1, -1, -1):\n\ts.add(ar[i])\n\tlarr[i] = len(s)\n\nfor i in range(m):\n\tx = int(input())\n\tprint(larr[x-1])", "# import \r\nn,m = map(int,input().split(' '))\r\na = list(map(int,input().split(' ')))\r\n\r\nb = a.copy()\r\nb.sort()\r\ncount = 1\r\nfor i in range (1,n):\r\n if b[i] != b[i-1]:\r\n count += 1 \r\na1 = [count]\r\n\r\nl = [0]*(10**5)\r\nfor i in range (0,n):\r\n l[b[i]-1] += 1\r\n\r\nfor i in range (1,n):\r\n # print(\"hello1\",a[i-1],l[a[i-1]-1])\r\n l[a[i-1]-1] -= 1\r\n # print(\"hello2\",a[i-1],l[a[i-1]-1])\r\n if l[a[i-1]-1] == 0:\r\n a1.append(a1[i-1] - 1)\r\n # elif l[a[i-1]-1] == 1:\r\n # a1.append(a1[i-1] - 1)\r\n else:\r\n a1.append(a1[i-1])\r\n\r\n# print(a1)\r\n\r\nfor no in range (m):\r\n li = int(input())\r\n print(a1[li-1])", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb=[]\r\nc=set()\r\nd=[]\r\nfor i in range(0,n):\r\n c.add(a[n-1-i])\r\n b.append(len(c))\r\n\r\nfor i in range(0,m):\r\n d.append(int(input()))\r\n\r\nfor i in range(0,m):\r\n print(b[n-d[i]])", "n,m = map(int,input().split())\r\nna = list(map(int,input().split()))\r\nna_set = set()\r\ncounts = []\r\n\r\nfor i in reversed(na):\r\n na_set.add(i)\r\n counts.append(len(na_set))\r\n \r\nfor j in range(m):\r\n t = int(input())\r\n print(counts[n-t])", "n,m=map(int,input().split())\r\nn1=[int(x) for x in input().split()]\r\nout=0\r\ndp=[]\r\ntset = set()\r\nfor i in reversed(n1):\r\n if i not in tset:\r\n out += 1\r\n tset.add(i)\r\n dp.append(out)\r\n\r\nfor i in range(m):\r\n pos = len(n1) - int(input())\r\n print(dp[pos])", "n, m = map(int, (input().split()))\na = input().split()\nk = set()\nfor i in range(n - 1, -1, -1):\n k.add(a[i])\n a[i] = str(len(k))\nprint('\\n'.join([a[int(input()) - 1] for i in range(m)]))\n \t \t\t \t \t\t \t\t \t", "array_size, num_inputs = [int(x) for x in input().split()]\narray = [int(x) for x in input().split()]\ncount_map = {}\nsuffix_counts = [0] * array_size\n\nfor i in range(array_size-1, -1, -1):\n if i == array_size - 1:\n suffix_counts[i] = 1\n count_map[array[i]] = 1\n elif array[i] in count_map:\n suffix_counts[i] = suffix_counts[i+1]\n else:\n suffix_counts[i] = suffix_counts[i+1] + 1\n count_map[array[i]] = 1\n\ninputs = [int(input()) for _ in range(num_inputs)]\n\nfor input_data in inputs: \n print(suffix_counts[input_data - 1])\n \t \t \t\t \t \t\t \t \t \t \t \t", "n,k=[int(i) for i in input().split()]\r\ns=[int(i) for i in input().split()]\r\no=(n+1)*[0]\r\na=100001*[0]\r\nfor i in range(n-1,-1,-1):\r\n if(a[s[i]]!=0):\r\n o[i]=o[i+1]\r\n else:\r\n o[i]=o[i+1]+1\r\n a[s[i]]+=1\r\nfor i in range(k):\r\n c=int(input())\r\n print(o[c-1])", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ne=set();li=[];n=0\r\nfor j in range(a):\r\n if c[-j-1] not in e:\r\n n+=1\r\n e.add(c[-j-1])\r\n li.append(n)\r\nli.reverse()\r\nfor i in range(b):\r\n d=int(input())\r\n print(li[d-1])", "N, M = map(int, input().strip().split(\" \"))\narr = list(map(int, input().strip().split(\" \")))\ndict_arr = {}\nres = []\nfor i in range(N - 1, -1, -1):\n dict_arr[arr[i]] = 1;\n res.append(len(dict_arr));\n\nfor m in range(M):\n _temp_L = int(input().strip())\n print(res[N - _temp_L])\n\n\t \t\t\t \t \t \t \t\t\t \t\t\t\t \t \t", "n,m=map(int,input().split())\nl=list(map(int,input().split()))\nans={}\ns=set()\npos=0\nfor j in range(n):\n i=n-1-j\n if l[i] not in s:\n s.add(l[i])\n pos+=1\n ans[i]=pos\n else:\n ans[i]=pos\n continue\n#print(ans)\nfor i in range(m):\n k=int(input())\n print(ans[k-1])\n", "import copy\r\nn, m = map(int, input().split())\r\nl1 = list(map(int, input().split()))\r\nl1.reverse()\r\nl2 = []\r\ndict_seq = {}\r\nfor i in range(m):\r\n l2.append(n-int(input()))\r\nl2_0 = copy.deepcopy(l2)\r\nl2.sort()\r\nl2 = tuple(set(tuple(l2)))\r\nm = len(l2)\r\ncnt = 0\r\nindex = 0\r\ndict_0 = {}\r\nans = {}\r\n#print(l1)\r\n#print(l2)\r\nfor i in range(n):\r\n try:\r\n dict_0[l1[i]] += 0\r\n except KeyError:\r\n dict_0[l1[i]] = 0\r\n cnt += 1\r\n if i == l2[index]:\r\n ans[l2[index]] = cnt\r\n index += 1\r\n if index == m:\r\n break\r\nfor i in l2_0:\r\n print(ans[i])\r\n#print(dict_0)", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ndp = [0 for i in range(a + 1)]\r\nC = set()\r\nfor i in range(a - 1, -1, -1):\r\n if not c[i] in C:\r\n dp[i] = dp[i + 1] + 1\r\n C.add(c[i])\r\n else:\r\n dp[i] = dp[i + 1]\r\nfor i in range(b):\r\n d = int(input())\r\n print(dp[d - 1])\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nnuml=[]\r\nfor j in l[::-1]:\r\n s.add(j)\r\n numl.append(len(s))\r\nfor i in range(m):\r\n a=int(input())\r\n print(numl[n-a])\r\n", "n,m = list(map(int,input().split()))\r\na,b,c = list(map(int,input().split())),set(),dict()\r\narr = [int(input()) for i in range(m)]\r\nc[n] = 1\r\nb.add(a[n-1])\r\nfor i in range(n-1,-1,-1):\r\n c[i] = c[i+1]\r\n if a[i] not in b:\r\n b.add(a[i])\r\n c[i] += 1\r\nfor i in arr:\r\n print(c[i-1])", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor _ in range(m):\r\n a.append(tuple([int(input()),_+1]))\r\na.sort(key=lambda x:x[0],reverse=True)\r\ns=set()\r\nl0=set(l)\r\na.insert(0,tuple([n+1,0]))\r\nt=0\r\nb=[]\r\ni=1\r\nwhile i<=m:\r\n u=a[i][0]\r\n v=a[i-1][0]\r\n if u<v:\r\n for k in range(u-1,v-1):\r\n if l[k] not in s:\r\n s.add(l[k])\r\n t+=1\r\n b.append(tuple([t,a[i][1]]))\r\n else:\r\n b.append(tuple([t,a[i][1]]))\r\n i+=1\r\nb.sort(key=lambda x:x[1])\r\nfor _ in b:\r\n print(_[0])\r\n", "n,m=map(int,input().split())\r\na=input().split()\r\nb=set()\r\nc={a[-1]}\r\ne=[1]\r\nfor i in range(n-2,-1,-1):\r\n b.add(i+1)\r\n if a[i] in c:\r\n e+=[e[-1]]\r\n else:\r\n c.add(a[i])\r\n e+=[e[-1]+1]\r\nfor x in range(m):\r\n print(e[n-int(input())])", "n,m = map(int,input().split())\r\nlist1 = list(map(int,input().split()))\r\nlist2 = [0]*n\r\nset3 = set()\r\ncount1 = 0\r\nfor i in range(1,n+1):\r\n if list1[-i] not in set3:\r\n set3.add(list1[-i])\r\n count1 += 1\r\n list2[-i] = count1\r\nfor s in range(0,m):\r\n a = int(input())\r\n print(list2[a-1])", "n, m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nans = []\r\nnum = []\r\nmx = 0\r\nfor i in range(n):\r\n ans.append(0)\r\n mx = max(mx, a[i])\r\nans.append(0)\r\nfor i in range(mx + 2):\r\n num.append(False)\r\nfor j in range(n):\r\n if num[a[n - 1 - j]]:\r\n ans[n - 1 - j] = ans[n - j]\r\n continue\r\n ans[n - 1 - j] = ans[n - j] + 1\r\n num[a[n - 1 - j]] = True\r\nfor i in range(m):\r\n k = int(input())\r\n print(ans[k - 1])\r\n", "n,m = [int(i) for i in input().split()]\r\narray = [int(j) for j in input().split()]\r\nse = set()\r\nlist_re = []\r\nfor i in range(n):\r\n se.add(array[n-i-1])\r\n list_re.append(len(se))\r\nfor _ in range(m):\r\n k = int(input())\r\n print(list_re[n-k])\r\n\r\n", "import sys,io,os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\ninp = lambda : list(map(int,input().split()))\r\n\r\n\r\n\r\nn,m = inp()\r\nlis = inp()\r\nprev = [0]*(n+1)\r\ncheck = {}\r\nfor i in range(n):\r\n if lis[n-i-1] not in check:\r\n check[lis[n-i-1]]=1\r\n prev[(n)-(i+1)]+=prev[(n)-i]+1\r\n else:\r\n prev[(n)-(i+1)]+=prev[(n)-i]\r\nfor i in range(m):\r\n n = prev[int(input())-1]\r\n sys.stdout.write(str(n) + \"\\n\")\r\n", "dic={}\r\nfind={i:False for i in range(1,100001)}\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndic[n]=1\r\nfind[a[-1]]=True\r\nfor i in range(n-1,0,-1):\r\n if find[a[i-1]]:\r\n dic[i]=dic[i+1]\r\n else:\r\n dic[i]=dic[i+1]+1\r\n find[a[i-1]]=True\r\nfor i in range(m):\r\n print(dic[int(input())])", "import math\ndef error(*n):\n print(\"[Err]\",end=\" \")\n for i in n:\n print(i,end=\" \")\n print()\n\nn,m = [int(i) for i in input().split()]\nif type(n) == list:\n n = n[0]\n\na = [int(i) for i in input().split()]\ndp = [0]*(n+1)\nvis = [0]*int(1e5+5)\nfor i in range(n-1,-1,-1):\n dp[i] = dp[i+1]\n if not vis[a[i]]:\n vis[a[i]]=1\n dp[i] += 1\n\n##error(dp)\nans=[]\n\nfor i in range(m):\n q = int(input())\n ans.append(dp[q-1])\n\nprint(\"\\n\".join([str(i) for i in ans]))\n\n \t\t \t \t \t \t \t \t\t\t \t\t \t", "n, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\ntest = set()\r\ndp = []\r\nout = 0\r\nfor a_j in reversed(array):\r\n if a_j not in test:\r\n test.add(a_j)\r\n out += 1\r\n dp.append(out)\r\nfor i in range(m):\r\n rev_index = len(array) - int(input())\r\n print(dp[rev_index])", "n, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\na.reverse()\r\n\r\nb = []\r\n\r\nc = set()\r\n\r\nfor i in range(n):\r\n c.add(a[i])\r\n b.append(len(c))\r\n\r\nb.reverse()\r\nfor i in range(m):\r\n k = int(input()) - 1\r\n print(b[k])\r\n", "A=dict()\r\nn,m=map(int,input().split());Answer=[0]*(n+1);B=[]\r\nlis=list(map(int,input().split()));liss=set(lis);l=len(liss)\r\nfor x in lis:\r\n A[x]=0\r\nfor i in range(n):\r\n A[lis[i]]+=1\r\nAnswer[0]=l\r\nfor j in range(1,n+1):\r\n Answer[j]=Answer[j-1]\r\n A[lis[j-1]]-=1\r\n if A[lis[j-1]]==0:\r\n Answer[j]-=1\r\nfor k in range(m):\r\n B.append(int(input())-1)\r\nfor x in B:\r\n print(Answer[x])", "n, m = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\narr.reverse()\r\ndistinct = [False]*100005\r\nans = []\r\ns = 0\r\nfor i in arr:\r\n if not distinct[i]:\r\n distinct[i] = True\r\n s += 1\r\n ans.append(s)\r\nfor i in range(m):\r\n print(ans[n-int(input())])", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\ns,l1={l[0]},[1]\r\nfor i in range(1,len(l)):\r\n if l[i] not in s:\r\n s.add(l[i])\r\n l1.append(l1[i-1]+1)\r\n else:\r\n l1.append(l1[i-1])\r\nfor j in range(m):\r\n x=int(input())\r\n print(l1[n-x])\r\n\r\n", "n, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n \r\nqueries = []\r\nfor _ in range(m):\r\n queries.append(int(input()))\r\nans=[]\r\n \r\nd=set()\r\nfor i in range(n):\r\n d.add(array[-i-1])\r\n ans.append(len(d))\r\nfor l in queries:\r\n print(ans[-l])", "n,m = map(int,input().split())\na = list(map(int,input().split()))\ns = set()\nfor i in range(n-1,-1,-1):\n s.add(a[i])\n a[i] = len(s)\n \nfor k in range(m):\n vv = int(input())-1\n print(a[vv])\n\t \t \t \t \t\t\t \t\t \t \t\t \t", "n , m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nl = []\r\ns = set()\r\n\r\nc = 0\r\nfor i in range(n-1, -1, -1):\r\n if a[i] not in s:\r\n s.add(a[i])\r\n c += 1\r\n l.append(c)\r\nl.reverse()\r\nfor i in range(m):\r\n l1 = int(input())\r\n \r\n print(l[l1-1])\r\n", "# 接受输入转为int List\r\nn,m = map(int,input().split())\r\naList=list(map(int,input().split()))\r\naList=[0]+aList\r\n\r\nlList = []\r\nfor i in range(m):\r\n lList.append(int(input()))\r\n \r\n\r\n# sum 第i个位置直至第n个位置，不同数字个数\r\nsum = [0] * (n+1)\r\n\r\n# dic1都是用于统计每个数字出现次数的字典\r\ndic1 = {}\r\ncnt=0\r\n# 如果没有字典中就添加，有在字典中就value+1\r\nfor elem in aList[1::]:\r\n if elem not in dic1:\r\n cnt = cnt + 1\r\n dic1[elem] = 1\r\n else:\r\n dic1[elem] = dic1[elem]+1\r\n\r\n# print(dic1)\r\n\r\n# 计算第1个\r\nsum[1]=cnt\r\ndic1[aList[1]] = dic1[aList[1]] -1\r\n\r\n# sum值计算，从第2个开始，到第n个\r\nfor i in range(2,n+1):\r\n \r\n # 因为此时aList[i-1] 没有在接下来的区间中出现\r\n if (dic1[aList[i-1]] == 0):\r\n sum[i] = sum[i-1] - 1\r\n else: # 说明在接下来的区间中还会出现，那么我们直接继承 sum[i-1] 即可\r\n sum[i] = sum[i-1]\r\n\r\n dic1[aList[i]] = dic1[aList[i]]-1\r\n\r\n# print(sum)\r\n\r\n\r\nresult = []\r\nfor loc in lList:\r\n result.append(str(sum[loc]))\r\n # print(sum[i-1])\r\n\r\n# 数组转为字符串，用join输出\r\nprint(\"\\n\".join(result))", "n, m = [int(i) for i in input().split(' ')]\r\na = [int(i) for i in input().split(' ')]\r\n\r\ns = set()\r\nindexes = []\r\nfor i in reversed(range(len(a))):\r\n s.add(a[i])\r\n a[i] = len(s)\r\n\r\nfor i in range(m):\r\n indexes.append(int(input())-1)\r\n\r\nfor i in indexes:\r\n print(a[i])", "n,m = map(int,input().split())\r\nseq = [int(x) for x in input().split()]\r\ndp = [0]*(n-1)+[1]\r\nbarrel = [False]*(100000+1)\r\nbarrel[seq[n-1]] = True\r\nfor i in reversed(range(n-1)):\r\n if barrel[seq[i]]:\r\n dp[i] = dp[i+1]\r\n else:\r\n dp[i] = dp[i+1]+1\r\n barrel[seq[i]] = True\r\nfor i in range(m):\r\n print(dp[int(input())-1])", "flags = [True]*100001\r\na,l = map(int,input().split())\r\na_ = [int(element) for element in input().split()]\r\ncounters = [0]*a\r\ncounter = 0\r\nfor i in range(a-1,-1,-1):\r\n if flags[a_[i]]:\r\n counter += 1\r\n flags[a_[i]] = False\r\n counters[i] += counter\r\nfor i in range(l):\r\n print(counters[int(input())-1])", "n, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nb = set()\r\nsurfix = [0]*(n+1)\r\nfor i in range(n-1,-1,-1):\r\n if s[i] in b:\r\n surfix[i] = surfix[i+1]\r\n else:\r\n b.add(s[i])\r\n surfix[i] = surfix[i+1] + 1\r\nfor i in range(m):\r\n k = int(input())\r\n print(surfix[k-1])", "n,m=map(int,input().split())\r\nnum={i:int(x)for i,x in zip(range(1,n+1),input().split())}\r\nrecord={}\r\ninn=[]\r\nfor x in num.values():\r\n if x not in record.keys():\r\n record[x]=1\r\n else:\r\n record[x]+=1\r\nans={i:0 for i in range(1,n+2)}\r\nfor i in range(n,0,-1):\r\n if record[num[i]] == 1:\r\n ans[i]=ans[i+1]+1\r\n else:\r\n if record[num[i]] == 'x':\r\n ans[i]=ans[i+1]\r\n else:\r\n ans[i]=ans[i+1]+1 \r\n record[num[i]]='x'\r\nfor _ in range(m):\r\n inn.append(int(input()))\r\nfor l in inn:\r\n print(ans[l])", "n,m=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nl.reverse()\r\nnum=[0]\r\ntset=set()\r\none=0\r\nfor i in range(n):\r\n if l[i] not in tset:\r\n\r\n one+=1\r\n tset.add(l[i])\r\n num.append(one)\r\nfor i in range(m):\r\n a=int(input())\r\n print(num[n-a+1])", "n,m=map(int, input().split())\r\nx=[int(a) for a in input().split()]\r\nb=0\r\nc=set()\r\nd=[]\r\nfor i in range(n-1,-1,-1):\r\n if x[i] not in c:\r\n c.add(x[i])\r\n b+=1\r\n d.append(b)\r\nfor l in range(m):\r\n u=int(input())\r\n print(d[n-u])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Nov 11 10:27:56 2022\r\n\r\n@author: SaltLyy\r\n\"\"\"\r\n\r\nn,m=map(int,input().split());a=input().split();b=set()\r\nfor i in range(n):\r\n b.add(a[n-i-1]);a[n-i-1]=len(b)\r\nfor _ in [0]*m:\r\n print(a[int(input())-1])\r\n \r\n", "n, m = input().split()\n \nm = int(m)\n \nlista = list(map(int, input().split()))\nlista_result = []\nunicos = set()\nentradas = []\n\n\nfor i in range(len(lista)-1, -1, -1):\n unicos.add(lista[i])\n lista_result.append(len(unicos))\n\n\nlista_result.reverse()\n\nfor i in range(m):\n entradas.append(int(input()))\n\nfor i in range(len(entradas)):\n index = entradas[i]-1\n\n print(lista_result[index])\n\n\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\na = set()\r\nb = []\r\nfor i in range(n-1, -1, -1):\r\n a.add(L[i])\r\n b.append(len(a))\r\nb = b[::-1]\r\nfor i in range(m):\r\n j = int(input())\r\n print(b[j-1])", "n,m = map(int,input().split())\r\nstring =list(map(int,input().split()))\r\nw = [1]*n\r\nz = set()\r\nfor i in range(1,n+1):\r\n z.add(string[-i]) \r\n w[-i]=len(z)\r\nfor j in range(m):\r\n print(w[int(input())-1])", "nnums, nquers = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\nans = [0 for _ in range(nnums)]\r\n\r\nseen = set()\r\nfor i in range(nnums - 1, -1, -1):\r\n seen.add(nums[i])\r\n ans[i] = len(seen)\r\n\r\nfor _ in range(nquers):\r\n print(ans[int(input()) - 1])", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = {}\r\nnm = 0\r\nans = [0]*n\r\nfor i in range(n-1,-1,-1):\r\n if a[i] not in d:\r\n d[a[i]] = True\r\n nm+=1\r\n ans[i] = nm\r\nfor _ in range(m):\r\n l = int(input())\r\n print(ans[l-1])", "n,m=list(map(int,input().split(\" \")))\r\ntab=list(map(int,input().split(\" \")))\r\nnumbers=[0 for i in range ((10**5)+1)]\r\ndistinct=[]\r\nd=0\r\nresult=[]\r\nfor i in range(n-1,-1,-1):\r\n if(numbers[tab[i]]==0):\r\n numbers[tab[i]]+=1\r\n d+=1\r\n distinct.append(d)\r\ndistinct.reverse()\r\nfor i in range(m):\r\n li=int(input())\r\n result.append(distinct[li-1])\r\nfor i in result:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n", "#王铭健，工学院 2300011118\r\nfrom collections import defaultdict\r\nf = lambda: map(int,input().split())\r\nn, m = f()\r\nnum_list = list(f())\r\nverdict = defaultdict(bool)\r\nans = [0] * (n + 1)\r\nfor i in range(n - 1, -1, -1):\r\n num = num_list[i]\r\n if not verdict[num]:\r\n ans[i] = ans[i + 1] + 1\r\n verdict[num] = True\r\n else:\r\n ans[i] = ans[i + 1]\r\n\r\nfor j in range(m):\r\n print(ans[int(input()) - 1])\r\n ", "N, M = list(map(int, input().split()))\na = list(map(int, input().split()))\na.reverse()\nans = []\nbuc = [0 for _ in range(int(1e5 + 10))]\ncnt = 0\nfor _ in a:\n if (buc[_] == 0):\n cnt += 1\n buc[_] = 1\n ans.append(cnt)\nfor _ in range(M):\n l = int(input())\n print(ans[N - l])\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=set()\r\nx=[]\r\nfor i in range(n-1, -1,-1):\r\n l.add(a[i])\r\n x.append(len(l))\r\nx=x[::-1]\r\nfor i in range(m):\r\n\tl=int(input())\r\n\tprint(x[l-1])", "# Read input values\r\nn, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\nqueries = [int(input()) for _ in range(m)]\r\n\r\n# Initialize a set to store distinct elements\r\ndistinct_elements = set()\r\n\r\n# Initialize a list to store the results for each query\r\nresults = []\r\n\r\n# Iterate through the array in reverse order\r\nfor i in range(n - 1, -1, -1):\r\n # Add the current element to the set\r\n distinct_elements.add(array[i])\r\n\r\n # Calculate the number of distinct elements in the set and append to results\r\n results.append(len(distinct_elements))\r\n\r\n# Reverse the results list to get the correct order\r\nresults = results[::-1]\r\n\r\n# Print the results for each query li\r\nfor query in queries:\r\n print(results[query - 1])\r\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n, m = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()]\n dp, hash_map = [0] * n, [[] for i in range(100)]\n unique = 0\n for i in range(n - 1, -1, -1):\n hash_code = hash(a[i])\n if hash_map[hash_code]:\n if not a[i] in hash_map[hash_code]:\n unique += 1\n hash_map[hash_code].append(a[i])\n else:\n unique += 1\n hash_map[hash_code].append(a[i])\n dp[i] = unique\n for i in range(m):\n print(dp[int(input()) - 1])\n\n\ndef hash(n):\n return n % 100\n\n\nif __name__ == \"__main__\":\n main()\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=set()\r\nb=[0]*(n+1)\r\nk=0\r\nfor i in range(1,n+1):\r\n if a[-i] in s:\r\n b[-i]=k\r\n else:\r\n k+=1\r\n s.add(a[-i])\r\n b[-i]=k\r\nfor ii in range(m):\r\n print(b[int(input())])", "n,m=map(int, input().split())\r\nA=list(map(int, input().split()))\r\nB=set()\r\nnum=0\r\ndp=[]\r\n\r\nfor i in reversed(A):\r\n if i not in B:\r\n num+=1\r\n B.add(i)\r\n dp.append(num)\r\n \r\nfor i in range(m):\r\n print(dp[len(A)-int(input())])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 21:41:51 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndp=[1]*n\r\ny=n\r\na=0\r\nnum=set()\r\nfor i in reversed(arr):\r\n if i not in num:\r\n num.add(i)\r\n a+=1\r\n dp[y-1]=a\r\n y-=1\r\nfor i in range(m):\r\n a=int(input())\r\n print(dp[a-1])", "n, m = map(int, input().split())\r\narray = [int(x) for x in input().split()]\r\narray_num = [0 for i in range(n-1)]\r\narray_num.append(1)\r\narray_dif = set()\r\nfor i in range(n-1, 0, -1):\r\n array_dif.add(array[i])\r\n if array[i-1] in array_dif:\r\n array_num[i-1] = array_num[i]\r\n else:\r\n array_num[i-1] = array_num[i] + 1\r\nfor i in range(m):\r\n suffix = int(input())\r\n print(array_num[suffix-1])\r\n", "import sys\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,sys.stdin.readline().split()))\r\nmd = {}\r\nsuffix =[0] * n\r\ncount = 0\r\nfor i in range(n-1,-1,-1):\r\n if not md.get(a[i],None):\r\n md[a[i]]=1\r\n count+=1\r\n suffix[i] = count\r\n\r\n\r\nfor _ in range(m):\r\n print(suffix[int(sys.stdin.readline())-1])\r\n\r\n\r\n", "n, m = map(int,input().split())\r\nnum = list(map(int,input().split()))\r\nnumset = set()\r\nans = []\r\nfor i in range(n):\r\n numset.add(num[n-i-1])\r\n ans.append(len(numset))\r\nfor j in range(m):\r\n l = int(input())\r\n print(ans[n-l])", "n,m=map(int,input().split())\r\nc=[int(i)for i in input().split()]\r\nd=set()\r\nc=c[::-1]\r\nf=[0 for i in range(n)]\r\nfor i in range(n):\r\n d.add(c[i])\r\n f[i]=len(d)\r\nf=f[::-1]\r\nfor i in range(m):\r\n j=int(input())\r\n print(f[j-1])", "numberofas, numberofls = map(int, input().split())\r\narraya = list(map(int, input().split()))\r\narraya.reverse()\r\narrayl = sorted([[numberofas-int(input()),j] for j in range(numberofls)])\r\nans = [0]*numberofls\r\nnumberoflsdone = 0\r\ndistinctnumbers = 0\r\nsetofdistinctnumbers = set()\r\ni = 0\r\nj = 0\r\nwhile numberoflsdone < numberofls:\r\n prosessingnumber = arraya[i]\r\n if prosessingnumber not in setofdistinctnumbers:\r\n distinctnumbers += 1\r\n setofdistinctnumbers.add(prosessingnumber)\r\n if i == arrayl[j][0]:\r\n ans[arrayl[j][1]] = distinctnumbers\r\n j += 1\r\n numberoflsdone += 1\r\n i -= 1\r\n i += 1\r\nelse:\r\n print(*ans, sep=\"\\n\")", "n,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\ndp=[0]*(n+1)\r\nused=set()\r\nflag=0\r\nfor i in range(n-1,-1,-1):\r\n if lis[i] not in used:\r\n flag+=1\r\n used.add(lis[i])\r\n dp[i]=flag\r\nans=[]\r\nfor i in range(m):\r\n ans.append(dp[int(input())-1])\r\nprint('\\n'.join(map(str,ans)))", "from typing import List, Union\r\nfrom collections import namedtuple\r\nimport sys\r\nimport traceback\r\nfrom datetime import datetime\r\nfrom time import perf_counter\r\n\r\n\r\nclass Solution:\r\n def __init__(self, nums):\r\n self.memo = [0 for _ in range(len(nums))]\r\n nums_set = set()\r\n self.memo[-1] = 1\r\n nums_set.add(nums[-1])\r\n for i in range(len(nums) - 2, -1, -1):\r\n if nums[i] not in nums_set:\r\n self.memo[i] = self.memo[i + 1] + 1\r\n nums_set.add(nums[i])\r\n else:\r\n self.memo[i] = self.memo[i + 1]\r\n my = 0\r\n\r\n def sereja_suffixes(self, index):\r\n print(self.memo[index - 1])\r\n return self.memo[index - 1]\r\n\r\n\r\nTestCase = namedtuple('TestCase', 'index correct')\r\n\r\n\r\ndef read_test_cases(input_file, output_file):\r\n nums = None\r\n test_cases: List[TestCase] = []\r\n try:\r\n with open(input_file) as in_f:\r\n with open(output_file) as out_f:\r\n items = in_f.readline().strip().split(' ')\r\n nums_len = int(items[0])\r\n test_num = int(items[1])\r\n nums = in_f.readline().strip().split(' ')\r\n nums = [int(n) for n in nums]\r\n for _ in range(test_num):\r\n index = int(in_f.readline().strip())\r\n correct= int(out_f.readline().strip())\r\n test_cases.append(TestCase(index=index, correct=correct))\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 nums, test_cases\r\n\r\n\r\ndef run_test_cases(nums: List[int], test_cases: List[TestCase]):\r\n solution = Solution(nums)\r\n for t in test_cases:\r\n result = solution.sereja_suffixes(t.index)\r\n print('NUMS:', nums, 'INDEX:', t.index, 'CORRECT:', t.correct, 'RESULT:', result, 'CHECK:', t.correct == result)\r\n\r\n\r\nif __name__ == '__main__':\r\n if len(sys.argv) > 1 and '--debug' in sys.argv:\r\n time_str = datetime.utcnow().strftime('%Y.%m.%d %H:%M:%S')\r\n print('TIME:', time_str)\r\n nums, test_cases = read_test_cases('data/input.txt', 'data/output.txt')\r\n start_counter = perf_counter()\r\n run_test_cases(nums, test_cases)\r\n stop_counter = perf_counter()\r\n print('COUNTER:', stop_counter - start_counter)\r\n else:\r\n items = input().strip().split(' ')\r\n nums_len = int(items[0])\r\n test_num = int(items[1])\r\n nums = []\r\n for _ in range(nums_len):\r\n n_list = []\r\n while True:\r\n c = sys.stdin.read(1)\r\n if c != ' ' and c != '\\n':\r\n n_list.append(c)\r\n else:\r\n break\r\n nums.append(int(''.join(n_list)))\r\n solution = Solution(nums)\r\n for _ in range(test_num):\r\n index = int(input())\r\n solution.sereja_suffixes(index)\r\n\r\n", "n, m = map(int, input().split(\" \"))\n\nar = list(map(int, input().split(\" \")))\n\nm_ar = []\nfor mi in range(m):\n values = int(input())\n m_ar.append(values-1)\n\nmydict = {}\nrsp = [0] * n\n\nfor i in range(n-1, -1, -1):\n if (ar[i] not in mydict.keys()):\n mydict[ar[i]] = 1\n rsp[i] = len(mydict)\n else:\n rsp[i] = len(mydict)\n\nfor a in range(m):\n print(rsp[m_ar[a]])\n" ]

[ "# int(input())\n\n# [int(i) for i in input().split()]\n\nimport sys\n\nsys.setrecursionlimit(20000)\n\ndef go(v,w,last):\n\n if game[v][w][last] >= 0: return(game[v][w][last])\n\n\n\n flag = 0\n\n move = 0\n\n\n\n for p in edges_out[v]:\n\n if p[1] >= last:\n\n move = 1\n\n if not go(w,p[0],p[1]):\n\n flag = 1\n\n break\n\n\n\n if not move or not flag:\n\n game[v][w][last] = 0\n\n return(0)\n\n else:\n\n game[v][w][last] = 1\n\n return(1)\n\n \n\n\n\nn,m = [int(i) for i in input().split()]\n\nedges_in = []\n\nedges_out = []\n\nfor i in range(n):\n\n edges_in.append([])\n\n edges_out.append([])\n\n\n\nfor i in range(m):\n\n s1,s2,s3 = input().split()\n\n v = int(s1)-1\n\n w = int(s2)-1\n\n weight = ord(s3[0]) - ord('a') + 1\n\n edges_out[v].append((w,weight))\n\n edges_in[w].append((v,weight))\n\n\n\ngame = []\n\nfor i in range(n):\n\n tmp1 = []\n\n for j in range(n):\n\n tmp2 = []\n\n for c in range(27):\n\n tmp2.append(-1)\n\n tmp1.append(tmp2)\n\n game.append(tmp1)\n\n\n\n##for v in range(n):\n\n## for w in range(n):\n\n## for last in range(27):\n\n## go(v,w,last)\n\n\n\nfor v in range(n):\n\n s = ''\n\n for w in range(n):\n\n \n\n if go(v,w,0): s = s + 'A'\n\n else: s = s + 'B'\n\n print(s)\n\n\n\n\n\n# Made By Mostafa_Khaled", "#https://codeforces.com/problemset/problem/917/B\n\ndef who_wins(i, j, score):\n global win\n if win[i][j] == None:\n w_max = ''\n for e in v[i]:\n if e[1] > w_max and not who_wins(j, e[0], e[1]):\n w_max = e[1]\n win[i][j] = w_max\n\n return win[i][j] >= score\n\ndef who_wins_c(i, j, score):\n if who_wins(i, j, score):\n return \"A\"\n else:\n return \"B\"\n\nn, m = map(int, input().split())\nwin = [[None for _ in range(n)] for _ in range(n)]\n\nv = [[] for _ in range(n)]\nfor _ in range(m):\n a, b, c = input().split()\n v[int(a) - 1].append((int(b) - 1, c))\n\nw = [['' for _ in range(n)] for _ in range(n)]\nfor i in range(n):\n for j in range(n):\n w[i][j] = who_wins_c(i, j, 'a')\n\nww = \"\\n\".join([\"\".join(s) for s in w])\nprint(ww)", "import sys\r\nreadline=sys.stdin.readline\r\nfrom functools import lru_cache\r\n\r\nN,M=map(int,readline().split())\r\ngraph=[[] for i in range(N)]\r\nfor _ in range(M):\r\n i,j,s=readline().split()\r\n i=int(i)-1\r\n j=int(j)-1\r\n graph[i].append((j,s))\r\n@lru_cache(maxsize=None)\r\ndef main(i,j,turn,prev):\r\n if turn==\"A\":\r\n for x,s in graph[i]:\r\n if prev<=s:\r\n if main(x,j,\"B\",s)==\"A\":\r\n return \"A\"\r\n return \"B\"\r\n if turn==\"B\":\r\n for x,s in graph[j]:\r\n if prev<=s:\r\n if main(i,x,\"A\",s)==\"B\":\r\n return \"B\"\r\n return \"A\"\r\n \r\nfor i in range(N):\r\n print(*[main(i,j,\"A\",\"a\") for j in range(N)],sep=\"\")", "def mat(shape, inital_val=None):\r\n if len(shape) > 1:\r\n return [mat(shape[1:], inital_val) for _ in range(shape[0])] \r\n else:\r\n return [inital_val] * shape[0]\r\n \r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n graph = [{} for _ in range(n)]\r\n for _ in range(m):\r\n v, u, c = input().split()\r\n graph[int(v) - 1][int(u) - 1] = c\r\n \r\n winner_table = mat([n, n, 26])\r\n \r\n def get_winner(u, v, char_to_beat):\r\n \"\"\"\r\n Args:\r\n u: The position of current turn's player. \r\n v: The position of next turn's player.\r\n char_to_beat: The character played in the previous round.\r\n Returns:\r\n 'A' if current turn's player wins, 'B' otherwise.\r\n \"\"\"\r\n char_idx = ord(char_to_beat) - ord('a')\r\n if not winner_table[u][v][char_idx]:\r\n winner = 'B'\r\n for w, c in graph[u].items():\r\n if c >= char_to_beat and get_winner(v, w, c) == 'B':\r\n winner = 'A'\r\n break\r\n winner_table[u][v][char_idx] = winner\r\n return winner_table[u][v][char_idx]\r\n \r\n for i in range(n):\r\n print(''.join(get_winner(i, j, 'a') for j in range(n)))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# LUOGU_RID: 132896140\n# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\nimport sys\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\ndef solve():\r\n n, m = M()\r\n dp = [[[-1 for i in range(26)] for j in range(n + 1)] for k in range(n + 1)]\r\n adj = [[] for i in range(n + 1)]\r\n\r\n for _ in range(m):\r\n u, v, c = S()\r\n u = int(u)\r\n v = int(v)\r\n c = ord(c) - ord('a')\r\n adj[u].append((v, c))\r\n\r\n def dfs(u, v, c):\r\n if dp[u][v][c] != -1:\r\n return dp[u][v][c]\r\n dp[u][v][c] = 0\r\n for p in adj[u]:\r\n x = p[0]\r\n t = p[1]\r\n if t < c:\r\n continue\r\n if dfs(v, x, t) == 0:\r\n dp[u][v][c] = 1\r\n return 1\r\n return 0\r\n\r\n for i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n print('A' if dfs(i, j, 0) == 1 else 'B', end = '')\r\n print('')\r\n\r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n\r\n\r\n\r\n" ]

[ "n,m=[int(x) for x in input().split()]\r\nnum=[int(x) for x in input().split()]\r\nop=[int(x) for x in input().split()]\r\nfin=[]\r\nfor x in num:\r\n\tif x in op:\r\n\t\tfin.append(str(x))\r\nprint(' '.join(fin))", "n, m = map(int, input().split(\" \"))\r\nsequence = list(map(int, input().split(\" \")))\r\nfingerprints = list(map(int, input().split(\" \")))\r\nfor ele in sequence:\r\n if ele in fingerprints:\r\n print(ele, end = ' ')", "a,b = map(int,input().split())\r\ny = [int(i) for i in input().split()]\r\ng = {i for i in input().split()}\r\ns = []\r\nfor i in range(a):\r\n if str(y[i]) in g:\r\n s.append(y[i])\r\nfor i in range(len(s)):\r\n print(s[i],end=' ')", "n, m = map(int, input().split())\nsequence = list(map(int, input().split()))\nbuttons = list(map(int, input().split()))\n\ncode = []\n\nfor digit in sequence:\n if digit in buttons:\n code.append(digit)\n\nprint(*code)\n", "number1, number2 = input().split()\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\nfor x in lst1:\r\n for y in lst2:\r\n if x == y:\r\n print(y, end=\" \")", "n, m = map(int, input().split())\r\na = list(map(int, input().strip().split()))[:n]\r\nb = list(map(int, input().strip().split()))[:m]\r\nl3 = []\r\nfor element in a:\r\n if element in b:\r\n l3.append(element)\r\n\r\nprint(*l3)\r\n", "[n, m] = [int(i) for i in input().split()]\r\n\r\nseq = [int(i) for i in input().split()]\r\nfing = [int(i) for i in input().split()]\r\n\r\nans = []\r\nfor i in seq:\r\n if(i in fing):\r\n ans.append(str(i))\r\nprint(' '.join(ans))", "def solution994a():\n _ = input()\n sequence = map(int, input().split())\n codes = list(map(int, input().split()))\n\n for s in sequence:\n if s in codes:\n print(s, end=\" \")\n\n\nif __name__ == '__main__':\n solution994a()\n", "n,m=map(int,input().split())\r\nseq=list(map(str,input().split()))\r\nfp=list(map(str,input().split()))\r\nchecklist=[]\r\nfor number in seq:\r\n if(number in fp):\r\n checklist.append(number)\r\nprint(\" \".join(checklist))", "n, m = map(int, input().split())\r\nxs = map(int, input().split())\r\nys = map(int, input().split())\r\nflags = [False] * 10\r\n\r\nfor y in ys:\r\n flags[y] = True\r\n\r\nres = (str(x) for x in xs if flags[x])\r\nprint(\" \".join(res))\r\n", "# Codeforces Round #486 (Div. 3)\r\nimport collections\r\nfrom functools import cmp_to_key\r\n#key=cmp_to_key(lambda x,y: 1 if x not in y else -1 )\r\n\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\nimport bisect \r\n \r\n \r\nn,m = getIntList()\r\n\r\nx = getIntList()\r\ny = getIntList()\r\n\r\ny = set(y)\r\n\r\nfor x0 in x :\r\n if x0 in y:\r\n print(x0, end = ' ')\r\n", "map(int,input().split());k=[int(i) for i in input().split()];n=[int(i) for i in input().split()];p=[]\r\nfor i in n:\r\n if i in k:p=p+[[k.index(i),i]]\r\np=sorted(p)\r\nfor i in range(0,len(p)):print(p[i][1],end=\" \")", "c = input()\r\nn = int(list(c.split())[0])\r\nm = int(list(c.split())[1])\r\nseq = list(input().split())\r\nfprnt = list(input().split())\r\nx = list(filter(lambda seq: seq in fprnt,seq))\r\nfor i in range(len(x)):\r\n print(x[i],end=' ')\r\n", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = set(map(int, input().split()))\r\nprint(\" \".join(str(el) for el in x if el in y))\r\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\na = [int(s) for s in input().split()]\r\nb = [int(s) for s in input().split()]\r\nc = []\r\nfor i in range(n):\r\n if a[i] in b:\r\n c.append(a[i])\r\nprint(*c)", "n,m=[int(x) for x in list(input().split())]\r\na=[int(x) for x in list(input().split())]\r\nb=[int(x) for x in list(input().split())]\r\ns=''\r\nfor i in range(0,n):\r\n if a[i] in b:\r\n print(a[i],' ')\r\n \r\n", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nm,n = map(int, input().split())\r\na= input().split()\r\nc= input().split()\r\nfor i in a:\r\n if i in c:\r\n print(i, end = ' ')", "n,m = map(int,input().split())\r\nikn = list(map(int,input().split()))\r\nstp = list(map(int,input().split()))\r\ncode = []\r\nfor i in range(n):\r\n if ikn[i] in stp:\r\n code.append(ikn[i])\r\nfor i in range(len(code)):\r\n print(code[i],end=' ')", "n,m=map(int,input().split())\r\nln=list(map(int,input().split()))\r\nlm=list(map(int,input().split()))\r\nfor i in ln:\r\n if i in lm:\r\n print(i,end=' ')", "n,m=[int(_) for (_) in input().split()]\r\nl=list(map(int,input().split()))[:n]\r\np=list(map(int,input().split()))[:m]\r\nx=[]\r\nfor i in l:\r\n if i in p:\r\n x.append(i)\r\nprint(*(x))", "#994A Fingerprints \n\nentrada = input().split()\nn = int(entrada[0])\nm = int(entrada[1])\n\nsequence = input().split()\nsequence = [int(x) for x in sequence]\n\nfingerprints = input().split()\nfingerprints = [int(x) for x in fingerprints]\n\nans = []\n\nfor digit in sequence:\n if digit in fingerprints:\n ans.append(digit)\n\nprint(' '.join([str(x) for x in ans]))\n\n\n\n\n\n\n", "def euclid_algo(a, b):\r\n if a < b:\r\n a, b = b, a\r\n if b == 0:\r\n return a\r\n return euclid_algo(b, a % b)\r\n\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a_n = [int(i) for i in input().split(\" \")]\r\n b_m = [int(i) for i in input().split(\" \")]\r\n output_list = []\r\n for i in a_n:\r\n for j in b_m:\r\n if i == j:\r\n output_list.append(str(i))\r\n return \" \".join(output_list)\r\n\r\n\r\n\r\nprint(main_function())", "a= input()\r\nc = list(map(int,input().split()))\r\nd = list(map(int,input().split()))\r\nprint(*[x for x in c if x in d])", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\na=list(q())\r\nb=list(q())\r\nprint(*[i for i in a if i in b])", "n, m = map(int, input().split())\r\nx, y = list(map(int, input().split())), list(map(int, input().split()))\r\nfor i in x:\r\n if i in y: print(i, end = \" \")", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\nfrom collections import Counter\r\n\r\nn,m = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\n\r\nli = []\r\nfor i in arr:\r\n\tif i in s:\r\n\t\tli.append(i)\r\nfor i in li:\r\n\tprint(i, end=' ')\r\n", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nk = list(map(int,input().split()))\r\nind = []\r\nfor i in range(m):\r\n\tif k[i] in l:\r\n\t\tind.append(l.index(k[i]))\r\nind.sort()\r\nfor i in ind:\r\n\tprint(l[i],end=\" \")", "n, m = map(int, input().split())\r\n\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\n\r\nz = []\r\n\r\nfor i in x:\r\n if i in y and i not in z:\r\n z.append(i)\r\nprint(*z)\r\n", "n,m = map(int,input().split())\r\nl = [int(num) for num in input().strip().split()]\r\n#print(l)\r\nf = [int(key) for key in input().strip().split()]\r\n\r\n#print(f)\r\n\r\nfor numbers in l:\r\n for keys in f:\r\n if numbers==keys:\r\n print(numbers)\r\n\r\n\r\n\r\n\r\n#a=[sum(map(int,input().split()))for _ in[0]*int(input())]", "(n,k)=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\nfor i in range(n):\r\n if l[i] in f:\r\n print(l[i],end=\" \")\r\n", "import itertools\r\nimport math\r\nimport sys\r\nimport heapq\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom fractions import gcd\r\nfrom functools import reduce\r\n\r\nsys.setrecursionlimit(4100000)\r\nINF = 1 << 60\r\nMOD = 10 ** 9 + 7\r\n\r\n# ここから書き始める\r\nn, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nfor i in x:\r\n if i in y:\r\n print(\"%d \" % i, end=\"\")\r\n", "a = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\ny = set(list(map(int, input().split())))\r\nans = []\r\nfor elem in x:\r\n if elem in y:\r\n ans.append(elem)\r\nprint(*ans)\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set(map(int, input().split()))\r\nz = []\r\nfor q in range(n):\r\n if a[q] in s:\r\n z.append(a[q])\r\nprint(*z)\r\n", "n,m=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nfor i in range(n):\r\n if x[i] in y:\r\n print(x[i],end=' ')\r\n ", "#include <bits/stdc++.h>\r\n#define SYNC ios_base::sync_with_stdio(0);\r\n#define IO cin.tie(0);\r\n#define STD /*\r\nfrom sys import (\r\nstdin, stdout, exit as sys_ret)\r\n\"\"\"****************************\r\n\r\n Interactive Tasks:\r\n\r\n / Python: / \"\"\"\r\nf_input, f_print, f_flush = (\r\n stdin.readline,\r\n stdout.write,\r\n stdout.flush)\r\n\r\n\"\"\" / C++ /\r\n #import <cstdio>\r\n fflush(stdout);\r\n or\r\n #import <iostream>\r\n cout << endl;\r\n\r\n —————————————————————————\r\n Don't raise your voice,\r\n improve your argument.\r\n —————————————————————————\r\n\r\n cat /dev/ass > /dev/head\r\n Ctrl+C\r\n cat /knowledge > /dev/head\r\n\r\n © Jakov Gellert\r\n frvr.ru\r\n\r\n****************************\"\"\"\r\n# */ using namespace std; int\r\n#define boost_stream(); SYNC IO\r\n\r\nlength, amount = map(int, f_input().split())\r\nseq, touched = [int(_) for _ in f_input().split()], {int(__) for __ in f_input().split()}\r\nfor i in seq:\r\n if i in touched:\r\n f_print(str(i) + ' ')", "s=input().split(' ')\r\na=input().split(' ')\r\nb=input().split(' ')\r\n\r\nfor i in a:\r\n if i in b:\r\n print(i,end=\" \")", "n,m = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nbi = list(map(int,input().split()))\r\nfor i in ai:\r\n if i in bi:\r\n print(i,end=' ')", "input()\r\nx, y = input().split(), set(input().split())\r\nprint(' '.join([c for c in x if c in y]))", "s = list(map(int,input().split()))\r\nn=s[0]\r\nm=s[1]\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nf=[]\r\nfor i in a:\r\n if i in b:\r\n f.append(i)\r\nprint(*f)\r\n \r\n\r\n", "a,b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\ns = []\r\nfor i in l:\r\n for j in k:\r\n if(i==j):\r\n s.append(i)\r\nfor i in s:\r\n print(i,end=' ')\r\n", "def digit_sequence(sequence, fingerprints):\r\n code = []\r\n for element in sequence:\r\n if element in fingerprints:\r\n code.append(element)\r\n return code\r\n \r\nn, m = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\nfingerprints = list(map(int, input().split()))\r\n\r\nprint(\" \".join(map(str, digit_sequence(sequence, fingerprints))))", "m,n=[int(x) for x in input().split(\" \")]\r\nl=[int(x) for x in input().split(\" \")]\r\nl1=[int(x) for x in input().split(\" \")]\r\nfor i in l:\r\n if i in l1:\r\n print(i,end=\" \")", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\nt = [False] * n\nb = list(map(int, input().split()))\nfor i in range(m):\n for j in range(n):\n if a[j] == b[i]:\n t[j] = True\nfor i in range(n):\n if t[i]:\n print(a[i], end=' ')\n", "m,n = map(int,input().split())\r\nseq = list(map(int,input().split()))\r\nfin_pri = list(map(int,input().split()))\r\nx = []\r\nfor i in seq:\r\n if i in fin_pri:\r\n x.append(i)\r\nprint(*x)", "import sys\r\n\r\ndef solution():\r\n line = input()\r\n n = int(line.split()[0])\r\n m = int(line.split()[1])\r\n seq = list(map(int, input().split()))\r\n fp = list(map(int, input().split()))\r\n result = []\r\n \r\n for el in seq:\r\n if el in fp:\r\n result.append(el)\r\n \r\n print(*result, sep=' ')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "n, m = map(int, input().split(' '))\nxs = list(map(int, input().split(' ')))\nys = set(map(int, input().split(' ')))\nprint(*[x for x in xs if x in ys])", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\n\r\nl=input().split()\r\nl=[int(i) for i in l]\r\nk=input().split()\r\nk=[int(i) for i in k]\r\ns=set(k)\r\nfor i in l:\r\n if i in s:\r\n print(i,end=' ')\r\n", "m,n = map(int,input().split())\nl = list(map(int,input().split()))\ns = list(map(int,input().split()))\nt =[]\nfor i in range(n):\n for j in range(m):\n if s[i] == l[j]:\n t.append(j)\nt.sort()\nfor i in t:\n print(l[i],end =' ')\nprint()\n", "p, f = map(int, input().split())\r\npos = list(map(int, input().split()))\r\nfin = list(map(int, input().split()))\r\nflag = 0\r\nfor elem in pos:\r\n if elem in fin:\r\n print(elem, end= ' ')\r\n flag = 1\r\nif flag==0:\r\n print(' ')\r\n", "n,k = list(map(int,input().split()))\r\nnums = input().split()\r\nfprint = input().split()\r\na = []\r\nfor i in range(n):\r\n if nums[i] in fprint:\r\n a.append(nums[i])\r\nprint(\" \".join(a))", "n=input().split()\r\nsubseq=input().split()\r\nfingerprint=input().split()\r\ncounter=0\r\nfor i in range(int(n[0])):\r\n\tif subseq[i] in fingerprint:\r\n\t\tif(counter==0):\r\n\t\t\tprint(subseq[i],end=\"\")\r\n\t\t\tcounter=1\r\n\t\telse:\r\n\t\t\tprint(\"\",subseq[i],end=\"\")\r\n", "str1 = list(map(int,input().split()))\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nans = []\r\nfor a in x:\r\n if a in y:\r\n ans.append(a)\r\nprint (' '.join(list(map(str,ans))))", "n,m=map(int, input().split())\r\nli=[int(x) for x in input().split()]\r\nl2=[int(x) for x in input().split()]\r\nfor ele in li:\r\n if ele in l2:\r\n print(ele,end=\" \")\r\n\r\n\r\n", "n, l = map(int, input().split()); A = list(input().split()); B = list(input().split())\r\nC = \"\"\r\nfor i in A:\r\n if i in B:\r\n C += i\r\nprint(\" \".join(C))", "x,y =input().split()\r\nlst1 = list(map(int,input().split()))\r\nlst2 = list(map(int,input().split()))\r\nfor i in lst1:\r\n for t in lst2:\r\n if i == t:\r\n print(i,end=\" \")", "n = list(map(int, input().split()))\r\ncode = list(map(int, input().split()))\r\nfprints = list(map(int, input().split()))\r\nfpos = []\r\nfprints.sort()\r\n\r\ndef solve(n, code, fprints):\r\n\tfor fprint in fprints:\r\n\t\tif fprint in code:\r\n\t\t\tfpos.append(code.index(fprint))\r\n\tfpos.sort()\r\n\tfor x in fpos:\r\n\t\tprint(code[x], end = \" \")\r\n\t\t\r\nsolve(n, code, fprints)\r\n\r\n", "n, m=[int(n)for n in input().split()]\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nfor i in range (n):\r\n for j in range (m):\r\n if(x[i]==y[j]):\r\n print(x[i],end=\" \")\r\n else:\r\n pass", "n, m = map(int, input().split())\r\n\r\nkeys =list(map(int, input(\"\").strip().split()))\r\nfingerprints = list(map(int, input(\"\").strip().split()))\r\nres = []\r\n\r\nfor key in keys:\r\n if key in fingerprints:\r\n res.append(key)\r\n\r\n\r\nprint(*res)", "input()\na = map(int, input().split())\nprint(*filter(list(map(int, input().split())).count, a), sep=' ')\n", "f=lambda:map(int,input().split())\r\nn1,n2=f()\r\nl1=list(f())\r\nl2=list(f())\r\nind=[]\r\nfor i in l2:\r\n if i in l1:\r\n ind.append(l1.index(i))\r\nind.sort()\r\n[print(l1[i],end=' ') for i in ind if i!=-1]\r\n", "# CODE HERE\r\nn, m = map(int, input().split(' '))\r\nseq = list(map(int, input().split(' ')))\r\nfp = list(map(int, input().split(' ')))\r\n\r\nans = list()\r\n\r\nfor i in seq:\r\n if i in fp:\r\n print(i, end=' ')\r\n\r\nprint()", "n, m = [int(i) for i in input().split()]\r\n\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\n\r\ninter = set(x) & set(y)\r\n\r\n#print(x, y, inter)\r\n\r\nfor i in x:\r\n if i in inter:\r\n print(i, end=\" \")", "sequenceSze, keys = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\nfingerprints = list(map(int, input().split()))\r\nexisted = []\r\nfor fp in fingerprints:\r\n if(fp in sequence):\r\n existed.append(fp)\r\ndiction = {}\r\nfor ex in existed:\r\n tv = sequence.index(ex)\r\n diction[ex] = tv\r\nsortedDic = sorted(diction.items(), key=lambda x:x[1])\r\nfor temp in sortedDic:\r\n print(temp[0], end=\" \")", "n,m=map(int,input().split());a=list(map(int,input().split()));b=list(map(int,input().split()));s=[]\r\nfor i in b:\r\n if i in a:s.append(a.index(i))\r\ns.sort()\r\nfor i in range(len(s)):s[i]=a[s[i]]\r\nprint(*s)", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nl=list()\r\nfor i in range(m):\r\n for j in range(n):\r\n if(y[i]==x[j]):\r\n l.append(j)\r\nprint(' '.join(map(str,[x[i] for i in sorted(l)])))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nl=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\n\r\nfor i in p:\r\n\tif i in q:\r\n\t\tprint(i,end=\" \")\r\n", "# A. Fingerprints\r\n\r\nn,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nL=[i for i in l1 if i in l2]\r\n\r\nfor i in range(0,len(L)):\r\n print(L[i],end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\nn1= list(map(int,input().split()))[:n]\r\nn2= list(map(int,input().split()))[:m]\r\nfor i in n1:\r\n for j in n2:\r\n if i==j:\r\n print(i,end=\" \")", "n, m = map(int, input().split())\r\na = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nfor x in a:\r\n if x in b:\r\n print(x, end=' ')\r\n\r\n", "\r\nheader = input()\r\nheader = [int(i) for i in header.split()]\r\n\r\nnums = input()\r\nnums = [int(i) for i in nums.split()]\r\n\r\ntargets = input()\r\ntargets = [int(i) for i in targets.split()]\r\n\r\nout = []\r\n\r\nfor i in range(len(nums)):\r\n\r\n if nums[i] in targets:\r\n out.append(nums[i])\r\n\r\nprint(\" \".join([str(o) for o in out]))", "def s():\r\n n,m=[int(x) for x in input().split(\" \")]\r\n n = [int(x) for x in input().split(\" \")]\r\n m = [int(x) for x in input().split(\" \")]\r\n ans = []\r\n for x in n:\r\n if x in m:\r\n ans.append(x)\r\n for x in ans: print(x, end=\" \")\r\n\r\ns()\r\n", "\nn, m = [int(x) for x in input().split()]\n\nx = [int(x_) for x_ in input().split()]\ny = [int(x_) for x_ in input().split()]\n\nres = \"\"\n\nfor el in x:\n if el in y:\n res += str(el) + \" \"\nprint(res[:-1])", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nk = [int(x) for x in input().split()]\r\nl = []\r\nf = []\r\nfor i in range(len(k)):\r\n if(k[i] in a):\r\n l.append(a.index(k[i]))\r\nl.sort()\r\nfor i in range(len(l)):\r\n f.append(a[l[i]])\r\nfor i in range(len(f)):\r\n print(f[i],end = \" \")\r\n ", "def find(a):\r\n global AA\r\n for i in range(len(AA)):\r\n if AA[i]==int(a):\r\n AA=AA[:i]+AA[i+1:]\r\n return 1\r\n return 0\r\ndef find1(a):\r\n for i in range(len(B)):\r\n if B[i]==a:\r\n return 1\r\n return 0\r\naaaaaaaaaaaaaa=input()\r\na=input()+' '\r\nb=''\r\nA=[]\r\nfor j in range(len(a)):\r\n if a[j]==' ':\r\n A.append(int(b))\r\n b=''\r\n else:\r\n b+=a[j]\r\nAA=A[:]\r\na1=input()+' '\r\nb1=''\r\nB=[]\r\nfor j in range(len(a1)):\r\n #print(b1)\r\n if a1[j]==' ':\r\n if find(b1)==1:\r\n B.append(int(b1))\r\n b1=''\r\n else:\r\n b1+=a1[j]\r\nC=[]\r\nfor i in A:\r\n if find1(i)==1:\r\n C.append(i)\r\nprint(*C)\r\n", "a,b = map(int, input().split(' '))\r\n\r\nx = []\r\nfor i in input().split(' '): \r\n x.append(i)\r\ny = []\r\nfor j in input().split(' '): \r\n y.append(j)\r\n\r\npwd = []\r\n\r\nfor ele in x:\r\n if ele in y:\r\n pwd.append(ele)\r\nprint(' '.join(pwd))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=[]\r\nfor i in range(m):\r\n\tif l2[i] in l:\r\n\t\ta=l.index(l2[i])\r\n\t\tl3.append(a)\r\nl3.sort()\r\nfor i in range(len(l3)):\r\n\tprint(l[l3[i]],end=\" \")\t", "n, m = map(int, input().split())\r\nc = map(str, input().split())\r\nf = map(str, input().split())\r\nl1 = list(c)\r\nl2 = list(f)\r\nans = ''\r\ni = 0\r\nfor j in range(n):\r\n if l1[i] in l2:\r\n ans += l1[i] + ' '\r\n i += 1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\na1=list(map(int,input().split()))\r\na2=list(map(int,input().split()))\r\nmk=[0]*10\r\nfor i in a1: mk[i]+=1\r\nfor i in a2: mk[i]+=1\r\nfor i in range(len(a1)):\r\n if mk[a1[i]]==2: print(a1[i],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\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nl=[]\r\nfor i in x:\r\n if i in y:\r\n l.append(i)\r\nprint(' '.join(map(str,l)))", "n,m=map(int,input().split(' '))\r\ndef inputa():\r\n ip=list(map(int,input().split(' ')))\r\n op=list(map(int,input().split(' ')))\r\n pm={}\r\n for i,j in enumerate(op):\r\n try:\r\n pm[ip.index(j)]=[j]\r\n except:\r\n continue\r\n w=dict(sorted(pm.items()))\r\n for i in w:\r\n print(w[i][0],end=' ')\r\ninputa()\r\n\r\n", "n, m = map(int, input().split())\r\nseq = list(map(int, input().split()))\r\nfp = list(map(int, input().split()))\r\nnew = {}\r\nfor i in fp:\r\n new[i] = 1\r\n\r\nfor i in seq:\r\n if new.get(i, -1) != -1:\r\n print(i, end=\" \")\r\nprint(end=\"\\n\")\r\n\r\n", "n,m=list(map(int,input().split()))\r\nnl=list(map(int,input().split()))\r\nml=list(map(int,input().split()))\r\nfor i in nl:\r\n if i in ml:\r\n print(i,end=' ')\r\n", "k,l=map(int,input().split())\r\nls=(list(map(int,input().split())))\r\nls2=(list(map(int,input().split())))\r\nl=[]\r\nfor i in range(len(ls)):\r\n if ls2.count(ls[i]):\r\n l.append(ls[i])\r\nfor x in l:\r\n print(x,end=' ')\r\n", "n, m = map(int, input().split())\r\n\r\nx = 2\r\n\r\nl = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\n\r\nfor fp in l:\r\n if fp in m:\r\n print(fp, end = \" \")", "n, m = list(map(int, input().split()))\r\nlist1 = list(map(int, input().split()))\r\nlist2 = list(map(int, input().split()))\r\nfor i in list1:\r\n if i in list2:\r\n print(i, end=\" \")\r\n", "input()\r\nx = [int(k) for k in input().split()]\r\ny = [int(k) for k in input().split()]\r\ni = 0\r\ns = len(x)\r\nwhile i < s:\r\n if x[i] not in y:\r\n x.pop(i)\r\n else:\r\n i += 1\r\n s = len(x)\r\nprint(*x)", "x,y = map(int,input().split())\r\n\r\ndata = list(map(int, input().split()))\r\nkey = list(map(int,input().split()))\r\nnewData = []\r\n\r\nfor sequence in range(len(data)):\r\n if(data[sequence] in key): newData.append(data[sequence])\r\n\r\n\r\nprint(*newData)\r\n", "n, m = map(int, input().split())\r\nln = list(map(int,input().split()))\r\nln = ln[:n]\r\n\r\nlm = list(map(int, input().split()))\r\nlm = lm[:m]\r\n\r\nlr = []\r\n\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if ln[i] == lm[j] :\r\n lr.append(ln[i])\r\n\r\n\r\nprint(*lr)", "#994A in codeforces\r\nn,m = map(int,input().split())\r\nseq = list(map(int,input().split()))\r\nfingers = list(map(int,input().split()))\r\npassword = []\r\nfor i in seq:\r\n\tif i in fingers:\r\n\t\tpassword.append(i)\r\nfor i in password:\r\n\tprint(i,end = \" \")", "excess = input()\nfirst = [int(x) for x in input().split()]\nsecond = [int(x) for x in input().split()]\nanswer = [str(x) for x in first if x in second]\nprint(' '.join(answer))\n", "input()\r\nl1 = input().replace(\" \",\"\")\r\nl2 = input().replace(\" \",\"\")\r\ns = \"\"\r\nfor c in l1:\r\n if c in l2:\r\n s+=c+\" \"\r\nprint(s[:-1],end=\"\")", "n = input()\r\nk = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\n\r\nresult = []\r\nfor e in k:\r\n if e in p:\r\n result.append(e)\r\nprint(' '.join(map(str, result)))", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor _ in range(len(a)):\r\n if a[_] in b:\r\n c.append(a[_])\r\nprint(*c)", "n,m = list(map(int, input().split()))\n\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\ncode = []\n\nfor i in range(n):\n\tfor j in range(m):\n\t\tif x[i]==y[j]:\n\t\t\tcode.append(x[i])\n\nprint(\" \".join(str(a) for a in code))\n\n", "IL = lambda: list(map(int, input().split()))\r\nn, m = IL()\r\nX = IL()\r\nY = IL()\r\nprint(*[x for x in X if x in Y])", "n,m=map(int,input().split())\r\nnum=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif num[i] in f:\r\n\t\tprint(num[i],end=\" \")", "a,b = input().split()\r\nsList = list(map(int,input().split()))\r\nkList = list(map(int,input().split()))\r\nmList = []\r\nfor s in sList:\r\n for k in kList:\r\n if s == k:\r\n mList.append(s)\r\nprint(*mList)\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\nc=[]\r\nfor i in a:\r\n if i in b:\r\n c.append(i)\r\nfor i in c:\r\n print(i,end=' ')", "n, m = map(int, input().split())\r\nknown_seq = list(map(int, input().split()))\r\nfingerprinted_buttons = set(map(int, input().split()))\r\nbest_code = []\r\nfor i in range(1 << n):\r\n code = [known_seq[j] for j in range(n) if i & (1 << j)]\r\n if all(digit in fingerprinted_buttons for digit in code):\r\n if len(code) > len(best_code):\r\n best_code = code\r\nprint(*best_code) if best_code else print()\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(len(a)):\r\n if a[i] in b:\r\n x.append(a[i])\r\nprint(*x,sep=\" \")", "n,m = map(int,input().split())\r\ns1 = list(map(int,input().split()))\r\ns2 = list(map(int,input().split()))\r\n\r\nfor i in s1:\r\n if i in s2:\r\n print(i,end=\" \")", "n,m=map(int,input().split())\r\nl1=input().split()\r\nl2=input().split()\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif l1[i]==l2[j]:\r\n\t\t\tprint(l1[i],end=' ')", "x, y = list(map(int, input().split()))\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nans = []\r\nfor i in l1:\r\n if i in l2:\r\n ans.append(i)\r\nfor i in ans:\r\n print(i, end=\" \")", "n,m=input().split()\na=input().split()\nb=input().split()\nans=[i for i in a if i in b]\nprint(\" \".join(ans))", "\r\n\r\nfrom __future__ import print_function\r\nfrom queue import Queue\r\nimport sys\r\nimport math\r\nimport os.path\r\n\r\n\r\ndef log(*args, **kwargs):\r\n print(*args, file=sys.stderr, **kwargs)\r\n\r\n\r\n# INPUT\r\ndef ni():\r\n return map(int, input().split())\r\n\r\n\r\ndef nio(offset):\r\n return map(lambda x: int(x) + offset, input().split())\r\n\r\n\r\ndef nia():\r\n return list(map(int, input().split()))\r\n\r\n# CONVERT\r\n\r\n\r\ndef toString(aList, sep=\" \"):\r\n return sep.join(str(x) for x in aList)\r\n\r\n\r\ndef toMapInvertIndex(aList):\r\n return {k: v for v, k in enumerate(aList)}\r\n\r\n\r\n# MAIN\r\nn,m = ni()\r\nx = nia()\r\ny = nia()\r\n\r\ns = []\r\nfor xi in x:\r\n if xi in y:\r\n s += [xi]\r\n\r\nprint(toString(s))", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n if(a[i] in b):\r\n l.append(a[i])\r\nprint(' '.join(map(str,l)))\r\n", "n, m = map(int, input().split())\r\nseq = list(map(int, input().split()))\r\nfprints = set(map(int, input().split()))\r\n\r\nfiltered_seq = [x for x in seq if x in fprints]\r\n\r\nresult = []\r\nfor x in seq:\r\n if x in filtered_seq:\r\n result.append(x)\r\n filtered_seq.remove(x)\r\n\r\nprint(*result)", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nr = [str(i) for i in x if i in y]\r\nprint(' '.join(r))", "n,m=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\n\r\nfor i in l:\r\n if i in t:\r\n print(i,end=\" \")", "param= list(map(int, input().split()))\r\nn, m = param[0], param[1]\r\nX = input().split()\r\nY = set(input().split())\r\n\r\nres = []\r\n\r\nfor i in range(n):\r\n if X[i] in Y:\r\n res.append(X[i])\r\n\r\nprint(' '.join(res))", "(n,m) = tuple(map(int,input().split(' ')))[:2]\r\ns1 = tuple(map(int,input().split(' ')))[:n]\r\ns2 = tuple(map(int,input().split(' ')))[:m]\r\ns = []\r\nfor i in s1:\r\n if i in s2:\r\n s.append(i)\r\nstrok = ''\r\nfor i in s:\r\n strok += str(i) + ' '\r\n\r\nprint(strok)", "n = input().split()\r\na = input().split()\r\nb = input().split()\r\n\r\nfor i in a:\r\n for j in b:\r\n if j in i:\r\n print(j, end = \" \")", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\ne=[]\r\nfor i in range(a):\r\n\tf=c[i]\r\n\tfor j in range(len(d)):\r\n\t\tif f==d[j]:\r\n\t\t\te.append(c[i])\r\nfor i in range(len(e)):\r\n\tprint(e[i],end=\" \")\t\t\r\n", "n , m = map(int,input().split())\r\np = list(map(int,input().split()))\r\no = list(map(int,input().split()))\r\nl = []\r\nfor i in range(m):\r\n\tif o[i] in p:\r\n\t\tin_ = p.index(o[i])\r\n\t\tl.append(in_)\r\n\t\tl.sort()\r\nfor j in range(len(l)):\r\n\tprint(p[l[j]],end=\" \")\t\t\r\n\t\t", "n,m=map(int,input().split())\r\nl1=input().split()\r\nl2=input().split()\r\nfor i in range(n):\r\n\t\tif l1[i] in l2:\r\n\t\t\tprint(l1[i],end=' ')", "n, m = input().split()\nn = int(n)\nm = int(m)\na = input().split()\nb = input().split()\nm = ''\nfor i in range(n):\n if a[i] in b:\n m = m + ' ' + str(a[i])\nprint(m)", "import collections\r\n\r\nn, m = map(int, input().split())\r\nseq = [int(i) for i in input().split()]\r\nfinger = [int(i) for i in input().split()]\r\n\r\nfor i in seq:\r\n if i in finger:\r\n print(i, end=\" \")\r\n", "q = input()\r\nn, m = q.split()\r\nn = int(n)\r\nm = int(m)\r\nn11 = input().split()\r\nm11 = input().split()\r\nfor i1 in range(n):\r\n if n11[i1] in m11:\r\n print(n11[i1], end=\" \")\r\n\r\n", "n,m=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nd1={}\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nfor i in range(len(l2)):\r\n for j in range(len(l1)):\r\n if l1[j]==l2[i]:\r\n d1[j]=l2[i]\r\nfor i in range(n):\r\n if i in d1.keys():\r\n print(d1[i],end=\" \")", "n,m=[int(x) for x in input().split()]\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if(a[i]==b[j]):\r\n c.append(a[i])\r\nfor k in range(0,len(c)):\r\n print(c[k],end=\" \")\r\n", "n,m=(int(x) for x in input().split())\r\n\r\nx_list=list(int(x) for x in input().split())\r\ny_list=list(int(x) for x in input().split())\r\n\r\nfor x in x_list:\r\n if x in y_list:\r\n print(x, end=' ')\r\n", "#ZadA\r\nn,m=map(int, input().split())\r\nposl=list(map(int,input().split()))\r\notp=list(map(int,input().split()))\r\nans=[]\r\nfor i in otp:\r\n if i in posl:\r\n ans.append((posl.index(i),i))\r\nans.sort()\r\nprint(' '.join(str(n[1]) for n in ans))", "input()\r\n\r\nar1 = list(map(int, input().split()))\r\nar2 = set(list(map(int, input().split())))\r\n\r\nans = []\r\n\r\nfor a in ar1:\r\n if a in ar2:\r\n ans += [a]\r\nfor a in ans:\r\n print(a, end= ' ') ", "n, m = map(int, input().split())\r\n\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\n\r\n'''\r\na=set(l1)\r\nb=set(l2)\r\nprint(a.intersection(l2))\r\n'''\r\nl = [i for i in l1 if i in l2]\r\nprint(*l)", "dum, seq, fp = input(), list(map(int, input().split())), list(map(int, input().split()))\nprint(' '.join(str(x) for x in seq if x in fp))\n", "n,m = [int(i) for i in input().split()]\r\nx = [int(i) for i in input().split()]\r\ny =[int(i) for i in input().split()]\r\nfor i in x:\r\n if i in y:\r\n print(i,end = \" \")\r\nelse:\r\n print(\" \")", "def solve():\r\n size_a, size_b = input().split()\r\n a = input().split()\r\n b = input().split()\r\n \r\n for number in a:\r\n if number in b:\r\n print(number, end=' ')\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n,m=(int(x) for x in input().split())\r\nsequence=input().split()[:n]\r\nfingerprint=input().split()[:m]\r\nprint(\" \".join(i for i in sequence if i in fingerprint))", "arr = list(map(int,input().strip().split()))[:2]\nn = arr[0]\nm = arr[1]\na1 = list(map(int,input().strip().split()))[:n]\na2 = list(map(int,input().strip().split()))[:m]\nans = []\nfor i in range(n):\n if a1[i] in a2:\n ans.append(a1[i])\nif not a1:\n print()\nelse:\n for i in range(len(ans)):\n print(ans[i], end=\" \")\n \t\t \t\t \t\t \t\t \t\t\t \t\t \t \t", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\ne=[]\r\nfor x in c:\r\n\tif x in d:\r\n\t\te.append(x)\r\nprint(*e)", "n,m=map(int,input().split())\r\nli1=list(map(int,input().split()))\r\nli2=list(map(int,input().split()))\r\nfor i in range(n):\r\n if li1[i] in li2:\r\n print(li1[i], end=\" \")", "import sys\n\nn, m = [int(i) for i in input().split()]\nx = [int(i) for i in input().split()]\ny = [int(i) for i in input().split()]\nfor i in x:\n if i in y:\n print(i, end = \" \")\n", "# read input values\r\nn, m = map(int, input().split())\r\ndigits = list(map(int, input().split()))\r\nfingerprints = set(map(int, input().split()))\r\n\r\n# filter out digits that are not on the keypad with fingerprints\r\ncode = [d for d in digits if d in fingerprints]\r\n\r\n# print the resulting code\r\nprint(*code)\r\n", "n, m = map(int, input().split())\r\nx = input().split()\r\ny = input().split()\r\nresult = []\r\n\r\nfor i in x:\r\n if i in y:\r\n result.append(i)\r\n\r\nprint(*result)\r\n", "n,m=map(int,input().split())\r\nl1=[int(x) for x in input().split()]\r\nl2=[int(x) for x in input().split()]\r\ns=\"\"\r\nfor i in range(n):\r\n if l1[i] in l2:\r\n s+=str(l1[i])+\" \"\r\nprint(s)\r\n", "n,m = map(int,input().split())\nset_n = [int(x) for x in input().split()]\nset_m = [int(x) for x in input().split()]\nfor elements in set_n:\n if elements in set_m:\n print(elements,end=\" \")\n\n\n\n\n\n\n\n\n\n\n\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nr = list(map(int,input().split()))\r\nfor i in l:\r\n for j in r:\r\n if i == j:\r\n print(i,end=\" \")", "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\nfor i in range(n):\r\n for j in range(m):\r\n if a[i]==b[j]:\r\n print(a[i],end=\" \")", "n , m = map(int,input().split())\na = list(map(int,input().split()))[:n]\nb = list(map(int,input().split()))[:m]\nq = []\nfor i in range(0,n):\n for j in range(0,m):\n if(a[i]==b[j]):\n q.append(a[i])\nfor i in range(0,len(q)):\n print(q[i],end=\" \")\n \n \n", "n,m=map(int,input().split())\r\nkeys=list(map(int,input().split()))\r\nfing=list(map(int,input().split()))\r\n\r\ndef intersection(lst1, lst2): \r\n lst3 = [value for value in lst1 if value in lst2] \r\n return lst3\r\n\r\nf=intersection(keys,fing)\r\nfor x in f:\r\n print(x,end=' ')", "result = []\nn, m = map(int, input().split())\nlist1 = list(map(int, input().split()))\nlist2 = list(map(int, input().split()))\nfor m in list1:\n if m in list2:\n result.append(m)\nfor m in result:\n print(m, end=\" \")\n", "\r\nn, m = list(map(int, input().split()))\r\n\r\nseq = list(map(int, input().split()))\r\n\r\nfingerprints = list(map(int, input().split()))\r\n\r\nfor s in seq:\r\n if s in fingerprints:\r\n print(s, end=\" \")\r\n\r\n", "n,m=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nans=[]\nfor i in a:\n\tif i in b:\n\t\tprint(i,end=' ')\nprint()", "n, m = map(int, input().split())\r\ns = input()\r\nans = list()\r\nnumbers1 = list(map(int, s.split()))\r\nb = input()\r\nnumbers2 = list(map(int, b.split()))\r\nfor x in range(0,len(numbers1),1):\r\n if numbers1[x] in numbers2:\r\n ans.append(numbers1[x])\r\n # ans = list.append(numbers1[x])\r\nprint(*ans)", "[n,m] = map(int,input().split())\r\n\r\np = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\narr = [False]*n\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif(c[i] == p[j]):\r\n\t\t\tarr[j] = True\r\n\t\t\tbreak\r\nfor i in range(n):\r\n\tif(arr[i] == True):\r\n\t\tprint(p[i],end = \" \")", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nfor i in x:\r\n for j in y:\r\n if j in x:\r\n if i == j:\r\n print(j,end = \" \")\r\n break", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif s[i] in f:\r\n\t\tprint(s[i],end=' ')", "x=[i for i in input().split(\" \")]\r\nl=[i for i in input().split(\" \")]\r\nl2=[i for i in input().split(\" \")]\r\nfor i in l:\r\n if(i in l2):\r\n print(i,end=\" \")\r\n\r\n \r\n ", "# 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\na=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nfor i in a:\r\n\tif i in s:\r\n\t\tprint(i,end=\" \")", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\nn, m = rint()\n\nx = list(rint())\ny = set(rint())\n\nans = []\n\nfor xx in x:\n if xx in y:\n ans.append(xx)\n\nprint(*ans)\n", "a,b=map(int,(input().split()))\r\nl=list(map(int,(input().split())))\r\nm=list(map(int,(input().split())))\r\nfor i in l:\r\n if i in m:\r\n print(i,end=\" \")\r\n", "ch=input()\r\na=int(ch[0:ch.index(\" \")])\r\nb=int(ch[ch.index(\" \")+1:])\r\nseq=input()\r\nfp=input()\r\nlseq=[int(seq[i]) for i in range(len(seq)) if seq[i]!=\" \"]\r\nlfp=[int(fp[i]) for i in range(len(fp)) if fp[i]!=\" \"]\r\nch=\"\"\r\nfor i in range(len(lseq)):\r\n if (lseq[i] in lfp):\r\n ch=ch+str(lseq[i])+\" \"\r\nprint(ch)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=[]\r\nfor i in b:\r\n try:\r\n ans.append(a.index(i))\r\n except:\r\n continue\r\nans.sort()\r\nfor item in ans:\r\n print(a[item],end=\" \")\r\n", "n,m = map(int, input().split())\na = list(map(int, input().split()))\nf = set(map(int, input().split()))\nc = set(a) & f\na = [ai for ai in a if ai in c]\nprint(*a)\n", "n , m = map(int , input().split() )\r\nl = list( map( int , input().split() ) )\r\nll = list( map( int , input().split() ) )\r\nans = []\r\nfor i in range( n ) : \r\n if l[ i ] in ll :\r\n ans.append( l[ i ] )\r\nprint( *ans )", "n,k = map(int,input().split(' '))\r\na = list(map(str,input().split(' ')))\r\ns = list(map(str,input().split(' ')))\r\n\r\nans = []\r\nfor x in a:\r\n if (x in s):\r\n ans.append(x)\r\nans = ' '.join(ans)\r\nprint(ans)\r\n", "n, m = map(int, input().split())\nar1 = list(map(int, input().split()))\nar2 = list(map(int, input().split()))\nfor i in ar1:\n if i in ar2:\n print(i, end=\" \")\n", "n, m = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i]==s[j]:\r\n print(l[i], end=' ')\r\n\r\n", "input()\r\nX, Y = input().split(), input().split()\r\nprint(*filter(lambda x: x in Y, X))", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl=[]\r\nfor i in l1:\r\n if i in l2:\r\n l.append(i)\r\nfor k in l:\r\n print(k,end=' ')", "n,m=map(int,input().split())\r\nl1,l2,x=[],[],[]\r\nl1=list(map(int,input().split()))[0:n]\r\nl2=list(map(int,input().split()))[0:m]\r\n#print(l1)\r\n#print(l2)\r\nfor i in l1:\r\n for j in l2:\r\n if i==j:\r\n print(i,end=\" \")\r\n \r\n \r\n\r\n", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\ny = input().split()\r\nx = input().split()\r\nb = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if y[i] == x[j]:\r\n b += [int(y[i])]\r\nfor i in b:\r\n print(i , end = \" \")\r\n", "n,m=map(int,input().split(\" \"))\r\nl1=list(map(int,input().split(\" \")))\r\nl2=list(map(int,input().split(\" \")))\r\nfor i in range(n):\r\n if l1[i] in l2:\r\n print(l1[i], end=\" \")", "n,m = map(int, input().split())\r\nx = input().split()\r\ny = input().split()\r\np = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n if x[i] == y[j]:\r\n p += x[i] + ' '\r\nprint(p)", "n, m = [int(x) for x in input().split()]\ns1 = [x for x in input().split()]\ns2 = [x for x in input().split()]\n\nfor item in s1:\n if item in s2:\n print(item, end=' ')\n", "x,y=[int(i) for i in input().split()]\r\nm=list(map(int,input().split()))\r\nn=list(map(int,input().split()))\r\nfor i in m:\r\n for j in n:\r\n if j==i:\r\n print(i, end=\" \")\r\n \r\n \r\n ", "l1 = []\r\nl2 = []\r\nn,m = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nfor i in l1 :\r\n if i in l2 :\r\n print(i, end = \" \")", "nm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\narr = list(map(int, input().rstrip().split()))\r\nar = list(map(int, input().rstrip().split()))\r\nfor i in arr:\r\n\tif i in ar:\r\n\t\tprint(i, end=' ')\r\n\t\tar.remove(i)\r\n", "n,m=map(int,input().split())\r\nL1=list(map(int,input().split()))\r\nL2=list(map(int,input().split()))\r\nL3=[]\r\nfor i in L1:\r\n\tL3.append(i in L2)\r\nfor i in range(n):\r\n\tprint(L1[i] if L3[i] else '','',end=\"\")", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfor i in range(n):\r\n if a[i] in b:\r\n print(a[i], end = ' ')", "n,m=map(int,input().split())\r\nval=input()\r\nkeys=val.split()\r\nu=input()\r\nfp=u.split()\r\nfor i in range(n):\r\n if(keys[i] in fp):\r\n print(keys[i],end=\" \")", "a = input().split(' ')\r\nb = input().split(' ')\r\nc = input().split(' ')\r\nn, m = int(a[0]), int(a[1])\r\ncode = []\r\nfor impr in b:\r\n if impr in c:\r\n code.append(impr)\r\n else:\r\n print( )\r\nprint(*code, end= '')", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\na=\"\"\r\nfor i in range(len(s)):\r\n\tif(s[i] in f):\r\n\t\ta+=str(s[i])\r\nprint(\" \".join(a))\r\n", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nc=[]\r\na+=map(int,input().split())\r\nb+=map(int,input().split())\r\nfor i in a:\r\n\tif i in b and i not in c:\r\n\t\tprint(i,end=' ')\r\n\t\tc.append(i)\r\n", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\nfor num in x:\r\n if num in y:\r\n print(num, end=\" \")\r\n\r\n\"\"\"\r\n//////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n//////////////////////////////////////////\r\n\"\"\"", "n, m = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nf = list(map(int, input().split()))\r\nt = []\r\nfor key in d:\r\n if key in f:\r\n t.append(key)\r\nprint(\" \".join(map(str, t)))\r\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\na=list(I())\r\nf=list(I())\r\nfor _ in a:\r\n if _ in f:\r\n print(_,end=' ')", "n,m=list(map(int,input().split()))\r\nln=list(map(int,input().split()))\r\nlm=list(map(int,input().split()))\r\ns1=set(lm).intersection(set(ln))\r\nl=[]\r\nfor i in s1:\r\n l.append(ln.index(i))\r\nl.sort()\r\nfor i in l:\r\n print(ln[i],end=\" \")", "# cf 994 A (700)\nn, m = map(int, input().split())\nX = list(map(int, input().split()))\nY = set(map(int, input().split()))\nR = []\nfor x in X:\n if x in Y:\n R.append(x)\nprint(\" \".join([str(x) for x in R]))\n", "a, b = map(int, input().split())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\n\r\nans = []\r\n\r\nfor n in arr1:\r\n if n in arr2:\r\n ans.append(n)\r\n\r\nprint(*ans)\r\n", "def ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nn,m=mi()\r\na=li()\r\nb=li()\r\nfor i in a:\r\n if(i in b):\r\n print(i,end=\" \")\r\nprint()", "input()\r\nX, Y = list(map(int, input().split())), set(map(int, input().split()))\r\nprint(*filter(lambda x: x in Y, X))", "def FingerPrints(seq,fp):\r\n\tresult=\"\"\r\n\tfor d in seq:\r\n\t\tif d in fp:\r\n\t\t\tresult+=str(d)\r\n\t\t\tresult+=\" \"\r\n\treturn result[0:len(result)-1]\r\n\r\nn,m = [int(x) for x in input().split()]\r\nseq = [int(x) for x in input().split()]\r\nfp = [int(x) for x in input().split()]\r\n\r\nprint(FingerPrints(seq,fp))\r\n\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nfor i in l:\r\n\tif i in x:\r\n\t\tprint(i,end=\" \")", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nfor i in range(n):\r\n if x[i] in y:\r\n print(x[i], end=' ')\r\nprint()", "\r\n\r\nn , m = map(int , input().split())\r\n\r\nx = [int(x) for x in input().split()]\r\ny = [int(y) for y in input().split()]\r\n\r\nfor i in x:\r\n if i in y:\r\n print(str(i) , end = ' ')", "def main():\n input()\n sequence = [int(x) for x in input().split()]\n fingerprints = [int(x) for x in input().split()]\n result = [str(x) for x in sequence if x in fingerprints]\n\n print(' '.join(result))\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n X = map(int, wtf[1].split())\r\n Y = set(map(int, wtf[2].split()))\r\n ans = []\r\n for x in X:\r\n if x in Y:\r\n ans.append(x)\r\n print(' '.join(map(str,ans)))\r\n", "n, m = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nkey = []\r\nfor item in x:\r\n if item in y:\r\n key.append(item)\r\nprint(*key)", "n, m = (int(i) for i in input().split())\nx = (int(i) for i in input().split())\ny = set(int(i) for i in input().split())\nres = [i for i in x if i in y]\nprint(*res)\n", "n,m=list(map(int,input().split()))\r\nlistx=list(map(int,input().split()))\r\nlisty=list(map(int,input().split()))\r\nstr1=''\r\nfor i in listx:\r\n if i in listy:\r\n str1+=str(i)+' '\r\nprint(str1)", "a, b, c= input().split(), input().split(), input().split()\r\nprint(*[d for d in b if d in c])", "n,m = map(int,input().split())\r\nn_integers = [int(x) for x in input().split()]\r\nm_integers = [int(x) for x in input().split()]\r\n\r\nfor i in n_integers:\r\n if i in m_integers:\r\n print(i,sep=\" \",end = \" \")\r\n", "N, M = input().split()\r\nn = input().split()\r\nphn = n[:]\r\nm = input().split()\r\nfor each in phn:\r\n if each not in m:\r\n n.remove(each)\r\nfor each in n:\r\n print(each, end=\" \")", "n, m = map(int, input().split())\r\n*x, = map(int, input().split())\r\n*y, = map(int, input().split())\r\nres = []\r\nfor el in y:\r\n if el in x:\r\n res += [x.index(el)]\r\nres.sort()\r\nfor i in res:\r\n print(x[i], end=' ')", "# from dust i have come, dust i will be\n\nn, m = map(int, input().split())\ns = list(map(int, input().split()))\nf = list(map(int, input().split()))\n\nfor i in range(n):\n if s[i] in f:\n print(s[i], end=\" \")\n", "rd = lambda: list(map(int, input().split()))\ninput()\na, b = rd(), rd()\nprint(*[x for x in a if x in b])\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nIndx = []\r\nfor i in c:\r\n if i in b:\r\n Indx.append(b.index(i))\r\nIndx.sort()\r\nfor i in Indx:\r\n print(b[i], end=\" \")", "# n = int(input())\r\n# l = list(map(int, input().split()))\r\n# n, m, k = [int(x) for x in input().split()]\r\nn, m = [int(x) for x in input().split()]\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nfor i in l1:\r\n for j in l2:\r\n if i == j: print(i, end = \" \")", "n=list(map(int,input().split()))\r\na=list(map(int,input().split()[:n[0]]))\r\nb=list(map(int,input().split()[:n[1]]))\r\nfor i in a:\r\n for j in b:\r\n if(i==j):\r\n print(i,end=' ')", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = list(map(int, input().split()))[:n]\r\nb = list(map(int, input().split()))[:m]\r\nc = []\r\nd = {}\r\nfor i in range(m):\r\n if(a.__contains__(b[i])):\r\n c.append(a.index(b[i]))\r\n d.setdefault(a.index(b[i]), b[i])\r\nc.sort()\r\nfor i in range(len(c)):\r\n print(d.get(c[i]), end=\" \")", "m,n=map(int,input().split())\r\np=list(map(int,input().split()))[:m]\r\nq=list(map(int,input().split()))[:n]\r\nfor i in p:\r\n if(i in q):\r\n print(i,end=' ')", "import sys\r\n\r\n#sys.stdin = open(\"in.txt\",\"r\")\r\n#sys.stdout = open(\"out.txt\",\"w\")\r\n\r\nfinger = [False] * 10\r\n\r\nn,m = map(int,input().split())\r\nkeys = map(int,input().split())\r\nfingers = map(int,input().split())\r\n\r\nfor f in fingers:\r\n finger[f] = True\r\n\r\nfor key in keys:\r\n if(finger[key]):\r\n print(key,\" \",end=\"\")\r\n\r\nprint()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\n@Project : CodeForces\r\n@File : test.py \r\n@Time : 2018/6/11 2:24\r\n@Author : Koushiro\r\n\"\"\"\r\n\r\n\r\nresult = []\r\nn, m = map(int, input().split())\r\nseq = list(map(int, input().split()))\r\ndic_fin = {}.fromkeys(map(int, input().split()))\r\nfor i in range(n):\r\n if seq[i] in dic_fin:\r\n result.append(seq[i])\r\nprint(*result)", "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# _INPUT_LINES = sys.stdin.read().splitlines()\r\n# input = iter(_INPUT_LINES).__next__\r\n# _OUTPUT_BUFFER = io.StringIO()\r\n# sys.stdout = _OUTPUT_BUFFER\r\n#\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n seq = list(map(int, input().split()))\r\n fing = set(list(map(int, input().split())))\r\n\r\n res = list()\r\n\r\n for v in seq:\r\n if v in fing:\r\n res.append(v)\r\n\r\n print(' '.join(map(str, res)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\niz = [int(x) for x in input().split()]\r\notp = [int(x) for x in input().split()]\r\na = []\r\nb = []\r\nfor i in otp:\r\n if i in iz:\r\n a.append(iz.index(i))\r\na.sort()\r\nfor i in a:\r\n print(iz[i], end=' ')\r\n", "n,m=map(int,input().split())\r\nline1=input().split()\r\nline2=input().split()\r\nfor i in line1:\r\n \tif i in line2:\r\n \t\tprint(i,end =\" \")", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\nd = set(map(int, input().split()))\nans = []\nfor el in arr:\n if el in d:\n ans.append(el)\n\nprint(' '.join(map(str, ans)))\n", "i=lambda:input().split()\r\nn,m=map(int,i())\r\na,b=i(),i()\r\nprint(*[x for x in a if x in b])", "n, m =map(int, input().split())\r\na = input().split()\r\nb = input().split()\r\nc = []\r\nfor i in b:\r\n if i in a:\r\n c.append(a.index(i))\r\nc = sorted(c)\r\nfor i in c:\r\n print(a[i], end=' ')", "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\ns=0\r\nfor i in a:\r\n for j in b:\r\n if i==j:\r\n print(i, end=' ')\r\n", "N, K=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nF=list(map(int,input().split()))\r\nAns=[]\r\nfor i in range(len(A)):\r\n if A[i] in F:\r\n Ans.append(A[i])\r\nprint(*Ans)", "input()\na=list(map(int,input().split()))\nv=list(map(int,input().split()))\nfor i in a:\n if i in v:\n print(i,end=\" \")", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\noutput = []\r\nfor i in x:\r\n if i in y:\r\n output.append(i)\r\nprint(*output)", "n,m = list(map(int,input().split()))\r\nk1 = input().split()\r\nk2 = input().split()\r\nfor i in k1:\r\n if i in k2:\r\n print(i,end=' ')\r\n", "a = input().split(\" \")\r\nn = int(a[0])\r\nm = int(a[1])\r\nb = input().split(\" \")\r\np = input().split(\" \")\r\ni = 0\r\nwhile(i<n):\r\n b[i] = int(b[i])\r\n i = i + 1\r\ni = 0\r\nwhile(i<m):\r\n p[i] = int(p[i])\r\n i = i + 1\r\ni = 0\r\nc = []\r\nwhile(i<n):\r\n j = 0\r\n while(j<m):\r\n if(b[i]==p[j]):\r\n c = c + [p[j]]\r\n j = j + 1\r\n i = i + 1\r\ni = 0\r\ns = \"\"\r\nwhile(i<len(c)):\r\n s = s + str(c[i]) + \" \"\r\n i = i + 1\r\nprint(s)", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nr=[]\r\nfor i in range(m):\r\n\tif l[i] in s:\r\n\t\tr.append(l[i])\r\nfor i in range(len(r)):\r\n\tprint(r[i],end=' ')\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))[:n]\r\ny=list(map(int,input().split()))[:m]\r\nfor i in range(n):\r\n for j in range(m):\r\n if x[i]==y[j]:\r\n print(x[i],end=\" \")", "a,l,s=(input().split()for f in'_ls')\r\nprint(*[d for d in l if d in s])", "(n,m) = [int(i) for i in input().strip().split(' ')]\r\nx = [int(i) for i in input().strip().split(' ')]\r\ny = [int(i) for i in input().strip().split(' ')]\r\nfor i in x:\r\n if i in y:\r\n print(i, end=' ')\r\nprint('')\r\n", "n, m = map(int, input().split())\ns = input().split()\nf = input().split()\na = [i for i in s if i in f]\nprint(*a)\n", "string = input().split(\" \")\r\nn = int(string[0])\r\nm = int(string[1])\r\n\r\nsequence = input().split(\" \")\r\n\r\nfp = input().split(\" \")\r\n\r\npw = []\r\n\r\nfor item in sequence:\r\n if item in fp:\r\n pw.append(item)\r\n\r\nprint(\" \".join(pw))", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nanswer = []\r\nfor i in x:\r\n if i in y:\r\n answer.append(i)\r\nprint(*answer)", "n,m = list(map(int,input().split()))\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\nfor i in arr1:\r\n if i in arr2:\r\n print(i,end = ' ')", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nay=[]\r\nfor i in y:\r\n if i in x:\r\n ay.append(i)\r\nif len(ay)==0:\r\n print()\r\nindex=[]\r\nfor i in ay:\r\n for j in range(n):\r\n if x[j]==i:\r\n index.append(j)\r\nindex.sort()\r\nfor i in index:\r\n print(x[i],end=\" \")", "R = lambda : list(map(int,input().split()))\r\nn,a,b = R(),R(),R()\r\nprint(*(x for x in a if x in b))", "n, m = map(int, input().split())\npassword = []\na = input().split()\nb = input().split()\nfor i in a:\n if i in b:\n password.append(i)\nprint(*password)\n", "n, m = map(int, input().split())\r\n\r\nli1 = []\r\nli2 = []\r\n\r\nli1 = list(map(int, input().split()))\r\nli2 = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if li1[i]==li2[j]:\r\n count+=1\r\n if count>1:\r\n print(' ',li1[i], end = '')\r\n j=m-1\r\n \r\n if count==1:\r\n print(li1[i], end = '')\r\n\r\n\r\nprint()\r\n\r\n \r\n\r\n\r\n", "n,k=list(map(int,input().split()))\r\npo=list(map(int,input().split()))\r\nko=list(map(int,input().split()))\r\nlo=[]\r\nso=[]\r\ntan=[]\r\nx=0\r\nfor item in ko:\r\n if item in po:\r\n so.append(item)\r\n lo.append(po.index(item))\r\n po[po.index(item)]=55555555\r\n else:\r\n pass\r\nfor item in lo:\r\n tod=lo.index(min(lo))\r\n tan.append(so[tod])\r\n lo[tod]=555555\r\nprint(*tan)\r\n", "num = [int(a) for a in input(\"\").split()]\nnse = num[0]\nnfin = num[1]\nse = [int(b) for b in input(\"\").split()]\nfin = [int(c) for c in input(\"\").split()]\nfor i in range(0, nse):\n if se[i] in fin:\n print(se[i], end = ' ')\nprint(\"\")\n\n", "n, m = map(int, input().split())\r\na = [int(n) for n in input().split()]\r\nb = [int(n) for n in input().split()]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i] == b[j]:\r\n print(a[i], end = ' ')\r\n", "n,m =(map(int,input().split()))\r\nseq=list(map(int,input().split()))\r\nfing=list(map(int,input().split()))\r\nlists=[]\r\nfor i in seq:\r\n\tfor j in fing:\r\n\t\tif j==i:\r\n\t\t\tlists.append(j)\r\nfor i in lists:\r\n\tprint(i,end=\" \")\r\n", "n,m = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nkeys = list(map(int, input().split()))\r\nans = ''\r\nfor d in s:\r\n if d in keys: ans += str(d)+ ' '\r\nprint(ans)\r\n", "def Fingerprint():\r\n\tn, m = list(map(int, input().split()))\r\n\tx = list(map(int, input().split()))\r\n\ty = list(map(int, input().split()))\r\n\r\n\tnums = []\r\n\tfor num in x:\r\n\t\tif num in y:\r\n\t\t\tnums.append(num)\r\n\tprint(\" \".join(str(number) for number in nums))\r\n\r\nFingerprint()", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=[]\r\nfor i in l2:\r\n\tif i in l:\r\n\t\tl3.append(l.index(i))\r\nl3.sort()\r\nfor i in l3:\r\n\tprint(l[i],end=\" \")", "# import os\r\n\r\nn,m = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nr = []\r\n\r\nfor i in a:\r\n if i in b:\r\n r.append(i)\r\nprint(' '.join(map(str, r)))\r\n\r\n\r\n", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n input()\r\n a = input().split()\r\n b = input().split()\r\n print(' '.join([x for x in a if x in b]))\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n,k=[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\nlst3={}\r\nans=[]\r\nfor i in lst2:\r\n if(i in lst1):\r\n \r\n lst3[i]=lst1.index(i)\r\nfor i in sorted(lst3,key=lst3.get):\r\n ans.append(i)\r\n#print(lst3)\r\nprint(*ans,sep=\" \")\r\n", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nd = {}\r\nfor c in b:\r\n try:\r\n d[c] += 1\r\n except:\r\n d[c] = 1\r\ne = []\r\nfor c in a:\r\n try:\r\n if d[c]>=1:\r\n e.append(c)\r\n d[c]-=1\r\n except:\r\n pass\r\nfor c in e:\r\n print(c,end=\" \")\r\n", "n,m = map(int,input().split())\r\nlst1 = list(map(int,input().split()))\r\nlst2 = list(map(int,input().split()))\r\nfor i in lst1:\r\n for j in lst2:\r\n if (i==j):\r\n print(i,end=\" \")", "n, m = map(int, input().strip().split(' '))\r\nx = list(map(int, input().strip().split(' ')))\r\ny = list(map(int, input().strip().split(' ')))\r\nres = []\r\nfor i in x:\r\n if i in y:\r\n res.append(i)\r\nprint(' '.join([str(j) for j in res]))", "\r\nl3=[]\r\nn,m=map(int,input().strip().split())\r\nl1=list(map(int,input().strip().split()))[:n]\r\nl2=list(map(int,input().strip().split()))[:m]\r\nfor i in l1:\r\n if i in l2:\r\n l3.append(i)\r\n \r\nprint(*l3)\r\n ", "input()\r\na=input().split()\r\nb=input().split()\r\nfor x in a:\r\n if x in b:\r\n print(x,end=' ')", "nm = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nresult = []\r\nfor i in range(nm[0]):\r\n\tif x[i] in y:\r\n\t\tresult.append(x[i])\r\nprint(*result)", "import sys\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split()))\nn,m=map(int,input().split())\nl=L()\nk=L()\ng=[]\nfor i in k:\n if i in l:\n g.append(l.index(i))\ng.sort()\nfor i in g:\n print(l[i],end=\" \")\n", "n,m=map(int,input().split(' '))\r\nx1=list(map(int,input().split(' ')))\r\ny1=list(map(int,input().split(' ')))\r\na=[]\r\nfor i in range(n):\r\n if x1[i] in y1:\r\n a.append(x1[i])\r\n else:\r\n continue\r\nprint(*a)", "n,m=input().split()\r\nl3=[]\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nfor z in l1:\r\n if z in l2:\r\n l3.append(z)\r\n else:\r\n continue\r\nfor p in l3:\r\n print(p,end=\" \")\r\n \r\n \r\n \r\n", "input()\r\ns=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nfor n in s:\r\n\tif n in z:\r\n\t\tprint(n,end=' ')", "n, m=map(int,input().split())\r\nseq=list(map(int,input().split()))\r\nfin=list(map(int,input().split()))\r\nans=[]\r\nfor i in seq:\r\n if i in fin:\r\n ans.append(i)\r\n\r\nprint(*ans)\r\n", "#https://codeforces.com/problemset/problem/994/A\r\ninp = input()\r\ninp = inp.split(\" \")\r\n\r\nlist_one = input()\r\nlist_one = list_one.split(\" \")\r\n\r\nlist_two = input()\r\nlist_two = list_two.split(\" \")\r\n\r\nanswer = \"\"\r\n\r\nfor current_number in list_one:\r\n if current_number in list_two:\r\n answer += current_number + \" \"\r\n\r\nprint (answer)\r\n", "n,m= [int(x) for x in input().split()]\r\nlist3=[]\r\nlist1=list([int(x) for x in input().split()])\r\nlist2=list([int(y) for y in input().split()])\r\nfor a in list1:\r\n if a in list2:\r\n list3.append(a)\r\n \r\nfor value in list3:\r\n print(value, end=' ')\r\n ", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n if a[i] in b:\r\n c.append(a[i])\r\nprint(*c)", "m = input()\r\nx = input()\r\ny = input()\r\nans = \"\"\r\nkeys = x.split()\r\nfinger = y.split()\r\nfor each in keys:\r\n\tif each in finger:\r\n\t\tans += str(each) + \" \"\r\nprint(ans)", "a, b = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nli2 = list(map(int, input().split()))\r\nfor i in range(a):\r\n if li[i] in li2:\r\n print(li[i], end= ' ')", "def solve(t_id):\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n ans = []\r\n for x in a:\r\n if x in b:\r\n ans.append(x)\r\n print(*ans)\r\nt = 1\r\n#t = int(input())\r\nfor t_id in range(1, t + 1):\r\n solve(t_id)\r\n t -= 1", "input()\r\nns1, ns2 = input().split(' '), input().split(' ')\r\nfor el in ns1:\r\n\tif el in ns2:\r\n\t\tprint(el, end=' ')\r\n", "n,m=[int(z) for z in input().split()]\r\nx=[int(z) for z in input().split()]\r\ny=[int(z) for z in input().split()]\r\nfor i in x:\r\n if i in y:\r\n print(i,end=\" \")", "n, m = map(int,input().split())\r\nsequence = list(map(int,input().split()))\r\nfinger_print = list(map(int,input().split()))\r\n\r\nfor digit in sequence:\r\n if digit in finger_print:\r\n print(digit,end=\" \")", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nfor i in l:\r\n if i in m:\r\n print(i,end=' ')\r\n\r\n", "n,m = [int(x) for x in input().split()]\r\n\r\nlist1 = [int(x) for x in input().split()]\r\nlist2 = [int(x) for x in input().split()]\r\nd =[]\r\nfor i in list2:\r\n try:\r\n d.append(list1.index(i, 0, len(list1)))\r\n except:\r\n d.append(-1)\r\n\r\n#7 3\r\n#3 5 7 1 6 2 8\r\n#1 2 7\r\nd.sort()\r\nfor i in d:\r\n\r\n if i >=0 :\r\n print(list1[i],end = ' ')", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()[:n]))\r\ny = list(map(int, input().split()[:m]))\r\nfingerprints = []\r\nfor i in x:\r\n if i in y:\r\n fingerprints.append(i)\r\nprint(' '.join(str(j) for j in fingerprints))\r\n", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\n\r\nc = Counter([int(i) for i in input().split()])\r\n\r\nfor i in arr:\r\n if c[i]:\r\n print(i, end=' ')", "n,m = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nkeyy = list(map(int, input().split()))\r\nans=[]\r\n\r\nfor i in lst:\r\n if i in keyy:\r\n ans.append(i)\r\n\r\nfor i in ans:\r\n print(i, end=\" \")", "inp=input().split()\r\nList=list(map(int,input().split()))\r\nList2=list(map(int,input().split()))\r\nc=[]\r\nfor j in List:\r\n for m in List2:\r\n if j==m:\r\n c.append(j)\r\nprint(*c)\r\n \r\n\r\n", "n,m=map(int,input().split())\r\nd=[]\r\nl1=list([int(x) for x in input().split()])\r\nl2=list([int(y) for y in input().split()])\r\n\r\nfor i in l1:\r\n for j in l2:\r\n if i==j:\r\n print(i,end=\" \")\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Nov 30 18:55:30 2018\n\n@author: mach\n\"\"\"\n\nn,m = map(int, input().split())\nl = list(map(int, input().strip().split()))\nk = list(map(int, input().strip().split()))\n\nfor j in range(n):\n if l[j] in k:\n print(l[j], end= \" \")\n \n ", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i]==b[j]:\r\n\t\t\tx.append(a[i])\r\nfor i in x:\r\n\tprint(i,end=\" \")", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nls=[0 for i in range(10)]\r\nfor i in range(m):\r\n ls[y[i]]=1\r\nfor i in range(n):\r\n if(ls[x[i]]):\r\n print(x[i],end=\" \")", "n, m = map(int, input().split())\r\na, b, res = map(int, input().split()), set(map(int, input().split())), []\r\nfor x in a:\r\n if x in b:\r\n res += [x]\r\nprint(*res)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n if a[i] == b[j]:\r\n print(a[i])\r\n", "\r\ninput1 = input().split()\r\ninput2 = input().split()\r\ninput3 = input().split()\r\nstr1 = \"\"\r\nfor i in input2:\r\n if i in input3:\r\n str1 += i+\" \"\r\nprint(str1)\r\n\r\n", "import sys\r\nimport math\r\n\r\nn,m=map(int,input().split())\r\nseq=[int(x) for x in input().strip().split()]\r\nfinger=[int(y) for y in input().strip().split()]\r\n\r\nfor i in range(len(seq)):\r\n for j in range(len(finger)):\r\n if(seq[i]==finger[j]):\r\n print(seq[i],end=\" \")", "n, m = input().split()\r\nx = input().split()\r\ny = input().split()\r\nprint(*[u for u in x if u in y])", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\na=input().split()\r\nb=set(input().split())\r\nans=[]\r\nfor i in range(n):\r\n if a[i] in b:\r\n ans.append(a[i])\r\nprint(\" \".join(ans))", "n,m = map(int, input().split())\r\nn = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\nfor i in n:\r\n try:\r\n s = m.index(i)\r\n print(i, end=\" \")\r\n except:\r\n s=1\r\nprint(\"\")\r\n", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = input().split()\r\nb = input().split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i]) \r\nfor i in range(len(b)):\r\n b[i] = int(b[i]) \r\nans = \"\"\r\nfor i in a:\r\n if i in b:\r\n ans += str(i) + \" \"\r\nprint(ans)", "n, m = map(int, input().split())\r\nx = list(map(str, input().split()))\r\ny = list(map(str, input().split()))\r\n\r\nans = []\r\nfor xi in x:\r\n if xi in y:\r\n ans.append(xi)\r\n\r\nprint(\" \".join(ans))", "num_seq, num_fpr = map(int, input().split())\r\n\r\nnum_seq = list (map(int, input().split()))\r\n\r\nnum_fpr= list (map(int, input().split()))\r\n\r\nfor i in num_seq :\r\n if i in num_fpr:\r\n print (i, end = \" \")", "\nn, m = map(int, input().split())\n\nA = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\n\nC = [x for x in A if x in B]\n\nprint(' '.join(map(str, C)))\n", "n, m = map(int,input().split())\r\nseq = list(map(int,input().split()))\r\nfp = set(map(int,input().split()))\r\nlst = []\r\nfor i in range(n):\r\n if seq[i] in fp:\r\n lst.append(seq[i])\r\n \r\nprint(*lst, sep=' ')", "a,b = map(int,input().split())\r\nseq=list(map(int,input().split()))\r\nfin=list(map(int,input().split()))\r\nfor item in seq:\r\n c=item\r\n for item in fin:\r\n if c==item:\r\n print(c,end=\" \")\r\n", "n, m = map(int, input().split())\r\ndigits = list(map(int, input().split()))\r\nfingerprints = set(map(int, input().split()))\r\nfor ele in digits:\r\n if ele in fingerprints:\r\n print(ele, end = \" \")\r\n \r\n\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = []\nfor i in a:\n if i in b:\n c.append(str(i))\nprint(' '.join(c))", "n,m = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\ny.sort()\r\ns = []\r\nfor i in x:\r\n for j in y:\r\n if i == j and i not in s:\r\n s.append(j)\r\nprint(*s)", "m_n = input()\r\nm_n = m_n.split(\" \")\r\nm_n = [int(i) for i in m_n]\r\nm, n = m_n[0], m_n[1]\r\n\r\nsequence = input()\r\nsequence = sequence.split(\" \")\r\nsequence = [int(i) for i in sequence]\r\n\r\nkeys_fingerprints = input()\r\nkeys_fingerprints = keys_fingerprints.split(\" \")\r\nkeys_fingerprints = [int(i) for i in keys_fingerprints]\r\n\r\npassword_list = []\r\nfor seq in sequence:\r\n if seq in keys_fingerprints:\r\n password_list.append(seq)\r\n\r\npassword = \"\"\r\nfor p in password_list:\r\n password += str(p)\r\n password += \" \"\r\npassword = password[:-1]\r\n\r\nprint(password)\r\n", "F = lambda:map(int, input().split())\r\n\r\nF()\r\na = F()\r\nb = list(F())\r\nd = []\r\n\r\nfor c in a:\r\n if c in b:\r\n d.append(c)\r\n\r\nprint(*d, ' ')", "n, m = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\nb = [int(s) for s in input().split()]\r\nfor i in range(n):\r\n if a[i] in b:\r\n print(a[i], end = ' ')", "input()\r\nn = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\n# print(n,m)\r\na = set(m).intersection(set(n))\r\n# b = sorted(list(a), reverse=True,key=lambda x: list(n).index(x))\r\nb = [x for x in n if x in a]\r\nprint(\" \".join(map(str, b)))\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nf=[]\r\nfor i in range(len(y)):\r\n \r\n \r\n if y[i] in x:\r\n d=x.index(y[i])\r\n f.insert(i,d)\r\nf.sort()\r\nfor i in range(len(f)):\r\n print(x[f[i]],end=\" \")\r\n \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\nfor i in a:\r\n if i in b:\r\n print(i,end=' ')", "some_chars=input()\r\nchars=some_chars.split()\r\nbuttons=int(chars[0])\r\nmarked_buttons=int(chars[1])\r\nclean_list=[' ']*buttons\r\nmarked_list=[' ']*marked_buttons\r\nans=[' ']*buttons\r\nflag=1\r\nclean_list_str=input()\r\nmarked_list_str=input()\r\nclean_list=clean_list_str.split()\r\nmarked_list=marked_list_str.split()\r\ni=0\r\nfor a in range(buttons):\r\n for b in range(marked_buttons):\r\n if clean_list[a]==marked_list[b]:\r\n if flag==1:\r\n ans[i]=clean_list[a]\r\n i+=1\r\n flag=0\r\n else:\r\n ans[i]=clean_list[a]\r\n i+=1\r\nans_str=' '.join(ans)\r\nprint(ans_str)", "n,m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nc=list(set(a).intersection(b))\r\nindex=[]\r\nfor i in c:\r\n\tindex.append(a.index(i))\r\nindex.sort()\r\nnew=[]\r\nfor i in index:\r\n\tnew.append(a[i])\r\nprint(*new)\r\n\t\r\n\t\r\n\r\n", "key_count, fingerprint_count = [int(x) for x in input().split()]\r\n\r\ndigits = [int(x) for x in input().split()]\r\nfingerprints = [int(x) for x in input().split()]\r\n\r\nfor digit in digits:\r\n if(digit in fingerprints):\r\n print(f'{digit} ', end=\"\")", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\nfor i in s:\r\n if i in f:\r\n print(i,end=\" \")", "n, k = map(int, input().split())\na1=[int(x) for x in input().split()]\na2=[int(x) for x in input().split()]\nnew=[]\nfor i in a1:\n if i in a2:\n new.append(i)\n\nprint(*new)", "input()\r\n\r\nbuttons = list(map(int, input().split()))\r\ndirty_buttons = set(map(int, input().split()))\r\nright_combination = []\r\n\r\nfor b in buttons:\r\n if b in dirty_buttons:\r\n right_combination.append(b)\r\nprint(*right_combination)", "import time\r\n\r\n\r\ndef guessCode(serial, fingerdigits):\r\n keyCode = []\r\n for x in serial:\r\n if x in fingerdigits:\r\n keyCode.append(x)\r\n\r\n return keyCode\r\n\r\n\r\n\r\ndef solve():\r\n digits, fkeys = [int(x) for x in input().split()]\r\n keycode = []\r\n\r\n serial = list(map(int, input().split()))\r\n fingerdigits = list(map(int, input().split()))\r\n\r\n\r\n\r\n keycode = guessCode(serial, fingerdigits)\r\n print(' '.join(str(x) for x in keycode))\r\n\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()\r\n", "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\nans = []\r\nfor e in x:\r\n if e in y:\r\n ans.append(str(e))\r\nprint(' '.join(ans))\r\n", "n, m = map(int, input().split())\r\nx = input().split()\r\ny = input().split()\r\nfor i in range(n):\r\n if x[i] in y:\r\n y.remove(x[i])\r\n print(x[i], end=' ')", "n, m = input().split()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nprint(*[i for i in a if i in b])\r\n", "#Fingerprints\r\nn,m=map(int,input().split())\r\nans=str()\r\na=[str(k) for k in input().split()]\r\nb=[str(j) for j in input().split()]\r\nfor i in range(0,len(a)):\r\n for j in range(0,len(b)):\r\n if a[i]==b[j]:\r\n ans=ans + a[i] + \" \"\r\nprint(ans)\r\n", "n,m=list(map(int, input().split() ) )\nd=list(map(int, input().split() ) )\ns=set(map(int, input().split() ) )\nfor i in d:\n if i in s:\n print(i, end=' ')", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(len(c)):\r\n if c[i] in b:\r\n x=b.index(c[i])\r\n d.append(x)\r\nd.sort()\r\nfor j in range(len(d)):\r\n print(b[d[j]],end=\" \")", "input()\r\nseq = input().split()\r\nfprint = set(input())\r\nprint(*[e for e in seq if e in fprint])\r\n", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfor i in a:\r\n if i in b:\r\n print(i,end=' ')\r\n'''a,b,c = map(int,input().split())\r\nif a==b:print(a+b+2*c);exit()\r\nif b < a:print(b*2+1+2*c)\r\nelse:print(a*2+1+2*c)'''\r\n'''\r\ninput()\r\nb = list(map(int, input().split()))\r\nc = len(b)-2\r\n#print(c)\r\nwhile b[c] == b[c+1]:\r\n c -= 1\r\nprint(c+1)\r\n'''\r\n'''b =int(input())\r\na = input()\r\ns = 0\r\nfor i in range(b):\r\n b = int(a[i])\r\n if b % 2 == 0:\r\n s += (i+1)\r\nprint(s)\r\n'''\r\n'''a, b = map(int, input().split())\r\nprint((2*a+b-1)//b+(5*a+b-1)//b+(8*a+b-1)//b)\r\n'''\r\n'''\r\n\r\na =int(input())\r\nb =sorted(map(int,input().split()))\r\nprint(b[(a-1)//2])\r\n\r\n'''\r\n\r\n'''\r\ndic={'purple':'Power','red':'Reality','green':'Time','blue':'Space','yellow':'Mind','orange':'Soul'}\r\nn=int(input())\r\nprint(6-n)\r\nfor i in range(0,n):\r\n s=input()\r\n del dic[s]\r\nfor i in dic:\r\n print(dic[i])\r\n '''\r\n'''a = int(input())\r\nfor i in range(a):\r\n b = input()\r\n #print(b[:-10])\r\n print(\"YES\" if '8' in input()[:-10] else \"NO\")\r\n '''\r\n'''''''''\r\n1 1 1 1 1 2 2 2 2 3 3 3 4 4\r\n1 5 3 2\r\ns=5/v1=1/v2=2/t1=1/t2=2/\r\na = 5+2\r\nb = 10+4\r\nb>a\r\n\r\n11221\r\n1[0]-5[1]-3[2]-2[3]\r\n1+1+2+\r\n11x4i\r\nxxiixxiixx\r\n\r\na = int(input())\r\nfor i in range(a):\r\n b = int(input())\r\n c = list(map(int, input().split()))\r\n if b*max(c)-sum(c) == 0:\r\n print(max(c))\r\n else:print(b*max(c)-sum(c)-b)'''''''''", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nout=[]\r\nfirst=11\r\nfor a in range(len(x)):\r\n for b in range(len(y)):\r\n #print(a,b,end=\" \")\r\n if y[b]==x[a]:\r\n if first<a:\r\n first=a;\r\n out.append(y[b])\r\n #print(1,first,out,x[a],y[b])\r\n b+=1\r\n \r\n else:\r\n out.insert(0,y[b])\r\n #print(2,first,out,x[a],y[b])\r\n b+=1\r\n \r\n else:\r\n \r\n # print(first,out,x[a],y[b])\r\n b+=1\r\nout.reverse()\r\nfor a in out:\r\n print(a)", "(m,n)=map(int,input().split())\r\nx=[int(x) for x in input().split()]\r\ny = [int(y) for y in input().split()]\r\nz=[]\r\nk=0\r\nfor i in range(0,m):\r\n for j in range(0,n):\r\n if(x[i]==y[j]):\r\n z.append(x[i])\r\nk=len(z)\r\nfor i in range(0,k):\r\n print(f\"{z[i]} \",end=\"\")", "n, m = map(int, input().split())\r\nx = input().split()\r\ny = input().split()\r\nx = [e for e in x if e in y]\r\nprint(' '.join(x))", "n, m = map(int, input().split())\r\npt = [int(i) for i in input().split()]\r\nfp = [int(i) for i in input().split()]\r\nidx = []\r\n\r\nfor i in fp:\r\n if i in pt:\r\n idx.append(pt.index(i))\r\nidx.sort()\r\n\r\nfor i in idx:\r\n print(pt[i], end=' ')\r\n", "# LUOGU_RID: 101744660\n(n, m), a, b = [[*map(int, s.split())] for s in open(0)]\r\nprint(*[x for x in a if x in b])", "x,y=input().split()\r\nl=input().split()\r\nl2=input().split()\r\nfor i in l:\r\n if i in l2:\r\n print(i,end=\" \")\r\n", "n,m=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\nfor x in arr1:\r\n if x in arr2:\r\n print(x,end=\" \")\r\n", "a,b = map(int,input().split())\r\nc = input().split()\r\nd = input().split()\r\nfor i in range(len(c)):\r\n if c[i] in d:\r\n print(c[i],end=\" \")", "n,k=input().split()\r\nn,k=[int(n),int(k)]\r\na=[int(i)for i in input().split()]\r\nb=[int(i)for i in input().split()]\r\nc=[]\r\nfor i in range(0,len(a)):\r\n for j in range(0,len(b)):\r\n if a[i]==b[j]:\r\n c.append(a[i])\r\nprint(*c,sep=' ')", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n\td.update({i:0})\r\nfor i in x:\r\n\ttry:\r\n\t\td[i]+=1\r\n\texcept Exception as exception:\r\n\t\tpass\r\n\r\nfor i in l:\r\n\tif d[i]>0:\r\n\t\tprint(i,end=' ')\r\nprint()", "n, k = map(int,input().split())\r\nn1 = input().split()\r\nn2 = input().split()\r\nans = ''\r\nfor i in n1:\r\n if i in n2:\r\n ans += i+' '\r\nprint(ans)", "x=input()\r\nseq=input().replace(\" \",\"\")\r\nf=input()\r\nfor e in seq:\r\n if e in f:\r\n print(e,end=\" \")", "n, m = map(int, input().split())\r\noutput = []\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n if x[i] in y:\r\n output.append(x[i])\r\nprint(*output)\r\n", "n, m = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\nfingerprints = list(map(int, input().split()))\r\nfor i in range(n):\r\n if numbers[i] in fingerprints:\r\n print(numbers[i], end=\" \")", "n, m = map(int, input().split())\nm = list(map(int,input().split()))\np = list(map(int,input().split()))\nfor i in m:\n if i in p:\n print(i,end=' ')\n", "n,m = map(int, input().split())\nmat = list(map(int, input().split()))\nsat = list(map(int, input().split()))\n\nfor i in mat:\n if i in sat:\n sat.remove(i)\n print(i,end = \" \")\n", "n,m = map(int,input().split())\r\nxi = input().split()\r\nyi = input().split()\r\nnumbers = \"\"\r\nfor i in xi:\r\n if i in yi:\r\n numbers += i +\" \"\r\n\r\nprint(numbers)\r\n\r\n \r\n", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nprint(*filter(lambda x: x in b, a))", "if __name__ == '__main__':\r\n\tn, m = map(int, input().split())\r\n\r\n\tdigits = list(map(int, input().split()))\r\n\r\n\tkeys = list(map(int, input().split()))\r\n\r\n\tfor key in [digit_each for digit_each in digits for key_each in keys if digit_each == key_each]:\r\n\t\tprint(key, end = ' ')", "n,m=map(int,input().split())\r\nstx=input().split()\r\nstx2=input()\r\nstrm=''\r\nfor m in stx:\r\n if m in stx2:\r\n strm+=m+' '\r\nprint(strm)", "read=lambda:map(int,input().split())\r\nn,m=read()\r\nx=list(read())\r\ny=list(read())\r\nans=[]\r\nfor d in x:\r\n if d in y:\r\n ans.append(d)\r\nprint(*ans)", "n=[]\r\nm=[]\r\nl=[]\r\na,b=(input().split())\r\nn= list(map(int,input().split())) \r\nm= list(map(int,input().split()))\r\nfor c in n:\r\n if c in m:\r\n l.append(c)\r\nprint(*l) \r\n ", "n, m = map(int, input().split())\r\nnum = [int(i) for i in input().split()]\r\nf = [int(i) for i in input().split()]\r\nfor item in num:\r\n if item in f:\r\n print(item, end=' ')", "a,b = map(int, input().split())\r\nc = [*input().split()]\r\nd = [*input().split()]\r\npwd = []\r\n\r\nfor ele in c:\r\n if ele in d:\r\n pwd.append(ele)\r\nprint(' '.join(pwd))", "n,m = map(int, input().split())\r\nseq = list(map(int, input().split()))\r\nfig = list(map(int, input().split()))\r\n\r\nans = []\r\n\r\nfor num in seq:\r\n if num in fig:\r\n ans.append(num)\r\n\r\nfor i in ans:\r\n print(i, end=\" \")", "n,m = map(int,input().split())\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\nans = []\r\nfor i in range(len(arr1)):\r\n if arr1[i] in arr2:\r\n ans.append(arr1[i])\r\nprint(*ans)", "num1 = input()\nnum2 = [int(i) for i in input().split()]\nnum3 = [int(i) for i in input().split()]\nseq = \"\"\n\nfor i in range(0, len(num2)):\n for num in num3:\n if num == num2[i]:\n seq += str(num) + \" \"\nprint(seq)\n", "n,m = map(int, input().split())\nx = list(map(int,input().split()))\ny = [int(i) for i in input().split()]\nresult=[]\nfor i in x:\n\tif i in y:\n\t\tresult.append(i)\nprint(*result)\n\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn, m = [int(x) for x in input().split()]\r\ns = [int(x) for x in input().split()]\r\nk = [int(x) for x in input().split()]\r\nans = []\r\nfor x in s:\r\n\tif x in k:\r\n\t\tans.append(x)\r\nprint(\" \".join(map(str, ans)))", "n, m = map(int, input().split())\ngeneral = list(map(int, input().split()))\nfingers = list(map(int, input().split()))\n\nfor item in general:\n for jtem in fingers:\n if item == jtem:\n print(item, end = ' ')\n", "#from dictionary import defaultdict as dc\r\nn,m=[int(i) for i in input().split()]\r\nnx=[int(i) for i in input().split()]\r\nmy=[int(i) for i in input().split()]\r\na=[]\r\nfor i in range(m):\r\n if nx.count(my[i])!=0:\r\n a.append(nx.index(my[i]))\r\n\r\na.sort()\r\nfor i in a:\r\n print(nx[i],end=' ')\r\n#print('\\n')\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-20 14:23:20\nLastEditTime: 2021-11-20 14:28:35\nDescription: Fingerprints\nFilePath: CF994A.py\n'''\n\n\ndef func():\n n, m = map(int, input().strip().split())\n password = input().strip().split()\n fingerprint = input().strip().split()\n code = []\n for item in password:\n if item in fingerprint:\n code.append(item)\n print(\" \".join(code))\n\n\nif __name__ == '__main__':\n func()\n", "# https://codeforces.com/problemset/problem/994/A\r\n\r\nn, m = input().split()\r\n\r\nsequence = input().split()\r\n\r\nfinger = tuple(input().split())\r\n\r\nfor i in sequence:\r\n if i in finger:\r\n print(i, end=\" \")", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = [i for i in a if i in b]\r\nfor i in ans:\r\n print(i, end= ' ')", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nindex=[]\r\nfor i in range(len(y)):\r\n if y[i] in x:\r\n index.append(x.index(y[i]))\r\nindex=sorted(index)\r\nfor i in index:\r\n print(x[i],end=' ')\r\n\r\n", "n,m=map(int,input().split())\r\nx=[int(q) for q in input().split()]\r\ny=[int(w) for w in input().split()]\r\np=[]\r\nfor i in y:\r\n if i in x:\r\n p.append(i)\r\nu=[]\r\nfor i in range(len(x)):\r\n if x[i] in p:\r\n u.append(x[i])\r\nprint(*u)", "a,b = map(int,input().split())\r\nj = ''\r\nn = list(input().split())\r\nm = list(input().split())\r\nfor i in range(len(n)):\r\n if n[i] in m:\r\n j += n[i]+' '\r\nprint(j)\r\n", "n,k = map(int,input().split())\r\nli= list(map(int,input().split()))\r\ns= sorted(list(map(int,input().split())),reverse=True)\r\na = []\r\nfor i in li:\r\n if i in s:\r\n a.append(i)\r\nprint(*a)", "n, m = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\nlis = []\r\nfor i in range(len(t)):\r\n if t[i] in s:\r\n lis.append(s.index(t[i]))\r\nlis.sort()\r\nfor i in range(len(lis)):\r\n print(s[lis[i]],end=' ')", "f1 = input().split()\r\nf2 = input().split()\r\nf3 = input().split()\r\nnewstring1 = \" \"\r\nfor i in f2:\r\n if i in f3:\r\n newstring1+=i+\" \"\r\nprint(newstring1)\r\n", "m=input()\r\ns=map(int,input().split())\r\nt=str(input()).count\r\nfor _ in s:\r\n if t(str(_)):\r\n print(_,end=\" \")", "n, m = map(int, input().split(' '))\r\nx = map(int, input().split(' '))\r\ny = list(map(int, input().split(' ')))\r\nans = [e for e in x if e in y]\r\nfor e in ans:\r\n print(e, end=' ')\r\n", "n, k =map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm = list(map(int,input().split()))\r\nfor i in l:\r\n if i in m:\r\n print(i,end=\" \")", "n, m = map(int, input().split())\n\nnl = list(map(int, input().split()))\nml = list(map(int, input().split()))\n\nres = []\n\nfor i in range(n):\n\tif nl[i] in ml:\n\t\tres.append(nl[i])\n\nfor i in range(len(res)):\n\tprint(res[i], end=' ')", "n,m=[int(n) for n in input().split()]\r\narr=[int(item) for item in input().split()]\r\nbrr=[int(item) for item in input().split()]\r\ncrr=[False]*10\r\ndrr=[]\r\nfor j in brr:\r\n crr[j]=True\r\nfor i in arr:\r\n if(crr[i]==True):\r\n drr.append(i)\r\nprint(*drr) \r\n \r\n \r\n \r\n", "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\nfor i in x:\r\n if i in y:\r\n print(i, end=' ')\r\n", "n, m = map(int, input().split())\r\nx = input().split()\r\ny = input().split()\r\na = filter(lambda i: i in y, x)\r\nprint(*a)\r\n", "n, m = [int(x) for x in input().split()]\ns = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\na = []\nfor i in range(n):\n if s[i] in q:\n a.append(s[i])\nprint(*a)", "input()\r\nx = [int(k) for k in input().split()]\r\ny = [int(k) for k in input().split()]\r\nfor n in x:\r\n if n in y:\r\n print(n, end = ' ')", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\na=[]\r\nfor i in k:\r\n\tif i in l:\r\n\r\n\t\ta.append(l.index(i))\r\na.sort()\r\nk.clear()\r\nfor i in a:\r\n\tk.append(l[i])\r\nfor i in k:\r\n\tprint(i,end=\" \")", "n, m = map(int, input().split())\r\narr=input()\r\nar1 = list(map(int,arr.split(' ')))\r\narrr=input()\r\nar2 = list(map(int,arrr.split(' ')))\r\nar3 = []\r\nfor i in range(len(ar1)):\r\n if ar1[i] in ar2:\r\n ar3.append(i)\r\n\r\nif len(ar3)==0:\r\n print()\r\nelse:\r\n for j in ar3:\r\n print(ar1[j],end=' ')\r\n", "n,m=list(map(int, input().split()))\r\nx=list(map(int, input().split()))\r\ny=list(map(int, input().split()))\r\nfor i in x:\r\n if i in y:\r\n print(i,end=\" \")", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))[:n]\r\nl2=list(map(int,input().split()))[:m]\r\nfor i in l1:\r\n for j in l2:\r\n if (i==j):\r\n print(i,end=\" \")\r\n", "s1 = input()\r\narr1 = input()\r\narr2 = input()\r\narr1, arr2 = list(map(int,arr1.split())), list(map(int,arr2.split()))\r\nans = []\r\nfor i in arr1:\r\n if i in arr2:\r\n ans.append(i)\r\nans = \" \".join(map(str,ans))\r\n \r\nprint (ans)\r\n", "# problem Name :Fingerprints\r\n# problem Link : https://codeforces.com/problemset/problem/994/A\r\n# Input Operation :\r\nimport sys\r\nn,m=map(int,sys.stdin.readline().split())\r\narr1=list(map(int,sys.stdin.readline().split()))\r\narr2=list(map(int,sys.stdin.readline().split()))\r\n# Output Operation :\r\nfor i in range(n):\r\n if arr1[i] in arr2:\r\n print(arr1[i],end=\" \")\r\n", "n,m=map(int,input().split())\r\n\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\n\r\nfor i in x:\r\n if i in y:\r\n print(i,end=\" \")", "input()\r\nS = list(map(int, input().split()))\r\nF = list(map(int, input().split()))\r\nfor i in S:\r\n if i in F:\r\n print(i, end=' ')\r\n", "n, m = map(int, input().split())\r\n\r\nx = [*map(int, input().split())]\r\ny = [*map(int, input().split())]\r\n\r\nflg = False\r\nfor xi in x:\r\n if xi in y:\r\n if flg:\r\n print(\" \", end=\"\")\r\n print(xi, end=\"\")\r\n flg = True\r\nprint()\r\n", "s=input()\r\nn,m=[int(i) for i in s.split()]\r\ns=input()\r\nseq=[int(i) for i in s.split()]\r\ns=input()\r\nk=[int(i) for i in s.split()]\r\nans=[]\r\nfor i in seq:\r\n if i in k:\r\n ans+=[i]\r\nfor i in ans:\r\n print(i,end=\" \")", "class CodeforcesTask994ASolution:\r\n def __init__(self):\r\n self.sequence = []\r\n self.fingerprints = []\r\n self.result = \"\"\r\n\r\n def read_input(self):\r\n input()\r\n self.sequence = input().split(\" \")\r\n self.fingerprints = input().split(\" \")\r\n\r\n def process_task(self):\r\n for number in self.sequence:\r\n if number in self.fingerprints:\r\n self.result += \" {0}\".format(number)\r\n\r\n def get_result(self):\r\n return self.result[1:]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask994ASolution()\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\nx = list(map(int, input().split()))\r\ny = set(map(int, input().split()))\r\nz = []\r\nfor i in range(n):\r\n if x[i] in y:\r\n z.append(x[i])\r\nprint(*z)\r\n", "n,m=map(int,input().split())\r\nkey=[None]*n\r\nfinger=[None]*m\r\n\r\nkey=input().split(' ')\r\nkey=list(int(i) for i in key)\r\n\r\nfinger=input().split(' ')\r\nfinger=list(int(i) for i in finger)\r\n\r\ncode=[i for i in key if i in finger]\r\nprint(*code,sep=' ')", "n, m = map(int, input().split())\r\nN = [int(i) for i in input().split()]\r\nM = [int(i) for i in input().split()]\r\n\r\nans = []\r\nfor lt in N:\r\n if lt in M:\r\n ans.append(lt)\r\n print(ans[-1], end=\" \")\r\n", "n,m = [int(x) for x in input().split()]\r\ns = input()\r\nt = input()\r\nfor i in s:\r\n\tif i in t:\r\n\t\tprint(i,end='')\r\nprint()", "n,m = map(int, input().split())\r\nList_n = list(map(int, input().split()))\r\ndel List_n[n:]\r\nList_m = list(map(int, input().split()))\r\ndel List_m[m:] # 1st not accecpting more than m elements\r\nList1 = []\r\nfor i in List_m:\r\n if i in List_n:\r\n List1.append(i)\r\n# ---------------------------------------------------------------------------------\r\n# print(List1)\r\nList2 = []\r\nfor i in range(len(List1)):\r\n List2.append(List_n.index(List1[i]))\r\n# print(List2)\r\n# ---------------------------------------------------------------------------------\r\n\r\nList2.sort(reverse=False)\r\nfor i in List2:\r\n print(List_n[i], end=\" \")\r\n# ---------------------------------------------------------------------------------\r\n\r\n'''\r\n\r\n \r\n7 3 \r\n3 5 7 1 6 2 8\r\n1 2 7\r\n\r\n4 4\r\n3 4 1 0\r\n0 1 7 9\r\n'''", "x=input()\r\nx=x.split()\r\nn=int(x[0])\r\nm=int(x[1])\r\n\r\nos=input()\r\nos=os.split()\r\nos=[int(i) for i in os]\r\n\r\nfs=input()\r\nfs=fs.split()\r\nfs=[int(i) for i in fs]\r\n\r\nfor i in os:\r\n if i in fs:\r\n print(i, end=\" \")", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfinger = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n if a[i] in finger:\r\n print(a[i], end=\" \")\r\nprint()", "n, m = map(int, input().split())\r\nmass1 = list(map(int, input().split()))\r\nmass2 = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n\tif mass1[i] in mass2:\r\n\t\tprint(mass1[i], end=' ')", "nums = input()\r\nnums_list = nums.split()\r\nn, m = int(nums_list[0]), int(nums_list[1])\r\n\r\nlst_n = input()\r\nlst_m = input()\r\n\r\nres = []\r\nfor i in range(len(lst_n)):\r\n if lst_n[i] in lst_m:\r\n res.append(lst_n[i])\r\n \r\nfor i in res:\r\n if i!=' ':\r\n print(i,end=\" \")", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nd = list(map(int,input().split()))\r\ne = []\r\nfor i in range(len(c)):\r\n for j in range(len(d)):\r\n if c[i] == d[j]:\r\n e.append(i)\r\nfor i in range(len(e)):\r\n print(c[e[i]],end = ' ')\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\nn,m=minput()\r\nx=listinput()\r\ny=listinput()\r\nxx=set(x)\r\nyy=set(y)\r\ncommon=xx.intersection(yy)\r\nfor i in x:\r\n if i in common:\r\n print(i,end=' ')", "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\ni=0\r\nj=0\r\nans=\"\"\r\nfor i in a:\r\n if i in b:\r\n ans+=str(i)+\" \"\r\nprint(ans)\r\n \r\n", "a,b=map(int,input().split())\r\nls_1=input().split()\r\nls_2=input()\r\nprint(*(i for i in ls_1 if i in ls_2))", "m, n = map(int,input().split(' '))\r\nx = [int(s) for s in input().split(' ')]\r\ny = [int(s) for s in input().split(' ')]\r\nout = ''\r\nfor i in x:\r\n if(y.count(i)):\r\n out += str(i)\r\n out += ' '\r\nprint(out)\r\n", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nlst = []\nfor i in range(len(a)):\n if (a[i] in b):\n lst.append(a[i])\nif (len(lst) == 0):\n pass\nelse:\n print(*lst)\n", "n, m = map(int, input().split())\r\nx = input().split()\r\ny = input().split()\r\n\r\nprint(*filter(lambda x: x in y, x))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split())) \r\nb=list(map(int,input().split())) \r\nfor i in range (n):\r\n\tfor j in range (m):\r\n\t\tif a[i]==b[j]:\r\n\t\t\tprint(a[i],end=\" \")\t\r\n\t\t\tbreak", "def crack(x,y):\r\n k=[]\r\n for i in x:\r\n if i in y:\r\n k.append(str(i))\r\n return \" \".join(k)\r\nd=input()\r\ng=[int(i) for i in input().split()]\r\nf=[int(i) for i in input().split()]\r\nprint(crack(g,f))", "x, y = input(\"\").split()\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\nfor n in lst1:\r\n if n in lst2:\r\n print(n, end=\" \")\r\n", "input()\r\na=input().split()\r\nb=input().split()\r\nc=[]\r\nfor i in a:\r\n if i in b:\r\n c.append(i)\r\nprint(*c)", "_ = input()\r\nx = list(input().split())\r\ny = set(input().split())\r\nprint(\" \".join(a for a in x if a in y))", "n, m = input().split()\r\nx = input().split()\r\ny = input().split()\r\n\r\nprint(*filter(lambda x: x in y, x))\r\n", "a = input()\r\nl = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\nprint(*list(x for x in l if x in k))\r\n\r\n", "n, m = map(int, input().split())\r\nx = [int(i) for i in input().split()]\r\ny=[int(j) for j in input().split()]\r\nz=[]\r\n\r\nfor k in range(0,n):\r\n for l in range(m):\r\n if x[k]==y[l]:\r\n z.append(x[k])\r\n break\r\nprint(' '.join(map(str, z)))", "n,m=map(int,input().split())\r\nos=list(map(int,input().split()))\r\nfs=list(map(int,input().split()))\r\nv=[]\r\nfor i in range(len(os)):\r\n\tfor j in range(len(fs)):\r\n\t\tif os[i]==fs[j]:\r\n\t\t\tv.append(os[i])\r\nprint(*v)", "n,m=map(int,input().split())\na=[i for i in map(int,input().split())]\nb=[i for i in map(int,input().split())]\nc=list(set(a)&set(b))\nd=[]\nfor i in c:\n d.append(a.index(i))\nz=[x for _,x in sorted(zip(d,c))]\nprint(*z,sep=' ')\n", "input()\r\nx = input().split()\r\ny = input().split()\r\nprint(\" \".join(el for el in x if el in y))\r\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr1=set(list(map(int,input().split())))\r\nans=[]\r\nfor i in arr:\r\n if i in arr1:\r\n ans.append(i)\r\nfor i in ans:\r\n print(i,end=\" \")", "n,m=map(int,input().split())\r\nseq=list(map(int,input().split()))\r\nfprint=list(map(int,input().split()))\r\nfor i in seq:\r\n if i in fprint:\r\n print(i,end=\" \")", "n, m = map(int, input().split())\r\n*x, = map(int, input().split())\r\n*y, = map(int, input().split())\r\nprint(*[i for i in x if i in y])", "N,K=map(int,(input().split(\" \")))\r\nL=list(map(int,(input().split(\" \"))))\r\nL1=list(map(int,(input().split(\" \"))))\r\nC=[]\r\nfor i in range(0,K):\r\n if L1[i] in L:\r\n W=L.index(L1[i])\r\n C.append(W)\r\nC=sorted(C)\r\nfor i in range(0,len(C)):\r\n R=C[i]\r\n print(L[R],end=\" \")\r\nprint()", "a=list(map(int,input().split()))\r\nb=[0,0]\r\nfor i in range (0,2):\r\n\tb[i]=list(map(int,input().split()))\r\nd=[]\r\nfor j in range (0,a[1]):\r\n\tfor k in range (0,a[0]):\r\n\t\tif b[1][j]==b[0][k]:\r\n\t\t\td.append([k,b[1][j]])\r\nd.sort()\r\ng=len(d)\r\nfor u in range (0,g):\r\n\tprint(d[u][1],end=\" \")", "from collections import defaultdict as dd\r\nn,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nfinal=[]\r\nd=dd(int)\r\nfor i in b:\r\n d[i]=1\r\nfor i in a:\r\n if(d[i]==1):\r\n final.append(i)\r\nprint(*final)\r\n", "if __name__ == \"__main__\":\n n, m = tuple(map(int, input().split()))\n keys = list(map(int, input().split()))\n keys_with_fingers = set(map(int, input().split()))\n code = list()\n\n for k in keys:\n if k in keys_with_fingers:\n code.append(str(k))\n\n print(' '.join(code))\n", "n,m=map(int,input().split())\r\nN=list(map(int,input().split()))\r\nM=list(map(int,input().split()))\r\nfor i in N:\r\n if i in M:\r\n print(i,end=\" \")\r\n", "e = []\r\na,b = map(int,input().split())\r\nc = input().split()\r\nd = input().split()\r\n\r\n\r\nfor i in d:\r\n if i in c:\r\n e.append(c.index(i))\r\ne.sort()\r\nfor i in e:\r\n print(c[i],end = \" \")", "n,m=map(int,(input().split()))\r\nl=list(map(int,input().split()))\r\nr=list(map(int,input().split()))\r\nfor i in l:\r\n if i in r:\r\n print(i,end=\" \")", "n, m = map(int, input().split())\nseq = list(map(int, input().split()))\nfngrprnts = list(map(int, input().split()))\nans = []\nfor s in seq:\n\tif s in fngrprnts:\n\t\tans.append(str(s))\nprint(\" \".join(ans))\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn,m=read_ints()\n\ta=read_ints()\n\tb=set(read_ints())\n\tprint(\" \".join(map(str, [x for x in a if x in b])))\n\nsolve()\n", "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nk = set(map(int, input().split()))\nr = [i for i in s if i in k]\nprint(*r)\n\n \t \t \t\t\t\t\t\t \t\t \t\t\t\t\t \t\t\t", "n,m=map(int,input().split())\r\ny,y1=[],[]\r\nl=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nfor i in range(len(x)):\r\n if x[i] in l:\r\n y.append(l.index(x[i]))\r\ny.sort()\r\nfor i in range(len(y)):\r\n y1.append(l[y[i]])\r\nprint(*y1)\r\n", "n,m=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nans=[]\r\nfor char in x:\r\n if char in y:\r\n ans.append(char)\r\nprint(*ans,sep=' ')\r\n", "n,m = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nfin = list(map(int,input().split()))\r\nfor i in lis:\r\n if i in fin:\r\n print(i,end=\" \")", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set(map(int, input().split()))\r\nz = []\r\nfor i in range(n):\r\n if a[i] in s:\r\n z.append(a[i])\r\nprint(*z)", "s = str(input()).split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nnl = list(map(int, str(input()).split()))\r\nml = list(map(int, str(input()).split()))\r\n\r\nans = ''\r\n\r\nfor i in nl:\r\n if i in ml:\r\n ml.remove(i)\r\n ans += str(i) + ' '\r\n\r\nprint(ans[:-1])", "a1,a2=map(int,input().split())\r\nx=input().split()\r\ny=input().split()\r\nfor i in range(a1):\r\n\tfor j in range(a2):\t\t\r\n\t\tif x[i]==y[j]:\r\n\t\t\tprint(x[i],end=\" \")\t", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nnew=[ ]\r\nfor i in range (0,len(a)):\r\n for j in range (0,len(b)):\r\n if(a[i] in b):\r\n new.append(a[i])\r\nk=set(new)\r\nfor i in range (0,len(a)):\r\n if(a[i] in k):\r\n print(a[i],end=' ')\r\n \r\n ", "def max1(a):\r\n\tp = a[0]\r\n\tfor x in a:\r\n\t\tif x > p:\r\n\t\t\tp = x\r\n\treturn p\r\n\r\n\r\ndef prlist(a):\r\n\tfor x in a:\r\n\t\tprint(x, end = \" \")\r\n\r\n\r\n#row, col = list(map(int, input().split()))\r\n#a = list(map(int, input().split()))\r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = []\r\nfor i in range(n):\r\n\tif a[i] in b:\r\n\t\tc.append(a[i])\r\nprlist(c)\r\n", "n, m = map(int, input().split())\r\nx = [i for i in map(int, input().split())]\r\ny = [i for i in map(int, input().split())]\r\nfor i in x:\r\n if i in y:\r\n print(i, end=' ')", "n, m = [int(_) for _ in input().split()]\r\nx1 = [int(_) for _ in input().split()]\r\nx2 = [int(_) for _ in input().split()]\r\nfor i in x1:\r\n if i in x2:\r\n print(i, end=' ')\r\n", "#!/bin/python3\r\nnm = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\nb = set(x)\r\nx = list(b)\r\nres = []\r\nfor k in range(nm[0]):\r\n\tif x.count(a[k]) != 0:\r\n\t\tres.append(a[k])\r\nfor k in range(len(res)):\r\n\tprint(res[k] ,end=\" \")\r\n\r\nprint()", "n, m = [int(x) for x in input().split(' ')]\nns = [int(x) for x in input().split(' ')]\nfp = [int(x) for x in input().split(' ')]\nfor i in range(len(ns)):\n if ns[i] in fp:\n print(ns[i], end=' ')\n", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nb=input().split()\r\nfor i in range(n):\r\n\tb[i]=int(b[i])\r\nx=b\r\nc=input().split()\r\nfor i in range(m):\r\n\tc[i]=int(c[i])\r\ny=c\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif x[i]==y[j]:\r\n\t\t\tprint(x[i],end=\" \")\r\n", "n, m = map(int, input().split())\r\n\r\nans = list(map(int, input().split()))\r\n\r\nst = set(map(int, input().split()))\r\n\r\nfor i in ans:\r\n if i in st:\r\n print(i, end=' ')", "a, b = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = set(map(int, input().split()))\r\nto_print = []\r\nfor i in A:\r\n if i in B:\r\n to_print.append(str(i))\r\nprint(' '.join(to_print))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nres = []\r\nfor i in a:\r\n if i in b: res.append(i)\r\nfor i in res: print(i, end=' ')\r\nprint()\r\n", "def main():\n n, m = map(int, input().split())\n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n\n index = []\n for yv in y:\n for i,xv in enumerate(x):\n if yv == xv:\n index.append(i)\n \n index.sort()\n for i in index:\n print(x[i], end=\" \")\n print()\n\n\nif __name__ == \"__main__\":\n main()", "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(y)\r\nans = []\r\nfor i in x:\r\n if i in s:\r\n ans.append(i)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n,m=map(int,input().split())\r\nln=list(map(int,input().split()))\r\nlm=list(map(int,input().split()))\r\nl=[]\r\nfor i in ln:\r\n if i in lm:\r\n l.append(i)\r\nfor i in l:\r\n print(i,end=' ')\r\nprint()\r\n", "n, m = map(int, input().split())\r\nar0 = [int(i) for i in input().split()]\r\nar1 = [int(i) for i in input().split()]\r\nar3 = []\r\nfor i in range(n):\r\n if ar0[i] in ar1:\r\n ar3.append(ar0[i])\r\nprint(' '.join([str(i) for i in ar3]))", "n,m = map(int,input().split())\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\n\r\nprint(*sorted([x for x in arr2 if x in arr1],key = lambda k:arr1.index(k)))", "l=''\r\nn,m=input().split()\r\nx=[int(a) for a in input().split()]\r\ny=[int(a) for a in input().split()]\r\nfor i in range(int(n)):\r\n if x[i] in y: l+=(str(x[i]) + ' ')\r\nprint(l)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nx=list(map(int, input().split()))\r\ny=list(map(int, input().split()))\r\nl=[]\r\nfor i in range(m):\r\n if x.count(y[i])>0:\r\n ind=x.index(y[i])\r\n l.append([ind,y[i]])\r\nl.sort()\r\nfor i in range(len(l)):\r\n print(l[i][1],end=\" \")", "n, m = map(int, input().split())\r\nsequence = input().split()\r\nfingerprints = input().split()\r\nanswer = \"\"\r\nfor i in range(n):\r\n if sequence[i] in fingerprints:\r\n answer += sequence[i] + \" \"\r\n\r\nprint(answer)", "[n, m] = list(map(int,input().split(\" \")))\r\nx = input().split(\" \")\r\ny = input().split(\" \")\r\nr = []\r\nfor i in range(n):\r\n if(x[i] in y):\r\n r.append(x[i])\r\nprint(' '.join([i for i in r]))\r\n", "n, m = [int(i) for i in input().split()]\rx = [int(i) for i in input().split()]\ry = [int(i) for i in input().split()]\r\rdef mergeSort(a):\r if len(a) <= 1:\r return a\r mid = len(a) // 2\r left = mergeSort(a[:mid])\r right = mergeSort(a[mid:])\r\r return merge(left, right)\r\rdef merge(left, right):\r result = []\r while len(left) > 0 and len(right) > 0:\r if left[0] <= right[0]:\r result.append(left[0])\r left = left[1:]\r else:\r result.append(right[0])\r right = right[1:]\r\r if len(left) > 0:\r result += left\r\r if len(right) > 0:\r result += right\r\r return result\r\rdef binarySearch(arr, s, b, e):\r if b > e:\r return False\r else:\r mid = (b + e) // 2\r if arr[mid] == s:\r return True\r elif arr[mid] < s:\r return binarySearch(arr, s, b + 1, e)\r else:\r return binarySearch(arr, s, b, e - 1)\r\ry = mergeSort(y)\r\rfor i in range(0, n):\r if binarySearch(y, x[i], 0, len(y) - 1):\r print(x[i], end=\" \")\r", "n,m = map(int,input().split())\r\nx = list(map(int,input().split())) #n\r\ny = list(map(int,input().split())) #m\r\n\r\nfor i in x:\r\n if i in y:\r\n print(i, end=' ')", "\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n\r\nd = []\r\nfor i in range(n):\r\n if w[i] in s:\r\n d.append(w[i])\r\n\r\nprint(*d)\r\n\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nn=[]\r\nfor i in range(len(l)):\r\n if l[i] in m:\r\n n.append(l[i])\r\nprint(*n)", "n,m=map(int,input().split())\r\nx=input().split()\r\ny=set(input().split())\r\nres=[]\r\nfor c in x:\r\n if c in y:\r\n res.append(c)\r\nprint(' '.join(res))", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = set(map(int, input().split()))\r\nans = []\r\n\r\nfor i in x:\r\n if(i in y):\r\n ans.append(i)\r\nprint(*ans)\r\n", "x = list(map(int, input().split(\" \")))\r\ny = list(map(int, input().split(\" \")))\r\nz = list(map(int, input().split(\" \")))\r\n\r\nprint(*[i for i in y if i in z], end = \" \")\r\n", "import itertools\n\noptions = input()\nnumber_of_digits = options.split(\" \")[0]\nnumber_of_fingerprints = options.split(\" \")[1]\nsequence = [x for x in input().split(\" \")]\nbuttons_with_fingerprints = [x for x in input().split(\" \")]\n\ndef identifyDigits(\n sequence,\n buttons_with_fingerprints\n):\n comparisons = [a for (a, b) in itertools.product(sequence, buttons_with_fingerprints) if a == b]\n print(\" \".join(comparisons))\n\nidentifyDigits(sequence, buttons_with_fingerprints)", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))[:n]\r\ny=list(map(int,input().split()))[:m]\r\nnew=[]\r\nfor i in x:\r\n for j in y:\r\n if i==j:\r\n new.append(i)\r\nfor i in new:\r\n print(i,end=\" \")", "#!/usr/bin/env python3\r\n#\r\n# FILE: 994A.py\r\n#\r\n# @author: Arafat Hasan Jenin <opendoor.arafat[at]gmail[dot]com>\r\n#\r\n# LINK: http://codeforces.com/contest/994/problem/A\r\n#\r\n# DATE CREATED: 17-06-18 22:29:02 (+06)\r\n# LAST MODIFIED: 17-06-18 23:15:25 (+06)\r\n#\r\n# VERDICT:\r\n#\r\n# DEVELOPMENT HISTORY:\r\n# Date Version Description\r\n# --------------------------------------------------------------------\r\n# 17-06-18 1.0 Deleted code is debugged code.\r\n#\r\n# _/ _/_/_/_/ _/ _/ _/_/_/ _/ _/\r\n# _/ _/ _/_/ _/ _/ _/_/ _/\r\n# _/ _/_/_/ _/ _/ _/ _/ _/ _/ _/\r\n# _/ _/ _/ _/ _/_/ _/ _/ _/_/\r\n# _/_/ _/_/_/_/ _/ _/ _/_/_/ _/ _/\r\n#\r\n##############################################################################\r\n\r\nn, m = map(int, input().split())\r\n\r\nn_list = list(map(int, input().split()))\r\nm_list = list(map(int, input().split()))\r\n\r\nans = \"\"\r\n\r\nfor item in n_list:\r\n if item in m_list:\r\n ans += str(item) + \" \"\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\nfingerprints = list(map(int, input().split()))\r\ncode = []\r\nfor i in sequence:\r\n if i in fingerprints:\r\n code.append(i)\r\nprint(\" \".join(map(str, code)))\r\n", "a,b=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nm=[]\r\nfor i in l1:\r\n\tif i in l2:\r\n\t\tm.append(i)\r\nif m==[]:\r\n\tprint(\" \")\r\nelse:\r\n\tfor j in m:\r\n\t\tprint(j,end=\" \")", "n,m = (input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\n\r\ndic = {}\r\nfor i in l2:\r\n dic[i] = 1\r\n\r\nx = [str(x) for x in l1 if x in dic]\r\ns = \" \".join(x)\r\nprint(s)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\n# set1=set(l1)\r\n# set2=set(l2)\r\n# final=set1.intersection(set2)\r\n\r\nfor i in l1:\r\n if i in l2:\r\n print(i,end=\" \")\r\n ", "input().split(\" \")\r\nl1 = [int(i) for i in input().split(\" \")]\r\nl2 = [int(j) for j in input().split(\" \")]\r\nout = []\r\nfor a in l1:\r\n for b in l2:\r\n if a == b:\r\n out.append(a)\r\n else:\r\n continue\r\nfor x in out:\r\n print(x,end=\" \")\r\n\r\n", "input()\nfps = list(map(int, input().split(\" \")))\nkeys = list(map(int, input().split(\" \")))\n\nfps = filter(lambda x: x in keys, fps)\nprint(' '.join(str(x) for x in fps))\n", "#problem 13\r\nn,m=input().split()\r\nx = input().replace(' ','')\r\ny = input()\r\nfor i in x:\r\n if i in y:\r\n print(i,end=' ')\r\n ", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nk = list(map(int,input().split()))\r\na = []\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif k[j] == l[i]:\r\n\t\t\ta.append(k[j])\r\nprint(*a)", "#n = int(input())\r\nlst = list(map(int,input().split()))\r\nlst1 = list(map(int,input().split()))\r\nlst2 = list(map(int,input().split()))\r\n\r\nfor e in lst1:\r\n if e in lst2:\r\n print(e,end=' ')", "n,m=input().split()\r\nsequence=input().split()\r\nfingerprints=input().split()\r\nfor i in sequence:\r\n if i in fingerprints:\r\n print(i,end=\" \")", "n, m = map(int, input().split()) # Read input values n and m\r\nsequence = list(map(int, input().split())) # Read the sequence\r\nkeypad = set(map(int, input().split())) # Read the keys with fingerprints\r\n\r\ncode = []\r\nfor num in reversed(sequence):\r\n if num in keypad:\r\n code.append(num)\r\n if len(code) == m:\r\n break\r\n\r\ncode.reverse() # Reverse the code to get the correct order\r\nprint(\" \".join(map(str, code)))\r\n", "a=input().split()\r\nb=input().split()\r\nc=input().split()\r\nh=0\r\nfor i in range(int(a[0])):\r\n n=0\r\n for j in range(int(a[1])):\r\n if b[h]!=c[j]:\r\n n+=1\r\n if n==int(a[1]):\r\n b.remove(b[h])\r\n else:\r\n h+=1\r\nfor i in range(int(len(b))):\r\n print(b[i],end=' ')", "inp1 = input().split()\r\ninp2 = input().split()\r\ninp3 = input().split()\r\nstr1 = \" \"\r\nfor i in inp2:\r\n if i in inp3:\r\n str1+=i+\" \"\r\nprint(str1)\r\n \r\n", "#Codeforce 994A\r\nn,m = (int(v) for v in input().split())\r\nlist1=[u for u in input().split()]\r\nlist2=[t for t in input().split()]\r\nans=\"\"\r\nfor i in range(len(list1)):\r\n if list1[i] in list2:\r\n ans += (list1[i] + \" \")\r\n else:\r\n pass\r\nprint(ans.rstrip(\" \"))", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\narr = []\nfor item in y:\n if item in x:\n arr.append((x.index(item), item))\narr.sort()\nfor item in arr:\n print(item[1], end=\" \")\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nx=[]\r\nfor i in l:\r\n if(i in d):\r\n x.append(i)\r\nprint(*x)\r\n", "n, m = map(int, input().split(\" \"))\r\nsequence = list(map(int, input().split(\" \")))\r\nfingerprints = list(map(int, input().split(\" \")))\r\nfor key in sequence:\r\n if key in fingerprints:\r\n print(key, end=\" \")", "n,m=map(int,input().split())\r\na=list(input().split())\r\nb=list(input().split())\r\nz=list()\r\nfor i in range(n):\r\n if a[i] in b:\r\n z.append(a[i])\r\nk=str()\r\nfor i in range(len(z)):\r\n k+=str(z[i])+' '\r\nprint(k)\r\n", "def str_to_int(str_list):\r\n return [int(x) for x in str_list]\r\n \r\ndimensions = str_to_int(input().split(\" \"))\r\nsequence = str_to_int(input().split(\" \"))\r\nfingerprints = str_to_int(input().split(\" \"))\r\n\r\nresult = \"\"\r\n\r\nfor number in sequence:\r\n if number in fingerprints:\r\n result += \"%d \"%number\r\n \r\n\r\nprint(result)", "a,b=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\n\nfor i in range(a):\n\tif b[i] in c:\n\t\tprint(b[i],end=' ')\n\t\tc.remove(b[i])\n", "input()\r\na = list(map(int, input().split()))\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 a[i] == b[j]:\r\n c.append(a[i])\r\nprint(*c)", "a,b=map(int,input().split())\r\nc=[int(c) for c in input().split()]\r\nd=[int(d) for d in input().split()]\r\ne=[]\r\nm=0\r\nfor i in range(len(c)):\r\n for j in range(len(d)):\r\n if(c[i]==d[j]):\r\n e.append(c[i])\r\nprint(*e)\r\n", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nlist1 = []\r\nlist2 = []\r\nx = input().split()\r\ntemp = []\r\nfor j in x:\r\n temp.append(int(j))\r\nlist1.append(temp)\r\n\r\nx = input().split()\r\ntemp = []\r\nfor j in x:\r\n temp.append(int(j))\r\nlist2.append(temp)\r\n\r\nfinal = []\r\n\r\nfor i in list1[0]:\r\n if i in list2[0]:\r\n final.append(i)\r\n \r\nprint(*final)\r\n ", "MIS = lambda: map(int,input().split())\r\nn, m = MIS()\r\npw = list(MIS())\r\nfprint = set(MIS())\r\nfor x in pw:\r\n if x in fprint: print(x, end=' ')", "[n, m] = [int(x) for x in input().split()]\r\nS = [int(x) for x in input().split()]\r\nF = [int(x) for x in input().split()]\r\nfor i in S:\r\n if i in F: print(i, end = ' ')\r\n \r\n", "def FingerPrints(n, m, s, f):\r\n res = \"\"\r\n for i in range(n):\r\n if s[i] in f:\r\n res = res + str(s[i]) + \" \"\r\n return res\r\nn, m = input().split()\r\ns = [int(n) for n in input().split()]\r\nf = [int(n) for n in input().split()]\r\nprint(FingerPrints(int(n), int(m), s, f))\r\n ", "n=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(0,len(l)):\r\n if l[i] in f:\r\n c.append(l[i])\r\nprint(*c)\r\n", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb = list(map(int, input().split()))\r\nans=[]\r\nfor i in range(0,len(a)):\r\n if a[i] in b:\r\n ans.append(a[i])\r\nfor i in range(0,len(ans)):\r\n print(ans[i],end=\" \")", "\"\"\" https://codeforces.com/problemset/problem/994/A \"\"\"\r\n\r\ninput_strs = lambda: input ().split ()\r\n\r\n\r\nn, m = input_strs ()\r\nx = input_strs ()\r\ny = input_strs ()\r\n\r\n\r\nd = []\r\nfor i in range ( len ( x ) ):\r\n is_there = False\r\n for j in range ( len ( y ) ):\r\n if x [ i ] == y [ j ]:\r\n is_there = True\r\n if is_there:\r\n d.append ( x [ i ] )\r\n\r\n\r\noutput = ''\r\nfor i in range ( len ( d ) ):\r\n output += d [ i ] + ' '\r\nprint ( output )\r\n", "n,m=map(int,input().split())\r\nlx=[int(i) for i in input().split()]\r\nly=[int(i) for i in input().split()]\r\ns=list(set(lx) and set(ly))\r\nfor i in lx:\r\n if i in s:\r\n print(i,end=' ')\r\nprint()\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nx = []\r\nfor i in range(n):\r\n\tif a[i] in b:\r\n\t\tx.append(a[i])\r\nprint(*x)\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\na=[]\r\nfor i in x:\r\n if i in y:\r\n a.append(i)\r\nprint(*a)", "def main():\r\n a,b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n\r\n subs = input().split()\r\n fingers = input().split()\r\n\r\n for i in subs: \r\n if (i in fingers):\r\n print(i,end=\" \")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m = map(int, input().split())\nsequence = list(map(int, input().split()))\nfingerprints = list(map(int, input().split()))\n\nres = []\nfor x in sequence:\n if x in fingerprints:\n res.append(x)\n\nfor x in res:\n print(x, end = \" \")", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=set(map(int,input().split()))\r\nans=[]\r\nfor i in a:\r\n if i in b:\r\n ans.append(i)\r\nprint(*ans)", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n return (i for i in inp[1].split() if i in set(inp[2].split()))\r\n \r\nprint(*main())\r\n", "n,m = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nfor i in range(len(l1)):\r\n for j in range(len(l2)):\r\n if(l1[i]==l2[j]):\r\n print(l1[i],end=' ')", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\nl = []\n\nfor i in range(0, m):\n try:\n p = x.index(y[i])\n l.append(p)\n i+=1\n except ValueError:\n i+=1\n\nl.sort()\nfor i in l:\n print(x[i], end=\" \")\n\n", "n, m = map(int, input().split())\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\nans = \"\"\r\nfor i in x:\r\n if i in y:\r\n if len(ans) == 0:\r\n ans += str(i)\r\n else:\r\n ans += \" \" + str(i)\r\nprint(ans)", "n, m = (int(x) for x in input().split())\ns = [int(x) for x in input().split()]\nt = [int(x) for x in input().split()]\nans = []\nfor x in s:\n if x in t:\n ans.append(x)\nprint(*ans)\n", "n, m = map(int, input().split())\r\ncode = [int(i) for i in input().split()]\r\nfingers = [int(i) for i in input().split()]\r\nfor i in code:\r\n if i in fingers:\r\n print(i, end=\" \")", "n,m = map(int, input().split())\nX = list(map(int, input().split()))\nY = list(map(int, input().split()))\nA = []\nfor y in Y:\n for i, x in enumerate(X):\n if y == x:\n A.append((i, y))\n break\nA.sort()\nans = []\nfor i, a in A:\n ans.append(a)\nprint(*ans)\n", "n,m = list(map(int,input().split()))\r\nx = list(map(int,input().split()[:n]))\r\ny = list(map(int,input().split()[:m]))\r\n\r\nb = []\r\nfor i in x:\r\n\tif i in y:\r\n\t\tb.append(i)\r\n\r\nfor i in b:\r\n\tprint(i,end=' ')", "n,m = map(int,input().split())\r\na = list(input().split())\r\nb = list(input().split())\r\nprint(' '.join(map(str, (x for x in a if x in b))))", "a = input()\r\nb = [i for i in input().split()]\r\nc = [i for i in input().split()]\r\nfor i in b:\r\n if i not in c: continue\r\n for j in c:\r\n if j == i:\r\n print(j, end = \" \")\r\n break\r\n", "n , m = map(int , input().split(\" \"))\n\ncode = list(map(int , input().split(\" \")))\nfingerprints = list(map(int , input().split(\" \")))\n\nfor i in code :\n if i in fingerprints :\n print(i , end = \" \" )\n", "s=input().split()\nn=int(s[0]);m=int(s[1]);nn=input().split();mm=input().split();ans=[]\nfor i in range(0,n):\n for j in range(0,m):\n if nn[i]==mm[j]:\n ans.append(int(mm[j]))\nans=str(ans)\nans=ans.replace('[','')\nans=ans.replace(']','')\nans=ans.replace(',','')\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jun 11 19:50:33 2018\r\n\r\n@author: HP\r\n\"\"\"\r\n\r\nn,n=map(int,input().split())\r\nan=list(map(int,input().split()))\r\nam=list(map(int,input().split()))\r\nfor i in an:\r\n if i in am:\r\n print(i,end=' ')\r\n ", "a = [int(i) for i in input().split()]\r\nn,m = a[0],a[1]\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\n\r\narray = []\r\nfor i in range (n):\r\n for j in range (m):\r\n if x[i] == y[j]:\r\n array += [x[i]]\r\n\r\nfor i in array:\r\n print(i,end=\" \")\r\n\r\n \r\n", "n,m=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist2=list(map(int,input().split()))\r\nfor i in list1:\r\n if i in list2:\r\n print(i,end=' ')\r\n", "xy = [int(x) for x in input().split()]\nmap = {}\na = input().split()\nfor x in a:\n map[x]=0\nb = input().split()\nfor x in b:\n map[x]=1\ns=\"\"\nfor o in a:\n if(map[o]==1):\n if(s==\"\"): s=o \n else: s = s+\" \"+str(o)\nprint (s)\n \n\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nd2={}\r\nfor i in l2:\r\n if(i in d2):\r\n d2[i]+=1\r\n else:\r\n d2[i]=1\r\nfor i in l1:\r\n if(i in d2):\r\n print(i,end=' ')\r\n d2[i]-=1\r\n if(d2[i]<=0):\r\n del(d2[i])", "n,m=map(int,input().split())\r\n\r\nsequence=list(map(int,input().split()))\r\nfingerprint=list(map(int,input().split()))\r\n\r\nres=[]\r\n\r\nfor i in sequence:\r\n\tif i in fingerprint:\r\n\t\tres.append(i)\r\n\t\t\r\nfor i in res:\r\n\tprint(i,end=\" \")\r\n\t", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\n\r\nl= ' '\r\nfor i in x:\r\n if i in y :\r\n l+=str(i)+' '\r\n i+=1 \r\nprint(l)", "# 10 keys 0-9\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\n\r\nsequence = list(map(int, input().split()))\r\n\r\nkeys_with_fingerprints = set(map(int, input().split()))\r\n\r\n# print(sequence)\r\n# print(keys_with_fingerprints)\r\n\r\ncode = []\r\n# pointer = 0\r\n\r\nfor i in range(n):\r\n if sequence[i] in keys_with_fingerprints:\r\n code.append(sequence[i])\r\n # pointer += 1\r\n\r\n\r\nprint(*code)\r\n", "a=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\na=[]\r\nu=[]\r\nfor i in range(len(y)):\r\n if y[i] in t:\r\n u.append(y[i])\r\n\r\nfor j in range(len(u)):\r\n a.append([t.index(u[j]),u[j]])\r\na.sort()\r\nfor k in a:\r\n print(k[1],end=' ')\r\n", "a,b=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nd=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(0,len(c)):\r\n if(c[i] in d):\r\n l.append(c[i])\r\nprint(*l) \r\n \r\n", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nrec = []\r\nfor i in x:\r\n if i in y:\r\n rec.append(i)\r\n\r\nprint(\" \".join(map(str, rec)))", "n,m=map(int,input().split())\na=input().split()\nb=input().split()\nfor i in a:\n if i in b:\n print(\"{}\".format(i),end=\" \")", "x = []\r\nn,s = map(int,input().split())\r\nf = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nfor i in range(len(f)):\r\n if f[i] in l:\r\n x.append(f[i])\r\nprint(*x)", "n, m=map(int, input().split())\r\na=list(input().split())\r\nb=list(input().split())\r\n\r\np=[]\r\nfor i in a:\r\n\tfor j in b:\r\n\t\tif i==j:\r\n\t\t\tp+=[i]\r\nprint(\" \".join(p))", "a , b = map(int,input().split())\r\nm = list(input().split())\r\nn = list(input().split())\r\nans = ''\r\n\r\nfor i in m:\r\n if n.count(i)>0:\r\n ans += i+' '\r\n\r\nprint(ans[0:len(ans)-1])", "_, l, s = (input().split() for _ in '_ls')\r\nprint(*[d for d in l if d in s])", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n# D={'Power':'purple','Time':'green','Space':'blue','Soul':'orange','Reality':'red','Mind':'yellow'}\r\n# T=int(input())\r\n# L=[]\r\n# for i in range(T):\r\n# \tL.append(input())\r\n# X=list(D.values())\r\n# Y=list(set(X)-set(L))\r\n# K=dict([(value,key) for key,value in D.items()])\r\n# print(len(Y))\r\n# for i in range(len(Y)):\r\n# \tprint(K.get(Y[i])\r\nm,n=map(int,(input().split()))\r\nL=list(map(int,input().split()))\r\nF=list(map(int,input().split()))\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif L[i]==F[j]:\r\n\t\t\tprint(L[i],end=\" \")", "e = []\r\na, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nfor i in range(len(c)):\r\n if c[i] in d:\r\n e.append(c[i])\r\nprint(*e)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nlist1=[int(x) for x in input().split()]\r\nlist2=[int(x) for x in input().split()]\r\nfor i in list1:\r\n if i in list2:\r\n print(i,end=\" \")", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nfor i in range(a):\r\n\tfor j in range(b):\r\n\t\tif c[i] == d[j]:\r\n\t\t\tprint(c[i],end=' ')\r\n\t\telse:\r\n\t\t\tprint(end='')", "a,b=map(int,input().split())\r\nn=input()\r\nm=input()\r\n\r\nn=n.replace(\" \",\"\")\r\nm=m.replace(\" \",\"\")\r\nd=''\r\nfor i in n:\r\n if(i in m):\r\n d+=i\r\n d+=\" \"\r\nprint(d)\r\n", "n, m = list(map(int, input().split()))\r\nol = list(map(int, input().split()))\r\nfl = list(map(int, input().split()))\r\nfor i in ol:\r\n if i in fl:\r\n print(i, end=\" \")", "x, y = input().split()\n\nkeypad = list(map(int, input().split()))\nprints = list(map(int, input().split()))\n\nresult = []\nfor i in keypad:\n if i in prints:\n result.append(i)\n\nfor j in result:\n print(j, end=' ')\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nbrr=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(len(brr)):\r\n if(brr[i] in arr):\r\n c.append(arr.index(brr[i]))\r\nc.sort()\r\nfor i in range(len(c)):\r\n print(arr[c[i]],end=\" \")", "line1 = [int(i) for i in input().split()]\r\nline2 = [int(i) for i in input().split()]\r\nline3 = [int(i) for i in input().split()]\r\ntotal_len = line1[0]\r\nfingerprint_len = line1[1]\r\nnumbers = []\r\nfor x in range(len(line2)):\r\n if line2[x] in line3:\r\n numbers.append(str(line2[x]))\r\nprint(\" \".join(numbers))\r\n", "n , m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if l1[i]==l2[j]:\r\n if l1[i] is not l3:\r\n l3.append(l1[i])\r\nprint(*l3)\r\n ", "n,m=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nl=[]\r\nfor i in z:\r\n\tif(i in x):\r\n\t\tl.append(i)\r\nprint(*l)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if(a[i]==b[j]):\r\n print(a[i],end=\" \")\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\nans=[]\r\nfor i in a:\r\n if i in b:\r\n ans.append(i)\r\nprint(*ans)\r\n ", "\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nl3 = list(map(int, input().split()))\r\n\r\nl = []\r\nfor i in l2:\r\n\tif i in l3:\r\n\t\tl.append(i)\r\nprint(*l, sep = ' ')", "n, m = map(int, input().split())\r\nkeys = list(map(int, input().split()))\r\nfingerprints = list(map(int, input().split()))\r\n\r\nfor i in keys:\r\n if i in fingerprints:\r\n print(i, end = \" \")\r\nprint()", "#!/usr/bin/env python\nn, m = map(int, input().split())\nseq = map(int, input().split())\nfinger = list(map(int, input().split()))\n\nans = []\nfor i in seq:\n if i in finger:\n ans.append(i)\n\nprint(' '.join(map(str, ans)))", "[n, m] = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nans = []\r\nwhile x:\r\n if x[-1] in y:\r\n ans.append(x.pop())\r\n else:\r\n x.pop()\r\nans.reverse()\r\nfor i in ans:\r\n print(i, end=' ')\r\n", "n,m =(map(int,input().split()))\r\nseq=list(map(int,input().split()))\r\nfing=list(map(int,input().split()))\r\nlists=[]\r\nfor i in seq:\r\n\tfor j in fing:\r\n\t\tif j==i:\r\n\t\t\tprint(j,end=\" \")\r\n", "n_m = input()\r\nn_m = [int(i) for i in n_m.split(' ')]\r\n\r\nseq = input()\r\nseq = [int(i) for i in seq.split(' ')]\r\n\r\nfingers = input()\r\nfingers = [int(i) for i in fingers.split(' ')]\r\n\r\nanswer = ''\r\n\r\nfor i in seq:\r\n if i in fingers:\r\n if answer == '':\r\n answer += str(i)\r\n else:\r\n answer += ' ' + str(i)\r\n\r\nprint(answer)", "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\nfor i in a:\r\n if i in b:\r\n print(i, end=' ')\r\n", "a,b=map(int,input().split())\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nsm=[]\nfor i in range (a):\n for l in range(b):\n if x[i]==y[l]:\n sm.append(x[i])\nprint(*sm,sep=\" \")\n\n", "n,m=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nfor i in x:\r\n for j in y:\r\n if i==j:\r\n print(i,end=\" \")\r\nprint()\r\n", "n,k=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\n\r\nlis=[]\r\n\r\nfor i in range(len(a)):\r\n if a[i] in b:\r\n lis.append(a[i])\r\n\r\nfor i in range(len(lis)):\r\n print(lis[i], end=' ')", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\nlisofi = []\nfor i in x:\n\tif i in y:\n\t\tlisofi.append(i)\nprint(* lisofi, sep = ' ')\n", "n,m = map(int,input().split())\r\nseq = list(map(int,input().split()))\r\nfprint = list(map(int,input().split()))\r\n\r\ncommon = set(seq).intersection(set(fprint))\r\n\r\nindex = []\r\nfor i in common:\r\n index.append(seq.index(i))\r\nindex = sorted(index)\r\n\r\nfor i in index:\r\n print(seq[i], end=' ')", "m, n = map(int, input().split())\r\nKnown = list(map(int, input().split()))\r\nCheck = list(map(int, input().split()))\r\nstrAnsw = \"\"\r\nfor i in range(m):\r\n if Known[i] in Check:\r\n strAnsw = strAnsw + str(Known[i]) + \" \"\r\nprint(strAnsw)\r\n", "t = input()\r\nt = t.split(\" \")\r\nn = int(t[0])\r\nm = int(t[1])\r\nt = input()\r\nt = t.split(\" \")\r\narr = []\r\nfor i in t:\r\n arr.append(int(i))\r\n\r\nt = input()\r\nt = t.split(\" \")\r\narr1 = {-2}\r\nfor i in t:\r\n arr1.add( int(i) )\r\nans = \"\"\r\nfor k in arr:\r\n if arr1.__contains__(k):\r\n ans = ans + str(k)\r\n ans = ans + \" \"\r\nprint(ans) \r\n\r\n \r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = set(map(int, input().split()))\n\nprint(*filter(b.__contains__, a))\n", "input()\r\nR=lambda:map(int,input().split())\r\na=list(R())\r\nb=set(R())\r\nprint(' '.join(str(i) for i in a if i in b))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nll=list(map(int,input().split()))\r\nfor i in l:\r\n if i in ll:\r\n print(i,end=' ')", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nq=[0]*10\nans=[]\nfor i in b:\n q[i]+=1\nfor i in a:\n if q[i]!=0:\n ans.append(i)\n q[i]-=1\nfor i in range(len(ans)):\n print(ans[i],end=' ')\nprint()\n\n \t\t\t \t \t\t \t\t \t\t\t \t \t", "import sys\r\n\r\nrd = sys.stdin.readline\r\n\r\nn, m = map(int, rd().split())\r\n\r\nx = list(map(int, rd().split()))\r\ny = list(map(int, rd().split()))\r\n\r\nfor i in x:\r\n if i in y: print(i, end = ' ')\r\n\r\nprint()\r\n", "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\nans = \"\"\r\nfor i in a:\r\n if i in b:\r\n ans += str(i) + \" \"\r\nprint(ans)\r\n", "# A. Fingerprints\n\nfrom collections import OrderedDict\n\nn, m = map(int, input().split())\nx = list(input().split())\ny = list(input().split())\n\nans = OrderedDict()\nfor key in y:\n if key in x:\n ans[x.index(key)] = key\n\nprint(' '.join([value for key, value in sorted(ans.items())]))\n", "n,m=map(int,input().split())\r\nx=input().split()\r\ny=input().split()\r\nfor i in x:\r\n if i in y:\r\n print(i,end=\" \")", "n=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nl=[]\r\nfor i in m:\r\n\tfor j in k:\r\n\t\tif i == j:\r\n\t\t\tl.append(i)\r\nprint(*l)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nli=list(map(int,input().split()))\r\nfor i in l:\r\n if i in li:\r\n print(i,end=\" \")\r\n ", "n, m = map(int, input().strip().split())\r\ns = list(map(int, input().strip().split()))\r\nf = list(map(int, input().strip().split()))\r\nres = list()\r\nfor x in s:\r\n if x in f:\r\n res.append(x)\r\nif res:\r\n print(' '.join(map(str, res)))", "# The place between your comfort zone and your dream is where life takes place. Helen Keller\r\n# by : Blue Edge - Create some chaos\r\n\r\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nk=[0]*10\r\nfor i in y:\r\n k[i]=1\r\n\r\nb=[]\r\nfor i in x:\r\n if k[i]:\r\n b.append(i)\r\n\r\nprint(*b)\r\n", "# PREFUNCS\r\ndef inline():\r\n return [ int(e) for e in input().split() ]\r\n\r\ndef inset():\r\n return set(inline())\r\n\r\n\r\n\r\n# INPUT\r\ninline()\r\ncode = inline()\r\nprints = inset()\r\n\r\n\r\n\r\n# PROCESS\r\nfor e in code:\r\n if e in prints: print(e, end=\" \")\r\nprint()\r\n", "a, b = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\narr1 = [int(x) for x in input().split()]\r\n\r\nfor i in arr:\r\n if i in arr1: print(i, end = ' ')", "n , m = map(int,input().split())\r\nkeys = list(map(int,input().split()))\r\nfingerprints = list(map(int,input().split()))\r\nres = []\r\nfor i in keys:\r\n if i in fingerprints:\r\n res.append(i)\r\nprint(*res,sep=\" \")", "n, k = input().split()\r\nn, k = int(n), int(k)\r\narr = [int(x) for x in input().split()]\r\narr2 = [int(y) for y in input().split()]\r\n\r\nfor i in arr:\r\n if i in arr2:\r\n print(i, end=' ')", "n,m=map(int,input().split())\r\nx=[int(i) for i in input().split()]\r\ny=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(x[i]==y[j]):\r\n print(x[i],end=\" \")\r\n break\r\n \r\n ", "n,m = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nans = []\r\n\r\nfor i in x:\r\n if i in y:\r\n ans.append(i)\r\n\r\nprint(*ans)\r\n\r\n", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if x[i] == y[j]:\r\n print(x[i], end=' ')\r\n", "input()\r\na=input().split()\r\nc=input().split()\r\nfor i in a:\r\n if i in c:print(i,end=' ')", "ls=list(map(int,input().rstrip().split()))\r\na=list(map(int,input().rstrip().split()))\r\nb=list(map(int,input().rstrip().split()))\r\nfor i in a:\r\n for j in b:\r\n if(i==j):\r\n print(j,end=\" \")", "a,b=map(int,input().split())\nc=list(map(int,input().split()))\nd=list(map(int,input().split()))\ne=[]\nfor i in c:\n if i in d:\n e.append(i)\nfor j in e:\n print(j,end=\" \")", "import math\r\nif __name__==\"__main__\":\r\n n,m=input().strip().split(' ')\r\n n,m=[int(n),int(m)]\r\n c=list(map(int,input().strip().split(' ')))\r\n d=list(map(int,input().strip().split(' ')))\r\n for x in range(0,len(c)):\r\n if c[x] not in d:\r\n c[x]=-1\r\n for x in range(0,len(c)):\r\n if c[x]!=-1:\r\n print(c[x],end=' ')\r\n print()", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = [element for element in a if element in b]\r\nfor i in c:\r\n print(i, end=' ')\r\n \r\n", "n, m = list(map(int,input().strip().split(' ')))\r\nseq = list(map(int,input().strip().split(' ')))\r\nf = list(map(int,input().strip().split(' ')))\r\nans = []\r\nfor s in seq:\r\n if s in f:\r\n ans.append(s)\r\nprint(*ans, sep = ' ')", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nk=\"\"\r\nfor i in s:\r\n if i in p:\r\n k+=str(i)+\" \"\r\nprint(k)", "n,m=input().split() \r\na=input().split() \r\nb=input().split() \r\nans=[i for i in a if i in b] \r\nprint(\" \".join(ans)) ", "# Fingerprints\nn, m = list(map(int, input().strip().split()))\na = list(map(int, input().strip().split()))\nb = list(map(int, input().strip().split()))\nans = []\nfor i in a:\n if i in b:\n ans.append(i)\nprint(*ans)", "n,m=[int(x) for x in input().split()]\r\nx=[int(x) for x in input().split()][:n]\r\ny=[int(x) for x in input().split()][:m]\r\nfor i in x:\r\n if i in y:\r\n print(i,end=\" \")", "n,m=input().split()\r\nl=input().split()\r\nm=input().split()\r\nr=[]\r\nfor i in l:\r\n if i in m:\r\n r.append(i)\r\nprint(*r)", "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\nc=[]\r\nfor i in a:\r\n if i in b:\r\n c.append(i)\r\nprint(*c)", "n,m = map(int, input().split(' '))\r\n\r\nseq = list(map(int, input().split(' ')))\r\nfin = list(map(int, input().split(' ')))\r\n\r\ncode=[]\r\nfor i in seq:\r\n if i in fin:\r\n code.append(i)\r\n\r\nfor i in code:\r\n print(i, end=\" \")", "n,m=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=[]\r\nfor i in l:\r\n if i in a:\r\n res.append(i)\r\nprint(*res,sep=' ')\r\n", "n,m=input().split()\r\nx=list(input().split())\r\ny=list(input().split())\r\nprint(*filter(lambda x:x in y,x))", "n , m =map(int,input().split())\r\nnums = [int(i) for i in input().split()]\r\nfp = [int(i) for i in input().split()]\r\nind =[]\r\nfor i in fp:\r\n if i in nums:\r\n ind.append(nums.index(i))\r\nind.sort()\r\nans = \"\"\r\nfor i in ind:\r\n ans += str(nums[i]) + \" \"\r\nprint(ans)", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nfor i in range(n):\r\n if s[i] in t:\r\n print(s[i],end=\" \")\r\n\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[18]:\n\n\nn, m = map(int,input().split())\nx = list(map(int,input().strip().split()))[:n]\ny = list(map(int,input().strip().split()))[:m]\n\na = []\n\nfor i in x:\n for j in y:\n if i == j:\n a.append(j)\n \nprint(*a)\n\n\n# In[ ]:\n\n\n\n\n", "t = list(map(int,input().split(' ')))\r\nl1 = list(map(int,input().split(' ')))\r\nl2= list(map(int,input().split(' ')))\r\nl3=[]\r\nfor i in l1:\r\n if i in l2:\r\n l3.append(i)\r\nfor i in l3:\r\n print(i,end=\" \")", "n,m=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\nl=[]\r\nfor ele in d:\r\n if ele in f:\r\n l.append(ele)\r\n \r\nprint(*l)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n B = list(map(int, input().split()))\r\n C = []\r\n for a in A:\r\n if a in B:\r\n C.append(a)\r\n print(' '.join(list(str(a) for a in C)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\"\"\".\"\"\"\narr_len, prints_nr = (int(x) for x in input().split())\narr = [int(x) for x in input().split()]\nprints = set(int(x) for x in input().split())\n\nfor elem in arr:\n if elem in prints:\n print(elem, end=\" \")\n", "n,m=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl2.sort()\r\nl2.reverse()\r\nfor i in l1:\r\n\tif i in l2:\r\n\t\tprint(i,end=\" \")", "n, k = [int(x) for x in input().split()]\r\nxs = input().split()\r\nys = set(input().split())\r\nfor x in xs:\r\n if x in ys:\r\n print(x, end=' ')\r\nprint('')", "info = [int(i) for i in input().split()]\r\nnumbers = [int(i) for i in input().split()]\r\nkWp = [int(i) for i in input().split()]\r\n\r\ncode = list()\r\n\r\nfor i in range(info[0]):\r\n for k in range(info[1]):\r\n if numbers[i] == kWp[k]:\r\n code.append(kWp[k])\r\n\r\nfor i in range(len(code)):\r\n print(str(code[i]))", "n , m = map(int,input().strip().split())\r\n\r\na = [int(_) for _ in input().strip().split()]\r\nb = [int(_) for _ in input().strip().split()]\r\nb = set(b)\r\nans = [i for i in a if i in b]\r\nprint(*ans)", "\"\"\"import sys\r\nsys.stdin = open(\"key_lock.in\",\"r\")\"\"\"\r\na = input().split()\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nlis = []\r\nfor i in b:\r\n\tfor j in c:\r\n\t\tif i == j:\r\n\t\t\tlis.append(j)\r\nprint(*lis)", "from collections import Counter\r\ndef func():\r\n x,y=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n m=list(map(int,input().split()))\r\n for i in l:\r\n for j in m:\r\n if i==j:\r\n print(i,end=\" \") \r\nt=1\r\n#t=int(input())\r\nfor i in range(t):\r\n func()", "n,m = map(int, input().split())\r\nseq = list(map(int, input().split()))\r\nfp = list(map(int, input().split()))\r\nfor elem in seq:\r\n if elem in fp:\r\n print(elem, end=' ')", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nfor i in range(len(l1)):\r\n if(l1[i] in l2):\r\n print(l1[i],end=\" \")\r\n\r\n", "#In the name of GOD!\nn, m = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\nfor i in x:\n\tfor j in y:\n\t\tif i == j:\n\t\t\tprint(i, end = ' ')\n\t\t\tbreak\n", "\r\ndef fonction(liste1, liste2):\t\r\n\td = []\r\n\tfor i in range(len(liste1)):\r\n\t\tif liste2.count(liste1[i]) == 1:\r\n\t\t\td.append(liste1[i])\r\n\t\telse:\r\n\t\t\tpass\r\n\treturn d\r\n\r\nn , m = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nprint(*fonction(a,b))\r\n\r\n", "s = []\r\nn ,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range (0,n) :\r\n for k in range (0,m) :\r\n if a[i] == b[k] :\r\n s.append(a[i])\r\n n +=1\r\nif n==0 :\r\n print(\"-\")\r\nelse:\r\n print(*s)", "m,n=map(int,input().split())\r\na=input().split()\r\nb=input().split()\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif a[i]==b[j]:\r\n\t\t\tprint(b[j],end=\" \")", "n,m=map(int,input().split())\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nl=[]\nfor i in y:\n if i in x:\n l.append(i)\nfor i in x:\n if i in l:\n print(i,end=\" \")\n", "n,m=map(int,input().strip().split())\r\nl=list(map(int,input().strip().split()))\r\nk=list(map(int,input().strip().split()))\r\nfor i in l:\r\n if i in k:\r\n print(i,end=' ')", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(m):\r\n if y[i] in x:\r\n l.append(x.index(y[i]))\r\nl.sort()\r\nfor i in l:\r\n print(x[i],end=\" \")", "input()\r\nl=list(map(str,input().split()))\r\nf=list(map(str,input().split()))\r\nans=[]\r\nfor i in l:\r\n if i in f:\r\n ans.append(i)\r\n if len(ans)==len(f):\r\n break\r\nprint(' '.join(ans),end=\"\")", "import math\r\n\r\nn, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nans = []\r\ns = \"\"\r\n\r\nx = input().split()\r\ny = input().split()\r\n\r\nfor i in range(len(y)):\r\n s = s + str(y[i])\r\nfor i in range(len(x)):\r\n if s.find(str(x[i])) != -1:\r\n ans.append(int(x[i]))\r\nfor i in range(len(ans)):\r\n print(ans[i], end =' ')\r\n", "import random\r\n\r\nn, m = map(int,input().split())\r\nsequence = list(map(int,input().split()))\r\nkeys = list(map(int,input().split()))\r\nfor i in range(n):\r\n if sequence[i] in keys:\r\n print(sequence[i],end=\" \")", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nres=[-1]*10\r\nfor i in y:\r\n if i in x:\r\n res[x.index(i)]=i\r\nfor i in res:\r\n if i!=-1:\r\n print(i,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\r\n \r\n", "\r\n# //{F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,F,,F,F,F,F,F,F,F,F,}///////////////\r\n\r\n# //{_@_A_b_d_u_l___M_a_l_i_k_@_}////////////\r\n\r\n# //Author: Abdul MALik//////////////////\r\n\r\n# //Fingerprints!:///////////\r\n\r\nm,n = map(int,input().split())\r\nx = input().split()\r\ny = input().split()\r\nf = ''\r\nfor i in range(m):\r\n if x[i] in y:\r\n f += x[i]+' '\r\nprint(f)\r\n\r\n", "a = input().split()\r\nb = input().split()\r\nc = input().split()\r\nans = \"\"\r\nfor i in b:\r\n if i in c:\r\n ans+=i+\" \"\r\nprint(ans)", "def f():\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 io=[]\r\n for j in y:\r\n if j in x:\r\n io+=[x.index(j)]\r\n io=sorted(io)\r\n for i in io:\r\n print(x[i],end=' ')\r\n return\r\n\r\nt=1\r\nwhile t:\r\n f()\r\n t-=1\r\n \r\n \r\n", "\"\"\"\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n\"\"\"\r\nn, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nfor i in x:\r\n\tif i in y:\r\n\t\tprint(i, end = \" \")\r\nprint()\r\n\r\n\t\r\n\t\r\n\r\n\t\r\n\t\t\r\n\t\t\r\n\t\r\n", "a,b = input().split()\r\n\r\nli= list(map(int, input().split()))\r\ntest= list(map(int, input().split()))\r\n\r\nans=[]\r\nfor i in li:\r\n if i in test:\r\n ans.append(i)\r\n\r\nfor i in ans:\r\n print(i, end=\" \")", "list1=[ ]\r\nfig=[ ]\r\nn,m=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nfig=list(map(int,input().split()))\r\n\r\nfor j in range(n):\r\n for t in range(m):\r\n if fig[t] == list1[j]:\r\n print(fig[t], end=\" \")", "n,m=map(int,input().split())\r\na=[int(X ) for X in input().split()]\r\nb=[int(x) for x in input().split()]\r\nan=[]\r\nfor i in a:\r\n if i in b:\r\n an.append(i)\r\nprint(*an)", "n=[int(num) for num in input().split()]\r\na={}\r\nb={}\r\ncount=1\r\nfor j in input().split():\r\n (a[j],count)=(count,count+1)\r\nfor j in input().split():\r\n b[j]=0\r\nfor i in a.keys():\r\n try:\r\n if b[i]==0:\r\n print(i,end=' ')\r\n except KeyError:\r\n pass\r\n", "n_m=input()\r\nstring=\"\"\r\ns=input().split()\r\nf=input().split()\r\nfor check in s:\r\n\tif check in f:\r\n\t\tcheck+=\" \"\r\n\t\tstring+=check\r\nprint(string)", "n, m = map(int,input().split())\r\ndlin = list(map(int, input().split()))\r\nest = list(map(int,input().split()))\r\nk = []\r\nfor i in dlin:\r\n if i in est:\r\n k.append(i)\r\nprint(*k)", "t = input().split()\r\ntc = input().split()\r\ninp = input().split()\r\nstr1 = \"\" \r\nfor i in tc:\r\n if i in inp:\r\n str1 += i+\" \"\r\nprint(str1)", "line1 = list(input().split())\r\nline2 = list(input().split())\r\nline3 = list(input().split())\r\nfor i in line2:\r\n for j in line3:\r\n if(i == j):\r\n print(i,end = ' ')\r\n break", "x = [int(i) for i in input().split()]\r\nn, m, res = x[0], x[1], []\r\ny = input().split()\r\nz = input().split()\r\nfor i in y:\r\n if i in z:\r\n res.append(i)\r\nprint(' '.join(res))\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,m=map(int,input().split())\r\nl=[]\r\nk=list(map(int,input().split()))\r\nj=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif k[i] in j:\r\n\t\tprint(k[i],end=\" \")\r\n", "import operator\r\ndef fingerprints(n, m, ls1, ls2):\r\n dic = {}\r\n for i in range(m):\r\n if(ls2[i] in ls1):\r\n dic.update({ls1.index(ls2[i]) : ls2[i]})\r\n dic = dict(sorted(dic.items(), key = operator.itemgetter(0)))\r\n ls = list(dic.values())\r\n return ls \r\n\r\nn, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nls1 = [int(i) for i in input().split()]\r\nls2 = [int(j) for j in input().split()]\r\nprint(\" \".join(map(str, fingerprints(n, m, ls1, ls2))))", "n, m = map(int, input().split())\r\nans = \"\"\r\nx = [0]*n\r\ny = [0]*m\r\nx = input().split()\r\ny = input().split()\r\nfor i in range(n): x[i] = int(x[i])\r\nfor i in range(m): y[i] = int(y[i])\r\ni = 0\r\nj = 0\r\nwhile (j<m) and (i<n):\r\n if x[i] in y: \r\n ans = ans + str(x[i]) + \" \"\r\n j+=1\r\n i+=1\r\nprint(ans)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nk = list(map(int,input().split()))\r\n\r\n\r\n\r\nfor i in l:\r\n if i in k:\r\n print(i, end = ' ')\r\n \r\n \r\n", "n,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\nr=[]\r\nfor x in p:\r\n if x in q:\r\n r.append(x)\r\nfor x in r:\r\n print(x,end=\" \") \r\n\r\n\r\n", "nm = input()\nline1 = input().split()\nline2 = input().split()\nfor i in line1:\n if i in line2:\n print(i,end = \" \")\n", "def main():\r\n useless = input()\r\n x, y = list(map(int, input().split())), list(map(int, input().split()))\r\n x, y = list(filter(lambda a: a in y, x)), list(filter(lambda a: a in x, y))\r\n if x and y:\r\n ans = []\r\n for i in x:\r\n if i in y:\r\n ans.append(i)\r\n print(\" \".join([str(i) for i in ans]))\r\n return 0\r\n print(\"\")\r\n return 0\r\nmain()\r\n", "# import sys\n# import time\n# sys.stdin=open(\"utest.in\",\"r\")\n# sys.stdout=open(\"utest.out\",\"w\")\n\nn,m=map(int,input().split())\np=list(map(int,input().split()))\nq=list(map(int,input().split()))\nfor i in range(len(p)):\n\tif p[i] in q:\n\t\tprint(p[i],end=\" \")\n", "n,m = map(int, input().split())\r\nseq = [i for i in map(int, input().split())]\r\nfinger = [i for i in map(int, input().split())]\r\ntemp = []\r\n\r\nfor i in set(seq).intersection(set(finger)):\r\n temp.append(seq.index(i))\r\n \r\ntemp.sort()\r\n\r\nfor i in temp:\r\n print(seq[i], end=\" \")\r\n", "def f():\r\n useless = input()\r\n sequence = [int(x) for x in input().split()]\r\n keys = [int(key) for key in input().split()]\r\n correct_sequence = [x for x in sequence if x in keys]\r\n for key in correct_sequence:\r\n print(key, end=\" \")\r\n\r\n\r\n\r\nf()\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=l1.copy()\r\nfor i in l1:\r\n if i not in l2:\r\n l3.remove(i)\r\nprint(*l3)", "a,b=map(int,input().split())\r\nm=list(map(int,input().split()))\r\nn=list(map(int,input().split()))\r\nfor x in range(a):\r\n\tif m[x] in n:\r\n\t\tprint(m[x],end=\" \")", "a=[int (x) for x in input().split()]\nb=[int (i) for i in input().split()]\nc=[int (j) for j in input().split()]\nd=len(b)\nfor i in range(d):\n\tif b[i] in c:\n\t\tprint(b[i],end=\" \")", "#import sys\r\n#import math\r\n#sys.stdout=open(\"C:/Users/pipal/OneDrive/Desktop/VS code/python/output.txt\",\"w\")\r\n#sys.stdin=open(\"C:/Users/pipal/OneDrive/Desktop/VS code/python/input.txt\",\"r\")\r\n#t=int(input())\r\n#for i in range(t): \r\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nfor i in range(len(x)):\r\n if x[i] in y:\r\n print(x[i],end=\" \")\r\nprint()\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "import sys\r\n\r\nlines = sys.stdin.readlines()\r\nn,m = lines[0].strip().split(' ')\r\nkeys_input = lines[1].strip().split(' ')\r\nverified_keys = set(lines[2].strip().split(' '))\r\nresult = [key for key in keys_input if key in verified_keys]\r\nprint(' '.join(result))", "n,m= input().split()\nx = list(map(int,input().split()))\ny = list(map(int,input().split()))\n\nlenx = len(x)\nfor i in range(lenx):\n if x[i] in y:\n print(x[i],end=\" \")\nprint()\n", "(number_of_keys, keys_on_keypad_have_fingerprint) = map(int, input().split(' '))\n\nkeys = input().split(' ')\nfingerprint_keys = input().split(' ')\n\nfor i in range(number_of_keys):\n keys[i] = int(keys[i])\n\nfor i in range(keys_on_keypad_have_fingerprint):\n fingerprint_keys[i] = int(fingerprint_keys[i])\n\ncorresponding_keys = []\n\nfor key in keys:\n if key in fingerprint_keys:\n corresponding_keys.append(key)\n\nprint(*corresponding_keys)\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\n\r\nz=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(x[i]==y[j]):\r\n z.append(x[i])\r\nif(len(z)!=0):\r\n for i in range(len(z)):\r\n print(z[i],end=\" \")\r\nelse:\r\n print()\r\n \r\n", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = []\r\n\r\nfor ai in a:\r\n\tif ai in b:\r\n\t\tans.append(str(ai))\r\n\r\nif (len(ans) >= 1):\r\n\tprint(\" \".join(ans))\r\nelse:\r\n\tprint()\r\n", "n,m=map(int,input().split())\r\nnlst=input().split()\r\nmlst=input().split()\r\nfor j in range(n):\r\n if nlst[j] in mlst:\r\n print (nlst[j],end=' ')\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\nL = []\r\nfor i in range(n):\r\n if a[i] in b:\r\n L.append(a[i])\r\nprint(*L,sep=' ')", "n,m=map(int,input().split())\r\nlst=list()\r\na=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\nfor i in a:\r\n for j in b:\r\n if(i==j):\r\n lst.append(i)\r\nprint(*lst) \r\n ", "input()\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nprint(*sorted(set(x) & set(y), key=lambda a: x.index(a)))\r\n", "n = input().split(' ')\nline_one = []\nline_two = []\nres = []\nline_one = input().split(' ')\nline_two = input().split(' ')\nfor i in range(int(n[0])):\n for j in range(int(n[1])):\n if line_one[i] == line_two [j]:\n res.append(line_one[i])\nfor i in res:\n print(i, end=\" \")\n\n\n ", "def solve(s, f):\r\n ans = list()\r\n f_pool = set(f)\r\n for c in reversed(s):\r\n if not f_pool:\r\n break\r\n else:\r\n if c in f_pool:\r\n ans.append(c)\r\n f_pool.remove(c)\r\n return \" \".join(reversed(list(map(str, ans))))\r\n\r\ndef main():\r\n n,m =list(map(int, input().split()))\r\n s = list(map(int, input().split()))\r\n f = list(map(int, input().split()))\r\n print(solve(s, f))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "a,b = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nd = [int(x) for x in input().split()]\r\n\r\nfor i in c:\r\n if i in d:\r\n print(i,end=\" \")", "n,m = map(int,input().split())\r\nw = [*map(int,input().split())]\r\nl = [*map(int,input().split())]\r\ns = set(w)\r\ne = set(l)\r\nq = s.intersection(e)\r\nfor i in w:\r\n if i in q:\r\n print(i,end=\" \")", "p = [int(tmp) for tmp in input().split()]\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in a :\r\n\tif i in b :\r\n\t\tprint(i,end = \" \")", "n,m=map(int,input().split()[:2])\r\na=list(map(int,input().split()[:n]))\r\nb=list(map(int,input().split()[:m]))\r\nl=[]\r\nfor i in b:\r\n if i in a:\r\n l.append(a.index(i))\r\nl.sort()\r\nfor i in l:\r\n print(a[i],end=\" \")", "a, b, c = input().split(), input().split(), input().split()\r\n\r\nprint(' '.join([i for i in b if i in c]))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\nfor i in range(0,len(l)):\r\n\tfor j in range(0,len(f)):\r\n\t\tif(f[j]==l[i]):\r\n\t\t\tprint(l[i],end=\" \")\r\n\t\telse:\r\n\t\t\tpass", "z=list(map(int,input().split()))\r\n\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in x :\r\n for j in range(len(y)) :\r\n if i==y[j] :\r\n count+=1\r\n if count==len(y) :\r\n print(i)\r\n else :\r\n print(i,end=\" \")\r\n", "l=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nn=list(map(int,input().split()))\r\no=[]\r\nfor i in m:\r\n if i in n:\r\n o.append(i)\r\nfor i in o:\r\n print(i,end=\" \")\r\n", "n, m = map(int, input().split())\nx = [i for i in map(int, input().split())]\ny = [i for i in map(int, input().split())]\n\nseq = []\nfor i in y:\n if i not in x:\n pass\n else:\n z = x.index(i)\n seq.append(z)\n\nseq.sort()\nfor i in seq:\n print(x[i], end=\" \")\n", "a,n = map(int,input().split())\r\nsequence = list(input().split())\r\nfinger = list(input().split())\r\nlist1 = [i for i in sequence if i in finger]\r\nprint(*list1)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nl=[]\r\nfor i in a:\r\n\tif i in b:\r\n\t\tl.append(i)\r\nx=sorted(l,reverse=True)\r\nprint(*l)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nfor j in l:\r\n if j in m:\r\n print(j,end=\" \")", "n,m = map(int,input().split())\r\nseq_list = list(map(int,input().split()))\r\nfingerprint_list = list(map(int,input().split()))\r\n\r\nfor i in seq_list:\r\n if i in fingerprint_list:\r\n print(i,end=\" \")", "class fingerprints:\r\n def __init__(self, n, m):\r\n self.n = n\r\n self.m = m\r\n self.calculateCode(self.n, self.m)\r\n\r\n def calculateCode(self, n, m):\r\n list1 = []\r\n list2 = []\r\n p = input()\r\n q = input()\r\n list1 = list(p.split())\r\n list2 = list(q.split())\r\n list3 = list1.copy()\r\n # print(list1, list2)\r\n for x in list1:\r\n if x in list1:\r\n if x not in list2:\r\n list3.remove(x)\r\n for x in list3:\r\n print(int(x), end=\" \")\r\n\r\n\r\nn, m = map(int, input().split())\r\nif(1 <= n and m <= 10):\r\n pass\r\nelse:\r\n exit()\r\nfingerprintsObj = fingerprints(n, m)\r\n", "import sys\r\nimport collections\r\nimport itertools as it\r\n\r\n\r\n\r\ndef readArray(type= int):\r\n line = input()\r\n return [type(x) for x in line.split()]\r\n\r\ndef solve():\r\n n, m = readArray()\r\n seq = readArray()\r\n fprints = readArray()\r\n\r\n cc = 0\r\n\r\n freq = collections.defaultdict(int)\r\n\r\n for x in fprints:\r\n freq[x] += 1\r\n\r\n for x in seq:\r\n freq[x] += 1\r\n\r\n if freq[x] > 1:\r\n print(x, end=' ')\r\n\r\n print()\r\n\r\nif __name__ == '__main__':\r\n # sys.stdin = open('input.txt')\r\n solve()\r\n\r\n", "n, m = map(int, input().split())\nan = list(input().split())\nam = input()\nprint(\"\".join([i + \" \" for i in an if i in am]))\n", "from math import ceil\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n n,m = [int(v) for v in input().split()]\r\n pos = [int(v) for v in input().split()]\r\n otp = set([int(v) for v in input().split()])\r\n d = []\r\n for v in pos:\r\n if v in otp:\r\n d.append(str(v))\r\n print(\" \".join(d))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "n, m = map(int, input().strip().split())\r\ny1 = list(map(int, input().strip().split()))\r\ny2 = list(map(int, input().strip().split()))\r\n\r\ny1.sort()\r\ny2.sort()\r\nu1 = list()\r\nu2 = list()\r\np = 0\r\nwhile p < n:\r\n q = p\r\n while q < n and y1[q] == y1[p]:\r\n q += 1\r\n u1.append((y1[p], q - p))\r\n p = q\r\np = 0\r\nwhile p < m:\r\n q = p\r\n while q < m and y2[q] == y2[p]:\r\n q += 1\r\n u2.append((y2[p], q - p))\r\n p = q\r\n# print(u1)\r\n# print(u2)\r\n\r\nn = len(u1)\r\nm = len(u2)\r\n\r\nres = 0\r\nfor i in range(n): \r\n for j in range(m):\r\n ya = u1[i][0] + u2[j][0] # first small ship\r\n\r\n y1_stat = [True] * n\r\n y2_stat = [True] * m\r\n for ii in range(n):\r\n for jj in range(m):\r\n if u1[ii][0] + u2[jj][0] == ya:\r\n y1_stat[ii] = False # right large ship destroyed\r\n y2_stat[jj] = False # left large ship destroyed\r\n f = dict()\r\n for ii in range(n):\r\n for jj in range(m):\r\n yb = u1[ii][0] + u2[jj][0] # second small ship\r\n inc = 0\r\n if y1_stat[ii]:\r\n inc += u1[ii][1]\r\n if y2_stat[jj]:\r\n inc += u2[jj][1]\r\n if yb in f:\r\n f[yb] += inc\r\n else:\r\n f[yb] = inc\r\n\r\n yb = -1\r\n if f:\r\n yb = max(f, key=f.get)\r\n for ii in range(n):\r\n for jj in range(m):\r\n if u1[ii][0] + u2[jj][0] == yb:\r\n y1_stat[ii] = False\r\n y2_stat[jj] = False\r\n\r\n cur = 0\r\n cur += sum(u1[ii][1] for ii in range(n) if not y1_stat[ii])\r\n cur += sum(u2[jj][1] for jj in range(m) if not y2_stat[jj])\r\n res = max(res, cur)\r\nprint(res)", "from collections import Counter\r\nMV = 400020\r\na = [0] * MV\r\nfor i in range(MV):\r\n a[i] = set()\r\n\r\nn ,m = list(map(int , input().split()))\r\n\r\nfirst = list(map(int , input().split()))\r\nsecond = list(map(int , input().split()))\r\n\r\nfor fid, f in enumerate(first):\r\n for sid, s in enumerate(second):\r\n a[f+s].add(fid + MV)\r\n a[f+s].add(sid)\r\n\r\na.sort(key = lambda x: -len(x))\r\n\r\nb = [len(k) for k in a]\r\n\r\n# for k in range(MV):\r\n# if b[k]>0:\r\n# print(k, b[k], a[k])\r\n\r\nbest_res = b[0]\r\nfor pos in range(MV):\r\n for pos2 in range(MV):\r\n if b[pos] + b [pos2] <= best_res:\r\n break\r\n cur = len(a[pos].union(a[pos2]))\r\n if cur > best_res :\r\n best_res = cur\r\nprint(best_res)\r\n", "from itertools import combinations\r\n \r\n[n, m] = map(int, input().strip().split())\r\ny1s = list(map(int, input().strip().split()))\r\ny2s = list(map(int, input().strip().split()))\r\n \r\npts = {}\r\nfor i1, y1 in enumerate(y1s):\r\n\tfor i2, y2 in enumerate(y2s):\r\n\t\ty = y1 + y2\r\n\t\tif y in pts:\r\n\t\t\tpts[y][0].add(i1)\r\n\t\t\tpts[y][1].add(i2)\r\n\t\telse:\r\n\t\t\tpts[y] = [{i1}, {i2}]\r\n \r\nbest = 0\r\nif len(pts) == 1:\r\n\tfor u, v in pts.values():\r\n\t\tbest = max(best, len(u) + len(v))\r\n \r\n \r\nfor k1, k2 in combinations(pts.keys(), 2):\r\n\tv = len(pts[k1][0].union(pts[k2][0])) + len(pts[k1][1].union(pts[k2][1]))\r\n\tbest = max(best, v)\r\n \r\nprint (best)" ]

[ "from collections import defaultdict\r\n \r\nfours = [list() for i in range(10001)]\r\nfor a in range(10):\r\n for b in range(10):\r\n for c in range(10):\r\n for d in range(10):\r\n num = (a, b, c, d)\r\n variants = set()\r\n variants.add(a + b + c + d)\r\n variants.add(a + b + c - d)\r\n variants.add(a + b - c - d)\r\n variants.add(a - b - c - d)\r\n variants.add(a * b * c * d)\r\n variants.add(a * b * c - d)\r\n variants.add(a * b - c - d)\r\n variants.add(a * b * c * d)\r\n variants.add(a * b * c + d)\r\n variants.add(a * b + c * d)\r\n variants.add(a * b + c + d)\r\n variants.add(a + b * c + d)\r\n variants.add(a + b + c * d)\r\n variants.add(a * 10 + b + c + d)\r\n variants.add(a * 10 + b + c - d)\r\n variants.add(a * 10 + b - c - d)\r\n variants.add(a + b * 10 + c + d)\r\n variants.add(a + b * 10 + c - d)\r\n variants.add(a * 100 + b * 10 + c + d)\r\n variants.add(a * 100 + b * 10 + c - d)\r\n variants.add( a + b * 100 + c * 10 + d)\r\n variants.add(-a + b * 100 + c * 10 + d)\r\n variants.add((a + b) * (c + d))\r\n variants.add((a + b - c) * d)\r\n variants.add((a * b - c) * d)\r\n variants.add(a * 1000 + b * 100 + c * 10 + d)\r\n \r\n for variant in variants:\r\n if variant > 10000 or variant < 0:\r\n continue\r\n fours[variant].append(num)\r\n'''\r\nfor i in range(10001):\r\n if len(fours[i]) == 0:\r\n print('ZERO!')\r\nprint(len(fours[0]), len(fours[1]))'''\r\n \r\nk, m = map(int, input().split())\r\nwhile True:\r\n printed = set()\r\n for fhalf in fours[1]:\r\n for shalf in fours[k]:\r\n if (fhalf == shalf) or fhalf + shalf in printed:\r\n continue\r\n print(*fhalf, sep='', end='')\r\n print(*shalf, sep='')\r\n m -= 1\r\n printed.add(fhalf + shalf)\r\n if not m:\r\n exit(0)\r\n for diff in range(10000):\r\n for fhalf in fours[diff]:\r\n for shalf in fours[k - diff]:\r\n if (fhalf == shalf) or fhalf + shalf in printed:\r\n continue\r\n print(*fhalf, sep='', end='')\r\n print(*shalf, sep='')\r\n m -= 1\r\n printed.add(fhalf + shalf)\r\n if not m:\r\n exit(0)" ]

[ "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\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\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef luckyNumbers(n, r, lucky_nums):\r\n lucky_nums.append(n)\r\n if n > r*10:\r\n return\r\n luckyNumbers((10*n)+4, r, lucky_nums)\r\n luckyNumbers((10*n)+7, r, lucky_nums)\r\n\r\n\r\ndef helper(n, res):\r\n ans = 0\r\n for i in range(1, len(res)):\r\n ans += (res[i]*(min(res[i], n)-min(res[i-1], n)))\r\n return ans\r\n\r\n\r\ndef Solution(l, r):\r\n # Write Your Code Here\r\n\r\n luckyNums = []\r\n luckyNumbers(0, r, luckyNums)\r\n luckyNums = sorted(luckyNums)\r\n # print(luckyNums)\r\n print(helper(r, luckyNums)-helper(l-1, luckyNums))\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n l, r = get_ints_in_variables()\r\n Solution(l, r)\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import stdin as sin\r\ndef aint():return int(sin.readline())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return str(sin.readline().split())\r\n\r\nl,r = amap()\r\nd=[4,7]\r\n\r\nfor i in range(9):\r\n f=[]\r\n for j in d:\r\n f.append(int(\"4\"+str(j)))\r\n f.append(int(\"7\"+str(j)))\r\n if len(\"4\"+str(j)) == 10:\r\n break\r\n d+=f\r\n\r\nd=set(d)\r\nd=list(d)\r\nd.sort()\r\n# print(d[0:15])\r\nans=0\r\np=l\r\nfor i in d:\r\n if i>=p and i<=r:\r\n ans+=(i-p+1)*i\r\n # print(ans)\r\n p=i+1\r\n elif i>=r:\r\n ans+=(r-p+1)*i\r\n # print(ans)\r\n break\r\n\r\nprint(ans)\r\n \r\n ", "# your code goes here\r\narr = input().split()\r\nl = int(arr[0])\r\nr = int(arr[1])\r\n\r\nnum = '4'\r\n\r\nlucky = []\r\nwhile 1:\r\n\tlucky.append(int(num))\r\n\tif int(num) > r:\r\n\t\tbreak\r\n\t\r\n\tn = len(num)\r\n\tflag = 0\r\n\tarr = list(num)\r\n\t\r\n\tfor i in range(n):\r\n\t\tif arr[n-i-1] == '4':\r\n\t\t\tflag = 1\r\n\t\t\ti = n-i-1\r\n\t\t\tbreak\r\n\t\r\n\tif flag == 1:\r\n\t\tarr[i] = '7'\r\n\telse:\r\n\t\tarr.insert(0, '4')\r\n\t\ti = 0\r\n\t\tn += 1\r\n\ti += 1\r\n\twhile i < n:\r\n\t\tarr[i] = '4'\r\n\t\ti += 1\r\n\tnum = ''.join(arr)\r\n#\tprint(num)\r\nn = len(lucky)\r\nprev = l\r\nans = 0\r\nfor i in range(n):\r\n\tnext = lucky[i]\r\n\tif next < prev:\r\n\t\tcontinue\r\n\tif r < next:\r\n\t\tnext = r\r\n\tans += (next - prev + 1)*lucky[i]\r\n\tprev = next+1\r\n\tif prev > r:\r\n\t\tbreak\r\nprint(ans)\r\n\t\r\n\t\r\n\t", "lucky_arr = [4, 7]\n\ni = 0\nfor _ in range(8):\n len_arr = len(lucky_arr)\n while i < len_arr:\n lucky_arr.extend((lucky_arr[i]*10+4, lucky_arr[i]*10+7))\n i += 1\n\nlucky_arr.append(4444444444)\n\nl, r = map(int, input().split())\n\nfor i in range(len(lucky_arr)):\n if lucky_arr[i] >= l:\n break\nsum = 0\nwhile lucky_arr[i] < r:\n sum += (lucky_arr[i]-l+1)*lucky_arr[i]\n l = lucky_arr[i]+1\n i += 1\n\nsum += (r-l+1)*lucky_arr[i]\n\nprint(sum)\n", "\r\nn = (input()).split()\r\nl = int(n[0])\r\nr = int(n[1])\r\na = []\r\nx = []\r\na.append([])\r\na[0].append('4')\r\na[0].append('7')\r\n\r\nfor i in range(1,10):\r\n a.append([])\r\n for j in a[i-1]:\r\n \r\n a[i].append('4'+j)\r\n a[i].append('7'+j)\r\n for j in a[i]:\r\n x.append(int(j))\r\nx.append(4)\r\nx.append(7)\r\nx.sort()\r\nsum = [16]\r\nfor i in range(1,len(x)):\r\n sum.append((x[i]-x[i-1])*x[i]+sum[i-1])\r\nfor i in range(len(x)):\r\n if x[i] >= l:\r\n t = i \r\n break\r\nfor i in range(len(x)):\r\n if x[i] >= r:\r\n e = i\r\n break\r\nres = sum[e] - sum[t] - x[e] * (x[e]-r) + (x[t]-l+1) * x[t]\r\nprint(res)\r\n\r\n", "from bisect import bisect_left\r\narr = [0,4,7]\r\nnew = [4,7]\r\nfor i in range(1,10): \r\n new=[4*(10**(i))+x for x in new]+[7*(10**(i))+x for x in new]\r\n arr+=new[:]\r\n \r\nl,r = map(int,input().split())\r\na = bisect_left(arr,l)\r\n\r\nans = 0\r\nwhile arr[a]<r:\r\n ans+=(arr[a]-l+1)*arr[a]\r\n l = arr[a]+1\r\n a+=1\r\nans+=(r-l+1)*arr[a]\r\nprint(ans)", "l,r=list(map(int,input().split()))\n#list the lucky numbers first\nluckyList=[]\nl1=0\nl2=0\ndef lucky(n):\n luckyList.append(n)\n if (n>10*r):\n return\n lucky(n*10+7)\n lucky(n*10+4)\nlucky(0)\nluckyList.sort()\n# print(luckyList)\nsum1 = 0\nsum2 = 0\nfor i in range(len(luckyList)):\n sum1+=luckyList[i]*(min(luckyList[i],r)-min(luckyList[i-1],r))\n sum2+=luckyList[i]*(min(luckyList[i],l-1)-min(luckyList[i-1],l-1))\nprint(sum1-sum2)\n\n \t\t \t \t \t\t \t\t \t\t\t \t\t \t\t", "l,r=map(int,input().split())\r\n \r\na=[]\r\ndef foo(n):\r\n\ta.append(n)\r\n\tif n>10*r:\r\n\t\treturn\r\n\tfoo(10*n+4)\r\n\tfoo(10*n+7)\r\n\treturn\r\n \r\nfoo(0)\r\na.sort()\r\n \r\ndef get_sum(m):\r\n\ts=0\r\n\tfor i in range(1,len(a)):\r\n\t\ts+=a[i]*(min(a[i],m)-min(a[i-1],m))\r\n\treturn s\r\n \r\nprint(get_sum(r)-get_sum(l-1))", "x, y = map(int,input().split())\r\na=list()\r\na = [4, 7]\r\nl = 0\r\nmid = -1\r\nk = len(list(str(y)))\r\nwhile l<k:\r\n\tfor m in range(mid+1,len(a)):\r\n\t\ta.append(str(a[m])+\"4\")\r\n\t\ta.append(str(a[m])+\"7\")\r\n\tl+=1\r\nsuma = 0\r\nfor m in range(len(a)):\r\n\tif x<= int(a[m]) and y <= int(a[m]) and x <= y:\r\n\t\tsuma+=int(a[m])*(y - x+1)\r\n\t\tbreak\r\n\telif x<=int(a[m]) and y > int(a[m]):\r\n\t\tsuma+=int(a[m])*(int(a[m]) - x+1)\r\n\t\tx = int(a[m])+1\r\nprint(suma)\r\n", "from collections import deque\r\nl, r = [int(i) for i in input().strip().split()]\r\n\r\ndef next(i):\r\n\r\n q=deque()\r\n q.append(4)\r\n q.append(7)\r\n while q:\r\n r=q.popleft()\r\n if r>=i:\r\n return r\r\n q.append((r*10)+4)\r\n q.append((r*10)+7)\r\nsumm=0\r\nnexti=0\r\nwhile l<=r:\r\n nexti=next(l)\r\n\r\n summ+=(min(nexti,r)-l+1)*nexti\r\n\r\n l=nexti+1\r\n\r\nprint(summ)\r\n", "l, r = list(map(int, input().split()))\noutput = 0\nj = 0\nlist = [4, 7]\nmin = l-1\n\nwhile list[j] < l:\n list.append(list[j]*10+4)\n list.append(list[j]*10+7)\n j += 1\n\nwhile list[j] <= r:\n output = output+(list[j]-min)*list[j]\n list.append(list[j]*10+4)\n list.append(list[j]*10+7)\n min = list[j]\n j += 1\n\noutput = output + (r-min)*list[j]\nprint(output)\n\n \t\t\t \t\t\t\t \t\t\t\t\t \t \t\t\t\t\t \t", "a = []\r\nl,r = [int(i) for i in input().split()]\r\ndef luck(n):\r\n\tif n>10**10:\r\n\t\treturn \r\n\telse:\r\n\t\ta.append(n)\r\n\t\tluck(n*10+4)\r\n\t\tluck(n*10+7)\r\n\t\t\r\nluck(0)\r\na.sort()\r\nans = 0\r\nfor i in range(len(a)-1):\r\n\tlow = max(l,a[i]+1)\r\n\thigh = min(r,a[i+1])\r\n\tif high>=low:\r\n\t\tans = ans + (high-low+1)*a[i+1]\r\nprint(ans)\r\n", "def naxt(i) :\r\n e=bin(i+2)\r\n e=e[3:]\r\n e=e.replace(\"0\",\"4\")\r\n e=e.replace(\"1\",\"7\")\r\n return int(e)\r\ni=0\r\nans=0\r\npr=0\r\nl,r=map(int,input().split())\r\nwhile(True):\r\n t=naxt(i)\r\n \r\n ans+=max((min(r,t)-max(l,pr)+1)*t,0)\r\n pr=t+1\r\n if r<=t :\r\n break\r\n i+=1\r\n \r\nprint(ans)\r\n \r\n \r\n \r\n \r\n", "l,r=map(int,input().split())\r\ns=0\r\ndef next(x) :\r\n arr=[4,7]\r\n j=0\r\n while arr[-1] < x :\r\n arr.append(arr[j]*10+4)\r\n arr.append(arr[j]*10+7)\r\n j+=1\r\n return arr\r\narr=next(r)\r\nj=0\r\noutput=0\r\nlmin=l-1\r\nwhile arr[j] < l :\r\n j+=1\r\nwhile arr[j] < r :\r\n output=output+(arr[j]-lmin)*arr[j]\r\n lmin=arr[j]\r\n j+=1\r\noutput=output+(r-lmin)*arr[j]\r\nprint(output)", "l,r=map(int,input().split())\r\np=0\r\ny=[4]\r\nwhile p<=10**18:\r\n p=\"\"\r\n d=list(str(y[len(y)-1]))\r\n n=len(p)-1\r\n flag=0\r\n #print(d)\r\n q=d[::-1]\r\n if d.count('7')==len(d):\r\n d=list(\"4\"*(len(d)+1))\r\n p=int(\"\".join(d)) \r\n y.append(p)\r\n continue\r\n g=q.index('4')\r\n nn=len(d)-1\r\n d[nn-g]='7'\r\n for i in range(nn-g+1,len(d)):\r\n \r\n d[i]='4'\r\n p=int(\"\".join(d)) \r\n y.append(p)\r\n#print(y)\r\ndef find(l):\r\n for i in range(len(y)):\r\n if y[i]>=l:\r\n return y[i]\r\n\r\nc=0 \r\nwhile l<=r:\r\n q=find(l)\r\n c+=q*(min(q,r)-l+1)\r\n l=q+1\r\nprint(c) ", "l,r=map(str,input().split())\r\nl1=len(l)\r\nl2=len(r)\r\ngraph={\"4\":[\"4\",\"7\"],\"7\":[\"4\",\"7\"]}\r\nans=set()\r\ndef dfs(s,n):\r\n s+=n\r\n if len(s)>=l1 and len(s)<=l2+1 and int(s)>=int(l):\r\n ans.add(int(s))\r\n elif len(s)>l2:\r\n return\r\n for i in graph[n]:\r\n dfs(s[:],i)\r\ns=\"\"\r\nfor i in graph:\r\n dfs(s[:],i)\r\nans=list(ans)\r\nans.sort()\r\nfin=0\r\ni=0\r\nl=int(l);r=int(r)\r\nfor num in ans:\r\n if num>=l:\r\n fin+=num*(num-l+1)\r\n l=num+1\r\n if num>=r:\r\n fin+=num*(r-l+1)\r\n break;\r\n# while l<r:\r\n# fin+=ans[i]*(ans[i]-(l-1))\r\n# l = ans[i]+1\r\n# i+=1\r\n# print(fin)\r\n# print(l,r)\r\nprint(fin)", "digits = [4, 7]\r\nnums = [4, 7]\r\n\r\nLIM = 10 ** 10\r\nwhile nums[-1] < LIM:\r\n nums = list(set(nums + [num * 10 + digit for digit in digits for num in nums]))\r\n\r\nnums = [num for num in sorted(nums) if num <= LIM]\r\n\r\n\r\ndef c(l, r):\r\n ans = 0\r\n x = 0\r\n while l <= r:\r\n while nums[x] < l:\r\n x += 1\r\n num = nums[x]\r\n count = min(r, num) - l + 1\r\n ans += count * num\r\n l += count\r\n return ans\r\n\r\n\r\na, b = [int(_) for _ in input().split()]\r\nprint(c(a, b))", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n l, r = [int(i) for i in input().split(\" \")]\r\n x = [4, 7]\r\n current = 2\r\n is_broken = False\r\n while True:\r\n z = len(x)\r\n for i in range(z - current, z):\r\n x.append(int(str(4) + str(x[i])))\r\n if x[-1] > r:\r\n is_broken = True\r\n break\r\n if is_broken:\r\n break\r\n for i in range(z - current, z):\r\n x.append(int(str(7) + str(x[i])))\r\n if x[-1] > r:\r\n break\r\n if is_broken:\r\n break\r\n current *= 2\r\n final_collector = 0\r\n for i in range(len(x)):\r\n if l > r:\r\n break\r\n elif l <= x[i] and x[i] <= r:\r\n final_collector += (x[i] - l + 1) * x[i]\r\n l = x[i] + 1\r\n elif l <= x[i] and x[i] > r:\r\n final_collector += (r - l + 1) * x[i]\r\n break\r\n print(final_collector)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "N = int(1e9)\r\n\r\na = []\r\n\r\ndef go(n):\r\n a.append(n)\r\n if n > N: return\r\n go(int(n * 10 + 4))\r\n go(int(n * 10 + 7))\r\n\r\ndef f(n):\r\n if n == 0: return 0\r\n sm = int(0)\r\n num = int(0)\r\n cur = int(1)\r\n while cur <= n:\r\n while a[num] < cur: num += 1\r\n to = min(a[num], n)\r\n sm += a[num] * (to - cur + 1)\r\n cur = to + 1\r\n return sm\r\n\r\ngo(int(4))\r\ngo(int(7))\r\na.sort()\r\ns = input().split()\r\nl = int(s[0])\r\nr = int(s[1])\r\nprint(f(r) - f(l - 1))\r\n", "from bisect import bisect_left\r\n\r\n\r\na = []\r\nl, r = map(int, input().split())\r\ndef F(x):\r\n a.append(x)\r\n if (x > r*10):\r\n return\r\n F(x*10 + 4)\r\n F(x*10 + 7)\r\n\r\nF(0)\r\nsum = 0\r\na.sort()\r\ni = bisect_left(a, l)\r\nj = i\r\nwhile(a[i] < r):\r\n sum += a[i]*(a[i] - l)\r\n l = a[i]\r\n i += 1\r\nsum += a[i]*(r - l)\r\nsum += a[j]\r\n\r\n\r\nprint(sum)", "def get_all_lucky(length):\r\n if length==1:\r\n return ['4','7']\r\n ans=get_all_lucky(length-1)\r\n temp=ans.copy()\r\n for i in temp:\r\n ans.append('4'+i)\r\n ans.append('7'+i)\r\n return ans\r\n\r\nl,r=map(int, input().split())\r\nlucky_nums=get_all_lucky(10)\r\nlucky_nums=list(map(int, lucky_nums))\r\nlucky_nums.sort()\r\nans=0\r\nfor i in lucky_nums:\r\n num_to_left=max(min(i,r)-l+1,0)\r\n ans+=num_to_left*i\r\n l=max(i+1,l)\r\n if l>r:\r\n break\r\nprint(ans)", "a=['4', '7']\r\n\r\nx=[]\r\nfor i in a:\r\n x.append(int(i))\r\n\r\nfor i in a:\r\n for j in a:\r\n x.append(int(i+j))\r\n\r\nfor i in a:\r\n for j in a:\r\n for k in a:\r\n x.append(int(i+j+k))\r\n\r\nfor i in a:\r\n for j in a:\r\n for k in a:\r\n for l in a:\r\n x.append(int(i+j+k+l))\r\n\r\nfor i in a:\r\n for j in a:\r\n for k in a:\r\n for l in a:\r\n for m in a:\r\n x.append(int(i+j+k+l+m))\r\n\r\nfor i in a:\r\n for j in a:\r\n for k in a:\r\n for l in a:\r\n for m in a:\r\n for n in a:\r\n x.append(int(i+j+k+l+m+n))\r\n\r\n\r\nfor i in a:\r\n for j in a:\r\n for k in a:\r\n for l in a:\r\n for m in a:\r\n for n in a:\r\n for o in a:\r\n x.append(int(i+j+k+l+m+n+o))\r\n\r\n\r\nfor i in a:\r\n for j in a:\r\n for k in a:\r\n for l in a:\r\n for m in a:\r\n for n in a:\r\n for o in a:\r\n for p in a:\r\n x.append(int(i+j+k+l+m+n+o+p))\r\n\r\nfor i in a:\r\n for j in a:\r\n for k in a:\r\n for l in a:\r\n for m in a:\r\n for n in a:\r\n for o in a:\r\n for p in a:\r\n for q in a:\r\n x.append(int(i+j+k+l+m+n+o+p+q))\r\n\r\nx.append(4444444444)\r\n\r\nm, n = map(int, input().split(' '))\r\nfor i in range(len(x)):\r\n if (x[i] >= m):\r\n break\r\n\r\nfor j in range(len(x)):\r\n if (x[j] >= n):\r\n break\r\n\r\nif i == j:\r\n print((n-m+1)*x[i])\r\n quit()\r\n \r\nsumx = (x[i] - m + 1) * x[i]\r\nsumx += (n - x[j-1]) * x[j]\r\n\r\nfor i in range(i+1, j):\r\n sumx += (x[i]-x[i-1])*x[i]\r\n\r\nprint(sumx)\r\n", "\r\ndef nex(t):\r\n t = ['0']+list(str(t))\r\n ret = ['0']\r\n for i in range(1,len(t)):\r\n if t[i]=='4' or t[i]=='7':\r\n ret.append(t[i])\r\n continue\r\n if t[i]>'7':\r\n if ret[-1]=='0':\r\n ret[-1]='4'\r\n elif ret[-1]=='4':\r\n ret[-1]='7'\r\n else:\r\n j=len(ret)-1\r\n while ret[j]=='7':\r\n ret[j]='4'\r\n j-=1\r\n ret[j] = '4' if ret[j]=='0' else '7'\r\n ret.append('4')\r\n elif t[i]<'4':\r\n ret.append('4')\r\n else:\r\n ret.append('7')\r\n ret.append('4'*(len(t)-1-i))\r\n break\r\n return int(''.join(ret))\r\n\r\n\r\nl,r = map(int, input().split())\r\n\r\nm=nex(l)\r\nans = (int(m)-l+1)*int(m)\r\n\r\nwhile m<r:\r\n l=m\r\n m=nex(l+1)\r\n ans += (m-l)*m\r\n\r\n\r\nans -= (m-r)*m\r\n\r\nprint(ans)", "from itertools import product\r\nl, r = map(int, input().split())\r\nlucky_nums = sorted(int(''.join(p)) for r in range(1, 11) for p in product(\"47\", repeat=r))\r\nans = 0\r\nfor lucky_num in lucky_nums:\r\n if l <= lucky_num <= r:\r\n ans += (lucky_num - l + 1) * lucky_num\r\n l = lucky_num + 1\r\n elif l <= lucky_num and r < lucky_num:\r\n ans += (r - l + 1) * lucky_num\r\n break\r\nprint(ans)\r\n \t \t \t \t \t\t\t\t \t", "import bisect\r\n\r\ndef foo():\r\n\tl=[4,7]\r\n\twhile(len(str(l[-1]))<=12):\r\n\t\tz=[]\r\n\t\tfor i in range(0,len(l)):\r\n\t\t\tfor j in range(0,len(l)):\r\n\t\t\t\ts=str(l[i])+str(l[j])\r\n\t\t\t\tif(len(s)>=12):\r\n\t\t\t\t\tl=l+z\r\n\t\t\t\t\treturn l\r\n\t\t\t\tz.append(int(s))\r\n\t\t\t\t#print(len(s))\r\n\t\tl=l+z\r\n\t\t\r\na=[0]\r\na=a+foo()\r\na=list(set(a))\r\n\r\na.sort()\r\n#print(*l)\r\n#print(l[-1])\r\n#for i in l:\r\n#\tprint(i)\r\nl,r=map(int,input().split())\r\n'''c=0\r\nj=0\r\ni=n\r\nwhile(i<m+1):\r\n\twhile(i<l[j]):\r\n\t\tc=c+(l[j]*(l[j]-i))\r\n\t\ti=l[j]\r\n\tj=j+1\r\n\t\r\nprint(c)'''\r\n\t\r\n\r\ndef get_sum(m):\r\n\ts=0\r\n\tfor i in range(1,len(a)):\r\n\t\ts+=a[i]*(min(a[i],m)-min(a[i-1],m))\r\n\treturn s\r\n \r\nprint(get_sum(r)-get_sum(l-1))\r\n\t\r\n\t\r\n\t", "li = set()\r\ndef addi(n):\r\n if n>10**10+1:\r\n return\r\n li.add(n)\r\n addi(n*10+4)\r\n addi(n*10+7)\r\naddi(4)\r\naddi(7)\r\nli = list(set(li))\r\nli.sort()\r\nl,r = map(int,input().split())\r\nans = 0\r\nfor x in li:\r\n if x >= r:\r\n ans += x*(r-l+1)\r\n break\r\n elif x >= l:\r\n ans += x*(x-l+1)\r\n l = x+1\r\nprint(ans)", "def solve(l: int, r: int):\r\n result = 0\r\n prev = l\r\n for happy in happy_numbers():\r\n if happy >= r:\r\n result += (r - prev + 1) * happy\r\n break\r\n if happy >= prev:\r\n result += (happy - prev + 1) * happy\r\n prev = happy + 1\r\n return result\r\n\r\n\r\ndef happy_numbers():\r\n yield 4\r\n yield 7\r\n for n in happy_numbers():\r\n yield n * 10 + 4\r\n yield n * 10 + 7\r\n\r\n\r\nif __name__ == '__main__':\r\n l, r = map(int, input().split())\r\n print(solve(l, r))\r\n", "l,r=map(int,input().split())\r\na=[]\r\ndef addLucky(x):\r\n if x>10*r:\r\n return\r\n a.append(x)\r\n addLucky(x*10+4)\r\n addLucky(x*10+7)\r\naddLucky(0)\r\na.sort()\r\ndef result(n):\r\n res=0\r\n for i in range(0,len(a)):\r\n res+=a[i]*(min(a[i],n)-min(a[i-1],n))\r\n return res\r\nprint(result(r)-result(l-1))\r\n", "l,r = map(int,input().split())\r\n \r\nnum = '4'\r\n \r\nlucky = []\r\nwhile True:\r\n\tlucky.append(int(num))\r\n\tif int(num) > r:\r\n\t\tbreak\r\n\tn = len(num)\r\n\tf = 0\r\n\tlst = list(num)\r\n\tfor i in range(n):\r\n\t\tif lst[n-i-1] == '4':\r\n\t\t\tf = 1\r\n\t\t\ti = n-i-1\r\n\t\t\tbreak\r\n\tif f == 1:\r\n\t\tlst[i] = '7'\r\n\telse:\r\n\t\tlst.insert(0, '4')\r\n\t\ti = 0\r\n\t\tn += 1\r\n\ti += 1\r\n\twhile i < n:\r\n\t\tlst[i] = '4'\r\n\t\ti += 1\r\n\tnum = ''.join(lst)\r\n\r\nn = len(lucky)\r\nprev = l\r\nresult = 0\r\nfor i in range(n):\r\n\tn = lucky[i]\r\n\tif n < prev:\r\n\t\tcontinue\r\n\tif r < n:\r\n\t\tn = r\r\n\tresult += (n - prev + 1)*lucky[i]\r\n\tprev = n+1\r\n\tif prev > r:\r\n\t\tbreak\r\nprint(result)", "luckynums = []\r\nfor digits in range(1,10):\r\n\tfor mask in range(1<<digits):\r\n\t\tnum = \"\"\r\n\t\tfor i in range(digits):\r\n\t\t\tif((mask & 1<<i)==0):\r\n\t\t\t\tnum = \"4\" + num\r\n\t\t\telse:\r\n\t\t\t\tnum = \"7\" + num\r\n\t\tluckynums.append(int(num))\r\nluckynums.append(4444444444)\r\n\r\ndef next(x):\r\n\tif(x<=4):\r\n\t\treturn 0\r\n\tL = 0\r\n\tR = len(luckynums)-1\r\n\twhile(L<R):\r\n\t\tM = (L+R)//2\r\n\t\tif(luckynums[M]<x):\r\n\t\t\tL=M+1\r\n\t\telse:\r\n\t\t\tR=M\r\n\treturn L\r\n\r\na, b = tuple(int(i) for i in input().split())\r\nsum = 0\r\ni = a\r\nwhile(i<=b):\r\n\tnextv = next(i)\r\n\tsum+=luckynums[nextv]*(min(luckynums[nextv],b)-i+1)\r\n\ti = luckynums[nextv]+1\r\nprint(sum)\r\n", "l, r = map(int, input().split())\r\nsum = 0\r\npre = [4, 7]\r\ndef check(x):\r\n\twhile x != 0:\r\n\t\tif x % 10 != 4 and x % 10 != 7:\r\n\t\t\treturn False\r\n\t\tx //= 10\r\n\treturn True\r\npos = 0\r\nwhile True:\r\n\tpre.append(pre[pos] * 10 + 4)\r\n\tpre.append(pre[pos] * 10 + 7)\r\n\tif pre[-1] >= r:\r\n\t\tbreak\r\n\tpos += 1\r\npos = 0\r\nfor i in range(l, r + 1):\r\n\twhile pre[pos] < i:\r\n\t\tpos += 1\r\n\tsum += pre[pos]\r\nprint(sum)", "from bisect import bisect_left\n\ns, e = [int(i) for i in input().split(\" \")]\n\nres = []\ncurr = []\n\n\ndef lucky_combinations(curr, ctr):\n if 0 < ctr < len(str(e)) + 2 and (curr not in res):\n res.append(int(\"\".join(curr)))\n if ctr == len(str(e)) + 2:\n return\n curr.append(\"4\")\n lucky_combinations(curr.copy(), ctr + 1)\n curr.pop()\n curr.append(\"7\")\n lucky_combinations(curr.copy(), ctr + 1)\n curr.pop()\n\n\n# def lucky_combinations(curr):\n# res.append(curr)\n# if curr > 10 * e:\n# return\n\n# lucky_combinations(curr * 10 + 4)\n# lucky_combinations(curr * 10 + 7)\n\n\ndef find_ge(a, key):\n \"\"\"Find smallest item greater-than or equal to key.\n Raise ValueError if no such item exists.\n If multiple keys are equal, return the leftmost.\n\n \"\"\"\n i = bisect_left(a, key)\n if i == len(a):\n raise ValueError(\"No item found with key at or above: %r\" % (key,))\n return a[i], i\n\n\nlucky_combinations([], 0)\n\nres.sort()\n_, res_start_ind = find_ge(a=res, key=s)\ntotal = 0\nwhile s <= e:\n next_lucky, ind = find_ge(res, s)\n total += next_lucky * (min(next_lucky, e) - s + 1)\n s = min(res[ind], e) + 1\nprint(total)\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\ndef luckyNumbers(n, r, lucky_nums):\r\n lucky_nums.append(n)\r\n if n > r*10:\r\n return\r\n luckyNumbers((10*n)+4, r, lucky_nums)\r\n luckyNumbers((10*n)+7, r, lucky_nums)\r\n\r\ndef helper(n, res):\r\n ans = 0\r\n for i in range(1, len(res)):\r\n ans += (res[i]*(min(res[i], n)-min(res[i-1], n)))\r\n return ans\r\n\r\ndef main():\r\n # Write Your Code Here\r\n l,r = get_ints_in_variables()\r\n luckyNums = []\r\n luckyNumbers(0, r, luckyNums)\r\n luckyNums = sorted(luckyNums)\r\n print(helper(r, luckyNums)-helper(l-1, luckyNums))\r\n\r\n\r\n \r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "\r\nluckies = []\r\ndef genertateLucky(b):\r\n if b > 10 ** 10:\r\n return\r\n luckies.append(b)\r\n genertateLucky(b * 10 + 4)\r\n genertateLucky(b * 10 + 7)\r\n \r\ngenertateLucky(0)\r\nluckies.sort()\r\n\r\nl , r = [int(x) for x in input().split()]\r\n\r\nsumm = 0\r\ncei = 0\r\n\r\nfor e in range(len(luckies)):\r\n if l <= luckies[e]:\r\n cei = e\r\n break\r\n\r\n\r\nwhile True:\r\n if r >= luckies[cei]:\r\n summ += luckies[cei] * (luckies[cei] - l + 1) \r\n l = luckies[cei] + 1\r\n cei += 1\r\n else:\r\n summ += luckies[cei] * (r - l + 1) \r\n break\r\n\r\nprint(summ)", "#!/usr/bin/env python3\n\ndef main():\n \n def aux(ok, s, i):\n if i >= len(s):\n return 0\n\n if ok:\n s[i] = '4'\n return aux(True, s, i+1)\n\n if s[i] > '7':\n s[i] = '4'\n aux(True, s, i+1)\n return 1\n\n if s[i] > '4':\n ok = aux(s[i] < '7', s, i+1)\n s[i] = '4' if ok and s[i] == '7' else '7'\n return ok\n \n ok = aux(s[i] < '4', s, i+1)\n s[i] = '7' if ok and s[i] == '4' else '4'\n \n return 0\n\n def nextN(i):\n s = list(str(i))\n carryout = aux(False, s, 0)\n s = '4' + \"\".join(s) if carryout else \"\".join(s)\n return int(s)\n\n l, r = map(int, input().split())\n ans = 0\n nr = nextN(r)\n \n while l <= r:\n nl = nextN(l)\n if nl == nr:\n ans += nl * (r - l + 1)\n break\n else:\n ans += nl * (nl - l + 1)\n l = nl + 1\n\n print(ans)\nif __name__ == \"__main__\":\n main()\n\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(x):\r\n y = 0\r\n for i in range(len(s) - 1):\r\n c = min(x, s[i + 1]) - s[i]\r\n if c <= 0:\r\n break\r\n y += c * s[i + 1]\r\n return y\r\n\r\nl, r = map(int, input().split())\r\npow2 = [1]\r\nfor _ in range(10):\r\n pow2.append(2 * pow2[-1])\r\ns = [0]\r\nfor u in range(1, 10):\r\n for i in range(pow2[u]):\r\n x, y = 0, 1\r\n for j in range(u):\r\n x += 7 * y if i & pow2[j] else 4 * y\r\n y *= 10\r\n s.append(x)\r\ns.append(4444444444)\r\nans = f(r) - f(l - 1)\r\nprint(ans)", "def f(lim):\n four, seven, seed, base, l = 4, 7, 0, 1, [0]\n while True:\n cur = l[base - 1:]\n for head in four, seven:\n for seed in cur:\n seed += head\n l.append(seed)\n if seed >= lim:\n return l\n four *= 10\n seven *= 10\n base *= 2\n\n\ndef main():\n lo, hi = map(int, input().split())\n l = f(hi)\n res = a = 0\n for b in l:\n res += (b - a) * b\n a = b\n res -= (b - hi) * b\n a = 0\n for b in l:\n res -= (b - a) * b\n if b >= lo:\n break\n a = b\n print(res + (b - lo + 1) * b)\n\n\nif __name__ == '__main__':\n main()\n", "import sys,math\r\nfrom collections import deque,defaultdict\r\nimport operator as op\r\nfrom functools import reduce\r\nfrom itertools import permutations\r\nimport heapq\r\n\r\n#sys.setrecursionlimit(10**7) \r\n# OneDrive\\Documents\\codeforces\r\n\r\nI=sys.stdin.readline\r\n\r\nalpha=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nmod=10**9 + 7\r\n\r\n\"\"\"\r\nx_move=[-1,0,1,0,-1,1,1,-1]\r\ny_move=[0,1,0,-1,1,1,-1,-1]\r\n\"\"\"\r\ndef ii():\r\n\treturn int(I().strip())\r\ndef li():\r\n\treturn list(map(int,I().strip().split()))\r\ndef mi():\r\n\treturn map(int,I().strip().split())\r\n\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 ispali(s):\r\n\ti=0\r\n\tj=len(s)-1\r\n\r\n\twhile i<j:\r\n\t\tif s[i]!=s[j]:\r\n\t\t\treturn False\r\n\t\ti+=1\r\n\t\tj-=1\r\n\treturn True\r\n\r\n\r\n\r\ndef isPrime(n):\r\n\tif n<=1:\r\n\t\treturn False\r\n\telif n<=2:\r\n\t\treturn True\r\n\telse:\r\n\t\t\r\n\t\tfor i in range(2,int(n**.5)+1):\r\n\t\t\tif n%i==0:\r\n\t\t\t\treturn False\r\n\t\treturn True\r\n\r\nlucky_nums=[4,7]\r\nf=0\r\ni=0\r\ncnt=1\r\nwhile True:\r\n\ttmp=[]\r\n\tfor n in [4,7]:\r\n\t\tfor j in lucky_nums[i:]:\r\n\t\t\tx=str(n)+str(j)\r\n\t\t\tif len(x)>10:\r\n\t\t\t\tf=1\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\ttmp.append(int(x))\r\n\t\tif f:\r\n\t\t\tbreak\r\n\tif tmp:\r\n\t\tlucky_nums+=tmp\r\n\t\ti+=(2**cnt)\r\n\t\tcnt+=1\r\n\r\n\tif f:\r\n\t\tbreak\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n\t\r\n\tl,r=mi()\r\n\ti=0\r\n\tlast=l \r\n\tans=0\r\n\twhile lucky_nums[i]<last:\r\n\t\ti+=1\r\n\twhile last<=r:\r\n\t\t\r\n\t\tans+=lucky_nums[i]*((min(lucky_nums[i],r)-last)+1)\r\n\t\tlast=lucky_nums[i]+1\r\n\t\ti+=1\r\n\tprint(ans)\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\t\t\r\n\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\t\r\n\r\n\r\n\t\r\n\t\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n \r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\t\r\n\r\n\r\n\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\t\t\t\t\r\n\r\n\r\n\t\r\n\r\n\t\r\n\t\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\t\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\t\t\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "l,r=map(int,input().split())\r\n \r\na=[]\r\ndef lucky(n):\r\n\ta.append(n)\r\n\tif n>r:\r\n\t\treturn\r\n\tlucky(10*n+4)\r\n\tlucky(10*n+7)\r\n\treturn\r\n \r\nlucky(0)\r\na.sort()\r\ndef get_sum(m):\r\n\ts=0\r\n\tfor i in range(1,len(a)):\r\n\t # count numbers between every lucky number\r\n\t # then multiply by cur lucky number\r\n\t\ts+=a[i]*(min(a[i],m)-min(a[i-1],m))\r\n\treturn s\r\n \r\nprint(get_sum(r)-get_sum(l-1))", "setVector=set()\r\ndef setRecursion(n):\r\n if n>10**10+1:\r\n return\r\n setVector.add(n)\r\n setRecursion(n*10+4)\r\n setRecursion(n*10+7)\r\nsetRecursion(4)\r\nsetRecursion(7)\r\nallNums=list(setVector)\r\nallNums.sort()\r\nl,r=map(int,input().split())\r\nans=0\r\nfor num in allNums:\r\n if num>=r:\r\n ans+=num*(r-l+1)\r\n break\r\n elif num>=l:\r\n ans+=num*(num-l+1)\r\n l=num+1\r\nprint(ans)\r\n", "from bisect import bisect_left\r\nl, r = map(int, input().split())\r\nt, p, u, v = [4, 7], [4, 7], 4, 7\r\nwhile t[-1] < r:\r\n u, v = u * 10, v * 10\r\n t = [u + i for i in t] + [v + i for i in t]\r\n p.extend(t)\r\np = p[bisect_left(p, l): bisect_left(p, r) + 1]\r\nprint((p[0] - l + 1) * p[0] + (r - p[-1]) * p[-1] + sum((p[i] - p[i - 1]) * p[i] for i in range(1, len(p))))", "import sys\r\ninput = sys.stdin.readline\r\nimport bisect\r\n\r\ni = 0\r\ns = []\r\nwhile i < 1500:\r\n s.append(bin(i)[2:].replace('0','4').replace('1','7'))\r\n s.append(bin(i)[2:].replace('0','7').replace('1','4'))\r\n i += 1\r\ns = sorted(map(int, s[2:]))\r\nl, r = map(int, input().split())\r\nc = 0\r\ni = l\r\n\r\nwhile i < r + 1:\r\n d = bisect.bisect_right(s,i)\r\n if i == s[d-1]:\r\n c += s[d-1]\r\n i += 1\r\n else:\r\n x = s[d]\r\n if x < r + 1:\r\n c += x * (x-i+1)\r\n i = x+1\r\n else:\r\n c += x * (r-i+1)\r\n i = r + 1\r\nprint(c)", "def mapit():\r\n\ttemp=list(map(int,input().split()))\r\n \r\n\treturn temp\r\nimport bisect\r\narr=[]\r\ndef rec(ch):\r\n\tif ch>4444444444:\r\n\t\treturn\r\n\tif ch>0:\r\n\t\tarr.append(ch)\r\n\tch*=10\r\n\tch+=4\r\n\trec(ch)\r\n\tch+=3\r\n\trec(ch)\r\n\r\n\r\n\r\nl,r=mapit()\r\nrec(0)\r\narr.sort()\r\nleft=bisect.bisect_left(arr, l)\r\nright=bisect.bisect_right(arr, r)\r\nif left==right:\r\n\tans=arr[left]*(r-l+1)\r\n\tprint(ans)\r\nelse:\r\n\tans=arr[left]*(arr[left]-l+1)\t\r\n\tfor i in range(left+1,right+1):\r\n\t\tans+=((arr[i])*(min(arr[i],r)-arr[i-1]))\r\n\tprint(ans)\r\n", "#print(\"AUTHOR : SADIA AFROZ\")\r\n\r\nimport bisect\r\n\r\n\r\nl,r=map(int, input().split())\r\nsum=0\r\nluckyNumbersList=[]\r\n\r\ndef luckyNumbersGen(x):\r\n if x>=7777777777:\r\n return\r\n luckyNumbersList.append(x)\r\n luckyNumbersGen(x*10+4)\r\n luckyNumbersGen(x*10+7)\r\n\r\nluckyNumbersGen(4)\r\nluckyNumbersGen(7)\r\n#print(luckyNumbersList)\r\nluckyNumbersList.sort()\r\n#print(luckyNumbersList)\r\n\r\ndef next(x):\r\n lower=bisect.bisect_left(luckyNumbersList,x)\r\n #print(\"hello {} \".format(luckyNumbersList[lower]))\r\n return luckyNumbersList[lower]\r\n\r\n\r\nwhile l<=r:\r\n temp=next(l)\r\n if r<temp: #for out of range (l-r) Max number returned\r\n sum += temp*(r-l+1)\r\n break\r\n #print(temp)\r\n #sum+=temp*(min(temp,r)-l+1)\r\n sum += temp * (temp - l + 1)\r\n l=temp+1\r\n\r\nprint(sum)", "pre = []\r\nprev = ['']\r\nfor i in range(1, 11):\r\n cur = [s + '4' for s in prev] + [s + '7' for s in prev]\r\n pre.extend(cur)\r\n prev = cur\r\nl = sorted(map(int, pre))\r\nx, y = map(int, input().split())\r\nres = 0\r\nfor i in l:\r\n if i<x:\r\n continue\r\n res+=i*(min(i,y)-x+1)\r\n x=i+1\r\n if x>y:\r\n break\r\nprint(res)", "l,r=map(int,input().split())\n\na=[]\ndef foo(n):\n\ta.append(n)\n\tif n>10*r:\n\t\treturn\n\tfoo(10*n+4)\n\tfoo(10*n+7)\n\treturn\n\nfoo(0)\na.sort()\n\ndef get_sum(m):\n\ts=0\n\tfor i in range(1,len(a)):\n\t\ts+=a[i]*(min(a[i],m)-min(a[i-1],m))\n\treturn s\n\nprint(get_sum(r)-get_sum(l-1))\n\n", "# 1) Find next(L)\r\n\r\n# 2) if next(L) >= R:\r\n# (next(L)) * (R-L+1)\r\n# break\r\n# if R > next(L):\r\n# get next(L) * (next(L) - L + 1)\r\n\r\n# 3) move L to next(L) + 1\r\n\r\n# END\r\n\r\n\r\ndef conv_to_bin(num):\r\n \"\"\"Convert a number to binary, with\r\n specified num of bits\"\"\"\r\n # Get the div every time until the number is 1\r\n bin_num = \"\"\r\n while num > 0:\r\n d, r = divmod(num, 2)\r\n num = d\r\n bin_num += str(r)\r\n\r\n # find a way to make the string length (bits)\r\n # fill the empty spots at the lefet with zero\r\n return bin_num[::-1]\r\n\r\n\r\ndef find_next(L):\r\n # bits = [0 for a in str(L)]\r\n \"\"\"Finds the next lucky number\"\"\"\r\n\r\n # check the number againt binary 1 to 2^n -1\r\n # # of bits = n\r\n # where n is the number of digits the number has\r\n n = len(str(L))\r\n for num in range(2**n):\r\n # compare each to L\r\n # and check if that number is greater than L\r\n bin_num = conv_to_bin(num).zfill(n)\r\n bin_num = ['4' if num == '0' else '7' for num in str(bin_num)]\r\n bin_num = int(\"\".join(bin_num))\r\n if bin_num >= L:\r\n return bin_num\r\n\r\n # if none of them are correct\r\n # then return 4 * num_digits + 1\r\n return int('4' * (n + 1))\r\n\r\n\r\ndef lucky(num):\r\n num_set = set(str(num))\r\n return (len(num_set) == 2 and \"7\" in num_set and \"4\" in num_set) or \\\r\n (len(num_set) == 1 and (\"7\" in num_set or \"4\" in num_set))\r\n\r\n\r\nL, R = [int(a) for a in input().strip().split()]\r\n\r\ntotal = 0\r\nwhile True:\r\n nxt = find_next(L)\r\n if nxt >= R:\r\n res = nxt * (R-L+1)\r\n total += res\r\n break\r\n else:\r\n res = nxt * (nxt-L+1)\r\n total += res\r\n L = nxt + 1\r\n\r\nprint(total)\r\n\r\n# for i in range(100):\r\n# print(f\"{i} ---> {find_next(i)}\")\r\n", "def 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\nimport math \r\n\r\nle,r=mi()\r\nl=[]\r\ndef F(x):\r\n l.append(x)\r\n if x>r*10:return\r\n F(10*x+4)\r\n F(10*x+7)\r\nF(0)\r\n \r\nl.sort() \r\n\r\ns=0\r\ni=le-1\r\nj=0\r\nwhile(i<r):\r\n if l[j]>i:\r\n s+=(min(l[j],r)-i)*l[j] \r\n i=l[j]\r\n j+=1\r\nprint(s)", "l = []\ns = set()\n\nfor i in range(1025):\n\tt = ['7' if i == '0' else '4' for i in bin(i)[2:]]\n\tt = int(''.join(t))\n\tif t not in s:\n\t\tl.append(t)\n\t\ts.add(t)\n\tt = ['4' if i == '0' else '7' for i in bin(i)[2:]]\n\tt = int(''.join(t))\n\tif t not in s:\n\t\tl.append(t)\n\t\ts.add(t)\nl.sort()\n\ni, j = map(int, input().split())\nans = 0\nfrom bisect import bisect_left\nk = i\nwhile k <= j:\n\tt = l[bisect_left(l, k)]\n\tans += (min(t, j) - k + 1) * t\n\tk = t + 1\n\nprint(ans)", "from bisect import bisect\r\ndef read(): return list(map(int, input().strip().split()))\r\narr = []\r\n\r\ndef f(z):\r\n a = z*10 + 4; \r\n b = z*10 + 7\r\n \r\n if z > 10**9:return\r\n \r\n arr.append(a)\r\n arr.append(b)\r\n f(a)\r\n f(b)\r\n\r\nf(0)\r\narr.sort()\r\n\r\nl, r = read()\r\nans = 0\r\nlind = bisect(arr, l-1)\r\n\r\nans += arr[lind]*(arr[lind] - l + 1)\r\nlast = arr[lind]\r\n\r\nwhile arr[lind]<r:\r\n ans += arr[lind+1]*(arr[lind+1]-last)\r\n last = arr[lind+1]\r\n lind += 1\r\n\r\nans -= arr[lind] * (arr[lind] - r)\r\nprint(ans)\r\n", "A=[\"0\",\"0\",\"4\",\"7\"]\r\ncnt=0\r\nfor i in range(4,1030):\r\n if cnt%2==0:\r\n A.append(A[i//2]+\"4\")\r\n else:\r\n A.append(A[i//2]+\"7\")\r\n cnt+=1\r\nA=[int(x) for x in A[::]]\r\nl,r=map(int,input().split())\r\nleft_index=1\r\nright_index=1\r\nwhile left_index<1030:\r\n if A[left_index]<l:\r\n left_index+=1\r\n else:\r\n break\r\nwhile right_index<1030:\r\n if A[right_index]<r:\r\n right_index+=1\r\n else:\r\n break\r\n# print(A)\r\n# print(left_index,right_index)\r\nif left_index==right_index:\r\n print((r-l+1)*A[left_index])\r\nelse:\r\n Sum=(A[left_index]-l+1)*A[left_index]\r\n left_index+=1\r\n while left_index!=right_index:\r\n Sum+=(A[left_index]-A[left_index-1])*A[left_index]\r\n left_index+=1\r\n Sum+=(r-A[right_index-1])*A[right_index]\r\n print(Sum)\r\n", "# creating all the lucky numbers\r\n\r\nluck_numbers=[4,7]\r\ni=1\r\n\r\nwhile(i<10):\r\n count=2**i\r\n temp=luck_numbers[-count:]\r\n\r\n for item in temp:\r\n luck_numbers.append(int(\"4\"+str(item)))\r\n\r\n for item in temp:\r\n luck_numbers.append(int(\"7\"+str(item)))\r\n\r\n i+=1\r\nluck_numbers.insert(0,0)\r\n\r\nl,r=map(int,input().split())\r\nstart=0\r\nfor i in range(len(luck_numbers)):\r\n if luck_numbers[i]>=l:\r\n start=i\r\n break\r\n\r\ni=l\r\nans=0\r\nwhile i<=r:\r\n next_luck=luck_numbers[start]\r\n diff=next_luck-i+1\r\n \r\n if next_luck>r:\r\n diff=r-i+1\r\n ans+=diff*next_luck\r\n i=luck_numbers[start]+1\r\n start+=1\r\n\r\nprint(ans)\r\n\r\n\r\n ", "li=set()\r\ndef addi(n):\r\n if n>10**10+1:\r\n return\r\n li.add(n)\r\n addi(n*10+4)\r\n addi(n*10+7)\r\naddi(4)\r\naddi(7)\r\nli=list(set(li))\r\nli.sort()\r\nl,r=map(int,input().split())\r\nans=0\r\nfor x in li:\r\n if x>=r:\r\n ans+=x*(r-l+1)\r\n break\r\n elif x>=l:\r\n ans+=x*(x-l+1)\r\n l=x+1\r\nprint(ans)", "MAX = 10 ** 10\r\n\r\ndef doit(cur):\r\n if cur > MAX:\r\n return\r\n if cur <= MAX:\r\n a.append(cur)\r\n doit(cur * 10 + 4)\r\n doit(cur * 10 + 7)\r\n\r\na = []\r\ndoit(0)\r\na.sort()\r\nret = 0\r\nleft, right = map(int, input().split())\r\nfor i in range(len(a) - 1):\r\n l = max(left, a[i] + 1)\r\n r = min(right, a[i + 1])\r\n ret += max(r - l + 1, 0) * a[i + 1]\r\nprint(ret)", "def next(n):\r\n st = str(n)\r\n lth = len(st)\r\n x = st.count('4')\r\n y = st.count('7')\r\n if x+y == lth:\r\n return n\r\n else:\r\n if n > int('7'*lth):\r\n lth += 1\r\n num = 0\r\n i = 0\r\n while(num < n):\r\n num = bin(i)[2:].zfill(lth)\r\n num = num.replace('0', '4')\r\n num = num.replace('1', '7')\r\n num = int(num)\r\n i += 1\r\n if((num < n) and (i > int('7'*lth))):\r\n i = 0\r\n lth += 1\r\n return num\r\n\r\n\r\nstart, end = map(int, input().split())\r\nsum = 0\r\ni = start\r\nwhile(i <= end):\r\n x = next(i)\r\n num = min(x, end)\r\n sum += ((num-i+1)*x)\r\n i = x+1\r\nprint(sum)\r\n", "import itertools\r\n\r\nl,r = map(int, input().split())\r\n\r\n\r\ndef generate_permutations(n:int) -> list:\r\n elements = \"47\"\r\n permutations = list(itertools.product(elements, repeat=n))\r\n return list(map(lambda x: int(\"\".join(x)), permutations))\r\n\r\n\r\nf = []\r\nfor i in range(1, 15):\r\n a = generate_permutations(i)\r\n for x in a:\r\n f.append(x)\r\nf = sorted(f)\r\nans = 0\r\nfirst_max = 0\r\nindex = 0\r\nfor x in range(len(f)):\r\n if f[x] >= l:\r\n first_max = f[x]\r\n index = x\r\n break\r\n\r\ndiff = first_max - l + 1\r\nans += (diff * first_max)\r\n\r\nwhile first_max < r:\r\n diff = f[index+1] - f[index]\r\n first_max = f[index+1]\r\n index += 1\r\n ans += (diff * first_max)\r\ndiff = r - first_max\r\nans += (diff * first_max)\r\n\r\nprint(ans)", "l, r = map(int, input().split())\n\nlucky_numbers = []\n\n\ndef generate_lucky_numbers(num: int) -> None:\n if num > r * 10:\n return\n # if num != 0:\n lucky_numbers.append(num)\n\n generate_lucky_numbers(10 * num + 4)\n generate_lucky_numbers(10 * num + 7)\n\n\ngenerate_lucky_numbers(0)\nlucky_numbers.sort()\n\n\ndef get_sum(num: int) -> int:\n _sum = 0\n for i in range(1, len(lucky_numbers)):\n _sum += lucky_numbers[i] * (min(lucky_numbers[i], num) - min(lucky_numbers[i - 1], num))\n return _sum\n\n\nprint(get_sum(r) - get_sum(l - 1))\n", "l,r=map(int,input().split())\r\nj=0\r\narr=[4,7]\r\noutput=0\r\nlmin=l-1\r\nwhile arr[j] < l :\r\n arr.append(arr[j]*10+4)\r\n arr.append(arr[j]*10+7)\r\n j+=1\r\n \r\nwhile arr[j] <= r :\r\n output=output+(arr[j]-lmin)*arr[j]\r\n arr.append(arr[j]*10+4)\r\n arr.append(arr[j]*10+7)\r\n lmin=arr[j]\r\n j+=1\r\noutput=output+(r-lmin)*arr[j]\r\nprint(output)", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n arr=[]\r\n def helper(curr):\r\n if curr!='':\r\n now=int(curr)\r\n arr.append(now)\r\n if now>=44444444444:\r\n return \r\n for i in ['4','7']:\r\n helper(curr+i)\r\n return\r\n helper('')\r\n #print(len(arr))\r\n arr.sort()\r\n #print(arr)\r\n l,r=[int(x) for x in input().split()]\r\n a=[]\r\n n=len(arr)\r\n \r\n arr=[0]+arr\r\n la=0\r\n lr=0\r\n #print(l)\r\n for i in range(1,n):\r\n if arr[i]<=r:\r\n la+=(arr[i]-arr[i-1])*arr[i]\r\n else:\r\n la+=(r-arr[i-1])*arr[i]\r\n break\r\n for i in range(1,n):\r\n if arr[i]<=l-1:\r\n lr+=(arr[i]-arr[i-1])*arr[i]\r\n else:\r\n lr+=(l-1-arr[i-1])*arr[i]\r\n break\r\n print(la-lr)\r\n ", "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\ndef lucky_generator(x):\n\tif x > 10**9:\n\t\tlucky_numbers.append(x)\n\t\treturn\n\tlucky_generator(x * 10 + 4)\n\tlucky_generator(x * 10 + 7)\n\tlucky_numbers.append(x)\n\ndef min_above(arr, target):\n\tleft, right = 1, len(arr)\n\tans = -1\n\twhile left <= right:\n\t\tmid = left + (right-left)//2\n\t\tif arr[mid] >= target:\n\t\t\tans = mid\n\t\t\tright = mid - 1\n\t\telse:\n\t\t\tleft = mid + 1\n\treturn ans\n\nl, r = int_map()\nlucky_numbers = []\ntotal = 0\nlucky_generator(0)\nlucky_numbers.sort()\nlast = min_above(lucky_numbers, l)\nfor i in range(l, r + 1):\n\tif i <= lucky_numbers[last]:\n\t\ttotal += lucky_numbers[last]\n\telse:\n\t\tlast += 1\n\t\ttotal += lucky_numbers[last]\nprint(total)", "l, r = map(int, input().split())\n\nlst = []\ndef rec(n):\n lst.append(n)\n if n > 10 *r:\n return\n \n rec(n*10+4)\n rec(n*10+7)\n return\n\nrec(0)\nlst.sort()\n\ns = 0\ns2 = 0\nfor i in range(len(lst)):\n s += lst[i] * (min(lst[i], r) - min(lst[i-1], r))\n s2 += lst[i] * (min(lst[i], l-1) - min(lst[i-1], l-1))\n\nprint(s-s2)", "nums = set()\r\ncur = \"\"\r\ndef gen():\r\n global cur\r\n if len(cur) > 10:\r\n return\r\n cur += \"4\"\r\n nums.add(cur)\r\n gen()\r\n cur = cur[:-1]\r\n cur += \"7\"\r\n nums.add(cur)\r\n gen()\r\n cur = cur[:-1]\r\ngen()\r\nnums = list(map(int, list(nums)))\r\nnums.sort()\r\ni = 0\r\nl, r = list(map(int, input().split()))\r\nwhile nums[i] < l:\r\n i += 1\r\nprev = l - 1\r\nans = 0\r\nwhile nums[i] < r:\r\n ans += (nums[i] - prev) * nums[i]\r\n prev = nums[i]\r\n i += 1\r\nprint(ans + (r - prev) * nums[i] )", "l,r=map(int,input().split())\r\na=[]\r\ndef F(x):\r\n\ta.append(x)\r\n\tif x>r*10:\r\n\t\treturn\r\n\tF(10*x+4)\r\n\tF(10*x+7)\r\nF(0)\r\na=sorted(a)\r\ndef G(x):\r\n\tz=0\r\n\tfor i in range(1,len(a)):\r\n\t\tz+=a[i]*(min(a[i],x)-min(a[i-1],x))\r\n\treturn z\r\nprint (G(r)-G(l-1))", "def Gen_lucky(n,s):\n if(len(s)==n):\n L.append(int(s))\n return\n Gen_lucky(n,s+\"4\")\n Gen_lucky(n,s+\"7\")\n return\n \n\n\n\n\nl,r=map(int,input().split())\n\nL=[]\nfor i in range(1,11):\n Gen_lucky(i,\"\")\nL.sort()\nind1=0\nfor i in range(len(L)):\n if(L[i]>=l):\n ind1=i\n break\nind2=0\nfor i in range(len(L)):\n if(L[i]>=r):\n ind2=i\n break\np=l\nx=0\nfor i in range(ind1,ind2+1):\n h=L[i]\n if(i==ind2):\n h=r\n x+=(h-p+1)*(L[i])\n p=L[i]+1\nprint(x)\n \n", "lucky_n = []\r\n\r\ns = 0\r\n\r\ndef add_4_7(s):\r\n s_4 = int(str(s) + '4')\r\n s_7 = int(str(s) + '7')\r\n if s_4 < 10000000000:\r\n lucky_n.append(s_4)\r\n add_4_7(s_4)\r\n if s_7 < 10000000000:\r\n lucky_n.append(s_7)\r\n add_4_7(s_7)\r\n\r\nadd_4_7(s)\r\nlucky_n.sort()\r\n\r\na, b = list(map(int, input().split()))\r\n\r\nprox = 0\r\nultimo = a\r\n\r\nfor i in range(len(lucky_n)):\r\n l = lucky_n[i]\r\n if l >= a:\r\n prox = i\r\n break\r\n\r\nprimeiro = lucky_n[prox]\r\nsoma = 0\r\n\r\nwhile True:\r\n if lucky_n[prox] <= b:\r\n soma += (lucky_n[prox] - ultimo) * lucky_n[prox]\r\n ultimo = lucky_n[prox]\r\n prox += 1\r\n else:\r\n soma += (b - ultimo) * lucky_n[prox]\r\n break\r\n\r\nprint(soma+primeiro)\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n_str = str\r\nstr = lambda x = b\"\": x if type(x) is bytes else _str(x).encode()\r\n\r\nBUFSIZE = 8192\r\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\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nmi = lambda: map(int, input().split())\r\nfi = lambda: map(float, input().split())\r\nsi = lambda: input().split()\r\nii = lambda: int(input())\r\nli = lambda: list(mi())\r\n\r\nret = ['4', '7', '44', '47', '74', '77', '444', '447', '474', '477', '744', '747', '774', '777', '4444', '4447', '4474', '4477', '4744', '4747', '4774', '4777', '7444', '7447', '7474', '7477', '7744', '7747', '7774', '7777', '44444', '44447', '44474', '44477', '44744', '44747', '44774', '44777', '47444', '47447', '47474', '47477', '47744', '47747', '47774', '47777', '74444', '74447', '74474', '74477', '74744', '74747', '74774', '74777', '77444', '77447', '77474', '77477', '77744', '77747', '77774', '77777', '444444', '444447', '444474', '444477', '444744', '444747', '444774', '444777', '447444', '447447', '447474', '447477', '447744', '447747', '447774', '447777', '474444', '474447', '474474', '474477', '474744', '474747', '474774', '474777', '477444', '477447', '477474', '477477', '477744', '477747', '477774', '477777', '744444', '744447', '744474', '744477', '744744', '744747', '744774', '744777', '747444', '747447', '747474', '747477', '747744', '747747', '747774', '747777', '774444', '774447', '774474', '774477', '774744', '774747', '774774', '774777', '777444', '777447', '777474', '777477', '777744', '777747', '777774', '777777', '4444444', '4444447', '4444474', '4444477', '4444744', '4444747', '4444774', '4444777', '4447444', '4447447', '4447474', '4447477', '4447744', '4447747', '4447774', '4447777', '4474444', '4474447', '4474474', '4474477', '4474744', '4474747', '4474774', '4474777', '4477444', '4477447', '4477474', '4477477', '4477744', '4477747', '4477774', '4477777', '4744444', '4744447', '4744474', '4744477', '4744744', '4744747', '4744774', '4744777', '4747444', '4747447', '4747474', '4747477', '4747744', '4747747', '4747774', '4747777', '4774444', '4774447', '4774474', '4774477', '4774744', '4774747', '4774774', '4774777', '4777444', '4777447', '4777474', '4777477', '4777744', '4777747', '4777774', '4777777', '7444444', '7444447', '7444474', '7444477', '7444744', '7444747', '7444774', '7444777', '7447444', '7447447', '7447474', '7447477', '7447744', '7447747', '7447774', '7447777', '7474444', '7474447', '7474474', '7474477', '7474744', '7474747', '7474774', '7474777', '7477444', '7477447', '7477474', '7477477', '7477744', '7477747', '7477774', '7477777', '7744444', '7744447', '7744474', '7744477', '7744744', '7744747', '7744774', '7744777', '7747444', '7747447', '7747474', '7747477', '7747744', '7747747', '7747774', '7747777', '7774444', '7774447', '7774474', '7774477', '7774744', '7774747', '7774774', '7774777', '7777444', '7777447', '7777474', '7777477', '7777744', '7777747', '7777774', '7777777', '44444444', '44444447', '44444474', '44444477', '44444744', '44444747', '44444774', '44444777', '44447444', '44447447', '44447474', '44447477', '44447744', '44447747', '44447774', '44447777', '44474444', '44474447', '44474474', '44474477', '44474744', '44474747', '44474774', '44474777', '44477444', '44477447', '44477474', '44477477', '44477744', '44477747', '44477774', '44477777', '44744444', '44744447', '44744474', '44744477', '44744744', '44744747', '44744774', '44744777', '44747444', '44747447', '44747474', '44747477', '44747744', '44747747', '44747774', '44747777', '44774444', '44774447', '44774474', '44774477', '44774744', '44774747', '44774774', '44774777', '44777444', '44777447', '44777474', '44777477', '44777744', '44777747', '44777774', '44777777', '47444444', '47444447', '47444474', '47444477', '47444744', '47444747', '47444774', '47444777', '47447444', '47447447', '47447474', '47447477', '47447744', '47447747', '47447774', '47447777', '47474444', '47474447', '47474474', '47474477', '47474744', '47474747', '47474774', '47474777', '47477444', '47477447', '47477474', '47477477', '47477744', '47477747', '47477774', '47477777', '47744444', '47744447', '47744474', '47744477', '47744744', '47744747', '47744774', '47744777', '47747444', '47747447', '47747474', '47747477', '47747744', '47747747', '47747774', '47747777', '47774444', '47774447', '47774474', '47774477', '47774744', '47774747', '47774774', '47774777', '47777444', '47777447', '47777474', '47777477', '47777744', '47777747', '47777774', '47777777', '74444444', '74444447', '74444474', '74444477', '74444744', '74444747', '74444774', '74444777', '74447444', '74447447', '74447474', '74447477', '74447744', '74447747', '74447774', '74447777', '74474444', '74474447', '74474474', '74474477', '74474744', '74474747', '74474774', '74474777', '74477444', '74477447', '74477474', '74477477', '74477744', '74477747', '74477774', '74477777', '74744444', '74744447', '74744474', '74744477', '74744744', '74744747', '74744774', '74744777', '74747444', '74747447', '74747474', '74747477', '74747744', '74747747', '74747774', '74747777', '74774444', '74774447', '74774474', '74774477', '74774744', '74774747', '74774774', '74774777', '74777444', '74777447', '74777474', '74777477', '74777744', '74777747', '74777774', '74777777', '77444444', '77444447', '77444474', '77444477', '77444744', '77444747', '77444774', '77444777', '77447444', '77447447', '77447474', '77447477', '77447744', '77447747', '77447774', '77447777', '77474444', '77474447', '77474474', '77474477', '77474744', '77474747', '77474774', '77474777', '77477444', '77477447', '77477474', '77477477', '77477744', '77477747', '77477774', '77477777', '77744444', '77744447', '77744474', '77744477', '77744744', '77744747', '77744774', '77744777', '77747444', '77747447', '77747474', '77747477', '77747744', '77747747', '77747774', '77747777', '77774444', '77774447', '77774474', '77774477', '77774744', '77774747', '77774774', '77774777', '77777444', '77777447', '77777474', '77777477', '77777744', '77777747', '77777774', '77777777', '444444444', '444444447', '444444474', '444444477', '444444744', '444444747', '444444774', '444444777', '444447444', '444447447', '444447474', '444447477', '444447744', '444447747', '444447774', '444447777', '444474444', '444474447', '444474474', '444474477', '444474744', '444474747', '444474774', '444474777', '444477444', '444477447', '444477474', '444477477', '444477744', '444477747', '444477774', '444477777', '444744444', '444744447', '444744474', '444744477', '444744744', '444744747', '444744774', '444744777', '444747444', '444747447', '444747474', '444747477', '444747744', '444747747', '444747774', '444747777', '444774444', '444774447', '444774474', '444774477', '444774744', '444774747', '444774774', '444774777', '444777444', '444777447', '444777474', '444777477', '444777744', '444777747', '444777774', '444777777', '447444444', '447444447', '447444474', '447444477', '447444744', '447444747', '447444774', '447444777', '447447444', '447447447', '447447474', '447447477', '447447744', '447447747', '447447774', '447447777', '447474444', '447474447', '447474474', '447474477', '447474744', '447474747', '447474774', '447474777', '447477444', '447477447', '447477474', '447477477', '447477744', '447477747', '447477774', '447477777', '447744444', '447744447', '447744474', '447744477', '447744744', '447744747', '447744774', '447744777', '447747444', '447747447', '447747474', '447747477', '447747744', '447747747', '447747774', '447747777', '447774444', '447774447', '447774474', '447774477', '447774744', '447774747', '447774774', '447774777', '447777444', '447777447', '447777474', '447777477', '447777744', '447777747', '447777774', '447777777', '474444444', '474444447', '474444474', '474444477', '474444744', '474444747', '474444774', '474444777', '474447444', '474447447', '474447474', '474447477', '474447744', '474447747', '474447774', '474447777', '474474444', '474474447', '474474474', '474474477', '474474744', '474474747', '474474774', '474474777', '474477444', '474477447', '474477474', '474477477', '474477744', '474477747', '474477774', '474477777', '474744444', '474744447', '474744474', '474744477', '474744744', '474744747', '474744774', '474744777', '474747444', '474747447', '474747474', '474747477', '474747744', '474747747', '474747774', '474747777', '474774444', '474774447', '474774474', '474774477', '474774744', '474774747', '474774774', '474774777', '474777444', '474777447', '474777474', '474777477', '474777744', '474777747', '474777774', '474777777', '477444444', '477444447', '477444474', '477444477', '477444744', '477444747', '477444774', '477444777', '477447444', '477447447', '477447474', '477447477', '477447744', '477447747', '477447774', '477447777', '477474444', '477474447', '477474474', '477474477', '477474744', '477474747', '477474774', '477474777', '477477444', '477477447', '477477474', '477477477', '477477744', '477477747', '477477774', '477477777', '477744444', '477744447', '477744474', '477744477', '477744744', '477744747', '477744774', '477744777', '477747444', '477747447', '477747474', '477747477', '477747744', '477747747', '477747774', '477747777', '477774444', '477774447', '477774474', '477774477', '477774744', '477774747', '477774774', '477774777', '477777444', '477777447', '477777474', '477777477', '477777744', '477777747', '477777774', '477777777', '744444444', '744444447', '744444474', '744444477', '744444744', '744444747', '744444774', '744444777', '744447444', '744447447', '744447474', '744447477', '744447744', '744447747', '744447774', '744447777', '744474444', '744474447', '744474474', '744474477', '744474744', '744474747', '744474774', '744474777', '744477444', '744477447', '744477474', '744477477', '744477744', '744477747', '744477774', '744477777', '744744444', '744744447', '744744474', '744744477', '744744744', '744744747', '744744774', '744744777', '744747444', '744747447', '744747474', '744747477', '744747744', '744747747', '744747774', '744747777', '744774444', '744774447', '744774474', '744774477', '744774744', '744774747', '744774774', '744774777', '744777444', '744777447', '744777474', '744777477', '744777744', '744777747', '744777774', '744777777', '747444444', '747444447', '747444474', '747444477', '747444744', '747444747', '747444774', '747444777', '747447444', '747447447', '747447474', '747447477', '747447744', '747447747', '747447774', '747447777', '747474444', '747474447', '747474474', '747474477', '747474744', '747474747', '747474774', '747474777', '747477444', '747477447', '747477474', '747477477', '747477744', '747477747', '747477774', '747477777', '747744444', '747744447', '747744474', '747744477', '747744744', '747744747', '747744774', '747744777', '747747444', '747747447', '747747474', '747747477', '747747744', '747747747', '747747774', '747747777', '747774444', '747774447', '747774474', '747774477', '747774744', '747774747', '747774774', '747774777', '747777444', '747777447', '747777474', '747777477', '747777744', '747777747', '747777774', '747777777', '774444444', '774444447', '774444474', '774444477', '774444744', '774444747', '774444774', '774444777', '774447444', '774447447', '774447474', '774447477', '774447744', '774447747', '774447774', '774447777', '774474444', '774474447', '774474474', '774474477', '774474744', '774474747', '774474774', '774474777', '774477444', '774477447', '774477474', '774477477', '774477744', '774477747', '774477774', '774477777', '774744444', '774744447', '774744474', '774744477', '774744744', '774744747', '774744774', '774744777', '774747444', '774747447', '774747474', '774747477', '774747744', '774747747', '774747774', '774747777', '774774444', '774774447', '774774474', '774774477', '774774744', '774774747', '774774774', '774774777', '774777444', '774777447', '774777474', '774777477', '774777744', '774777747', '774777774', '774777777', '777444444', '777444447', '777444474', '777444477', '777444744', '777444747', '777444774', '777444777', '777447444', '777447447', '777447474', '777447477', '777447744', '777447747', '777447774', '777447777', '777474444', '777474447', '777474474', '777474477', '777474744', '777474747', '777474774', '777474777', '777477444', '777477447', '777477474', '777477477', '777477744', '777477747', '777477774', '777477777', '777744444', '777744447', '777744474', '777744477', '777744744', '777744747', '777744774', '777744777', '777747444', '777747447', '777747474', '777747477', '777747744', '777747747', '777747774', '777747777', '777774444', '777774447', '777774474', '777774477', '777774744', '777774747', '777774774', '777774777', '777777444', '777777447', '777777474', '777777477', '777777744', '777777747', '777777774', '777777777', '4444444444']\r\ndef cal(lp):\r\n back = 0\r\n f = 0\r\n if lp == 0: return 0\r\n for x in range(len(ret)):\r\n if int(ret[x]) > lp: \r\n f += (lp - back) * int(ret[x])\r\n break\r\n f += (int(ret[x]) - back) * int(ret[x])\r\n back = int(ret[x])\r\n return f\r\n\r\nl, r = mi()\r\nprint(cal(r) - cal(l - 1))", "def miis():\r\n return map(int, input().split())\r\ndef get(n):\r\n new = ''\r\n if n == 2:\r\n return 4\r\n while n>=2:\r\n if n%2:\r\n new += '7'\r\n else:\r\n new += '4'\r\n n //= 2\r\n return int(new[::-1])\r\n\r\nans = 0\r\nl, r = miis()\r\nc = 2\r\nwhile get(c)<l:\r\n c += 1\r\nold = get(c)\r\nwhile l <= r:\r\n ans += (min(r, old)-l+1)*old\r\n c += 1\r\n l = old+1\r\n old = get(c)\r\nprint(ans)\r\n", "a = []\r\n\r\ndef rec(ch):\r\n if ch > 10 ** 10:\r\n return\r\n if ch > 0:\r\n a.append(ch)\r\n ch *= 10\r\n ch += 4\r\n rec(ch)\r\n ch += 3\r\n rec(ch)\r\n ch //= 10\r\n\r\n\r\nl, r = map(int, input().split())\r\nrec(0)\r\na.sort()\r\npr = 0\r\nans = 0\r\nfor i in range(len(a)):\r\n t1 = max(pr + 1, l)\r\n t2 = min(a[i], r)\r\n #print(t1, t2)\r\n pr = a[i]\r\n if t1 > t2:\r\n continue\r\n ans += (t2 - t1 + 1) * a[i]\r\nprint(ans)\r\n", "import sys\r\nfrom math import log2,floor,ceil,sqrt\r\n# import bisect\r\nfrom 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\narr = deque()\r\narr.append(4)\r\narr.append(7)\r\nans = []\r\nfor i in range(10000):\r\n val = arr.popleft()\r\n ans.append(val)\r\n arr.append(val*10+4)\r\n arr.append(val*10+7)\r\nans.sort()\r\nl,r = Ri()\r\ntans = 0\r\nfor i in ans:\r\n if i >= l:\r\n if i < r:\r\n tans += (i-l+1)*i\r\n l = i+1\r\n else:\r\n tans += (r-l+1)*i\r\n flag = True\r\n break\r\nprint(tans)\r\n# print(ans)\r\n", "def generate_lucky_numbers():\n lucky_digits = ['4', '7']\n lucky_numbers = []\n curr_appenders = [4, 7]\n for _ in range(10):\n lucky_numbers.extend(curr_appenders)\n curr_appenders = [int(ld + str(ca)) for ld in lucky_digits for ca in curr_appenders]\n return lucky_numbers\n\ndef get_next_lucky_number_index(lucky_numbers, query):\n index = 0\n while lucky_numbers[index] < query:\n index += 1\n return index\n\ndef solve(l, r):\n lucky_numbers = generate_lucky_numbers()\n lucky_pointer = get_next_lucky_number_index(lucky_numbers, l)\n if get_next_lucky_number_index(lucky_numbers, r) == lucky_pointer:\n return lucky_numbers[lucky_pointer] * (r - l + 1)\n else:\n lucky_pointer = get_next_lucky_number_index(lucky_numbers, l)\n lucky_sum = lucky_numbers[lucky_pointer] * (lucky_numbers[lucky_pointer] - l + 1)\n lucky_pointer += 1\n while lucky_numbers[lucky_pointer] < r:\n lucky_sum += lucky_numbers[lucky_pointer] * (min(lucky_numbers[lucky_pointer], r) - lucky_numbers[lucky_pointer - 1])\n lucky_pointer += 1\n \n lucky_sum += lucky_numbers[lucky_pointer] * (r - lucky_numbers[lucky_pointer - 1])\n \n return lucky_sum\n\nl, r = map(int, input().split())\nprint(solve(l, r))\n\t\t\t \t\t \t \t\t \t\t \t\t\t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\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 Lucky_Sum3():\r\n l,r = invr()\r\n\r\n luckyNum = [4,7]\r\n if (luckyNum[0] - l) >= 0 :\r\n startLuckyNum = luckyNum[0]\r\n elif (luckyNum[1] - l) >= 0:\r\n startLuckyNum = luckyNum[1]\r\n else:\r\n startLuckyNum = -1 \r\n\r\n index = 0\r\n while (luckyNum[index] - r) < 0:\r\n num1 = (luckyNum[index]*10)+4\r\n num2 = (luckyNum[index]*10)+7\r\n\r\n if (num1 - l) >= 0 and startLuckyNum == -1:\r\n startLuckyNum = num1 \r\n elif (num2 - l) >= 0 and startLuckyNum == -1:\r\n startLuckyNum = num2\r\n\r\n luckyNum.append(num1)\r\n luckyNum.append(num2)\r\n index += 1\r\n\r\n startIndex = luckyNum.index(startLuckyNum)\r\n movingIndex = startIndex\r\n\r\n found_next_r = False\r\n found_next_l = False\r\n sum = 0 \r\n # print(luckyNum, startIndex,startLuckyNum)\r\n\r\n while not found_next_r:\r\n num = luckyNum[movingIndex] \r\n if (num -r) >= 0 and not found_next_l:\r\n numTimesRepeated = r - l + 1\r\n found_next_r = True\r\n\r\n elif num == startLuckyNum:\r\n numTimesRepeated = num - l + 1\r\n found_next_l = True\r\n\r\n elif (num-r) >= 0:\r\n found_next_r = True\r\n prevNum = luckyNum[movingIndex-1] \r\n numTimesRepeated = r - prevNum\r\n else:\r\n prevNum = luckyNum[movingIndex-1]\r\n numTimesRepeated = num - prevNum\r\n \r\n sum += (num*numTimesRepeated)\r\n # print(num,numTimesRepeated)\r\n movingIndex += 1\r\n \r\n print(sum)\r\n return \r\n \r\nLucky_Sum3() ", "lucky=[]\nMAX=10000000000\ndef func(s):\n\ts=s*10\n\tif s>MAX:\n\t\treturn\n\tlucky.append(s+4)\n\tlucky.append(s+7)\n\tfunc(s+4)\n\tfunc(s+7)\n\nfunc(0)\nlucky.sort()\n\nl,r=[int(x) for x in input().split(' ')]\n\ni=0\nj=0\nwhile(l>lucky[i]):\n\ti+=1\nwhile(r>lucky[j]):\n\tj+=1\nans=0\nfor x in range(i+1,j+1):\n\tans+=(lucky[x]-lucky[x-1])*lucky[x]\nans-=(lucky[j]-r)*lucky[j]\nans+=(lucky[i]-l+1)*lucky[i]\nprint(ans)", "def generate_helper(number, length, lucky_numbers):\r\n if len(number) == length:\r\n lucky_numbers.append(int(number))\r\n return\r\n generate_helper(number + \"4\", length, lucky_numbers)\r\n generate_helper(number + \"7\", length, lucky_numbers)\r\n\r\ndef generate_lucky_numbers(length):\r\n lucky_numbers = []\r\n generate_helper(\"\", length, lucky_numbers)\r\n return lucky_numbers\r\n\r\nif __name__ == \"__main__\":\r\n all_lucky_numbers = []\r\n lucky = []\r\n for length in range(1, 11):\r\n lucky_numbers = generate_lucky_numbers(length)\r\n all_lucky_numbers.append(lucky_numbers)\r\n for num in lucky_numbers:\r\n lucky.append(num)\r\n\r\n l, r = map(int, input().split())\r\n sum_val = 0\r\n x = 0\r\n flag = 0\r\n stop = 0\r\n for i in range(len(lucky)):\r\n if lucky[i] >= l and lucky[i] <= r and flag == 0:\r\n x = (lucky[i] - l + 1) * lucky[i] # 3*4\r\n sum_val += x\r\n flag = 1\r\n stop = lucky[i]\r\n elif lucky[i] <= r and flag == 1:\r\n x = (lucky[i] - lucky[i - 1]) * lucky[i] # 3*7\r\n sum_val += x\r\n stop = lucky[i]\r\n\r\n if r == l:\r\n for i in lucky:\r\n if i >= r:\r\n sum_val=i\r\n break\r\n elif sum_val ==0:\r\n for i in lucky:\r\n if i > r:\r\n x = (r-l+1)*i\r\n sum_val = x\r\n break\r\n else:\r\n if r not in lucky:\r\n for i in lucky:\r\n if i > stop:\r\n x = (r - stop) * i\r\n sum_val += x\r\n break\r\n\r\n print(sum_val)\r\n", "import math\r\n\r\ndef binpoisk(a, x):\r\n l, r = -1, len(a)\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if a[m] >= x:\r\n r = m\r\n else:\r\n l = m\r\n\r\n return r\r\n\r\n\r\ndef main():\r\n l, r = list(map(int, input().split()))\r\n lucky_nums = ['4', '7']\r\n for i in range(1, 10):\r\n to_add = []\r\n for j in range(len(lucky_nums) - pow(2, i), len(lucky_nums), 1):\r\n to_add.append(lucky_nums[j] + '4')\r\n to_add.append(lucky_nums[j] + '7')\r\n for j in to_add:\r\n lucky_nums.append(j)\r\n\r\n lucky_nums = [int(i) for i in lucky_nums]\r\n index1, index2 = binpoisk(lucky_nums, l), binpoisk(lucky_nums, r)\r\n ans = 0\r\n prev = l-1\r\n for i in range(index1, index2 + 1, 1):\r\n if lucky_nums[i] <= r:\r\n ans += (lucky_nums[i] - prev)*lucky_nums[i]\r\n else:\r\n ans += (r - prev) * lucky_nums[i]\r\n prev = lucky_nums[i]\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "lucky=[]\r\nMAX=10000000000\r\ndef func(s):\r\n\ts=s*10\r\n\tif s>MAX:\r\n\t\treturn\r\n\tlucky.append(s+4)\r\n\tlucky.append(s+7)\r\n\tfunc(s+4)\r\n\tfunc(s+7)\r\n\r\nfunc(0)\r\nlucky.sort()\r\n\r\nl,r=[int(x) for x in input().split(' ')]\r\n\r\ni=0\r\nj=0\r\nwhile(l>lucky[i]):\r\n\ti+=1\r\nwhile(r>lucky[j]):\r\n\tj+=1\r\nans=0\r\nfor x in range(i+1,j+1):\r\n\tans+=(lucky[x]-lucky[x-1])*lucky[x]\r\nans-=(lucky[j]-r)*lucky[j]\r\nans+=(lucky[i]-l+1)*lucky[i]\r\nprint(ans)", "lucky_n = []\n\ns = 0\n\ndef add_4_7(s):\n s_4 = int(str(s) + '4')\n s_7 = int(str(s) + '7')\n if s_4 < 10000000000:\n lucky_n.append(s_4)\n add_4_7(s_4)\n if s_7 < 10000000000:\n lucky_n.append(s_7)\n add_4_7(s_7)\n\nadd_4_7(s)\nlucky_n.sort()\n\na, b = list(map(int, input().split()))\n\nprox = 0\nultimo = a\n\nfor i in range(len(lucky_n)):\n l = lucky_n[i]\n if l >= a:\n prox = i\n break\n\nprimeiro = lucky_n[prox]\nsoma = 0\n\nwhile True:\n if lucky_n[prox] <= b:\n soma += (lucky_n[prox] - ultimo) * lucky_n[prox]\n ultimo = lucky_n[prox]\n prox += 1\n else:\n soma += (b - ultimo) * lucky_n[prox]\n break\n\nprint(soma+primeiro)\n\n \t\t\t \t\t\t\t \t \t \t \t \t \t\t\t \t\t\t" ]

[ "import sys\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\r\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\r\ndef LI2(): return list(map(int,sys.stdin.readline().rstrip()))\r\ndef S(): return sys.stdin.readline().rstrip()\r\ndef LS(): return list(sys.stdin.readline().rstrip().split())\r\ndef LS2(): return list(sys.stdin.readline().rstrip())\r\n\r\n\r\nN = I()\r\nA = LI()\r\nmod = 10**9+7\r\n\r\nm = 20\r\nM = 1 << m\r\nF = [0]*M\r\nfor a in A:\r\n F[a] += 1\r\n\r\n\r\ndef zeta_transform(F,n):\r\n # res[i] = (iを含む集合jに対する F[j] の和)\r\n N = 1 << n\r\n res = F[:]\r\n for i in range(n):\r\n k = 1 << i\r\n for j in range(N):\r\n if not j & k:\r\n res[j] += res[j^k]\r\n return res\r\n\r\n\r\nG = zeta_transform(F,m)\r\npower = [1]\r\nfor _ in range(N):\r\n power.append((power[-1]*2) % mod)\r\n\r\n\r\ndef bit_count(n):\r\n c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)\r\n c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)\r\n c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)\r\n c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)\r\n c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)\r\n c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)\r\n return c\r\n\r\n\r\nans = 0\r\nfor i in range(M):\r\n bc = bit_count(i)\r\n a = power[G[i]]\r\n if bc % 2 == 0:\r\n ans += a\r\n else:\r\n ans -= a\r\n ans %= mod\r\n\r\nprint(ans)\r\n", "# for I/O for local system\r\nimport sys\r\nfrom os import path\r\nif(path.exists('Input.txt')):\r\n sys.stdin = open(\"Input.txt\",\"r\")\r\n sys.stdout = open(\"Output.txt\",\"w\")\r\n\r\n# For fast I/O\r\ninput = sys.stdin.buffer.readline\r\n# input = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\n# Import libraries here whenever required\r\nfrom random import randint\r\n\r\n# Use this because normal dict can sometimes give TLE\r\nclass mydict:\r\n def __init__(self, func=lambda: 0):\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 get(self, key, default):\r\n mykey = self.random ^ key\r\n if mykey not in self.dict:\r\n return 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 def __str__(self):\r\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\r\n \r\nM = 1000000007 \r\ndef binpow(a, n):\r\n ans = 1\r\n while n > 0:\r\n if(n & 1):\r\n ans *= a\r\n ans %= M\r\n a *= a\r\n a %= M\r\n n >>= 1\r\n return ans \r\n \r\n# Solver function\r\ndef solve():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n maxN = 20\r\n dp = [0 for i in range((1 << maxN) + 1)]\r\n for i in a:\r\n dp[i] += 1\r\n # forward pass\r\n for bit in range(maxN + 1):\r\n for mask in range((1 << maxN) + 1):\r\n if(mask & (1 << bit)):\r\n dp[mask ^ (1 << bit)] += dp[mask]\r\n dp[mask ^ (1 << bit)] %= M\r\n # taking all supersets into account\r\n for i in range((1 << maxN) + 1):\r\n val = binpow(2, dp[i]) - 1\r\n dp[i] = val\r\n # backword pass\r\n for bit in range(maxN + 1):\r\n for mask in range((1 << maxN) + 1):\r\n if(mask & (1 << bit)):\r\n dp[mask ^ (1 << bit)] -= dp[mask]\r\n dp[mask ^ (1 << bit)] %= M\r\n print(str(dp[0] % M) + \"\\n\")\r\n \r\n# Main \r\nfor _ in range(1):\r\n solve()", "import sys\r\n#!/usr/bin/env python3\r\n\r\nmod=1000000007;\r\n\r\ncnt=[0]*(1<<21)\r\np2=[0]*(1<<21)\r\n\r\n\r\nn=int(sys.stdin.readline())\t\r\na=[int(x) for x in sys.stdin.readline().split()]\r\n\r\nfor i in a:\r\n\tcnt[i]+=1\r\n\r\nfor i in range(20):\r\n\tfor j in range(1<<20):\r\n\t\tif (j&(1<<i))==0:\r\n\t\t\tcnt[j]+=cnt[j|(1<<i)]\r\n\r\nans=0\r\np2[0]=1\r\nfor i in range(1,1<<20):\r\n\tp2[i]=(p2[i-1]*2)%mod\r\n\r\nfor i in range(1<<20):\r\n\tif bin(i).count(\"1\")&1:\r\n\t\tans=(ans-p2[cnt[i]]+mod)%mod\r\n\telse:\r\n\t\tans=(ans+p2[cnt[i]]+mod)%mod\r\n\r\n\r\nsys.stdout.write(str(ans))\r\nsys.stdout.write('\\n')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nmod = 10**9+7\r\nb = [0 for i in range(1<<20)]\r\nfor i in range(n):\r\n b[a[i]] += 1\r\nfor i in range(20):\r\n for j in range(1<<20):\r\n if j&1<<i == 0:\r\n b[j] += b[j|1<<i]\r\nans = 0\r\nfor i in range(1<<20):\r\n cnt = str(bin(i)).count(\"1\")\r\n if cnt%2 == 0:\r\n ans += pow(2,b[i],mod)-1\r\n else:\r\n ans -= pow(2,b[i],mod)-1\r\n ans %= mod\r\nprint(ans)", "import sys\ninput = sys.stdin.readline\nMOD = int(1e9+7)\nn = int(input())\na = list(map(int, input().split()))\nMAXBITS = 20\nMAXM = 1<<MAXBITS\ncnt = [0] * MAXM\npow2 = [0] * MAXM\nfor x in a:\n cnt[x] += 1\nfor i in range(MAXBITS):\n for j in range(MAXM):\n if (j & (1<<i)) == 0:\n cnt[j] += cnt[j+(1<<i)]\npow2[0]=1\nfor i in range(1,MAXM):\n pow2[i] = pow2[i-1]*2%MOD\nans = 0\nfor i in range(MAXM):\n flag = -1 if bin(i).count(\"1\") % 2 == 1 else 1\n # print(i, flag, cnt[i], flag*pow2[cnt[i]])\n ans = (ans + flag*pow2[cnt[i]])%MOD\nprint(ans)\n\n", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip()\r\n\r\n\r\nsys.setrecursionlimit(2*10**5+10)\r\nwrite = lambda x: sys.stdout.write(x+\"\\n\")\r\ndebug = lambda x: sys.stderr.write(x+\"\\n\")\r\nwritef = lambda x: print(\"{:.12f}\".format(x))\r\n\r\n\r\n# zeta mebius\r\ndef zeta_super(val, n):\r\n # len(val)==2^n\r\n out = val[:]\r\n for i in range(n):\r\n for j in range(1<<n):\r\n if not j>>i&1:\r\n out[j] += out[j^(1<<i)]\r\n return out\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a).bit_length()\r\nM = 10**9+7\r\nv = [0]*(1<<m)\r\nfor item in a:\r\n v[item] += 1\r\nv2 = [1]\r\nfor i in range(n+1):\r\n v2.append(v2[-1]*2%M)\r\nnv = zeta_super(v, m)\r\nans = 0\r\nfor b in range(1<<m):\r\n ans += (v2[nv[b]]-1)*pow(-1, bin(b).count(\"1\"))\r\n ans %= M\r\nprint(ans%M)" ]

[ "s1=input()\r\ns2=input()\r\ns3=input()\r\n\r\ns1sort = sorted(s1)\r\ns2sort = sorted(s2)\r\ns3sort = sorted(s3)\r\n\r\n# print(s1sort)\r\n\r\ns4 = s1sort+s2sort\r\ns4sort=sorted(s4)\r\n# print(s3sort)\r\n# print(s4)\r\n# print(s4)\r\nans=1\r\n\r\nif len(s3)!=len(s4):\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n for i in range(0,len(s4)):\r\n if s3sort[i]==s4sort[i]:\r\n continue\r\n else:\r\n ans=-1\r\n break\r\n\r\nif ans==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\nstr1 = list(s1)\r\ns2 = input()\r\nstr2= list(s2)\r\nif all(char.isupper() for char in str1):\r\n str1.sort()\r\n sort1 = \"\".join(str1)\r\nif all(char.isupper() for char in str2):\r\n str2.sort()\r\n sort2 = \"\".join(str2)\r\ns3=input()\r\nstr3 = list(s3)\r\nif all(char.isupper() for char in str3):\r\n str3.sort()\r\n sort3 = \"\".join(str3)\r\ns4 =(str1 + str2)\r\ns4.sort()\r\nsort4 = \"\".join(s4)\r\nif sort3 == sort4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "a=input()\r\nb=input()\r\nc=sorted(input())\r\nd= a+b\r\nif sorted(d) ==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\ninput1 = str(input())\r\ninput2 = str(input())\r\ninput3 = str(input())\r\n\r\nmainStr = sorted(input1+input2.upper())\r\n\r\ncountMain = Counter(mainStr)\r\n\r\ntestCase = sorted(input3)\r\n\r\ncountTest = Counter(testCase)\r\n\r\nif countMain == countTest:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"141A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\ng= input()\nh= input()\npile= input()\ncn = g+h\nsort_cn = sorted(cn)\nsort_pile = sorted(pile)\nif sort_cn== sort_pile:\n print(\"YES\")\nelse:\n print(\"NO\")", "s1=str(input())\ns2=str(input())\ns3=str(input())\ns1=sorted(s1)\ns2=sorted(s2)\ns3=sorted(s3)\ns4=sorted(s1+s2)\nif s3==s4:\n print('YES')\nelse:\n print('NO')", "a = input()\r\nb = input()\r\ns = input()\r\ns = sorted(s)\r\nx = a+b\r\nx = sorted(x)\r\np = \"\"\r\nfor i in range(len(x)):\r\n p+=x[i]\r\nres = \"\"\r\nfor _ in range(len(s)):\r\n res+=s[_]\r\n\r\nif res == p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = str(input())\nb = str(input())\nc = str(input())\nd = sorted(a + b)\nc = sorted(c)\nif d == c:\n print('YES')\nelse:\n print('NO')\n# Sat Jul 08 2023 10:30:45 GMT+0300 (Moscow Standard Time)\n", "a1=input()\na=[]\nfor i in range(len(a1)):\n a.append(a1[i])\nb1=input()\nb=[]\nfor i in range(len(b1)):\n b.append(b1[i])\nc1=input()\nc=[]\nfor i in range(len(c1)):\n c.append(c1[i])\nok='YES'\nfor i in range(len(a)): \n if a[i] not in c:\n ok='NO'\n else:\n c.pop(c.index(a[i]))\nfor i in range(len(b)): \n if b[i] not in c:\n ok='NO'\n else:\n c.pop(c.index(b[i]))\nif len(c)!=0:\n ok='NO'\nprint(ok) \n \n# Sat Jul 08 2023 11:37:39 GMT+0300 (Moscow Standard Time)\n", "g = input()\r\nh = input()\r\nw = input()\r\nif len(g) + len(h) == len(w):\r\n empty = []\r\n for i in w:\r\n empty.append(i)\r\n flag_1 = True \r\n flag_2 = True\r\n for i in g:\r\n if i in empty:\r\n empty.remove(i)\r\n else:\r\n flag_1 = False\r\n for i in h:\r\n if i in empty:\r\n empty.remove(i)\r\n else:\r\n flag_2 = False\r\n\r\n if flag_1 and flag_2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\") \r\n \r\n", "\r\nlst = []\r\nfor i in range(3):\r\n n = str(input())\r\n lst.append(n)\r\n\r\ndef f(lst):\r\n if len(lst[2]) != (len(lst[1]) + len(lst[0])):\r\n return \"NO\"\r\n else:\r\n l1 = []\r\n l2 = []\r\n a = lst[0] + lst[1]\r\n b = lst[2]\r\n for i in a:\r\n l1.append(i)\r\n for j in b:\r\n l2.append(j)\r\n l1.sort()\r\n l2.sort()\r\n for k in range(len(l1)):\r\n if l1[k] == l2[k]:\r\n pass\r\n else:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nprint(f(lst))", "s = list(input()) + list(input()) \ns2 =list(input()) \nprint('YES' if sorted(s) == sorted(s2) else 'NO')", "a=input()\r\nb=input()\r\nc=input()\r\n\r\nf=a+b\r\nres1=' '.join(sorted(f))\r\nres2=' '.join(sorted(c))\r\n\r\n\r\nif res1==res2:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = list(input())\r\ny = list(input())\r\nz = list(input())\r\n\r\ni = sorted(x + y)\r\n\r\nif len(x) + len(y) == len(z):\r\n if i == sorted(z):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nfreq=[0]*100\r\nfreq1=[0]*100\r\nfor i in a:\r\n freq[ord(i)]+=1\r\nfor i in b :\r\n freq[ord(i)]+=1\r\nfor i in c:\r\n freq1[ord(i)]+=1\r\nif freq==freq1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=list(input())\r\ns2=list(input())\r\ns3=list(input())\r\nl=[0]*26\r\nfor i in s1:\r\n l[ord(i)%ord(\"A\")]+=1\r\n\r\nfor i in s2:\r\n l[ord(i)%ord(\"A\")]+=1\r\n\r\nfor i in s3:\r\n l[ord(i)%ord(\"A\")]-=1\r\n\r\nif(len(set(l))==1 and l[0]==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "def recover(guest, host, piles):\r\n if len(guest) + len(host) != len(piles):\r\n return False\r\n alphabet = [0] * 26\r\n for letter in piles:\r\n alphabet[ord(letter) - 65] += 1\r\n for letter in guest:\r\n x = ord(letter) - 65\r\n if alphabet[x] == 0:\r\n return False\r\n alphabet[x] -= 1\r\n for letter in host:\r\n x = ord(letter) - 65\r\n if alphabet[x] == 0:\r\n return False\r\n alphabet[x] -= 1\r\n return True\r\n\r\nif recover(guest=input(), host=input(), piles=input()):\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\na = sorted(input())\r\nb = sorted(input())\r\nd = sorted(input())\r\ns = sorted(a+b)\r\nif s == d:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "p=input()\r\nq=input()\r\nr=sorted(input())\r\na=sorted(p+q)\r\nif len(a)==len(r) and a==r:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 28 01:36:26 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn1=[*input()]\r\nn2=[*input()]\r\nn3=[*input()]\r\n \r\nif sorted(n1+n2)==sorted(n3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1, s2, s3 = list(input()), list(input()), list(input())\r\ns = sorted(s1+s2)\r\ns3.sort()\r\nprint('YES' if s == s3 else \"NO\") ", "import 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\na, b = bytearray(inp()) + bytearray(inp()), bytearray(inp())\nprint(\"YES\" if sorted(a) == sorted(b) else \"NO\")\n", "fir = input()\r\nsec = input()\r\nut = input()\r\nif sorted(fir+sec) == sorted(ut):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main(s1, s2, s3):\r\n if sorted(s1 + s2) == sorted(s3):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n s1, s2, s3 = input(), input(), input()\r\n\r\n print(main(s1, s2, s3))", "guest_name = input()\r\nhost_name = input()\r\nletters_pile = input()\r\ncombined_names = guest_name + host_name\r\nfor letter in combined_names:\r\n if letter in letters_pile:\r\n letters_pile = letters_pile.replace(letter, '', 1)\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nif len(letters_pile) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\n\r\n# Read the input strings\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nscrambled_letters = input().strip()\r\n\r\n# Concatenate the guest's name and host's name\r\nconcatenated_name = guest_name + host_name\r\n\r\n# Check if the letters in the pile can form the names\r\nif Counter(concatenated_name) == Counter(scrambled_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=a+b\r\nc=sorted(c)\r\nd=input()\r\nd=sorted(d)\r\nif c==d:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nq = ''\r\nv = ''\r\nk = 0\r\nif len(a)+len(b)!=len(c):\r\n print(\"NO\")\r\n k+=1\r\nelse:\r\n if k == 0:\r\n for i in range(len(a)):\r\n if a[i] in c:\r\n c.remove(a[i])\r\n q+=a[i]\r\n else:\r\n print(\"NO\")\r\n k+=1\r\n break\r\n if k == 0:\r\n for i in range(len(b)):\r\n if b[i] in c:\r\n c.remove(b[i])\r\n v+=b[i]\r\n else:\r\n print(\"NO\")\r\n k+=1\r\n break\r\nif k == 0:\r\n print(\"YES\")", "s1 = input()\r\ns2 = input()\r\ns3 = sorted(s1+s2)\r\ns4 = sorted(input())\r\nif s4 == s3:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=input()\r\ns2=input()\r\ns3=sorted(input())\r\ns=sorted(s1+s2)\r\nl=[]\r\nl1=[]\r\nfor i in s:\r\n if i not in l:\r\n l.append\r\n l1.append(s.count(i))\r\nm=[]\r\nm1=[]\r\nfor i in s3:\r\n if i not in m:\r\n m.append\r\n m1.append(s3.count(i))\r\nif l1==m1:\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,b,n = input(),input(),input()\nfor i in a:\n if i not in n:\n print(\"NO\")\n exit()\n a = a[1:]\n if n.count(i) > 1:\n k = n.count(i)-1\n n = n.replace(i,'')\n n += i*k\n else:\n n = n.replace(i,'')\n\nfor i in b:\n if i not in n:\n print(\"NO\")\n exit()\n b = b[1:]\n if n.count(i) > 1:\n k = n.count(i)-1\n n = n.replace(i,'')\n n += i*k\n else:\n n = n.replace(i,'')\n\nif len(n) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n# Sat Jul 08 2023 11:03:28 GMT+0300 (Moscow Standard Time)\n", "s1=input()\r\ns2=input()\r\ns=input()\r\nif len(s)!=len(s1)+len(s2):\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n for i in s:\r\n if s.count(i)==s1.count(i)+s2.count(i):\r\n s.replace(i,\"\")\r\n s1.replace(i,\"\")\r\n s2.replace(i,\"\")\r\n continue\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "a=str(input())\r\nb=str(input())\r\nc=str(input())\r\nd=a+b\r\nx=sorted(d)\r\ny=sorted(c)\r\nif x==y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile = input()\r\n\r\ntarget = guest_name + host_name\r\n\r\nif len(target) != len(pile):\r\n print(\"NO\")\r\n exit()\r\n\r\ncount = [0] * 26\r\n\r\nfor c in target:\r\n count[ord(c) - ord('A')] += 1\r\n\r\nfor c in pile:\r\n count[ord(c) - ord('A')] -= 1\r\n if count[ord(c) - ord('A')] < 0 or ord(c) < ord('A') or ord(c) > ord('Z'):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n\r\n", "a = list(input())\nb = list(input())\nc = list(input())\nd = (a+b)\nd.sort()\nc.sort()\n\nprint('YES' if d == c else 'NO')\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = s1 + s2\r\nif len(s) != len(s3):\r\n print(\"NO\")\r\nelse:\r\n for i in s:\r\n if i not in s3:\r\n print(\"NO\")\r\n break\r\n else:\r\n s3 = s3.replace(i, '', 1)\r\n else:\r\n print(\"YES\")", "h = input()\r\ng = input()\r\nh_g = input()\r\n\r\n\r\nif len(h) + len(g) == len(h_g) and sorted(h + g) == sorted(h_g):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input() \r\ns2=input() \r\ns3=input() \r\nl1=[ord(i) for i in s1]\r\nl2=[ord(i) for i in s2]\r\nl3=[ord(i) for i in s3] \r\nl1=sorted(l1)\r\nl3=sorted(l3) \r\nfor i in l2:\r\n l1.append(i)\r\nl1=sorted(l1)\r\nl3=sorted(l3) \r\nl1=[chr(i) for i in l1] \r\nl3=[chr(i) for i in l3] \r\ns1=\"\"\r\ns3=\"\"\r\nfor i in range(len(l1)):\r\n s1+=l1[i] \r\nfor i in range(len(l3)):\r\n s3+=l3[i] \r\nif(s1==s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\nhost = input()\nletters = input()\n\nnames = guest + host\n\nsorted_letters = sorted(letters)\nsorted_names = sorted(names)\n\nif sorted_letters == sorted_names:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t \t \t\t \t\t \t \t\t\t\t\t", "s1=input()\r\ns2=input()\r\ns3=input()\r\n\r\nif(sorted(s1+s2)==sorted(s3)):print('YES')\r\nelse:print('NO')", "# Read the guest's name, host's name, and the pile of letters\r\nguest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\n\r\n# Concatenate the guest's name and host's name\r\ncombined_names = guest_name + host_name\r\n\r\n# Check if it's possible to form the combined names using the pile of letters\r\ndef is_possible(combined_names, pile_of_letters):\r\n # Create a dictionary to count the frequency of each letter in the combined names\r\n letter_count = {}\r\n for letter in combined_names:\r\n letter_count[letter] = letter_count.get(letter, 0) + 1\r\n\r\n # Check if each letter in the pile of letters is in the dictionary and decrement its count\r\n for letter in pile_of_letters:\r\n if letter in letter_count:\r\n letter_count[letter] -= 1\r\n if letter_count[letter] == 0:\r\n del letter_count[letter]\r\n else:\r\n return False\r\n\r\n # Check if there are no extra letters left in the dictionary\r\n return len(letter_count) == 0\r\n\r\n# Check and print the result\r\nif is_possible(combined_names, pile_of_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n1=input()\r\nn2=input()\r\nn3=input()\r\nprint('YES' if sorted(n1+n2)==sorted(n3) else 'NO')", "import string \r\ns1=input()\r\ns2=input()\r\ns3=input()\r\n\r\ndreOne=[0]*26\r\ndreTwo=[0]*26\r\nc=string.ascii_lowercase\r\nc=c.upper()\r\naOne=list(c)\r\naTwo=list(c)\r\n\r\nsThang=s1+s2\r\nfor i in sThang:\r\n if i in aOne:\r\n k=aOne.index(i)\r\n #print(k)\r\n dreOne[k]=dreOne[k]+1\r\n \r\nfor i in s3:\r\n if i in aOne:\r\n k=aOne.index(i)\r\n dreTwo[k]=dreTwo[k]+1\r\nif dreOne==dreTwo:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name=input()\r\nhost=input()\r\nculprit=input()\r\ntotal=name+host\r\n\r\n\r\nlst=list(total)\r\nlst.sort()\r\ncust=list(culprit)\r\ncust.sort()\r\n\r\nif lst == cust:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n", "a = [i for i in str(input())]\r\nb = [i for i in str(input())]\r\nc = [i for i in str(input())]\r\n\r\nif len(a)+len(b) != len(c):\r\n print(\"NO\")\r\nelse:\r\n for l in a:\r\n if l in c:\r\n c.remove(l)\r\n for l in b:\r\n if l in c:\r\n c.remove(l)\r\n if c == []:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\na+=b\r\na1=[]\r\nfor i in a:\r\n a1.append(i)\r\nc=input()\r\nc1=[]\r\nfor i in c:\r\n c1.append(i)\r\na1=sorted(a1)\r\n\r\nc1=sorted(c1)\r\nx=[]\r\ny=[]\r\nx.append(a1.count(a1[0]))\r\nfor i in range(1,len(a)):\r\n if a1[i]!=a1[i-1]:\r\n x.append(a1.count(a1[i]))\r\n #print(a1[i], a1.count(a[i]))\r\ny.append(c1.count(c1[0]))\r\nfor i in range(1,len(c)):\r\n if c1[i]!=c1[i-1]:\r\n y.append(c1.count(c1[i]))\r\nif x==y:\r\n print('YES')\r\nelse:\r\n print('NO')", "gname=list(input())\r\nhname=list(input())\r\nsc=list(input())\r\ngname.extend(hname)\r\ngname.sort()\r\nsc.sort()\r\nif gname==sc:print(\"YES\")\r\nelse: print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\nnames = guest_name + host_name\r\n\r\n# Sort the characters in the names and pile of letters\r\nsorted_names = sorted(names)\r\nsorted_pile = sorted(pile_of_letters)\r\n\r\n# Check if the sorted names and sorted pile are equal\r\nif sorted_names == sorted_pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\nb = input()\nc = input()\n\nstr = ''.join(sorted(a+b))\nif str == (''.join(sorted(c))):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "name1 = input()\r\nname2 = input()\r\nstroka = sorted(input())\r\n\r\nall = sorted(name1+name2)\r\nif all==stroka:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "from collections import Counter\r\n\r\nn = input()\r\nh = input()\r\nl = input()\r\n\r\na = 0\r\nif len(l) != len(n) + len(h):\r\n a = 0\r\nelse:\r\n # Check for each letter in the l string\r\n n1 = Counter(list(n))\r\n h1 = Counter(list(h))\r\n l1 = Counter(list(l))\r\n\r\n for i in range(0,len(l)):\r\n x = l[i]\r\n if l1[x] == n1[x] + h1[x]:\r\n a = 1\r\n continue\r\n else:\r\n a = 0\r\n break\r\n\r\nif a == 1:\r\n print('YES')\r\nelse: \r\n print('NO')\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ne=list(c)\r\nd=list(a+b)\r\nd.sort()\r\ne.sort()\r\nif d==e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "name1 = input()\r\nname2 = input()\r\npile = sorted(input())\r\nif pile == sorted(name1+name2):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "line1 = input()\r\nline2 = input()\r\nourstring = line1+line2\r\nline3 = input()\r\n\r\ndict1 = {thing:ourstring.count(thing) for thing in set(ourstring)}\r\ndict2 = {thing:line3.count(thing) for thing in set(line3)}\r\n\r\nif dict1 == dict2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Version 16.0\r\ndef main() -> None:\r\n # 2023-07-12 00:09:43\r\n\r\n s1 = si()\r\n s2 = si()\r\n s3 = si()\r\n dick1 = defaultdict(int)\r\n dick2 = defaultdict(int)\r\n for i in s1: dick1[i]+=1\r\n for i in s2: dick1[i]+=1\r\n for i in s3: dick2[i]+=1\r\n p('YES') if dick1==dick2 else p('NO')\r\n \r\nif __name__ == \"__main__\":\r\n import os,sys,math,itertools;from collections import deque,defaultdict,OrderedDict,Counter\r\n from bisect import bisect,bisect_left,bisect_right,insort\r\n from heapq import heapify,heappush,heappop,nsmallest,nlargest,heapreplace, heappushpop\r\n ii,si=lambda:int(input()),lambda:input() \r\n mi,msi=lambda:map(int,input().strip().split(\" \")),lambda:map(str,input().strip().split(\" \")) \r\n li,lsi=lambda:list(mi()),lambda:list(msi())\r\n out,export,p,pp=[],lambda:print('\\n'.join(map(str, out))),lambda x :out.append(x),lambda array:p(' '.join(map(str,array)))\r\n try:exec('from hq import L,LT,see,info,cmdIO,_generator_\\nline=[cmdIO(),main(),export(),_generator_()]\\nfor l in line:l')\r\n except(FileNotFoundError,ModuleNotFoundError):main();export()", "text_1=[i for i in input()]\r\ntext_2=[i for i in input()]\r\ntext_3=[i for i in input()]\r\n\r\ntext_3=sorted(text_3)\r\nne_text=sorted(text_1+text_2)\r\nif (ne_text==text_3)==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "sort_fn, input_fn = sorted, input\r\nprint('YNEOS'[sort_fn(input_fn() + input_fn()) != sort_fn(input_fn()) ::2])\r\n# HI CODEFORCES\r\n", "a=input(\"\")\r\nb=input(\"\")\r\nc=input(\"\")\r\nd=a+b\r\ndl=list(d)\r\ndl2=sorted(dl)\r\ncl=list(c)\r\ncl2=sorted(cl)\r\nif cl2==dl2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "\r\nmen = input() + input()\r\nmixed = input()\r\n\r\nif len(men) != len(mixed):\r\n print('NO')\r\nelse:\r\n for c in set(men):\r\n if men.count(c) != mixed.count(c):\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n", "def can_form_names(guest_name, host_name, pile_letters):\r\n target_names = guest_name + host_name\r\n\r\n target_names_list = list(target_names)\r\n pile_letters_list = list(pile_letters)\r\n\r\n for letter in pile_letters_list:\r\n if letter in target_names_list:\r\n target_names_list.remove(letter)\r\n else:\r\n return \"NO\"\r\n\r\n if len(target_names_list) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile_letters = input().strip()\r\n\r\nresult = can_form_names(guest_name, host_name, pile_letters)\r\nprint(result)\r\n", "m = input()\r\nn = input()\r\na = input()\r\nk = m + n\r\nif sorted(k) == sorted(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "host1 = input()\r\nhost2 = input()\r\npile = input()\r\ncom = host1 + host2\r\nif sorted(com) == sorted(pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input().lower()\r\nb = input().lower()\r\nc = input().lower()\r\n\r\na += b\r\na = sorted(a)\r\nc = sorted(c)\r\n\r\nif a == c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b\r\nf=[]\r\nfor i in range(len(d)):\r\n f.append(d[i])\r\ng=sorted(f)\r\nh=sorted(c)\r\nif g==h:\r\n print('YES')\r\nelse:\r\n print('NO')", "name1=input(\"\")\r\nname2=input(\"\")\r\nname3=input(\"\")\r\nname4=name1+name2\r\n\r\nname3=list(name3)\r\nname4=list(name4)\r\nname3.sort()\r\nname4.sort()\r\n\r\n\r\nif name3==name4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\n\ndef ans(d,c):\n counting_d=Counter(d)\n\n for i in c:\n if i in counting_d:\n counting_d[i]-=1\n if counting_d[i]==0:\n del counting_d[i]\n else:\n return \"NO\"\n return \"YES\" if not counting_d else \"NO\"\n\ns=input().strip()\na=input().strip()\nc=input().strip()\nd = s+a\n\nprint(ans(d,c))\n\t\t\t\t \t\t \t\t \t \t\t \t \t \t \t", "g = input()\nh = input()\nw1 = sorted(g+h)\nw2 = sorted(input())\nprint(\"YES\") if w1 == w2 else print(\"NO\")\n \n \t\t\t \t \t\t\t\t \t\t\t\t\t\t\t \t", "from collections import Counter\r\nguest_name=input()\r\nhost_name=input()\r\nletters_pile=input()\r\nguest_host_names=Counter(guest_name+host_name)\r\nletters_pile_counter=Counter(letters_pile)\r\nif guest_host_names==letters_pile_counter:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nans = \"YES\"\r\ndic = {}\r\n\r\nfor let in a:\r\n if let in dic:\r\n dic[let] += 1\r\n else:\r\n dic[let] = 1\r\nfor let in b:\r\n if let in dic:\r\n dic[let] += 1\r\n else:\r\n dic[let] = 1 \r\nfor let in c:\r\n if let not in dic or c.count(let) !=dic[let]:\r\n ans = \"NO\" \r\n break\r\nif len(set(c))!=len(dic):\r\n ans = \"NO\"\r\nprint(ans)", "def sunta(fackName, allLitters):\r\n num = 1\r\n for litter in fackName:\r\n if litter in allLitters:\r\n allLitters.remove(litter)\r\n else:\r\n num = 0\r\n break\r\n if len(allLitters) != 0:\r\n num = 0\r\n return num\r\n\r\n\r\nfirstName = input()\r\nsecondName = input()\r\nthirdName = input()\r\n\r\nallLitters = list(firstName) + list(secondName)\r\n\r\nif sunta(thirdName, allLitters) != 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\nnames = guest_name + host_name\r\n\r\n\r\nfor letter in names:\r\n if letter in pile_letters:\r\n \r\n pile_letters = pile_letters.replace(letter, '', 1)\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n \r\n if len(pile_letters) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "'''\r\n ************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM :A. Amusing Joke\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\nx=input()\r\ny=input()\r\nz=input()\r\nm=x+y\r\na=sorted(m)\r\nb=sorted(z)\r\nif b==a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns = input()\r\nname_1 = list(s1)\r\nname_2 = list(s2)\r\nst = list(s)\r\n\r\ni = 0\r\nwhile i < len(st):\r\n if st[i] in name_1:\r\n name_1.remove(st[i])\r\n st.remove(st[i])\r\n i -= 1\r\n i += 1\r\n\r\ni = 0\r\nwhile i < len(st):\r\n if st[i] in name_2:\r\n name_2.remove(st[i])\r\n st.remove(st[i])\r\n i -= 1\r\n i += 1\r\n\r\nif len(st) == 0 and len(name_1) == 0 and len(name_2) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import Counter,defaultdict\r\nall = defaultdict(int)\r\na = Counter(input())\r\nb = Counter(input())\r\nc = Counter(input())\r\n\r\nfor i in a:\r\n all[i] += a[i]\r\nfor i in b:\r\n all[i] +=b[i]\r\n\r\nif dict(all) == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,d=str(input()),0\r\nb,l=str(input()),[]\r\nc,m=str(input()),[]\r\nfor i in a:\r\n l.append(i)\r\nfor i in b:\r\n l.append(i)\r\nfor j in c:\r\n m.append(j)\r\nfor k in l:\r\n if k in m:\r\n m.remove(k)\r\n else:\r\n d+=1\r\n break\r\nif d==0 and len(m)==0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "gue=input()\r\nhos=input()\r\nnew=input()\r\nc=0\r\ntot=gue+hos\r\nstot=''.join(sorted(tot))\r\nsnew=''.join(sorted(new))\r\nltot=len(tot)\r\nlnew=len(new)\r\nif(ltot!=lnew):\r\n print(\"NO\")\r\nelse:\r\n for i in range (lnew):\r\n if(stot[i]==snew[i]):\r\n c=c+1\r\n if(lnew==c):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n ", "# LUOGU_RID: 133668905\nstring_alpha = [\"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\",\r\n \"V\", \"W\", \"X\", \"Y\", \"Z\"]\r\ndic_1 = {\"A\": 0, \"B\": 0, \"C\": 0, \"D\": 0, \"F\": 0, \"G\": 0, \"H\": 0, \"I\": 0, \"J\": 0, \"K\": 0, \"L\": 0, \"M\": 0, \"N\": 0, \"O\": 0,\r\n \"P\": 0, \"Q\": 0, \"R\": 0, \"S\": 0, \"T\": 0, \"U\": 0, \"V\": 0, \"W\": 0, \"X\": 0, \"Y\": 0, \"Z\": 0, \"E\": 0}\r\ndic_2 = {\"A\": 0, \"B\": 0, \"C\": 0, \"D\": 0, \"F\": 0, \"G\": 0, \"H\": 0, \"I\": 0, \"J\": 0, \"K\": 0, \"L\": 0, \"M\": 0, \"N\": 0, \"O\": 0,\r\n \"P\": 0, \"Q\": 0, \"R\": 0, \"S\": 0, \"T\": 0, \"U\": 0, \"V\": 0, \"W\": 0, \"X\": 0, \"Y\": 0, \"Z\": 0, \"E\": 0}\r\ndic_3 = {\"A\": 0, \"B\": 0, \"C\": 0, \"D\": 0, \"F\": 0, \"G\": 0, \"H\": 0, \"I\": 0, \"J\": 0, \"K\": 0, \"L\": 0, \"M\": 0, \"N\": 0, \"O\": 0,\r\n \"P\": 0, \"Q\": 0, \"R\": 0, \"S\": 0, \"T\": 0, \"U\": 0, \"V\": 0, \"W\": 0, \"X\": 0, \"Y\": 0, \"Z\": 0, \"E\": 0}\r\n\r\nline = input()\r\n\r\nfor i in line:\r\n dic_1[i] += 1\r\n\r\nline = input()\r\n\r\nfor i in line:\r\n dic_2[i] += 1\r\n\r\nline = input()\r\n\r\nfor i in line:\r\n dic_3[i] += 1\r\nfind = 0\r\nfor i in string_alpha:\r\n if dic_3[i] == dic_2[i] + dic_1[i]:\r\n continue\r\n else:\r\n print(\"NO\")\r\n find = 1\r\n break\r\nif not find:\r\n print(\"YES\")\r\n", "g=input()\r\nh=input()\r\np=input()\r\ncombined_name=g+h\r\nc_n=sorted(combined_name)\r\np1=sorted(p)\r\nif p1==c_n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\nline1 = list(map(str, input().strip()))\nline2 = list(map(str, input().strip()))\nline3 = list(map(str, input().strip()))\nline3.sort()\n\nline = line1+line2\nline.sort()\n\nif line == line3:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t\t \t \t\t\t\t \t \t\t", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\ns1 = sorted(s1+s2)\r\ns3 = sorted(s3)\r\n\r\nif s1 == s3:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\r\n g_name = input()\r\n h_name = input()\r\n pile = list(input())\r\n for i in g_name:\r\n if i in pile:\r\n pile.remove(i)\r\n else:\r\n return('NO')\r\n\r\n for j in h_name:\r\n if j in pile:\r\n pile.remove(j)\r\n else:\r\n return('NO')\r\n if len(pile) == 0: \r\n return ('YES')\r\n return 'NO'\r\nprint(main())\r\n\r\n\r\n", "import sys\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nl1 = list(s1)\r\nl2 = list(s2)\r\nl3 = list(s3)\r\nfor i in l1:\r\n if i in l3:\r\n l3.remove(i)\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\n break\r\n\r\nfor i in l2:\r\n if i in l3:\r\n l3.remove(i)\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\n break\r\nif(l3 == []):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\n\r\ns3=input()\r\ns3s=sorted(s3)\r\n\r\ns3sf=\"\".join(s3s)\r\n\r\nsjoin=list(s1+s2)\r\nsans=sorted(sjoin)\r\nsfin=\"\".join(sans)\r\n\r\nif(sfin==s3sf):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "first = input()\r\nsecond = input()\r\ntarget = input()\r\n\r\nfrequency = {}\r\n\r\nfor c in first:\r\n if not c in frequency:\r\n frequency[c] = 0\r\n frequency[c] += 1\r\n\r\nfor c in second:\r\n if not c in frequency:\r\n frequency[c] = 0\r\n frequency[c] += 1\r\n\r\nfor c in target:\r\n if not c in frequency:\r\n print('NO')\r\n break\r\n frequency[c] -= 1\r\n if frequency[c] < 0:\r\n print('NO')\r\n break\r\nelse:\r\n if max(frequency.values()) > 0:\r\n print('NO')\r\n else:\r\n print(\"YES\")\r\n", "def solution():\r\n n1, n2, fstring = str(input()), str(input()), str(input())\r\n # print(\"YES\" if len(fstring) == (len(n1) + len(n2) ) else \"NO\")\r\n if(len(fstring) != (len(n1) + len(n2) )):\r\n print(\"NO\")\r\n else:\r\n for i in fstring:\r\n if(fstring.count(i) != (n1.count(i) + n2.count(i)) ):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n return 0\r\n\r\nsolution()", "# g=str(input())\n# r=str(input())\n# r=str(input())\n\n# if(sorted(g+r) == sorted(r)):\n# print(\"YES\")\n\ng=str(input())\nr=str(input())\nl=str(input())\n\nif(sorted(g+r)==sorted(l)):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t\t\t\t\t\t\t\t \t\t \t \t\t \t\t \t", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns4 = s1+s2\r\nres = ''.join(sorted(s4))\r\nre1 = ''.join(sorted(s3))\r\nif list(res) == list(re1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = str(input())\r\nm = str(input())\r\ns = str(input())\r\no = n+m\r\nsort_s = sorted(s)\r\nsort_o = sorted(o)\r\nif sort_s == sort_o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "gst = input()\r\nhst = input()\r\npile = list(input())\r\ntw_nm = list(gst+hst)\r\ntw_nm.sort()\r\npile.sort()\r\n\r\n\"\"\"print(tw_nm)\r\nprint(pile)\"\"\"\r\n\r\nif tw_nm == pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\nx1=list(map(str,x))\r\nx2=input()\r\nx2=list(map(str,x2))\r\nx3=input()\r\nx3=list(map(str,x3))\r\nl=x1+x2\r\nl.sort()\r\nx3.sort()\r\n\r\n\r\nif l==x3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s1=input()\r\ns2=input()\r\ns3=sorted(input())\r\ns4=sorted(s1+s2)\r\nif(s4==s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 117305692\nfrom collections import Counter\r\n\r\na = input().strip()\r\nb = input().strip()\r\nres = Counter(a) + Counter(b)\r\nans = Counter(input().strip())\r\nif ans == res:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b, c = input(), input(), input()\r\nab = a + b\r\nAB = []\r\nC = []\r\nfor i in range(len(ab)):\r\n AB += ab[i]\r\nfor j in range(len(c)):\r\n C += c[j]\r\nAB.sort()\r\nC.sort()\r\nif AB == C:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\n\r\ndef calc(s):\r\n d = {}\r\n for c in s:\r\n if c in d.keys():\r\n d[c] += 1\r\n else:\r\n d[c] = 1\r\n return d\r\n# print(calc(a+b))\r\n# print(calc(c))\r\nif calc(a+b) == calc(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\nletters = input()\r\n\r\n# Concatenate the guest name and host name\r\nnames = guest_name + host_name\r\n\r\n# Check if the sorted concatenation of the guest and host names\r\n# is equal to the sorted pile of letters\r\nif sorted(names) == sorted(letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n= input()\r\ns = input()\r\ns1=input()\r\ns2 = n+s\r\nl1 = [str(x) for x in s1]\r\nl2 = [str(x) for x in s2]\r\nl1.sort()\r\nl2.sort()\r\nif l1==l2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "def main():\r\n counts = [0] * 128\r\n\r\n s1 = input()\r\n for char in s1:\r\n counts[ord(char)] += 1\r\n\r\n s2 = input()\r\n for char in s2:\r\n counts[ord(char)] += 1\r\n\r\n s3 = input()\r\n for char in s3:\r\n counts[ord(char)] -= 1\r\n\r\n if all(count == 0 for count in counts):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s1 = input()\r\ns2 = input()\r\ns = input()\r\n\r\nd1 = dict()\r\nd2 = dict()\r\n\r\nfor letter in s1:\r\n d1[letter] = d1.get(letter, 0) + 1\r\nfor letter in s2:\r\n d1[letter] = d1.get(letter, 0) + 1\r\n\r\nfor letter in s:\r\n d2[letter] = d2.get(letter, 0) + 1\r\n\r\nif d1 == d2:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = list(input())\r\ns2 = list(input())\r\ns = list(input())\r\nx = s1+s2\r\nx.sort()\r\ns.sort()\r\nif x==s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\nm=input()\r\nz=list(input())\r\nn=list(n+m)\r\nz=sorted(z)\r\nn=sorted(n)\r\nif z==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ndef c_f(s1, s2, p):\r\n c1=Counter(s1+s2)\r\n c2=Counter(p)\r\n return c1==c2\r\nif __name__=='__main__':\r\n s1=input().strip()\r\n s2=input().strip()\r\n p=input().strip()\r\n print('YES' if c_f(s1, s2, p) else 'NO')", "np=input()\r\nnr=input()\r\npi=input()\r\nfl=True\r\nif (len(np)+len(nr)) == len(pi):\r\n nsp=[*set(np)]\r\n nsr=[*set(nr)]\r\n for i in nsp :\r\n if (np.count(i)+nr.count(i)) != pi.count(i):\r\n fl=False\r\n break\r\n if fl :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\nelse :\r\n print(\"NO\")", "string1 = input()\r\nstring2 = input()\r\nstring3 = input()\r\nc_string = string1 + string2 \r\na1, a2 = list(set(c_string)), list(set(string3))\r\nd1, d2 = {}, {}\r\nfor i in a1:\r\n d1[i] = c_string.count(i)\r\nfor i in a2:\r\n d2[i] = string3.count(i)\r\nif d1 == d2:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nn=a+b\r\nn=''.join(sorted(n))\r\nc=''.join(sorted(c))\r\nif n==c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = list(input())\r\ns2 = list(input())\r\ns = list(input())\r\nc=s1+s2\r\n(c).sort()\r\ns.sort()\r\ns1=\"\".join(c)\r\ns=\"\".join(s)\r\nprint(\"YES\" if s1==s else \"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b\r\np=sorted(d)\r\nq=sorted(c)\r\ns1=\"\".join(p)\r\ns2=\"\".join(q)\r\nif s1!=s2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "name1 = input()\nname2 = input()\nl = input()\n\nn = name1 + name2\ns_names = sorted(n)\ns_letters = sorted(l)\n\nif s_names == s_letters:\n print(\"YES\")\nelse:\n print(\"NO\")\n# Sat Jul 08 2023 11:02:00 GMT+0300 (Moscow Standard Time)\n", "# Read input\r\nguest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\n# Concatenate the guest's name and host's name\r\nfull_name = guest_name + host_name\r\n\r\n# Initialize a dictionary to count letter frequencies\r\nletter_counts = {}\r\nfor letter in full_name:\r\n letter_counts[letter] = letter_counts.get(letter, 0) + 1\r\n\r\n# Iterate through the pile of letters and update letter counts\r\nfor letter in pile_letters:\r\n if letter in letter_counts and letter_counts[letter] > 0:\r\n letter_counts[letter] -= 1\r\n else:\r\n # Extra letter found in the pile\r\n print(\"NO\")\r\n exit()\r\n\r\n# Check if all letter counts are zero\r\nif all(count == 0 for count in letter_counts.values()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1=input()\ns2=input()\ns3=input()\ns1=s1+s2\nif(sorted(s1)==sorted(s3)):\n print(\"YES\")\nelse:\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nf = True\r\nfor i in a:\r\n if i in c:\r\n c.remove(i)\r\n else:\r\n f = False\r\n break\r\nfor i in b:\r\n if i in c:\r\n c.remove(i)\r\n else:\r\n f = False\r\n\r\nif f and not c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pile1 = str(input())\r\npile2 = str(input())\r\njoke = str(input())\r\npiles = pile2 + pile1\r\nln = len(piles)\r\nif len(joke) == ln:\r\n i = 0\r\n list = [None]*ln\r\n while i < ln:\r\n list[i] = piles[i]\r\n i += 1\r\n i = 0\r\n while i < ln:\r\n p = 0\r\n while p < len(list):\r\n if list[p] == joke[i]:\r\n list.pop(p)\r\n break\r\n p += 1\r\n i += 1\r\n if list == []:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "x = list(input())\r\ny=list(input())\r\nz = list(input())\r\n\r\na = x+y\r\nz.sort()\r\na.sort()\r\n\r\nif(z==a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nc = a + b\r\nc.sort()\r\nd = list(input())\r\nd.sort()\r\nslatt = 0\r\n\r\nif (len(c)==len(d)):\r\n while len(d)>slatt:\r\n if c[slatt] == d[slatt]:\r\n slatt+=1\r\n else:\r\n break\r\n if slatt==len(c):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print('NO')", "#Amusing Joke \r\na = input()\r\nb = input()\r\nc = sorted(input())\r\ncount = 0 \r\nab = sorted(a + b)\r\nfor i in range(len(a+b)): \r\n if len(a+b) != len(c): \r\n break\r\n elif(ab[i] == c[i]): \r\n count += 1\r\nif count == len(c): \r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns=s1+s2\r\ns3=input()\r\nans=0\r\nfor i in s:\r\n if s3.count(i)!=s.count(i) or len(s)!=len(s3):ans+=1;break\r\nprint(\"YNEOS\"[ans>0::2])", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\nresult = 'YES' if sorted(s1+s2) == sorted(s3) else 'NO'\r\nprint(result)\r\n", "s1=input()\r\ns2=input()\r\ns3=s1+s2\r\nans=input()\r\nif sorted(s3)==sorted(ans):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "v=list(input())\r\nm=list(input())\r\nn=list(input())\r\nv1=v+m\r\nv2=sorted(v1)\r\nv3=sorted(n)\r\nif v3==v2:\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n", "s1=input()\r\ns2=input()\r\ns=input()\r\nres=s1+s2\r\nif sorted(res)==sorted(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the guest's name, host's name, and the pile of letters\r\nguest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\n\r\n# Concatenate the guest's name and host's name\r\ncombined_names = guest_name + host_name\r\n\r\n# Create dictionaries to count the frequency of each letter in the combined names and the pile of letters\r\ncombined_name_dict = {}\r\npile_dict = {}\r\n\r\nfor letter in combined_names:\r\n if letter in combined_name_dict:\r\n combined_name_dict[letter] += 1\r\n else:\r\n combined_name_dict[letter] = 1\r\n\r\nfor letter in pile_of_letters:\r\n if letter in pile_dict:\r\n pile_dict[letter] += 1\r\n else:\r\n pile_dict[letter] = 1\r\n\r\n# Check if the two dictionaries are equal, meaning that there are no extra or missing letters\r\nif combined_name_dict == pile_dict:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def can_form_names(guest_name, host_name, pile_of_letters):\r\n concatenated_name = guest_name + host_name\r\n letter_count = {}\r\n \r\n for letter in concatenated_name:\r\n letter_count[letter] = letter_count.get(letter, 0) + 1\r\n \r\n for letter in pile_of_letters:\r\n if letter in letter_count and letter_count[letter] > 0:\r\n letter_count[letter] -= 1\r\n else:\r\n return \"NO\"\r\n \r\n for count in letter_count.values():\r\n if count > 0:\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\n# Read input\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile_of_letters = input().strip()\r\n\r\n# Check if names can be formed from the pile of letters\r\nresult = can_form_names(guest_name, host_name, pile_of_letters)\r\nprint(result)", "# Read the input\r\nguest_name = input()\r\nhost_name = input()\r\nletters_pile = input()\r\n\r\n# Combine the guest's and host's names\r\ncombined_names = guest_name + host_name\r\n\r\n# Check if the sorted combined names match the sorted letters pile\r\nif sorted(combined_names) == sorted(letters_pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b,c = [list(input()) for i in range(3)]\r\na += b\r\nprint('YES' if sorted(c)==sorted(a) else 'NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b \r\nif len(c)!=len(d):\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n for i in c:\r\n if d.count(i)!=c.count(i):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\n\r\n# Concatenate the guest's name and the host's name\r\ncombined_names = guest_name + host_name\r\n\r\n# Sort the letters in both the concatenated names and the pile of letters\r\nsorted_combined_names = sorted(combined_names)\r\nsorted_pile_of_letters = sorted(pile_of_letters)\r\n\r\n# Check if the sorted names and pile of letters are the same\r\nif sorted_combined_names == sorted_pile_of_letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Sep 18 09:20:42 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\na=input()\nb=input()\nc=input()\nd=a+b\nc=sorted(c)\nd=sorted(d)\nstr1=''\nstr2=''\nfor i in d:\n str1+=i\nfor j in c:\n str2+=j\nif str1==str2:\n print('YES')\nelse:\n print('NO')\n \n\n", "n1=input()\nn2=input()\nn3=input()\ntmp1=[]\ntmp2=[]\nfor i in n1:\n tmp1.append(i)\nfor i in n2:\n tmp1.append(i)\nfor i in n3:\n tmp2.append(i)\ntmp1.sort()\ntmp2.sort()\n\nif tmp1==tmp2:\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 \t", "v,b=sorted,input;print('YNEOS'[v(b()+b())!=v(b())::2])\r\n#HI CODEFORCES\r\n#", "x=input()\r\ny=input()\r\nz=input()\r\na=list(x)+list(y)\r\nb=sorted(a)\r\nc=list(z)\r\ns=sorted(c)\r\nif b == s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Description of the problem can be found at http://codeforces.com/problemset/problem/141/A\r\n\r\nnames = input() + input()\r\nscrambled = input()\r\n\r\nnames = \"\".join(sorted(names))\r\nscrambled = \"\".join(sorted(scrambled))\r\n\r\nprint(\"YES\" if names == scrambled else \"NO\")", "name1,name2=input(),input()\r\ncomb_formed=name1+name2\r\ncomb_given=input()\r\nif sorted(comb_formed)==sorted(comb_given):\r\n print('YES')\r\nelse:\r\n print('NO')", "gname = input()\r\nhname = input()\r\npl = input()\r\nconcatenation = gname + hname\r\nif sorted(concatenation) == sorted(pl):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nn = input()\r\nq = input()\r\nw = s + n\r\nw = sorted(w)\r\nq = sorted(q)\r\nif w == q :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\r\nhost = input()\r\ns1 = guest+host\r\ns2 = input()\r\nif sorted(s1) == sorted(s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\nguest_letters = list(guest_name)\r\nhost_letters = list(host_name)\r\n\r\nfor letter in pile_letters:\r\n if letter in guest_letters:\r\n guest_letters.remove(letter)\r\n elif letter in host_letters:\r\n host_letters.remove(letter)\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nif len(guest_letters) == 0 and len(host_letters) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "guests = list(input())\r\nhosts = list(input())\r\nshuffled = list(input())\r\nfreq_each = [0]*26\r\n'''since our string consists of only \r\nupper case english characters we can use \r\nand array of size 26 to register the frequency \r\nof each character in the first two strings and \r\ndecrease it's frequency with the last string \r\nif the frequency of a character is zero it means\r\nthe character exists both in the strings \r\nif not it doesn't and if all the frequency of characters\r\nis zero this means all the characters exist in both strings'''\r\nfor i in guests:\r\n freq_each[ord(i)-65] += 1\r\nfor i in hosts:\r\n freq_each[ord(i)-65] += 1\r\nfor i in shuffled:\r\n freq_each[ord(i)-65] -= 1\r\ncounter = 0\r\nfor i in freq_each:\r\n if i == 0:counter+=1\r\nprint('YES') if counter == 26 else print('NO')\r\n", "a = input() + input()\r\nb = input()\r\nhm1 = [0 for i in range(26)]\r\nhm2 = [0 for i in range(26)]\r\nfor i in range(len(a)):\r\n hm1[ord(a[i]) - 65] += 1\r\nfor i in range(len(b)):\r\n hm2[ord(b[i]) - 65] += 1 \r\nprint([\"NO\", \"YES\"][hm1 == hm2])", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns=s1+s2\r\nl=list(s3)\r\nm=list(s)\r\nl.sort()\r\nm.sort()\r\n\r\nif(l==m):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "s1, s2 = input(), input()\r\nt = input()\r\nprint(\"YES\" if sorted(s1 + s2) == sorted(t) else \"NO\")", "s1=str(input())\r\ns2=str(input())\r\ns3=str(input())\r\ny=s1+s2\r\ny=sorted(y)\r\ns3=sorted(s3)\r\nif(y==s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\nbase=input()\r\nhashmap=[0]*(27)\r\nfor i in base:\r\n hashmap[ord(i)-ord('A')]+=1\r\nfor i in s1:\r\n hashmap[ord(i)-ord('A')]-=1\r\nfor i in s2:\r\n hashmap[ord(i)-ord('A')]-=1\r\nans=True\r\nfor i in range(27):\r\n if hashmap[i]!=0:\r\n ans=False\r\n break\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "def foo(s):\r\n arr=[]\r\n for i in range(len(s)):\r\n arr.append(s[i])\r\n return arr\r\na=str(input())\r\nb=str(input())\r\nc=str(input())\r\na,b,c=foo(a),foo(b),foo(c)\r\nd=a+b\r\nd.sort()\r\nc.sort()\r\nif len(c)!=len(d):\r\n print(\"NO\")\r\nelse:\r\n ans=\"YES\"\r\n for i in range(len(c)):\r\n if c[i]!=d[i]:\r\n ans=\"NO\"\r\n break\r\n print(ans)", "g = list(i for i in input())\r\nf = list(i for i in input())\r\nj = list(i for i in input())\r\ng += f\r\ng.sort()\r\nj.sort()\r\nif g == j:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ax=input()\r\nby=input()\r\ncz=input()\r\ndw=ax+by \r\nif len(cz)!=len(dw):\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n for i in cz:\r\n if dw.count(i)!=cz.count(i):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "# Amusing Joke\r\nlista = []\r\nlista += input()\r\nlista += input()\r\nz = []\r\nz += input()\r\nrespuesta = False\r\n\r\nfor letra in lista:\r\n if letra in z:\r\n del z[z.index(letra)]\r\n else:\r\n break\r\nelse:\r\n if len(z) == 0:\r\n respuesta = True\r\nprint('YES' if respuesta else 'NO')\r\n", "guest_name = input()\r\nhost_name = input()\r\nletters = input()\r\nname_letters = guest_name + host_name\r\nname_letters_count = {}\r\nfor letter in name_letters:\r\n name_letters_count[letter] = name_letters_count.get(letter, 0) + 1\r\nfor letter in letters:\r\n if letter not in name_letters_count:\r\n print(\"NO\")\r\n break\r\n name_letters_count[letter] -= 1\r\nelse:\r\n for count in name_letters_count.values():\r\n if count != 0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "from collections import Counter\r\n\r\nguest = input()\r\nhost = input()\r\npile = Counter(sorted([*input()]))\r\ntotal = Counter(sorted([*guest+host]))\r\n\r\nif total != pile:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=input()\nm=input()\nc=input()\nj=n+m \nif sorted(j)==sorted(c): print('YES')\nelif sorted(j)!=sorted(c): print('NO')\n# Sat Jul 08 2023 11:39:44 GMT+0300 (Moscow Standard Time)\n", "s=input()\r\nt=input()\r\nk=input()\r\nn=s+t\r\nif sorted(n)==sorted(k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x1=input()\r\nx2=input()\r\nx=x1+x2\r\nres1 = ''.join(sorted(x))\r\nx3=input()\r\nres3 = ''.join(sorted(x3))\r\nif (res1==res3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif sorted(s1+s2) == sorted(s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = list(input())\r\nhost = list(input())\r\nshuffled_host = list(input())\r\n\r\ntry:\r\n for i in range(len(guest)):\r\n shuffled_host.remove(guest[i])\r\nexcept ValueError:\r\n print(\"NO\")\r\n exit()\r\n\r\n\r\ntry:\r\n for i in range(len(host)):\r\n shuffled_host.remove(host[i])\r\nexcept ValueError:\r\n print(\"NO\")\r\n exit()\r\n\r\nif shuffled_host == []:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\n\r\nb = input()\r\n\r\nc = input()\r\n\r\ncol = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] in c:\r\n c = c.replace(a[i], '', 1)\r\n col += 1\r\nfor i in range(len(b)):\r\n if b[i] in c:\r\n c = c.replace(b[i], '', 1)\r\n col += 1\r\nif col == len(a)+len(b) and c == '':\r\n print('YES')\r\nelse:\r\n print('NO')", "c=[input() for x in range(3)]\r\nd=[]\r\ne=[]\r\nf=[]\r\nfor m in c[0]:\r\n d.append(m)\r\nfor m in c[1]:\r\n e.append(m)\r\nfor m in c[2]:\r\n f.append(m)\r\ncheckk=0\r\nfor x in d:\r\n if (x in f)==True:\r\n f.remove(x)\r\n else:\r\n checkk=1\r\n break\r\nfor x in e:\r\n #loll=x in f\r\n if (x in f)==True:\r\n f.remove(x)\r\n else:\r\n checkk=1\r\n break\r\nif checkk==1 or len(f)!=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s1, s2, s3 = [input() for _ in range(3)]\r\nif sorted(s1 + s2) == sorted(s3):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nm = input()\r\ns = input()\r\nl = []\r\nx = []\r\nfor i in range(len(n)):\r\n l.append(n[i])\r\nfor i in range(len(m)):\r\n l.append(m[i])\r\nfor i in range(len(s)):\r\n x.append(s[i])\r\nl.sort()\r\nx.sort()\r\nif l == x : print(\"YES\")\r\nelse : print('NO')\r\n# print(l)\r\n# print(x)", "s1 = input()\r\ns1 = list(map(str, s1))\r\ns2 = input()\r\ns2 = list(map(str, s2))\r\ns = input()\r\ns = list(map(str, s))\r\nt = 0\r\nindex = 0\r\nwhile index < len(s) and t == 0:\r\n found1 = 0\r\n f1 = 0\r\n while f1 < len(s1) and found1 == 0:\r\n if s1[f1] == s[index]:\r\n s1[f1] = '0'\r\n found1 = 1\r\n f1 = f1 + 1\r\n found2 = 0\r\n if found1 == 0:\r\n f2 = 0\r\n while f2 < len(s2) and found2 == 0:\r\n if s2[f2] == s[index]:\r\n s2[f2] = '0'\r\n found2 = 1\r\n f2 = f2 + 1\r\n if found1 == 0 and found2 == 0:\r\n t = 1\r\n index = index + 1\r\nif t == 1:\r\n print(\"NO\")\r\nelse:\r\n c = 0\r\n f1 = 0\r\n while f1 < len(s1) and c == 0:\r\n if s1[f1] != '0':\r\n c = 1\r\n f1 = f1 + 1\r\n f2 = 0\r\n while f2 < len(s2) and c == 0:\r\n if s2[f2] != '0':\r\n c = 1\r\n f2 = f2 + 1\r\n if c == 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "s = input()\r\ns1 = input()\r\nl = list()\r\nfor i in s:\r\n l.append(i)\r\nfor i in s1:\r\n l.append(i)\r\nf = list()\r\nd = input()\r\nfor i in d:\r\n f.append(i)\r\nl.sort()\r\nf.sort()\r\nif l == f:\r\n print('YES')\r\nelse:\r\n print('NO')\n# Sat Jul 08 2023 10:23:16 GMT+0300 (Moscow Standard Time)\n", "def delete(l: list):\r\n i = 0\r\n while True:\r\n if i != 0 or len(l) == 0:\r\n break\r\n else:\r\n if l[0] in s3:\r\n s3.remove(l[0])\r\n l.pop(0)\r\n else:\r\n i += 1\r\n return l\r\n\r\n\r\ns1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\ns1 = delete(s1)\r\ns2 = delete(s2)\r\nif len(s1) == 0 and len(s3) == 0:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\ny=input()\r\nc=input()\r\nd=x+y\r\nc=sorted(list(c))\r\nd=sorted(list(d))\r\nif c==d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nguest = list(input())\r\nhost = list(input())\r\npile = list(input())\r\n\r\nfor l in guest + host:\r\n if l in pile:\r\n pile.remove(l)\r\n else:\r\n break\r\n\r\nif len(pile) != 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "compiedName=input()+input()\r\npile=input()\r\nif len(compiedName) != len(pile):\r\n print('NO')\r\nelse:\r\n for i in range(len(compiedName)):\r\n if pile.find(compiedName[i])>-1:\r\n pile=pile.replace(compiedName[i],'-',1)\r\n if i==len(compiedName)-1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n break\r\n\r\n\r\n\r\n", "g=input()\r\nh=input()\r\np=input()\r\ncomb=g+h\r\ncomb=sorted(comb)\r\np=sorted(p)\r\nif comb==p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "word1 = input()\r\nword2 = input()\r\nword3 = word1 + word2\r\nword4 = input()\r\nif sorted(list(word3)) == sorted(list(word4)): print(\"YES\")\r\nelse: print(\"NO\")", "one=input();two=input();there=input()\r\none+=two\r\nprint(\"YES\" if sorted(one)==sorted(there) else \"NO\")", "s1 = list(input())\ns2 = list(input())\ns3 = list(input())\ns3.sort()\ns = s1+s2\ns.sort()\nif s==s3:\n print('YES')\nelse:\n print('NO')\n\n# Fri Nov 10 2023 16:38:25 GMT+0300 (Moscow Standard Time)\n", "h = input()\ng = input()\nhg = input()\nif len(h) + len(g) == len(hg) and sorted(hg) == sorted(h + g) :\n print('YES')\nelse:print('NO')\n", "s1 = input()\r\ns2 = input()\r\ns0 = input()\r\ns3=s1+s2\r\nx=list()\r\nx1=list()\r\nfor i in range(len(s3)):\r\n x.append(s3[i])\r\nfor i in range(len(s0)):\r\n x1.append(s0[i])\r\nx.sort()\r\nx1.sort()\r\ns4 = \"\".join(x)\r\ns9=\"\".join(x1)\r\nif x==x1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ncount_1 = dict({})\r\ncount_2 = dict({})\r\nfor i in s1:\r\n count_1[i] = count_1.get(i, 0) + 1\r\nfor i in s2:\r\n count_1[i] = count_1.get(i, 0) + 1\r\nfor i in s3:\r\n count_2[i] = count_2.get(i, 0) + 1\r\nif(count_1==count_2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ns = input()\r\na = input()\r\nb = n + s\r\nc = sorted(b)\r\nd = sorted(a)\r\n\r\nif c == d:\r\n print('YES')\r\nelse:\r\n print('NO')", "g=input()\r\nh=input()\r\np=input()\r\na=g+h\r\na=list(a)\r\np=list(p)\r\n\r\na.sort()\r\np.sort()\r\nif a==p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "from collections import Counter\r\nguest_name = input() \r\nhost_name = input()\r\npile_letters = input()\r\nguest_name_freq = Counter(guest_name)\r\nhost_name_freq = Counter(host_name)\r\npile_letters_freq = Counter(pile_letters)\r\nif guest_name_freq + host_name_freq == pile_letters_freq:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns=s1+s2\r\ns=sorted(s)\r\ns=\"\".join(s)\r\ns3=sorted(s3)\r\ns3=\"\".join(s3)\r\nif(s==s3):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b \r\nd=sorted(d)\r\nc=sorted(c)\r\nif(c==d):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input\r\nprint(\"YNEOS\"[sorted(s()+s()) != sorted(s())::2])", "name1 = input()\r\nname2 = input()\r\nmixed = input()\r\n\r\nnames = name1 + name2\r\n\r\nletters=[0]*26\r\n\r\nfor l in names:\r\n letters[ord(l)-65] += 1\r\n \r\nfor l in mixed:\r\n letters[ord(l)-65] -= 1\r\n\r\nanswer=\"YES\"\r\nfor l in letters:\r\n if l != 0:\r\n answer = \"NO\"\r\n\r\nprint(answer)", "guest_name = input().strip()\r\nhost_name = input().strip()\r\npile_letters = input().strip()\r\nfull_name = guest_name + host_name\r\nfull_name_list = list(full_name)\r\npile_letters_list = list(pile_letters)\r\nfull_name_list.sort()\r\npile_letters_list.sort()\r\nif full_name_list == pile_letters_list:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "#q1: watermelon 4A\r\n\r\n# w=int(input(\"Enter the weight of watermelon here, 1<=w<=100: \"))\r\n\r\n# def division(w):\r\n# if 1<=w<=100 and w!=2 and w%2==0 :\r\n# return \"YES\"\r\n\r\n# else:\r\n# return\"NO\"\r\n# print(division(w))\r\n\r\n#q2:way too long words ------------------------->accepted\r\n# n=int(input())\r\n \r\n# def word(n):\r\n# string=''\r\n# for i in range(n):\r\n# s=input().strip().lower()\r\n \r\n# if len(s)>10:\r\n# first=s[0]\r\n# last=s[-1]\r\n# l=(len(s))-2\r\n# string =first+str(l)+last\r\n \r\n# else:\r\n# string=s\r\n# print(string)\r\n# (word(n))\r\n\r\n\r\n#q3:Team---------------------------------> accepted\r\n# n=int(input())\r\n# def team(n):\r\n# count=0\r\n# for i in range(n):\r\n# s=list(map(int,input().strip().split()))\r\n# summ=sum(s)\r\n# if summ>=2:\r\n# count+=1\r\n# return count\r\n# print(team(n))\r\n\r\n# #q4:Next round:\r\n# n, k = map(int, input().split())\r\n# s=list(map(int,input().strip().split()))\r\n# def next_round(n,k,s):\r\n# count=0\r\n# for i in s:\r\n# if i>0 and i>k:\r\n# count+=1\r\n# return count\r\n# print(next_round(n,k,s))\r\n\r\n# #q5: word capitalization:-------------------> accepted\r\n# s=input().strip()\r\n# def word(s):\r\n# if 65<=ord(s[0])<=90: #no change\r\n# return s\r\n\r\n# else: #change\r\n# s=s[0].upper()+s[1:]\r\n# return s\r\n\r\n# print(word(s))\r\n\r\n#q6:petya and strings:------------------------> accepted\r\n# s1=input().strip().lower()\r\n# s2=input().strip().lower()\r\n\r\n# def strings(s1,s2):\r\n# if s1==s2:\r\n# return 0\r\n\r\n# elif s1>s2:\r\n# return 1\r\n\r\n# elif s1<s2:\r\n# return -1\r\n# print(strings(s1,s2))\r\n\r\n#q7:boy or girl------------------------------------>accepted\r\n# s=input().strip()\r\n\r\n# def gender(s):\r\n# distinct=''\r\n# for i in s:\r\n# if i not in distinct:\r\n# distinct+=i\r\n\r\n# if len(distinct)%2==0:\r\n# return \"CHAT WITH HER!\"\r\n\r\n# else:\r\n# return \"IGNORE HIM!\"\r\n# print(gender(s))\r\n\r\n#q8:helpful maths:------------------------------------>accepted\r\n# s=input().strip()\r\n\r\n# def math(s):\r\n# filtered=[]\r\n# summ=''\r\n# if len(s)==1:\r\n# return s\r\n\r\n# for i in range(len(s)):\r\n# if s[i].isnumeric():\r\n# filtered.append(s[i])\r\n# filtered.sort()\r\n# for i in range(len(filtered)-1):\r\n# summ+=filtered[i]+\"+\"\r\n# summ+=filtered[-1]\r\n# return(summ)\r\n# print(math(s))\r\n\r\n# #q9:elephant\r\n# n=int(input())\r\n\r\n# def elephant(n):\r\n# valid=[1,2,3,4,5]\r\n# possible=[]\r\n# if n in valid:\r\n# return 1\r\n\r\n# else:\r\n# for i in valid:\r\n# if n%i==0:\r\n# possible.append(n//i)\r\n# return(min(possible))\r\n\r\n# print(elephant(n))\r\n\r\n# #q10: word-------------------------------------->ACCEPTED\r\n# s=input().strip()\r\n\r\n# def word(s):\r\n# lower=[]\r\n# upper=[]\r\n\r\n# for i in range(len(s)):\r\n# if 65<=ord(s[i])<=90:\r\n# upper.append(s[i])\r\n# elif 97<=ord(s[i])<=122:\r\n# lower.append(s[i])\r\n\r\n# if len(upper)==len(lower):\r\n# return(s.lower())\r\n\r\n# elif len(upper)>len(lower):\r\n# return (s.upper())\r\n\r\n# elif len(lower)>len(upper):\r\n# return (s.lower())\r\n# print(word(s))\r\n\r\n# #q11:translation------------------>accepted\r\n# s=input().lower()\r\n# t=input().lower()\r\n\r\n# def translation(s,t):\r\n# if s[::-1]==t:\r\n# return \"YES\"\r\n\r\n# else:\r\n# return \"NO\"\r\n# print(translation(s,t))\r\n\r\n#q12HULK:------------------------------------->accepted\r\n# n=int(input())\r\n\r\n# def hulk(n):\r\n# s1=\"I hate \"\r\n# s2=\"I love \"\r\n \r\n \r\n# if n==1:\r\n# final=s1+\"it\"\r\n# return final\r\n\r\n# elif n%2==0:\r\n# final=((s1+\"that \"+s2+\"that \")*(n//2)) \r\n# finall=final[:len(final)-5]+\"it\"\r\n# return finall\r\n\r\n# elif n%2!=0:\r\n# final=((s1+\"that \"+s2+\"that \")*((n-1)//2))+(s1+\"it\")\r\n# return final\r\n \r\n \r\n# print(hulk(n))\r\n\r\n#q13: vanya and fence----------------------------->accepted\r\n# n,h=map(int,input().split())\r\n# heights=list(map(int,input().split()))\r\n\r\n# def fence(n,h,heights):\r\n# width=0\r\n# for i in range(n):\r\n# if heights[i]<=h:\r\n# width+=1\r\n# elif heights[i]>h:\r\n# width+=2\r\n# return(width)\r\n# print(fence(n,h,heights))\r\n\r\n#q14: Amusing joke\r\ns1=input().strip().upper()\r\ns2=input().strip().upper()\r\npile=input().strip().upper()\r\n\r\ndef amusingJoke(s1,s2,pile):\r\n joined=s1+s2\r\n d1={} #for joined\r\n d2={} #for pile\r\n\r\n for i in joined:\r\n if i not in d1:\r\n d1[i]=1\r\n else:\r\n d1[i]+=1\r\n\r\n for i in pile:\r\n if i not in d2:\r\n d2[i]=1\r\n else:\r\n d2[i]+=1\r\n \r\n if d1==d2:\r\n return \"YES\"\r\n\r\n else:\r\n return \"NO\"\r\n\r\nprint(amusingJoke(s1,s2,pile))", "a=input()\r\nb=input()\r\nc=input()\r\nx=a+b\r\nq=[]\r\ng=[]\r\nfor i in range(65, 91):\r\n q.append(x.count(chr(i)))\r\nfor s in range(65, 91):\r\n g.append(c.count(chr(s)))\r\nif q==g:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n# Sat Jul 08 2023 11:06:05 GMT+0300 (Moscow Standard Time)\n", "s1 = input()\r\ns2 = input()\r\ns = input()\r\nif len(s1) + len(s2) == len(s):\r\n f = 0\r\n for i in range(len(s)):\r\n if s1.count(s[i]) + s2.count(s[i]) != s.count(s[i]):\r\n f = 1\r\n break\r\n if f == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "guest=list(input())\r\nhost=list(input())\r\npile=list(input())\r\nguest.extend(host)\r\nguest.sort()\r\npile.sort()\r\nprint(\"NO\"if(guest!=pile)else \"YES\")", "s1=input()\ns2=input()\ns3=input()\nl1=[]\nl2=[]\nl=[]\nfor i in s3:\n\tl.append(i)\nl=sorted(l)\nfor i in s1:\n\tl1.append(i)\nfor i in s2:\n\tl2.append(i)\nl3=l1+l2\nl3=sorted(l3)\nif l==l3:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "\r\na = [x for x in input()]\r\nb = [x for x in input()]\r\nc = [x for x in input()]\r\n\r\nz = a + b\r\nc = sorted(c)\r\nz = sorted(z)\r\nif c == z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n ", "guest_name = input()\nhost_name = input()\npile_letters = input()\n\n# Concatenate the guest's name and host's name\ncombined_names = guest_name + host_name\n\n# Sort the letters in both combined names and pile of letters\nsorted_combined_names = sorted(combined_names)\nsorted_pile_letters = sorted(pile_letters)\n\n# Check if the sorted combined names and sorted pile letters are equal\nif sorted_combined_names == sorted_pile_letters:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t\t\t \t \t\t\t\t \t\t\t \t", "guest=str(input())\r\nhost=str(input())\r\npile=str(input())\r\ns=guest+host\r\nif(sorted(s)==sorted(pile)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns=s1+s2\r\nif len(s)==len(s3):\r\n r1=''.join(sorted(s))\r\n r2=''.join(sorted(s3))\r\n if str(r1)==str(r2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "g=input()\r\nh=input()\r\nl=input()\r\nc=g+h\r\nsc=''.join(sorted(c))\r\nsl=''.join(sorted(l))\r\nif sc==sl:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\n\r\nprint(\"YES\" if (Counter(input()) + Counter(input()) == Counter(input())) else \"NO\")", "def can_form(s1, s2, s3):\r\n if len(s1) + len(s2) != len(s3):\r\n return \"NO\"\r\n \r\n char_map_source = {}\r\n char_map_dest = {}\r\n\r\n for i in s1:\r\n char_map_source[i] = char_map_source.get(i, 0) + 1\r\n \r\n for i in s2:\r\n char_map_source[i] = char_map_source.get(i, 0) + 1\r\n \r\n\r\n for i in s3:\r\n char_map_dest[i] = char_map_dest.get(i, 0) + 1\r\n \r\n\r\n for k, v in char_map_source.items():\r\n if v != char_map_dest.get(k, 0):\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\nprint(can_form(s1, s2, s3))", "s1=input()\r\ns2=input()\r\nt=input()\r\ns=s1+s2\r\nif len(s)!=len(t):\r\n print('NO')\r\nelse:\r\n for a in s:\r\n if t.find(a)==-1:\r\n print('NO')\r\n quit()\r\n else:\r\n t=t.replace(a,'',1)\r\n #print (a,s,t)\r\n print('YES')\r\n", "s1=input()\r\ns2=input()\r\ns3=sorted(input())\r\ns=sorted(s1+s2)\r\nl=[]\r\nt=[]\r\nfor i in s:\r\n if i not in l:\r\n l.append\r\n t.append(s.count(i))\r\nm=[]\r\nn=[]\r\nfor i in s3:\r\n if i not in m:\r\n m.append\r\n n.append(s3.count(i))\r\nif t==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\nb = input()\nc = input()\nc = list(c)\nif len(a + b) != len(c):\n print('NO')\nelse:\n \n v = list(a + b)\n v.sort()\n c.sort()\n if v == c:\n print('YES')\n else:\n print('NO')\n# Sat Jul 08 2023 15:09:33 GMT+0300 (Moscow Standard Time)\n", "s = input()\r\ns1 = input()\r\ns2 = input()\r\ns3 = s+ s1\r\ns2 = sorted(s2)\r\ns3 = sorted(s3)\r\nif(s2 == s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1=input()\r\ns2 = input()\r\ns3 = list(input())\r\ns1=list(s1+s2)\r\ns1.sort()\r\ns3.sort()\r\nif (s1==s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_restore_names(guest_name, host_name, pile_letters):\r\n guest_freq = {}\r\n host_freq = {}\r\n for letter in guest_name:\r\n guest_freq[letter] = guest_freq.get(letter, 0) + 1\r\n for letter in host_name:\r\n host_freq[letter] = host_freq.get(letter, 0) + 1\r\n for letter in pile_letters:\r\n if(letter in guest_freq and guest_freq[letter] > 0):\r\n guest_freq[letter] -= 1\r\n elif(letter in host_freq and host_freq[letter] > 0):\r\n host_freq[letter] -= 1\r\n else:\r\n return \"NO\" \r\n for freq in guest_freq.values():\r\n if(freq > 0):\r\n return \"NO\" \r\n for freq in host_freq.values():\r\n if(freq > 0):\r\n return \"NO\" \r\n return \"YES\" \r\nguest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\nresult = can_restore_names(guest_name, host_name, pile_letters)\r\nprint(result)\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\ns3 = sorted(s3)\r\ns1 = s1 + s2\r\ns1 = sorted(s1)\r\n\r\nif s1 == s3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "s=list(input())\r\ns1=list(input())\r\nl=list(input())\r\ns2=s+s1\r\ns2.sort()\r\nl.sort()\r\nm='YES'\r\nn='NO'\r\nif l==s2:\r\n print(m)\r\nelse:\r\n print(n)", "print(\"YES\") if sorted(list(input()+input())) == sorted(list(input())) else print(\"NO\")", "def solve(s1, s2, s):\r\n d = dict()\r\n for i in s1:\r\n if i in d:\r\n d[i] += 1 \r\n else:\r\n d[i] = 1 \r\n for i in s2:\r\n if i in d:\r\n d[i] += 1 \r\n else:\r\n d[i] = 1\r\n for i in s:\r\n if i in d:\r\n if d[i] > 1:\r\n d[i] -= 1 \r\n else:\r\n d.pop(i)\r\n else:\r\n return 'NO'\r\n if d:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\n\r\ns1 = input()\r\ns2 = input()\r\ns = input()\r\nprint(solve(s1, s2, s))\r\n", "l = [0] * 3\r\nfor i in range(3):\r\n l[i] = list(input()); l[i].sort()\r\nl3 = l[0] + l[1]; l3.sort()\r\nprint(['NO', 'YES'][l[2] == l3])", "# N = int(input())\r\n# N,M = map(int,input().split())\r\n# A = list(map(int,input().split()))\r\n\r\n\r\nx = input()\r\ny = input()\r\nz = input()\r\nd = [0] * 26\r\nfor c in x+y:\r\n d[ord(c)-65] += 1\r\n\r\nfor c in z:\r\n d[ord(c)-65] -= 1\r\n\r\nf = True\r\nfor i in range(26):\r\n if d[i] != 0:\r\n f = False\r\n break\r\nprint(\"YES\" if f else \"NO\")", "ab=(input())\r\nbc=(input())\r\nde=list(ab+bc)\r\ncd=list(input())\r\nde.sort()\r\ncd.sort()\r\ncd=\"\".join(cd)\r\nde=\"\".join(de)\r\nif cd==de:print(\"YES\")\r\nelse :print(\"NO\")\r\n\"\"\"\r\ndik={}\r\nfor x in range(65,91):\r\n dik[chr(x)]=0\r\ns=input()\r\ns+=input()\r\nz=input()\r\nfor x in z:\r\n dik[x]+=1\r\nfor x in s:\r\n if dik[x]==0:\r\n print(\"NO\")\r\n exit(0)\r\n else:\r\n dik[x]-=1\r\nfor x in dik:\r\n if dik[x]!=0:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n\"\"\"", "l1=[0,0,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\nl2=[0,0,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\ns1=input()\r\ns2=input()\r\ns3=input()\r\nfor i in s1:\r\n l1[ord(i)-65]+=1\r\nfor i in s2:\r\n l1[ord(i)-65]+=1\r\nfor i in s3:\r\n l2[ord(i)-65]+=1\r\nc=0\r\nfor i in range(26):\r\n if l1[i]!=l2[i]:\r\n c+=2\r\n break\r\nif c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns11 = s1+s2\r\ndef checking(s1,s2):\r\n count1 = {}\r\n count2 = {}\r\n for char in s1:\r\n count1[char] = count1.get(char,0) + 1\r\n\r\n for char in s2:\r\n count2[char] = count2.get(char,0) +1\r\n\r\n if count2 == count1:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nchecking(s11,s3)", "men = input() + input()\nmixed = input()\n\nif len(men) != len(mixed):\n print('NO')\n exit()\nelse:\n for c in men:\n if men.count(c) != mixed.count(c):\n print('NO')\n exit()\nprint('YES')\n\t\t \t\t \t\t \t \t \t \t \t\t", "from collections import Counter\r\n\r\ndef main():\r\n host = input()\r\n guess = input()\r\n mess = input()\r\n \r\n a = Counter(host+guess)\r\n b = Counter(mess)\r\n\r\n if a == b: \r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nmain() \r\n\r\n", "g = input()\r\nn = input()\r\ns = input()\r\na = g+n\r\nz = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\notv = \"YES\"\r\nfor i in range(len(z)):\r\n if s.count(z[i]) == a.count(z[i]):\r\n continue\r\n else:\r\n otv = \"NO\" \r\n break\r\n\r\n\r\n\r\nprint(otv)\r\n \r\n \r\n ", "q,w=sorted,input\r\nprint('YNEOS'[q(w()+w())!=q(w())::2])", "s,j=sorted,input;print('YNEOS'[s(j()+j())!=s(j())::2])", "name = list(input())\r\nresidenceHost = list(input())\r\npileOfLetters = list(input())\r\n\r\ncombinedLetters = name + residenceHost\r\ncombinedLetters.sort()\r\npileOfLetters.sort()\r\n\r\nif combinedLetters == pileOfLetters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "name1 = input()\r\nlistname1 = list(name1)\r\nname2 = input()\r\nlistname2 = list(name2)\r\nscrambled = input()\r\nlistscrambled = list(scrambled)\r\nlistscrambled.sort()\r\nletters = listname1 + listname2\r\nletters.sort()\r\nif listscrambled == letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\r\nhost = input()\r\npile = input()\r\nconcat = guest+host\r\nif ''.join(sorted(concat))==''.join(sorted(pile)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\nmerge = input()\r\n\r\ns = guest_name + host_name\r\n\r\na = [0] * 26\r\nfor c in s:\r\n a[ord(c) - ord('A')] += 1\r\n\r\nb = [0] * 26\r\nfor c in merge:\r\n b[ord(c) - ord('A')] += 1\r\n\r\nres = \"YES\"\r\nfor i in range(26):\r\n if a[i] != b[i]:\r\n res = \"NO\"\r\n break\r\n\r\nprint(res)\r\n", "a=input()\r\nb=input()\r\nc=input()\r\na=a+b\r\na=sorted(a)\r\nc=sorted(c)\r\nif a==c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n# Sat Jul 08 2023 11:47:40 GMT+0300 (Moscow Standard Time)\n", "str1,str2,str3 = input(),input(),input()\r\nres = str1+str2\r\nsorted_res = sorted(res)\r\nsorted_3 = sorted(str3)\r\nif(sorted_res == sorted_3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "g = list(input())\r\nh = list(input())\r\np = list(input())\r\ns = g+h\r\ns.sort()\r\np.sort()\r\nif s == p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\none=[]\r\npilelist=[]\r\nu=0\r\n\r\nfirst=input()\r\nsecond=input()\r\npile=input()\r\n\r\nfor x in first:\r\n one.append(x)\r\n\r\nfor y in second:\r\n one.append(y)\r\n\r\nfor z in pile:\r\n pilelist.append(z)\r\n\r\none.sort()\r\npilelist.sort()\r\n\r\nif one==pilelist:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s1 = input() \r\ns2 = input() \r\ns = input() \r\nr1 = sorted(s1 + s2)\r\nr2 = sorted(s)\r\nif r1 == r2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1 = input()\nn2 = input()\nc = input()\ndef count_letters(n):\n lc = {}\n for l in n:\n lc[l] = lc.get(l, 0) + 1\n return lc\nnc1 = count_letters(n1)\nnc2 = count_letters(n2)\nc2 = count_letters(c)\ndef can(gc, hc, cc):\n for l, count in gc.items():\n if l not in cc or cc[l] < count:\n return False\n cc[l] -= count\n for l, count in hc.items():\n if l not in cc or cc[l] < count:\n return False\n cc[l] -= count\n for count in cc.values():\n if count != 0:\n return False\n return True\nif can(nc1, nc2, c2):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from collections import Counter\r\n\r\nguest_name = input()\r\nhost_name = input()\r\nletters_pile = input()\r\n\r\ncombined_name = guest_name + host_name\r\n\r\nguest_name_count = Counter(guest_name)\r\nhost_name_count = Counter(host_name)\r\ncombined_name_count = Counter(combined_name)\r\n\r\nletters_pile_count = Counter(letters_pile)\r\n\r\nif combined_name_count == letters_pile_count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nd = dict()\r\nfor c in a:\r\n if c in d:\r\n d[c] += 1\r\n else:\r\n d[c] = 1\r\nfor c in b:\r\n if c in d:\r\n d[c] += 1\r\n else:\r\n d[c] = 1\r\nmix = input()\r\nans = True\r\nfor c in mix:\r\n if c not in d:\r\n ans = False\r\n break\r\n d[c] -= 1\r\n\r\nif not ans:\r\n print(\"NO\")\r\nelse:\r\n for v in d.values():\r\n if v != 0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "n=input()\r\nm=input()\r\nj=list(input())\r\nmn=list(n+m)\r\nj.sort()\r\nmn.sort()\r\n\r\nif j==mn :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "names = []\r\nnames.extend(input())\r\nnames.extend(input())\r\nnames.sort()\r\nq = []\r\nq.extend(input())\r\nq.sort()\r\nif names == q:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def freq(l):\r\n d = {}\r\n for i in l:\r\n d[i] = d.get(i,0) + 1\r\n return d\r\n \r\na = input() + input()\r\nb = input()\r\nd1 = freq(a)\r\nd2 = freq(b)\r\nif d1 == d2:\r\n print('YES')\r\nelse:\r\n print('NO')", "import string\r\nimport sys\r\nh=input()\r\ng=input()\r\np=input()\r\nfor i in string.ascii_uppercase:\r\n if h.count(i)+g.count(i)!=p.count(i):\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")\r\n ", "a=input()\r\nb=input()\r\nc=input()\r\nab=list(a+b)\r\nab.sort()\r\nc=list(c)\r\nc.sort()\r\nprint(\"YES\" if ''.join(ab)==''.join(c) else \"NO\")\r\n", "import sys\r\n\r\na = sys.stdin.readline().strip()\r\nb = sys.stdin.readline().strip()\r\nc = sys.stdin.readline().strip()\r\n\r\ndata = {}\r\nfor chr in c:\r\n if chr in data:\r\n data[chr] += 1\r\n else:\r\n data[chr] = 1\r\n\r\ndef func(arr):\r\n for chr in arr:\r\n if chr not in data:\r\n return False\r\n else:\r\n data[chr] -= 1\r\n return True\r\n\r\nflag = True\r\nflag = flag and func(a) and func(b)\r\n\r\nfor _, val in data.items():\r\n if val !=0:\r\n flag = False\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "def check_names(guest_name, host_name, pile_letters):\r\n # Count the frequency of letters in guest's name\r\n guest_count = {}\r\n for letter in guest_name:\r\n guest_count[letter] = guest_count.get(letter, 0) + 1\r\n \r\n # Count the frequency of letters in host's name\r\n host_count = {}\r\n for letter in host_name:\r\n host_count[letter] = host_count.get(letter, 0) + 1\r\n\r\n # Count the frequency of letters in the pile\r\n pile_count = {}\r\n for letter in pile_letters:\r\n pile_count[letter] = pile_count.get(letter, 0) + 1\r\n\r\n # Check if all the letters in guest's name are present in the pile\r\n for letter in guest_name:\r\n if letter not in pile_count or guest_count[letter] > pile_count[letter]:\r\n return False\r\n\r\n # Check if all the letters in host's name are present in the pile\r\n for letter in host_name:\r\n if letter not in pile_count or host_count[letter] > pile_count[letter]:\r\n return False\r\n\r\n # Check if there are no extra letters in the pile\r\n for letter in pile_count:\r\n if letter not in guest_count and letter not in host_count:\r\n return False\r\n if pile_count[letter] > guest_count.get(letter, 0) + host_count.get(letter, 0):\r\n return False\r\n\r\n return True\r\n\r\n# Example usage:\r\nif __name__ == \"__main__\":\r\n guest_name = input().strip()\r\n host_name = input().strip()\r\n pile_letters = input().strip()\r\n if check_names(guest_name, host_name, pile_letters):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "g=input()\r\nh=input()\r\np=input()\r\nc=g+h\r\nif sorted(c)==sorted(p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\na = a + b\r\na = sorted(a)\r\nc = sorted(c)\r\nif a == c:\r\n print('YES')\r\nelse:\r\n print('NO')\n# Sat Jul 08 2023 10:08:53 GMT+0300 (Moscow Standard Time)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Aug 4 10:17:52 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nguest = input()\r\nhost = input()\r\npile = sorted(list(input()))\r\n\r\ndoor = sorted(list(guest) + list(host))\r\n\r\nif pile == door:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = s1+s2\r\ns1 = ''.join(sorted(s))\r\ns2 = ''.join(sorted(s3))\r\nif s1 == s2:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\nb = input()\nc = input()\nx = a + b\nif sorted(x) == sorted(c):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n\n\n \t \t \t \t\t \t \t\t\t\t\t\t \t", "a = input()\r\nb = input()\r\nc = input()\r\nd = sorted(a + b)\r\ne = sorted(c)\r\nif d == e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "p=input()\r\nr=input()\r\nd=input()\r\na=p+r\r\nfor i in range(len(a)):\r\n if a.count(a[i])!=d.count(a[i]):\r\n print('NO')\r\n exit(0)\r\nif len(a) == len(d):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "name_1 = input()\r\nname_2 = input()\r\nnames = name_1+name_2\r\npile = list(input())\r\nbreakout = False\r\nfor x in names:\r\n if x in pile:\r\n pile.remove(x)\r\n else:\r\n print('NO')\r\n breakout = True\r\n break\r\nif breakout == False:\r\n if len(pile) != 0:\r\n print('NO')\r\n else:\r\n print('YES')", "q=input()\r\nq+=input()\r\nq=list(q)\r\ns=list(input())\r\nq.sort()\r\ns.sort()\r\nif len(s)!=len(q):\r\n print('NO')\r\n exit(0)\r\nfor i in range(len(s)):\r\n if s[i]!=q[i]:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "a = input()\r\nb = input()\r\nc = input()\r\ns = a+b\r\ns = ''.join(sorted(s))\r\nc = ''.join(sorted(c))\r\n\r\nif s==c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "def can_form_names(guest, host, pile):\r\n combined_names = guest + host\r\n \r\n for char in combined_names:\r\n if char not in pile:\r\n return \"NO\"\r\n pile = pile.replace(char, '', 1) \r\n\r\n if len(pile) > 0:\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\nguest = input()\r\nhost = input()\r\npile = input()\r\n\r\nresult = can_form_names(guest, host, pile)\r\nprint(result)\r\n", "a=input()\r\nb=input()\r\nd=input()\r\nlist1=list(a)\r\nlist2=list(b)\r\nlist4=list1+list2\r\nlist4=sorted(list4)\r\nlist3=list(d)\r\nlist3=sorted(list3)\r\nif(list4==list3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=str(input())\r\nb=str(input())\r\nbyk=str(input())\r\narr=[]\r\ntes=[]\r\nf=0\r\nfor i in a:\r\n arr.append(i)\r\nfor i in b:\r\n arr.append(i)\r\nfor i in byk:\r\n tes.append(i)\r\nfor i in arr:\r\n if tes.count(i)<arr.count(i):\r\n f+=1\r\nif f==0 and len(arr)==len(tes):\r\n print(\"YES\")\r\nelse: print(\"NO\")", "g = input()\r\nb = input()\r\nc = input()\r\na = [0]*26\r\ny = g + b\r\nfor i in range(len(c)):\r\n a[ord(c[i])-ord(\"A\")] += 1 \r\nfor i in range(len(y)):\r\n if a[ord(y[i])-ord(\"A\")] <= 0:\r\n ot = \"NO\"\r\n break\r\n else:\r\n a[ord(y[i])-ord(\"A\")] -= 1\r\n ot = \"YES\"\r\nif len(c) != len(y):\r\n ot = \"NO\"\r\n\r\nprint(ot)", "a = input()\r\nb = input()\r\nc = input()\r\ndic = dict()\r\nfor i in range(len(a)):\r\n if a[i] not in dic:\r\n dic[a[i]] = 1 \r\n else:\r\n dic[a[i]] += 1 \r\n\r\nfor i in range(len(b)):\r\n if b[i] not in dic:\r\n dic[b[i]] = 1 \r\n else:\r\n dic[b[i]] += 1 \r\n\r\nfor i in range(len(c)):\r\n if c[i] not in dic:\r\n print('NO')\r\n exit()\r\n else:\r\n dic[c[i]] -= 1\r\nfor k,i in dic.items():\r\n if i != 0:\r\n print('NO')\r\n exit()\r\nprint('YES')", "p=input()\r\nq=input()\r\nr=input()\r\ns=r\r\nflag=0\r\n\r\nfor i in range(len(p)):\r\n if p[i] in r:\r\n r=r.replace(p[i], \"\", 1)\r\n else:\r\n flag=1\r\n break\r\nfor i in range(len(q)):\r\n if q[i] in r:\r\n r=r.replace(q[i], \"\", 1)\r\n else:\r\n flag=1\r\n break\r\n#print(len(p)+len(q))\r\n#print(len(r))\r\nif flag==1 :\r\n print(\"NO\")\r\nelif (len(p)+len(q))!=len(s):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s1=input()\r\ns2=input()\r\ns0=s1+s2\r\ns=list(s0)\r\ns=sorted(s)\r\ns1=''.join(s)\r\ns2=input()\r\ns=list(s2)\r\ns=sorted(s)\r\ns2=''.join(s)\r\nif (s1==s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "name1 = list(input())\r\nname2 = list(input())\r\nword = list(input())\r\nname1 += name2\r\nfor l in name1:\r\n if l in word:\r\n word.remove(l)\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('NO') if word else print('YES')", "#--------------------------------------AUTHOR:SRI_HARSHA---------------------------------------------#\nfrom itertools import * \nfrom functools import *\nfrom math import *\nfrom collections import *\nimport sys\nfrom io import BytesIO, IOBase\nimport os\n\nBUFSIZE = 8192\nclass FastIO(IOBase):\n newlines = 0\n def __init__(self, file):\n self._file = file\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\nglobal input \ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n#--------------------------------INPUTS----------------------------------------#\ndef gip():\n return int(input())\ndef sip():\n return input()\n\ndef gi():\n return map(int,input().split())\ndef gs():\n return map(str,input().split())\ndef gli():\n return list(map(int,input().split()))\ndef gls():\n return list(map(str,input().split()))\n\ndef gmat(n):\n mat = []\n for i in range(n):\n mat.append(list(map(int,input().split())))\n return mat \ndef gsmat(n):\n mat = []\n for i in range(n):\n mat.append(list(map(str,input().split())))\n return mat\n\ndef getalpha():\n return ['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']\ndef getvowels():\n return ['a','e','i','o','u']\n\ndef getdic(s,dic):\n for i in s:\n if i not in dic:\n dic[i]=1\n else:\n dic[i]+=1\n return dic\n \n\n#-------------------------------------FUNCTIONS--------------------------------#\ndef isprime(n):\n flag=0\n if n>1:\n for i in range(2, int(sqrt(n))+1):\n if n%i==0:\n flag=1\n break\n if flag==0:\n return True\n else:\n return False\n else:\n return False\n\ndef binarytodecimal(n):\n return int(n,2)\n\ndef gcdarr(arr):\n x=0\n for i in arr:\n x=gcd(x,i)\n return x\n\n#----------------------------------SOLUTION-----------------------------------#\ndef func(a,b,c):\n temp1=a+b\n temp1=sorted(temp1)\n c=sorted(c)\n if temp1==c:\n return \"YES\"\n return \"NO\" \n#for _ in range(int(input())):\n #inputs\na=sip()\nb=sip()\nc=sip()\nprint(func(a,b,c))\n\t\t\t\t\t\t\t \t \t \t \t \t \t\t", "\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\ns=s1+s2\r\ns=list(s)\r\ns3=list(s3)\r\ns.sort()\r\ns3.sort()\r\nif s==s3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A=input()\r\nB=input()\r\nC=input()\r\n\r\nif sorted(A+B) == sorted(C):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "x = [0 for i in range(91)]\r\ny = [0 for i in range(91)]\r\n\r\ns = input()\r\nn = list(s)\r\n\r\nfor i in n:\r\n x[ord(i)] += 1\r\n\r\ns = input()\r\nn = list(s)\r\n\r\nfor i in n:\r\n x[ord(i)] += 1\r\n\r\ns = input()\r\nn = list(s)\r\n\r\nfor i in n:\r\n y[ord(i)] += 1\r\n\r\nans = True\r\n\r\nfor i in range(65,91):\r\n if x[i] != y[i]:\r\n ans = False\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = list(input().lower())\r\nb = list(input().lower())\r\na = list(input().lower())\r\nprint(\"YES\" if sorted(s+b)==sorted(a) else \"NO\")", "\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nres_str=str(s1+s2)\r\nfull_str1=''.join(sorted(res_str))\r\nfull_str2=''.join(sorted(s3))\r\n\r\nif(full_str1==full_str2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = (input())\r\na = (input())\r\nb = list(input())\r\nc = s+a\r\nc = list(c)\r\nc.sort()\r\nb.sort()\r\nif c==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nt = input()\r\ndat = []\r\n\r\nfor ele in s:\r\n dat.append(ele)\r\nfor char in t:\r\n dat.append(char)\r\n\r\n\r\nx = input()\r\ncheck = []\r\nfor y in x:\r\n check.append(y)\r\n \r\ndat.sort()\r\ncheck.sort()\r\n\r\nif dat == check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name_guest=input()\r\nname_host=input()\r\nname_shuffled=input()\r\ncan=True\r\nfor i in name_shuffled:\r\n if i in name_guest:\r\n name_guest=name_guest.replace(i,\"\",1)\r\n elif i in name_host:\r\n name_host=name_host.replace(i,\"\",1)\r\n else:\r\n can=False\r\n break\r\nif(can and len(name_host)==0 and len(name_guest)==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=list(input()+input())\r\npile =list(input())\r\nl.sort()\r\npile.sort()\r\nif l==pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nfor i in b:\r\n a.append(i)\r\na.sort()\r\nc = list(input())\r\nc.sort()\r\nif a == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nl1 = [i for i in s1]\r\nl2 = [j for j in s2]\r\nl1.extend(l2)\r\nk = sorted(l1)\r\nm = ''.join(k)\r\nn1 = sorted(s3)\r\nn = ''.join(n1)\r\nif m == n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\np1 = input()\r\np2 = input()\r\np3 = sorted(input())\r\np12 = sorted(p2 + p1)\r\nif p12 == p3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\ny=input()\nz=input()\n\nx=x+y\n\nx=list(x)\nz=list(z)\n\nx.sort()\nz.sort()\n\nif x==z:\n print(\"YES\")\n\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", "a=input()\r\nb=input()\r\nc=sorted(list(a+b))\r\nx=sorted(list(input()))\r\nif(c==x):\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "g = list(map(str,input().strip()))\r\nh = list(map(str,input().strip()))\r\nj = sorted(list(map(str,input().strip())))\r\njnew = sorted(g+h)\r\nif(jnew == j):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_permutation(guest_name, host_name, pile_letters):\r\n combined_names = guest_name + host_name\r\n freq_count = {}\r\n \r\n # Count the occurrences of each letter in the combined names\r\n for letter in combined_names:\r\n freq_count[letter] = freq_count.get(letter, 0) + 1\r\n \r\n # Verify the pile of letters against the frequency count\r\n for letter in pile_letters:\r\n if letter in freq_count and freq_count[letter] > 0:\r\n freq_count[letter] -= 1\r\n else:\r\n return \"NO\"\r\n \r\n # Check if any letters are remaining in the frequency count\r\n for count in freq_count.values():\r\n if count > 0:\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\n# Example usage\r\nguest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\nresult = check_permutation(guest_name, host_name, pile_letters)\r\nprint(result)\r\n", "from collections import Counter\r\n\r\nletters = Counter(input())\r\nletters.update(Counter(input()))\r\n\r\nthing = {}\r\nthird = input()\r\nfor i in range(len(third)):\r\n if third[i] not in thing:\r\n thing[third[i]] = -1\r\n else:\r\n thing[third[i]] -= 1\r\n\r\nproblem = True\r\nletters.update(thing)\r\nfor i in letters.values():\r\n if i != 0:\r\n problem = False\r\n\r\nif problem:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "v=input()\r\nv1=input()\r\nv2=input()\r\nv3=v+v1\r\nv4=sorted(v3)\r\nv5=sorted(v2)\r\nif v4==v5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "# بسم الله (accepted)\r\n# make sure that string3 can be used to produce string2 and string1 , and string3 is not left with any extra letter\r\n\r\nstring1 = input()\r\nlist1 = []\r\nfor item in string1 :\r\n list1.append(item)\r\nstring2 = input()\r\nlist2 = []\r\nfor item in string2 :\r\n list2.append(item)\r\nstring3 = input()\r\nlist3 = []\r\nfor item in string3 :\r\n list3.append(item)\r\nif len(string1) + len(string2) != len(string3) :\r\n print('NO')\r\nelif sorted((list1 + list2))== sorted(list3) :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n", "a = input()\r\nb = input()\r\nc = input()\r\n\r\nif len(c) == len(a)+len(b):\r\n a+=b\r\n a = ''.join(sorted(a))\r\n c = ''.join(sorted(c))\r\n if a==c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\na=list(a)\r\nb=list(b)\r\nc=list(c)\r\nx=a[:len(a)]+b[:len(b)]\r\ny=c[:len(c)]\r\nx.sort()\r\ny.sort()\r\nif(x==y):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest=input()\r\nhost=input()\r\nletters=[i for i in input()]\r\n\r\ndef judge(guest,host,letters):\r\n for i in guest:\r\n if i in letters:\r\n letters.remove(i)\r\n else:\r\n return(\"NO\")\r\n for i in host:\r\n if i in letters:\r\n letters.remove(i)\r\n else:\r\n return(\"NO\")\r\n if len(letters)==0:\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\n\r\nprint(judge(guest,host,letters))", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\nimport math\r\nimport re\r\nimport random\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n host = input()\r\n guest = input()\r\n shuffled = input()\r\n host = sorted(host+guest)\r\n shuffled = sorted(shuffled)\r\n if(host==shuffled): print(\"YES\")\r\n else: print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "# Read input\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile_of_letters = input().strip()\r\n\r\n# Concatenate the guest's name and host's name\r\nnames_concatenated = guest_name + host_name\r\n\r\n# Create a dictionary to count letter frequencies\r\nletter_counts = {}\r\nfor letter in names_concatenated:\r\n letter_counts[letter] = letter_counts.get(letter, 0) + 1\r\n\r\n# Process the pile of letters\r\nfor letter in pile_of_letters:\r\n if letter in letter_counts and letter_counts[letter] > 0:\r\n letter_counts[letter] -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n # Check if all letter counts are zero\r\n if all(count == 0 for count in letter_counts.values()):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n1=input()\r\nn2=input()\r\nres=input()\r\nresult=n1+n2\r\nflag=0\r\nif len(n1)+len(n2)!=len(res):\r\n flag=1\r\nelse:\r\n for i in res:\r\n if res.count(i)==result.count(i):\r\n flag=0\r\n else:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1=input().lower()\r\ns2=input().lower()\r\n \r\nstring=input().lower()\r\nl=[0]*26\r\n \r\nfor i in range(len(s1)):\r\n l[ord(s1[i])-97]+=1\r\n \r\nfor i in range(len(s2)):\r\n l[ord(s2[i])-97]+=1\r\n \r\nt=0\r\n \r\n \r\nfor i in range(len(string)):\r\n \r\n if l[ord(string[i])-97]!=0:\r\n l[ord(string[i])-97]-=1\r\n \r\n else:\r\n t=1\r\n break\r\n \r\nif t==1:\r\n \r\n print(\"NO\")\r\n \r\nelif t==0 and max(l)==0:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n ", "s1=list(input())\r\ns2=list(input())\r\nans=list(input())\r\ns=s1+s2\r\ns.sort()\r\nans.sort()\r\nif s==ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "guest_name = input()\r\nhost_name = input()\r\nletters = input()\r\n\r\nnames = guest_name + host_name\r\n\r\nif sorted(names) == sorted(letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\ny = input()\r\nz = input()\r\ni = 0\r\nif len(z) == len (x) + len(y):\r\n while i < len(z):\r\n if x.find(z[i]) != -1: # if 0 = false\r\n x = x.replace(z[i] , '' , 1)\r\n i += 1\r\n elif y.find(z[i]) != -1:\r\n y = y.replace(z[i] , '' , 1)\r\n i += 1\r\n else:\r\n break\r\n if len(x) + len(y) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")#special case", "from collections import Counter\r\n\r\ndef solve(s, s3):\r\n l1 = [s[i] for i in range(len(s))]\r\n l2 = [s3[i] for i in range(len(s3))]\r\n s1 = set(l1)\r\n s2 = set(l2)\r\n if(len(l1) != len(l2)):\r\n return \"NO\"\r\n for i in s1:\r\n if(l1.count(i) != l2.count(i)):\r\n return \"NO\"\r\n return \"YES\"\r\n\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = s1 + s2\r\nprint(solve(s, s3))", "\r\nfirst_noun = input()\r\nsecond_noun = input()\r\nthird_noun = input()\r\n\r\ndef verify_nouns(first_noun, second_noun, third_noun):\r\n mix_nouns = first_noun + second_noun\r\n mix_nouns = sorted(mix_nouns)\r\n third_noun = sorted(third_noun)\r\n \r\n if mix_nouns == third_noun:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nverify_nouns(first_noun, second_noun, third_noun)", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b\r\nd1={}\r\nd2={}\r\nfor i in d:\r\n if i not in d1:\r\n d1[i]=1\r\n else:\r\n d1[i]+=1\r\nfor i in c:\r\n if i not in d2:\r\n d2[i]=1\r\n else:\r\n d2[i]+=1\r\nif d1==d2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\nguest_frequency = {}\r\nhost_frequency = {}\r\n\r\nfor letter in guest_name:\r\n guest_frequency[letter] = guest_frequency.get(letter, 0) + 1\r\n\r\nfor letter in host_name:\r\n host_frequency[letter] = host_frequency.get(letter, 0) + 1\r\nfor letter in pile_letters:\r\n if letter not in guest_frequency and letter not in host_frequency:\r\n print(\"NO\")\r\n break\r\n elif letter in guest_frequency and guest_frequency[letter] > 0:\r\n guest_frequency[letter] -= 1\r\n elif letter in host_frequency and host_frequency[letter] > 0:\r\n host_frequency[letter] -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n if any(value > 0 for value in guest_frequency.values()) or any(value > 0 for value in host_frequency.values()):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "guest_name = input()\r\nhost_name = input()\r\npile = input()\r\n\r\n# Concatenate the guest's and host's names and sort the letters in the resulting string\r\n# Also sort the letters in the pile\r\nsorted_names = sorted(guest_name + host_name)\r\nsorted_pile = sorted(pile)\r\n\r\n# Check if the sorted pile is a permutation of the sorted names\r\nif sorted_names == sorted_pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nab = input()\r\nmix = a + b\r\nif len(mix) != len(ab):\r\n print('NO')\r\n exit()\r\nelse:\r\n for i in mix:\r\n if mix.count(i) != ab.count(i):\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n\r\n", "from collections import Counter\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\na = Counter(s1 + s2)\r\nb = Counter(s3)\r\nif len(b - a) == 0 and len(a - b) == 0:\r\n print('YES')\r\nelse:\r\n print(('NO'))", "guestName = input()\r\nhostName = input()\r\nletters = input()\r\n\r\n#We will use sorting to check if they are same\r\nnames = sorted(list(guestName+hostName))\r\nletterLst = sorted(list(letters))\r\n\r\nif names == letterLst:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nc = input()\r\na = sorted(a + b)\r\nc = sorted(c)\r\nif a == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\ns12 = sorted(s1+s2)\r\ns3 = sorted(s3)\r\nif s12 == s3:\r\n print('YES')\r\nelse:\r\n print('NO')", "def LetterFrequency(s1,s2,s3):\r\n freqArray=[0]*26\r\n if (len(s1)+len(s2)!=len(s3)):\r\n return \"NO\"\r\n for i in range(len(s1)):\r\n freqArray[ord(s1[i])-ord('A')]+=1\r\n for i in range(len(s2)):\r\n freqArray[ord(s2[i])-ord('A')]+=1\r\n for i in range(len(s3)):\r\n freqArray[ord(s3[i])-ord('A')]-=1\r\n for i in freqArray:\r\n if i !=-0:\r\n return \"NO\"\r\n return \"YES\"\r\nprint(LetterFrequency(input(),input(),input()))", "a = list(input() + input())\nb = list(input())\na.sort()\nb.sort()\nif a == b:\n print('YES')\nelse:\n print('NO')", "S = input()\r\nT = input()\r\ndat = []\r\n\r\nfor ele in S:\r\n dat.append(ele)\r\nfor char in T:\r\n dat.append(char)\r\n\r\n\r\nX = input()\r\ncheck = []\r\nfor Y in X:\r\n check.append(Y)\r\n\r\ndat.sort()\r\ncheck.sort()\r\n\r\nif dat == check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nx = input()\r\ns = input()\r\nans = \"YES\"\r\nif len(n+x) != len(s):\r\n\tans = (\"NO\")\r\nelse:\r\n\tfor i in (n+x):\r\n\t\tif (n+x).count(i) != s.count(i):\r\n\t\t\tans = (\"NO\")\r\n\t\t\tbreak\r\nprint(ans)", "f = list(input())\r\ns = list(input())\r\nt = list(input())\r\ndef check(f,s,t):\r\n for l in f:\r\n if l in t:\r\n t.remove(l)\r\n continue\r\n else:\r\n return \"NO\"\r\n break\r\n for ll in s:\r\n if ll in t:\r\n t.remove(ll)\r\n continue\r\n else:\r\n return \"NO\"\r\n break\r\n if len(t) == 0:\r\n return\"YES\"\r\n else:\r\n return\"NO\"\r\nprint(check(f,s,t))", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nd = a+b\r\nc.sort()\r\nd.sort()\r\nif c == d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print(\"YES\") if (sorted(input()+input())) == (sorted(input())) else print(\"NO\")\r\n", "s_1 = input()\r\ns_2 = input()\r\ner_tx = input()\r\n\r\ns_3 = s_1 + s_2\r\n\r\nx_3 = sorted(s_3)\r\nar_s = sorted(er_tx)\r\n\r\ncount = 0\r\n\r\nif len(x_3) == len(ar_s):\r\n for i in range(len(x_3)):\r\n if x_3[i] != ar_s[i]:\r\n print('NO')\r\n break\r\n\r\n else:\r\n count += 1\r\n\r\nelse:\r\n print('NO')\r\n\r\nif count == len(x_3):\r\n print('YES')\r\n\r\n", "a, b, c=input(), input(), input()\r\nif sorted(a+b)==sorted(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def get_args():\r\n lines = 3\r\n rs = []\r\n for i in range(lines):\r\n rs.append((input()))\r\n return rs\r\n\r\n\r\ndef main():\r\n lines = get_args()\r\n name_1 = lines[0]\r\n name_2 = lines[1]\r\n pile = lines[2]\r\n if len(name_1) + len(name_2) != len(pile):\r\n print(\"NO\")\r\n else:\r\n d = {}\r\n for c in pile:\r\n if c in d:\r\n d[c] += 1\r\n else:\r\n d[c] = 1\r\n for c in name_1:\r\n if c in d and d[c] > 0:\r\n d[c] -= 1\r\n else:\r\n print(\"NO\")\r\n return \r\n for c in name_2:\r\n if c in d and d[c] > 0:\r\n d[c] -= 1\r\n else:\r\n print(\"NO\")\r\n return \r\n print(\"YES\")\r\n\r\n\r\nmain()\r\n", "a = input()+input()\nb = input()\nif sorted(a)==sorted(b):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t\t \t\t \t \t \t\t \t \t\t\t", "guest = list(str(input()))\r\nhost = list(str(input()))\r\nletters = list(str(input()))\r\n\r\ncombined = guest + host\r\ncombined.sort()\r\nletters.sort()\r\n\r\nif combined == letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "word1=[]\r\nword2=[]\r\nword3=[]\r\nfor i in range(3):\r\n line = input()\r\n if i == 0:\r\n for letter in line:\r\n word1.append(letter) \r\n elif i == 1:\r\n for letter in line:\r\n word2.append(letter)\r\n else:\r\n for letter in line:\r\n word3.append(letter)\r\n\r\nword = word1+word2\r\nword.sort()\r\nword3.sort()\r\nif word==word3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nl=[]\r\ns=[]\r\nfor i in a:\r\n l.append(i)\r\nb=input()\r\nfor i in b:\r\n l.append(i)\r\nc=input()\r\nfor i in c:\r\n s.append(i)\r\nc=0\r\nfor i in range(len(l)):\r\n if l.count(l[i])==s.count(l[i]):\r\n c+=1\r\nif c==len(l) and c==len(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\n\r\na=list(input())\r\na.extend(list(input()))\r\nc=list(input())\r\n\r\nc=sorted(c)\r\na=sorted(a)\r\nif a==c:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile = input()\r\npile_list = [ch for ch in pile]\r\ninscriptions = guest_name + host_name\r\ninscriptions_list = [ch for ch in inscriptions]\r\noutput = \"YES\"\r\nfor ch in inscriptions_list:\r\n if ch in pile_list:\r\n pile_list.remove(ch)\r\n else:\r\n output = \"NO\"\r\nif len(pile_list) != 0:\r\n output = \"NO\"\r\nprint(output)", "a = input()\r\nb = input()\r\nc = input()\r\nd=[];f=[]\r\nfor i in a:\r\n d.append(i)\r\nfor i in b:\r\n d.append(i)\r\nd.sort()\r\nh=\"\".join(d)\r\nfor i in c:\r\n f.append(i)\r\nf.sort()\r\ni=\"\".join(f)\r\nif h==i:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print ([\"NO\", \"YES\"][sorted(input()+input()) == sorted(input())])", "x, y = input()+input(), input()\r\nif sorted(list(x)) == sorted(list(y)): print(\"YES\")\r\nelse: print(\"NO\")", "\r\n\r\nn1=input()\r\nn2=input()\r\nn3=input()\r\nl1=[]\r\nl2=[]\r\n\r\nfor d in n3:\r\n l2.append(d)\r\nfl=True\r\nfor i in n1:\r\n if i in l2:\r\n l2.remove(i)\r\n elif i not in l2:\r\n fl=False\r\nfor j in n2:\r\n if j in l2:\r\n l2.remove(j)\r\n elif j not in l2:\r\n fl=False\r\n\r\nif fl==True and len(l2)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = []\r\ng = []\r\nans = 'YES'\r\nfor i in range(len(a)):\r\n d.append(a[i])\r\nfor i in range(len(b)):\r\n d.append(b[i])\r\nfor i in range(len(c)):\r\n g.append(c[i])\r\ng.sort()\r\nd.sort()\r\nif len(g) != len(d):\r\n print('NO')\r\nelse:\r\n for i in range(len(g)):\r\n if g[i] != d[i]:\r\n ans = 'NO'\r\n print(ans)\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = {}\r\ne = {}\r\nfor i in a:\r\n if i in d:\r\n d[i] = d[i] + 1\r\n else:\r\n d[i] = 1\r\nfor i in b:\r\n if i in d:\r\n d[i] = d[i] + 1\r\n else:\r\n d[i] = 1\r\nfor i in c:\r\n if i in e:\r\n e[i] = e[i] + 1\r\n else:\r\n e[i] = 1\r\nif d == e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "e=input()\r\nr=input()\r\nd=input()\r\nif sorted(d)==sorted(e+r):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\nstr1 = \"\"\r\nfor x in range(2):\r\n str1 += read_input()\r\nlist1 = list(str1)\r\nlist2 = list(read_input())\r\nlist1.sort()\r\nlist2.sort()\r\nif list1 == list2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\r\nhost = input()\r\npile = input()\r\n\r\nif sorted(guest + host) == sorted(pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=str(input())\r\nb=str(input())\r\nc=str(input())\r\nl=[]\r\nd=0\r\nfor i in range(0,len(a)):\r\n l.append(a[i])\r\nfor i in range(0,len(b)):\r\n l.append(b[i])\r\nfor i in range(0,len(c)):\r\n if c[i] in l:\r\n d+=1\r\n l.remove(c[i]) \r\nif (d== len(a)+len(b)) and len(c)==d :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\") \r\n\r\n", "a = [i for i in input()]\r\nb = [i for i in input()]\r\ns = [i for i in input()]\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(a)):\r\n if a[i] in s:\r\n del s[s.index(a[i])]\r\n count1 += 1\r\nfor i in range(len(b)):\r\n if b[i] in s:\r\n del s[s.index(b[i])]\r\n count2 += 1\r\nif count1 == len(a) and count2 == len(b) and len(s) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l1 = list(input())\r\nl2 = list(input())\r\nl = list(input())\r\nl.sort()\r\na1 = ''.join(l)\r\na2 = l1 + l2\r\na2.sort()\r\na2 = ''.join(a2)\r\nif a2 == a1:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\n\r\ndef main():\r\n a = input()\r\n b = input()\r\n c = input()\r\n a = Counter(a)\r\n b = Counter(b)\r\n c = Counter(c)\r\n print(\"YES\" if a + b == c else \"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=list(input().strip())\r\nb=list(input().strip())\r\nc=list(input().strip())\r\nc.sort()\r\nc2=a+b\r\nc2.sort()\r\nif c2==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "w=input()\r\nv=input()\r\nx=input()\r\nb=[]\r\nfor i in w:\r\n b.append(i)\r\nfor i in v:\r\n b.append(i)\r\ndef fu():\r\n for i in x:\r\n try:\r\n b.remove(i)\r\n except:return 'NO'\r\n if len(b) == 0:return 'YES' \r\n return 'NO'\r\nprint(fu())\r\n", "x=sorted(list(input()))\r\ny=sorted(list(input()))\r\nx.extend(y)\r\nx.sort()\r\nz=sorted(list(input()))\r\nprint('YNEOS'[z!=x::2])\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nli = []\r\nlis = []\r\nfor i in range(len(a)):\r\n li.append(a[i])\r\nfor i in range(len(b)):\r\n li.append(b[i])\r\nfor i in range(len(c)):\r\n lis.append(c[i])\r\nli.sort()\r\nlis.sort()\r\nif(len(li)!=len(lis)):\r\n print(\"NO\")\r\nelse: \r\n for i in range(len(c)):\r\n if(lis[i]!=li[i]):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n\r\n", "guest = ''.join(sorted(input() + input()))\r\nthird = ''.join(sorted(input()))\r\n\r\nprint('YES' if guest == third else 'NO')\r\n", "s1 = input()\r\ns2 = input()\r\ntmp = s1 + s2\r\ns = input()\r\ntmp = sorted(tmp)\r\ns = sorted(s)\r\nif tmp != s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\ns1 += s2\r\nif len(s3) < len(s1):\r\n print(\"NO\")\r\nelse:\r\n count = 0\r\n for i in s3:\r\n if i in s1:\r\n s1.remove(i)\r\n count += 1\r\n if len(s1) == 0 and len(s3) == count:\r\n print(\"YES\")\r\n elif len(s1) == 0 and len(s3) != count:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "from math import *\r\n'''@avtor---NABIEVMEHRUBON---'''\r\nf = 'abcdefghijklmnopqrstuvwxyz'\r\na = input()\r\nb = input()\r\ns = [str(i) for i in input()]\r\ns.sort()\r\na += b\r\ns1 = [str(i) for i in a]\r\ns1.sort()\r\ng1 = ''\r\ng2 = ''\r\nfor i in s:\r\n g1 += i\r\nfor i in s1:\r\n g2 += i\r\nif len(g1) == len(g2) and g1 in g2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "guest = input()\r\nresidence = input()\r\npile = input()\r\n\r\ncr_pile = []\r\nth_pile = []\r\nfor i in guest:\r\n cr_pile.append(i)\r\n\r\nfor j in residence:\r\n cr_pile.append(j)\r\n\r\nfor k in pile:\r\n th_pile.append(k)\r\n\r\ncr_pile.sort()\r\nth_pile.sort()\r\n\r\nif cr_pile == th_pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n1=input()\r\nn2=input()\r\nn3=input()\r\ntmp1=[]\r\ntmp2=[]\r\nfor i in n1:\r\n tmp1.append(i)\r\nfor i in n2:\r\n tmp1.append(i)\r\nfor i in n3:\r\n tmp2.append(i)\r\ntmp1.sort()\r\ntmp2.sort()\r\n\r\nif tmp1==tmp2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = list(input())\r\nt = list(input())\r\nv = list(input())\r\nc = s + t\r\nc.sort()\r\nv.sort()\r\nif v == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\n\nguest_name = input()\nhost_name = input()\npile_letters = input()\n\n# 统计名字和堆中的字母的字符频次\nguest_name_counter = Counter(guest_name)\nhost_name_counter = Counter(host_name)\npile_letters_counter = Counter(pile_letters)\n\n# 检查堆中的字母是否能够用来构成名字\nif guest_name_counter == pile_letters_counter - host_name_counter and host_name_counter == pile_letters_counter - guest_name_counter:\n print(\"YES\")\nelse:#111\n print(\"NO\")\n\n \t \t\t\t \t \t\t \t \t\t\t \t \t \t", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\nk = sorted(a+b)\r\nc = sorted(c)\r\nif k == c:\r\n print('YES')\r\nelse:\r\n print('NO')\n# Sat Jul 08 2023 10:34:24 GMT+0300 (Moscow Standard Time)\n", "a = input()\r\nb = input()\r\nquo = input()\r\nlistq = [e for e in quo]\r\nlistq.sort()\r\ntext = [e for e in a]\r\nfor i in b:\r\n text.append(i)\r\ntext.sort()\r\nif text == listq:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "def main() -> None :\r\n print(yes_No(is_Can_Be_Permuted(input_Guest_Name(), input_Host_Name(), input_Pile_Chars())))\r\n\r\n\r\ndef is_Can_Be_Permuted(guest_name: str, host_name: str, pile_chars: str) -> bool :\r\n return sorted(guest_name + host_name) == sorted(pile_chars)\r\n\r\n\r\ndef input_Guest_Name() -> str :\r\n return input()\r\n\r\ndef input_Host_Name() -> str :\r\n return input()\r\n\r\ndef input_Pile_Chars() -> str :\r\n return input()\r\n\r\n\r\ndef yes_No(bool: bool) -> str :\r\n return [\"NO\", \"YES\"][bool]\r\n\r\n\r\nmain()", "n = input().strip()\r\na = input().strip()\r\nt = input().strip()\r\n\r\n# Concatenate the names\r\nans = n + a\r\n\r\n# Check if the lengths of ans and t are different\r\nif len(ans) != len(t):\r\n print(\"NO\")\r\nelse:\r\n # Sort the characters in both ans and t\r\n sorted_ans = sorted(ans)\r\n sorted_t = sorted(t)\r\n\r\n # Check if the sorted strings match\r\n if sorted_ans == sorted_t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "arr=[0]*26\r\na=input()\r\nb=input()\r\nfor i in a:\r\n arr[ord(i)-65]+=1\r\nfor i in b:\r\n arr[ord(i)-65]+=1\r\nc=input()\r\nfor i in c:\r\n arr[ord(i)-65]-=1\r\nflag=True\r\nfor i in range(26):\r\n if arr[i]!=0:\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name=input().upper() \r\nresidenc=input().upper()\r\nletters=input(). upper()\r\nholeString=name+residenc\r\nlist1=[]\r\nlist2=[]\r\nfor i in letters:\r\n list1.append(i)\r\nfor j in holeString:\r\n list2.append(j) \r\nlist1.sort()\r\nlist2.sort()\r\nif list1==list2:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "import math\nimport heapq\nimport sys\n\ndef input_arr():\n arr = [int(x) for x in input_string().split()]\n return arr\n\ndef input_n():\n n = int(input_string())\n return n\n\ndef sub_list(a,b):\n c = []\n for i in range(len(a)):\n c.append(a[i]-b[i])\n return c\n\ndef sub_const(a, c):\n b = []\n for x in a:\n b.append(x-c)\n return b\n\ndef binary_search(arr, low, high, x):\n if high >= low:\n mid = (high + low) // 2\n if arr[mid] == x:\n return mid\n elif arr[mid] > x:\n return binary_search(arr, low, mid - 1, x)\n else:\n return binary_search(arr, mid + 1, high, x)\n else:\n return -1\n \ndef printlist(a):\n for x in a:\n print(x, end = \" \")\n\ndef input_string():\n global mode\n if mode==0:\n return input()\n else:\n with open('/Users/aryan/Desktop/cp/test_case.txt') as f:\n lines = f.readlines()\n global line \n st = lines[line][:-1]\n line+=1\n return st\n\ndef solve():\n st1 = input_string()\n st2 = input_string()\n st3 = input_string()\n s1 = sorted(st1+st2)\n s2 = sorted(st3)\n if s1==s2:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef solve_t():\n t = input_n()\n for l in range(t):\n n, k = input_arr()\n if n%2==1 and k%2==0:\n print(\"NO\")\n else:\n print(\"YES\")\n \n\n\n\n\nline = 0 \nmode = 0\nif len(sys.argv)>1 and sys.argv[1]=='file':\n mode = 1\nsolve()", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\ncombined_names = guest_name + host_name\r\n\r\nif sorted(combined_names) == sorted(pile_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\nab = a+b\r\nf = True\r\nif len(ab) != len(c):\r\n print('NO')\r\nelse:\r\n for i in ab:\r\n if ab.count(i) == c.count(i):\r\n continue\r\n else:\r\n print('NO')\r\n f = False\r\n break\r\n if f:\r\n print('YES')\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns1 += s2\r\ns1 = sorted(s1)\r\ns3 = sorted(s3)\r\nif s1 == s3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "line1,line2,line3 = input(),input(),input()\r\nprint('YES' if sorted(line1+line2) == sorted(line3) else 'NO')", "def Amusing_Joke(name1, name2, letters):\r\n \r\n dec ={}\r\n for i in letters:\r\n if i in dec:\r\n dec[i] +=1\r\n else :\r\n dec[i] = 1\r\n \r\n for i in name1:\r\n if i in dec:\r\n dec[i] -=1\r\n if dec[i] == 0:\r\n dec.pop(i)\r\n \r\n else:\r\n return 'NO'\r\n for i in name2 :\r\n if i in dec:\r\n dec[i] -=1\r\n if dec[i] == 0:\r\n dec.pop(i)\r\n else :\r\n return 'NO'\r\n \r\n for i in dec:\r\n if dec[i] !=0:\r\n return 'NO'\r\n return 'YES'\r\n\r\nname1 = input()\r\nname2 = input()\r\nletters = input()\r\nprint(Amusing_Joke(name1, name2, letters))", "guest=input()\r\nhost=input()\r\nguest_host=guest+host\r\nletters=list(input())\r\nlgh=len(guest_host)\r\nif lgh!=len(letters):\r\n print(\"NO\")\r\nelse:\r\n for i in range(lgh):\r\n b=guest_host[i]\r\n if b in letters:\r\n letters.remove(b)\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\ncombined_names = guest_name + host_name\r\ncombined_names_sorted = sorted(combined_names)\r\npile_of_letters_sorted = sorted(pile_of_letters)\r\nif combined_names_sorted == pile_of_letters_sorted:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\n\r\nif sorted(line1 + line2) == sorted(line3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ndef can_form_names(guest_name, host_name, letters):\r\n guest_letters = list(guest_name)\r\n host_letters = list(host_name)\r\n letter_count = {}\r\n\r\n # Подсчитываем количество каждой буквы в именах гостя и хозяина\r\n for letter in guest_letters + host_letters:\r\n letter_count[letter] = letter_count.get(letter, 0) + 1\r\n\r\n # Проверяем, что количество каждой буквы в кучке букв достаточно для составления имен\r\n for letter in letters:\r\n if letter_count.get(letter, 0) == 0:\r\n return \"NO\"\r\n letter_count[letter] -= 1\r\n\r\n # Проверяем, что не осталось лишних букв в именах гостя и хозяина\r\n for count in letter_count.values():\r\n if count != 0:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\n# Получаем входные данные\r\nguest_name = input()\r\nhost_name = input()\r\nletters = input()\r\n\r\n# Вызываем функцию для проверки возможности составления имен\r\nresult = can_form_names(guest_name, host_name, letters)\r\n\r\n# Выводим результат\r\nprint(result)\r\n\r\n", "# 7.13.3\r\nlst1 = list(input())\r\nlst2 = list(input())\r\nlst3 = list(input())\r\nl1 = len(lst1)\r\nl2 = len(lst2)\r\nl3 = len(lst3)\r\nl = l1+l2\r\nlst4 = lst1+lst2\r\nif l == l3:\r\n lst3.sort()\r\n lst4.sort()\r\n if lst3 == lst4:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "n=str(input())\nr=str(input())\nl=str(input())\ns=n+r\nif sorted(s) == sorted(l): print(\"YES\")\nelse: print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\ncombined_names = guest_name + host_name\r\nsorted_combined_names = sorted(combined_names)\r\nsorted_pile_of_letters = sorted(pile_of_letters)\r\nif sorted_combined_names == sorted_pile_of_letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nr,i=sorted,input;print('YNEOS'[r(i()+i())!=r(i())::2])", "a=sorted(input()+input());b =sorted(input())\r\nif a ==b:print('YES');\r\nelse:print('NO')", "# trees = [int(x) for x in input().split()]\n# n = int(input())\nfrom collections import Counter\nss = []\nfor i in range(3):\n ss.append(input())\n\nif len(ss[0])+len(ss[1]) != len(ss[2]):\n print(\"NO\")\nelse:\n s_1 = Counter(ss[0])\n s_1 += Counter(ss[1])\n s_2 = Counter(ss[2])\n if s_1==s_2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "s1,j =sorted,input;print('YNEOS'[s1(j()+j())!=s1(j()) ::2])", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\nchar_counts = {}\r\nfor c in guest_name:\r\n char_counts[c] = char_counts.get(c, 0) + 1\r\n\r\nfor c in host_name:\r\n char_counts[c] = char_counts.get(c, 0) + 1\r\n\r\nfor c in pile_letters:\r\n if c in char_counts and char_counts[c] > 0:\r\n char_counts[c] -= 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nfor count in char_counts.values():\r\n if count > 0:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "a=input()\r\na=a+ input()\r\nb=list(input().strip())\r\nk=list(a.strip())\r\nk.sort()\r\nb.sort()\r\nif k==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print(\"YNEOS\"[sorted(input() + input()) != sorted(input())::2])", "a, b, c = input(), input(), input()\r\nx = a + b\r\n\r\nn = sorted([i for i in x])\r\nm = sorted([j for j in c])\r\nif len(x) == len(c):\r\n if n == m:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "from collections import Counter\r\n\r\nname1 = input()\r\nname2 = input()\r\nletters = input()\r\n\r\nletter_names = Counter(name1) + Counter(name2)\r\n\r\nif letter_names == Counter(letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\nb = list(input())\nc = list(input())\ndef pan(g,h,k):\n for i in range(len(a)):\n for j in range(len(c)):\n if a[i] == c [j]:\n del c[j]\n break\n elif j == len(c) - 1:\n return False\n for o in range(len(b)):\n for p in range(len(c)):\n if b[o] == c[p]:\n del c[p]\n break\n elif p == len(c) - 1:\n return False\n if len(c) != 0:\n return False\n else:\n return True\nif pan(a,b,c):\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\t\t", "def can_permute_names(guest_name, host_name, pile_letters):\r\n total_name = guest_name + host_name\r\n return sorted(total_name) == sorted(pile_letters)\r\n\r\n\r\nguest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\nif can_permute_names(guest_name, host_name, pile_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=list(input())\r\nd=list(a+b)\r\nc.sort()\r\nd.sort()\r\nif(c==d):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\n\r\ns4 = s1 + s2\r\nif sorted(s3) == sorted(s4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nc = a+b\r\nf = input()\r\nn = 0\r\nif not(len(f) == len(c)):\r\n print('NO')\r\nelse:\r\n for i in c:\r\n if i in f:\r\n f = f.replace(i, '', 1)\r\n n += 1\r\n else:\r\n print('NO')\r\n break\r\nif n == len(c):\r\n print('YES')", "def arePermutations(string1, string2):\r\n if len(string1) != len(string2):\r\n return False\r\n frequency = [0 for i in range(26)]\r\n for char in string1:\r\n index = ord(char) - ord('A')\r\n frequency[index] += 1\r\n for char in string2:\r\n index = ord(char) - ord('A')\r\n frequency[index] -= 1\r\n if frequency[index] < 0:\r\n return False\r\n return True\r\nguest = input()\r\nhost = input()\r\npile = input()\r\nname = guest + host\r\nif arePermutations(name,pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# 141A - Amusing Joke \r\n# https://codeforces.com/problemset/problem/141/A\r\n\r\n# Inputs:\r\n# 1) Nombre del invitado\r\n# 2) Nombre del huesped\r\n# 3) Pila de letras\r\nletras_invitado = input()\r\nletras_huesped = input()\r\npila_letras = input()\r\n\r\n# Suma las letras del invitado y huésped\r\nsuma_letras = letras_invitado + letras_huesped\r\n\r\n# Ordena la suma y pila de letras alfabéticamente\r\nsuma_letras_ordenado = ''.join(sorted(suma_letras))\r\npila_letras_ordenado = ''.join(sorted(pila_letras))\r\n\r\n# Si ambos strings tienen las mismas letras, entonces imprime 'YES', de lo contrario, imprime 'NO'\r\nif suma_letras_ordenado == pila_letras_ordenado:\r\n print('YES')\r\nelse:\r\n print('NO')", "x1, x2, x3 = input(), input(), input()\r\ny = x1 + x2\r\nx3_lst, y_lst = [], []\r\nfor i in x3:\r\n x3_lst.append(i)\r\nfor i in y:\r\n y_lst.append(i)\r\n\r\nx3_lst.sort()\r\nx3_lst = \"\".join(x3_lst)\r\ny_lst.sort()\r\ny_lst = \"\".join(y_lst)\r\n\r\nif x3_lst == y_lst:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_names(guest_name, host_name, letters_pile):\r\n combined_names = guest_name + host_name\r\n combined_letters = letters_pile\r\n if len(combined_names) != len(combined_letters):\r\n return \"NO\"\r\n for char in combined_names:\r\n if char in combined_letters:\r\n combined_letters = combined_letters.replace(char, '', 1)\r\n else:\r\n return \"NO\"\r\n if len(combined_letters) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nletters_pile = input().strip()\r\nresult = check_names(guest_name, host_name, letters_pile)\r\nprint(result)\r\n", "n=input()\r\nk=input()\r\nf=input()\r\nl=[]\r\nif len(n)+len(k)==len(f):\r\n\tfor i in f:\r\n\t\tl.append(i)\r\n\tfor i in n:\r\n\t\tif i in l:\r\n\t\t\tl.remove(i)\r\n\tfor i in k:\r\n\t\tif i in l:\r\n\t\t\tl.remove(i)\r\n\tprint('YES' if len(l)==0 else 'NO')\r\nelse:print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\n\r\ns = a + b\r\n\r\ns = sorted(s)\r\nc = sorted(c)\r\n\r\nif s == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\n\r\npossible = False\r\na = input()\r\nb = input()\r\nfirst = Counter(a + b)\r\nsecond = Counter(input())\r\n\r\nif first == second:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\n# Concatenate the guest's name and host's name\r\nnames = guest_name + host_name\r\n\r\n# Check if all letters in the concatenated names exist in the pile\r\nfor letter in names:\r\n if letter in pile_letters:\r\n # Remove the letter from the pile\r\n pile_letters = pile_letters.replace(letter, '', 1)\r\n else:\r\n # If a letter is missing from the pile, print \"NO\" and exit\r\n print(\"NO\")\r\n exit()\r\n\r\n# Check if there are any extra letters left in the pile\r\nif len(pile_letters) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "name1=input().lower()\r\nname2=input().lower()\r\npile=input().lower()\r\nletters=[]\r\nreq=name1+name2\r\ni=97\r\nfor i in range(97,123):\r\n letters.append(chr(i))\r\ncount1=[0 for l in letters]\r\ni=0\r\nfor i in range(0,len(req)):\r\n ch=req[i]\r\n ch_askii=ord(ch)\r\n count1[ch_askii-97]+=1\r\ncount2=[0 for num in count1]\r\ni=0\r\nfor i in range(0,len(pile)):\r\n ch=pile[i]\r\n ch_askii=ord(ch)\r\n count2[ch_askii-97]+=1\r\ni=0\r\nc=0\r\nfor i in range(0,len(count1)):\r\n if(count1[i]!=count2[i]):\r\n print(\"NO\")\r\n c=1\r\n break\r\nif(c==0):\r\n print(\"YES\")\r\n ", "def abc():\r\n s = input()\r\n ss = input()\r\n t = input()\r\n m = {}\r\n m1 = {}\r\n for i in s:\r\n m[i] = 1 + m.get(i, 0)\r\n for i in ss:\r\n m[i] = 1 + m.get(i, 0)\r\n for i in t:\r\n m1[i] = 1 + m1.get(i, 0)\r\n if m1!=m:\r\n return \"NO\"\r\n return \"YES\"\r\nif __name__==\"__main__\":\r\n print(abc())", "a = input()\na += input()\nb = input()\nans1 = []\nans2 = []\nfor i in a:\n\tans1.append(i)\nfor i in b:\n\tans2.append(i)\nans1.sort()\nans2.sort()\nif ans1 == ans2:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n# Sat Jul 08 2023 11:21:38 GMT+0300 (Moscow Standard Time)\n", "s1=input()\ns2=input()\ns3=input()\nl=[]\ns4=s1+s2\nl1=[*s3]\nl2=[*s4]\nl1.sort()\nl2.sort()\nif l1==l2:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\nz = a+b\r\nx = ''.join(sorted(z))\r\ny = ''.join(sorted(c))\r\nif x==y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#141A\r\nn1=input()\r\nn1+=input()\r\nn3=list(input())\r\nn1=list(n1)\r\nn1.sort()\r\nn3.sort()\r\nif n1!=n3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a=str(input())\r\nb=str(input())\r\nc=str(input())\r\ncount=[0]*26\r\nmount=[0]*26\r\nx=[]\r\ny=[]\r\nfor i in a+b:\r\n nomer=ord(i)-65\r\n count[nomer]=count[nomer]+1\r\nfor i in range(26):\r\n if count[i]>0:\r\n x.append((chr(i+65))*count[i])\r\n#print(x)\r\nfor i in c:\r\n nomer=ord(i)-65\r\n mount[nomer]=mount[nomer]+1\r\nfor i in range(26):\r\n if mount[i]>0:\r\n y.append((chr(i+65))*mount[i])\r\n#print(y)\r\nif x==y:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "z1=list(input())\r\nz2=list(input())\r\nx=list(input())\r\nfor i in x:\r\n if i in z1:\r\n q=z1.index(i)\r\n del z1[q]\r\n elif i in z2:\r\n q=z2.index(i)\r\n del z2[q]\r\n else:\r\n print('NO')\r\n exit()\r\nif len(z1)==0 and len(z2)==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\nd = sorted(a + b)\r\nif d == sorted(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n g = input()\n g += input()\n s = input()\n if sorted(g) == sorted(s):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "l = []\r\nfor i in range(0,3):\r\n a = input()\r\n l.append(a)\r\na1 = l[0]\r\na2 = l[1]\r\na3 = l[2]\r\nn1 = len(a1) + len(a2)\r\nn2 = len(a3)\r\na = a1+a2\r\nb = a3\r\nl1 = list(a)\r\nl1.sort()\r\nl2 = list(b)\r\nl2.sort()\r\nif n1!=n2:\r\n print('NO')\r\nelse:\r\n if l1 == l2 :\r\n print('YES')\r\n else:\r\n print('NO')", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\ncombined_names = guest_name + host_name\r\nif sorted(combined_names) == sorted(pile_letters):print(\"YES\")\r\nelse:print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\n# Count the occurrences of each letter in the names\r\nguest_counts = {}\r\nhost_counts = {}\r\n\r\nfor letter in guest_name:\r\n guest_counts[letter] = guest_counts.get(letter, 0) + 1\r\n\r\nfor letter in host_name:\r\n host_counts[letter] = host_counts.get(letter, 0) + 1\r\n\r\n# Check if the counts of letters in the pile match the counts in the names\r\nfor letter in pile_letters:\r\n if letter in guest_counts:\r\n guest_counts[letter] -= 1\r\n if guest_counts[letter] == 0:\r\n del guest_counts[letter]\r\n elif letter in host_counts:\r\n host_counts[letter] -= 1\r\n if host_counts[letter] == 0:\r\n del host_counts[letter]\r\n else:\r\n # If a letter is not present in either name, it is extra and cannot be used to form the names\r\n print(\"NO\")\r\n break\r\nelse:\r\n # If all letters in the pile are accounted for, and the counts match, it is possible to form the names\r\n if len(guest_counts) == 0 and len(host_counts) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef main():\r\n n = list(input().strip('')[:-1])\r\n n += list(input().strip('')[:-1])\r\n l = list(input().strip('')[:-1])\r\n if len(n) != len(l):\r\n print(\"NO\")\r\n else:\r\n n.sort()\r\n l.sort()\r\n if n != l:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nmain()", "guest = input()\r\nhost = input()\r\ndoor = input()\r\n\r\ns4 = guest + host\r\ndoor = sorted(door)\r\ns4 = sorted(s4)\r\n\r\nif door == s4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nif sorted(a+b) == sorted(c):\r\n print('YES')\r\nelse:\r\n print('NO')", "g=(list(input()))\r\nh=(list(input()))\r\nj=sorted(list(input()))\r\ng=sorted(g+h)\r\nif g==j:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nl,l2 = [],[]\r\nflag = 1\r\n\r\nfor i in s1:\r\n l.append(i)\r\nfor i in s2:\r\n l.append(i)\r\nfor i in s3:\r\n l2.append(i)\r\nfor j in range(len(l)):\r\n if l[j] in l2:\r\n l2.remove(l[j])\r\n else:\r\n flag = 0\r\n break\r\n\r\nif len(l2)!=0:\r\n flag=0\r\n\r\nif flag == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a1=list(input())\r\na2=list(input())\r\narr=list(input())\r\nf1=0\r\nf2=0\r\nf3=0\r\nfor i in a1:\r\n if i in arr:\r\n arr.remove(i)\r\n else:\r\n f1=1\r\n break\r\nfor j in a2:\r\n if j in arr:\r\n arr.remove(j)\r\n else:\r\n f2=1\r\n break\r\nf3=len(arr)\r\nif(f1==0 and f2==0 and f3==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\nb=list(input())\r\nr=a+b\r\nr.sort()\r\nz=list(input())\r\nz.sort()\r\nif(r==z):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_create_names(guest_name, host_name, pile):\r\n letter_counts = {}\r\n\r\n for c in guest_name:\r\n if c in letter_counts:\r\n letter_counts[c] += 1\r\n else:\r\n letter_counts[c] = 1\r\n\r\n for c in host_name:\r\n if c in letter_counts:\r\n letter_counts[c] += 1\r\n else:\r\n letter_counts[c] = 1\r\n\r\n for c in pile:\r\n if c in letter_counts:\r\n letter_counts[c] -= 1\r\n else:\r\n return \"NO\"\r\n\r\n for count in letter_counts.values():\r\n if count != 0:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n guest_name = input().strip()\r\n host_name = input().strip()\r\n pile = input().strip()\r\n\r\n print(can_create_names(guest_name, host_name, pile))", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\n\r\n# Concatenate the two names and sort them alphabetically\r\nnames = sorted(guest_name + host_name)\r\n\r\n# Sort the pile of letters alphabetically\r\npile = sorted(pile_of_letters)\r\n\r\n# Compare the two sorted strings\r\nif names == pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ch=input()\r\nch1=input()\r\nx=input()\r\nif len(x)!= (len(ch)+len(ch1)):\r\n print(\"NO\")\r\nelse:\r\n ch=ch+ch1\r\n verif= True\r\n for i in ch:\r\n if ch.count(i) != x.count(i):\r\n verif= False\r\n break\r\n \r\n print(\"YES\") if verif else print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nk=0\r\nif(len(a+b)!=len(c)):\r\n print('NO')\r\nelse:\r\n for i in set(a+b):\r\n if (a+b).count(i)!=c.count(i):\r\n print('NO')\r\n k=1\r\n break\r\n if k==0:\r\n print('YES')", "n1=input()\r\nn2=input()\r\nn3=input()\r\nn4=n1+n2\r\nl1=[]\r\nl2=[]\r\nfor i in n4:\r\n l1.append(i)\r\nl1.sort()\r\nfor i in n3:\r\n l2.append(i)\r\nl2.sort()\r\nif l1==l2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input().upper()\r\nb=input().upper()\r\nc=input().upper()\r\nif sorted(a+b) == sorted(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# read input\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nletters = input().strip()\r\n\r\n# initialize frequency counters for guest and host names\r\nguest_freq = {}\r\nhost_freq = {}\r\nfor c in guest_name:\r\n if c in guest_freq:\r\n guest_freq[c] += 1\r\n else:\r\n guest_freq[c] = 1\r\nfor c in host_name:\r\n if c in host_freq:\r\n host_freq[c] += 1\r\n else:\r\n host_freq[c] = 1\r\n\r\n# initialize frequency counter for pile of letters\r\npile_freq = {}\r\nfor c in letters:\r\n if c in pile_freq:\r\n pile_freq[c] += 1\r\n else:\r\n pile_freq[c] = 1\r\n\r\n# check if pile of letters can be used to make guest and host names\r\nfor c in guest_freq:\r\n ac = guest_freq[c] + host_freq.get(c, 0)\r\n bc = pile_freq.get(c, 0)\r\n if ac != bc:\r\n print(\"NO\")\r\n break\r\nelse:\r\n for c in host_freq:\r\n if c not in guest_freq:\r\n ac = host_freq[c]\r\n bc = pile_freq.get(c, 0)\r\n if ac != bc:\r\n print(\"NO\")\r\n break\r\n else:\r\n for c in pile_freq:\r\n if c not in guest_freq and c not in host_freq:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "guest = input()\r\nhost = input()\r\nteste = sorted(guest + host)\r\nlinha = sorted(input())\r\n\r\nif linha == teste:\r\n print('YES')\r\nelse:\r\n print('NO')", "g=input()\r\nh=input()\r\nf=input()\r\nd1={}\r\nd2={}\r\nflag=0\r\nfor i in g:\r\n if i in d1:\r\n d1[i]+=1\r\n else:\r\n d1[i]=1\r\nfor i in h:\r\n if i in d1:\r\n d1[i]+=1\r\n else:\r\n d1[i]=1\r\nfor i in f:\r\n if i in d2:\r\n d2[i]+=1\r\n else:\r\n d2[i]=1\r\na=list(d1.keys())\r\na.sort()\r\nb=list(d2.keys())\r\nb.sort()\r\ndict1={i: d1[i] for i in a}\r\n# print(str(dict1))\r\ndict2={i: d2[i] for i in b}\r\n# print(str(dict2))\r\na=list(dict1.values())\r\n# a.sort()\r\nb=list(dict2.values())\r\n# print(a,b\r\nif dict1==dict2:\r\n if a==b:\r\n flag=1\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# print(a)\r\n# print(b)\r\n# print(str(d1))\r\n# print(str(d2))", "def can_form_names(guest_name, host_name, pile_letters):\r\n name_letters = guest_name + host_name\r\n\r\n if sorted(name_letters) == sorted(pile_letters):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\ndef main():\r\n guest_name = input().strip()\r\n host_name = input().strip()\r\n pile_letters = input().strip()\r\n\r\n result = can_form_names(guest_name, host_name, pile_letters)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\n\r\nx=[input() for x in range(2)]\r\nname = input()\r\nd={}\r\nd1={}\r\n\r\nfor i in range(2):\r\n for letter in x[i]:\r\n if letter not in d:\r\n d[letter] = 1\r\n else:\r\n d[letter]+=1\r\n\r\nfor letter in name:\r\n if letter not in d1:\r\n d1[letter] = 1\r\n else:\r\n d1[letter] += 1\r\n\r\nif d1==d: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "li=[j for j in input()]\r\nli1=[li.append(j) for j in input()]\r\nli2=[j for j in input()]\r\nli2.sort();li.sort()\r\nif li==li2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "\r\nprint(\"YNEOS\"[list(sorted(input() + input()))!=list(sorted(input()))::2])", "n = list(input())\r\nm = list(input())\r\nl = list(input())\r\n\r\nx = 0\r\n\r\nwhile l:\r\n for i in l: \r\n if i in n:\r\n l.remove(i)\r\n n.remove(i)\r\n elif i in m:\r\n l.remove(i)\r\n m.remove(i)\r\n else:\r\n x = 1\r\n break\r\n if x:\r\n break\r\n\r\nif not n and not m and not l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a,c = input() + input(), input()\r\n\r\nif sorted(a) == sorted(c): print(\"YES\")\r\nelse: print(\"NO\")", "from collections import Counter\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nd = a+b\r\n\r\nc_counter = Counter(c)\r\nd_counter = Counter(d)\r\n\r\n\r\n\r\nif c_counter == d_counter:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nl1+=l2\r\n\r\n\r\nfor i in l1:\r\n if l3.__contains__(i):\r\n l3 = l3.replace(i,'',1)\r\n l1 = l1.replace(i,'',1)\r\n\r\n\r\nif len(l3) == len(l1) and l3 ==l1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "a = input()\r\nb = input()\r\ns = input()\r\nx = a + b\r\nm = ''.join(sorted(s))\r\nn = ''.join(sorted(x))\r\nif m == n:\r\n print('YES')\r\nelse: \r\n print('NO')", "guest_name=input()\r\nhost_name=input()\r\ntotal_name=guest_name+host_name\r\nusers_name=input()\r\n\r\nusers_name=list(users_name)\r\ntotal_name=list(total_name)\r\n\r\nusers_length=(len(users_name))\r\ntotal_length=(len(total_name))\r\n\r\nusers_name.sort()\r\ntotal_name.sort()\r\n#print(users_name)\r\n#print(total_name)\r\n\r\nif not users_length==total_length:\r\n print('NO')\r\nelse:\r\n if users_name==total_name:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n ", "host = list(str(input()))\r\nguest = list(str(input()))\r\npile = list(str(input()))\r\n\r\ntotal = (host+guest)\r\ntotal.sort()\r\npile.sort()\r\n\r\nif total == pile: print(\"YES\")\r\nelse: print(\"NO\")", "l1=list(input())\r\nl2=list(input())\r\nl3=list(input())\r\nl3.sort()\r\nr=l1+l2\r\nr.sort()\r\nif r==l3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m=input()\r\n\r\n\r\nc=input()\r\n\r\n\r\nw=input()\r\n\r\n\r\nq=m+c\r\n\r\n\r\ne=sorted(q)\r\n\r\n\r\nj=sorted(w)\r\n\r\n\r\nif e==j:\r\n \r\n print(\"YES\")\r\n\r\nelse:\r\n \r\n print(\"NO\")", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nc.sort()\r\nd=a+b\r\nd.sort()\r\n#print(d,c)\r\nif d==c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# LUOGU_RID: 133513940\nfrom collections import Counter\r\n\r\nguest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\n# 统计名字和堆中的字母的字符频次\r\nguest_name_counter = Counter(guest_name)\r\nhost_name_counter = Counter(host_name)\r\npile_letters_counter = Counter(pile_letters)\r\n\r\n# 检查堆中的字母是否能够用来构成名字\r\nif guest_name_counter == pile_letters_counter - host_name_counter and host_name_counter == pile_letters_counter - guest_name_counter:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n a = input(); b = input(); c = input(); print('YES') if sorted(a + b) == sorted(c) else print(\"NO\")\r\nif __name__==\"__main__\":\r\n main()", "X = input()\r\nY = input()\r\nZ = input()\r\n\r\nall_letters = X + Y\r\nZ_sorted = sorted(Z)\r\n\r\nif sorted(all_letters) == Z_sorted:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "print(\"YES\" if sorted(input() + input()) == sorted(input()) else \"NO\")", "name1 = list(input())\r\nname2 = list(input())\r\npile = list(input())\r\n\r\nsorted_name = ''.join(sorted(name1 + name2))\r\nsorted_pile = ''.join(sorted(pile))\r\n\r\nif sorted_name == sorted_pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\nhost = input()\njoke = ''.join(sorted(input()))\ntemp = ''.join(sorted(guest+host))\n\nprint('YES') if joke == temp else print('NO')\n \t\t \t\t\t \t \t\t \t \t\t \t \t\t \t\t\t", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\nexpected_name = guest_name + host_name\r\nif sorted(expected_name) == sorted(pile_of_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "abc = input()\r\nabc = abc.lower()\r\ninp = input()\r\ninp = inp.lower()\r\n\r\nout = input()\r\nout = out.lower()\r\n\r\na = []\r\nb = []\r\nfor i in inp:\r\n #if(ord(i) not in a):\r\n a.append(ord(i))\r\nfor i in abc:\r\n #if(ord(i) not in a):\r\n a.append(ord(i))\r\n\r\nfor i in out:\r\n b.append(ord(i))\r\n\r\na.sort()\r\nb.sort()\r\nif(a==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nif len(a)+len(b) !=len(c) :\r\n print(\"NO\")\r\nelse:\r\n for i in a:\r\n if i in c:\r\n c=c.replace(i,'',1)\r\n for i in b:\r\n if i in c:\r\n c=c.replace(i,'',1)\r\n if c=='':\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\r\nx=input\r\nprint('YNEOS'[Counter(x()+x())!=Counter(x())::2]) ", "a = input()\nb = input()\nc = input()\nif len(a)+len(b) == len(c):\n def Convert(string):\n list1 = []\n list1[:0] = string\n return list1\n a = Convert(a)\n b = Convert(b)\n c = Convert(c)\n\n if sorted(a+b) == sorted(c):\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n# Sat Jul 08 2023 13:54:37 GMT+0300 (Moscow Standard Time)\n", "s1 = input()\r\ns2 = input()\r\na = input()\r\nflag = True\r\nfor i in s1:\r\n if i in a:\r\n a = a.replace(i, '', 1)\r\n else:\r\n flag = False\r\n break\r\nif flag and len(a) != 0:\r\n for i in s2:\r\n if i in a:\r\n a = a.replace(i, '', 1)\r\n else:\r\n flag = False\r\n break\r\nif len(a) != 0:\r\n flag = False\r\n \r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import Counter\r\n\r\n\r\nguest = input().strip()\r\nhost = input().strip()\r\npile = input().strip()\r\n\r\n\r\nguest_host_count = Counter(guest + host)\r\npile_count = Counter(pile)\r\n\r\nif guest_host_count == pile_count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\na = input()\r\nb = input()\r\nc = input()\r\nd = a+b\r\nl1 = list(c)\r\nl2 = list(d)\r\nd1 = Counter(l1)\r\nd2 = Counter(l2)\r\nif d1 == d2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b = input(), input()\r\nif sorted(input()) == sorted(a + b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from typing import Counter\r\n\r\n\r\ndef solve():\r\n guest = input().upper()\r\n host = input().upper()\r\n letters = input().upper()\r\n\r\n must_have_count = dict(Counter(letters))\r\n has_count = dict(Counter(guest + host))\r\n if must_have_count == has_count:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "from collections import Counter\r\ns = input()\r\nr = input()\r\nm = input()\r\nif Counter(s)+Counter(r)==Counter(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nletter_pile = input().strip()\r\n\r\nfull_name = guest_name + host_name\r\n\r\nif Counter(full_name) == Counter(letter_pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\r\nguest = [*guest]\r\n\r\nhost = input()\r\nhost = [*host]\r\n\r\npile = input()\r\npile = [*pile]\r\npile.sort()\r\n\r\nnew = guest + host\r\nnew.sort()\r\n\r\nif pile == new:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "h = input()\r\ng = input()\r\nnm = input()\r\nhg = h + g\r\n\r\nletters = [0] * 26\r\nletters_nm = [0] * 26\r\nfor i in hg:\r\n num = ord(i) - 65\r\n letters[num] += 1\r\nfor i in nm:\r\n num = ord(i) - 65\r\n letters_nm[num] += 1\r\n\r\nresult = True\r\nfor i in range(26):\r\n if letters[i] != letters_nm[i]:\r\n result = False\r\n break\r\n\r\nif result:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = s1 + s2\r\n\r\nif sorted(s) == sorted(s3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "from collections import defaultdict\r\na = input()\r\nb = input()\r\nc = input()\r\nd = defaultdict(int)\r\n\r\nfor i in a:\r\n d[i] += 1\r\nfor i in b:\r\n d[i] += 1\r\nfor i in c:\r\n d[i] -= 1\r\n \r\nflag = False\r\nfor i in d.values():\r\n if i != 0:\r\n flag = True\r\n\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a=list(input())\r\nb=list(input())\r\n\r\nc=list(input())\r\na.extend(b)\r\na.sort()\r\n\r\nc.sort()\r\nif(a==c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_names(guest, host, letters):\r\n combined_names = guest + host\r\n combined_letters = sorted(letters)\r\n\r\n if sorted(combined_names) == combined_letters:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\n# Read the input\r\nguest = input().strip()\r\nhost = input().strip()\r\nletters = input().strip()\r\n\r\nresult = check_names(guest, host, letters)\r\nprint(result)\r\n", "q = list(input())\r\nf = list(input())\r\ns = list(input())\r\nwhile len(s) != 0:\r\n if q.count(s[0]) == 0 and f.count(s[0]) == 0:\r\n print('NO')\r\n exit()\r\n else:\r\n if q.count(s[0]) != 0:\r\n q.remove(s[0])\r\n else:\r\n f.remove(s[0])\r\n s.remove(s[0])\r\nif len(q) != 0 or len(f) != 0 or len(s) != 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "# Problem: https://codeforces.com/problemset/problem/141/A\r\n# Answer:\r\n\r\n# I think this problem can be solved by combining\r\n# the first two inputs into a list and make the\r\n# third input into a list. Then sort both lists.\r\n# If they're equal, then we print YES. if not, then\r\n# we print NO.\r\n\r\nfirstLetters = list(input())\r\nsecondLetters = list(input())\r\nthirdLetters = list(input())\r\n\r\nfirstAndSecondLetters = firstLetters + secondLetters\r\nfirstAndSecondLetters.sort()\r\n\r\nthirdLetters.sort()\r\n\r\nif firstAndSecondLetters == thirdLetters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# This program is a little limited because it doesn't\r\n# tell the user why the lists are different when NO is\r\n# printed to the screen. That might be a problem for later.\r\n", "def main():\n\n guest = input()\n resident = input()\n pile = input()\n\n word = guest + resident\n word = list(word)\n word.sort()\n pile = list(pile)\n pile.sort()\n\n if word == pile:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "def main():\r\n s = input().lower()\r\n n = input().lower()\r\n p = input().lower()\r\n sn = s + n\r\n if len(sn) == len(p):\r\n flag = False\r\n for aa in range(ord('a'), ord('z')+1):\r\n aa_char = chr(aa)\r\n if aa_char in sn:\r\n sn = sn.replace(aa_char, \"\")\r\n x = len(sn)\r\n p = p.replace(aa_char, \"\")\r\n y = len(p)\r\n if x != y:\r\n flag = True\r\n break\r\n if not flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input()\r\nb = input()\r\nc = a+b\r\nd= input()\r\ne=''.join(sorted(c))\r\nf=''.join(sorted(d))\r\nif(e==f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\r\nhost = input()\r\npile = input()\r\n\r\ncombined = guest + host\r\n\r\nscomb = sorted(combined)\r\nspile = sorted(pile)\r\n\r\n\r\nif scomb == spile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a = input()\r\nb = input()\r\nsorted1 = sorted(a + b)\r\nc = input()\r\nsorted2 = sorted(c)\r\nif sorted1 == sorted2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input(); b = input(); c = input()\r\na += b\r\nif (len(c) < len(a)): print(\"NO\")\r\nelse:\r\n for i in a:\r\n c = c.replace(i, \"\", 1)\r\n if (c == \"\"): print(\"YES\")\r\n else: print(\"NO\")", "g=list(input())+list(input())\r\np=list(input()) \r\ng.sort()\r\np.sort()\r\nif g==p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\n\r\nif sorted(c) == sorted(a+b):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "a = input()\r\na += input()\r\nc = sorted(list(input()))\r\na = sorted(a)\r\nans = 'YES'\r\nif a != c:\r\n ans = 'NO'\r\nprint(ans)\r\n", "guest_name=input()\r\nhost_name=input()\r\npile_letters=input()\r\n\r\ncombined_names=guest_name + host_name\r\n\r\nif sorted(combined_names) == sorted(pile_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\nguest_name = input()\r\nhost_name = input()\r\nletters_pile = input()\r\n\r\n# Проверяем, можно ли составить имена \"Новогодних Дедов\" из букв в кучке\r\nif Counter(guest_name + host_name) == Counter(letters_pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g_n=input()\r\nh_n=input()\r\np=input()\r\nc_n=g_n+h_n\r\nc_n=sorted(c_n)\r\np=sorted(p)\r\nif c_n==p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = a + input()\r\nc = input()\r\nsorted_b = sorted(b)\r\nsorted_c = sorted(c)\r\nif sorted_b == sorted_c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b, c = input(), input(), input()\r\na=a+b\r\nif len(a)==len(c):\r\n a=sorted(list(a))\r\n c=sorted(list(c))\r\n if a==c:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "guest= list(input())\r\nhost=list (input())\r\nchars=sorted(list(input()))\r\nif sorted(guest+host)== chars:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a=input()\r\nb=input()\r\nc=input()\r\na=a+b\r\na=sorted(a)\r\nc=sorted(c)\r\nif(c==a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest=input()\r\nhost=input()\r\npile=input()\r\npile=list(pile)\r\ns=list(guest+host)\r\ns.sort()\r\npile.sort()\r\nif s==pile:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=sorted(input())\r\ns11=''.join(s1)\r\ns2=sorted(input())\r\ns22=''.join(s2)\r\ns3=sorted(input())\r\ns33=''.join(s3)\r\n\r\ns12=s11+s22\r\ns=sorted(s12)\r\nss=''.join(s)\r\n\r\nif ss==s33:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name1=input()\r\nname2=input()\r\nname3=input()\r\nprint('YES'if ''.join(sorted(name1+name2))==''.join(sorted(name3)) else 'NO')\r\n\r\n\r\n\r\n", "from collections import Counter\r\ns=input()\r\nd=input()\r\nf=input()\r\ns=Counter(s)\r\nd=Counter(d)\r\nf=Counter(f)\r\na=s+d\r\nif a==f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nd = a + b\r\n\r\nif sorted(d) == sorted(c):\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\n names, after = input()+input(), input()\n s = {}\n for c in names:\n if c in s:\n s[c] += 1\n else:\n s[c] = 1\n for c in after:\n if c in s:\n s[c] -= 1\n else:\n print(\"NO\")\n return\n for c in s:\n if s[c] != 0:\n print(\"NO\")\n return\n print(\"YES\")\n\n\n\nif __name__ == '__main__':\n main()", "a=input()\r\nspa=[]\r\nfor i in range(len(a)):\r\n spa.append(a[i])\r\nb=input()\r\nspb=[]\r\nfor i in range(len(b)):\r\n spa.append(b[i])\r\ns=input()\r\nspc=[]\r\nfor i in range(len(s)):\r\n spc.append(s[i])\r\ncheck=True\r\nfor i in range(len(spa)):\r\n if spa[i] in spc:\r\n spc.remove(spa[i])\r\n else:\r\n check=False\r\n break\r\nif check:\r\n for i in range(len(spb)):\r\n if spb[i] in spc:\r\n spc.remove(spb[i])\r\n else:\r\n check = False\r\n break\r\nif check and len(spc)==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "name1 = list(input())\r\nname2 = list(input())\r\nname = sorted(name1 + name2)\r\nletters = sorted(list(input()))\r\nif name == letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input().upper()\r\nb = input().upper()\r\nc = input().upper()\r\nnew = {}\r\nsuffle = {}\r\nfor i in range(0,len(a)):\r\n if new.get(a[i]) == None:\r\n new[a[i]] = 1\r\n else:\r\n new[a[i]] += 1\r\nfor i in range(0,len(b)):\r\n if new.get(b[i]) == None:\r\n new[b[i]] = 1\r\n else:\r\n new[b[i]] += 1\r\nfor i in range(0,len(c)):\r\n if suffle.get(c[i]) == None:\r\n suffle[c[i]] = 1\r\n else:\r\n suffle[c[i]] += 1\r\nif new == suffle:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=list(input())\r\ny=list(input())\r\nz=list(input())\r\nz.sort()\r\nv=x+y\r\nv.sort()\r\nif z==v:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "guest_name = str(input())\r\nhost_name = str(input())\r\npiled = str(input())\r\n\r\nflag = 0\r\n\r\nif len(guest_name) + len(host_name) == len(piled):\r\n concan = guest_name + host_name\r\n for i, value in enumerate(concan):\r\n m = concan.count(value)\r\n l = piled.count(value)\r\n if m != l:\r\n flag += 1\r\n break\r\n if flag != 1:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile = input().strip()\r\n\r\nguest_count = Counter(guest_name)\r\nhost_count = Counter(host_name)\r\n\r\npile_count = Counter(pile)\r\n\r\nif pile_count == guest_count + host_count and all(pile_count[letter] <= guest_count[letter] + host_count[letter] for letter in pile_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "guest = input()\r\nhost = input()\r\nmix = input()\r\njudge = 1\r\nfor i in range(len(guest)):\r\n for j in range(len(mix)):\r\n if guest[i]==mix[j]:\r\n mix=mix.replace(mix[j],' ',1)\r\n break\r\n else:\r\n judge = 0\r\n break\r\nif judge==1:\r\n mix1=mix\r\n for i in range(len(host)):\r\n for j in range(len(mix1)):\r\n if host[i] == mix1[j]:\r\n mix1=mix1.replace(mix1[j],' ',1)\r\n break\r\n else:\r\n judge = 0\r\n break\r\nif judge==1 and mix1.isspace():\r\n print('YES')\r\nelse:\r\n print('NO')", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\ncombined_names = sorted(guest_name + host_name)\r\nsorted_pile = sorted(pile_letters)\r\nif combined_names == sorted_pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "word1 = input()\r\nword2 = input()\r\nword3 = list(sorted(input()))\r\nword4 = list(sorted(word1 + word2))\r\nif word3 == word4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#141A\r\n\r\ns1=input() #abc\r\ns2=input() #def\r\ns3=input() #acdefc\r\n\r\nS1=[i.lower() for i in s1]\r\nS2=[i.lower() for i in s2]\r\nS3=[i.lower() for i in s3]\r\n\r\nS1.sort()\r\n\r\n\r\nS2.sort()\r\nS3.sort()\r\n\r\n\r\nif len(S1)+len(S2)!=len(S3):\r\n print(\"NO\")\r\nelse:\r\n for i in S1:\r\n if i in S3:\r\n S3.remove(i)\r\n \r\n \r\n\r\n for i in S2:\r\n if i in S3:\r\n S3.remove(i)\r\n \r\n if len(S3)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "\r\nguest_name = input().strip()\r\nowner_name = input().strip()\r\npile_letters = input().strip()\r\ncombined_name = sorted(guest_name + owner_name)\r\nsorted_pile = sorted(pile_letters)\r\nif combined_name == sorted_pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1 = input().strip()\r\ns2 = input().strip()\r\nletters = input().strip()\r\n\r\nif len(letters) != len(s1) + len(s2):\r\n print(\"NO\")\r\n exit()\r\n\r\nletters_list = list(letters)\r\n\r\nfor c in s1:\r\n if c in letters_list:\r\n letters_list.remove(c)\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nfor c in s2:\r\n if c in letters_list:\r\n letters_list.remove(c)\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nab = tuple(map(str, a+b))\r\nans = tuple(map(str, c))\r\nif sorted(ans) == sorted(ab):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = list(input())\r\ns2 = list(input())\r\nl = s+s2\r\ns3 = list(input())\r\nl.sort()\r\ns3.sort()\r\nprint('YES' if l == s3 else 'NO')", "a=input()\r\nb=input()\r\nc=input()\r\nprint(\"YES\" if sorted(a+b)==sorted(c) else \"NO\")", "\r\nt = 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 s1 = input()\r\n s2 = input()\r\n s3 = input()\r\n l3 = len(s3)\r\n l2 = len(s2)\r\n l1 = len(s1)\r\n mas = []\r\n tr = 0\r\n if l1 + l2 == l3:\r\n for i in range(0, l3):\r\n mas.append(s3[i])\r\n for n in range(0, l1):\r\n for i in range(0, l3 - n):\r\n if s1[n] == mas[i]:\r\n tr += 1\r\n mas.pop(i)\r\n break\r\n for n in range(0, l2):\r\n for i in range(0, l3 - n - l1):\r\n if s2[n] == mas[i]:\r\n tr += 1\r\n mas.pop(i)\r\n break\r\n if tr == l3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n", "a = input()\nb = input()\nab = input()\nc = a+b\nf = 1\nif len(c) != len(ab):\n f = 0\n\nelse:\n for i in range(len(c)):\n if ab.count(ab[i]) == c.count(ab[i]):\n continue\n else:\n f = 0\n break\nif f:\n print(\"YES\")\nelse:\n print(\"NO\")", "g = input().strip()\r\nh = input().strip()\r\np = input().strip()\r\ntarget = \"NewYearChristmasMen\"\r\ncom = g + h\r\ncom = com.replace(\" \", \"\")\r\ns1 = sorted(com)\r\ns2 = sorted(p)\r\nif s1 == s2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\nguest_name = guest_name + host_name\r\nguest_name = sorted(guest_name)\r\npile_of_letters = sorted(pile_of_letters)\r\nif(guest_name == pile_of_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word1 = input()\nword2 = input()\nword3 = input()\n\nl1 = [l for l in word1+word2]\nl2 = [l for l in word3]\n\nif sorted(l1) == sorted(l2):\n print('YES')\nelse:\n print('NO')", "n1 = input()\r\nn2 = input()\r\np = input()\r\nn = ''.join(sorted(n1 + n2))\r\npp = ''.join(sorted(p))\r\n\r\nif n == pp:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_form_names(guest_name, host_name, pile_of_letters):\r\n combined_names = guest_name + host_name\r\n if sorted(combined_names) == sorted(pile_of_letters):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read the guest's name\r\nguest_name = input().strip()\r\n\r\n# Read the host's name\r\nhost_name = input().strip()\r\n\r\n# Read the pile of letters\r\npile_of_letters = input().strip()\r\n\r\nresult = can_form_names(guest_name, host_name, pile_of_letters)\r\nprint(result)\r\n", "guest=input()\nhost=input()\nnew=input()\n\nmix=guest+host\n\nl1=[]\nl2=[]\n\nfor i in mix:\n l1.append(i)\nfor i in new:\n l2.append(i)\nl1.sort()\nl2.sort()\n\n\nif l1==l2:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\nz = sorted(c)\r\ny = a + b\r\nif sorted(y) == z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name_1 = input()\r\nname_2 = input()\r\nmix = input()\r\ndic1 = {}\r\ndic2 = {}\r\nfor letter in name_1:\r\n if letter in dic1:\r\n dic1[letter] += 1\r\n else:\r\n dic1[letter] = 1\r\n \r\nfor letter in name_2:\r\n if letter in dic1:\r\n dic1[letter] += 1\r\n else:\r\n dic1[letter] = 1 \r\n\r\nfor letter in mix:\r\n if letter in dic2:\r\n dic2[letter] += 1\r\n else:\r\n dic2[letter] = 1\r\n\r\nif dic1 == dic2:\r\n print('YES')\r\nelse:\r\n print('NO')", "e = input()\r\ne2 = input()\r\ne3 = input()\r\n\r\na = e+e2\r\nb = list(e3)\r\nc = list(a)\r\nc.sort()\r\nb.sort()\r\nif b == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\na.extend(list(input()))\r\nc=list(input())\r\na.sort()\r\nc.sort()\r\nif a==c:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from collections import Counter\r\na = input()\r\nb = input()\r\nc = input()\r\nd = a+b\r\nl1 = list(c)\r\nl2 = list(d)\r\nd1 = dict(Counter(l1))\r\nd2 = dict(Counter(l2))\r\nif d1 == d2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "arr = [0] * 26\r\nfor i in range(2):\r\n a = input()\r\n for j in range(len(a)):\r\n arr[ord(a[j]) - 65] += 1\r\nc = input()\r\nfor i in range(len(c)):\r\n arr[ord(c[i]) - 65] -= 1\r\nfor i in range(26):\r\n if arr[i] != 0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "a = input()\r\nb = input()\r\nc = input()\r\nd = a+b\r\nc = [*c]\r\nd = [*d]\r\nd.sort()\r\nc.sort()\r\nif c==d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n s1 = input()\r\n s2 = input()\r\n s = input()\r\n start = []\r\n for i in s1:\r\n start.append(i)\r\n for i in s2:\r\n start.append(i)\r\n start.sort()\r\n finish = [i for i in s]\r\n finish.sort()\r\n if start == finish:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == \"__main__\":\r\n main()", "a = input()\nb = input()\nc = input()\nd = a+b\nf = []\nfor i in range(len(d)):\n f.append(d[i])\n\ng = sorted(f)\nh = sorted(c)\nif g == h:\n print('YES')\nelse:\n print('NO')\n \t \t \t\t\t \t \t \t \t\t \t\t\t\t", "first_name = list(input())\r\nsecond_name = list(input())\r\nfirst_name.extend(second_name)\r\nfirst_name.sort()\r\nthird_name = list(input())\r\nthird_name.sort()\r\nflag = True\r\nif len(first_name) != len(third_name):\r\n flag = False\r\nelse:\r\n for i in range(len(first_name)):\r\n if first_name[i] != third_name[i]:\r\n flag = False\r\n break\r\nif flag == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Input three strings\r\nl1 = list(input())\r\nl2 = list(input())\r\nl3 = list(input())\r\n\r\n# Sort the input lists\r\nl1.sort()\r\nl2.sort()\r\nl3.sort()\r\n\r\nans = True\r\n\r\nif len(l1) + len(l2) == len(l3):\r\n a = 0\r\n b = 0\r\n c = 0\r\n while c < len(l3):\r\n if a < len(l1) and l1[a] == l3[c]:\r\n a += 1\r\n elif b < len(l2) and l2[b] == l3[c]:\r\n b += 1\r\n else:\r\n ans = False\r\n break\r\n c += 1\r\nelse:\r\n ans = False\r\n\r\nif ans == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "i = input\r\ns = sorted(list(i()+i()))\r\ns3 = sorted(list(i()))\r\nprint(['NO','YES'][s==s3])", "####### A. Amusing Joke\r\n\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nletter = input().strip()\r\n\r\ncombined_letter = guest_name + host_name\r\n\r\nif(sorted(letter) == sorted(combined_letter)):\r\n print(\"YES\")\r\nelse: print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nx = a + b\r\nx.sort()\r\nc.sort()\r\nif x == c:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b\r\nx=sorted(d)\r\ny=sorted(c)\r\n\r\nif x==y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nz=sorted(a+b)\r\nc=sorted(c)\r\nif z!=c:\r\n print('NO')\r\nelse:\r\n print('YES')", "guest_name = input()\r\nhost_name = input()\r\nletters = input()\r\n\r\nnames = guest_name + host_name\r\n\r\nnames = sorted(list(names))\r\nletters = sorted(list(letters))\r\n\r\nif names == letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nl=[]\r\nfor i in(a,b):\r\n l.extend(i)\r\nl=sorted(l)\r\nc=input()\r\nm=list(c)\r\nm=sorted(m)\r\nfor i in range(len(l)):\r\n if len(m)!=len(l):\r\n print(\"NO\")\r\n break\r\n elif m[i]!=l[i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nq=a+b\r\nc.sort()\r\nq.sort()\r\nif q==c:\r\n print('YES')\r\nelse:\r\n print('NO')\t", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\ncombined_names = guest_name + host_name\r\nletter_count = {}\r\nfor letter in combined_names:\r\n letter_count[letter] = letter_count.get(letter, 0) + 1\r\nfor letter in pile_of_letters:\r\n if letter in letter_count and letter_count[letter] > 0:\r\n letter_count[letter] -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n for count in letter_count.values():\r\n if count > 0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "a = input()\nb = input()\nc = input()\ndef Convert(string):\n list1 = []\n list1[:0] = string\n return list1\na = Convert(a)\nb = Convert(b)\nc = Convert(c)\n\nif sorted(a+b) == sorted(c):\n print(\"YES\")\nelse:\n print(\"NO\")\n# Sat Jul 08 2023 13:51:25 GMT+0300 (Moscow Standard Time)\n", "w1 = input()\r\nw2 = input()\r\nw3 = input()\r\n\r\ncombined = ''.join(sorted(w1 + w2)) \r\nsorted_w3 = ''.join(sorted(w3))\r\nif sorted_w3 == combined:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import defaultdict\r\ndef main():\r\n s11 = input()\r\n s22 = input()\r\n s33 = input()\r\n char_t = defaultdict(int)\r\n for char in s11:\r\n char_t[char] += 1\r\n for char in s22:\r\n char_t[char] += 1\r\n for char in s33:\r\n char_t[char] -= 1\r\n if all(value == 0 for value in char_t.values()):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == \"__main__\":\r\n main()", "guest = input()\r\nhost = input()\r\npile = list(input())\r\n\r\nres = \"YES\"\r\n\r\nfor i in guest:\r\n if i in pile:\r\n pile.remove(i)\r\n else:\r\n res = \"NO\"\r\n\r\nfor i in host:\r\n if i in pile:\r\n pile.remove(i)\r\n else:\r\n res = \"NO\"\r\nif len(pile) == 0 and res == \"YES\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\ns1=input()\r\ns2=input()\r\ns3=s1+s\r\nres1=''.join(sorted(s3))\r\nres2=''.join(sorted(s2))\r\n\r\nif res1==res2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b\r\n#a=\"PAPAINOELJOULUPUKKI\"\r\n#b=\"JOULNAPAOILELUPUKKI\"\r\nif sorted(d)==sorted(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a = input(); b = input(); c = input()\n\nab_chars = {}\nc_chars = {}\n\nfor i in a + b:\n try:\n ab_chars[i] += 1\n except KeyError:\n ab_chars[i] = 1\n\nfor i in c:\n try:\n c_chars[i] += 1\n except KeyError:\n c_chars[i] = 1\n\n\nprint(\"YES\" if ab_chars == c_chars else \"NO\")\n", "word1 = input()\r\nword2 = input()\r\nallletters =list(input())\r\nstatus = \"YES\"\r\nif len(word1)+len(word2) == len(allletters):\r\n for i in word1 :\r\n if i not in allletters :\r\n status =\"NO\"\r\n break\r\n else :\r\n allletters.remove(i)\r\n for i in word2 :\r\n if i not in allletters:\r\n status = \"NO\"\r\n break\r\n else :\r\n allletters.remove(i)\r\n print(status)\r\nelse :\r\n print(\"NO\")", "alphaLength = 26\r\nfirst = [0] * alphaLength\r\nsecond = [0] * alphaLength\r\n\r\nline = input()\r\nfor char in line:\r\n first[ord(char) - ord('A')] += 1\r\n\r\nline = input()\r\nfor char in line:\r\n first[ord(char) - ord('A')] += 1\r\n\r\nline = input()\r\nfor char in line:\r\n second[ord(char) - ord('A')] += 1\r\n\r\noutput = \"YES\"\r\nfor k in range(alphaLength):\r\n if first[k] != second[k]:\r\n output = \"NO\"\r\n break\r\n\r\nprint(output)\r\n", "def names(guest_name, host_name, pile_of_letters):\r\n guest_host_name = guest_name + host_name\r\n return sorted(guest_host_name) == sorted(pile_of_letters)\r\n\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile_of_letters = input().strip()\r\n\r\nresult = names(guest_name, host_name, pile_of_letters)\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\ns = s1 + s2\r\nif len(s) != len(s3):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(s3)):\r\n if s3[i] in s:\r\n s = s.replace(s3[i], \"\", 1)\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "a=list(input())\r\nb=list(input())\r\nfin=list(input())\r\nif len(a)+len(b)>len(fin):\r\n print(\"NO\")\r\nelse:\r\n for i in a:\r\n if i in fin:\r\n fin.remove(i)\r\n for j in b:\r\n if j in fin:\r\n fin.remove(j)\r\n if len(fin)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a = list(input())\r\nb = list(input())\r\na.extend(b)\r\npile = list(input())\r\na.sort()\r\npile.sort()\r\n\r\nif a == pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()+input()\r\nv=input()\r\nfreq=[0]*1000\r\nz=[0]*1000\r\nfor i in n:\r\n freq[ord(i)]+=1\r\nfor j in v:\r\n z[ord(j)]+=1\r\nif z==freq:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "input1=input('')\r\ninput2=input('')\r\ninput3=input('')\r\nword=input1+input2\r\nword=sorted(word)\r\ninput3=sorted(input3)\r\nif word==input3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "# will implement with set, dict, list\n\n\ndef input_str():\n arr = input()\n return arr\n\n\ndef input_list():\n return list(input_str())\n\n\ndef print_yn(boolean_exp):\n if boolean_exp:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef final_check(lf, l3, c3, cf):\n if (\n set(lf) == set(l3)\n and lf.sort() == l3.sort()\n and len(lf) == len(l3)\n and c3 == cf\n ):\n return True\n else:\n return False\n\n\ndef convert_to_dict(passed_list):\n return {\n passed_list[i]: passed_list[i + 1] for i in range(0, len(passed_list) - 1, 2)\n }\n\n\nif __name__ == \"__main__\":\n l1 = input_list()\n l2 = input_list()\n l3 = input_list()\n lf = l1 + l2\n\n l3_sorted = l3.sort()\n lf_sorted = lf.sort()\n c3 = convert_to_dict(l3)\n cf = convert_to_dict(lf)\n\nprint_yn(final_check(lf, l3, c3, cf))\n", "def amusingJoke(guest, host, pile):\r\n guestl = list(guest)\r\n hostl = list(host)\r\n pilel = list(pile)\r\n \r\n guestl.extend(hostl)\r\n guestl.sort()\r\n pilel.sort()\r\n \r\n return True if guestl == pilel else False\r\n \r\n \r\nif __name__ == \"__main__\":\r\n guest = input()\r\n host = input()\r\n pile = input()\r\n \r\n can = amusingJoke(guest, host, pile)\r\n \r\n if can:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\nimport sys\r\ninput=sys.stdin.readline\r\n# import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# from collections import Counter\r\n# int(math.log(len(L)))\r\n# import math\r\n# from collections import defaultdict\r\n# mod=10**9+7\r\n# from collections import deque\r\n# import math\r\n\r\n\r\n\r\ndef t():\r\n s=I()\r\n m=I()\r\n D=I()\r\n X=[0]*26\r\n Y=[0]*26\r\n for i in range(len(s)-1):\r\n X[ord(s[i])-ord(\"A\")]+=1\r\n for i in range(len(m)-1):\r\n X[ord(m[i])-ord(\"A\")]+=1\r\n for i in range(len(D)-1):\r\n Y[ord(D[i])-ord(\"A\")]+=1\r\n if X==Y:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n t()", "import math\r\ndef solve_problem():\r\n name_list = []\r\n for i in range(3):\r\n while True:\r\n temp = str(input())\r\n if(1 <= len(temp) and len(temp) <= 100):\r\n name_list.append(temp)\r\n break\r\n if len(name_list[2]) != (len(name_list[0]) + len(name_list[1])):\r\n return \"NO\"\r\n else:\r\n dist_name = [x for x in name_list if x != name_list[-1]]\r\n src_name = list([name_list[-1]][0])\r\n\r\n for i in dist_name[0]:\r\n for j in src_name:\r\n if j == i:\r\n src_name.remove(j)\r\n break\r\n\r\n for i in dist_name[1]:\r\n for j in src_name:\r\n if j == i:\r\n src_name.remove(j)\r\n break\r\n\r\n if len(src_name) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nif __name__ == \"__main__\":\r\n print(solve_problem())", "guest = input()\r\nhost = input()\r\npile = input()\r\n\r\nsum_words = guest+host\r\nflag = True\r\nmax_len = max(len(guest),len(host))\r\nif len(pile) > len(sum_words):\r\n flag = False\r\n\r\nfor i in range(max_len):\r\n if pile.count(sum_words[i]) == sum_words.count(sum_words[i]):\r\n continue\r\n else:\r\n flag = False\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "chris = input()\r\nnewyr = input()\r\nletter = input()\r\ns = chris + newyr\r\nst = ''.join(sorted(s))\r\nstt = ''.join(sorted(letter))\r\nif st == stt:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "x = input()\r\nx1 = input()\r\nx2 = input()\r\ns = 0\r\ns1 = 0\r\nq = x + x1\r\nif len(x + x1) != len(x2):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(q)):\r\n if x2.count(q[i]) == q.count(q[i]):\r\n s = s + 1\r\n if s == len(q):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# LUOGU_RID: 113735604\nif sorted(input()+input())==sorted(input()):print(\"YES\")\nelse:print(\"NO\")", "def main():\r\n n1 = input()\r\n n2 = input()\r\n n3 = input()\r\n # Base case: Length is not the same\r\n if len(n1) + len(n2) != len(n3):\r\n print(\"NO\")\r\n return\r\n hash_map = {}\r\n for c in n1:\r\n if c not in hash_map:\r\n hash_map[c] = 1\r\n else:\r\n hash_map[c] += 1\r\n for c in n2:\r\n if c not in hash_map:\r\n hash_map[c] = 1\r\n else:\r\n hash_map[c] += 1\r\n for k, v in hash_map.items():\r\n if k not in n3 or v != n3.count(k):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "guest_name=input()\r\nhost_name=input()\r\nshuffle_name=input()\r\nlist1 = list(guest_name)\r\nlist2 = list(host_name)\r\nlist3 = list(shuffle_name)\r\nl1 = len(guest_name)\r\nl2 = len(host_name)\r\nl3 = len(shuffle_name)\r\nif(l1+l2 == l3):\r\n z = 0\r\n for i in list1:\r\n if i in list3:\r\n z += 1\r\n list3.remove(i)\r\n for i in list2:\r\n if i in list3:\r\n z += 1\r\n list3.remove(i)\r\n if(z == l3):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "st1=input();st2=input();st3=input()\r\nconcst=st1+st2\r\nconcst=sorted(concst);st3=sorted(st3)\r\nresult=\"YES\" if(concst==st3) else \"NO\"\r\nprint(result)", "n=input()\r\nn1=input()\r\nn2=input()\r\ns=n+n1\r\ns1=sorted(s)\r\nn2=sorted(n2)\r\nif s1==n2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\n\r\ncnt=[0]*26\r\nfor i in range(2):\r\n s=input()\r\n for j in range(len(s)):\r\n cnt[ord(s[j])-ord('A')]+=1\r\nx=input()\r\nfor i in range(len(x)):\r\n cnt[ord(x[i])-ord('A')]-=1\r\nfor i in range(26):\r\n if cnt[i]!=0:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "a,b,c=input(),input(),input()\r\nx,y,z=len(a),len(b),len(c)\r\nl=list(a+b)\r\nif z==x+y:\r\n\tfor i in c:\r\n\t\tif i in l:\r\n\t\t\tl.remove(i)\r\n\tif len(l)==0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tprint('NO')\r\n\r\n# SANTACLAUS\r\n# DEDMOROZ\r\n# SANTAMOROZDEDCLAUS", "a = input()\r\nb = input()\r\nc = input()\r\ng = a + b\r\nif sorted(g) == sorted(c):\r\n print('YES')\r\nelse:\r\n print('NO')", "guest_name = input()\r\nhost_name = input()\r\npile = input()\r\n\r\na = {}\r\nfor char in guest_name:\r\n if char not in a:\r\n a[char] = 1\r\n else:\r\n a[char] += 1\r\nfor char in host_name:\r\n if char not in a:\r\n a[char] = 1\r\n else:\r\n a[char] += 1\r\n\r\nres = \"YES\"\r\nfor char in pile:\r\n if char not in a:\r\n res = \"NO\"\r\n break\r\n else:\r\n a[char] -= 1\r\n\r\nfor char in a:\r\n if a[char] != 0:\r\n res = \"NO\"\r\n break\r\n\r\nprint(res)\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nl=[]\r\nl1=[]\r\ns=0\r\nfor i in range(len(a)):\r\n l.append(a[i])\r\nfor i in range(len(b)):\r\n l.append(b[i])\r\nfor i in range(len(c)):\r\n l1.append(c[i])\r\n\r\nif len(l)!=len(l1):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(l)):\r\n x=l[i]\r\n if l.count(x)!=l1.count(x):\r\n s=3\r\n break\r\n if s==3:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "ch=input().upper()\r\nch1=input().upper()\r\nch2=input().upper()\r\nboolean=True\r\nif len(ch)+len(ch1)==len(ch2):\r\n for element in ch2:\r\n if ch2.count(element)!=ch.count(element)+ch1.count(element):\r\n print(\"NO\")\r\n boolean=False\r\n break\r\n if boolean==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name_1 = input()\nname_2 = input()\ntext = input()\nif sorted(text) == sorted(name_1 + name_2):\n print('YES')\nelse:\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b\r\nl1=[]\r\nl2=[]\r\nl1[:0]=c\r\nl1.sort()\r\nl2[:0]=d\r\nl2.sort()\r\nif len(l1)==len(l2):\r\n c=0\r\n for i in range(len(l1)):\r\n if l1[i]==l2[i]:\r\n c+=1\r\n if c==len(l1):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s1=input()\r\ns2=input()\r\ns3=input()\r\na=s1+s2\r\nb=sorted(a)\r\nc=sorted(s3)\r\nif(b==c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ndef main():\r\n S1 = input()\r\n S2 = input()\r\n S3 = input()\r\n c= S1 + S2\r\n S_counter = Counter(c)\r\n S3_counter = Counter(S3)\r\n if S_counter == S3_counter:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import Counter\r\n\r\ndef can_permute_to_names(guest_name, host_name, letter_pile):\r\n combined_name = guest_name + host_name\r\n letter_count_combined = Counter(combined_name)\r\n letter_count_pile = Counter(letter_pile)\r\n \r\n return letter_count_combined == letter_count_pile\r\n\r\nguest_name = input()\r\nhost_name = input()\r\nletter_pile = input()\r\n\r\nif can_permute_to_names(guest_name, host_name, letter_pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nif(len(c)==len(a)+len(b)):\r\n x=\"\".join(sorted(c))\r\n y=\"\".join(sorted(a+b))\r\nelif(len(a)==len(c)+len(b)):\r\n x=\"\".join(sorted(a))\r\n y=\"\".join(sorted(c+b))\r\nelse:\r\n x=\"\".join(sorted(b))\r\n y=\"\".join(sorted(c+b))\r\nprint(\"YES\") if(x==y) else print(\"NO\")", "from sys import stdin\n\n# stdin = open(\"input.txt\")\ndef get_solution():\n # stdin = open(\"input.txt\")\n a = stdin.readline().rstrip()\n b = stdin.readline().rstrip()\n c = stdin.readline().rstrip()\n \n dicct1 = {}\n for el in a:\n dicct1[el] = dicct1.get(el, 0) + 1\n for el in b:\n dicct1[el] = dicct1.get(el, 0) + 1\n \n dicct2 = {}\n for el in c:\n dicct2[el] = dicct2.get(el, 0) + 1\n \n if dicct1 == dicct2:\n return 'YES'\n return 'NO'\n \n \n \nt = 1#int(stdin.readline().rstrip())\nfor _ in range(t):\n print(get_solution())\n", "string = input()\r\nstring += input()\r\ncheck = sorted(input())\r\ncount = True\r\nif check == sorted(string):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nguest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\nnames = guest_name + host_name\r\nif Counter(names) == Counter(pile_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nd=a+b\r\nc=sorted(list(c))\r\nd=sorted(list(d))\r\nif c==d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\n\r\nc1 = Counter(input())\r\nc1.update(Counter(input()))\r\nc2 = Counter(input())\r\n\r\n# print(c1, c2)\r\n\r\nprint('YES' if c2 == c1 else 'NO')", "from collections import defaultdict\r\n\r\na = defaultdict(int)\r\nfor i in input():\r\n a[i] += 1\r\nfor i in input():\r\n a[i] += 1\r\nfor i in input():\r\n a[i] -= 1\r\nprint(\"YES\" if not any(a.values()) else \"NO\")\r\n", "# a,b,c=input(),input(),input()\r\n# x,y,z=len(a),len(b),len(c)\r\n# l=list(a+b)\r\n# if z==x+y:\r\n# \tfor i in c:\r\n# \t\tif i in l:\r\n# \t\t\tl.remove(i)\r\n# \tif len(l)==0:\r\n# \t\tprint('YES')\r\n# \telse:\r\n# \t\tprint('NO')\r\n# else:\r\n# \tprint('NO')\r\n\r\na,b,c=input(),input(),input()\r\nx,y,z=len(a),len(b),len(c)\r\nif z==x+y:\r\n\tans='YES'\r\n\tl=sorted(list(a+b))\r\n\tL=sorted(list(c))\r\n\tfor i in range(z):\r\n\t\tif L[i]!=l[i]:\r\n\t\t\tans='NO'\r\n\t\t\tbreak\r\nelse:\r\n\tans='NO'\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n# SANTACLAUS\r\n# DEDMOROZ\r\n# SANTAMOROZDEDCLAUS", "word1=input()\r\nword2=input()\r\ntotal=input()\r\narr1=[]\r\narr2=[]\r\ntot=[]\r\nfor x,let in enumerate(word1):\r\n arr1.append(let)\r\nfor x,let in enumerate(word2):\r\n arr2.append(let)\r\n\r\nfor x,let in enumerate(total):\r\n tot.append(let)\r\n\r\n\r\narr1.extend(arr2)\r\narr1.sort()\r\ntot.sort()\r\n\r\nif arr1 == tot:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def build_word(word: str, lett_pile: list) -> str:\n build_str = \"\"\n\n for lett in word:\n for i, lett_p in enumerate(lett_pile):\n if lett == lett_p:\n build_str += lett_pile.pop(i)\n break\n\n return build_str\n\ndef solve() -> str:\n name_guest = str(input())\n name_master = str(input())\n lett_pile = list(map(str, input()))\n \n name_guest_b = build_word(name_guest, lett_pile)\n name_master_b = build_word(name_master, lett_pile)\n\n if (name_guest == name_guest_b \n and name_master == name_master_b\n and len(lett_pile) == 0):\n return \"YES\"\n else:\n return \"NO\"\n\nif __name__ == \"__main__\":\n print(solve())\n", "names = \"\".join([input() for i in range(2)])\r\nshuffle = input()\r\n\r\nncounter = {}\r\nfor i in names:\r\n if i in ncounter:\r\n ncounter[i] += 1\r\n else:\r\n ncounter[i] = 1\r\n\r\nscounter = {}\r\nfor j in shuffle:\r\n if j in scounter:\r\n scounter[j] += 1\r\n else:\r\n scounter[j] = 1\r\n\r\nif scounter == ncounter:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\nresult = 0\r\n\r\nif len(str1)+len(str2) != len(str3):\r\n result = 1\r\nelse:\r\n for i in range(0,len(str3)):\r\n if str1.count(str3[i])+str2.count(str3[i]) != str3.count(str3[i]):\r\n result = 1\r\n break\r\n\r\nif result == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\na=input()\r\nb=input()\r\nc=input()\r\nc=sorted(c)\r\ncc=sorted(a+b)\r\nif c==cc:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\ncnt = dict()\r\ncnt1 = dict()\r\ns1.extend(s2)\r\ns1.sort()\r\ns3.sort()\r\nif s1==s3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\nd = a+b\r\ncl = list(c)\r\ncl.sort()\r\ndl = list(d)\r\ndl.sort()\r\n# print(dl)\r\n# print(cl)\r\nif(cl== dl):\r\n print('YES')\r\nelse:\r\n print('NO')", "ch=input()\r\nch2=input()\r\nch3=input()\r\nnoveau=ch+ch2\r\nif sorted(noveau)==sorted(ch3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=input(),input()\r\nc=input()\r\ns=len(a)+len(b)\r\nfor i in range(len(c)):\r\n if c[i] in a:\r\n a=a.replace(c[i], '', 1)\r\n else:\r\n if c[i] in b:\r\n b=b.replace(c[i], '', 1)\r\nif len(a)==0 and len(b)==0 and len(c)==s:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns=s1+s2\r\nr= ''.join(sorted(s))\r\nrs = ''.join(sorted(s3))\r\nif rs==r:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = str(input())\nhost = str(input())\nmix = str(input())\n\ndef is_in(source, target):\n for letter in source:\n if letter not in target: return target, False\n index = target.index(letter)\n target = target[:index] + target[index + 1:]\n return target, True\n\nmix, guest_is_in = is_in(guest, mix)\nmix, host_is_in = is_in(host, mix)\nif guest_is_in and host_is_in and len(mix) == 0: print(\"YES\")\nelse: print(\"NO\")", "from sys import stdin\r\na=stdin.readline()[:-1]\r\nb=stdin.readline()[:-1]\r\nc=stdin.readline()[:-1]\r\nprint('YES' if sorted(a+b)==sorted(c) else 'NO')\r\n", "x=list(input())\r\ny=list(input())\r\nz=list(input())\r\na=x+y\r\na.sort()\r\nz.sort()\r\nif a==z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nlst1 = sorted(list(s1+s2))\r\nlst2 = sorted(list(s3))\r\nif lst1 == lst2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_joke(guest_name, host_name, letters):\r\n name = sorted(guest_name + host_name)\r\n \r\n \r\n sorted_letters = sorted(letters)\r\n \r\n if sorted_letters == name:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nletters = input().strip()\r\nresult = check_joke(guest_name, host_name, letters)\r\n\r\n\r\nprint(result)\r\n", "s=input()\r\nc=input()\r\nt=input()\r\nj=s+c\r\nt=sorted(t)\r\nj=sorted(j)\r\nif t==j:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\ny=input()\r\nz=input()\r\nxy=x+y\r\nsrt=sorted(z)\r\nsrta=sorted(xy)\r\nif srt==srta:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\ny=input()\r\nz=input()\r\nx=sorted(x+y)\r\nz=sorted(z)\r\nif x==z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input() + input()\r\nthird = input()\r\n\r\nhost = {}\r\nfor char in third:\r\n if char not in host:\r\n host[char] = 1\r\n else:\r\n host[char] += 1\r\n\r\nfor char in guest:\r\n if char in host.keys():\r\n host[char] -= 1\r\n if host[char] == 0:\r\n del host[char]\r\n else:\r\n print('NO')\r\n exit()\r\n\r\nfor letter, value in host.items():\r\n if value > 0:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n", "s1=input()\r\ns2=input()\r\ns=input()\r\ns3=s1+s2\r\nl1=list(s3)\r\nl2=list(s)\r\nl1.sort()\r\nl2.sort()\r\nif l1==l2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=[x for x in input()] + [x for x in input()]\r\nb=[x for x in input()]\r\nfor i in a:\r\n if i in b:\r\n b.remove(i)\r\n c=1\r\n else:\r\n c=0\r\n break\r\nif b==[] and c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#Coder_1_neel\r\nd = {}\r\ne = {}\r\n\r\n\r\nfor char in range(ord('A'), ord('Z') + 1):\r\n d[chr(char)] = 0\r\n e[chr(char)] = 0\r\n\r\ndef count_chars(x, d):\r\n for char in x:\r\n if char in d:\r\n d[char] += 1\r\n\r\na = input()\r\ncount_chars(a, d)\r\n\r\nb = input()\r\ncount_chars(b, d)\r\n\r\nc = input()\r\ncount_chars(c, e)\r\n\r\n# Compare the counts in d and e\r\nif d == e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\na=input()\r\nl=input()\r\nm=s+a\r\nif sorted(m)==sorted(l) :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"Codeforce\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1XTEd3xULMSCXZWYeK6wKPXVsZ74tROB6\n\"\"\"\n\nguest = input()\nresidence = input()\ncombined = guest + residence\npiled_words = input()\nword_count = {}\nflag = True\n\nfor itm in combined:\n if itm not in word_count:\n word_count[itm] = 1\n else:\n word_count[itm] += 1\n\n\nif len(piled_words) == len(combined):\n for k,v in word_count.items():\n count = 0\n for itm in piled_words:\n if k == itm:\n count += 1\n if count != v:\n print(\"NO\")\n flag = False\n break\n if flag:\n print(\"YES\")\nelse:\n print('NO')\n\n\n\n", "HostName = input()\r\nGuestName = input()\r\nScramble = input()\r\nx=[]\r\ny=[]\r\nfor char in HostName:\r\n x.append(char)\r\nfor char in GuestName:\r\n x.append(char)\r\nfor char in Scramble:\r\n y.append(char)\r\nx.sort()\r\ny.sort()\r\nif x==y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b, c, d1, d2 = [], [], [], 0, 0\r\nfor i in input(): a.append(i)\r\nfor i in input(): b.append(i)\r\nfor i in input(): c.append(i)\r\nfor i in range(0, len(c)):\r\n for j in range(0, len(a)):\r\n if a[j] == c[i]:\r\n c[i] = \"-\"\r\n a[j] = \"(\"\r\n d1 += 1\r\n for j in range(0, len(b)):\r\n if b[j] == c[i]:\r\n c[i] = \"-\"\r\n b[j] = \")\"\r\n d2 += 1\r\nif d1 + d2 == len(c) and d1 == len(a) and d2 == len(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=sorted,input\r\nc=a(b()+b())\r\nd=a(b())\r\nif c==d:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "f = sorted(list(input()) + list(input()))\r\ns = sorted(list(input()))\r\n\r\nif f == s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\nnames = [*(list(sys.stdin.readline().strip())), *(list(sys.stdin.readline().strip()))]\r\nletters = list(sys.stdin.readline().strip())\r\n\r\nif len(names) != len(letters):\r\n print('NO')\r\nelse:\r\n names.sort()\r\n letters.sort()\r\n \r\n z = zip(names, letters)\r\n difference_found = False\r\n \r\n for n, l in z:\r\n if n != l:\r\n difference_found = True\r\n break\r\n \r\n if not difference_found:\r\n print('YES')\r\n else:\r\n print('NO')", "aa=input()+input()\r\ncc=input()\r\nif len(aa)!=len(cc):\r\n print(\"NO\")\r\nelse:\r\n for i in aa:\r\n if i in cc:\r\n ind=cc.index(i)\r\n cc=cc[:ind]+cc[ind+1:]\r\n else:\r\n break\r\n if len(cc)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s_1=input()\r\ns_2=input()\r\ns=input()\r\ns_3=s_1+s_2\r\ns_3=''.join(sorted(s_3))\r\ns=''.join(sorted(s))\r\nif(s==s_3):\r\n print(\"YES\")\r\nelse: print(\"NO\")", "def count_letter(x):\r\n count_letter = {}\r\n for i in x:\r\n if i not in count_letter.keys():\r\n count_letter[i] = x.count(i)\r\n return dict(sorted(count_letter.items()))\r\n\r\n\r\nguest_name = input()\r\nresidence_name = input()\r\nfull_string = guest_name + residence_name\r\npile_letter = input()\r\nif count_letter(full_string) == count_letter(pile_letter):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\ns1=input()\ns2=input()\nk=\"\"\na=[]\nfor i in s+s1:\n if i not in k:\n k+=i \n a+=[(s1+s).count(i)]\nrs=True\nfor i in range(len(k)):\n if s2.count(k[i])!=a[i]:\n rs=False\n break \nif rs==True:\n if len(s+s1)<len(s2):\n print(\"NO\")\n else:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "guest=input()\r\nhost=input()\r\npile = sorted(input())\r\n\r\nprint('YES' if sorted(guest+host)==pile else 'NO')\r\n", "guest = input()\r\nhost = input()\r\nshuf = input()\r\nif len(shuf) == len(host+guest):\r\n lst_guest_host = []\r\n lst_shuf = []\r\n for i in guest+host:\r\n if i not in lst_guest_host:\r\n lst_guest_host.append(i)\r\n counts = {i:(guest+host).count(i) for i in lst_guest_host}\r\n #keys = list(counts.keys())\r\n #keys.sort()\r\n #count_sort = {i:counts[i] for i in keys}\r\n \r\n for i in shuf:\r\n if i not in lst_shuf:\r\n lst_shuf.append(i)\r\n counts2 = {i : shuf.count(i) for i in lst_shuf}\r\n #keys = list(counts.keys())\r\n #keys.sort()\r\n #count2_sort = {i : counts2[i] for i in keys}\r\n if counts == counts2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "\"\"\"\nA. Amusing Joke: implementation, sortings, strings\n\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nSo, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last.\nWhen two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event.\nThen the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names.\nThen he may have shuffled the letters and put them in one pile in front of the door.\nThe next morning it was impossible to find the culprit who had made the disorder.\nBut everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door?\nThat is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem.\nYou are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.\n\nInput\nThe input file consists of three lines: the first line contains the guest's name,\nthe second line contains the name of the residence host and the third line contains letters in a pile that were found at the door in the morning.\nAll lines are not empty and contain only uppercase Latin letters. The length of each line does not exceed 100.\n\nOutput\nPrint \"YES\" without the quotes, if the letters in the pile could be permuted to make the names of the \"New Year and Christmas Men\". Otherwise, print \"NO\" without the quotes.\n\"\"\"\n\ndef amusing_joke():\n a, b, c = (input() for _ in range(3))\n if sorted(a + b) == sorted(c):\n print('YES')\n else:\n print('NO')\n\nif __name__ == '__main__':\n amusing_joke()", "g = input()\r\nh= input()\r\np= input()\r\nnames = g+h\r\nif sorted(names) == sorted(p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#### Решение задач проекта CODEFORSES, Задача 1335A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Веселая шутка\r\nограничение по времени на тест2 seconds\r\nограничение по памяти на тест256 megabytes\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nВот и прошли новогодние праздники. Для Деда Мороза и его коллег пришло время отдыха и приема гостей. Когда встречаются\r\nдва «Новогодних Деда», то их помощники в честь такого знаменательного события вырезают из картона буквы имен гостя и\r\nхозяина, и вывешивают над парадным входом. Однажды ночью, когда все легли спать, кто-то снял все буквы имен наших\r\nперсонажей. Затем он, возможно, перемешал эти буквы, и положил в одну кучку перед дверью.\r\n\r\nНаутро так и не удалось найти виновника беспорядка, но всех заинтересовал еще один вопрос: можно ли из букв,\r\nсложенных перед дверью, заново составить имена гостя и хозяина? То есть нужно проверить, что не останется лишних,\r\nи не придется вырезать дополнительные буквы.\r\n\r\nПомогите «Новогодним Дедам» и их друзьям разобраться с этой проблемой, если вам даны обе надписи, висевшие над\r\nпарадной дверью вечером, и буквы в кучке, найденной перед парадной дверью утром.\r\n\r\nВходные данные\r\nВо входных данных три строки: в первой строке — имя гостя, во второй — имя хозяина резиденции, в третьей строке\r\n— буквы в кучке, найденной перед дверью утром. Все строки не пусты и состоят только из заглавных латинских букв.\r\nДлина каждой строки не превосходит 100.\r\n\r\nВыходные данные\r\nВыведите «YES» без кавычек, если из букв в кучке можно составить имена «Новогодних Дедов», и «NO» без кавычек\r\nв противном случае.\r\n\r\n\r\n'''\r\n\r\na1=input()\r\na2=input()\r\na3=input()\r\na4 = []\r\na5 = []\r\na4.extend(a1)\r\na4.extend(a2)\r\na5.extend(a3)\r\na4.sort()\r\na5.sort()\r\n#print(a4)\r\n#print(a5)\r\nif a5 == a4: print('YES')\r\nelse: print('NO')", "s=input()\r\ns1=input()\r\ns2=input()\r\nc=s+s1\r\nc=''.join(sorted(c))\r\ns2=''.join(sorted(s2))\r\nif c==s2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#https://codeforces.com/problemset/problem/141/A\r\n\r\nnumber_of_lines = 3\r\nguest_host = []\r\npile = []\r\n\r\nfor x in range(number_of_lines):\r\n if(x < 2):\r\n guest_host += input()\r\n else:\r\n pile += input()\r\n\r\nguest_host.sort()\r\npile.sort()\r\n\r\nif(guest_host == pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nimport bisect\r\n\r\n\r\ndef sol():\r\n s1=input()\r\n s2=input()\r\n s3=input()\r\n l1=[]\r\n l2=[]\r\n for i in s1:\r\n l1.append(i)\r\n for i in s2:\r\n l1.append(i)\r\n for i in s3:\r\n l2.append(i)\r\n l1.sort()\r\n l2.sort()\r\n if l1==l2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\nsol()\r\n", "a=list(input())\r\nb=list(input())\r\nc=a+b\r\nc.sort()\r\nd=list(input())\r\nd.sort()\r\nif(c==d):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str1=input()+input()\r\nstr1=''.join(sorted(str1))\r\nstr2=''.join(sorted(input()))\r\nif str1==str2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def joke(guest, host, letters):\r\n check = host + guest\r\n check.sort()\r\n letters.sort()\r\n if letters == check:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\nif __name__ == \"__main__\":\r\n guest = list(map(str, input().strip()))\r\n host = list(map(str, input().strip()))\r\n letters = list(map(str, input().strip()))\r\n print(joke(guest, host, letters))", "a = list(input()+input())\r\na.sort()\r\nb = list(input())\r\nb.sort()\r\nif a == b:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\n\r\ndef can_reconstruct_names(guest_name, host_name, letter_pile):\r\n \r\n guest_counter = Counter(guest_name)\r\n host_counter = Counter(host_name)\r\n \r\n for letter in letter_pile:\r\n if letter in guest_counter:\r\n guest_counter[letter] -= 1\r\n if guest_counter[letter] == 0:\r\n del guest_counter[letter]\r\n elif letter in host_counter:\r\n host_counter[letter] -= 1\r\n if host_counter[letter] == 0:\r\n del host_counter[letter]\r\n else:\r\n \r\n return \"NO\"\r\n \r\n \r\n if not guest_counter and not host_counter:\r\n return \"YES\"\r\n else:\r\n \r\n return \"NO\"\r\n\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nletter_pile = input().strip()\r\nresult = can_reconstruct_names(guest_name, host_name, letter_pile)\r\nprint(result)\r\n", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\ncombined_name = guest_name + host_name\r\n\r\nif sorted(combined_name) == sorted(pile_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = list(input())\nb= list(input())\nc = list(input())\n\nfor i in c:\n if i in a:\n a.remove(i)\n elif i in b:\n b.remove(i)\n else:\n print(\"NO\")\n quit()\nif len(a) ==0 and len(b)==0:\n print(\"YES\")\nelse:\n print('NO')", "w1 = input()\r\nw2 = input()\r\nw3 = input()\r\nif sorted(w3) == sorted(w1+w2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\nprint(\"YES\" if sorted(s1 + s2) == sorted(s3) else \"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\nflag=0\r\nG=[]\r\nH=[]\r\nfor i in range(len(a)):\r\n G.append(a[i])\r\nfor i in range(len(b)):\r\n G.append(b[i])\r\nfor i in range(len(c)):\r\n H.append(c[i])\r\nH.sort()\r\nG.sort()\r\nif len(H) != len(G):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(H)):\r\n if H[i] != G[i]:\r\n print(\"NO\")\r\n flag=1\r\n break\r\n if flag == 0:\r\n print(\"YES\")", "import sys\n\ninput = sys.stdin.readline\n\ng_str = str(input())[:-1]\nh_str = str(input())[:-1]\n\nstring = str(input())[:-1]\n\nstr_dict = {}\ncomp_dict = {}\n\nfor letter in g_str:\n if letter in str_dict:\n str_dict[letter] += 1\n\n else:\n str_dict[letter] = 0\n\nfor letter in h_str:\n if letter in str_dict:\n str_dict[letter] += 1\n\n else:\n str_dict[letter] = 0\n\nfor letter in string:\n if letter in comp_dict:\n comp_dict[letter] += 1\n\n else:\n comp_dict[letter] = 0\n\nif str_dict == comp_dict:\n sys.stdout.write(\"YES\")\n\nelse:\n sys.stdout.write(\"NO\")\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nl1=(list(s3))\r\nl1.sort()\r\n# l2=(list(s2))\r\n# l2.sort()\r\ns4=s1+s2\r\nl2=(list(s4))\r\nl2.sort()\r\nif l2 == l1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\nb=list(input())\nd=a+b\nc=list(input())\ncount=0\nfor i in range(len(c)):\n\tif len(d)==len(c):\n\t\te=d[i]\n\t\ta=d.count(e)\n\t\tb=c.count(e) \n\t\n\t\tif a==b:\n\t\t\tcontinue\n\t\telse:\n\t\t\tcount+=1 \nif count==0 and len(d)==len(c):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\t\t\t\t\n\t\n", "#!/usr/bin/env python3\r\na = input()\r\nb = input()\r\nc = input()\r\nprint('YES' if sorted(a+b) == sorted(c) else 'NO')\r\n", "a = input() + input()\r\nb = input()\r\nprint([\"NO\", \"YES\"][sorted(a) == sorted(b)])\r\n\r\n", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\ncombined_names = guest_name + host_name\r\nsorted_combined_names = sorted(combined_names)\r\nsorted_pile_letters = sorted(pile_letters)\r\nif sorted_combined_names == sorted_pile_letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ntext1 = [x for x in input()]\r\ntext2 = [y for y in input()]\r\nnames = [z for z in input()]\r\n\r\ntxt = text1 + text2\r\nc1 = Counter(txt)\r\nc2 = Counter(names)\r\n\r\nif c1 == c2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\nguest_name = input() # Guest's name\r\nhost_name = input() # Host's name\r\npile_letters = input() # Letters in the pile\r\n\r\n# Create Counter objects to count the frequency of characters\r\nguest_counter = Counter(guest_name)\r\nhost_counter = Counter(host_name)\r\npile_counter = Counter(pile_letters)\r\n\r\n# Combine the Counter objects for guest and host\r\nexpected_counter = guest_counter + host_counter\r\n\r\n# Check if the expected counter matches the pile counter\r\nif expected_counter == pile_counter:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1 = input()\r\ns2 = input()\r\ns = input()\r\ns3 = s1+s2\r\nd2={}\r\nfor i in s:\r\n if i in d2:\r\n d2[i]+=1\r\n else:\r\n d2[i]=1\r\nd={}\r\nfor i in s3:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nif(d2 == d):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\nb=list(input())\r\na=a+b\r\na.sort()\r\nc=list(input())\r\nc.sort()\r\nif a==c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# for I/O for local system\r\nfrom sys import stdin, stdout\r\nfrom os import path, read, fstat\r\nfrom io import BytesIO\r\n\r\nif (path.exists('Input.txt')):\r\n stdin = open(\"Input.txt\", \"r\")\r\n stdout = open(\"Output.txt\", \"w\")\r\n\r\n# For fast I/O\r\n#iinput = BytesIO(read(0, fstat(0).st_size)).readline\r\n#iinput = stdin.buffer.readline\r\niinput = stdin.readline\r\npprint = stdout.write\r\n\r\n# Import libraries here whenever required\r\nfrom random import randint\r\nfrom math import floor\r\n\r\n\r\n# Use this because normal dict can sometimes give TLE\r\nclass FastDict:\r\n def __init__(self, func=lambda: 0):\r\n self.random = randint(0, 1 << 32)\r\n self.default = func\r\n self.dict = {}\r\n\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\r\n def get(self, key, default):\r\n mykey = self.random ^ key\r\n if mykey not in self.dict:\r\n return default\r\n return self.dict[mykey]\r\n\r\n def __setitem__(self, key, item):\r\n mykey = self.random ^ key\r\n self.dict[mykey] = item\r\n\r\n def getkeys(self):\r\n return [self.random ^ i for i in self.dict]\r\n\r\n def __str__(self):\r\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\r\n\r\ns1, s2, letters = iinput().strip(), iinput().strip(), iinput().strip()\r\n\r\n\r\nif sorted(s1 + s2) == sorted(letters):\r\n pprint('YES')\r\nelse:\r\n pprint('NO')\r\n", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\nname = guest_name + host_name\r\n\r\nfrequency = {}\r\nfor letter in name:\r\n frequency[letter] = frequency.get(letter, 0) + 1\r\n\r\nfor letter in pile_letters:\r\n if letter in frequency:\r\n frequency[letter] -= 1\r\n if frequency[letter] < 0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nfor count in frequency.values():\r\n if count != 0:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "from collections import Counter\r\nimport math\r\nH = input()\r\nG = input()\r\nT = input()\r\nd = dict()\r\nfor i in range(len(T)):\r\n d[T[i]] = d.get(T[i], 0) + 1\r\n \r\ndef solve(H, G, d):\r\n for i in range(len(H)):\r\n if H[i] in d and d[H[i]] > 0:\r\n d[H[i]] -= 1\r\n else: return \"NO\"\r\n for i in range(len(G)):\r\n if G[i] in d and d[G[i]] > 0:\r\n d[G[i]] -= 1\r\n else: return \"NO\"\r\n for k in d:\r\n if d[k] > 0: return \"NO\"\r\n return \"YES\"\r\n \r\nprint(solve(H, G, d))\r\n\r\n \r\n", "print(\"YES\" if sorted(list(input()+input()))==sorted(list(input())) else \"NO\")", "\r\ndef name_(a,b,c):\r\n if list(sorted(a+b)) == list(sorted(c)):\r\n return True\r\n return False\r\nname = []\r\nfor _ in range(3):\r\n name.append(input())\r\nfor a,b,c in zip(name, name[1:], name[2:]):\r\n if name_(a,b,c) == True:\r\n print('YES')\r\n else:\r\n print('NO')", "A=list(input())\r\nB=list(input())\r\nC=list(input())\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nresult=[]\r\nfor i in range(26):\r\n l1.insert(i,0)\r\n l2.insert(i,0)\r\n l3.insert(i,0)\r\n result.insert(i,0)\r\nfor i in range(len(A)):\r\n l1[ord(A[i])-65]=l1[ord(A[i])-65]+1\r\nfor i in range(len(B)):\r\n l2[ord(B[i])-65]=l2[ord(B[i])-65]+1\r\nfor i in range(len(C)):\r\n l3[ord(C[i])-65]=l3[ord(C[i])-65]+1 \r\n\r\nfor i in range(26):\r\n result[i]=l1[i]+l2[i]\r\nif(result==l3):\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\") \r\n\r\n", "s1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\n\r\nfreq = [0] * 26\r\n\r\nfor c in s1:\r\n freq[ord(c) - ord('A')] += 1\r\n\r\nfor c in s2:\r\n freq[ord(c) - ord('A')] += 1\r\n\r\nfor c in s3:\r\n freq[ord(c) - ord('A')] -= 1\r\n\r\nif all(count == 0 for count in freq):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[*input()]\r\nl2=[*input()]\r\nl3=[*input()]\r\nl=l+l2\r\nl.sort()\r\nl3.sort()\r\nif(l==l3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\na = list(a)\r\nb = list(b)\r\nc = list(c)\r\nd = a + b\r\nc.sort()\r\nd.sort()\r\nif d == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nr=a+b\r\nr=sorted(r)\r\nc=sorted(c)\r\nif(r==c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\nd = a+b\r\nans = True\r\nif (len(c)!=len(d)):\r\n ans = False\r\nelse:\r\n for char in d:\r\n if(d.count(char)!=c.count(char)):\r\n ans= False\r\n break\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g, h, p = input().strip(), input().strip(), input().strip()\r\nl = [0] * 26\r\nfor c in g + h: l[ord(c) - 65] += 1\r\nfor c in p: l[ord(c) - 65] -= 1\r\nprint(\"YES\" if all(v == 0 for v in l) else \"NO\")", "a= input()\r\nb = input()\r\nc = input()\r\ns = sorted(a + b)\r\nc = sorted(c)\r\nif s == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def cs(s1,s2):\r\n d={}\r\n for i in s1:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n for i in s2:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n return d\r\ndef s(c):\r\n d={}\r\n for i in c:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n\r\n return d\r\na=input()\r\nb=input()\r\nc=input()\r\nx=cs(a,b)\r\ny=s(c)\r\nsx=dict(sorted(x.items()))\r\nsy=dict(sorted(y.items()))\r\nif sx==sy:print(\"YES\")\r\nelse:print(\"NO\")", "a = input()\r\nb = input()\r\nx = input()\r\n\r\nn = a+b\r\nn = list(n)\r\nn1 = n.sort()\r\n\r\nx = list(x)\r\nn1 = x.sort()\r\n\r\nif n==x :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=str(input())\r\ns2=str(input())\r\ns3=str(input())\r\ns=s1+s2\r\ns=list(s)\r\ns.sort()\r\ns3=list(s3)\r\ns3.sort()\r\nif(s3!=s):\r\n print('NO')\r\nelse:\r\n print('YES')", "def solve():\r\n a = input()\r\n b = input()\r\n c = input()\r\n print('YES' if sorted(a+b) == sorted(c) else 'NO')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "z1 = input()\r\nz2 = input()\r\nz3 = input()\r\n \r\nfreq_up = [0] * 26\r\n \r\nfor i in range(len(z1)):\r\n ch = ord(z1[i])\r\n freq_up[ch - 65] += 1\r\n \r\nfor i in range(len(z2)):\r\n ch = ord(z2[i])\r\n freq_up[ch - 65] += 1\r\n \r\nfreq_k = [0] * 26\r\n \r\nfor i in range(len(z3)):\r\n ch = ord(z3[i])\r\n freq_k[ch - 65] += 1\r\n \r\n \r\nt = False\r\n \r\nfor i in range(len(freq_k)):\r\n \r\n if freq_up[i] == freq_k[i]:\r\n continue\r\n else:\r\n t = True\r\n break\r\n \r\nif t:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "A = input()\r\nB = input()\r\nC = input()\r\nS = A + B\r\nS = sorted(S)\r\nC = sorted(C)\r\nif S == C:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nt = input()\r\nr = input()\r\nbetuk_s = [0]*26\r\nbetuk_r = [0]*26\r\nif len(s)+len(t) != len(r):\r\n print(\"NO\")\r\nelse:\r\n s += t\r\n for i in s:\r\n betuk_s[ord(i)-65] += 1\r\n for i in r:\r\n betuk_r[ord(i)-65] += 1\r\n if betuk_s == betuk_r:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "string1 = input()\r\nstring2 = input()\r\nstring3 = input()\r\nif sorted(string1+string2) == sorted(string3):\r\n print('YES')\r\nelse:\r\n print('NO')", "s1= sorted(input() + input())\r\ns2 = sorted(input())\r\nif s1 == s2:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "guest=input()\r\nhost=input()\r\nstr1=input()\r\nlst1,lst2=[],[]\r\nfor i in guest+host:\r\n lst1.append(i)\r\nfor i in str1:\r\n lst2.append(i)\r\nlst1.sort()\r\nlst2.sort()\r\nif(lst1==lst2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "print('YES') if sorted((input() + input())) == sorted(input()) else print('NO')", "strf = input()\r\nstrs = input()\r\nstrt = input()\r\ndic = {}\r\nstri = strf + strs\r\n\r\nif sorted(strt) == sorted(stri):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\n\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nl1=list(s1)\r\nl2=list(s2)\r\nl3=list(s3)\r\ncount1=0\r\ncount2=0\r\nif len(s1)+len(s2)==len(s3):\r\n for i in range(len(l1)):\r\n if l1[i] in l3:\r\n count1+=1\r\n l3.remove(l1[i])\r\n for i in range(len(l2)):\r\n if l2[i] in l3:\r\n count2+=1\r\n if count1+count2==len(s3):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ns1 = input()\r\ns2 = input()\r\nl = s+s1\r\nl = list(l)\r\nl.sort()\r\nl1 = list(s2)\r\nl1.sort()\r\nif l == l1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = [0] * 26\r\n\r\nfor _ in range(2):\r\n s = input()\r\n for x in s:\r\n a[ord(x)-65] += 1\r\ns = input()\r\nfor x in s:\r\n a[ord(x)-65] -= 1\r\nb = True\r\nfor x in a:\r\n if x != 0:\r\n b = False\r\n break\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')", "firstName = input()\r\nsecondName = input()\r\nmixedLetters = input()\r\n\r\nnames = list(firstName) + list(secondName)\r\nmixedLetters = list(mixedLetters)\r\n\r\n\r\nif len(mixedLetters) != len(firstName) + len(secondName):\r\n answer = \"NO\"\r\nelse:\r\n answer = \"YES\"\r\n for i in range(len(names)):\r\n if (names[i] in mixedLetters):\r\n mixedLetters.remove(names[i])\r\n else:\r\n answer = \"NO\"\r\n break\r\n\r\nprint(answer)", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\ndict1 = {}\r\ndict2 = {}\r\n\r\nfor i in s3:\r\n dict2[i] = dict2.get(i, 0) + 1\r\nfor i in s1:\r\n dict1[i] = dict1.get(i, 0) + 1\r\nfor i in s2:\r\n dict1[i] = dict1.get(i, 0) + 1\r\n\r\n\r\nif dict1 == dict2:\r\n print('YES')\r\nelse:\r\n print('NO')", "# Read the guest's name, host's name, and the pile of letters\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\nletter_pile = input().strip()\r\n\r\n# Concatenate the guest's and host's names\r\ncombined_names = guest_name + host_name\r\n\r\n# Create a dictionary to count the occurrences of each letter in the combined names\r\nletter_count = {}\r\nfor letter in combined_names:\r\n letter_count[letter] = letter_count.get(letter, 0) + 1\r\n\r\n# Iterate through the letters in the pile and update the counts\r\nfor letter in letter_pile:\r\n if letter_count.get(letter, 0) == 0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n letter_count[letter] -= 1\r\n\r\n# Check if there are any remaining letters\r\nfor count in letter_count.values():\r\n if count != 0:\r\n print(\"NO\")\r\n exit()\r\n\r\n# If all checks passed, the letters can be used to reconstruct the names\r\nprint(\"YES\")\r\n", "guest, host, letters = input(), input(), input()\r\nnames = guest + host\r\nif len(names) != len(letters):\r\n out = 'NO'\r\nelse:\r\n out = 'YES'\r\n for char in letters:\r\n i = names.find(char)\r\n if i == -1:\r\n out = 'NO'\r\n else:\r\n names = names[:i] + names[i+1:]\r\n\r\nprint(out)\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = s1 + s2\r\nif sorted(s3) == sorted(s) : print(\"YES\")\r\nelse : print(\"NO\")", "guest, host, stack = input(), input(), sorted(input())\r\nfull = sorted(list(guest + host))\r\nif stack == full:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "guest = input() # Read the guest's name\r\nhost = input() # Read the host's name\r\npile = input() # Read the pile of letters\r\n\r\nconcatenated_names = guest + host # Concatenate the guest's name and the host's name\r\n\r\nfrequency = {} # Dictionary to count the frequency of each letter\r\nfor letter in pile:\r\n frequency[letter] = frequency.get(letter, 0) + 1\r\n\r\nfor letter in concatenated_names:\r\n if frequency.get(letter, 0) == 0:\r\n print(\"NO\") # If a letter is missing from the pile, output \"NO\"\r\n exit()\r\n else:\r\n frequency[letter] -= 1\r\n\r\nfor count in frequency.values():\r\n if count != 0:\r\n print(\"NO\") # If a letter has a higher count in the pile than in the names, output \"NO\"\r\n exit()\r\n\r\nprint(\"YES\") ", "u = (str)(input())\r\nv = (str)(input())\r\nt = (str)(input())\r\ncnt = []\r\nfor x in range(0, 26):\r\n cnt.append(0)\r\nfor x in range(0, len(u)):\r\n cnt[(ord)(u[x])-(ord)('A')] = cnt[(ord)(u[x])-(ord)('A')]+1\r\nfor x in range(0, len(v)):\r\n cnt[(ord)(v[x])-(ord)('A')] = cnt[(ord)(v[x])-(ord)('A')]+1\r\nfor x in range(0, len(t)):\r\n cnt[(ord)(t[x])-(ord)('A')] = cnt[(ord)(t[x])-(ord)('A')]-1\r\n\r\nb = 1\r\nfor x in range(0, 26):\r\n if cnt[x]!=0: b = 0\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')", "guestName = input()\r\nresidence = input()\r\ndoor = input()\r\n\r\nfull = guestName+residence\r\n\r\nif sorted(full) != sorted(door):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x=input()+input()\r\ns=input()\r\nif(len(s)!=(len(x))):\r\n print(\"NO\")\r\n exit()\r\n \r\nelse:\r\n for j in s:\r\n if(x.count(j)!=s.count(j)):\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")", "def find_and_pop_character(arr, char_to_remove):\r\n try:\r\n index_to_remove = arr.index(char_to_remove)\r\n arr.pop(index_to_remove)\r\n return index_to_remove\r\n except ValueError:\r\n return None\r\n\r\na = input()\r\nb = input()\r\nc = list(input())\r\nif (len(a) + len(b) < len(c)):\r\n print('NO')\r\nelse:\r\n try:\r\n for s in a:\r\n i = find_and_pop_character(c, s)\r\n if i is None:\r\n raise KeyboardInterrupt\r\n\r\n for s in b:\r\n i = find_and_pop_character(c, s)\r\n if i is None:\r\n raise KeyboardInterrupt\r\n\r\n print('YES')\r\n except KeyboardInterrupt:\r\n print('NO')", "txt1 = input()\r\ntxt2 = input()\r\npuz = input()\r\nif sorted(txt1+txt2) == sorted(puz):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = list()\r\ne = list()\r\nfor i in a:\r\n d.append(ord(i))\r\nfor i in b:\r\n d.append(ord(i))\r\nfor i in c:\r\n e.append(ord(i))\r\nd.sort()\r\ne.sort()\r\nif e == d:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nsum=a+b;\r\nsum.sort()\r\nc.sort()\r\nprint(\"YES\")if(sum==c)else print(\"NO\")", "im1=input()\nim2=input()\nk=input()\nim1+=im2\nd=[]\ns=[]\nfor i in im1:\n d.append(i)\nfor i in k:\n s.append(i)\nd.sort()\ns.sort()\nif d==s:\n print('YES')\nelse:\n print('NO') \n# Sat Jul 08 2023 11:19:39 GMT+0300 (Moscow Standard Time)\n", "s1=list(input()+input())\r\ns3=list(input())\r\ns3.sort()\r\ns1.sort()\r\nif s1==s3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check_names(guest_name, host_name, letters):\r\n concatenated_name = guest_name + host_name\r\n letter_counts = {}\r\n for letter in concatenated_name:\r\n if letter in letter_counts:\r\n letter_counts[letter] += 1\r\n else:\r\n letter_counts[letter] = 1\r\n for letter in letters:\r\n if letter in letter_counts:\r\n letter_counts[letter] -= 1\r\n if letter_counts[letter] < 0:\r\n return \"NO\"\r\n else:\r\n return \"NO\"\r\n for count in letter_counts.values():\r\n if count != 0:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile_letters = input().strip()\r\nresult = check_names(guest_name, host_name, pile_letters)\r\nprint(result)\r\n", "def can_restore_names(guest_name, host_name, pile_letters):\r\n combined_names = guest_name + host_name\r\n \r\n # Check if the combined names and pile letters have the same set of characters\r\n return sorted(combined_names) == sorted(pile_letters)\r\n\r\n# Read input\r\nguest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\n# Check if names can be restored\r\nresult = can_restore_names(guest_name, host_name, pile_letters)\r\n\r\n# Print the result\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b, c = input(), input(), input()\r\nq = []\r\nq.extend(a + b)\r\nq.sort()\r\nw = []\r\nw.extend(c)\r\nw.sort()\r\nif ''.join(q) == ''.join(w):\r\n print ('YES')\r\nelse:\r\n print ('NO')", "sper1 = input()\r\nsper2 = input()\r\ntotal_sper = sper1+sper2\r\nword = \"\".join(sorted(total_sper))\r\nkh = input()\r\nkh = \"\".join(sorted(kh))\r\nif kh == word:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "guest = input()\r\nhost = input()\r\npile = input()\r\ndic, pile_dic = {}, {}\r\nfor letter in guest:\r\n dic[letter] = 1 + dic.get(letter, 0)\r\nfor letter in host:\r\n dic[letter] = 1 + dic.get(letter, 0)\r\nfor letter in pile:\r\n pile_dic[letter] = 1 + pile_dic.get(letter, 0)\r\n\r\nprint(\"YES\" if dic == pile_dic else \"NO\")\r\n", "guest_name=input()\r\nhost=input()\r\npile=input()\r\ncombine=guest_name+host\r\nsc=''.join(sorted(combine))\r\nsp=''.join(sorted(pile))\r\nif(sc==sp):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input().upper()\r\nb=input().upper()\r\nm=input().upper()\r\n\r\nc=a+b\r\nd=sorted(c)\r\nn=sorted(m)\r\n\r\nif d==n:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=list(input())\r\nA=list(a+b)\r\nA=sorted(A)\r\nc=sorted(c)\r\nif A==c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g = input()\nh = input()\ns = input()\n\nif all(char in s for char in g + h) and sorted(g + h) == sorted(s):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = a + b\r\nkq = \"YES\"\r\nfor i in range(ord(\"A\"),ord(\"Z\")+1):\r\n if d.count(chr(i)) != c.count(chr(i)):\r\n kq = \"NO\"\r\nprint(kq)", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\n\r\ncombined_names = guest_name + host_name\r\ncombined_names = sorted(combined_names)\r\npile_letters = sorted(pile_letters)\r\n\r\n\r\nif combined_names == pile_letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Function to check if the letters in the pile can make the names\r\ndef can_make_names(guest_name, host_name, letter_pile):\r\n # Combine the guest's name and host's name\r\n combined_name = guest_name + host_name\r\n # Sort the letters in the combined name and the letter pile\r\n combined_name_sorted = ''.join(sorted(combined_name))\r\n letter_pile_sorted = ''.join(sorted(letter_pile))\r\n # Compare the sorted combined name with the sorted letter pile\r\n return combined_name_sorted == letter_pile_sorted\r\n\r\n# Read the guest's name, host's name, and the letter pile\r\nguest_name = input()\r\nhost_name = input()\r\nletter_pile = input()\r\n\r\n# Check if the letters in the pile can make the names\r\nif can_make_names(guest_name, host_name, letter_pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\narr = a + b\r\nc1 = sorted(c)\r\narr1 = sorted(arr)\r\nif c1 == arr1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\na += b\r\nc = sorted(c)\r\na = sorted(a)\r\nif a == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1=input()\r\ns2=input()\r\ns=input()\r\ns=sorted(s)\r\nc=s1+s2\r\nif sorted(c)==s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "gust = list(input())\nhotel = list(input())\npaile = list(input())\n\ngust.extend(hotel)\ngust.sort()\npaile.sort()\n\nif gust == paile:\n print(\"YES\")\nelse:\n print(\"NO\")", "s=sorted\r\ni=input\r\nprint('YNEOS'[s(i()+i())!=s(i())::2])", "n1=input()\r\nn2=input()\r\nn3=input()\r\n\r\nfreq1={}\r\nfreq2={}\r\nfor i in n1 :\r\n if i in freq1:\r\n freq1[i]+=1\r\n else:\r\n freq1[i]=1\r\n\r\nfor i in n2 :\r\n if i in freq1:\r\n freq1[i]+=1\r\n else:\r\n freq1[i]=1\r\n \r\nfor i in n3:\r\n if i in freq2:\r\n freq2[i]+=1\r\n else:\r\n freq2[i]=1\r\n\r\nif freq1==freq2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\narr = a + b\r\nc1 = ''.join(sorted(c))\r\narr1 = ''.join(sorted(arr))\r\nif c1 == arr1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g=input()\r\nh=input()\r\np=input()\r\nc=g+h\r\nc=sorted(c)\r\np=sorted(p)\r\nif c==p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input() \r\ns2 = input() \r\ns3 = list(input())\r\ns4 = s1 + s2 \r\nv =\"YES\"\r\nfor i in s4 : \r\n if i in s3 : \r\n s3.remove(i) \r\n else : \r\n v = \"NO\" \r\n break\r\n \r\nif len(s3) != 0 : \r\n v = \"NO\" \r\nprint(v)\r\n\r\n", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nd = a + b\r\nd.sort()\r\nc.sort()\r\nif c == d:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nl1=list(s1)\r\nl2=list(s2)\r\nls=l1+l2\r\nl3=list(s3)\r\nls.sort()\r\nl3.sort()\r\nif ls==l3:\r\n print('YES')\r\nelse:\r\n print('NO')", "guest_name = list(input())\r\nhost_name = list(input())\r\nname_lst = sorted(list(input()))\r\njudge_lst = sorted(guest_name + host_name)\r\nif name_lst == judge_lst:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l1=(sorted(list(map(str,input()))+list(map(str,input()))))\r\nl2=(sorted(list(map(str,input()))))\r\nans=1\r\nif(len(l1)!=len(l2)):ans=0\r\nelse:\r\n\tfor i in range(len(l1)):\r\n\t\tif l1[i]!=l2[i]:\r\n\t\t\tans=0\r\n\t\t\tbreak;\r\n\t\tans=1\r\nif ans==1:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "from collections import Counter\r\na=input()\r\nb=input()\r\nc=input()\r\nx=Counter(a)\r\ny=Counter(b)\r\nz=Counter(c)\r\nif x+y ==z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n alpha_length = 26\r\n first = [0] * alpha_length\r\n second = [0] * alpha_length\r\n\r\n line = input().strip()\r\n for char in line:\r\n first[ord(char) - ord('A')] += 1\r\n\r\n line = input().strip()\r\n for char in line:\r\n first[ord(char) - ord('A')] += 1\r\n\r\n line = input().strip()\r\n for char in line:\r\n second[ord(char) - ord('A')] += 1\r\n\r\n output = \"YES\"\r\n for k in range(alpha_length):\r\n if first[k] != second[k]:\r\n output = \"NO\"\r\n break\r\n\r\n print(output)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\nprint(\"YES\" if sorted(s3) == sorted(s1+s2) else \"NO\")", "from collections import Counter\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nname=s1+s2\r\n'''name_counter=Counter(name)\r\ns3_counter=Counter(s3)'''\r\nif Counter(name)==Counter(s3):\r\n print('YES')\r\nelse:\r\n print('NO')", "g = list(input())\r\ng += list(input())\r\nc = list(input())\r\ng.sort()\r\nc.sort()\r\nif g == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=list(input())\r\nn1=list(input())\r\nn2=sorted(list(input()))\r\nll=sorted(n+n1)\r\nif ll==n2:print(\"YES\")\r\nelse:print(\"NO\")", "a = list(input())\r\nb = list(input())\r\ns = a + b\r\nd = list(input())\r\ns.sort()\r\nd.sort()\r\nif(s == d):\r\n print('YES')\r\nelse:\r\n print('NO')", "g = input()\r\nh = input()\r\nw1 = sorted(g+h)\r\nw2 = sorted(input())\r\nprint(\"YES\") if w1 == w2 else print(\"NO\")\r\n ", "g=(input())\r\nh=(input())\r\nc=(input())\r\nprint(\"YES\" if sorted(g+h)==sorted(c) else \"NO\")", "a = input()\r\nb = input()\r\nc = sorted(input())\r\nd = sorted(a+b)\r\nif d==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "h=input()\r\nu=input()\r\ni=input()\r\nfunny=h+u\r\nslojna=sorted(funny)\r\nlegko=sorted(i)\r\nif slojna==legko:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n# Sat Jul 08 2023 11:49:53 GMT+0300 (Moscow Standard Time)\n", "g_n=input()\r\nh_n=input()\r\np_l=input()\r\nn=g_n+h_n\r\nsorted_n=sorted(n)\r\nsorted_p_l=sorted(p_l)\r\nif sorted_n==sorted_p_l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\n\r\ns = []\r\nfor i in c:\r\n s.append(ord(i)-65)\r\ncount = [0]*26\r\n\r\nfor i in s:\r\n count[i] += 1\r\n\r\nd = a + b\r\ns1 = []\r\ncount1 = [0]*26\r\n\r\nfor i in d:\r\n s1.append(ord(i)-65)\r\n\r\nfor i in s1:\r\n count1[i] += 1\r\n\r\nif count == count1:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=a+b\r\nd=\"\"\r\nlst1 = [c[i] for i in range(0,len(c))]\r\nlst1.sort()\r\nfor i in lst1:\r\n d+=i\r\ne=input()\r\nf=''\r\nlst2 = [e[i] for i in range(0,len(e))]\r\nlst2.sort()\r\nfor i in lst2:\r\n f+=i\r\nif d==f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g1 = str(input())\r\ng2 = str(input())\r\nletters = str(input())\r\n\r\nnames = list(g1) + list(g2)\r\nletters = list(letters)\r\n\r\nnames.sort()\r\nletters.sort()\r\n\r\nif names == letters and len(names) == len(letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "# 141A - Amusing Joke\r\ndef remove_letters(str1, str2):\r\n for x in str1:\r\n if x in str2:\r\n str2.remove(x)\r\n return str2;\r\n \r\n \r\n \r\nif __name__ == '__main__':\r\n guest_name = input()\r\n residence_host_name = input()\r\n letters = list(input())\r\n if len(letters) != len(guest_name) + len(residence_host_name) :\r\n print('NO')\r\n else :\r\n letters = remove_letters(guest_name,letters)\r\n letters = remove_letters(residence_host_name,letters)\r\n if len(letters) is 0 :\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "a, b = input() + input(), input()\na = {e: a.count(e) for e in set(a)}\nb = {e: b.count(e) for e in set(b)}\n\nprint('YES') if a == b else print('NO')\n", "g=input()\r\nh=input()\r\nj=''.join(sorted(input()))\r\nt=''.join(sorted(g+h))\r\nif j==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = s1 + s2\r\nnew_s3 = set(s3)\r\nresult = 1\r\nif len(s) == len(s3):\r\n for i in new_s3:\r\n if s3.count(i) != s.count(i):\r\n result = 0\r\n break\r\n if result == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=[]\r\nw=[]\r\nfor i in a:\r\n d+=[i]\r\nfor j in b:\r\n d+=[j]\r\nfor q in c:\r\n w+=[q]\r\nif sorted(d)==sorted(w):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n#print(sorted(d))\r\n", "st=[i for i in input()] \r\nnd=[i for i in input()] \r\nob=sorted([i for i in input()]) \r\nif sorted(st+nd)==ob:\r\n print('YES')\r\nelse:\r\n print('NO')", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\ncombined_names = guest_name + host_name\r\n\r\npile_list = list(pile_letters)\r\n\r\n# Iterate over each character in the combined names\r\nfor char in combined_names:\r\n if char in pile_list:\r\n pile_list.remove(char) # Remove the character from the pile if it exists\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n # Check if there are any remaining letters in the pile\r\n if len(pile_list) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\ndef count_letters(s):\r\n letter_count = {}\r\n for letter in s:\r\n if letter in letter_count:\r\n letter_count[letter] += 1\r\n else:\r\n letter_count[letter] = 1\r\n return letter_count\r\nguest_count = count_letters(guest_name)\r\nhost_count = count_letters(host_name)\r\nfor letter in pile_of_letters:\r\n if letter in guest_count:\r\n guest_count[letter] -= 1\r\n if guest_count[letter] == 0:\r\n del guest_count[letter]\r\n elif letter in host_count:\r\n host_count[letter] -= 1\r\n if host_count[letter] == 0:\r\n del host_count[letter]\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n if not guest_count and not host_count:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "count=0\r\nx=input()\r\ny=input()\r\nz=sorted(list(x+y))\r\np=sorted(list(input()))\r\nx1=len(z)\r\ny1=len(p)\r\nif x1!=y1:\r\n print(\"NO\")\r\nelse:\r\n for i in range(x1):\r\n if(z[i]!=p[i]):\r\n print(\"NO\")\r\n break\r\n else:\r\n count=count+1\r\nif(count==x1):\r\n print(\"YES\")\r\n ", "a = input('')\r\nb = input('')\r\nc = input('')\r\n\r\nd = a+b\r\nerro = True\r\n\r\nd = sorted(d)\r\nc = sorted(c)\r\n\r\nif len(c) != len(d):\r\n print('NO')\r\n\r\nelse:\r\n for j in range(len(c)):\r\n if d[j] != c[j]:\r\n erro = False\r\n\r\n if erro == True:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "x = input()\r\ny = input()\r\nz = input()\r\n\r\n#print(len(x+y)- len(z))\r\n\r\nv = list(x+y)\r\nb = list(z)\r\nv.sort()\r\nb.sort()\r\no = \"\".join(v)\r\nm = \"\".join(b)\r\n\r\nif o == m and len(v) == len(b): \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "name1 = input()\r\nname2 = input()\r\nletters = input()\r\n\r\nfrom collections import Counter\r\ndef solution(name1, name2, letters):\r\n names = Counter(name1)\r\n for letter in name2:\r\n if letter in names:\r\n names[letter] += 1\r\n else:\r\n names[letter] = 1\r\n for letter in letters:\r\n if letter in names:\r\n names[letter] -= 1\r\n else:\r\n return False\r\n return all(x==0 for x in names.values())\r\n \r\nprint('YES') if solution(name1, name2, letters) else print('NO')", "s1=input(\"\")\r\ns2=input(\"\")\r\ns1=s1+s2\r\ns3=input(\"\")\r\ns1=[str(s1[i]) for i in range(len(s1))]\r\ns3=[str(s3[j]) for j in range(len(s3))]\r\ns1.sort()\r\ns3.sort()\r\nif s1==s3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s,i=sorted,input;print('YNEOS'[s(i()+i())!=s(i())::2])", "f=input()\r\ng=input()\r\nh=input()\r\nk=sorted(f+g)\r\nif(k==sorted(h)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Function to check if it's possible to create the names from the pile of letters\r\ndef is_possible_to_create_names(guest_name, host_name, pile_of_letters):\r\n # Concatenate guest_name and host_name to form the expected name\r\n expected_name = guest_name + host_name\r\n\r\n # Create dictionaries to count the occurrences of each character in both strings\r\n char_count_expected = {}\r\n char_count_pile = {}\r\n\r\n # Count characters in the expected name\r\n for char in expected_name:\r\n char_count_expected[char] = char_count_expected.get(char, 0) + 1\r\n\r\n # Count characters in the pile of letters\r\n for char in pile_of_letters:\r\n char_count_pile[char] = char_count_pile.get(char, 0) + 1\r\n\r\n # Check if the characters in the pile of letters match the expected name\r\n possible = all(char_count_expected.get(char, 0) == char_count_pile.get(char, 0) for char in expected_name)\r\n\r\n # Check for extra letters in the pile of letters\r\n for char in pile_of_letters:\r\n if char not in char_count_expected:\r\n possible = False\r\n break\r\n\r\n return possible\r\n\r\n# Main program\r\nguest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\n\r\nif is_possible_to_create_names(guest_name, host_name, pile_of_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ns=a+b\r\nres1 = ''.join(sorted(s))\r\nres2 = ''.join(sorted(c))\r\nif(res1==res2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1, s2, s3 = list(input()), list(input()), list(input())\r\n\r\n\r\ndef solve():\r\n for i in s3:\r\n if i in s1:\r\n s1.remove(i)\r\n elif i in s2:\r\n s2.remove(i)\r\n else:\r\n print(\"NO\")\r\n return\r\n\r\n if len(s1) == len(s2) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "print(\"YES\" if sorted([i for i in input()]+[j for j in input()])==sorted([l for l in input()]) else \"NO\")\r\n", "a = input()\r\nb = input()\r\na += b\r\na = sorted(a)\r\nc = input()\r\nc = sorted(c)\r\nif a == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n# Sat Jul 08 2023 15:19:13 GMT+0300 (Moscow Standard Time)\n", "def restore_names(guest_name, host_name, pile_letters):\r\n combined_names = guest_name + host_name\r\n\r\n # Check if the sorted combined names match the sorted pile of letters\r\n return sorted(combined_names) == sorted(pile_letters)\r\n\r\n# Read input\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile_letters = input().strip()\r\n\r\n# Check if the names can be restored\r\nresult = restore_names(guest_name, host_name, pile_letters)\r\n\r\n# Output the result\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\nimport math\n\nsys.setrecursionlimit(100000000)\nmod=1000000007\n\n#inputs\ndef ipint ():\n return int(sys.stdin.readline())\n\ndef ipfloat (): \n return float(sys.stdin.readline())\n\ndef ipline ():\n return sys.stdin.readline().strip()\n\ndef iplist ():\n return list(map(int,sys.stdin.readline().split()))\n\ndef mapvar ():\n return map(int,sys.stdin.readline().strip().split())\n\n#math functions\ndef floor (x):\n return math.floor(x) \n\ndef ceil (x):\n return math.ceil(x)\n\n#list & string functions \ndef rev (x):\n return x[::-1]\n\ndef isSorted(x):\n xrev = x[:]\n xrev.sort()\n if x == xrev:\n return True\n else:\n return False\n\n#print fuctions\ndef printlist(x):\n print(*x,sep=\" \")\n\ndef new_magic_wand(): \n ogg = ipline()\n ogo = ipline()\n new = ipline()\n\n n = ogg+ogo\n n = list(n)\n n1 = n.sort()\n\n new = list(new)\n new1 = new.sort()\n\n if n==new :\n print(\"YES\")\n else:\n print(\"NO\")\n \ndef i_miss_the_old_kanye_straight_from_the_go_kanye ():\n new_magic_wand()\n\nif __name__ == \"__main__\":\n i_miss_the_old_kanye_straight_from_the_go_kanye()\n\n\t \t\t \t\t \t \t\t\t\t\t \t\t\t\t \t\t\t\t\t", "a, b, c = input(), input(), input()\nif sorted(a + b) == sorted(c):\n print(\"YES\")\nelse:\n print(\"NO\")", "n=input()+input()\r\ns=input()\r\nn=\"\".join(sorted(n))\r\ns=\"\".join(sorted(s))\r\nprint(\"YES\" if n==s else \"NO\")", "string = input() + input()\r\npermutation = input()\r\n\r\nfrom collections import Counter\r\n\r\n# Count character frequencies in the string\r\nstring_count = Counter(string)\r\n\r\n# Count character frequencies in the permutation\r\npermutation_count = Counter(permutation)\r\n\r\n# Check if it's possible to rearrange the string to form the permutation\r\nif string_count == permutation_count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\n\r\nguest = list(input())\r\nhost = list(input())\r\npile = Counter(list(input()))\r\n\r\nguest.extend(host)\r\nguest = Counter(guest)\r\nif guest == pile:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = list(input())\r\na_b = list(a + b)\r\n(a_b).sort()\r\nc.sort()\r\nif a_b == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\ns3 = sorted(s3)\r\nk = sorted(s2+s1)\r\nif s3 == k:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\r\n n1 = input()\r\n n2 = input()\r\n s_name = input()\r\n s_name_ =[i for i in s_name]\r\n for each in n1:\r\n if each not in s_name_:\r\n print('NO')\r\n return\r\n else:\r\n s_name_.remove(each)\r\n for each in n2:\r\n if each not in s_name_:\r\n print('NO')\r\n return\r\n else:\r\n s_name_.remove(each)\r\n print('YES') if s_name_==[] else print('NO')\r\nmain()\r\n", "name1 = input()\nname2 = input()\nletters = input()\n\nnames = name1 + name2\nsorted_names = sorted(names)\nsorted_letters = sorted(letters)\n\nif sorted_names == sorted_letters:\n print(\"YES\")\nelse:\n print(\"NO\")\n# Sat Jul 08 2023 10:50:38 GMT+0300 (Moscow Standard Time)\n", "import sys\r\n\r\nguest = input()\r\nhost = input()\r\npile = list(input())\r\n\r\nfor x in guest:\r\n if x in pile:\r\n pile.remove(x)\r\n else:\r\n print('NO')\r\n sys.exit()\r\n\r\nfor y in host:\r\n if y in pile:\r\n pile.remove(y)\r\n else:\r\n print('NO')\r\n sys.exit()\r\n\r\nif len(pile) != 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n \r\n", "s1 = input()\r\ns2 = input()\r\nsoll = input()\r\n\r\nisOK = 1\r\nfor i in s1:\r\n i_index = soll.find(i)\r\n if i_index != -1:\r\n soll = soll[:i_index] + soll[i_index + 1:]\r\n else:\r\n isOK = 0\r\n break\r\nelse:\r\n for i in s2:\r\n i_index = soll.find(i)\r\n if i_index != -1:\r\n soll = soll[:i_index] + soll[i_index + 1:]\r\n else:\r\n isOK = 0\r\n break\r\nif(isOK and (len(soll) == 0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "guest,resident,permutted=[input() for _ in range(3)]\r\nif len(guest)+len(resident)!=len(permutted):print(\"NO\")\r\nelse:\r\n UPPERMAP = lambda x : ord(x)-ord('A')\r\n L1,L2,Result=[0]*26,[0]*26,[0]*26\r\n for x in guest:L1[UPPERMAP(x)]+=1\r\n for x in resident:L2[UPPERMAP(x)]+=1\r\n for x in permutted:Result[UPPERMAP(x)]+=1\r\n ADD=lambda x,y: x+y\r\n if tuple(map(ADD,L1,L2))==tuple(Result):print(\"YES\")\r\n else:print(\"NO\")\r\n", "from collections import Counter\r\n\r\na = Counter(input()) + Counter(input())\r\nb = Counter(input())\r\nif a == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nfor i in range(len(s2)):\r\n s1 += s2[i]\r\nc = 0\r\nb = 0\r\nfor i in range(len(s1)+1):\r\n if i == len(s1):\r\n c = 1\r\n break\r\n if b == 1:\r\n break\r\n for j in range(len(s3)+1):\r\n if j == len(s3):\r\n c = 0\r\n print(\"NO\", end=\"\")\r\n b = 1\r\n break\r\n if s1[i] == s3[j] and s3[j] != '\\0':\r\n s3 = s3[:j] + '\\0' + s3[j+1:]\r\n break\r\n continue\r\nif c == 1:\r\n for i in range(len(s3)+1):\r\n if i == len(s3):\r\n print(\"YES\", end=\"\")\r\n break\r\n if s3[i] == '\\0':\r\n continue\r\n else:\r\n print(\"NO\", end=\"\")\r\n break", "def counter(text):\r\n dic = dict.fromkeys(text,0)\r\n for l in text:\r\n dic[l] += 1\r\n return dic\r\ndef run():\r\n text1 = input()\r\n text2 = input()\r\n textj = input()\r\n\r\n textplus = text1 + text2\r\n dic1 = counter(textplus)\r\n dic2 = counter(textj)\r\n if dic1 == dic2:\r\n print(\"YES\")\r\n else: \r\n print(\"NO\")\r\nif __name__ == \"__main__\":\r\n run()", "st1 = input().lower()\r\nst2 = input().lower()\r\nst3 = input().lower()\r\nst_ = st1 + st2\r\n\r\nif sorted(st_) == sorted(st3):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = (input()+input())\r\nb = input()\r\n\r\na=''.join(sorted(a))\r\nb=''.join(sorted(b))\r\n\r\nif a==b :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest = input()\r\nhost = input()\r\njoke = input()\r\n\r\nfinal = guest + host\r\nfinal = ''.join(sorted(final))\r\njoke = ''.join(sorted(joke))\r\n\r\nif final == joke:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# Read input\r\nguest = input().strip()\r\nhost = input().strip()\r\nletters = input().strip()\r\n\r\n# Concatenate guest and host names\r\nnames = guest + host\r\n\r\n# Check if the letters can be rearranged to form the names\r\nfor letter in names:\r\n if letter in letters:\r\n letters = letters.replace(letter, '', 1)\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n if len(letters) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "ded1 = input()\r\nded2 = input()\r\npile = input()\r\nbukvar1 = [0] * 26\r\nbukvar2 = [0] * 26\r\ntotal = ded1 + ded2\r\nfor i in total.lower():\r\n nomer1 = ord(i) - 97\r\n bukvar1[nomer1] += 1\r\nfor i in pile.lower():\r\n nomer2 = ord(i) - 97\r\n bukvar2[nomer2] += 1\r\nresult = [0]\r\nfor i in range(26):\r\n if bukvar1[i] != bukvar2[i]:\r\n result[0] = 'NO'\r\n break\r\n else:\r\n result[0] = 'YES'\r\nprint(result[0])", "guest_name = input().strip()\r\nhost_name = input().strip()\r\npile = input().strip()\r\n\r\n# Concatenate the guest's name and host's name\r\nnames = guest_name + host_name\r\n\r\n# Check if the length of the concatenated names matches the length of the pile\r\nif len(names) != len(pile):\r\n print(\"NO\")\r\nelse:\r\n # Check if all the characters in the concatenated names appear in the pile\r\n for c in names:\r\n if c in pile:\r\n pile = pile.replace(c, \"\", 1)\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n # If all characters appear in the pile, but there are still some characters left in the pile\r\n # then the answer is also \"NO\"\r\n if pile:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "import sys\r\n\r\nname = []\r\nfor line in sys.stdin:\r\n for word in line.split():\r\n name.append(list(word))\r\n\r\n\r\nletters = name[0] + name[1]\r\nother_letters = name[2]\r\nletters.sort()\r\nother_letters.sort()\r\nif letters == other_letters:\r\n print('YES')\r\nelse:\r\n print('NO')", "x1, x2, x3 = input(), input(), list(input())\r\ny = x1+x2\r\n\r\nif sorted(y) == sorted(x3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input\r\nguest_name = input().strip()\r\nhost_name = input().strip()\r\npile_letters = input().strip()\r\n\r\n# Combine the guest's name and host's name\r\ncombined_names = guest_name + host_name\r\n\r\n# Count the frequency of each letter in the combined names\r\nletter_count_combined = {}\r\nfor letter in combined_names:\r\n letter_count_combined[letter] = letter_count_combined.get(letter, 0) + 1\r\n\r\n# Count the frequency of each letter in the pile of letters\r\nletter_count_pile = {}\r\nfor letter in pile_letters:\r\n letter_count_pile[letter] = letter_count_pile.get(letter, 0) + 1\r\n\r\n# Compare the two frequency dictionaries\r\nif letter_count_combined == letter_count_pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g1 = input()\r\ng2 = input()\r\ns = input()\r\ng1 = g1 + g2\r\ng1 = list(g1)\r\ng1.sort()\r\ns = list(s)\r\ns.sort()\r\nif g1 == s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=list(input())\r\nl=l+list(input())\r\nl.sort()\r\ns=list(input())\r\ns.sort()\r\nif s==l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#첫번째, 두번째 문자열을 분리해서 리스트에 넣고 합친다음에 sorting한게\r\n#마지막 리스트랑 똑같으면 Yes\r\n\r\na=input()\r\nb=input()\r\nc=input()\r\n\r\nx=[]\r\ny=[]\r\n\r\nfor i in a:\r\n x.append(i)\r\n\r\nfor i in b:\r\n x.append(i)\r\n\r\nfor j in c:\r\n y.append(j)\r\n\r\nx.sort()\r\ny.sort()\r\n\r\nif x==y:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(input())\r\nb = list(input())\r\nf = list(input())\r\nif len(f) != (len(a)+len(b)):\r\n print('NO')\r\nelse:\r\n for i in a:\r\n if i in f:\r\n ii = f.index(i)\r\n f.pop(ii)\r\n for i in b:\r\n if i in f:\r\n ii = f.index(i)\r\n f.pop(ii)\r\n\r\n if len(f) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\r\n\r\n# Input the guest's name, host's name, and pile of letters\r\nguest_name = input()\r\nhost_name = input()\r\npile_of_letters = input()\r\n\r\n# Count the frequency of letters in the guest's name, host's name, and pile of letters\r\nguest_counts = Counter(guest_name)\r\nhost_counts = Counter(host_name)\r\npile_counts = Counter(pile_of_letters)\r\n\r\n# Check if the pile of letters could be rearranged to form the names\r\nif guest_counts + host_counts == pile_counts:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns1=s1+s2\r\ns1=\"\".join(sorted(s1))\r\ns3=\"\".join(sorted(s3))\r\nif(s1==s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "guest_name = input()\r\nhost_name = input()\r\npile_letters = input()\r\n\r\nconcatenated_names = guest_name + host_name\r\n\r\nfrequency_dict = {}\r\n\r\nfor letter in concatenated_names:\r\n frequency_dict[letter] = frequency_dict.get(letter, 0) + 1\r\n\r\nfor letter in pile_letters:\r\n if letter in frequency_dict:\r\n frequency_dict[letter] -= 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nif all(count == 0 for count in frequency_dict.values()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "while True:\r\n try:\r\n a=input()\r\n b=input()\r\n c=input()\r\n s=a+b\r\n s=\"\".join(sorted(s))\r\n c=\"\".join(sorted(c))\r\n if s==c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n except:\r\n break", "s1 = str(input());s2 = str(input());result_from_s1_and_s2 = str(input());d = {}\r\nfor i in s1 :\r\n if i in d :d[i] += 1\r\n else:d[i] = 1\r\nfor k in s2 :\r\n if k in d :d[k] += 1\r\n else:d[k] = 1\r\nre = 0\r\nfor j in result_from_s1_and_s2 :\r\n if j in d :d[j] -= 1\r\n else:re += 1\r\nfor l in d :\r\n if d[l] > 0 or d[l] < 0 :re += 1\r\n else:pass\r\nif re >= 1 :print(\"NO\")\r\nelse:print(\"YES\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = s1 + s2\r\nL = [0]*26\r\n\r\nfor i in range(len(s)):\r\n L[ord(s[i])-ord('A')] += 1\r\n\r\nfor i in range(len(s3)):\r\n L[ord(s3[i])-ord('A')] -= 1\r\n\r\nb = 1\r\n\r\nfor i in range(len(L)):\r\n if L[i] != 0:\r\n b = 0\r\n break\r\n\r\nif b == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "word1 = input()\r\nword2 = input()\r\nshuff = input()\r\nsent = word1 + word2\r\nfor i in sent:\r\n\tif i not in shuff:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tshuff = shuff.replace(i, '',1)\r\n\r\n\r\nif len(shuff) ==0:\r\n\tprint('YES')\r\nelse:\r\n\tprint(\"NO\")", "a = input()\nb = input()\nc = input()\na += b\na = sorted(a)\nc = sorted(c)\nif a == c:\n print('YES')\nelse:\n print('NO')\n# Sat Jul 08 2023 11:26:23 GMT+0300 (Moscow Standard Time)\n", "def check(s,a):\r\n if(len(s)!=len(a)):\r\n return 0\r\n else:\r\n for j in range(len(s)):\r\n if s[j] in a:\r\n a.remove(z[j])\r\n else:\r\n return 0\r\n return 1\r\n\r\nx=str(input())\r\ny=str(input())\r\nz=str(input())\r\na=[]\r\nfor i in x:\r\n a.append(i)\r\nfor i in y:\r\n a.append(i)\r\nb=check(z,a)\r\nif(b==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a, b, c = input(), input(), input()\r\nd = {}\r\nfor e in c:\r\n if e in d:\r\n d[e] += 1\r\n else:\r\n d[e] = 1\r\nfor e in a:\r\n if e not in d:\r\n print('NO')\r\n break\r\n else:\r\n d[e] -= 1\r\n if d[e] == 0:\r\n d.pop(e)\r\nelse:\r\n for e in b:\r\n if e not in d:\r\n print('NO')\r\n break\r\n else:\r\n d[e] -= 1\r\n if d[e] == 0:\r\n d.pop(e)\r\n else:\r\n if len(d) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "s1=str(input())\r\ns2=str(input())\r\ns3=str(input())\r\ns=s1+s2\r\ns=sorted(s)\r\ns3=sorted(s3)\r\nif(s==s3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "Flag = 'YES'\r\nl = []\r\nfor i in range(3):\r\n l.append(str(input()))\r\ncombined_str = l[0] + l[1]\r\nout_dict = {}\r\nout_dict_out = {}\r\nfor ele in combined_str:\r\n if ele not in out_dict.keys():\r\n out_dict[ele] = 1\r\n else:\r\n out_dict[ele] = out_dict[ele] + 1\r\nfor ele in l[2]:\r\n if ele not in out_dict_out.keys():\r\n out_dict_out[ele] = 1\r\n else:\r\n out_dict_out[ele] = out_dict_out[ele] + 1\r\nif len(combined_str) != len(l[2]):\r\n Flag = 'NO'\r\nelse:\r\n for ele in out_dict.keys():\r\n if ele not in out_dict_out.keys():\r\n Flag = 'NO'\r\n elif out_dict[ele] != out_dict_out[ele]:\r\n Flag = 'NO'\r\n for ele in out_dict_out.keys():\r\n if ele not in out_dict.keys():\r\n Flag = 'NO'\r\n elif out_dict_out[ele] != out_dict[ele]:\r\n Flag = 'NO'\r\nprint(Flag)", "n1 = str(input())\r\nn2 = str(input())\r\nheap = str(input())\r\nif sorted(heap) == sorted(n1+n2):\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=input()\ns2=input()\ns3=input()\ns4=s1+s2\nres1=''.join(sorted(s3))\nres2=''.join(sorted(s4))\nif(res1==res2):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t \t\t \t\t \t \t \t\t \t\t \t", "a=input()\r\nb=input()\r\nc=input()\r\nx=sorted(a) + sorted(b)\r\ny=sorted(c)\r\nz=sorted(x)\r\nif(y==z):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nx=sorted(input())\r\nz=sorted(a+b)\r\nif z==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\n\r\n# read the input strings\r\nguest = input()\r\nhost = input()\r\npile = input()\r\n\r\n# count the frequency of each letter in the three strings\r\nguest_freq = Counter(guest)\r\nhost_freq = Counter(host)\r\npile_freq = Counter(pile)\r\n\r\n# check if the pile contains enough letters to form the two names\r\nif guest_freq + host_freq == pile_freq:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "guest = input()\r\nhost = input()\r\npile = input()\r\nfor i in pile:\r\n if i in guest:\r\n guest = guest.replace(i, \"\", 1)\r\n pile = pile.replace(i, \"\", 1)\r\nfor j in pile:\r\n if j in host:\r\n host = host.replace(j, \"\", 1)\r\n pile = pile.replace(j, \"\", 1)\r\nif not host and not guest and not pile:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k1=list(input())\r\n# m=k1.split(\" \")\r\n# m=list(map(int,m))\r\nk=list(input())\r\nf=list(input())\r\nl=k1+k\r\nl.sort()\r\nf.sort()\r\nif l==f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n# n=k.split(\" \")\r\n# n=list(map(int,n))\r\n# v=[]\r\n# for i in range (0,k1):\r\n# x=input()\r\n# m=x.split()\r\n# v.append(m)\r\n# j=list(set(n))\r\n# j.remove(0)\r\n# count=0 \r\n# if n[m[1]-1]==0:\r\n# l=n.count(0)\r\n\r\n\r\n \r\n# print(len(n)-l)\r\n\r\n\r\n# elif n[m[1]-1]>0:\r\n# for i in range((m[1]),(m[0])):\r\n# if n[m[1]-1]==n[i]:\r\n# # print(\"1\")\r\n# count=count + 1\r\n# print(m[1]+count)\r\n \r\n\r\n \r\n ", "a = input()\r\nla = []\r\nlb = []\r\nlx = []\r\nb = input()\r\nx = input()\r\nflag = True\r\nfor i in a:\r\n la.append(i)\r\nfor i in b:\r\n lb.append(i)\r\nfor i in x:\r\n lx.append(i)\r\nfor i in a:\r\n if i not in lx:\r\n flag = False\r\n print('NO')\r\n exit(0)\r\n else:\r\n lx.remove(i)\r\n la.remove(i)\r\nfor i in b:\r\n if i not in lx:\r\n flag = False\r\n print('NO')\r\n exit(0)\r\n else:\r\n lx.remove(i)\r\n lb.remove(i)\r\nfor i in lx:\r\n if i not in la and i not in lb:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "a=input()\r\nb=input()\r\nc=input()\r\nfinal=a+b\r\nlst1=list(final)\r\nlst2=list(c)\r\nlst1.sort(),lst2.sort()\r\nif(lst1==lst2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "g=input()\r\nh=input()\r\nc=input()\r\nif sorted(g+h)==sorted(c):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[8]:\n\n\ng = input()\nh = input()\np = input()\nd1 = {}\nfor l in g:\n if l in d1:\n d1[l] += 1\n else:\n d1[l] = 1\nfor l in h:\n if l in d1:\n d1[l] += 1\n else:\n d1[l] = 1\n\nflag = True\n\nfor l in p:\n if l in d1:\n d1[l] -= 1\n else:\n flag = False\n break\nif flag == False:\n print('NO')\nelse:\n for k,v in d1.items():\n if v != 0:\n flag = False\n print('NO')\n break\n if flag == True:\n print('YES')\n\n", "def solve(a: str, b: str, c: str) -> str:\r\n z = sorted(c)\r\n y = a + b\r\n if sorted(y) == z:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\na = input()\r\nb = input()\r\nc = input()\r\nprint(solve(a,b,c))", "a=input()\r\nb=input()\r\nk=a+b\r\nmix=input()\r\nans=sorted(k)\r\nans2=sorted(mix)\r\nif ans==ans2:\r\n print('YES')\r\nelse:\r\n print('NO')\n# Sat Jul 08 2023 11:18:38 GMT+0300 (Moscow Standard Time)\n", "guest_name = input()\r\nhost_name = input()\r\nletter_pile = input()\r\n\r\n# Count the occurrences of each letter in the guest's name\r\nguest_counts = {}\r\nfor letter in guest_name:\r\n guest_counts[letter] = guest_counts.get(letter, 0) + 1\r\n\r\n# Count the occurrences of each letter in the host's name\r\nhost_counts = {}\r\nfor letter in host_name:\r\n host_counts[letter] = host_counts.get(letter, 0) + 1\r\n\r\n# Combine the counts of both names\r\ncombined_counts = guest_counts.copy()\r\nfor letter, count in host_counts.items():\r\n combined_counts[letter] = combined_counts.get(letter, 0) + count\r\n\r\n# Count the occurrences of each letter in the letter pile\r\npile_counts = {}\r\nfor letter in letter_pile:\r\n pile_counts[letter] = pile_counts.get(letter, 0) + 1\r\n\r\n# Check if the letter pile matches the combined counts\r\nif combined_counts == pile_counts:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input(\"\")\r\nb = input(\"\")\r\nc = input(\"\")\r\n\r\nl = list(c)\r\n\r\np = 0\r\n\r\n\r\nfor i in a:\r\n if(i in l):\r\n l.remove(i)\r\n else:\r\n p = 1\r\n\r\n\r\n\r\nfor j in b:\r\n if(j in l):\r\n l.remove(j)\r\n else:\r\n p = 1\r\n\r\n\r\nif(len(l) != 0):\r\n print(\"NO\")\r\n exit()\r\n\r\n\r\nif(p == 1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from collections import Counter\r\n\r\nguest_name = input()\r\nhost_name = input()\r\nscrambled_letters = input()\r\n\r\n# Concatenate the guest name and host name\r\nconcatenated_name = guest_name + host_name\r\n\r\n# Check if the scrambled_letters can form the concatenated_name\r\n# `counter is used for counting the occurrences of elements in an iterable.\r\n# It provides a dictionary-like object where the elements are stored as keys\r\n# and their counts are stored as values.\r\nif Counter(concatenated_name) == Counter(scrambled_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[]\r\nx=list(input())\r\ny=list(input())\r\nl=x+y\r\nl1=list(input())\r\nl.sort()\r\nl1.sort()\r\nif l==l1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s1=list(input())\r\ns2=list(input())\r\ns3=list(input())\r\ncounter=len(s3)\r\nflag=True\r\nfor i in range(len(s3)):\r\n if s1.__contains__(s3[i])==True:\r\n s1.remove(s3[i])\r\n counter-=1\r\n elif s2.__contains__(s3[i])==True:\r\n s2.remove(s3[i])\r\n counter-=1\r\n else:\r\n flag==False\r\nif counter!=0:\r\n flag=False\r\nif s1!=list() or s2!=list():\r\n flag=False\r\nif flag==True:\r\n print(\"YES\")\r\nelif flag==False:\r\n print(\"NO\")\r\n", "s=input()\r\nr=input()\r\nf=input()\r\ns1=list(s)\r\ns2=list(r)\r\ns1.extend(s2)\r\ns3=list(f)\r\ns1.sort()\r\ns3.sort()\r\nif(s1==s3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "def check_names(guest_name, host_name, letter_pile):\n guest_count = {}\n host_count = {}\n\n for letter in guest_name:\n guest_count[letter] = guest_count.get(letter, 0) + 1\n\n for letter in host_name:\n host_count[letter] = host_count.get(letter, 0) + 1\n\n for letter in letter_pile:\n if letter not in guest_count or guest_count[letter] == 0:\n if letter not in host_count or host_count[letter] == 0:\n return \"NO\"\n host_count[letter] -= 1\n else:\n guest_count[letter] -= 1\n\n for count in guest_count.values():\n if count > 0:\n return \"NO\"\n\n for count in host_count.values():\n if count > 0:\n return \"NO\"\n\n return \"YES\"\n\nguest_name = input().strip()\nhost_name = input().strip()\nletter_pile = input().strip()\n\nresult = check_names(guest_name, host_name, letter_pile)\nprint(result)\n", "n = str(input()) + str(input())\r\ns = str(input())\r\nz = []\r\nk = []\r\nfor i in range(len(n)):\r\n z.append(n[i])\r\nfor i in range(len(s)):\r\n k.append(s[i])\r\nz.sort()\r\nk.sort()\r\nif z == k:\r\n print('YES')\r\nelse: print('NO')", "guest = input()\r\nhost = input()\r\n\r\ns=''\r\n\r\njoke = s.join(sorted(input()))\r\ntemp = s.join(sorted(guest+host))\r\n\r\nprint('YES') if joke == temp else print('NO')", "\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nli1=[s1[i] for i in range(0,len(s1))]\r\nli2=[s2[i] for i in range(0,len(s2))]\r\nli3=[s3[i] for i in range(0,len(s3))]\r\n\r\nli4=[]\r\nli1.sort()\r\n#print(li1)\r\nli2.sort()\r\n#print(li2)\r\nli4=li1+li2\r\n#print(li4)\r\nli4.sort()\r\nli3.sort()\r\n#print(li4)\r\n#print(li3)\r\nif(li4==li3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1=list(input())\r\na2=list(input())\r\nb=list(input())\r\ns=a1+a2\r\ns.sort()\r\nb.sort()\r\nif(s==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nt=input()\r\na=input()\r\nif sorted(s+t)==sorted(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ngn= input().upper()\r\n\r\nhn= input().upper()\r\n\r\npi= input().upper()\r\nm = gn + hn\r\np = ''.join(sorted(pi))\r\nq = ''.join(sorted(m))\r\nif p == q:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\ns = input()\r\ns3 = s1+s2\r\n\r\n\r\ns3 = ''.join(sorted(s3))\r\ns = ''.join(sorted(s))\r\nif s == s3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b, c = input(), input(), input()\r\na = a+b\r\na = sorted(a)\r\nc = sorted(c)\r\nif a == c:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = ''.join(sorted(input()))\r\n\r\nstring = ''.join(sorted(a + b))\r\nprint('YES' if string == c else 'NO')\r\n", "def year():\r\n guest_name = input()\r\n host_name = input()\r\n pile_name = input()\r\n \r\n \r\n def make_hash(data):\r\n hash_data = {}\r\n for char in (data):\r\n if char not in hash_data:\r\n hash_data[char] = 1\r\n else:\r\n hash_data[char] += 1\r\n return hash_data\r\n\r\n data = make_hash(guest_name + host_name)\r\n base = make_hash(pile_name)\r\n return 'YES' if base == data else 'NO'\r\nprint(year())\r\n\r\n\r\n\r\n", "s1 = input()\r\ns2 = input()\r\ns = input()\r\nans = 'YES'\r\nif sorted(s1+s2)==sorted(s):\r\n print(ans)\r\nelse:\r\n print('NO')\r\n ", "m=input()\r\nn=input()\r\nk=list(input())\r\nk.sort()\r\ns=list(m+n)\r\ns.sort()\r\nif k==s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\nguest_name = input()\r\nhost_name = input()\r\nletters_pile = input()\r\n\r\n# Concatenate the guest's name and host's name\r\ncombined_names = guest_name + host_name\r\n\r\n# Check if the character counts in the combined names and letters pile match\r\nif Counter(combined_names) == Counter(letters_pile):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nif sorted(a+b)==sorted(c): print('YES')\r\nelse: print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\nd = a+b\r\nf = []\r\nfor i in range(len(d)):\r\n f.append(d[i])\r\n \r\ng = sorted(f)\r\nh = sorted(c)\r\nif g == h:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \t \t" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\n\r\nif n % 2:\r\n x1 = ('aacc' * n)[:n-1]\r\n x2 = ('ccaa' * n)[:n-1]\r\n x3 = ('bbdd' * n)[:n-1]\r\n x4 = ('ddbb' * n)[:n-1]\r\n print(x1+'e')\r\n print(x2+'e')\r\n print('f'+x3)\r\n print('f'+x4)\r\nelse:\r\n x1 = ('aacc' * n)[:n]\r\n x2 = ('ccaa' * n)[:n]\r\n x3 = ('bbdd' * n)[:n-2]\r\n x4 = ('ddbb' * n)[:n-2]\r\n print(x1)\r\n print(x2)\r\n print('e'+x3+'f')\r\n print('e'+x4+'f')\r\n", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n\r\n a = \"qwertyuiopasdfghjklzxcvbnm\"\r\n\r\n if n == 1:\r\n print(\"a\", \"a\", \"b\", \"b\", sep=\"\\n\")\r\n elif n == 2:\r\n print(\"aa\", \"bb\", \"aa\", \"bb\", sep=\"\\n\")\r\n else:\r\n if n % 2 == 1:\r\n for r in range(2):\r\n for i in range(n // 2):\r\n if r % 2 == i % 2:\r\n print(\"aa\", end=\"\")\r\n else:\r\n print(\"bb\", end=\"\")\r\n print(\"c\")\r\n for r in range(2):\r\n print(\"c\", end=\"\")\r\n for i in range(n // 2):\r\n if r % 2 == i % 2:\r\n print(\"dd\", end=\"\")\r\n else:\r\n print(\"ee\", end=\"\")\r\n print()\r\n else:\r\n print(\"aabb\" * (n // 4) + \"aa\" * int(n % 4 != 0))\r\n for r in range(2):\r\n print(\"c\", end=\"\")\r\n for i in range((n - 2) // 2):\r\n if r % 2 == i % 2:\r\n print(\"dd\", end=\"\")\r\n else:\r\n print(\"ee\", end=\"\")\r\n print(\"c\")\r\n print(\"aabb\" * (n // 4) + \"aa\" * int(n % 4 != 0))\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n = int(input())\r\nk = n // 4\r\nif n % 2:\r\n if (n - 1) % 4:\r\n a = 'aabb' * k + 'aac'\r\n b = 'bbaa' * k + 'bbc'\r\n c = 'dee' + 'ffee' * k\r\n d = 'dff' + 'eeff' * k\r\n else:\r\n a = 'aabb' * k + 'c'\r\n b = 'bbaa' * k + 'c'\r\n c = 'd' + 'ffee' * k\r\n d = 'd' + 'eeff' * k\r\n print('\\n'.join((a, b, c, d)))\r\nelse: \r\n if n % 4: \r\n a = 'aabb' * k + 'aa'\r\n b = 'c' + 'ddcc' * k + 'd'\r\n c = 'c' + 'eeff' * k + 'd'\r\n else:\r\n a = 'aabb' * k\r\n b = 'c' + 'ddcc' * (k - 1) + 'ddc'\r\n c = 'c' + 'eeff' * (k - 1) + 'eec'\r\n print('\\n'.join((a, b, c, a)))", "n=int(input())\r\ns1,s2=\"aabb\",'ccdd'\r\nif n % 2 == 0:\r\n print((s1*n)[:n])\r\n print('e'+(s2*n)[:n-2]+'f')\r\n print('e'+(s1*n)[:n-2]+'f')\r\n print((s2*n)[:n])\r\nelse:\r\n print((s1*n)[:n-1]+'e')\r\n print((s1*n)[2:n+1]+'e')\r\n print('f'+(s2*n)[:n-1])\r\n print('f'+(s2*n)[2:n+1])\r\n \r\n", "n = int(input())\r\nif n&1==0:\r\n if n>2:\r\n s1 = 'aabb'*(n//4) + ('aa' if n%4 else \"\") \r\n n-=2\r\n s2 = 'c'+'ddee'*(n//4) +('dd' if n%4 else \"\") + 'f' \r\n s3 = 'c'+'eedd'*(n//4) +('ee' if n%4 else \"\") + 'f'\r\n s4 = s1\r\n print(s1)\r\n print(s2)\r\n print(s3)\r\n print(s4)\r\n else:\r\n print('aa')\r\n print('bb')\r\n print('aa')\r\n print('bb')\r\n\r\nelse:\r\n s1 = 'aabb'*(n//4) + ('aa' if n%4==3 else \"\")+'f'\r\n s2 = 'ccdd'*(n//4) + ('cc' if n%4==3 else \"\")+'f'\r\n s3 = 'g'+ 'aabb'*(n//4) + ('aa' if n%4==3 else \"\")\r\n s4 = 'g'+'ccdd'*(n//4) + ('cc' if n%4==3 else \"\")\r\n print(s1)\r\n print(s2)\r\n print(s3)\r\n print(s4)\r\n ", "a=int(input())\r\nif a%2==0:\r\n print(\"aabb\"*(a//4)+\"aabb\"[:a%4])\r\n print(\"ccdd\" * (a // 4) + \"ccdd\"[:a % 4])\r\n a-=2\r\n print('z'+\"eeff\"*(a//4)+\"eeff\"[:a%4]+'x')\r\n print('z' + \"iijj\" * (a // 4) + \"iijj\"[:a % 4] + 'x')\r\nelse:\r\n a-=1\r\n print(\"z\"+\"aabb\"*(a//4)+\"aabb\"[:a%4])\r\n print(\"z\"+\"ccdd\"*(a//4)+\"ccdd\"[:a%4])\r\n print(\"eeff\"*(a//4)+\"eeff\"[:a%4]+\"x\")\r\n print(\"gghh\"*(a//4)+\"gghh\"[:a%4]+\"x\")", "n = int(input())\nx1 = \"aa\"\nx2 = \"bb\"\nx3 = \"cc\"\nx4 = \"dd\"\nspecial1 = \"e\"\nspecial2 = \"f\"\n\na = \"\"\nb = \"\"\nc = special1\nd = special1\nfor i in range(n // 2):\n\tif i % 2 == 0:\n\t\ta = a + x1 \n\telse:\n\t\ta = a + x2\nfor i in range(n // 2):\n\tif i % 2 == 0:\n\t\tb = b + x3 \n\telse:\n\t\tb = b + x4\nfor i in range(n // 2):\n\tif i % 2 == 0:\n\t\tc = c + x1 \n\telse:\n\t\tc = c + x2\nfor i in range(n // 2):\n\tif i % 2 == 0:\n\t\td = d + x3 \n\telse: \n\t\td = d + x4\nif(n % 2 == 0):\n\tc = c[:-2]\n\td = d[:-2]\n\tc = c + special2\n\td = d + special2\nelse:\n\ta = a + special2\n\tb = b + special2\nprint(a)\nprint(b)\nprint(c)\nprint(d)\n\n\n# 2\n# yy\n# bd\n# bd\n# yy\n\n# 3\n# yyz\n# xxz\n# baa\n# bcc\n\n# 5\n# yyddz\n# xxeez\n# bffaa\n# bggcc\n\n# x1 x2 z\n# x3 x4 z\n# b x1 x2\n# b x3 x4\n\n# 4\n# yydd\n# xxee\n# bffa\n# bgga", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n\tres1 = 'f'\r\n\tres2 = 'f'\r\n\tres3 = \"\"\r\n\tres4 = \"\"\r\n\t\r\n\tp = 1\r\n\twhile len(res1) + 1 < n:\r\n\t\tif p % 2:\r\n\t\t\tres1 = res1 + \"aa\"\r\n\t\t\tres2 = res2 + \"bb\"\r\n\t\telse:\r\n\t\t\tres1 = res1 + \"bb\"\r\n\t\t\tres2 = res2 + \"aa\"\r\n\t\tp = (p + 1) % 2\r\n\t\t\r\n\twhile len(res3) < n:\r\n\t\tif p % 2:\r\n\t\t\tres3 = res3 + \"xx\"\r\n\t\t\tres4 = res4 + \"yy\"\r\n\t\telse:\r\n\t\t\tres3 = res3 + \"yy\"\r\n\t\t\tres4 = res4 + \"xx\"\r\n\t\tp = (p + 1) % 2\r\n\t\r\n\tres1 = res1 + 'o'\r\n\tres2 = res2 + 'o'\r\n\t\r\n\tprint(res1, res2, res3, res4, sep='\\n')\r\nelse:\r\n\tres1 = 'f'\r\n\tres2 = 'f'\r\n\tres3 = \"\"\r\n\tres4 = \"\"\r\n\t\r\n\tp = 1\r\n\twhile len(res1) + 1 < n:\r\n\t\tif p % 2:\r\n\t\t\tres1 = res1 + \"aa\"\r\n\t\t\tres2 = res2 + \"bb\"\r\n\t\telse:\r\n\t\t\tres1 = res1 + \"bb\"\r\n\t\t\tres2 = res2 + \"aa\"\r\n\t\tp = (p + 1) % 2\r\n\t\t\r\n\twhile len(res3) + 1 < n:\r\n\t\tif p % 2:\r\n\t\t\tres3 = res3 + \"xx\"\r\n\t\t\tres4 = res4 + \"yy\"\r\n\t\telse:\r\n\t\t\tres3 = res3 + \"yy\"\r\n\t\t\tres4 = res4 + \"xx\"\r\n\t\tp = (p + 1) % 2\r\n\t\r\n\tres3 = res3 + 'z'\r\n\tres4 = res4 + 'z'\r\n\t\r\n\tprint(res1, res2, res3, res4, sep='\\n')", "import string\r\n\r\nn = int(input())\r\n\r\nl = 0\r\n\r\ndef get_next_l(exclusions = []):\r\n global l\r\n\r\n a = string.ascii_lowercase[l]\r\n while a in exclusions:\r\n l = (l + 1) % 26\r\n a = string.ascii_lowercase[l]\r\n l = (l + 1) % 26\r\n\r\n return a\r\n\r\nrows = [[\"\"] * n for _ in range(4)]\r\n\r\nif n == 1:\r\n rows[0][0] = rows[1][0] = get_next_l()\r\n rows[2][0] = rows[3][0] = get_next_l()\r\n\r\nelif n == 2:\r\n for i in range(4):\r\n rows[i] = get_next_l() * 2\r\n\r\nelif n % 2 == 0:\r\n for i in range(0, n, 2):\r\n rows[0][i] = rows[0][i+1] = get_next_l()\r\n\r\n front = get_next_l(rows[0][0])\r\n\r\n rows[1][0] = front\r\n for i in range(1, n-1, 2):\r\n rows[1][i] = rows[1][i+1] = get_next_l([rows[2][i-1]] + rows[1][i:i+2])\r\n\r\n end = get_next_l(rows[0][-1] + rows[1][-2])\r\n\r\n rows[1][-1] = end\r\n\r\n rows[2][0] = front\r\n for i in range(1, n-1, 2):\r\n rows[2][i] = rows[2][i+1] = get_next_l([rows[2][i-1]] + rows[1][i:i+2] + [end])\r\n \r\n rows[2][-1] = end\r\n\r\n for i in range(0, n, 2):\r\n rows[3][i] = rows[3][i+1] = get_next_l([rows[3][i-1]] + rows[2][i:i+2])\r\n\r\nelse:\r\n for i in range(0, n-1, 2):\r\n rows[0][i] = rows[0][i+1] = get_next_l()\r\n\r\n end = get_next_l()\r\n rows[0][-1] = end\r\n\r\n for i in range(0, n-1, 2):\r\n rows[1][i] = rows[1][i+1] = get_next_l([rows[1][i-1]] + rows[1][i:i+2] + [end])\r\n rows[1][-1] = end\r\n\r\n front = get_next_l(rows[1][0])\r\n rows[2][0] = front\r\n for i in range(1, n, 2):\r\n rows[2][i] = rows[2][i+1] = get_next_l([rows[2][i-1]] + rows[1][i:i+2])\r\n\r\n rows[3][0] = front\r\n for i in range(1, n, 2):\r\n rows[3][i] = rows[3][i+1] = get_next_l([rows[3][i-1]] + rows[2][i:i+2])\r\n\r\nprint(\"\\n\".join(\"\".join(r) for r in rows))", "def computeTiling(n):\n printEvenLengthTiling(n) if isEven(n) else printOddLengthTiling(n)\n\ndef isEven(n):\n return n%2 == 0\n\ndef printEvenLengthTiling(n):\n print(buildRowFromPattern( '', 'nnoo', '', n))\n print(buildRowFromPattern('l', 'xxzz', 'f', n))\n print(buildRowFromPattern('l', 'zzxx', 'f', n))\n print(buildRowFromPattern( '', 'nnoo', '', n))\n\ndef printOddLengthTiling(n):\n print(buildRowFromPattern('l', 'xxzz', '', n))\n print(buildRowFromPattern('l', 'zzxx', '', n))\n print(buildRowFromPattern( '', 'nnoo', 'f', n))\n print(buildRowFromPattern( '', 'oonn', 'f', n))\n\ndef buildRowFromPattern(prefix, infix, suffix, n):\n return \"\".join(applyPattern(prefix, infix, suffix, n))\n \ndef applyPattern(prefix, infix, suffix, n):\n n = n - bool(prefix) - bool(suffix)\n yield prefix\n yield from extendInfix(infix, n)\n yield suffix\n\ndef extendInfix(infix, n):\n repetitions, reminder = divmod(n, len(infix))\n for rep in range(repetitions):\n yield infix\n yield infix[:reminder]\n\n\nif __name__ == '__main__':\n n = int(input())\n computeTiling(n)\n", "def computeTiling(n):\n if n == 1:\n print(\"a\\na\\nf\\nf\")\n return\n\n for tiling in generateRowTilings(n):\n print(\"\".join(tiling))\n \ndef generateRowTilings(n):\n for (rowNum, firstTile, pattern) in generateRowTilingPatterns(n):\n yield makeRowTiling(rowNum, firstTile, pattern, n)\n\ndef generateRowTilingPatterns(n):\n rows = (1, 2, 3, 4)\n firstTiles = ('a', 'a', 'd', 'e')\n patterns = ('bbcc', 'ccbb', 'deed', 'edde')\n return zip(rows, firstTiles, patterns)\n\ndef makeRowTiling(row, prefix, pattern, n):\n yield prefix\n yield from (pattern[i%4] for i in range(n-2))\n yield pattern[(n-2)%4] if (n%2 != (row-1)//2) else 'f'\n\nif __name__ == '__main__':\n n = int(input())\n computeTiling(n)\n" ]

[ "d,k,a,b,t=map(int,input().split())\r\n\r\ndef calc(mid):\r\n x=min(d,k+mid*k)\r\n return x*a+(d-x)*b+t*mid\r\n# k+n*k<=d\r\n# n<=(d-k)//k\r\n\r\nL,R=-1,(d-k)//k+1\r\nwhile L+2<R:\r\n c1=L+(R-L)//3\r\n c2=R-(R-L)//3\r\n if calc(c1)<calc(c2):\r\n R=c2\r\n else:\r\n L=c1\r\n\r\nans=9*10**18\r\nfor i in range(max(0,L),min(R,d)+1):\r\n ans=min(ans,calc(i))\r\n\r\nprint(ans)", "s = input().split()\r\ns = [int(x) for x in s]\r\nd, k, a, b, t = s\r\ndist = d-k\r\n\r\nif d>k:\r\n if a*k+t>=b*k:\r\n if a>b:\r\n time = b*d\r\n else:\r\n time = a*k + b*(d-k)\r\n else:\r\n if b*(d%k)>a*(d%k)+t:\r\n time = a*k + (a*k+t)*((d-k)//k)+a*(d%k)+t\r\n else:\r\n time = a*k + (a*k+t)*((d-k)//k)+b*(d%k)\r\n \r\nelse:\r\n if a>b:\r\n time = b*d\r\n else:\r\n time = a*d\r\n\r\nprint(time)", "d, k, a, b, t = map(int, input().split())\nif d <= k:\n print(a * d)\nelif (b - a) * k <= t:\n print(a * k + (d - k) * b)\nelse:\n u, v = divmod(d, k)\n print(a * k * u + t * (u - 1) + min(b * v, t + a * v))\n", "d, k, a, b, t = map(int, input().split())\nif d <= k:\n print(a * d)\n exit()\nif (b - a) * k <= t:\n print(a * k + (d - k) * b)\n exit()\nu, v = divmod(d, k)\nif (b - a) * v <= t:\n print((a * k + t) * u - t + b * v)\nelse:\n print((a * k + t) * u + a * v)\n", "d,k,a,b,t=list(map(int,input().split()))\r\nif d<k:\r\n\tif a<b:\r\n\t\tprint(a*d)\r\n\telse:\r\n\t\tprint(b*d)\r\nelif a*k+t<=b*k:\r\n q,m=d//k,d%k\r\n ans=q*(a*k+t)-t\r\n if m*b<=t+m*a:\r\n \tans+=m*b\r\n else:\r\n \tans+=t\r\n \tans+=m*a\r\n print(ans)\r\nelse:\r\n if a>b:\r\n print(d*b)\r\n else:\r\n \tprint((d-k)*b+k*a)", "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nimport time\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\nwrite=sys.stdout.write\r\n\r\nD,K,A,B,T=map(int,readline().split())\r\nif D<=K:\r\n ans=D*A\r\nelse:\r\n ans=K*A\r\n D-=K\r\n ans+=D//K*min(A*K+T,B*K)+min(T+D%K*A,D%K*B)\r\nprint(ans)", "d, k, a, b, t = map(int, input().split())\r\n\r\nif d <= k:\r\n print(d * a)\r\n exit(0)\r\n\r\nif a * k + t > b * k:\r\n print(a * k + b * (d - k))\r\n exit(0)\r\n\r\n\"\"\"\r\n\r\ncar = k * (d // k)\r\nrepairs = d // k - 1\r\n\r\nif rest by car:\r\n++repairs\r\ncar = d\r\n\r\nif rest by foot:\r\nfoot = d - car\r\n\r\nchoose minimum\r\n\"\"\"\r\n\r\ncar_dist = k * (d // k)\r\nrepairs_cnt = d // k - 1\r\n\r\nans = car_dist * a + repairs_cnt * t + min(t + (d - car_dist) * a, (d - car_dist) * b)\r\n\r\nprint(ans)\r\n", "d,k,a,b,t = map(int,input().split())\r\nif d <= k:\r\n print(a * d)\r\n exit()\r\nans = k * a\r\nd -= k\r\nif b * k <= a * k + t:\r\n ans += d * b\r\nelse:\r\n ans += (d // k) * (a * k + t)\r\n if d % k:\r\n ans += min(a * (d % k) + t, b * (d % k))\r\nprint(ans)" ]

[ "def calc(a,b):\r\n return (dp[i-1][a]-dp[i-1][b]+sum[b]*rev[b]-sum[a]*rev[a])/(sum[b]-sum[a])\r\nn,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nsum=[0]\r\nrev=[0]\r\nres=0.0\r\nfor i in x:\r\n sum.append(sum[-1]+i)\r\n rev.append(rev[-1]+1.0/i)\r\n res += sum[-1] / i\r\ndp = [[0.0]*(n+1) for _ in range(k+1)]\r\nq = [0]*(n+1)\r\nfor i in range(2,k+1):\r\n l=0\r\n r=0\r\n for j in range(i-1,n+1):\r\n while l<r and (dp[i-1][q[l]]+sum[q[l]]*(rev[j]-rev[q[l]]))<(dp[i-1][q[l+1]]+sum[q[l+1]]*(rev[j]-rev[q[l+1]])):\r\n l += 1\r\n dp[i][j]=max(dp[i][j],dp[i-1][q[l]]+sum[q[l]]*(rev[j]-rev[q[l]]))\r\n while l<r and calc(q[r-1],q[r])>calc(q[r],j):\r\n r-=1\r\n r+=1\r\n q[r]=j\r\nprint(\"{:.10f}\".format(res-dp[k][n]))# 1693525968.9482443" ]

[ "p11 = list(map(int, input().split()))\r\np12 = list(map(int, input().split()))\r\np21 = list(map(int, input().split()))\r\np22 = list(map(int, input().split()))\r\n\r\ndef f(a, b, c, d):\r\n if a[0] > d[1] and b[1] > c[0]:\r\n return 1\r\n if a[0] < d[1] and b[1] < c[0]:\r\n return 2\r\n return 0\r\n\r\nc1 = f(p11, p12, p21, p22)\r\nc2 = f(p12, p11, p21, p22)\r\nc3 = f(p11, p12, p22, p21)\r\nc4 = f(p12, p11, p22, p21)\r\n#print(c1, c2, c3, c4)\r\n#false - win 1 true - win 2\r\n\r\nif ((c1 == 2 or c3 == 2) and (c2 == 2 or c4 == 2)):\r\n print(\"Team 2\")\r\nelif ((c1 == 1 and c3 == 1) or (c2 == 1 and c4 == 1)):\r\n print(\"Team 1\")\r\nelse:\r\n print(\"Draw\")\r\n", "a = tuple(map(int, input().split()))\r\nb = tuple(map(int, input().split()))\r\nc = tuple(map(int, input().split()))\r\nd = tuple(map(int, input().split()))\r\n\r\n\r\ndef check(el1, el2):\r\n if el1[0][0] > el2[1][1] and el1[1][1] > el2[0][0]:\r\n return 1\r\n if el2[0][0] > el1[1][1] and el2[1][1] > el1[0][0]:\r\n return 2\r\n return 0\r\n\r\n\r\ndef check2(el):\r\n ans = 5\r\n cd = [(c, d), (d, c)]\r\n for el2 in cd:\r\n if check(el, el2) == 2:\r\n return 2\r\n ans = min(ans, check(el, el2))\r\n return ans\r\n\r\n\r\ndef main():\r\n ans = 5\r\n aw = [(a, b), (b, a)]\r\n for el in aw:\r\n if check2(el) == 1:\r\n return print('Team 1')\r\n ans = min(ans, check2(el))\r\n if ans == 0:\r\n print(\"Draw\")\r\n else:\r\n print(\"Team 2\")\r\n\r\n\r\nmain()\r\n", "def f():\r\n a, b = map(int, input().split())\r\n A, B = map(int, input().split())\r\n return ((a, B), (A, b))\r\ndef g(u, v): return u[0] > v[1] and u[1] > v[0]\r\nx, y = f(), f()\r\nif any(all(g(j, i) for i in y) for j in x): print('Team 1')\r\nelif all(any(g(i, j) for i in y) for j in x): print('Team 2')\r\nelse: print('Draw')", "def main():\n\tM = [0] * 4\n\tfor i in range(4):\n\t\tM[i] = list(map(int, input().split()))\n\n\tW = [[0] * 2 for i in range(2)]\n\tfor i in range(0, 2):\n\t\tfor j in range(2, 4):\n\t\t\tif M[i][0] > M[j][1] and M[i ^ 1][1] > M[j ^ 1][0]:\n\t\t\t\tW[i][j - 2] = 1\n\t\t\telif M[i][0] < M[j][1] and M[i ^ 1][1] < M[j ^ 1][0]:\n\t\t\t\tW[i][j - 2] = -1\n\t\t\telse:\n\t\t\t\tW[i][j - 2] = 0\n\tif max(W[0][0] + W[0][1], W[1][0] + W[1][1]) == 2:\n\t\tprint(\"Team 1\")\n\telif min(W[0][0], W[0][1]) + min(W[1][0], W[1][1]) == -2:\n\t\tprint(\"Team 2\")\n\telse:\n\t\tprint(\"Draw\")\n\nmain()", "d1, a1 = map(int, input().split())\r\nd2, a2 = map(int, input().split())\r\nd3, a3 = map(int, input().split())\r\nd4, a4 = map(int, input().split())\r\nif ((d1>a3 and a2>d4) and (d1>a4 and a2>d3)) or (d2>a3 and a1>d4 and d2>a4 and a1>d3):\r\n print(\"Team 1\")\r\nelif ((d1<a3 and a2<d4) or (d1<a4 and a2<d3)) and ((d2<a3 and a1<d4) or (d2<a4 and a1<d3)):\r\n print(\"Team 2\")\r\nelse:\r\n print(\"Draw\")", "x = [tuple(int(i) for i in input().split()) for j in range(4)]\nif x[0][0] + x[1][1] > x[0][1] + x[1][0]:\n t1atk = x[1][1]\n t1def = x[0][0]\nelse:\n t1atk = x[0][1]\n t1def = x[1][0]\n\ndef f():\n if t1atk > t2def and t1def > t2atk:\n return 0\n elif t1atk < t2def and t1def < t2atk:\n return 2\n else:\n return 1\n\nt2def = x[2][0]\nt2atk = x[3][1]\na = f()\n\nt2def = x[3][0]\nt2atk = x[2][1]\nb = f()\n\nif a > b:\n t2def = x[2][0]\n t2atk = x[3][1]\nelse:\n t2def = x[3][0]\n t2atk = x[2][1]\n\nif t1atk > t2def and t1def > t2atk:\n print(\"Team 1\")\nelif t1atk < t2def and t1def < t2atk:\n print(\"Team 2\")\nelse:\n print(\"Draw\")\n\n\t \t\t \t\t\t \t \t\t \t \t \t\t\t\t\t\t", "team1, team2 = (lambda t : [[list(map(int, input().split())) for x in range(2)] for y in range(2)])('input')\r\nif (lambda t1, t2 : any(all(t1[x][0] > t2[y][1] and t1[1 - x][1] > t2[1 - y][0] for y in range(2)) for x in range(2)))(team1, team2):\r\n print('Team 1')\r\nelif (lambda t1, t2 : all(any(t2[y][0] > t1[x][1] and t2[1 - y][1] > t1[1 - x][0] for y in range(2)) for x in range(2)))(team1, team2):\r\n print('Team 2')\r\nelse:\r\n print('Draw')\r\n", "import sys\nread = lambda: list(map(int, sys.stdin.readline().split()))\na0, d0 = read()\na1, d1 = read()\n\na2, d2 = read()\na3, d3 = read()\n\nw02 = a0 > d3 and d1 > a2\nw03 = a0 > d2 and d1 > a3\nw12 = a1 > d3 and d0 > a2\nw13 = a1 > d2 and d0 > a3\n\nw20 = a2 > d1 and d3 > a0\nw21 = a2 > d0 and d3 > a1\nw30 = a3 > d1 and d2 > a0\nw31 = a3 > d0 and d2 > a1\n\nif w02 and w03 or w12 and w13:\n print(\"Team 1\")\nelif (w20 or w30) and (w21 or w31):\n print(\"Team 2\")\nelse:\n print(\"Draw\")\n", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\n\r\nx,y=map(int,input().split())\r\nz,w=map(int,input().split())\r\n\r\nTeam1=False\r\nTeam2=False\r\nif(a>w and a>y and d>x and d>z):\r\n Team1=True\r\n\r\nif(c>w and c>y and b>x and b>z):\r\n Team1=True\r\n\r\nif(((x>b and w>c) or (z>b and y>c)) and ((x>d and w>a) or (z>d and y>a))):\r\n Team2=True\r\n\r\nif(Team1):\r\n print(\"Team 1\")\r\nelif(Team2):\r\n print(\"Team 2\")\r\nelse:\r\n print(\"Draw\")", "def _win(a, b, c, d):\n if a[0] > c[1] and b[1] > d[0]:\n return 1\n elif a[0] < c[1] and b[1] < d[0]:\n return -1\n else:\n return 0\n\n\ndef win(a, b, c, d):\n global p\n return _win(p[a], p[b], p[c], p[d])\n\n\ndef win_comb(a, b, c, d):\n x, y = win(a, b, c, d), win(a, b, d, c)\n if x == 1 and y == 1:\n return 1\n if x == -1 or y == -1:\n return -1\n return 0\n\n\ndef win_team1(a, b, c, d):\n x, y = win_comb(a, b, c, d), win_comb(b, a, c, d)\n if x == 1 or y == 1:\n return 1\n if x == -1 and y == -1:\n return -1\n return 0\n\np = []\nfor i in range(4):\n p.append(tuple(map(int, input().split())))\nw = win_team1(0, 1, 2, 3)\nif w == 1:\n print('Team 1')\nelif w == -1:\n print('Team 2')\nelse:\n print('Draw')\n", "def find_winer(defence1, attack1, defence2, attack2):\n if defence1[0] > attack2[1] and attack1[1] > defence2[0]:\n return 1\n elif defence1[0] < attack2[1] and attack1[1] < defence2[0]:\n return 2\n else:\n return 0\n\n\ndef find_results(players):\n results = []\n results.append(find_winer(players[0], players[1], players[2], players[3]))\n results.append(find_winer(players[0], players[1], players[3], players[2]))\n results.append(find_winer(players[1], players[0], players[2], players[3]))\n results.append(find_winer(players[1], players[0], players[3], players[2]))\n\n return results\n\n\ndef solve():\n players = []\n for i in range(4):\n players.append(tuple(map(int, input().split())))\n\n results = find_results(players)\n if (results[0] == 1 and results[1] == 1) or (results[2] == 1 and results[3] == 1):\n print (\"Team 1\")\n elif (results[0] == 2 or results[1] == 2) and (results[2] == 2 or results[3] == 2):\n print(\"Team 2\")\n else:\n print(\"Draw\")\n\n\nsolve()\n", "A = [[int(j) for j in input().split() ] for i in range(4)]\n\ncheck1 = A[0][0] > A[2][1] and A[1][1] > A[3][0] and A[0][0] > A[3][1] and A[1][1] > A[2][0]\ncheck2 = A[1][0] > A[2][1] and A[0][1] > A[3][0] and A[1][0] > A[3][1] and A[0][1] > A[2][0]\n\ncheck3 = (A[2][0] > A[0][1] and A[3][1] > A[1][0]) or (A[3][0] > A[0][1] and A[2][1] > A[1][0])\ncheck4 = (A[2][0] > A[1][1] and A[3][1] > A[0][0]) or (A[3][0] > A[1][1] and A[2][1] > A[0][0])\nif check1 or check2:\n print(\"Team 1\")\nelif check3 and check4:\n print(\"Team 2\")\nelse:\n print(\"Draw\")\n \t\t\t\t \t \t\t\t\t\t\t \t\t \t\t\t\t \t", "a=[int(k) for k in input().split()]\r\nb=[int(k) for k in input().split()]\r\nc=[int(k) for k in input().split()]\r\nd=[int(k) for k in input().split()]\r\n\r\nif (a[0]>c[1] and b[1]>d[0]) and (a[0]>d[1] and b[1]>c[0]):\r\n print(\"Team 1\")\r\nelif (a[1]>c[0] and b[0]>d[1]) and (a[1]>d[0] and b[0]>c[1]):\r\n print(\"Team 1\")\r\nelif ((c[1]>a[0] and d[0]>b[1]) or (d[1]>a[0] and c[0]>b[1])) and ((c[0]>a[1] and d[1]>b[0]) or (d[0]>a[1] and c[1]>b[0])):\r\n print(\"Team 2\")\r\nelse:\r\n print(\"Draw\")", "lst = [[int(el) for el in input().split()] for _ in range(4)]\r\nwins = [0] * 4\r\nfor i in range(4):\r\n b = bin(i)[2:].zfill(2)\r\n var = [int(b[0]), int(b[1])]\r\n team1 = [lst[var[0]][0], lst[(var[0] + 1) % 2][1]]\r\n team2 = [lst[var[1] + 2][0], lst[(var[1] + 1) % 2 + 2][1]]\r\n # print(team1, team2)\r\n if team1[0] > team2[1] and team1[1] > team2[0]:\r\n wins[i] = 1\r\n elif team1[0] < team2[1] and team1[1] < team2[0]:\r\n wins[i] = 2\r\n# print(wins)\r\nif wins[0] == wins[1] == 1 or wins[2] == wins[3] == 1:\r\n print('Team 1')\r\nelif 2 in wins[:2] and 2 in wins[2:]:\r\n print('Team 2')\r\nelse:\r\n print('Draw')\r\n", "def get_tuple():\n\ta, A = map(int, input().split())\n\tb, B = map(int, input().split())\n\treturn (a,B), (b,A)\n\ndef larger(a1, a2):\n\treturn a1[0] > a2[1] and a1[1] > a2[0]\n\ndef smaller(a1, a2):\n\treturn a1[0] < a2[1] and a1[1] < a2[0]\n\nt11, t12 = get_tuple()\nt21, t22 = get_tuple()\n\nif larger(t11,t21) and larger(t11, t22):\n\tprint(\"Team 1\")\nelif larger(t12, t21) and larger(t12, t22):\n\tprint(\"Team 1\")\nelif (smaller(t11,t21) or smaller(t11, t22)) and (smaller(t12, t21) or smaller(t12, t22)):\n\tprint(\"Team 2\")\nelse:\n\tprint(\"Draw\")\n\n\n\n" ]

[ "import bisect\n \nn,M= tuple(map(int,input().split()))\n\nnums = list(map(int,input().split()))\n\nr1,r2 = [],[]\ndef dfs(index,last,sum,check):\n\n if index == last:\n if check == 1:\n r1.append(sum)\n else:\n r2.append(sum)\n return\n\n dfs(index+1,last,sum,check)\n dfs(index+1,last,(sum+nums[index])%M,check)\n\ndfs(0,n//2,0,1)\ndfs(n//2,n,0,2)\ns1 = set()\ns2 = set()\n\nfor i in r1:\n s1.add(i)\n\nfor i in r2:\n s2.add(i)\n\nr1 = sorted(list(s1))\nr2 = sorted(list(s2))\n\n\n\nans = 0\nfor x in r1:\n p = bisect.bisect_left(r2,M-x)\n ans = max(ans,x+r2[p-1])\n\nprint(ans)\n\n", "from bisect import bisect_right\r\ndef get_sum(arr,mask):\r\n t=0\r\n for i in range(len(arr)):\r\n if mask&(1<<i):\r\n t+=(arr[i])\r\n t%=m\r\n return t\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na1=a[:(n+1)//2]\r\na2=a[(n+1)//2:]\r\nleft=[]\r\nfor x in range(2**len(a1)):\r\n left.append(get_sum(a1,x))\r\nleft.sort()\r\nans=0\r\nright=[]\r\nfor x in range(2**len(a2)):\r\n right.append(get_sum(a2,x))\r\nfor val in right:\r\n target=m-1-val\r\n ind=bisect_right(left,target)\r\n ans=max(ans,val,val+left[ind-1])\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nfirst=l[:n//2]\r\nsec=l[n//2:]\r\nn1=n//2 \r\nn2=n//2+n%2 \r\nt1=(1<<n1)\r\nt2=(1<<n2)\r\ns1=[]\r\nfor i in range(t1):\r\n now=0 \r\n for j in range(len(first)):\r\n if i&(1<<j):\r\n now+=first[j]\r\n s1.append(now%m)\r\ns2=[]\r\nfor i in range(t2):\r\n now= 0 \r\n for j in range(len(sec)):\r\n if i&(1<<j):\r\n now+=sec[j]\r\n s2.append(now%m)\r\ns1.sort()\r\ns2.sort() \r\nmaxi=0 \r\ndef check(l,x): #largest number less than x in l # l is asc \r\n lo=0 \r\n hi=len(l)-1 \r\n ans=0 \r\n while lo<=hi: \r\n mi=(lo+hi)>>1 \r\n if l[mi]<x:\r\n ans=l[mi] \r\n lo=mi+1\r\n else:\r\n hi=mi-1 \r\n return ans \r\nfor i in s1:\r\n req=m-i \r\n pair=check(s2,req)\r\n maxi=max(maxi,(i+pair)%m)\r\nprint(maxi)\r\n ", "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nimport time\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\n\r\nN,M=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\nlst=[]\r\nfor bit in range(1<<N//2):\r\n s=0\r\n for i in range(N//2):\r\n if bit&1<<i:\r\n s+=A[i]\r\n s%=M\r\n lst.append(s)\r\nlst.sort()\r\nlst+=[i+M for i in lst]\r\nans=0\r\nfor bit in range(1<<N-N//2):\r\n s=0\r\n for i in range(N-N//2):\r\n if bit&1<<i:\r\n s+=A[i+N//2]\r\n s%=M\r\n i=bisect.bisect_left(lst,2*M-s)\r\n ans=max(ans,(s+lst[i-1])%M)\r\nprint(ans)", "import sys\r\nfrom itertools import chain, combinations\r\nfrom bisect import bisect_right\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\ndef inltm(m):\r\n return list(map(lambda x: int(x)%m,input().split()))\r\n\r\n[n, m] = inlt()\r\na = inltm(m)\r\n\r\ndef powerset(iterable):\r\n s = list(iterable)\r\n return list(chain.from_iterable(combinations(s, r) for r in range(len(s)+1)))\r\n\r\nsep = round(n / 2)\r\n\r\nleft_split = a[:sep]\r\nright_split = sorted(a[sep:])\r\n\r\nleft_split_subsets = list(map(lambda x: sum(x)%m, powerset(left_split)))\r\nright_split_subsets = sorted(list(map(lambda x: sum(x)%m, powerset(right_split))))\r\nright_split_subsets.insert(0, 0)\r\n\r\nmax_value = 0\r\n\r\nfor i in left_split_subsets:\r\n current_target = m - i - 1\r\n current_value = (i + right_split_subsets[bisect_right(right_split_subsets, current_target) - 1]) % m\r\n if current_value > max_value:\r\n max_value = current_value\r\nprint(max_value)\r\n", "n,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nx,y=set(),set()\r\ndef f(x,n,i,s=0):\r\n if i==n:x.add(s%m)\r\n else:\r\n f(x,n,i+1,s+a[i])\r\n f(x,n,i+1,s)\r\nh=n//2\r\nf(x,h,0)\r\nf(y,n,h)\r\ny=sorted(y)\r\nimport bisect\r\nk=0\r\nprint(max(i+y[bisect.bisect_left(y,m-i)-1]for i in x))", "def Anal(A, i, r, m, S):\n if i == len(A):\n S.add(r)\n else:\n Anal(A, i+1, (r+A[i])%m, m, S)\n Anal(A, i+1, r, m, S)\n\nn, m = map(int, input().split())\nA = list(map(int, input().split()))\nx = set()\ny = set()\nAnal(A[:n//2], 0, 0, m, x)\nAnal(A[n//2:], 0, 0, m, y)\nx = sorted(x)\ny = sorted(y)\n\nimport bisect\n\nprint(max(i+y[bisect.bisect_left(y,m-i)-1] for i in x))\n\n\t\t \t \t \t \t\t\t\t\t \t \t \t \t", "import sys\r\ninput=sys.stdin.readline\r\nimport bisect\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na1=a[:n//2+1]\r\nl1=len(a1)\r\ncan1=set([0])\r\nfor i in range(1<<l1):\r\n sa=0\r\n for j in range(l1):\r\n if (i>>j)&1:\r\n sa+=a1[j]\r\n sa%=m\r\n can1.add(sa)\r\ncan1=sorted(list(can1))\r\na2=a[n//2+1:]\r\nl2=len(a2)\r\nans=0\r\nfor i in range(1<<l2):\r\n s=0\r\n for j in range(l2):\r\n if (i>>j)&1:\r\n s+=a2[j]\r\n s%=m\r\n idx=bisect.bisect_left(can1,m-1-s)\r\n if idx<len(can1):\r\n s2=can1[idx]\r\n if s2>m-1-s:\r\n if idx>=1:\r\n s2=can1[idx-1]\r\n else:\r\n s2=can1[-1]\r\n ans=max(ans,(s+s2)%m,(s+can1[-1])%m)\r\nprint(ans)", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nimport bisect\r\na1,a2=[],[]\r\nn1=n//2\r\napp1=a1.append\r\napp2=a2.append\r\ndef sums1(i,sum=0):\r\n if i==n1:\r\n app1(sum)\r\n else:\r\n sums1(i+1,(sum+a[i])%m)\r\n sums1(i+1,sum)\r\n \r\ndef sums2(i,sum=0):\r\n if i==n:\r\n app2(sum)\r\n else:\r\n sums2(i+1,(sum+a[i])%m)\r\n sums2(i+1,sum)\r\n\r\nsums1(0)\r\nsums2(n1)\r\n\r\nans=0\r\nend=len(a2)-1\r\n\r\na1=sorted(set(a1))\r\nbis=bisect.bisect_left\r\nfor i in a2:\r\n j=bis(a1,m-i)\r\n if ans<a1[j-1]+i:\r\n ans=a1[j-1]+i\r\nprint(ans)\r\n", "n,m=map(int,input().split())\na=[int(i) for i in input().split()]\nx,y=set(),set()\ndef f(x,n,i,s=0):\n if i==n:x.add(s%m)\n else:\n f(x,n,i+1,s+a[i])\n f(x,n,i+1,s)\nh=n//2\nf(x,h,0)\nf(y,n,h)\ny=sorted(y)\nimport bisect\nk=0\nprint(max(i+y[bisect.bisect_left(y,m-i)-1]for i in x))\n\t\t \t\t\t\t\t \t\t \t\t \t\t \t", "from bisect import bisect_right as br\r\ndef main():\r\n\tn,m=map(int,input().split())\r\n\ta=list(map(int,input().split()))\r\n\tp=n//2\r\n\tq=n-p\r\n\tb=a[0:p]\r\n\tc=a[p:n]\r\n\t\r\n\tS=[]\r\n\tfor i in range(2**p):\r\n\t\ts=0\r\n\t\tfor j in range(p):\r\n\t\t\tif (i>>j)&1:\t\r\n\t\t\t\ts+=b[j]\r\n\t\ts%=m\r\n\t\tS.append(s)\r\n\tT=[]\r\n\tfor i in range(2**q):\r\n\t\tt=0\r\n\t\tfor j in range(q):\r\n\t\t\tif (i>>j)&1:\r\n\t\t\t\tt+=c[j]\r\n\t\tt%=m\r\n\t\tT.append(t)\r\n\t\r\n\tT.sort()\r\n\tans=-1<<33\r\n\tfor x in S:\r\n\t\tidx=br(T,m-1-x)\r\n\t\tif idx!=0:\r\n\t\t\tans=max(ans,max((x+T[idx-1])%m,(x+T[-1])%m))\r\n\t\telse:\r\n\t\t\tans=max(ans,(x+T[-1])%m)\r\n\tprint(ans)\r\nmain()", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\n# from __future__ import print_function # for PyPy2\r\n# from itertools import permutations as perm\r\n# from functools import cmp_to_key\t# for adding custom comparator\r\n# from fractions import Fraction\r\n# from collections import *\r\nfrom sys import stdin\r\nfrom bisect import *\r\n# from heapq import *\r\nfrom math import *\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, m = gil()\r\na = gil()\r\n\r\ndef getSubsetSum(a):\r\n\tvals = set([0])\r\n\ttmp = []\r\n\tans = 0\r\n\tfor v in a:\r\n\t\tfor ov in vals:\r\n\t\t\ttmp.append((ov+v)%m if ov+v >= m else v + ov)\r\n\r\n\t\twhile tmp:\r\n\t\t\tif len(tmp) >= 1e7:print('fuvk');exit()\r\n\t\t\tans = max(ans, tmp[-1])\r\n\t\t\tvals.add(tmp.pop())\r\n\r\n\treturn sorted(vals)\r\np = n&1\r\nl, r = getSubsetSum(a[:n//2 + p]), getSubsetSum(a[n//2 + p:])\r\n\r\nans = 0\r\nnl, nr = len(l), len(r)\r\n\r\nfor v in l:\r\n\t# find max x < 2m-v\t\r\n\t# find max x < m-v\t\r\n 'Find rightmost value less than x'\r\n i = bisect_left(r, m - v)\r\n if i:\r\n ans = max(ans, r[i-1] + v) \r\n\r\n i = bisect_left(r, (2*m) - v)\r\n if i:\r\n ans = max(ans, (r[i-1] + v)%m) \r\n\r\nprint(ans)", "from bisect import bisect_left\r\n\r\nt = []\r\ndef f(lst, i, e, m, s = 0):\r\n if i == e:\r\n t.append(s % m)\r\n else:\r\n f(lst, i + 1, e, m, s)\r\n f(lst, i + 1, e, m, s + lst[i])\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = n // 2\r\nl1 = a[0:d]\r\nl2 = a[d:]\r\nf(l1, 0, d, m)\r\na1 = t\r\nt = []\r\nf(l2, 0, len(l2), m)\r\na2 = t\r\na1.sort()\r\na2.sort()\r\nans = 0\r\nfor x in a1:\r\n i = bisect_left(a2, m - x)\r\n val = (x + a2[i - 1]) % m\r\n ans = max(ans, val)\r\nprint(ans)", "lst1=[]\r\nlst2=[]\r\nsec_sum1=[]\r\nsec_sum2=[]\r\n\r\ndef rec1(pos,sum):\r\n if pos==len(lst1):\r\n sec_sum1.append(sum)\r\n return\r\n rec1(pos+1,(sum+lst1[pos])%m)\r\n rec1(pos+1,sum)\r\n\r\ndef rec2(pos,sum):\r\n if pos==len(lst2):\r\n sec_sum2.append(sum)\r\n return\r\n rec2(pos+1,(sum+lst2[pos])%m)\r\n rec2(pos+1,sum)\r\n\r\ndef binary_search(key,high):\r\n hi,lo,mid,ans=len(sec_sum2)-1,0,0,0\r\n while hi>=lo:\r\n mid=int((hi+lo)/2)\r\n if key+sec_sum2[mid]==high: return high\r\n elif key+sec_sum2[mid]<high:\r\n lo=mid+1\r\n ans=mid\r\n else: hi=mid-1\r\n return key+sec_sum2[ans]\r\n \r\nn,m=map(int,input().split(' '))\r\nA=[int(a) for a in input().split()]\r\nfor i in range(0,n,1):\r\n if i%2==0: lst1.append(A[i]%m)\r\n else: lst2.append(A[i]%m)\r\nrec1(0,0)\r\nrec2(0,0)\r\n\r\nsec_sum1.sort()\r\nsec_sum2.sort()\r\nmaxi=0\r\nfor i in range(0,len(sec_sum1),1):\r\n cur=binary_search(sec_sum1[i],m-1)\r\n maxi=max(maxi,cur)\r\n\r\nprint(maxi)", "#https://cses.fi/problemset/task/1628/\r\nfrom bisect import bisect_left\r\nn,m=map(int,input().strip().split())\r\na=[*map(int,input().strip().split())]\r\nmask=0\r\nans=0\r\nn=(n+1)//2\r\nd=[]\r\nr=a[n:]\r\n# print(r)\r\nwhile mask<(1<<n):\r\n tans=0\r\n for i in range(n):\r\n if mask&(1<<i):\r\n tans+=a[i]\r\n mask+=1\r\n tans%=m\r\n # print(tans,bin(mask))\r\n d.append(tans%(m))\r\n ans=max(ans,tans)\r\nd.sort()\r\nd2=[]\r\nmask=0\r\nwhile mask<(1<<(len(r))):\r\n tans=0\r\n for i in range(len(r)):\r\n if mask&(1<<i):\r\n tans+=r[i]\r\n tans%=m\r\n mask+=1\r\n\r\n req=(m-tans)\r\n # print(req,bin(mask))\r\n rr=bisect_left(d,req)\r\n rr-=1\r\n ans=max(ans,tans%(m))\r\n if rr>=0:\r\n ans=max(ans,d[rr]+tans)\r\n d2.append(tans)\r\nprint(ans)\r\n\r\n\r\n", "from bisect import *\r\n\r\ndef allSubset(arr,mod):\r\n n = len(arr)\r\n subsetSum = []\r\n for i in range(1<<n):\r\n s = 0\r\n for j in range(n):\r\n if (i&(1<<j)):\r\n s = (s+arr[j])%mod\r\n subsetSum.append(s)\r\n return subsetSum\r\n\r\n\r\ndef meetInMiddle(arr,limit):\r\n n = len(arr)\r\n X = allSubset(arr[:n//2],limit)\r\n Y = allSubset(arr[n//2:],limit)\r\n\r\n Y.sort()\r\n m = 0\r\n for i in X:\r\n if i<= limit-1:\r\n idx = bisect_left(Y,limit-1 - i)\r\n if(idx == len(Y) or (Y[idx] != (limit-1-i))):\r\n idx -=1\r\n m = max(m,i + Y[idx])\r\n return m\r\n\r\n\r\nn,mod = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nprint(meetInMiddle(arr,mod))", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nn1 = n // 2\r\nn2 = n - n1\r\nb = a[:n1]\r\nc = a[n1:]\r\npow2 = [1]\r\nfor _ in range(20):\r\n pow2.append(2 * pow2[-1])\r\nx = set()\r\nfor i in range(pow2[n1]):\r\n s = 0\r\n for j in range(n1):\r\n if i & pow2[j]:\r\n s += b[j]\r\n s %= m\r\n x.add(s)\r\nx = list(x)\r\nx.sort()\r\nans = 0\r\nfor i in range(pow2[n2]):\r\n s = 0\r\n for j in range(n2):\r\n if i & pow2[j]:\r\n s += c[j]\r\n s %= m\r\n ans = max(ans, s, (s + x[-1]) % m)\r\n j = bisect.bisect_left(x, m - s - 0.5)\r\n if j:\r\n ans = max(ans, s + x[j - 1])\r\nprint(ans)", "from bisect import bisect_left\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef calculate_sums(arr, mod_value):\r\n result = [0]\r\n new_values = []\r\n for x in arr:\r\n for y in result:\r\n new_value = (x + y) % mod_value\r\n new_values.append(new_value)\r\n result.extend(new_values)\r\n new_values.clear()\r\n return sorted(set(result))\r\n\r\n\r\nhalf_of_array = n // 2\r\nfirst_half = calculate_sums(a[:half_of_array], m)\r\nsecond_half = calculate_sums(a[half_of_array:], m)\r\n\r\nsecond_half_length = len(second_half)\r\n\r\nmax_sum = 0\r\n\r\nfor x in first_half:\r\n target = (m - x - 1) % m\r\n i = bisect_left(second_half, target) % second_half_length\r\n\r\n possible_sums = [(x + second_half[i-1]) % m,\r\n (x + second_half[i]) % m,\r\n (x + second_half[(i+1) % second_half_length]) % m]\r\n \r\n max_sum = max(max_sum, *possible_sums)\r\n\r\nprint(max_sum)# 1692188253.213442", "import random\r\nimport sys\r\nfrom heapq import heappop, heappush\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n # использую технику meet in the middle\r\n # делю массив на две части и для каждой части нахожу суммы все возможных подмножеств\r\n subs = [{0}, {0}]\r\n st_en = [[0, n // 2], [n // 2, n]]\r\n # генерация всех возможных сумм по заданному модулю\r\n for i in range(2):\r\n for j in range(st_en[i][0], st_en[i][1]):\r\n upd = set()\r\n for k in subs[i]:\r\n if (k + a[j]) % m not in subs:\r\n upd.add((k + a[j]) % m)\r\n for k in upd:\r\n subs[i].add(k)\r\n\r\n # перевожу сеты в списки и сортирую второй список, чтобы можно было использовать бинпоиск\r\n subs = [list(subs[i]) for i in range(2)]\r\n subs[1].sort()\r\n\r\n res = 0\r\n for i in subs[0]:\r\n l, r = 0, len(subs[1]) - 1\r\n # для каждого числа из первого списка нахожу наибольшее из второго, что их сумма не больше m\r\n # т.к. все числа по модулю m, то максимальная сумма не должна превышать m\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if i + subs[1][mid] >= m:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n res = max(res, i + subs[1][r])\r\n\r\n print(res)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "\r\ndef fckset( arr , i , ans , m , s ):\r\n \r\n if i == len(arr):\r\n s.add( ans )\r\n else:\r\n fckset( arr , i+1 , ( ans+arr[i] )%m , m , s )\r\n fckset( arr , i+1 , ans , m , s )\r\n\r\n \r\n\r\nn, m = map( int , input().split(\" \") )\r\narr = list( map( int , input().split(\" \") ) )\r\n\r\nx = set()\r\ny = set()\r\nh1 = fckset( arr[:n//2] , 0 , 0 , m , x )\r\nh2 = fckset( arr[n//2:] , 0 , 0 , m , y )\r\n\r\n# h1.sort()\r\n\r\nx = list(x)\r\ny = list(y)\r\n\r\ny.sort()\r\n\r\n \r\nimport bisect\r\n\r\nprint(max(i+y[bisect.bisect_left(y,m-i)-1]for i in x))\r\n ", "from bisect import bisect_right\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = a[:len(a) // 2]\r\nr = a[len(a) // 2:]\r\n\r\npl = set([0])\r\npr = set([0])\r\n\r\nfor i in l:\r\n\ttemp = set()\r\n\tfor j in pl:\r\n\t\ttemp.add((i + j) % m)\r\n\tpl.update(temp)\r\n\tpl.add(i % m)\r\n\r\nfor i in r:\r\n\ttemp = set()\r\n\tfor j in pr:\r\n\t\ttemp.add((i + j) % m)\r\n\tpr.update(temp)\r\n\tpr.add(i % m)\r\n\r\npr = sorted(pr)\r\n\r\nbest = -1\r\nfor i in pl:\r\n\tbest = max((pr[bisect_right(pr, m - i - 1) - 1] + i), best)\r\n\r\nprint(best)" ]

[ "p,n=map(int,input().split())\r\nD=[-1]*p\r\nfor i in range(n):\r\n y=int(input())\r\n if D[y%p]!=-1:\r\n print(i+1)\r\n exit()\r\n else:\r\n D[y%p]=0\r\nprint(-1)", "p, n = map(int, input().split())\r\nhash_table = [False] * p\r\nans = -1\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n if ans == -1:\r\n if hash_table[x % p]: ans = i + 1\r\n hash_table[x % p] = True\r\n\r\nprint(ans)", "p,n = map(int,input().split())\r\n\r\nk = [int(input()) for i in range(n)]\r\n\r\ndef h(x):\r\n return x % p\r\n\r\nd = dict()\r\n\r\nfor i in range(len(k)):\r\n if h(k[i]) in d:\r\n print(i+1)\r\n exit()\r\n else:\r\n d[h(k[i])] = 1\r\n\r\nprint(-1)", "s = set()\r\np, n = map(int, input().split())\r\n\r\nfor k in range(n):\r\n buc = int(input()) % p\r\n if buc in s:\r\n print(k+1)\r\n break\r\n else:\r\n s.add(buc)\r\nelse:\r\n print(-1)", "a,b = map(int,input().split())\r\nd = {}\r\nk = 0\r\nfor i in range(b):\r\n\tp = int(input())\r\n\tif p%a in d:\r\n\t\tk = 1\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\telse:\r\n\t\td[p%a] = p\r\n\r\nif k == 0 and i == b - 1:\r\n\tprint(-1)", "p, n = map(int, input().split())\r\nd = {}\r\n\r\nfor i in range(n):\r\n x = int(input()) % p\r\n \r\n if x in d:\r\n print(i + 1)\r\n quit()\r\n d[x] = 1\r\n \r\nprint(-1)", "p,n=map(int,input().split())\r\nx=[0 for i in range(n)]\r\nfor i in range(n):\r\n\tx[i]=int(input())\r\nwas=[0 for i in range(p)]\r\nk=-1\r\nfor i in range(n):\r\n\tif was[x[i]%p]:\r\n\t\tk=i+1\r\n\t\tbreak\r\n\telse:\r\n\t\twas[x[i]%p]=1\r\nprint(k)\t", "p, n = map(int, input().split())\nhash_table = [-1] * p\n\nflag = True\nfor i in range(n):\n\n x = int(input())\n\n hx = x % p\n\n if hash_table[hx] == -1:\n hash_table[hx] = x\n\n else:\n print(i+1)\n flag = False\n break\n\nif(flag):\n print(-1)\n", "p, n = [int(s) for s in input().split(' ')]\r\nms = set()\r\nanswer = - 1\r\nfor i in range(n):\r\n x = int(input())\r\n if x % p in ms:\r\n answer = i + 1\r\n break\r\n else:\r\n ms.add(x % p)\r\nprint(answer)", "p, n = map(int,input().split())\r\nx = []\r\nfor i in range(n):\r\n x.append(int(input()))\r\npos = []\r\nout = -1\r\nfor i in range(n):\r\n a = x[i] % p\r\n if a in pos:\r\n out = (i+1)\r\n break\r\n else:\r\n pos.append(a)\r\n \r\nif out == -1 :\r\n print(-1)\r\nelse:\r\n print (out)", "p,n=map(int,input().split())\r\nh=[]\r\nflag=0\r\nfor i in range(n):\r\n\tx=int(input())\r\n\ty=x%p\r\n\tif y in h and flag==0:\r\n\t\tprint(i+1)\r\n\t\tflag=1\r\n\telse:\r\n\t\th.append(y)\r\n\tif flag==0 and i==n-1:\r\n\t\tprint(-1)", "p, n = map(int, input().split())\r\narr = [0]*p\r\nok=-1\r\nfor _ in range(n):\r\n x = int(input())\r\n if arr[x%p]:\r\n ok=_+1\r\n break\r\n else:arr[x%p] = 1\r\nprint(ok)", "p, n = tuple(int(i) for i in input().split())\r\nhash = set()\r\n\r\ndef solve():\r\n\tglobal p,n,hash\r\n\tfor i in range(n):\r\n\t\tk = int(input()) % p\r\n\t\tif(k in hash):\r\n\t\t\tprint(i+1)\r\n\t\t\treturn\r\n\t\thash.add(k)\r\n\tprint(-1)\r\n\treturn\r\n\r\nsolve()", "p, n = [int(x) for x in input().split()]\r\ngood = True\r\ns = set(range(p))\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n if good:\r\n r = x % p\r\n if r in s:\r\n s.remove(r)\r\n else:\r\n print(i + 1)\r\n good = False\r\n \r\nif good:\r\n print('-1')\r\n", "p, n = map(int, input().split())\r\nl = [int(input()) for _ in range(n)]\r\nk = []\r\nfor i in range(n):\r\n if l[i]%p in k:\r\n print(i+1)\r\n exit()\r\n k.append(l[i]%p)\r\nprint(-1) ", "a = list(input().split(' '))\r\np, n = int(a[0]), int(a[1])\r\na = list(0 for x in range(333))\r\nflag = False\r\nfor i in range(n):\r\n x = int(input())\r\n \r\n if a[x%p] != 0 and not flag:\r\n print(i+1)\r\n flag = True\r\n else:\r\n a[x%p] += 1\r\nif (not flag):\r\n print(-1)\r\n\r\n", "p,n = map(int,input().split())\r\nli = []\r\ns = []\r\nflag = 0\r\nfor i in range(n):\r\n li.append(int(input()))\r\ns.append(li[0]%p)\r\nfor j in range(1,n):\r\n a = li[j]%p\r\n if a not in s:\r\n s.append(a)\r\n else:\r\n flag = 1\r\n print(len(s)+1)\r\n break\r\nif flag==0:\r\n print(-1)\r\n\r\n", "p,n=map(int,input().split())\r\nx=[]\r\nh=[]\r\ny=[]\r\na=int(((n-1)*n)/2)\r\nfor i in range(n):\r\n b=int(input())\r\n x.append(b)\r\n \r\n \r\nfor j in range(n):\r\n c=x[j]%p\r\n h.append(c)\r\nfor m in range(1,n):\r\n for k in range(m):\r\n if h[k]==h[m]:\r\n y.append(m+1) \r\n \r\n else:\r\n a=a-1\r\nif a==0:\r\n print(\"-1\")\r\nelse:\r\n print(y[0])", "import sys\r\n\r\ndef main():\r\n p, n, *l = map(int, sys.stdin.read().strip().split())\r\n s = set()\r\n for i,j in enumerate(l, 1):\r\n t = j%p\r\n if t in s: return i\r\n s.add(j%p)\r\n return -1\r\n\r\nprint(main())\r\n", "p,n=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n x=int(input())\r\n if x%p in s:\r\n print(i+1)\r\n exit()\r\n else:\r\n s.add(x%p)\r\nprint(-1)", "p, n = map(int, input().split())\r\nt = [False] * p\r\nfor i in range(n):\r\n k = int(input()) % p\r\n if t[k]:\r\n print(i + 1)\r\n exit(0)\r\n t[k] = True\r\nprint(-1)", "import itertools\r\n\r\n\r\ndef main():\r\n p,n = [int(v) for v in input().split()]\r\n r = set()\r\n for i in range(n):\r\n v = int(input())\r\n if v%p in r:\r\n print(i+1)\r\n return\r\n r.add(v%p)\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# bestwillcui\r\n# Codeforces Problem 1\r\n\r\nAkshajK = input(\"\").split()\r\n\r\np = int(AkshajK[0])\r\nn = int(AkshajK[1])\r\n\r\nc = 1\r\nasdf = []\r\nl_1 = []\r\nfor x in range(p):\r\n l_1.append(0)\r\n\r\nwhile c <= n:\r\n s = int(input())\r\n if l_1[s % p] == 0:\r\n l_1[s % p] = 1\r\n else:\r\n asdf.append(c)\r\n c += 1\r\nif asdf != []:\r\n print(asdf[0])\r\nelse:\r\n print(-1)\r\n", "p, n = map(int, input().split())\r\nl = [0]*p\r\nd = 0\r\n\r\nfor i in range(n):\r\n a = int(input())\r\n\r\n c = a % p\r\n if l[c] == 1:\r\n if d == 0:\r\n d = i+1 \r\n else:\r\n l[c] = 1\r\n\r\nif d == 0:\r\n print(-1)\r\nelse:\r\n print(d) ", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\np, n = inp()\r\nhash = dict({})\r\nfor i in range(n):\r\n x = int(input())\r\n if (str(x % p) not in hash):\r\n hash[str(x % p)]=x\r\n else:\r\n exit(print(i+1))\r\nprint(-1)\r\n", "p,n=map(int,input().split())\r\na,f=[],0\r\nfor x in range(n):\r\n\tb=int(input())%p\r\n\tif b in a:\r\n\t\tprint(x+1)\r\n\t\tf=1\r\n\t\tbreak\r\n\telse:a.append(b)\r\nif f==0:print(-1)", "__author__ = 'Adela'\r\n\r\n\r\ndef main():\r\n p, n = (int(k) for k in input().split())\r\n full = [False] * p\r\n for i in range(n):\r\n xi = int(input())\r\n mod = xi % p\r\n if full[mod]:\r\n print(i+1)\r\n return\r\n full[mod] = True\r\n\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "p, n = map(int, input().split())\r\nmod = []\r\nans = -1\r\nfor t in range(n):\r\n x = int(input())\r\n diff = x % p\r\n if diff not in mod:\r\n mod.append(diff)\r\n elif diff in mod:\r\n ans = t + 1\r\n break\r\nprint(ans)\r\n\r\n", "p, n = list(map(int, input().split()))\r\nans=-1\r\nd={i:-1 for i in range(p)}\r\nfor i in range(n):\r\n val = int(input())\r\n if d[val%p]>-1 and ans==-1:\r\n ans = i+1\r\n else: \r\n d[val%p] = val\r\n\r\nprint(ans)", "p,n=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x=int(input())\r\n d=x%p\r\n if(d not in l):\r\n l.append(d)\r\n else:\r\n print(i+1)\r\n exit()\r\nelse:\r\n print(-1)", "p, n = map(int,input().split(\" \"))\r\ns = set()\r\ni = 0\r\nwhile(i < n):\r\n a = int(input())\r\n m = a % p\r\n if(m not in s):\r\n s.add(m)\r\n else:\r\n break\r\n i += 1\r\nprint((i+1,-1)[i == n])\r\n \r\n \r\n", "p, n = map(int, input().split())\r\n\r\nbuckets = [-1] * p # Initialize an array to represent the buckets, -1 means empty\r\nconflict_index = -1 # Initialize the index where the first conflict occurs\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n bucket = x % p # Calculate the bucket index using the hash function\r\n \r\n if buckets[bucket] == -1:\r\n # If the bucket is empty, insert the number\r\n buckets[bucket] = x\r\n else:\r\n # If the bucket is already occupied, a conflict occurs\r\n if conflict_index == -1:\r\n conflict_index = i + 1 # Store the index where the first conflict occurs\r\n\r\n# Print the result\r\nprint(conflict_index)\r\n", "s = input().split()\r\np, n = int(s[0]), int(s[1])\r\nl = [False]*p\r\nidx = -1\r\nfor i in range(n):\r\n x = int(input())\r\n if l[x%p]:\r\n idx = i+1\r\n break\r\n else:\r\n l[x%p] = True\r\nprint(idx)\r\n", "p,n=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n b.append(int(input()))\r\nj=1\r\nfor i in b:\r\n r=i%p\r\n if r in a:\r\n print(j)\r\n break\r\n else:\r\n a.append(r)\r\n j=j+1\r\nelse:\r\n print(-1)", "def main():\n p, n = [int(i) for i in input().split()]\n \n d = [0 for i in range(p)]\n \n for i in range(n):\n x = int(input()) % p\n if d[x]:\n print(i + 1)\n return\n d[x] = 1\n \n print(-1)\n\n\nmain()\n", "p,n = map(int,input().split())\r\nl,f = [],0\r\nfor i in range(n):\r\n\tk = int(input())\r\n\tif k%p in l:\r\n\t\tprint(i+1)\r\n\t\tf=1\r\n\t\tbreak\r\n\telse:\r\n\t\tl.append(k%p)\r\nif f==0:print(-1)", "import sys\r\nl = []\r\np, n = map(int, input().split())\r\nfor i in range(1, n+1):\r\n x = int(input()) % p\r\n if x not in l:\r\n l.append(x)\r\n else:\r\n print(i)\r\n sys.exit()\r\n\r\nprint(-1)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfor __T_E_S_T_S__ in range(1):\r\n p, n = list(map(int, input().split()))\r\n hash_table = [-1] * p\r\n for i in range(n):\r\n x = int(input())\r\n if hash_table[x % p] > -1:\r\n print(i + 1)\r\n exit()\r\n hash_table[x % p] = x\r\n print(-1)\r\n", "p,n=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(input()))\r\nd={}\r\nm=-1\r\nfor i in range(n):\r\n if(l[i]%p in d):\r\n m=i+1\r\n break\r\n else:\r\n d[l[i]%p]=1\r\nprint(m)\r\n", "p, n = map(int, input().split())\r\nh = [False] * p\r\nres = -1\r\nfor i in range(n):\r\n idx = int(input()) % p\r\n if h[idx]:\r\n res = i + 1\r\n break\r\n h[idx] = True\r\nprint(res)\r\n", "def h(x, p):\r\n return x % p\r\n\r\n\r\nclass CodeforcesTask447ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.p_n = []\r\n self.inserts = []\r\n\r\n def read_input(self):\r\n self.p_n = [int(x) for x in input().split(\" \")]\r\n self.inserts = [int(input()) for x in range(self.p_n[1])]\r\n\r\n def process_task(self):\r\n hashes = [False for x in range(self.p_n[0])]\r\n result = -1\r\n for i, x in enumerate(self.inserts):\r\n if hashes[h(x, self.p_n[0])]:\r\n if result < 0:\r\n result = i + 1\r\n else:\r\n hashes[h(x, self.p_n[0])] = True\r\n self.result = str(result)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask447ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "p, n = map(int, input().split())\nnumber = -1\nwas = []\nfor i in range(n):\n\tc = int(input()) % p\n\tif c in was:\n\t\tnumber = i+1\n\t\tbreak\n\twas.append(c)\nprint(number)\n\t\n", "p,n=map(int,input().split())\r\nH = [0]*p\r\nfor i in range(n):\r\n a = int(input())\r\n r = a%p\r\n if not H[r]: H[r]=1\r\n else:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n", "# map(int, input().split())\r\n# list(map(int, input().split()))\r\n\r\np,n = map(int, input().split())\r\nx = [int(input()) for i in range(n)]\r\nmod = []\r\nfor j in range(n):\r\n if (x[j] % p) in mod:\r\n print(j+1)\r\n break\r\n else:\r\n mod.append(x[j] % p)\r\nelse:\r\n print(-1)", "p, n = [int(x) for x in input().split()]\ns = set()\nf = True\nanswer = -1\nfor i in range(n):\n x = int(input())\n if x%p not in s:\n s.add(x%p)\n elif f:\n answer = i+1\n f = False\n\nprint(answer)\n", "n,m=map(int,input().split())\r\nl=[]\r\ns=0\r\nfor i in range(m):\r\n\tw=int(input())\r\n\tif w%n not in l:\r\n\t\tl.append(w%n)\r\n\telse:\r\n\t\ts=i+1\r\n\t\tprint(i+1)\r\n\t\tbreak\r\nif s==0:\r\n\tprint(\"-1\")\r\n", "p,n=[int(x) for x in input().split()]\r\narr=[]\r\nkey=0\r\nfor i in range(0,n):\r\n x=int(input())\r\n if x%p in arr:\r\n key=1\r\n print(i+1)\r\n break\r\n else:\r\n arr.append(x%p)\r\nif key==0:\r\n print(-1)", "p, n = map(int, input().split())\r\nbuckets = [0] * p\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n if buckets[x % p]:\r\n print(i + 1)\r\n exit(0)\r\n else:\r\n buckets[x % p] = 1\r\n\r\nprint(-1)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n p,n = map(int, wtf[0].split())\r\n b = set()\r\n for i in range(n):\r\n x = int(wtf[i+1])\r\n h = x%p\r\n if h in b:\r\n print(i+1)\r\n sys.exit(0)\r\n b.add(h)\r\n print(-1)\r\n", "p, n = map(int, input().split())\r\nb = []\r\nfor i in range(n):\r\n a = int(input())% p\r\n if a in b:\r\n print(i + 1)\r\n break\r\n b.append(a)\r\nelse:\r\n print(-1)\r\n", "def solution():\r\n p, n = (int(x) for x in input().split())\r\n mas = [False] * p\r\n for i in range(n):\r\n x = int(input())\r\n if not mas[x%p]:\r\n mas[x%p] = True\r\n else:\r\n return i + 1\r\n return -1\r\n\r\nprint(solution())", "p,n=map(int,input().split())\r\ns=[]\r\nindex=-1\r\nfor i in range(n):\r\n\tx=int(input())\r\n\tyy=(x%p)\r\n\tif yy in s:\r\n\t\tif index==-1:\r\n\t\t\tindex=i+1\r\n\telse:\r\n\t\ts.append(yy)\r\nprint(index)\r\n\t", "P, N = list(map(int, input().split()))\r\nMyDict = dict()\r\nConflict = 0\r\nfor i in range(N):\r\n Input = int(input())\r\n if (Input % P) in MyDict.keys():\r\n print(i + 1)\r\n exit()\r\n else:\r\n MyDict[Input % P] = 0\r\nprint(-1)", "p, n = map(int, input().split())\nm = []\nf = False\na = -1\nfor i in range(1, n + 1):\n x = int(input()) % p\n if not f and x in m:\n f = True\n a = i\n m.append(x)\nprint(a)\n", "p, _= list(map(int, input().split()))\n\nused = set()\n\nfor i in range(_):\n x = int(input())\n if x%p in used:\n print(i+1)\n exit()\n else:\n used.add(x%p)\nprint(-1)\n", "p, n = map(int, input().split())\r\ncoll_id = -1\r\nhash = [False for i in range(p)]\r\n\r\nfor i in range(n):\r\n x = int(input()) % p\r\n if (not hash[x]):\r\n hash[x] = True\r\n else:\r\n coll_id = i + 1\r\n break\r\n\r\nprint(coll_id)\r\n", "p,n=map(int,input().split())\r\na=[]\r\nfor i in range(p):\r\n a.append(i)\r\nb=[0]*p\r\nc=dict(zip(a,b))\r\nfor i in range(n):\r\n x=int(input())\r\n c[x%p]=c[x%p]+1\r\n if c[x%p]>1:\r\n print(i+1)\r\n break\r\nelse:\r\n print(\"-1\")\r\n", "p,n = map(int,input().split())\r\nls = [int(input()) for i in range(n)]\r\nls = [i % p for i in ls]\r\nfor q in range(n):\r\n if ls[q] in ls[:q]:\r\n print(q+1)\r\n break\r\nelse:\r\n print(-1)", "p,n=map(int,input().split())\r\nf=0\r\nl=list(range(p))\r\nfor i in range (n):\r\n\tx=int(input())\r\n\tif x%p in l:\r\n\t\tl.remove(x%p)\r\n\telse:\r\n\t\tprint(i+1)\r\n\t\tf=1\r\n\t\tbreak\t\r\nif f==0:\r\n\tprint(-1)", "import sys\r\np,n = map(int , input().split())\r\ns = set()\r\nfor i in range(n):\r\n x = int(input())%p\r\n if x in s:\r\n print(i+1)\r\n sys.exit(0);\r\n s.add(x)\r\nprint(-1)", "p, n = map(int, input().split())\nc = []\nfor i in range(n):\n x = int(input())\n s = x%p\n f = -1\n if s in c:\n f = i+1\n break\n c.append(s)\nprint(f)\n", "p, n = tuple(map(int, input().split(' ')))\r\nmods = []\r\nresult = -2\r\nfinished = False\r\n\r\nfor i in range(n):\r\n if finished:\r\n input()\r\n else:\r\n tmp = int(input()) % p\r\n if tmp in mods:\r\n result = i\r\n finished = True\r\n mods.append(tmp)\r\n\r\nprint(result + 1)", "m, d = map(int, input().split())\r\nw = set()\r\nfor i in range(d):\r\n a = int(input())\r\n if a % m in w:\r\n print(i + 1)\r\n exit()\r\n w.add(a % m)\r\nprint(-1)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n m, n = map(int, input().split())\r\n A = []\r\n for i in range(n):\r\n A.append(int(input()))\r\n s = set()\r\n ans = -1\r\n for i in range(n):\r\n if A[i] % m not in s:\r\n s.add(A[i] % m)\r\n else:\r\n ans = i\r\n break\r\n if ans == -1:\r\n print(-1)\r\n else:\r\n print(ans + 1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "p,n=map(int,input().split())\r\na=[]\r\ni=0\r\nq=-1\r\nwhile n>i:\r\n b=int(input())%p\r\n if b in a and q==-1:\r\n q=i+1\r\n a.append(b%p)\r\n i+=1\r\nprint(q)\r\n \r\n \r\n\r\n \r\n", "bucketLen, numberOfItems = list(map(int, input().split()))\n\ndef calcHash(item,bucketLen):\n return item % bucketLen\n\n\nhashList = [None for i in range(bucketLen)]\nfalseFlag = False\ncollisionIndex = -1\n\nfor i in range(numberOfItems):\n item = int(input())\n hashValue = calcHash(item, bucketLen)\n if hashList[hashValue] != None and falseFlag == False:\n falseFlag = True\n collisionIndex = i + 1\n\n hashList[hashValue] = item\n\nprint(collisionIndex)\n\n\n\n# 10 6\n# 811966798\n# 734823552\n# 790326404\n# 929189974\n# 414343256\n# 560346537\n\n", "p, n = map(int, input().split())\nfl = -1\nar = []\nfor i in range(n):\n x = int(input())\n if x % p not in ar:\n ar.append(x % p)\n else:\n fl = (i + 1)\n break\nprint(fl)", "s = input()\r\np = int(s.split()[0])\r\nn = int(s.split()[1])\r\nnn = set()\r\nfor i in range(n):\r\n a = int(input()) % p\r\n if a in nn:\r\n print(i + 1)\r\n raise SystemExit(0)\r\n else:\r\n nn.add(a)\r\n\r\nprint(-1)\r\n\r\n\r\n \r\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\np,n=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n\tx=int(input())\r\n\th=x%p\r\n\tif h in a:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\telse:\r\n\t\ta.append(h)\r\nif len(a)==n:\r\n\tprint(-1)", "p,n=list(map(int,input().split()))\r\nl=[]\r\nflag=1\r\nfor i in range(n):\r\n x=int(input())\r\n if x%p in l:\r\n flag=0\r\n print(i+1)\r\n break\r\n else:\r\n l.append(x%p)\r\nif flag:\r\n print(-1)", "p,n=list(map(int,input().strip().split()))\r\nl=[]\r\nfor j in range(1,n+1):\r\n m=int(input())\r\n t=m%p\r\n if t in l:\r\n print(j)\r\n break\r\n else:\r\n l +=[t]\r\nelse:\r\n print(\"-1\")", "a, b = map(int, input().split())\r\nans = 0\r\nseen = set()\r\nwhile b:\r\n b -= 1\r\n\r\n num = int(input())\r\n ans += 1\r\n rem = num % a\r\n\r\n if rem in seen:\r\n print(ans)\r\n exit()\r\n else:\r\n seen.add(rem)\r\n\r\nprint(-1)\r\n\r\n\r\n\r\n\r\n", "p , n = map(int , input().split()) \r\nhash_table = [False] * p\r\nhash_function = lambda x : x % p\r\nconflit = -1\r\nfor i in range(1 ,n+1) : \r\n data = int(input())\r\n idx = hash_function(data)\r\n if not hash_table[idx] : \r\n hash_table[idx] =True\r\n else: \r\n conflit = i\r\n break\r\nprint(conflit)\r\n", "p,n=map(int,input().split())\r\nb=[]\r\nfor i in range(n):\r\n m=int(input())% p\r\n if m in b:\r\n print(i+1)\r\n quit()\r\n else: b.append(m)\r\nprint(-1)", "p, n = map(int, input().split())\r\nt = []\r\ncounter = 0\r\nfor i in range(n):\r\n x = int(input())\r\n if x % p in t:\r\n print(i+1)\r\n exit()\r\n else:\r\n t.append(x % p)\r\nprint(-1)\r\n\r\n# CodeForcesian\r\n# ♥\r\n# تو نمیتونی کتابی رو باز کنی و از اون چیزی یاد نگیری\r\n", "#!/usr/bin/env python\n\n\ndef main():\n p, n = map(int, input().split())\n table = set()\n for i in range(1, n+1):\n x = int(input())\n\n if x % p in table:\n print(i)\n return\n else:\n table.add(x % p)\n\n# print(\">\", x % p, table)\n\n print(-1)\n return\n\n\nif __name__ == '__main__':\n main()\n", "n , m = map(int, input().split())\r\nk , kl = [] , []\r\nfor i in range(m):\r\n kl.append(int(input()))\r\nfor i, j in enumerate(kl):\r\n t = j % n\r\n if t not in k :\r\n k.append(t)\r\n else :\r\n print(i+1)\r\n exit()\r\nprint(-1)", "p, n = map(int, input().split())\r\nbusy = [False] * p\r\nresult = -1\r\nfor index in range(n):\r\n v = int(input()) % p\r\n if result != -1:\r\n continue \r\n if busy[v]:\r\n result = index + 1\r\n busy[v] = True\r\n\r\nprint(result) \r\n", "p,n=map(int,input().split())\r\nr,s=0,{p}\r\nwhile r<n:\r\n x=int(input())%p\r\n if x in s:break\r\n r+=1;s|={x}\r\nprint([-1,r+1][r<n])", "# http://codeforces.com/problemset/problem/447/A\r\ndef main():\r\n d = {}\r\n p, n = input().split()\r\n p = int(p)\r\n n = int(n)\r\n for i in range(0, n):\r\n num = int(input())\r\n val = num % p\r\n res = d.get(val, -1)\r\n if res != -1:\r\n print(i + 1)\r\n return \r\n d[val] = num\r\n print(-1)\r\nmain()", "def solve(arr,p):\n d = {}\n for i in range(len(arr)):\n res = arr[i] % p\n if not d.get(res):\n d[res] = 1\n else:\n return i+1\n return -1\ndef main() :\n p,n = list(map(int, input().split(' ')))\n arr = []\n for _ in range(n):\n i = int(input())\n arr.append(i)\n print(solve(arr, p))\nmain()\n", "p, n = (int(i) for i in input().split())\nx = [int(input()) for _ in range(n)]\ns, res = set(), -1\nfor i, e in enumerate(x):\n if (e := e % p) in s:\n res = i + 1\n break\n s.add(e)\nprint(res)\n", "a,n=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tx=int(input())\r\n\tif x%a not in l:\r\n\t\tl.append(x%a)\r\n\telse:\r\n\t\tprint(len(l)+1)\r\n\t\tbreak\r\nif len(l)==n:\r\n\tprint(-1)", "h = []\na = -1\nP, N = map(int, input().split())\nfor i in range(N):\n v = int(input()) % P\n if (v in h) and a == -1:\n a = i + 1\n h.append(v)\nprint(a)\n", "p,n=map(int,input().split());l=[]\r\nfor i in range(n):\r\n h=int(input())\r\n m=h%p\r\n if m in l:\r\n print(i+1)\r\n break\r\n if i==n-1:\r\n print(-1)\r\n l.append(m)\r\n", "import sys\r\na,b=map(int, input().split())\r\nbucket=[0]*a\r\ntemp=0\r\nfor i in range(0,b):\r\n temp=int(input())\r\n if bucket[temp%a]>0:\r\n print(i+1)\r\n sys.exit(0)\r\n else:\r\n bucket[temp%a]+=1\r\nprint(\"-1\")", "n,m=map(int,input().split())\r\nli=[]\r\nfor i in range(m):\r\n a=int(input())%n\r\n if not a in li:\r\n li.append(a)\r\n else:\r\n print(i+1)\r\n exit(0)\r\nelse:\r\n print(\"-1\")", "from heapq import heapify, heappush, heappop\nfrom collections import Counter, defaultdict, deque, OrderedDict\nfrom sys import setrecursionlimit, maxsize\nfrom bisect import bisect_left, bisect, insort_left, insort\nfrom math import ceil, log, factorial, hypot, pi\nfrom fractions import gcd\nfrom copy import deepcopy\nfrom functools import reduce\nfrom operator import mul\nfrom itertools import product, permutations, combinations, accumulate, cycle\nfrom string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits\n\nprod = lambda l: reduce(mul, l)\nprodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)\n\ndef read_list(t): return [t(x) for x in input().split()]\ndef read_line(t): return t(input())\ndef read_lines(t, N): return [t(input()) for _ in range(N)]\n\np, n = read_list(int)\nbucket = [False] * p\nfor i, num in enumerate(read_lines(int, n)):\n if bucket[num % p]:\n print(i+1)\n break\n else:\n bucket[num % p] = True\nelse:\n print(-1)\n", "p,n = [int(i) for i in input().split()]\r\nX = [0 for _ in range(n)]\r\nfor i in range(n):\r\n X[i] = int(input())\r\n# h(x) = x % p\r\nH = {}\r\nfor i in range(n):\r\n hkey = X[i] % p\r\n if hkey in H:\r\n print(i+1)\r\n exit()\r\n else:\r\n H[hkey] = X[i]\r\nprint('-1')", "p, n = map(int ,input().split())\r\nmod = [0]*(p+2)\r\nfor i in range(1,n+1):\r\n j = int(input())\r\n if(mod[j%p]):\r\n print(i)\r\n exit(0)\r\n mod[j%p] = 1\r\nprint(-1)\r\n", "p,n = map(int,input().split(' '))\r\nans = 0\r\n\r\nlist = []\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n x = x%p\r\n if x in list:\r\n ans = i\r\n break\r\n else:\r\n list.append(x)\r\n\r\nif ans == 0:\r\n print(-1)\r\nelse:\r\n print(ans+1)", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n n,m=LI()\n d={}\n\n ans=inf\n for i in range(m):\n x=I()\n y=x%n\n\n if y in d:\n ans=min(ans,i+1)\n\n d[y]=y\n\n if ans==inf:\n return -1\n return ans\n\n# main()\nprint(main())\n", "num=[ ]\r\nans=[ ]\r\ncount=0\r\np,n=map(int,input().split())\r\nfor i in range(n):\r\n num.append(int(input()))\r\nfor i in range(n):\r\n if((num[i])%p not in ans):\r\n ans.append((num[i])%p)\r\n count+=1\r\n else:\r\n print(i+1)\r\n break\r\nif(count==n):\r\n print('-1')", "a,b=map(int,input().split());c=[]\r\nfor _ in range(b):\r\n f=int(input())%a;c+=[f]\r\n if c.count(f)>1:print(_+1);exit()\r\nprint(-1)\r\n", "def solve(p, n, x):\n a = set()\n for k, i in enumerate(x):\n h = i % p\n if h in a:\n return k + 1\n a.add(h)\n return -1\n\n\ndef main():\n p, n = list(map(int, input().split()))\n x = [int(input()) for _ in range(n)]\n print(solve(p, n, x))\n\n\nmain()\n", "s = input().split()\np = int(s[0])\nn = int(s[1])\nlst = []\nz = -1\nfor i in range(n):\n m = int(input()) % p\n if m in lst:\n if z == -1:\n z = i + 1\n \n else:\n lst.append(m)\nprint(z)\n\n\t\t\t \t\t\t\t \t \t \t\t\t\t \t \t \t", "x,y=[int(z) for z in input().split()]\r\nl=[]\r\nr=0\r\nm=y\r\nwhile y!=0:\r\n p=int(input())\r\n p=p%x\r\n if p not in l:\r\n l.append(p)\r\n else:\r\n if r==0:\r\n r=y\r\n y-=1\r\nif r==0:\r\n print(-1)\r\nelse:\r\n print(m-r+1)", "p,n=[int(i) for i in input().split()]\r\nconflict=-1\r\nd={}\r\nfor j in range(n):\r\n x=int(input())\r\n k=x%p\r\n if k not in d.keys():\r\n d[k]=1\r\n else :\r\n if conflict==-1:\r\n conflict=j+1\r\nprint(conflict)", "p,n = map(int,input().split())\r\nl = list()\r\nc = 0\r\nflag = True\r\nfor i in range(n):\r\n s = int(input())\r\n if s%p not in l:\r\n l.append(s%p)\r\n else: \r\n c-=1\r\n break\r\nif c == -1:\r\n print(len(l)+1)\r\nelse:\r\n print(-1)", "__author__ = 'Сергей'\r\n\r\np, n = (int(x) for x in input().split())\r\n\r\ndef hash(x):\r\n return x % p\r\n\r\ndict = {}\r\n\r\nfor i in range(n):\r\n key = hash(int(input()))\r\n if key in dict:\r\n print(i + 1)\r\n exit()\r\n else:\r\n dict[key] = True\r\n\r\nprint(-1)\r\n\r\n", "p,n=map(int,input().split())\r\nk=[]\r\nm=True\r\nfor i in range(n):\r\n j=int(input())\r\n if j%p not in k:\r\n k.append(j%p)\r\n else:\r\n print(i+1)\r\n m=False\r\n break\r\nif m:\r\n print(-1)\r\n \r\n", "def main() -> None:\r\n p, n = map(int, input().split())\r\n a = [0 for i in range(p)]\r\n for i in range(n):\r\n x = int(input())\r\n a[x % p] += 1\r\n if a[x % p] > 1:\r\n print(i + 1)\r\n break\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\np, n = map(int,input().split())\r\nai = [0] * p\r\nans = -1\r\nfor i in range(n):\r\n num = int(input())\r\n num = num % p\r\n if ai[num] == 1:\r\n ans = i + 1\r\n break\r\n ai[num] = 1\r\nprint(ans)\r\n", "p, n = map(int, input().split())\r\nar = []\r\nans = -1\r\ntf = True\r\nfor i in range(n):\r\n x = int(input())\r\n if x % p in ar and tf:\r\n ans = i + 1\r\n tf = False\r\n else:\r\n ar.append(x % p)\r\nprint(ans)\r\n", "f=lambda:map(int,input().split())\r\np,n=f()\r\nh=[]\r\nfor i in range(n):\r\n x=int(input())\r\n if not x%p in h:\r\n h.append(x%p)\r\n else:\r\n exit(print(i+1))\r\nprint(-1)", "p, n = [int(i) for i in input().split()]\r\nres = -1\r\nseen = set()\r\n\r\nfor i in range(1, n+1):\r\n if (res == -1):\r\n inp = int(input())\r\n temp = (inp % p)\r\n\r\n if (temp in seen):\r\n res = i\r\n continue\r\n\r\n seen.add(temp)\r\n \r\n else:\r\n input()\r\n\r\nprint(res)", "p, n = (int(x) for x in input().split())\r\n\r\ntable = {}\r\nres = -1\r\nfor i in range(n):\r\n val = int(input())\r\n hash = val % p\r\n if hash in table.keys():\r\n res = i\r\n break\r\n else:\r\n table[hash] = val\r\n \r\nprint(res + 1 if res != -1 else res)\r\n ", "p, n = map(int, input().split())\r\ncnt, res, x = [False] * (p + 1), -1, 0\r\nfor i in range(n):\r\n x = int(input())\r\n if cnt[x % p]:\r\n res = i + 1\r\n break\r\n cnt[x % p] = True\r\nprint(res)", "# P is the number of buckets from 0 to P-1\r\n# Insert n numbers\r\n\r\nbuckets, numbersCount = list(map(int, input().split()))\r\n\r\nans = -1\r\nnumbers = []\r\nhashes = [] \r\n\r\nfor _ in range(numbersCount):\r\n numbers.append(int(input()))\r\n\r\ncounter = 0\r\nfor number in numbers:\r\n mod = number % buckets\r\n if not mod in hashes:\r\n hashes.append(mod)\r\n else:\r\n ans = counter + 1\r\n break\r\n\r\n counter += 1\r\nprint(ans)\r\n\r\n ", "import sys\r\nimport collections\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef printnl(val):\r\n\tsys.stdout.write(str(val) + '\\n')\r\n\r\np, n = map(int, input().split())\r\nbuckets = [0] * p\r\nfor i in range(n):\r\n\tx = int(input())\r\n\tbuckets[x%p] += 1\r\n\tif buckets[x%p] == 2:\r\n\t\tprint(i + 1)\r\n\t\tsys.exit(0)\r\n\r\nprint(-1)", "a,b=map(int,input().split())\r\nl=[]\r\nr=-1\r\nfor i in range(0,b):\r\n k=int(input())\r\n if k%a+1 in l:\r\n if r==-1:\r\n r=i+1\r\n else:\r\n l.append(k%a+1)\r\nprint(r)", "p,n = map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=int(input())\r\n if(a%p not in l):\r\n l.append(a%p)\r\n else:\r\n print(i+1)\r\n exit()\r\nprint(-1) ", "import sys\r\nimport math\r\nfrom pprint import pprint\r\n\r\np, n = map(int, input().split())\r\nd = {}\r\nfor i in range(n):\r\n x = int(input())\r\n y = x % p\r\n if y in d:\r\n print(i + 1)\r\n sys.exit()\r\n d[y] = 1\r\nprint(-1)\r\n", "'''\n# https://www.jdoodle.com/python3-programming-online/\n#\n# 22.07.2021\n#\n# CF FF (255) A\n#\n'''\n\np, n = map (int, input ().split ())\n\nh = [0]*p\nk = -1\nfor i in range (n) :\n m = int (input ()) % p\n if h [m] > 0 :\n k = i + 1\n break\n else :\n h [m] = 1\n\nprint (k)\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-29 22:58:49\nLastEditTime: 2021-11-29 23:08:17\nDescription: DZY Loves Hash\nFilePath: CF447A.py\n'''\n\n\ndef func():\n p, n = map(int, input().strip().split())\n lst = []\n flag = False\n for i in range(n):\n num = int(input()) % p\n if num not in lst:\n lst.append(num)\n elif not flag:\n print(i + 1)\n flag = True\n if not flag:\n print(-1)\n\n\nif __name__ == '__main__':\n func()\n", "def main():\n p, n = map(int, input().split())\n l = [0, 21, 53, 41, 53]\n ha = [False] * p\n for i, x in enumerate(int(input()) for _ in range(n)):\n x %= p\n if ha[x]:\n return i + 1\n ha[x] = True\n return -1\n\n\nprint(main())\n", "p,n=map(int,input().rstrip().split())\r\nr=-1;\r\no=0\r\narr=[0]*p\r\nfor i in range(n):\r\n a=int(input())\r\n if arr[a%p]==1 and o==0:\r\n r=i+1\r\n o+=1\r\n else:\r\n arr[a%p]+=1\r\nprint(r) ", "p,n=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x=int(input())\r\n if x%p not in l:\r\n l.append(x%p)\r\n else:\r\n print(i+1)\r\n break\r\n \r\nelse:\r\n print(-1) ", "p, n = [int(x) for x in input().split()]\r\na = {}\r\nres = -1\r\nfor i in range(n):\r\n t = int(input())\r\n if (t % p in a) and (res == -1):\r\n res = i + 1\r\n else:\r\n a[t % p] = 1\r\nprint(res)\r\n", "import sys\r\nimport string\r\nfrom decimal import *\r\nfrom itertools import *\r\nfrom math import *\r\n\r\ndef solve():\r\n p,n = map(int,input().split())\r\n x = []\r\n for i in range(n):\r\n val = int(input())\r\n if (val % p) not in x:\r\n x.append(val % p)\r\n else :\r\n print(i+1)\r\n return 0\r\n print(-1)\r\nsolve();\r\n", "if __name__ == '__main__':\r\n p, n = str(input()).split()\r\n p = int(p)\r\n n = int(n)\r\n line = list()\r\n flag = True\r\n mark = 0\r\n for i in range(n):\r\n if flag:\r\n c = int(input()) % p\r\n if c in line:\r\n mark = i + 1\r\n flag = False\r\n line.append(c)\r\n if flag:\r\n print(-1)\r\n else:\r\n print(mark)\r\n", "def solution(l1,p):\r\n l1=[x%p for x in l1]\r\n t=[]\r\n i=0\r\n while i<len(l1):\r\n if l1[i] not in t:\r\n t.append(l1[i])\r\n else:\r\n return i+1\r\n i+=1\r\n return -1\r\n \r\ndef answer():\r\n a=[int(x) for x in input().split()]\r\n l1=[]\r\n while a[1]:\r\n l1.append(int(input()))\r\n a[1]-=1\r\n print(solution(l1,a[0]))\r\nanswer()\r\n\r\n ", "inp = input().split()\r\np = int(inp[0])\r\nn = int(inp[1])\r\n\r\nhash = [False] * p\r\nans = -1\r\nfor i in range(n):\r\n a = int(input()) % p\r\n if hash[a]:\r\n ans = i + 1\r\n break\r\n hash[a] = True\r\n \r\nprint(ans)", "p, n = [int(_) for _ in input().split()]\r\nd = {}\r\nans = -1\r\nf = True\r\nfor i in range(n):\r\n\tx = int(input())\r\n\tif f and x%p in d:\r\n\t\tans = i+1\r\n\t\tf = False\r\n\telse:\r\n\t\td[x%p] = 1\r\nprint(ans)", "p, n = map(int, input().split())\r\nst = set()\r\nfor i in range(n):\r\n a, ln = int(input()), len(st)\r\n st.add(a % p)\r\n if ln == len(st):\r\n print(i + 1)\r\n exit()\r\nprint(-1)\r\n", "def main():\n [p, n] = [int(_) for _ in input().split()]\n conflict_i = -1\n hashed = {}\n\n for i in range(n):\n s = input()\n\n if conflict_i == -1:\n number = int(s) % p\n\n if number in hashed:\n conflict_i = i + 1\n else:\n hashed[number] = True\n\n print(conflict_i)\n\n\nif __name__ == '__main__':\n main()\n", "p, n = map(int, input().split())\ns = set()\nr = -1\nfor i in range(1, n+1):\n x = int(input()) % p\n if x in s:\n r = i\n break\n s.add(x)\n\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", "p,n=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(input())%p)\r\nif(len(set(l))==n):\r\n print(-1)\r\nelse:\r\n for i in range(1,n):\r\n if l[i] in l[:i]:\r\n print(i+1)\r\n break\r\n", "p,n = map(int,input().split())\r\n\r\nans = -1\r\ns = set()\r\nfor i in range(n):\r\n nt= int(input())\r\n if ans == -1 and nt%p in s:\r\n ans = i+1\r\n else:\r\n s.add(nt%p)\r\n\r\nprint(ans)", "s = set()\r\np,n = map(int,input().split())\r\nfor i in range(n):\r\n x = int(input())\r\n if x%p not in s:\r\n s.add(x%p)\r\n else:\r\n print(i+1)\r\n quit()\r\nprint(-1)", "m , n = map(int, input().split())\r\nl = []\r\nans = -1\r\nfor i in range(n):\r\n x = int(input())\r\n if x%m in l:\r\n ans = i +1\r\n break\r\n l.append(x%m)\r\nprint(ans)", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\np, n = inp()\r\nhash = dict({})\r\nfor i in range(n):\r\n x = int(input())\r\n if (str(x % p) in hash):\r\n exit(print(i+1))\r\n hash[str(x % p)] = x\r\nprint(-1)\r\n", "p, n = map(int, input().split())\r\nns = [int(input()) for i in range(n)]\r\nhs = [0]*p\r\nres = -1\r\nfor i in range(n):\r\n if hs[ns[i] % p] > 0:\r\n res = i+1\r\n break\r\n else:\r\n hs[ns[i] % p] += 1\r\nprint(res)", "p, n = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n a = int(input())\r\n if a%p not in d:\r\n d.append(a%p)\r\n else:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n", "p,n=map(int,input().split())\r\nl=[]\r\nw=0\r\nfor i in range(n):\r\n\ta=int(input())\r\n\tif a%p not in l :\r\n\t\tl.append(a%p)\r\n\telse:\r\n\t\tw=i+1\r\n\t\tprint(w)\r\n\t\tbreak\r\nif w==0:\r\n\tprint(-1)", "p, n = map(int, input().split())\r\nused = []\r\nfor _ in range(p):\r\n used.append(0)\r\nfor i in range (n):\r\n x = int(input())\r\n if (used[(x%p)] == 1):\r\n print(i+1)\r\n quit()\r\n else:\r\n used[(x%p)] = 1\r\nprint(-1)", "p,n=map(int,input().split())\r\nh=[]\r\nfor _ in range(n):\r\n h.append(int(input())%p)\r\nk=[] \r\nfor i in h:\r\n if i not in k:\r\n k.append(i)\r\n else:\r\n print(len(k)+1)\r\n break\r\nif(k==h):\r\n print(-1)", "p, n = map(int, input().split())\r\nindex, count = [], 0\r\nfor i in range(n):\r\n x = int(input()) % p\r\n if x in index:\r\n exit(print(i + 1))\r\n index.append(x)\r\nprint(-1)\r\n", "# LUOGU_RID: 101569594\np, n, *a = map(int, open(0).read().split())\r\ns = set()\r\nfor i, x in enumerate(a):\r\n t = x % p\r\n if t in s:\r\n exit(print(i + 1))\r\n s.add(t)\r\nprint(-1)", "a=input().split()\np=int(a[0])\nn=int(a[1])\nh=[]\nflag=1\nfor i in range(p):\n h.append(0)\nfor i in range(n):\n work=int(input())\n work=work % p\n if h[work] and flag:\n answer=i+1\n flag=0\n h[work]=1\nif flag:\n answer=-1\nprint(answer)", "p,n = list(map(int,input().split()))\n\n\nlst = [0 for i in range(p+1)]\na = []\nfor i in range(n):\n\n x = int(input())\n\n a.append(x)\n\nfor i in range(n):\n if(lst[a[i]%p] == 1):\n ans = i+1\n print(ans)\n\n exit()\n lst[a[i]%p] = 1\nprint(-1)\n\n\n\n\n\n\n\n \t\t \t \t\t\t \t\t\t \t\t\t \t \t \t\t\t \t", "p, n = map(int, input().split())\r\nt = [0]*p\r\nfor i in range(n):\r\n x = int(input())\r\n t[x % p] += 1\r\n if t[x % p] == 2:\r\n print(i + 1)\r\n exit()\r\nprint(-1)\r\n", "p,n=[int(x) for x in input().split()]\r\nlst=[]\r\nfor i in range(n):\r\n lst.append(int(input()))\r\nres,check=[],1\r\nfor i in range(len(lst)):\r\n if lst[i]%p not in res:\r\n res.append(lst[i]%p)\r\n else:\r\n print(i+1)\r\n check=0\r\n break\r\nif check==1:\r\n print(-1)", "p, n = map(int, input().split())\nt = [-1]*p\nr = -1\nfor i in range(n):\n x = int(input()) % p\n if r == -1 and t[x] != -1:\n r = i+1\n t[x] = 1\nprint(r)\n", "p, n = map(int,input().split())\r\nr, s = 0, {p}\r\n\r\nwhile r < n:\r\n x = int(input())%p\r\n if x in s:\r\n break\r\n r += 1\r\n s |= {x}\r\nprint([-1,r+1][r<n])", "\r\np, n = map(int, input().split())\r\n\r\np_list = [[] for _ in range(p)]\r\n\r\nfor i in range(n):\r\n\tm = int(input())\r\n\tind = m % p\r\n\tif p_list[ind] == []:\r\n\t\tp_list[ind] = 1\r\n\telse:\r\n\t\tprint(i + 1)\r\n\t\texit()\r\n\r\nprint(-1)", "lst=[]\r\nz=list(map(int,input().split()))\r\nfor i in range(z[1]):\r\n x=int(input())\r\n if x%z[0] not in lst:\r\n lst.append(x%z[0])\r\n else:\r\n print(len(lst)+1)\r\n exit()\r\nprint(-1) ", "import sys\r\np,n = [int(x) for x in input().split(\" \")]\r\nl = []\r\nfor i in range(n): l.append(int(input()))\r\ns = set()\r\nfor i in range(len(l)):\r\n m = l[i]%p\r\n if m in s:\r\n print(i+1)\r\n sys.exit()\r\n else:\r\n s.add(m)\r\n\r\nprint(\"-1\")", "p, n = map(int, input().split())\r\ns = set()\r\nres = -1\r\nfor i in range(n):\r\n h = int(input()) % p\r\n if h in s:\r\n res = i + 1\r\n break\r\n s.add(h)\r\nprint(res)\r\n", "p,n=map(int, input().split())\r\nl=[]\r\nt=[]\r\ntest=0\r\nfor i in range(n):\r\n x=int(input())\r\n t.append(x)\r\nfor i in range (n):\r\n x=t[i]\r\n x=x%p\r\n if x in l:\r\n test=1\r\n break\r\n else:\r\n l.append(x)\r\nif test:\r\n print(i+1)\r\nelse:\r\n print(-1)\r\n ", "p,n=map(int,input().split())\r\na=[]\r\nfor i in range(p):\r\n\ta.append(0)\r\nt=False\r\nk=-1\r\nfor i in range(n):\r\n\tx=int(input())\r\n\tif a[x%p]==0:\r\n\t\ta[x%p]=1\r\n\telse:\r\n\t\tt=True\r\n\t\tbreak\r\nif t:\r\n\tfor z in range(i,n-1):\r\n\t\tc=int(input())\r\nif t:\r\n\tprint(i+1)\r\nelse:\r\n\tprint(-1)", "p,n = list(map(int,input().split()))\r\n\r\nflag = 0\r\nb = []\r\nfor i in range(n):\r\n\tx = int(input())\r\n\thx = x%p\r\n\tif hx in b:\r\n\t\tprint(i+1)\r\n\t\tflag = 1\r\n\t\tbreak\r\n\telse:\r\n\t\tb.append(hx)\r\n\r\nif flag == 0:\r\n\tprint(-1)", "p, n = map(int, input().split())\r\ntable = {}\r\nfor i in range(p):\r\n table[i] = None\r\nflag, ind = True, -1\r\nfor _ in range(n):\r\n num = int(input())\r\n val = num % p\r\n if table[val] != None and flag:\r\n ind = _ + 1\r\n flag = False\r\n else:\r\n table[val] = num\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(ind)", "p, n = [int(x) for x in input().split()]\r\ns = set()\r\nfor i in range(n):\r\n x = int(input()) % p\r\n if x in s:\r\n print(i + 1)\r\n break\r\n s.add(x)\r\nelse:\r\n print(-1)\r\n", "def main():\r\n [p, n] = list(map(int, input().split()))\r\n \r\n s = set()\r\n for i in range(n):\r\n m = int(input())\r\n h = m % p\r\n\r\n if h in s:\r\n print(i + 1)\r\n return\r\n else:\r\n s.add(h)\r\n print(-1)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "p,n = map(int,input().split())\r\nx = [i for i in range(p)]\r\ncheck = 0\r\nfor i in range(n):\r\n z = int(input())\r\n t = z%p\r\n if x[t]!=-1:\r\n x[t]=-1\r\n else:\r\n print(i+1)\r\n check = 1\r\n break\r\nif check==0:\r\n print(-1)\r\n\r\n", "p,n=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x=int(input())\r\n y = x%p\r\n if y not in l:\r\n l.append(y)\r\n else:\r\n print(i+1)\r\n exit()\r\nprint(-1)", "p, n = map(int, input().split())\narr = [-1 for i in range(1000)]\nfor i in range(n):\n\tx = int(input())\n\tif arr[x % p] != -1:\n\t\tprint(i+1)\n\t\texit()\n\telse:\n\t\tarr[x % p] = x\nprint(-1)\n", "p,n=map(int,input().split())\r\nxlist=[]\r\nfor i in range(n):\r\n\txlist.append(int(input()))\r\n\r\nremainderlist=[]\r\nfor i in range(n):\r\n\tif xlist[i]%p not in remainderlist:\r\n\t\tremainderlist.append(xlist[i]%p)\r\n\telse:\r\n\t\tprint(i+1)\r\n\t\tquit()\r\n\r\nprint(-1)\t", "a,b = map(int,input().split())\r\nv =[]\r\nfor _ in range(b):\r\n\tc = int(input())\r\n\tv.append(c%a)\r\nif len(v) == len(set(v)):\r\n\tprint(-1)\r\nelse:\r\n\tz =[]\r\n\tfor i in range(len(v)):\r\n\t\tif v[i] in z:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tz.append(v[i])\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\np, n = map(int, input().split())\r\nmemo = set()\r\n\r\nidx = -2\r\nfor i in range(n):\r\n data = int(input())\r\n if data % p in memo:\r\n idx = i\r\n break\r\n else:\r\n memo.add(data % p)\r\n\r\nprint(idx + 1)", "p,n=map(int, input().split())\r\nb=[]\r\na=[]\r\nf=0\r\nfor i in range(n):\r\n a.append(int(input()))\r\nfor i in range(n):\r\n if a[i]%p not in b:\r\n b.append(a[i]%p)\r\n else:\r\n f=1\r\n break\r\nif f==0:\r\n print(-1)\r\nelse:\r\n print(i+1)", "p, n = map(int, input().split())\r\na = set()\r\nfor i in range(n):\r\n x = int(input())\r\n if x % p in a:\r\n print(i + 1)\r\n break\r\n a.add(x % p)\r\nelse:\r\n print(-1)", "p, n = map(int, input().split())\r\nx = [int(input()) for i in range(n)]\r\nu = [False] * p\r\nfor i in range(min(p + 1, n)):\r\n if u[x[i] % p]:\r\n print(i + 1)\r\n break\r\n u[x[i] % p] = True\r\nelse:\r\n print(-1)", "p, n = map(int, input().split())\r\nl, m = [], []\r\n\r\nfor i in range(n):\r\n\tl.append(int(input()))\r\n\t\r\nfor i in range(len(l)):\r\n\tif l[i] % p not in m:\r\n\t\tm.append(l[i] % p)\r\n\telse:\r\n\t\tprint(i + 1)\r\n\t\tbreak\r\n\t\t\r\nif len(m) == len(l):\r\n\tprint(-1)\t\t", "#\r\n# # # Author:Aditya Joshi\r\n# #\r\np, n = map(int, input().split())\r\nd = {}\r\nf = True\r\nfor i in range(p):\r\n d[i] = -1\r\nfor i in range(n):\r\n t = int(input())\r\n h = t % p\r\n if d[h] != -1:\r\n print(i + 1)\r\n f = False\r\n break\r\n else:\r\n d[h] = t\r\nif f:\r\n print(-1)\r\n", "def main():\r\n p, n = map(int, input().split())\r\n\r\n seen = [False] * p\r\n for i in range(1, n + 1):\r\n cur = int(input()) % p\r\n if seen[cur]:\r\n print(i)\r\n return\r\n else:\r\n seen[cur] = True\r\n\r\n print(-1)\r\n\r\n\r\nmain()", "#rough code\r\np,n=map(int,input().split())\r\nl=[]\r\nfor i in range(0,n):\r\n x=int(input())\r\n l.append(x%p)\r\nif len(set(l))==len(l):\r\n print(-1)\r\nelse:\r\n index=0\r\n for i in l:\r\n index=index+1\r\n if (index-1)!=l.index(i):\r\n print(index)\r\n break\r\n \r\n ", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\np,n = map(int,input().split())\r\nb = [False for i in range(p)]\r\nfor i in range(n):\r\n x = int(input())\r\n if b[x%p] is True:\r\n break\r\n b[x%p] = True\r\nelse:\r\n print('-1')\r\n quit()\r\nprint(i+1)\r\n", "p, n = map(int, input().split())\r\ni = j = ans = 0\r\narr = []\r\nwhile i < n:\r\n inp = int(input())\r\n x = inp % p\r\n if x in arr:\r\n print(i+1)\r\n exit()\r\n arr.append(x)\r\n i += 1\r\nprint(-1)\r\n", "p, n = [int(x) for x in input().split()]\r\nl = [int(input()) for i in range(n)]\r\n\r\ntable = [False for i in range(p)]\r\ndone = False\r\nfor i in range(n):\r\n if table[l[i]%p]:\r\n print(i+1)\r\n done = True\r\n break\r\n else:\r\n table[l[i]%p] = True\r\nif not done:\r\n print(-1)\r\n", "p, n = map(int, input().split())\nval = [False] * p\nfor i in range(n):\n x = int(input())\n r = x % p\n if val[r]:\n print(i + 1)\n exit(0)\n else:\n val[r] = True\nprint(-1)\n \t \t\t \t \t \t \t \t \t\t", "p, n = map(int, input().split())\r\nused = set()\r\nfor i in range(n):\r\n x = int(input())\r\n r = x % p\r\n if r in used:\r\n print(i + 1)\r\n exit()\r\n else:\r\n used.add(r)\r\nprint(-1)", "p,n = map(int, input().split())\r\nhash_table = []\r\nfor i in range(0, n):\r\n\tx = int(input())\r\n\tif x % p in hash_table:\r\n\t\tprint(i + 1)\r\n\t\tquit()\r\n\telse:\r\n\t\thash_table.append(x % p)\r\nprint(-1)\r\n", "def hash(array, p):\n\n table = {}\n for i in range(len(array)):\n hx = array[i] % p\n if hx in table:\n return i+1\n else:\n table[hx] = array[i]\n\n return -1\n\nn = list(map(int, input().split()))\ni = 0\np = n[0]\narray = []\nwhile i < n[1]:\n x = input()\n array.append(int(x))\n i+=1\n\nprint(hash(array, p))\n\n", "pn = list(map(int, input().split()))\np = pn[0]\nn = pn[1]\nres = [0] * p\ninp = []\nflag = 0\nfor i in range(n):\n inp.append(int(input()))\nfor i in range(len(inp)):\n if res[inp[i] % p] == 0:\n res[inp[i] % p] = 1\n elif res[inp[i] % p] == 1:\n flag = 1\n break\n if flag == 1:\n break\nif flag == 1:\n print(i + 1)\nelse:\n print(-1)\n", "n,m=map(int,input().split())\r\na=[-1]*n\r\nfor i in range(m):\r\n k=int(input())\r\n if a[k%n]!=-1:print(i+1);exit()\r\n else:a[k%n]=k%n\r\nprint(-1)", "l=[]\r\na=-1\r\np,n=map(int,input().split())\r\nfor i in range(n):\r\n temp=int(input())\r\n t=temp%p\r\n if (t in l) and a==-1:\r\n a=i+1\r\n l.append(t)\r\nprint(a)\r\n\r\n\r\n", "p,n = list(map(int,input().split(\" \")))\r\nl = []\r\nfor i in range(n):\r\n l.append(int(input()))\r\ns = set()\r\nfor i in range(len(l)):\r\n m = l[i]%p\r\n if m in s:\r\n print(i+1)\r\n break\r\n s.add(m)\r\nelse:\r\n print(\"-1\")", "p, n = map(int, input().split())\r\nb = list()\r\nfor i in range(n):\r\n\ta = int(input())\r\n\tif a%p in b:\r\n\t\tprint(i+1)\r\n\t\texit(0)\r\n\telse:\r\n\t\tb.append(a%p)\r\nprint(-1)", "p, n = map(int, input().split())\r\nh = set()\r\n\r\nfor i in range(n):\r\n x = int(input()) % p\r\n if x in h:\r\n print(i+1)\r\n break\r\n h.add(x)\r\nelse:\r\n print(-1)", "p,n=map(int,input().split())\r\ndict={}\r\na=[]\r\nfor x in range(n):\r\n y=int(input())\r\n a.append(y)\r\ni=1\r\nfor x in a:\r\n if x%p in dict:\r\n print(i)\r\n break\r\n else:\r\n dict[x%p]=1\r\n i+=1\r\nelse:\r\n print(-1)", "def readln(): return tuple(map(int, input().split()))\r\n\r\np, n = readln()\r\ntable = [0] * p\r\nans = -1\r\nfor i in range(n):\r\n x, = readln()\r\n if table[x % p]:\r\n ans = i + 1\r\n break\r\n table[x % p] = 1\r\nprint(ans)", "p, n = map(int, input().split())\nb = [False] * p\n\nfor i in range(n):\n t = int(input())\n if b[t % p]:\n print(i+1)\n break\n else:\n b[t % p] = True\nelse:\n print(-1)\n\n \t \t\t\t\t\t \t\t\t \t\t \t\t \t\t", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\np,n=map(int,input().split())\r\nd=[-1]*p\r\nfor i in range(n):\r\n x=int(input())\r\n if d[x%p]==-1:\r\n d[x%p]=x\r\n else:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)", "p,n=map(int,input().split())\nr,s=0,{p}\nwhile r<n:\n x=int(input())%p\n if x in s:break\n r+=1;s|={x}\nprint([-1,r+1][r<n])\n\t \t\t\t\t\t \t \t \t \t \t \t\t \t", "p,n=map(int,input().split())\r\nlst=[]\r\nnim=0\r\nfor i in range(n):\r\n k=int(input())\r\n if k%p in lst:\r\n ans=i+1 \r\n nim=1 \r\n break\r\n lst.append(k%p)\r\nprint(ans if nim==1 else -1) \r\n ", "p, n = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append(int(input()))\r\nl=[]\r\nfor i in range(n):\r\n ans = arr[i] % p\r\n if ans in l:\r\n print(i+1)\r\n exit()\r\n else:\r\n l.append(ans)\r\nprint(-1)\r\n\r\n", "p, n = input().split() \r\np, n = int(p), int(n) \r\nx = []\r\ntable = {}\r\nerror = 0\r\n\r\nfor i in range(n):\r\n x += [int(input())]\r\n \r\nfor i in range(n):\r\n try:\r\n table[x[i] % p]\r\n except KeyError:\r\n table[x[i] % p] = 1\r\n else:\r\n error = 1\r\n print(i+1)\r\n break\r\n \r\nif not error:\r\n print(-1)", "from collections import defaultdict\r\n\r\ndef func():\r\n p, n = [ int(x) for x in input().split()]\r\n \r\n table = defaultdict(int)\r\n for index in range(0,n):\r\n x = int(input())\r\n if table[x%p] == 1:\r\n return index + 1\r\n table[x%p] = 1\r\n return -1\r\n\r\nprint(func())", "p, n = map(int, input().split())\r\nvec = []\r\nfor i in range(n):\r\n vec.append(int(input()))\r\n\r\nh, j = {}, -1\r\nfor i in range(n):\r\n if vec[i] % p in h:\r\n j = i\r\n break\r\n else:\r\n h[vec[i] % p] = vec[i]\r\n\r\nif j != -1: print(j + 1)\r\nelse: print(-1)", "p,n=map(int,input().split())\r\narr=[]\r\nbrr=[0 for i in range(p)]\r\n#print(brr)\r\nfor i in range(n):\r\n y=int(input())\r\n arr.append(y)\r\ncount=0\r\nfor i in range(n):\r\n x=arr[i]%p\r\n if(brr[x]==0):\r\n brr[x]=1\r\n count+=1\r\n elif brr[x]!=0:\r\n break\r\nif count<n:\r\n print(count+1)\r\nelse:\r\n print(-1)\r\n ", "p,n=map(int,input().split())\r\nx=[]\r\nk=[]\r\nfor i in range(n):\r\n z=int(input())%p\r\n if(z in x):\r\n k.append(i)\r\n x.append(z%p)\r\nprint(-1 if len(k)==0 else k[0]+1)\r\n\r\n", "#Python 3.3\n\n#Get input\np, n = map(int, input().split())\n\nused = []\n\ni = 1\nfound = False\nwhile (i <= n):\n num = int(input())\n if (num%p in used):\n print(i)\n found = True\n break\n else:\n used.append(num%p)\n i+=1\n\n\nif (found == False):\n print(\"-1\")\n", "x, y= map(int, input().split())\r\np= list()\r\nfor i in range(y):\r\n a=int(input())%x\r\n if a in p:\r\n print(i+1)\r\n exit()\r\n else:p.append(a)\r\nprint(-1)\r\n", "\r\n\r\n\r\np, n = map(int, input().split())\r\n\r\n\r\nlisty = []\r\nfor i in range(n):\r\n listy.append(int(input()))\r\n\r\ndef solve(listy, p):\r\n dicty = {}\r\n for i in range(n):\r\n \r\n mod = listy[i]% p\r\n if mod in dicty.values():\r\n return i + 1\r\n else:\r\n dicty.update({i:mod})\r\n \r\n return -1\r\n\r\nprint(solve(listy, p))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "p, n = map(int, input().split())\nhashes = [False] * p\nans = -1\nfor i in range(1, n + 1):\n x = int(input())\n x = x % p\n if hashes[x] and ans == -1:\n ans = i\n hashes[x] = True\nprint(ans)\n", "p, n = map(int, input().split())\r\n\r\nd = {}\r\nfor i in range(n):\r\n x = int(input())\r\n cur = x%p\r\n ans = d.get(cur, -1)\r\n if ans != -1:\r\n print(i+1)\r\n exit()\r\n d[cur] = x\r\nprint(-1)\r\n", "p, n = map(int, input().split())\r\nhash_table = [False] * p\r\nfor i in range(n):\r\n x = int(input())\r\n index = x % p\r\n if hash_table[index]:\r\n print(i+1)\r\n break\r\n else:\r\n hash_table[index] = True\r\nelse:\r\n print(-1)\r\n", "p, n = map(int, input().split())\r\n\r\nresult_dict = {}\r\n\r\na = [int(input()) for _ in range(n)]\r\nindex = 0\r\n\r\nwhile index < len(a):\r\n if a[index] % p in result_dict:\r\n print(index + 1)\r\n break\r\n\r\n else:\r\n result_dict[a[index] % p] = a[index]\r\n\r\n index += 1\r\n\r\nif index == len(a):\r\n print(-1)\r\n", "from collections import Counter\r\n \r\nn, k = map(int, input().split())\r\nc = Counter()\r\nans = -1\r\nfor i in range(1, k+1):\r\n x = int(input())\r\n c[x % n] += 1\r\n \r\n if ans == -1 and c[x % n] > 1:\r\n ans = i\r\n \r\nprint(ans)", "p,n = map(int,input().split())\r\nl = []\r\ncount = 0\r\nfor i in range(n):\r\n a = int(input())\r\n b = a%p\r\n if(count==0 and (b not in l)):\r\n l.append(b)\r\n else:\r\n if(count==0):\r\n c = i+1\r\n count+=1\r\nif(count==0):\r\n print(-1)\r\nelse:\r\n print(c)", "p, n= list(map(int, input().split()))\r\nd=dict()\r\nconflict = -1\r\nfor x in range(0, 301):\r\n d[x]='empty'\r\nfor i in range(n):\r\n entry = int(input())\r\n rm = entry % p\r\n if d[rm] == 'empty':\r\n d[rm] = entry\r\n else:\r\n conflict = 1\r\n print(i+1)\r\n break\r\nif conflict == -1:\r\n print(-1)", "'''\nForget the past with the exception of\nwhat you have learned from it.\n'''\nfrom sys import exit\np,n=map(int,input().split())\nessi=[True]*p\nfor i in range(n):\n xi=int(input())\n yy=xi%p\n if essi[yy]==False:\n print(i+1)\n exit()\n else:\n essi[yy]=False\nprint(-1)", "# coding: utf-8\np, n = [int(i) for i in input().split()]\nmark = [0]*p\nfor i in range(n):\n num = int(input())%p\n if mark[num]==1:\n print(i+1)\n break\n mark[num] = 1\nelse:\n print(-1)\n", "p, n = map(int, input().split())\r\na = [0] * 301\r\nans = -1\r\nfor i in range(n):\r\n x = int(input())\r\n h = x % p\r\n if a[h] == 0:\r\n a[h] = 1\r\n else:\r\n ans = i + 1\r\n break\r\nprint(ans)\r\n \r\n", "p, n = map(int, input().split())\r\nh = [False] * p\r\nres = -1\r\nfor i in range(n):\r\n arr = int(input()) % p\r\n if h[arr]:\r\n res = i + 1\r\n break\r\n h[arr] = True\r\nprint(res)\r\n", "p, n = map(int, input().split())\r\na = []\r\nflag = False\r\nfor i in range(n):\r\n x = int(input())\r\n if not flag:\r\n if x % p in a:\r\n flag = True\r\n print(i+1)\r\n if not flag:\r\n a.append(x % p)\r\nif not flag:\r\n print(-1)", "p, n = map(int,input().split())\r\nx = set()\r\nf = -1\r\nfor i in range(n):\r\n inp = int(input()) % p\r\n if inp not in x:\r\n x.add(inp)\r\n else:\r\n if f == -1:\r\n f = i + 1\r\nprint(f) \r\n \r\n ", "def main():\r\n p, n = input().split()\r\n p, n = int(p), int(n)\r\n c = True\r\n bucket = [False] * p\r\n for i in range(1, n + 1):\r\n x = int(input()) % p\r\n if bucket[x] is False:\r\n bucket[x] = True\r\n else:\r\n c = False\r\n break\r\n if c:\r\n print(-1)\r\n else:\r\n print(i)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def solve():\n p, n = map(int, input().split())\n a = []\n for _ in range(n):\n a.append(int(input()))\n myset = set()\n for i in range(n):\n x = a[i]\n if x % p in myset:\n return i + 1\n else:\n myset.add(x % p)\n return -1\n \nprint(solve())", "p,n=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n+1):\r\n x=int(input())%p\r\n if x in l: print(i); break\r\n else: l+=[x]\r\nelse: print(-1)" ]

[ "n,k= map(int,input().split())\r\narr = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif k >= 2:\r\n print(\"Yes\")\r\nelse:\r\n if k == 1:\r\n arr[arr.index(0)] = b[0]\r\n x = [i for i in arr]\r\n x.sort()\r\n if x == arr:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "n,k=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nla=p.count(0)\r\nfor x in range(la):\r\n if l!=list():\r\n sa=max(l)\r\n ka=p.index(0)\r\n p[ka]=sa\r\n l.remove(sa)\r\n else:\r\n break\r\ntam=sorted(p)\r\nif p.count(0)==0 and tam!=p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=[int(q) for q in input().strip().split()]\r\nb=[int(q) for q in input().strip().split()]\r\nc=[int(q) for q in input().strip().split()]\r\nif a[1]>1:\r\n print('Yes')\r\nelse:\r\n for k in range(a[0]):\r\n if b[k]==0:\r\n b[k]=c[0]\r\n break\r\n if len(b)>len(set(b)):\r\n print('Yes')\r\n else:\r\n d=[]\r\n for k in range(a[0]):\r\n d.append(b[k])\r\n d.sort()\r\n if b==d:\r\n print('No')\r\n else:\r\n print('Yes')", "input()\r\nseq1=input().split(\" \")\r\nseq2=input().split(\" \")\r\nsuccess=False\r\n\r\nif len(seq2)==1:\r\n for i in range(len(seq1)):\r\n if seq1[i]==\"0\":\r\n seq1[i]=seq2[0]\r\n for i in range(len(seq1)-1):\r\n if int(seq1[i])>int(seq1[i+1]):\r\n success=True\r\nelse:\r\n success=True\r\n\r\nif success:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb=sorted(b)\r\nb.reverse()\r\nfor i in range(len(b)):\r\n for j in range(len(a)):\r\n if(a[j]==0):\r\n a[j]=b[i]\r\n break\r\nl=0\r\nfor i in range(len(a)-1):\r\n if(a[i]<a[i+1]):\r\n l+=1\r\nif(l!=n-1):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n,k= list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\nb = list(map(int, input().split(\" \")))\r\nif len(b)==1:\r\n a[a.index(0)]=b[0]\r\n if list(sorted(a))!=a:\r\n print(\"YES\")\r\n else:print(\"NO\")\r\nelse:print(\"YES\")", "n,k = input().split()\r\nL = [int(a) for a in input().split(\" \",int(n)-1)]\r\nl1 = [int(a) for a in input().split(\" \",int(k)-1)]\r\na=0\r\nl1.sort(reverse=True)\r\nfor i in range(int(n)):\r\n if L[i]==0:\r\n L[i]=l1[a]\r\n a+=1\r\n if a>len(l1):\r\n break\r\nl2=L[:]\r\nl2.sort()\r\nif l2==L:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "\r\ndef solve(n,k,a,b):\r\n if k==1:\r\n for i in range(n):\r\n if a[i]==0:\r\n a[i] = b[0]\r\n for i in range(n):\r\n j = i+1\r\n while(j<n):\r\n if a[i]>a[j]:\r\n return \"Yes\"\r\n j = j+1\r\n \r\n return \"No\"\r\n else:\r\n return \"Yes\"\r\n\r\nn,k = (int(x) for x in input().strip().split(\" \"))\r\na = [int(x) for x in input().strip().split(\" \")]\r\nb = [int(x) for x in input().strip().split(\" \")]\r\n\r\n\r\nprint(solve(n,k,a,b))\r\n\r\n \r\n", "n, k = map(int, input().split())\r\nflag = 0\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif k != 1:\r\n print(\"Yes\")\r\nelse:\r\n for i in range(0, n):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n if i != 0:\r\n if a[i] < a[i - 1]:\r\n print(\"Yes\")\r\n flag = 1\r\n break\r\n if flag == 0:\r\n print(\"No\")", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sorted(map(int, input().split()), reverse=True)\r\n\r\nj = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n j += 1\r\n\r\nprint(\"No\" if a == sorted(a) else \"Yes\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k > 1:\r\n print(\"Yes\")\r\nelse:\r\n b = int(input())\r\n a[a.index(0)] = b\r\n print([\"Yes\",\"No\"][all(x < y for x, y in zip(a, a[1:]))])", "nk=[int(i) for i in input().split()]\r\nn=nk[0]\r\nk=nk[1]\r\nA=[int(i) for i in input().split()]\r\nB=[int(i) for i in input().split()]\r\nB.sort(reverse=True)\r\nfor i in range(0,len(A)):\r\n\tif(A[i]==0):\r\n\t\tA[i]=B[0]\r\n\t\tdel(B[0])\r\nC=[]\r\nfor i in range(0,len(A)):\r\n\tC.append(A[i])\r\nC.sort()\r\nif(C==A):\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")", "nAk = input().split()\na = input().split()\nb = input().split()\nzeros = int(nAk[1])\n\n#a becomes ints\nfor i in range(int(nAk[0])):\n a[i] = int(a[i])\n\nif(zeros >= 2):\n print(\"Yes\")\n# elif(zeros == 0):\n# works = 0\n# for i in range(1, int(nAk[0]) - 1):\n# if(a[i] < a[i-1] or a[i] > a[i+1]):\n# print(\"Yes\")\n# works = 1\n# break\n# if works == 0:\n# print(\"No\")\nelse:\n #replace the 0 with the num in b\n for i in range(int(nAk[0])):\n if int(a[i]) == 0:\n a[i] = int(b[0])\n # if(i != int(nAk[0])):\n # works = 0\n # for j in range(1, int(nAk[0]) - 1):\n # if(a[j] < a[j-1] or a[j] > a[j+1]):\n # print(\"Yes\")\n # works = 1\n # break\n # if works == 0:\n # print(\"No\")\n # else:\n # works = 0\n # for j in range(int(nAk[0] - 1)):\n # if a[j] > a[i]:\n # print(\"Yes\")\n # works = 1\n # if works == 0:\n \n # print(\"No\")\n \n temp = sorted(a)\n \n if(temp == a):\n print(\"No\")\n else:\n print(\"Yes\")\n ", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn,m=map(int,input().strip().split())\r\nt=input()\r\na=list(map(int,t.strip().split()))\r\nt=input()\r\nb=list(map(int,t.strip().split()))\r\nb.sort(reverse=True)\r\nflag=0\r\nj=0\r\nfor i in range(n):\r\n if a[i]==0:\r\n a[i]=b[j]\r\n j+=1\r\nfor i in range(n-1):\r\n if a[i]>=a[i+1]:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n, k = input().split()\r\nn, k = int(n), int(k)\r\na = input().split()\r\nb = input().split()\r\na = list(map(int, a))\r\nb = list(map(int, b))\r\nb.sort(reverse=True)\r\n\r\nfor i in range(k):\r\n a[a.index(0)] = b.pop(0)\r\n\r\ng = 1\r\nfor i in range(n-1):\r\n if a[i]>a[i+1]:\r\n g = 0\r\n break\r\nif g == 1:\r\n print('No')\r\nelse: print('Yes')\r\n \r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif k > 1:\r\n print('YES')\r\nelif k <= 1:\r\n for i in range(len(arr)):\r\n if arr[i] == 0:\r\n arr[i] = b[0]\r\n ls = sorted(arr)\r\n if ls == arr:\r\n print('NO')\r\n elif ls != arr:\r\n print('YES')\r\n \r\n", "def issorted(list1):\r\n for i in range(0, len(list1)-1):\r\n if list1[i+1]<list1[i]:\r\n return True\r\n return False\r\n\r\nn,m = input().split()\r\nm = int(m)\r\nn = int(n)\r\nj=m-1\r\nlist1 = list(map(int,input().split()))\r\nlist2 = list(map(int,input().split()))\r\n\r\nlist2.sort()\r\n\r\nfor i in range(0,len(list1)):\r\n if list1[i] == 0:\r\n list1[i]=list2[j]\r\n j-=1\r\n\r\nif issorted(list1)==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif k >= 2:\r\n print('Yes')\r\nelse:\r\n a[a.index(0)] = b[0]\r\n if a == sorted(a):\r\n print('No')\r\n else:\r\n print('Yes')\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nb = b[::-1]\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if a [i] == 0:\r\n a[i] = b[count] \r\n count += 1\r\n\r\nx = a + []\r\na.sort()\r\nif x == a:\r\n print('No')\r\nelse:\r\n print('Yes')", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\n\r\nif k>=2:\r\n\tprint(\"YES\")\r\nelse:\r\n\tz=a.index(0)\r\n\ta[z] =b[0]\r\n\tfor i in range(n-1):\r\n\t\tif a[i]>a[i+1]:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"NO\")", "n,m= map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nj=0\r\nif m==1:\r\n for i in range(n):\r\n if a[i]==0:\r\n a[i]=b[0]\r\n if a==sorted(a):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\nelse:\r\n print(\"Yes\")", "n,k = map(int, input().split())\r\n\r\nlist1 = list(map(int, input().strip().split()))[:n]\r\nlist2 = list(map(int, input().strip().split()))[:k]\r\nlist2.sort(reverse=True)\r\n\r\nfor j in range(k):\r\n for i in range(n):\r\n if list1[i] == 0:\r\n list1[i] = list2[j]\r\n break\r\n\r\nif list1 == sorted(list1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n \r\n\r\n", "import sys\n\nm, n = sys.stdin.readline().split()\n\na = list(map(int, sys.stdin.readline().split()))\n\nb = list(map(int, sys.stdin.readline().split()))\n\nif len(b) > 1:\n print(\"Yes\")\nelif len(b) == 1:\n for i in range(len(a)):\n if a[i] == 0:\n a[i] = b[0]\n break\n\n for i in range(1, len(a)):\n if a[i] < a[i - 1]:\n print(\"Yes\")\n break\n else:\n print(\"No\")\nelse:\n for i in range(1, len(a)):\n if a[i] > a[i - 1]:\n print(\"Yes\")\n break\n else:\n print(\"No\")\n\t \t \t \t \t \t\t\t\t \t\t \t \t\t", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nb.sort(reverse=True)\r\nj = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n j += 1\r\ncan = False\r\nfor i in range(1, n):\r\n if a[i] < a[i - 1]:\r\n can = True\r\nif can:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n ,k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\naux = [0]*len(a)\r\nfor i in range(len(a)):\r\n aux[i] = a[i]\r\nb = list(map(int, input().split()))\r\nb = sorted(b , reverse = True)\r\nj = 0\r\nfor i in range(len(a)):\r\n if (a[i] == 0):\r\n a[i] = b[j]\r\n aux[i] = b[j]\r\n j += 1\r\naux.sort()\r\nif (a == aux):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n1,n2 = map(int,input().split())\nn = list(map(int,input().split()))\nk = sorted(list(map(int,input().split())))[::-1]\nt = 0\nfor i in range(n1):\n if n[i] ==0:\n n[i] = k[t]\n t += 1\nif sorted(n) == n:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "\r\n# -*- coding: utf-8 -*-\r\nfrom sys import stdin\r\nimport itertools\r\nfor line in stdin:\r\n entrada = line.splitlines()\r\n break\r\nn = int(entrada[0].split()[0])\r\nk = int(entrada[0].split()[1])\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\n\r\nvectorB=sorted(B, reverse = True)\r\n\r\nj=0\r\nfor i in range(len(A)):\r\n if(A[i]==0):\r\n A[i]=vectorB[j]\r\n j=j+1\r\n\r\nordenado=sorted(A)\r\n\r\nif(A!=ordenado):\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")\r\n\r\n", "n,k=(map(int,input().strip().split(' ')))\r\na=list((map(int,input().strip().split(' '))))\r\nb=list((map(int,input().strip().split(' '))))\r\nif(k!=1):\r\n print(\"YES\")\r\nelse:\r\n for i in range(n):\r\n if(a[i]==0):\r\n break\r\n a[i]=b[0]\r\n u=1\r\n for i in range(n-1):\r\n if(a[i]>=a[i+1]):\r\n u=0\r\n break\r\n if(u==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n ", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndef nonincrease(arr):\r\n new_arr = [elem for elem in arr if elem]\r\n return new_arr!=sorted(new_arr)\r\nif nonincrease(arr):\r\n print('Yes')\r\nelse:\r\n b.sort(reverse=True)\r\n j=0\r\n for i in range(n):\r\n if arr[i]==0:\r\n arr[i] = b[j]\r\n j+=1\r\n print(\"No\") if arr==sorted(arr) else print(\"Yes\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif k==1:\r\n\ta[a.index(0)]=b[0]\r\n\tif sorted(a)==a:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\nelse:\r\n\tprint(\"YES\")", "if __name__ == '__main__':\r\n n, k = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n ans = \"No\"\r\n if 2 <= k:\r\n ans = \"Yes\"\r\n else:\r\n for i in range(0, n):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n\r\n for i in range(0, n - 1):\r\n if a[i + 1] < a[i]:\r\n ans = \"Yes\"\r\n break\r\n\r\n print(ans)\r\n", "def get():\r\n return list(map(int, input().split()))\r\ndef intput():\r\n return int(input())\r\ndef check(a,b,c):\r\n return abs(b-a) + abs(b-c)+abs(c-a)\r\ndef main():\r\n\r\n n=get()\r\n a=get()\r\n b=get()\r\n b.sort(reverse=1)\r\n w=0\r\n for i in range(n[0]):\r\n if (a[i]==0):\r\n a[i]=b[w]\r\n w+=1\r\n ans=False\r\n for i in range(1,n[0]):\r\n if (a[i]<a[i-1]):\r\n ans=True\r\n break\r\n print(\"YES\" if ans else \"NO\")\r\n\r\n\r\n\r\nmain()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "isValid = False\nx1 = list(map(int, input().split()))\nx2 = list(map(int, input().split()))\nx3 = list(map(int, input().split()))\n\nfor i in range(len(x2)):\n if(i<len(x2)-1):\n if(x2[i] > x2[i+1] and x2[i] != 0):\n if(x2[i] != 0 and x2[i+1] != 0):\n isValid = True\n break\n else:\n for j in range(len(x3)):\n if(x2[i] > x3[j]):\n isValid = True\n break\n elif(x2[i] == 0):\n for j in range(len(x3)):\n if(x3[j] > x2[i+1]):\n isValid = True\n break\n\n # isValid = True\n # break\n # elif(x2[i+1] == 0):\n # for j in range(len(x3)):\n # if(x2[i] > x3[j]):\n \n\nif(isValid):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t \t \t \t\t\t \t \t\t\t \t \t\t\t\n \t\t \t \t \t \t\t \t\t\t \t \t\t\t", "la,lb = map(int,input().split())\na = []\nb = []\n\ntemp = input()\na = temp.split()\na = list(map(int,a))\n\ntemp = input()\nb = temp.split()\nb = list(map(int,b))\n\nif(lb > 1):\n print('yes')\nelse:\n index = a.index(0)\n a[index] = b[0]\n if(sorted(a)==a):\n print('no')\n else:\n print('yes')\n \n \n\n\n", "n, k = tuple([int(elem) for elem in input().split()])\na = [int(elem) for elem in input().split()]\nb = [int(elem) for elem in input().split()]\nb.sort()\nb.reverse()\na_wt_zero = []\nfor elem in a:\n if elem != 0:\n a_wt_zero.append(elem)\n\ndef inc(seq):\n idx = 0\n size = len(seq)\n\n while idx < size-1:\n if seq[idx] > seq[idx+1]:\n return False\n idx += 1\n return True\n\ndef not_inc():\n if not inc(b):\n return True\n else:\n pos = 0\n for idx, elem in enumerate(a):\n if elem == 0:\n a[idx] = b[pos]\n pos += 1\n\n if not inc(a):\n return True\n else:\n return False\n\nif not_inc():\n print('Yes')\nelse:\n print('No')\n", "def vozr (a):\r\n ans = True\r\n for i in range (1, len(a)):\r\n if a[i-1] >= a[i]:\r\n ans = False\r\n break\r\n return ans\r\nn, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nif m > 1:\r\n print ('YES')\r\nelse:\r\n a[a.index(0)] = b[0]\r\n if vozr (a):\r\n print ('NO')\r\n else:\r\n print ('YES')", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nb.sort(reverse=True)\r\n\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n b.remove(b[0])\r\n\r\nans = True\r\n\r\nfor i in range(1, len(a)):\r\n if a[i-1] >= a[i]:\r\n ans = False\r\n break\r\n\r\nif ans == False:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n, k = map(int, input().split())\n\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nB.sort()\n\nflag = True\nif A[0] == 0:\n\tA[0] = B[-1]\n\tprev = A[0]\n\tB.remove(B[-1])\nelse:\n\tprev = A[0]\nfor i in range(1, len(A)):\n\t# print(prev, A[i])\n\tif A[i] == 0:\n\t\tA[i] = B[-1]\n\t\tB.remove(B[-1])\n\tif prev >= A[i]:\n\t\tflag = False\n\t\tbreak\n\tprev = A[i]\n\nif flag == False:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n", "n, k = map(int,input().split())\r\nN = list(map(int,input().split()))\r\nN.append(5000)\r\nK = list(map(int,input().split()))\r\nK.sort(reverse=True)\r\nkek = 0\r\nfor i in range(n):\r\n if N[i] == 0:\r\n N[i] = K[kek]\r\n kek += 1\r\n if N[i+1] == 0:\r\n N[i + 1] = K[kek]\r\n kek += 1\r\n if N[i] > N[i + 1]:\r\n print('Yes')\r\n quit()\r\n\r\nprint('No')", "a, b = map(int, input().split())\r\ns1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\n\r\ndef isup(posl):\r\n for i in range(1, len(posl)):\r\n if posl[i] >= posl[i - 1]:\r\n pass\r\n else:\r\n return False\r\n return True\r\n\r\ndef makeposls(posl1, posl2):\r\n posls = []\r\n for k in range(len(posl1)):\r\n if posl1[k] == 0:\r\n for i in posl2:\r\n temp = posl1[:]\r\n temp[k] = i\r\n posls.append(temp)\r\n return posls\r\n\r\nppps = makeposls(s1, s2)\r\n\r\nf = 0\r\nfor x in ppps:\r\n if isup(x):\r\n pass\r\n else:\r\n f = 1\r\n\r\nprint('Yes') if f == 1 else print('No')", "m,n=map(int,input().split())\r\nk,l=list(map(int,input().split())),list(map(int,input().split()))\r\nif n==1:\r\n\tk[k.index(0)]=l[0]\r\n\tj=sorted(k)\r\n\tprint([\"YES\",\"NO\"][j==k])\r\nelse:print(\"YES\")", "(N, K) = [int(i) for i in input().split()]\r\n\r\nnr = 0\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nfor i in range(1, N):\r\n if a[i] > a[i - 1] and a[i] * a[i - 1]:\r\n nr += 1\r\n elif a[i] * a[i - 1] == 0:\r\n ok = False\r\n for j in range(0, K):\r\n if (a[i - 1] > b[j] and a[i] == 0) or (a[i] < b[j] and a[i - 1] == 0) and b[j] >= 0:\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n else:\r\n a[i - 1] = b[j]\r\n ok = True\r\n if not ok:\r\n nr += 1\r\nif nr == N - 1:\r\n print(\"No\")\r\n exit(0)\r\nprint(\"Yes\")\r\nexit(0)\r\n", "n,k = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nif(k!=1):\r\n\tprint('Yes')\r\n\texit(0)\r\nfor i in range(n):\r\n\tif(l1[i]==0):\r\n\t\tl1[i]=l2[0]\r\n\t\tbreak\r\nok = True\r\nfor i in range(n-1):\r\n\tif(l1[i+1]<l1[i]):\r\n\t\tok = False\r\n\t\tbreak\r\nif(ok==True):\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nif l.count(0)>=2 :\r\n print('Yes')\r\n exit()\r\nl[l.index(0)]=l1[0]\r\nif l==sorted(l) :\r\n print('No')\r\nelse :\r\n print('Yes')\r\n", "def solve(a, b, n, k):\n b = sorted(b, reverse=True)\n b_index = 0\n for i, v in enumerate(a):\n if not v:\n a[i] = b[b_index]\n b_index += 1\n\n sorted_a = sorted(a)\n if a == sorted_a:\n return \"No\"\n return \"Yes\"\n\n\ndef main():\n vars = list(map(int, input().split(\" \")))\n a = list(map(int, input().split(\" \")))\n b = list(map(int, input().split(\" \")))\n # for i in range(n):\n # arr.append(list(map(int, list(input()))))\n print(solve(a, b, *vars))\n\n\nmain()\n", "n, k = input().split()\r\na = list(map(int, input().split()))\r\nb = list(reversed(sorted(list(map(int, input().split())))))\r\nc = []\r\ni = 0\r\nfor number in a:\r\n if number == 0:\r\n if b[i] not in c:\r\n c.append(b[i])\r\n else:\r\n print('No')\r\n break\r\n i += 1\r\n else:\r\n if number not in c:\r\n c.append(number)\r\n else:\r\n print('No')\r\n break\r\nif sorted(c) == c:\r\n print('No')\r\nelse:\r\n print('Yes')", "from sys import stdin, stdout\r\n\r\nn, k = map(int, stdin.readline().split())\r\nfirst = list(map(int, stdin.readline().split()))\r\nsecond = sorted(list(map(int, stdin.readline().split())))\r\n\r\nfor i in range(n):\r\n if not first[i]:\r\n first[i] = second.pop()\r\n\r\n\r\nif first == sorted(first):\r\n stdout.write('No')\r\nelse:\r\n stdout.write('Yes')", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx = a.count(0)\r\nb.sort()\r\nind = k\r\nif(x==k):\r\n\tfor i in range(n):\r\n\t\tif(a[i]==0):\r\n\t\t\ta[i] = b[ind -1]\r\n\t\t\tind -=1\r\n\t\r\n\tflag=True\r\n\tfor i in range(1,len(a)):\r\n\t if a[i]<a[i-1]:\r\n\t flag=False\r\n\t print(\"YES\")\r\n\t break\r\n\tif flag:\r\n\t print(\"NO\")\r\nelse:\r\n\tprint(\"No\")", "from tabnanny import check\r\n\r\n\r\nn,k = map(int,input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\nb = list(map(int, input().split(\" \")))\r\nb.sort(reverse=True)\r\ni = 0\r\nfor num in b:\r\n while(a[i]!=0):\r\n i+=1\r\n a[i] = num\r\ncheck = True\r\nfor i in range(n-1):\r\n if(a[i]>a[i+1]):\r\n print(\"Yes\")\r\n check = False\r\n break\r\nif(check):\r\n print(\"No\")", "from sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9 + 7)\r\nimport re #can use multiple splits\r\ntup = lambda : map(int,stdin.readline().split())\r\nI = lambda :int(stdin.readline())\r\nlint=lambda : [int(x) for x in stdin.readline().split()]\r\nS = lambda :stdin.readline().replace('\\n','').strip()\r\ndef grid(r, c): return [lint() for i in range(r)]\r\ndef debug(*args, c=6): print('\\033[3{}m'.format(c), *args, '\\033[0m', file=stderr)\r\nfrom math import log2,sqrt\r\nfrom itertools import permutations\r\na ,b = tup()\r\nls = lint()\r\nm = lint() ; c =0\r\nm.sort(reverse=True)\r\nfor i in range(a):\r\n if ls[i]==0:\r\n ls[i] = m[c]\r\n c+=1\r\n#print(ls)\r\nf = 0\r\nfor i in range(a-1):\r\n if ls[i] < ls[i+1]:\r\n pass\r\n else:\r\n f= 1\r\nif f==1:\r\n print(\"Yes\")\r\nelse:print(\"No\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = input().split()\r\na = list(map(int, input().split()))\r\nb = sorted(list(map(int, input().split())), reverse = True)\r\n\r\nfor i in range(int(n)):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n del b[0]\r\n#print(a)\r\n#print(sorted(a))\r\nif a != sorted(a):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n \r\n ", "n,k=input().split()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\naa = list(filter(lambda x: x != 0, a))\r\nif aa != sorted(aa):\r\n print('Yes')\r\nelse:\r\n b.sort(reverse=True)\r\n counter = 0\r\n for i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[counter]\r\n counter=counter+1\r\n if a != sorted(a):\r\n print('Yes')\r\n else:\r\n print('No')", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nif(k>1):\r\n print('Yes')\r\nelse:\r\n l=[]\r\n for i in range(0,len(a)):\r\n if(a[i]!=0):\r\n l.append(a[i])\r\n else:\r\n l.append(b[0])\r\n c=sorted(l)\r\n if(c!=l):\r\n print('Yes')\r\n else:\r\n print('No')", "# Description of the problem can be found at http://codeforces.com/problemset/problem/814/A\r\n\r\nn, k = map(int, input().split())\r\n\r\nl_n = list(map(int, input().split()))\r\nl_r = list(map(int, input().split()))\r\nl_r.sort(reverse = True)\r\n\r\nc_r = 0\r\nfor i in range(len(l_n)):\r\n if l_n[i] == 0:\r\n l_n[i] = l_r[c_r]\r\n c_r += 1\r\n\r\nl_c = l_n.copy()\r\nl_c.sort()\r\n\r\nprint(\"Yes\" if l_n != l_c else \"No\")", "n, k = map(int, input().split())\r\n\r\na = [-10 ** 9] + list(map(int, input().split())) + [10 ** 9]\r\nif k > 1:\r\n print('Yes')\r\nelse:\r\n i = a.index(0)\r\n b = int(input())\r\n \r\n f = True\r\n for j in range(1, n):\r\n if a[j] <= a[j - 1] and a[j] != 0:\r\n f = False\r\n \r\n if f and a[i - 1] < b and a[i + 1] > b:\r\n print('No')\r\n else:\r\n print('Yes')", "n, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nb = sorted((int(i) for i in input().split()), reverse=True)\nres, j = \"NO\", 0\nfor i, e in enumerate(a):\n if a[i] == 0:\n a[i] = b[j]\n j += 1\n if i > 0 and a[i] <= a[i - 1]:\n res = \"YES\"\n break\nprint(res)\n", "from collections import Counter\r\ndef solve():\r\n n,m=map(int,input().split());a=list((map(int,input().split())));b=list((map(int,input().split())));b=list(set(b));b.sort(reverse=True)\r\n for i in range(n):\r\n if a[i]==0:a[i]=b[0];b.pop(0)\r\n if a!=sorted(a):print(\"YES\")\r\n else:print(\"NO\")\r\nsolve()", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nif k!=b.count(b[0]):\r\n print(\"Yes\")\r\nelse:\r\n t=b[0]\r\n for i in range(n):\r\n if a[i]==0:\r\n a[i]+=t\r\n if all(a[i]<=a[i+1] for i in range(n-1)):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")", "def f(a):\r\n\tfor i in range(1,len(a)):\r\n\t\tif a[i]<a[i-1]:\r\n\t\t\treturn True\r\n\treturn False\r\ndef g(a,n):\r\n\tfor i in range(1,n):\r\n\t\tif a[i]==0 and a[i-1]==0:\r\n\t\t\treturn True\r\n\treturn False\r\nn,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nif f(list(filter(lambda x:x!=0,a))):\r\n\tprint(\"Yes\")\r\nelif g(a,n):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif i==0 and a[i]==0:\r\n\t\t\tfor j in b:\r\n\t\t\t\tif j>a[1]:\r\n\t\t\t\t\tprint('Yes')\r\n\t\t\t\t\texit(0)\t\r\n\t\telif i==n-1 and a[i]==0:\r\n\t\t\tfor j in b:\r\n\t\t\t\tif j<a[n-2]:\r\n\t\t\t\t\tprint('Yes')\r\n\t\t\t\t\texit(0)\t\r\n\t\telif a[i]==0:\r\n\t\t\tfor j in b:\r\n\t\t\t\tif j>a[i+1] or j<a[i-1]:\r\n\t\t\t\t\tprint('Yes')\r\n\t\t\t\t\texit(0)\t\r\n\tprint('No')\t\t", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nb.sort()\ncnt = len(b) - 1\nfor ind in range(len(a)):\n\tif a[ind] == 0:\n\t\tif cnt == -1:\n\t\t\tprint(\"No\")\n\t\t\texit(0)\n\t\ta[ind] = b[cnt]\n\t\tcnt -= 1\ntest = False\nfor ind in range(len(a) - 1):\n\tif a[ind] > a[ind + 1]:\n\t\ttest = True\nprint(\"Yes\" if test else \"No\")", "# x = input().split()\r\n\r\nn , k = map(int , input().split())\r\n\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\n\r\nhitcresce = 1\r\n\r\nif k > 1:\r\n\tprint('Yes')\r\n\texit()\r\n\r\nx.append(999)\r\nx.insert(0,-1)\r\n\r\naux = 0\r\nfor i in range(2,n+1):\r\n\tif x[i-1]!= 0:\r\n\t\taux = x[i-1]\r\n\tif x[i] != 0 and x[i] < aux :\r\n\t\thitcresce = 0\r\n\t\tbreak\r\n\r\nif (hitcresce == 0):\r\n\tprint('Yes')\t\r\n\texit()\r\n\r\nfor i in range(1,n+1):\r\n\tif x[i] == 0:\r\n\t\tif (x[i-1] < y[0] and y[0] < x[i+1]):\r\n\t\t\tprint('No')\r\n\t\telse:\r\n\t\t\tprint('Yes')\r\n\t\tbreak\r\n\r\n\t\r\n\r\n\r\n", "sz, sz2 = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\nstack = sorted(arr2)\r\nfor i in range(sz):\r\n if arr[i] == 0:\r\n arr[i] = stack.pop()\r\nflag = False\r\nfor i in range(sz - 1):\r\n if arr[i] >= arr[i + 1]:\r\n flag = True\r\n break\r\nprint(\"Yes\" if flag else \"No\")", "n,m=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli1=list(map(int,input().split()))\r\nif li.count(0)==1 :\r\n li[li.index(0)]=li1[0]\r\n if sorted(li)==li:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"YES\")", "sentimentSze, k = map(int, input().split())\r\nsentiment = list(map(int, input().split()))\r\nreplacement = sorted(list(map(int, input().split())))\r\nindx = k - 1\r\nfor i in range(sentimentSze):\r\n temp = sentiment[i]\r\n if(temp == 0):\r\n sentiment[i] = replacement[indx]\r\n indx -= 1\r\nok = False\r\nfor t in range(sentimentSze - 1):\r\n temp2 = sentiment[t + 1]\r\n temp1 = sentiment[t]\r\n if(temp2 < temp1):\r\n ok = True\r\n break\r\nprint(\"Yes\" if ok else \"No\")\r\n\r\n ", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nb = sorted(b, reverse = True)\n\nfor i in range(n):\n if a[i] == 0:\n a[i] = b[0]\n b.remove(b[0])\n\nsorted_a = sorted(a)\n\nif a == sorted_a:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n, m = input().split();\n\n#raise SystemExit\n\nx = input ().split();\ny = input ().split();\n\nif int (m) > 1:\n\tprint(\"YES\");\n\traise SystemExit;\n\nl = 0;\nfor i in range (int (n)):\n\tif x[i] == '0':\n\t\tx[i] = y[0];\n\t\tbreak ;\n\n#print (x); print();\n#print (y); print ();\n\nfor i in range (1, int (n)):\n\tif int(x[i]) <= int(x[i - 1]):\n\t\tprint (\"YES\");\n\t\traise SystemExit;\n\nprint (\"NO\");\n", "import math\r\n\r\n\r\ndef mergeSort(lst):\r\n if len(lst) <= 1:\r\n return lst\r\n mid = math.floor(len(lst) / 2)\r\n left = mergeSort(lst[0:mid])\r\n right = mergeSort(lst[mid:])\r\n return merge(left, right)\r\n\r\n\r\ndef merge(arr1, arr2):\r\n i = 0\r\n j = 0\r\n lst = []\r\n while i < len(arr1) and j < len(arr2):\r\n if arr1[i] > arr2[j]:\r\n lst.append(arr1[i])\r\n i += 1\r\n else:\r\n lst.append(arr2[j])\r\n j += 1\r\n\r\n while i < len(arr1):\r\n lst.append(arr1[i])\r\n i += 1\r\n while j < len(arr2):\r\n lst.append(arr2[j])\r\n j += 1\r\n\r\n return lst\r\na,b=input().split()\r\nmainlst=list(map(int,input().split()))\r\nsidelst=list(map(int,input().split()))\r\ni=0\r\nj=0\r\nincreasing=True\r\nsidelst=mergeSort(sidelst)\r\nwhile i < len(mainlst):\r\n if mainlst[i]==0:\r\n mainlst[i]=sidelst[j]\r\n j+=1\r\n i+=1\r\ni=0\r\nwhile i < len(mainlst)-1:\r\n if mainlst[i]>mainlst[i+1]:\r\n increasing=False\r\n break\r\n i+=1\r\nif increasing:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def answer(ar, br):\r\n br = sorted(br)\r\n\r\n for i, a in enumerate(ar):\r\n if i > 0:\r\n if a == 0:\r\n if br[0] < ar[i - 1]:\r\n return \"YES\"\r\n elif a < ar[i - 1]:\r\n return \"YES\"\r\n if i < len(ar) - 1 and a == 0:\r\n if br[-1] > ar[i + 1]:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n input()\r\n ar = list(map(int, input().split()))\r\n br = list(map(int, input().split()))\r\n print(answer(ar, br));\r\n", "I = lambda : list(map(int, input().split()))\nI()\nx = I()\ny = I()\n\ny.sort(reverse=True)\nfor i in range(len(y)):\n x[x.index(0)] = y[i]\n\nif x == sorted(x):\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=a[:]\nflag=0\nl=len(a)\nwhile True:\n\tj=0\n\tfor i in range(0,l):\n\t\tif c[i]==0:\n\t\t\tc[i]=b[j]\n\t\t\tj=j+1\t\t\n\tfor i in range(1,l):\n\t\tif c[i]<=c[i-1]:\n\t\t\tflag=1\n\t\t\tbreak\n\tif flag==1:\n\t\tprint(\"Yes\")\n\t\tbreak\n\td=b[:]\n\tc=a[:]\n\td.sort()\n\td.reverse()\n\tj=0\n\tfor i in range(0,l):\n\t\tif c[i]==0:\n\t\t\tc[i]=d[j]\n\t\t\tj=j+1\t\t\n\tfor i in range(1,l):\n\t\tif c[i]<=c[i-1]:\n\t\t\tflag=1\n\t\t\tbreak\n\tif flag==1:\n\t\tprint(\"Yes\")\n\t\tbreak\n\td=b[:]\n\tc=a[:]\n\td.sort()\n\tj=0\n\tfor i in range(0,l):\n\t\tif c[i]==0:\n\t\t\tc[i]=d[j]\n\t\t\tj=j+1\t\t\n\tfor i in range(1,l):\n\t\tif c[i]<=c[i-1]:\n\t\t\tflag=1\n\t\t\tbreak\n\tif flag==1:\n\t\tprint(\"Yes\")\n\t\tbreak\t\n\tbreak\t\nif flag==0:\n\tprint(\"No\")\t\t\n\t\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n# = input()\n# = int(input())\n\n(n, k) = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nb = sorted([int(i) for i in input().split()], reverse=-1)\n\n#() = (int(i) for i in input().split())\n# = [int(i) for i in input().split()]\n\nstart = time.time()\n\nj=0\nfor i in range(n):\n if a[i]==0:\n a[i]=b[j]\n j+=1\n\nans = 'No'\nfor i in range(n-1):\n if a[i]>a[i+1]:\n ans='Yes'\n break\n\n#print(a, b)\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "l1 = [int(x) for x in input().split()]\r\nl2 = [int(x) for x in input().split()]\r\nl3 = [int(x) for x in input().split()]\r\nl3.sort(reverse=True)\r\ni=0\r\nwhile i<len(l2):\r\n if l2[i]==0:\r\n l2[i]=l3[0]\r\n l3.remove(l3[0])\r\n i+=1\r\ni=0\r\nok = 0\r\nwhile i<len(l2)-1:\r\n if l2[i]>l2[i+1]:\r\n ok = 1\r\n break\r\n i+=1\r\nif ok:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "R=lambda:list(map(int,input().split()))\r\nk,l=R(); n=R(); m=sorted(R())\r\nn[n.index(0)]=m[0]\r\nprint(['YES','NO'][l==1 and n==sorted(n)])", "n,k= list(map(int, input().split()))\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nb.sort()\nb.reverse()\ni =0\nfor j in range(len(a)):\n if a[j] ==0:\n a[j] = b[i]\n i += 1\nk = \"No\"\nfor j in range(len(a)):\n if j>0 and a[j]<a[j-1]:\n k =\"Yes\"\n break\nprint(k)\n", "n,k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nb.sort(reverse=True)\r\nj = 0\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n j += 1\r\n\r\nres = all(a[i] < a[i+1] for i in range(len(a) - 1))\r\nif res:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "# LUOGU_RID: 101671808\n(n, k), a, b = [[*map(int, s.split())] for s in open(0)]\r\nb.sort()\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b.pop()\r\nprint(any(a[i] >= a[i + 1] for i in range(n - 1)) and 'Yes' or 'No')", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif k >= 2:\r\n print(\"Yes\")\r\nelse:\r\n a = [b[-1] if i == 0 else i for i in a]\r\n print(\"Yes\" if any(a[i] <= a[i-1] for i in range(1, n)) else \"No\")\r\n", "n, k = map(int, input().split())\r\na = list( map(int, input().split()))\r\nb = list( map(int, input().split()))\r\n\r\nif a.count(0) == 1:\r\n i = a.index(0)\r\n if a[i+1:] == sorted(a[i+1:]) and a[:i] == sorted(a[:i]):\r\n if i == 0:\r\n r = a[i+1]\r\n if max(b) > r:\r\n print('Yes')\r\n else:\r\n print('No')\r\n elif i == n-1:\r\n r = a[i-1]\r\n if min(b) < r:\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n r = a[i+1]\r\n s = a[i-1]\r\n for t in b:\r\n u = 0\r\n if [s, t, r] != sorted([s, t, r]):\r\n print('Yes')\r\n u = 1\r\n break\r\n if u == 0:\r\n print('No')\r\n else:\r\n print('Yes')\r\n \r\nelse:\r\n print('Yes')", "n , k = map(int , input().split())\na = list(map(int , input().split()))\nb = list(map(int , input().split()))\n\nif k > 1:\n print(\"Yes\")\nelse:\n for i in range(n):\n if a[i] == 0:\n a[i] = b[0]\n lst = a.copy()\n lst.sort()\n if lst == a:\n print(\"No\")\n else:\n print(\"Yes\")\n\n \t \t \t\t \t\t \t \t \t \t\t \t \t \t", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif k == 1:\r\n for i in range(n):\r\n if a[i] == 0:\r\n a[i]=b[0]\r\n break\r\n c=sorted(a)\r\n if a==c:\r\n print('No')\r\n else:\r\n print('Yes')\r\nelse:\r\n print('Yes')\r\n\r\n", "def main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n if len(b) > 1:\r\n return 'YES'\r\n else:\r\n a[a.index(0)] = b[0]\r\n \r\n for i in range(n-1):\r\n if a[i+1] < a[i]:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nprint(main())", "nk=[int(i) for i in input().split()]\nn=nk[0]\nk=nk[1]\nA=[int(i) for i in input().split()]\nB=[int(i) for i in input().split()]\nB.sort(reverse=True)\nfor i in range(0,len(A)):\n\tif(A[i]==0):\n\t\tA[i]=B[0]\n\t\tdel(B[0])\nC=[]\nfor i in range(0,len(A)):\n\tC.append(A[i])\nC.sort()\nif(C==A):\n\tprint(\"No\")\nelse:\n\tprint(\"Yes\")", "a,b=tuple(input().split())\r\na=int(a)\r\nb=int(b)\r\nc=[int(x) for x in input().split()]\r\nd=[int(x) for x in input().split()]\r\nif b>1:\r\n print(\"Yes\")\r\n exit(0)\r\nelse:\r\n c[c.index(0)]=d[0]\r\n e=[]\r\n e.extend(c)\r\n e.sort()\r\n if e==c:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")", "stupid = []\r\nstupid = input()\r\ntest1 = []\r\ntest1 = input()\r\ndone1 = test1.split()\r\ntest2 = input()\r\ndone2 = test2.split()\r\nj = 0\r\nfor i in range(done2.__len__()-1):\r\n if(int(done2[i]) != int(done2[i+1])):\r\n print(\"Yes\")\r\n exit()\r\nfor i in range(0, done1.__len__()-1):\r\n if int(done1[i]) == 0:\r\n done1[i] = done2[j]\r\n j += 1\r\n # print(done1, \" 1\")\r\n # print(int(done1[i+1]) == 0)\r\n if int(done1[i+1]) == 0:\r\n # print(done1, \" 2\")\r\n done1[i+1] = done2[j]\r\n if int(done1[i]) > int(done1[i+1]):\r\n # print(done1, \" 3\")\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = sorted([int(x) for x in input().split()], reverse = True)\r\nfor x in b:\r\n\ta[a.index(0)] = x\r\nprint(\"No\" if a == sorted(a) else \"Yes\")", "def past(lst1, lst2):\r\n result, current = list(), 0\r\n lst2.sort(reverse=True)\r\n for elem in lst1:\r\n if elem != 0:\r\n result.append(elem)\r\n else:\r\n result.append(lst2[current])\r\n current += 1\r\n if result != sorted(result):\r\n return \"Yes\"\r\n return \"No\"\r\n\r\n\r\nn, k = [int(i) for i in input().split()]\r\na = [int(j) for j in input().split()]\r\nb = [int(x) for x in input().split()]\r\nprint(past(a, b))\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nzeros = []\r\nfor i in range(n):\r\n if a[i] == 0:\r\n zeros.append(i)\r\n\r\nif len(zeros) == 1:\r\n a[zeros[0]] = b[0]\r\n if sorted(a) == a:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\nelse:\r\n print(\"Yes\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nb=b[::-1]\r\nch=0\r\nfor i in range(n):\r\n if a[i]==0:\r\n a[i]=b[ch]\r\n ch+=1\r\nf=0\r\nfor i in range(n-1):\r\n if a[i]<a[i+1]:\r\n f+=1\r\nif f+1==n:\r\n print('No')\r\nelse:\r\n print('Yes')", "n,k = map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\n\r\nif len(B) > 1:\r\n print(\"YES\")\r\nelse:\r\n A[A.index(0)] = B[0]\r\n v = True\r\n for i,q in enumerate (A):\r\n if i > 0:\r\n if A[i] <= A[i-1]:\r\n v = False\r\n break\r\n if v:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\n'''\r\nn=iinput()\r\nprint(n**2+(n-1)**2)\r\n'''\r\nn,k=minput()\r\na=listinput()\r\nb=listinput()\r\nb.sort()\r\nb.reverse()\r\nj=0\r\nfor i in range(n):\r\n if a[i]==0 and b[j] not in a:\r\n a[i]=b[j]\r\n j+=1\r\nif 0 in a:\r\n print(\"NO\")\r\nelse:\r\n answer=\"NO\"\r\n for i in range(n-1):\r\n if a[i]>=a[i+1]:\r\n answer=\"YES\"\r\n break\r\n print(answer)\r\n", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nif(k>1):\r\n print(\"Yes\")\r\nelse:\r\n a[a.index(0)]=b[0]\r\n if(sorted(a)==a):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif k>=2:\r\n print(\"Yes\")\r\nelse:\r\n a[a.index(0)]=b[0]\r\n if a==sorted(a):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n\t ", "m,n=input().split()\nm,n=[int(m),int(n)]\na=[int(i) for i in input().split()]\nb=[int(i) for i in input().split()]\nb.sort(reverse=True)\nj=0\nfor i in range(0,m):\n if a[i]==0:\n a[i]=b[j]\n j+=1\n if j==n:\n break\nif sorted(a)==a:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n,k = map(int, input().split())\r\nnn = list(map(int, input().split()))\r\nkk = list(map(int, input().split()))\r\nl = []\r\nt = True\r\nfor i in range(0,n):\r\n if nn[i] == 0:\r\n l.append(i)\r\nif k == 1:\r\n nn[l[0]] = kk[0]\r\n m = nn[:]\r\n print('NO' if sorted(nn) == m else 'YES')\r\nelse:\r\n for i in range(1,k):\r\n if kk[0] != kk[i]:\r\n print('YES')\r\n t = False\r\n break\r\n if t == True:\r\n print('NO')\r\n", "n , k =map(int , input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb = set(b)\r\nb = list(b)\r\nif len(b)==1:\r\n temp = [i if i!=0 else b[0] for i in a]\r\n x = temp.copy()\r\n x.sort()\r\n if x==temp:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"YES\")", "a, b = map(int, input().split())\r\ns1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\ns2.sort()\r\nfor i in range(a):\r\n if s1[i] == 0:\r\n s1[i] = s2.pop()\r\nif s1 == sorted(s1):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif a.count(0)>1:\r\n\tprint(\"Yes\")\r\nelse:\r\n\ta[a.index(0)]=b[0]\r\n\tx=a.copy()\r\n\tx.sort()\r\n\tif a==x:\r\n\t\tprint(\"No\")\r\n\telse:\r\n\t\tprint(\"Yes\")", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\nl=[]\r\nc=0\r\nfor i in a:\r\n if i==0:\r\n l +=[b[c]]\r\n c +=1\r\n else:\r\n l +=[i]\r\nt=[]\r\nfor i in l:\r\n t +=[i]\r\nt.sort()\r\nif l==t:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb.sort()\r\ny = a.count(0)\r\nj = count = 0\r\nif(a[0]==0):\r\n a[0] = b[-1]\r\n b.remove(b[-1])\r\n count+=1\r\nfor i in range(1,len(a)):\r\n if(a[i]==0):\r\n if(a[i-1]>b[j]):\r\n a[i]=b[j]\r\n count+=1\r\n j+=1\r\n else:\r\n a[i] = b[-1]\r\n b.remove(b[-1])\r\n count+=1\r\nif(count==y and a!=sorted(a)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort(reverse = True)\r\nj = -1\r\nf = 0\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n j += 1\r\n a[i] = b[j]\r\n if i > 0:\r\n if a[i - 1] >= a[i]:\r\n f += 1\r\nif f > 0:\r\n print('Yes')\r\nelse:\r\n print('No')", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif k > 1:\r\n print('Yes')\r\nelse:\r\n idx = a.index(0)\r\n a[idx] = b[0]\r\n if sorted(a) == a:\r\n print('No')\r\n else:\r\n print('Yes')", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\nif k > 1:\r\n print(\"Yes\")\r\nelif k == 1:\r\n for q, i in enumerate(a):\r\n if i == 0:\r\n a[q] = b[0]\r\n flg = 1\r\n for i in range(1, n):\r\n if a[i - 1] > a[i]:\r\n flg = 0\r\n if flg == 1:\r\n print('No')\r\n else:\r\n print('Yes')\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nfor i in range(n):\r\n if not a[i]:\r\n a[i] = b.pop()\r\nans = \"No\"\r\nfor i in range(n - 1):\r\n if a[i] > a[i + 1]:\r\n ans = \"Yes\"\r\n break\r\nprint(ans)", "def solve(n: int, k: int, a: list, b: list) -> str:\r\n b.sort()\r\n for i in range(n):\r\n if not a[i]:\r\n a[i] = b.pop()\r\n ans = \"No\"\r\n for i in range(n - 1):\r\n if a[i] > a[i + 1]:\r\n ans = \"Yes\"\r\n break\r\n return(ans)\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nprint(solve(n, k, a, b))\r\n", "def main():\n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n\n if len(B) > 1:\n ans = 'Yes'\n else:\n a = A[:]\n i = a.index(0)\n a[i] = B[0]\n\n i = 0\n while i < N - 1:\n if a[i] < a[i+1]:\n pass\n else:\n ans = 'Yes'\n break\n i += 1\n else:\n ans = 'No'\n\n print(ans)\n\nmain()\n", "import math\r\n\r\nn,k = map(int, input().split())\r\n\r\nbroken = list(map(int, input().split()))\r\nelements = list(map(int, input().split()))\r\n\r\nelements.sort(reverse=True)\r\n\r\nif k == 1:\r\n for i in range(1,len(broken)):\r\n if broken[i] == 0:\r\n broken[i] = elements[0]\r\n\r\n if broken[i-1] == 0:\r\n broken[i-1] = elements[0]\r\n\r\n if broken[i] < broken[i-1]:\r\n print('yes'); exit()\r\n\r\n \r\n if i == len(broken)-1:\r\n print('no')\r\n\r\nelif k > 1:\r\n for i in range(len(elements)-1):\r\n if elements[i] > elements[i+1]:\r\n print('yes'); exit()\r\n\r\n print('no')", "#! /bin/python3\n\nn, k = [int(x) for x in input().strip().split(' ')]\na = [int(x) for x in input().strip().split(' ')]\nb = [int(x) for x in input().strip().split(' ')]\nb.sort(reverse=True)\n\ni = 0\nl = a[0]\nif l == 0:\n l = b[0]\n i = 1\nincrease = True\nfor x in a[1:]:\n if x == 0:\n x = b[i]\n i += 1\n if x < l:\n increase = False\n break\n l = x\nif increase:\n print('No')\nelse:\n print('Yes')\n", "import sys\n\nn,k = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\n\nfor i in range(len(a)):\n if a[i] == 0:\n a[i] = b[0]\nif k == 1:\n for i in range(1,len(a)):\n if a[i] < a[i-1]:\n print('Yes')\n sys.exit()\n print('No')\nelse:\n print('Yes')\n", "n,k = input().split()\r\na = input().split()\r\nb = input().split()\r\n#print(n,k)\r\n#print(a)\r\n\r\nb.sort()\r\n#print(b)\r\n\r\nfor i in range(len(a)):\r\n if a[i] == '0':\r\n a[i] = b.pop()\r\n#print(a)\r\nxxx = all(int(a[i]) < int(a[i+1]) for i in range(len(a)-1))\r\nif xxx:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n,k = list(map(int, input().split()))\r\nar = list(map(int, input().split()))\r\nap = list(map(int, input().split()))\r\npr = list(ar)\r\nfor i in range(0, n):\r\n if ar[i] == 0:\r\n ind = i\r\n \r\npr[ind] = ap[0]\r\nar[ind] = ap[0]\r\npr.sort()\r\n\r\nif k>1 :\r\n print('Yes')\r\nelif pr!=ar :\r\n print('Yes')\r\nelse :\r\n print('No')\r\n", "n, k = input().split()\nn, k = int(n), int(k)\na = input().split()\nb = input().split()\na = [int(i) for i in a]\nb = [int(i) for i in b]\n\nb.sort()\n\nfor i in range(n):\n if a[i] == 0:\n a[i] = b[k - 1]\n k -= 1\n\nresult = not all(a[i] <= a[i+1] for i in range(n - 1))\n\nif result:\n print(\"Yes\")\nelse:\n print(\"No\")", "n,k=map(int,input().split(\" \"))\nn=int(n)\nk=int(k)\na=list(map(int,input().split(\" \")))\nb=list(map(int,input().split(\" \")))\nflag=False\nb.sort(reverse=True)\nloc=0\nfor i in range(0,n):\n if(a[i]==0):\n a[i]=b[loc]\n loc+=1\n else:\n continue\nfor i in range(0,n):\n if(i==0):\n continue\n else:\n if(a[i]<=a[i-1]):\n flag=True\n break\nif(flag):\n print(\"Yes\\n\")\nelse:\n print(\"No\\n\")\n\t \t \t \t \t \t\t\t\t \t \t\t\t\t\t\t\t", "\r\nn1,n2=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\nj=0\r\nfor i in range(len(a)):\r\n if a[i]==0:\r\n a[i]=b[j]\r\n j+=1\r\nflag=True\r\nfor i in range(1,len(a)):\r\n if a[i]<a[i-1]:\r\n flag=False\r\n print(\"YES\")\r\n break\r\nif flag:\r\n print(\"NO\")", "I = lambda: list(map(int, input().split()))\r\nn, k = I()\r\na, b = I(), sorted(I())\r\nwhile len(b):\r\n a[a.index(0)] = b.pop()\r\nprint(\"No\" if a==sorted(a) else \"Yes\")", "# Time : 2017-6-27 10:30\r\n# Auther : Anjone\r\n# URL : http://codeforces.com/contest/821/problem/A\r\n\r\nn,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb.sort();\r\nindex = -1\r\nif(a[0]==0):\r\n\ta[0]=b[-1]\r\n\tindex -= 1\r\nfor i in range(1,n):\r\n\tif(a[i] != 0):\r\n\t\tif(a[i] < a[i-1]):\r\n\t\t\tprint(\"Yes\")\r\n\t\t\texit(0)\r\n\telse:\r\n\t\tif(a[i-1]>b[0]):\r\n\t\t\tprint(\"Yes\")\r\n\t\t\texit(0)\r\n\t\telse:\r\n\t\t\ta[i]=b[index]\r\n\t\t\tindex -= 1;\r\nprint(\"No\")\r\n", "def read(): return map(int, input().split())\n\nn, k = read()\na = list(read())\nb = list(sorted(read(), reverse=True))\n\nj = 0\nfor i in range(n):\n if a[i] == 0:\n a[i] = b[j]\n j += 1\n\nprint(\"No\" if len([1 for x, y in zip(a, a[1:]) if x < y]) == n - 1 else \"Yes\")\n", "import sys\n\nn, k = map(int, sys.stdin.readline().split())\na = list(map(int, sys.stdin.readline().split()))\nb = list(map(int, sys.stdin.readline().split()))\n\nminb = min(b)\nmaxb = max(b)\n\nans = False\nif minb != maxb:\n ans = True\nelse:\n j = 0\n for i in range(n):\n if a[i] == 0:\n a[i] = b[j]\n j += 1\n\n for i in range(1, n):\n if a[i] < a[i-1]:\n ans = True\n break\n\nif ans:\n print('YES')\nelse:\n print('NO')\n", "input()\r\nseq = [int(num) for num in input().split()]\r\nnums = reversed(sorted(map(int, input().split())))\r\n\r\nind = 0\r\nfor num in nums:\r\n while seq[ind] > 0:\r\n ind += 1\r\n seq[ind] = num\r\n\r\nfor prev, nxt in zip(seq, seq[1:]):\r\n if prev >= nxt:\r\n print('Yes')\r\n exit(0)\r\nprint('No')\r\n", "_, k = map(int, input().split())\r\n\r\nif k > 1:\r\n print('Yes')\r\nelse:\r\n A = list(map(int, input().split()))\r\n A[A.index(0)] = int(input())\r\n print('No' if A == sorted(A) else 'Yes')", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort()\r\ns=set(b)\r\nz=a.count(0)\r\nif(z>len(s)):\r\n print('No')\r\nelse:\r\n if(z==1):\r\n flag=False\r\n j=a.index(0)\r\n for i in b:\r\n a[j]=i\r\n if(a!=sorted(a)):\r\n flag=True\r\n break \r\n if(flag):\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n print('Yes')", "n, k = map(int, input().split() )\r\n\r\na = list(map(int, input().split() ))\r\nb = list(map(int, input().split() ))\r\n\r\nk = 0\r\nj = 0\r\nx = True\r\n\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n k+=1\r\n j = i\r\n\r\nif k > 1:\r\n print(\"Yes\")\r\nelse:\r\n a[j] = b[0]\r\n for i in range(1, len(a)):\r\n if a[i-1] > a[i]:\r\n x = False\r\n if x:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n", "n, k = [int(item) for item in input().split()]\r\na = [int(item) for item in input().split()]\r\nb = [int(item) for item in input().split()]\r\n\r\nif k == 1:\r\n adiff = a.copy()\r\n for i in range(n):\r\n if a[i] == 0:adiff[i] = b[0]\r\n if adiff == sorted(adiff):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n\r\nelse:\r\n print(\"Yes\")", "def Main():\r\n n, k = map(int,input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n \r\n if k > 1:\r\n print(\"Yes\")\r\n else:\r\n # print(a.index(0))\r\n a[a.index(0)] = b[0]\r\n if a == sorted(a):\r\n print(\"No\")\r\n else: print(\"Yes\")\r\nif __name__ == '__main__':\r\n Main()", "def read():\r\n return [int(e) for e in input().split()]\r\nnotim=read()\r\na=read()\r\nb=read()\r\nb.sort()\r\ni=0\r\nwhile i<len(a):\r\n if a[i]==0:\r\n a[i]=b.pop()\r\n i+=1\r\nif a==sorted(a):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Dec 17 12:48:51 2018\n\n@author: umang\n\"\"\"\n\nn, k = map(int, input().split())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nif len(b) > 1: # and b.count(b[0]) < len(b):\n print(\"Yes\")\nelse:\n is_incr = True\n b = list(reversed(sorted(b)))\n j = 0\n for i in range(len(a)):\n if a[i] == 0:\n a[i] = b[j]\n j += 1\n for i in range(1, len(a)):\n if a[i] <= a[i-1]:\n is_incr = False\n if is_incr:\n print(\"No\")\n else:\n print(\"Yes\")\n ", "import os\r\nimport sys\r\nimport random\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range (1,k):\r\n if (b[i]!=b[i-1]):\r\n print (\"Yes\")\r\n quit()\r\n\r\nj=0\r\nif (a[j]==0):\r\n a[j]=b[j]\r\n j+=1\r\n\r\nfor i in range(1,n):\r\n if (a[i]==0):\r\n a[i]=b[j]\r\n j=j+1\r\n if (a[i]<a[i-1]):\r\n print (\"Yes\")\r\n quit()\r\n\r\nprint(\"No\")", "def parse():\r\n return list(map(int, input().split()))\r\n\r\nn,m = map(int, input().split())\r\na = parse()\r\nb = parse()\r\nif m > 1:\r\n print('Yes')\r\n exit()\r\nelse:\r\n if a[0] == 0 and b[0] > a[1]:\r\n print('Yes')\r\n exit()\r\n for i in range(1,n):\r\n if a[i] !=0 and a[i-1] != 0 and a[i-1] > a[i]:\r\n print('Yes')\r\n exit()\r\n if a[i] == 0:\r\n if b[0] < a[i-1]:\r\n print('Yes')\r\n exit() \r\n if i + 1 != n and b[0] > a[i+1]:\r\n print('Yes')\r\n exit()\r\n \r\n \r\nprint('No')", "n, k = map(int, input().split())\r\narra = list(map(int, input().split()))\r\narrb = list(map(int, input().split()))\r\n\r\n\r\nif k > 1:\r\n print(\"YES\")\r\nelse:\r\n arra[arra.index(0)] = arrb[0]\r\n sor = sorted(arra)\r\n if arra == sor:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "a,b=map(int,input().split())\r\n\nx=list(map(int,input().split()))\r\n\ny=list(map(int,input().split()))\n\r\ny.sort()\n\r\nj=b-1\n\r\n#print\r\nfor i in range(a):\r\n\n if x[i]==0:\n\r\n x[i]=y[j]\n\r\n j=j-1\r\n\nt=sorted(x)\n\r\nc=0\n\r\nfor i in range(a):\n\r\n if t[i]!=x[i]:\r\n\n print(\"Yes\")\n\r\n c=1\r\n\n break\r\nif(c==0):\r\n\n print(\"No\")\n ", "n, k = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nzero_ind = []\nfor i in range(n):\n if A[i] == 0:\n zero_ind.append(i)\n\nif len(zero_ind) == 1:\n A[zero_ind[0]] = B[0]\n sorted_A = sorted(A)\n for i in range(n):\n if A[i] != sorted_A[i]:\n print(\"Yes\")\n exit()\n print(\"No\")\n exit()\n\nprint(\"Yes\")\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nb = list(reversed(sorted(b)))\nj = 0\nfor i in range(n):\n if a[i] == 0:\n a[i] = b[j]\n j += 1\nans = 'No'\nfor i in range(n - 1):\n if a[i] >= a[i + 1]:\n ans = 'Yes'\n break\nprint(ans)\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif(k==1):\r\n i=a.index(0)\r\n a[i]=b[0]\r\n s=sorted(a)\r\n if(s==a):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n \r\nelse:\r\n print(\"Yes\")", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = sorted(map(int, input().split()))\nm = -1\nfor v in a:\n if v == 0:\n v = b[-1]\n b.pop()\n if v < m:\n print(\"Yes\")\n exit()\n m = max(m, v)\n\nprint(\"No\")\n", "n, k = [int(item) for item in input().split()]\r\na = [int(item) for item in input().split()]\r\nb = [int(item) for item in input().split()]\r\n\r\nif a.count(0) >= 2:\r\n print('Yes')\r\nelse:\r\n a[a.index(0)] = b[0]\r\n for i, item in enumerate(a[1:]):\r\n if a[i + 1] <= a[i]:\r\n print('Yes')\r\n exit(0)\r\n print('No')\r\n", "import sys\r\nread=lambda:sys.stdin.readline().rstrip()\r\nreadi=lambda:int(sys.stdin.readline())\r\nwriteln=lambda x:sys.stdout.write(str(x)+\"\\n\")\r\nwrite=lambda x:sys.stdout.write(x)\r\ndef solve(A,B):\r\n cnts = [0]*201\r\n for a in A:\r\n cnts[a] += 1\r\n for b in B:\r\n cnts[b] += 1\r\n\r\n zcnt = cnts[0]\r\n\r\n for i in range(1, 201):\r\n if cnts[i] > 1:\r\n return False\r\n\r\n if zcnt == 1: \r\n length = len(A)\r\n for i in range(length):\r\n if not A[i]:\r\n A[i] = B[0]\r\n copyA = list(A)\r\n copyA.sort()\r\n for i in range(length):\r\n if A[i] != copyA[i]:\r\n return True\r\n return False\r\n\r\n return True\r\n\r\nN,K=map(int, read().split())\r\nA = list(map(int, read().split()))\r\nB = list(map(int, read().split()))\r\n\r\n\r\n\r\nres = solve(A,B)\r\nif res:\r\n writeln(\"Yes\")\r\nelse:\r\n writeln(\"No\")", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nif k > 1:\r\n print(\"Yes\")\r\nelse:\r\n a[a.index(0)] = b[0]\r\n for i in range(1, n):\r\n if a[i] <= a[i - 1]:\r\n print(\"Yes\")\r\n break\r\n else:\r\n print(\"No\")", "_ = input()\na = list(map(int, input().split(\" \")))\nb = list(map(int, input().split(\" \")))\n\n\nac = a.copy()\nb.sort(reverse = True)\ncurrb = 0\nfor i in range(0,len(a)):\n if a[i] == 0:\n a[i] = b[currb]\n ac[i] = b[currb]\n currb += 1\nac.sort()\nif a != ac :\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort(reverse=True)\r\np = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b[p]\r\n p += 1\r\nflg = 1\r\nfor i in range(1, n):\r\n if a[i - 1] > a[i]:\r\n flg = 0\r\nif flg == 1:\r\n print('No')\r\nelse:\r\n print('Yes')", "n ,k = map(int, input().split())\nindex = k-1\nArr1 = list(map(int ,input().split()))\nArr2 = list(map(int ,input().split()))\nArr2.sort()\nfor i in range(n):\n if Arr1[i] == 0 :\n Arr1[i] = Arr2[index]\n index -= 1\nprint(\"NO\" if sorted(Arr1)==Arr1 else \"YES\")\n", "u=input()\r\na=input()\r\nb=input()\r\nc=[\"Yes\",\"No\"]\r\nch=0\r\na=list(map(int,a.split()))\r\nb=list(map(int,b.split()))\r\nb.sort(reverse=True)\r\nfor i in range(len(b)):\r\n a[a.index(0)]=b[i]\r\nt=a[:]\r\na.sort()\r\nif(a==t):\r\n ch=1\r\nprint(c[ch])", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nif(a[1]==1):\r\n d=0\r\n for r in range(0,len(b)):\r\n if(b[r]==0):\r\n d=r\r\n break\r\n b[d]=c[0]\r\n if(sorted(b)==b):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"YES\")\r\n", "a, b = map(int, input().split())\ns1 = list(map(int, input().split()))\ns2 = list(map(int, input().split()))\nif b == 1:\n s1[int(s1.index(0))] = s2[0]\n for i in range(1, a):\n if s1[i] < s1[i-1]:\n print('YES')\n exit()\n print('NO')\nelse:\n print('YES')\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\nz=0\r\nfor i in range(n):\r\n if a[i]==0:\r\n a[i]=b[z]\r\n z=z+1\r\nw,d=0,a.copy()\r\nd.sort()\r\nfor i in range(n):\r\n if d[i]==a[i]:\r\n w=w+1\r\n\r\nif w==n:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\") \r\n ", "m, n = map(int, input().split())\r\nll = [int(x) for x in input().split()]\r\nhh = [int(x) for x in input().split()]\r\nfor i in range(m):\r\n if ll[i] == 0:\r\n f = max(hh)\r\n ll[i] = max(hh)\r\n for j in range(n):\r\n if f == hh[j]:\r\n hh[j] = -1\r\n break\r\njj = sorted(ll)\r\nif ll == jj:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Mar 29 17:39:31 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n#http://codeforces.com/problemset/problem/814/A --- Alexis Galvan\r\n\r\n\r\ndef merge_sort(array):\r\n if len(array) == 1:\r\n return array\r\n \r\n half = round(len(array)/2)\r\n \r\n arrayOne = [array[i] for i in range(0, half)]\r\n arrayTwo = [array[i] for i in range(half, len(array))]\r\n \r\n arrayOne = merge_sort(arrayOne)\r\n arrayTwo = merge_sort(arrayTwo)\r\n \r\n return merge(arrayOne, arrayTwo)\r\n\r\ndef merge(arrayA, arrayB):\r\n output = []\r\n while len(arrayA) > 0 and len(arrayB) > 0:\r\n if arrayA[0] < arrayB[0]:\r\n output.append(arrayA[0])\r\n arrayA.pop(0)\r\n else:\r\n output.append(arrayB[0])\r\n arrayB.pop(0)\r\n \r\n while len(arrayA) > 0:\r\n output.append(arrayA[0])\r\n arrayA.pop(0)\r\n \r\n while len(arrayB) > 0:\r\n output.append(arrayB[0])\r\n arrayB.pop(0)\r\n \r\n return output\r\n\r\ndef check(array):\r\n for i in range(len(array)):\r\n if i+1 != len(array):\r\n if array[i] <= array[i+1]:\r\n continue\r\n return False\r\n return True\r\n\r\ndef check_a(array):\r\n copy = array.copy()\r\n while copy[0] != 0:\r\n copy.pop(0)\r\n if len(copy) == 0:\r\n return False\r\n else:\r\n temp = copy[0]\r\n \r\n for i in range(len(array)):\r\n if array[i] < temp:\r\n return True\r\n elif array[i] > temp:\r\n temp = array[i]\r\n return False\r\n \r\ndef check_equal_b(array):\r\n table = {array[0]:1}\r\n for i in range(1, len(array)):\r\n if array[i] not in table:\r\n return True\r\n return False\r\n \r\n\r\ndef abandoned_sentiment():\r\n ab = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n \r\n if len(b) == 1:\r\n for i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n break\r\n if not check(a):\r\n return 'YES'\r\n return 'NO'\r\n \r\n if check_a(a):\r\n return 'YES'\r\n \r\n \r\n b = merge_sort(b)\r\n \r\n if check_equal_b(b):\r\n return 'YES'\r\n \r\n for i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n b.pop(0)\r\n \r\n if not check(a):\r\n return 'YES'\r\n return 'NO'\r\n\r\nA = abandoned_sentiment()\r\nprint(A)", "n,k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\npnt = k-1\r\nfor i in range(n):\r\n\tif a[i] == 0:\r\n\t\ta[i] = b[pnt]\r\n\t\tpnt-=1\r\nans = 'No'\r\nfor i in range(n-1):\r\n\tif a[i]>a[i+1]:\r\n\t\tans = 'Yes'\r\n\t\tbreak\r\nprint(ans)\r\n", "def read(): return map(int, input().split())\n\nn, k = read()\na = list(read())\nb = list(sorted(read()))\n\nfor i in range(n):\n if a[i] == 0:\n a[i] = b.pop()\n\nprint(\"No\" if len([1 for x, y in zip(a, a[1:]) if x < y]) == n - 1 else \"Yes\")\n", "\nn, k = 0, 0\na = []\nb = []\n\ndef get_input():\n\tglobal a, b, n, k\n\tfirst_arr = [int(x) for x in input().split()]\n\tn, k = first_arr[0], first_arr[1]\n\ta = [int(x) for x in input().split()]\n\tb = [int(x) for x in input().split()]\n\t\ndef isSorted(l):\n\treturn all(l[i] <= l[i+1] for i in range(len(l)-1))\n\t\ndef main():\n\tget_input()\n\tif len(b) > 1:\n\t\tprint(\"Yes\")\n\t\treturn\n\tfor i in range(n):\n\t\tif a[i] == 0:\n\t\t\ta[i] = b[0]\n\tif isSorted(a):\n\t\tprint(\"No\")\n\telse:\n\t\tprint(\"Yes\")\n\n\nif __name__ == '__main__':\n\tmain()\n", "n, k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort()\r\ni=0\r\nsecondary=a\r\n\r\ncount=len(b)-1\r\n\r\nfor i in range(n):\r\n if a[i]==0:\r\n secondary[i]=b[count]\r\n count-=1\r\nthird=secondary\r\n\r\nsecondary=sorted(secondary)\r\n\r\n\r\n\r\nif secondary==third:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n\r\n\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmissing = sorted(list(map(int, input().split())))[::-1]\r\nfor i in range(n):\r\n if arr[i] == 0:\r\n arr[i] = missing.pop(0)\r\nif arr == sorted(arr):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "from sys import stdin as fin\n# fin = open(\"cfr418a.in\", \"r\")\n\nn, k = map(int, fin.readline().split())\na, b = (list(map(int, fin.readline().split())) for i in range(2))\n\nb.sort(reverse=True)\n\nj = 0\nfor i in range(n):\n if not a[i]:\n a[i] = b[j]\n j += 1\n if i and a[i] <= a[i - 1]:\n print(\"Yes\")\n break\nelse:\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\nn, k = rint()\na = list(rint())\nb = list(rint())\n\nif k >= 2:\n print(\"Yes\")\n exit()\n\nfor i in range(n):\n if a[i] == 0:\n a[i] = b[0]\n\nc = sorted(a)\n\nif a == c:\n print(\"No\")\nelse:\n print(\"Yes\")\n\n", "I = lambda: map(int, input().split())\nn, k = I()\na, b = list(I()), list(I())\nif k == 1:\n c = list(a)\n c[c.index(0)] = b[0]\n if sorted(c) == c:\n print('No')\n exit(0)\nprint('Yes')\n", "#print([].count(25))\r\nn,k=input().strip().split(' ')\r\nn,k=(int(n),int(k))\r\na=list(map(int,input().strip().split(' ')))\r\nb=list(map(int,input().strip().split(' ')))\r\nls=[]\r\nfor i in range(n):\r\n if a[i]==0:\r\n ls.append(i)\r\nif k>1:\r\n print(\"Yes\")\r\n exit()\r\nelif k==1:\r\n a[ls[0]]=b[0]\r\n if a!=sorted(a):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nd=0\r\nif len(b)>1:\r\n print(\"YES\")\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]==0:\r\n a[i]=b[0]\r\n \r\n for i in range(1,len(a)):\r\n if a[i]-a[i-1]<=0:\r\n d+=1\r\n if d>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def check_sorted(nums):\r\n order = True\r\n for i in range(len(nums) - 1):\r\n if nums[i] > nums[i + 1]:\r\n order = False\r\n break\r\n return order\r\n\r\ndef main():\r\n n, k = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n b = list(map(int,input().split()))\r\n if k >= 2:\r\n ans = \"Yes\"\r\n else:\r\n for i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n break\r\n if check_sorted(a):\r\n ans = \"No\"\r\n else:\r\n ans = \"Yes\"\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ndef seq_input():\r\n return list(map(int, input().split()))\r\n\r\n[n, k] = seq_input()\r\na = seq_input()\r\nb = seq_input()\r\n\r\nb.sort(reverse=True)\r\nj = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n j += 1\r\n\r\nfor i in range(1, n):\r\n if a[i] < a[i-1]:\r\n print('Yes')\r\n exit(0)\r\nprint('No')\r\n \r\n\r\n \r\n", "F=lambda:map(int,input().split())\r\nn,k=F();a=list(F());b=list(F());a[a.index(0)]=b[0]\r\nprint(\"No\" if k==1 and a==sorted(a) else \"Yes\")", "n,k=map(int,input().split())\r\nz=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())),reverse=True)\r\ni=0;j=0\r\nwhile(i<n):\r\n if(z[i]==0):\r\n z[i]=a[j]\r\n j+=1\r\n i+=1\r\nflag=0;i=0\r\nwhile(i<n-1):\r\n if(z[i]>z[i+1]):\r\n flag=1\r\n break\r\n i+=1\r\nif(flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nn=l1.count(0)\r\nif n==1:\r\n\tflag=False\r\n\tpos=l1.index(0)\r\n\tfor i in range(len(l2)):\r\n\t\tl1[pos]=l2[i]\r\n\t\tfor i in range(len(l1)-1):\r\n\t\t\tif l1[i]>l1[i+1]:\r\n\t\t\t\tflag=True\r\n\t\t\t\tbreak\r\n\t\tif flag==False:\r\n\t\t\tprint('No')\r\n\t\telse:\r\n\t\t\tprint('Yes')\r\nelse:\r\n print('Yes')", "n, k = map(int, input().split(\" \"))\na = list(map(int, input().split(\" \")))\nb = list(map(int, input().split(\" \")))\n\nif k > 1:\n print(\"Yes\")\n exit()\n\na[a.index(0)] = b[0]\nfor i in range(1, n):\n if a[i-1] != 0 and a[i] != 0 and a[i-1] > a[i]:\n print(\"Yes\")\n break\nelse:\n print(\"No\")\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nb.sort(reverse=True)\r\n\r\nincreasing = True\r\n\r\ni = 0\r\nfor j in range(len(b)):\r\n while a[i] != 0:\r\n i += 1\r\n a[i] = b[j]\r\n\r\nfor i in range(1, len(a)):\r\n if a[i] < a[i-1]:\r\n increasing = False\r\n break\r\nif increasing:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nbrr = list(map(int,input().split()))\r\nbrr.sort()\r\nfor i in range(n):\r\n\tif arr[i]==0:\r\n\t\tarr[i] = brr.pop()\r\nx = arr[::]\r\nx.sort()\r\nif x==arr:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")", "I=lambda: map(int, input().split())\nn, k=I()\na=list(I())\nb=list(I())\nif k>=2:\n\tprint('Yes')\nelse:\n\ta=[b[0] if x==0 else x for x in a]\n\tprint('Yes' if any(a[i]<=a[i-1] for i in range(1, n)) else 'No')\n\n", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sorted(list(map(int, input().split())))[::-1]\r\nj = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n j += 1\r\n\r\nfor i in range(n-1):\r\n if a[i] > a[i+1]:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "#\"from dust i have come, dust i will be\"\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nb.sort(reverse=True)\r\n\r\nj=0\r\nfor i in range(n):\r\n\r\n if j>=k:\r\n break\r\n\r\n if a[i]==0:\r\n a[i]=b[j]\r\n j+=1\r\n\r\nj=0\r\nfor i in range(1,n):\r\n if a[i]==0:\r\n print(\"No\")\r\n exit(0)\r\n\r\n if a[i]>a[i-1]:\r\n j+=1\r\n\r\nif j==n-1:\r\n print(\"No\")\r\n\r\nelse:\r\n print(\"Yes\")\r\n\r\n\r\n\r\n", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nd=defaultdict(list)\r\nn,k=M()\r\na=L()\r\nb=L()\r\nif(k>=2):\r\n print(\"Yes\")\r\nelse:\r\n for i in range(n):\r\n if(a[i]==0):\r\n a[i]=b[0]\r\n f=0\r\n for i in range(1,n):\r\n if(a[i]<a[i-1]):\r\n f=1\r\n break\r\n if(f):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "n,k = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nb.sort(reverse=True)\r\n\r\nfor i in b:\r\n a[a.index(0)] = i\r\n\r\nc = [int(i) for i in a]\r\nc.sort()\r\nif(a==c):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n,k=map(int,input().split())\r\nfirst=list(map(int,input().split()))\r\nduplicate=[]\r\nincreasing=True\r\nresult=True\r\nsecond=list(map(int,input().split()))\r\nsecond_num=0\r\n\r\nfor i in range (len(second)-1):\r\n if second[i]<second[i+1]:\r\n temporary=second[i]\r\n second[i]=second[i+1]\r\n second[i+1]=temporary\r\n \r\nfor i in range(len(first)):\r\n if first[i]==0:\r\n first[i]=second[second_num]\r\n second_num+=1\r\n\r\nfor i in first:\r\n if i not in duplicate:\r\n duplicate.append(i)\r\n else:\r\n result=False\r\n\r\nfor i in range(len(first)-1):\r\n if first[i]>first[i+1]:\r\n increasing=False\r\n\r\nif increasing==True or result==False:\r\n print(\"No\")\r\n\r\nelif increasing==False and result==True:\r\n print(\"Yes\")", "n,k=[int(e) for e in input().split()]\r\na=[int(e) for e in input().split()]\r\nb=[int(e) for e in input().split()]\r\nif k>1:\r\n print(\"YES\")\r\nelif [e if e!=0 else b[0] for e in a]!=sorted(e if e!=0 else b[0] for e in a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k =map(int, input().split())\r\nvn = list(map(int, input().split()))\r\nkn = list(map(int, input().split()))\r\n\r\nif k == 1:\r\n vn[vn.index(0)] = kn[0]\r\n if sorted(vn) == vn:\r\n print('No')\r\n else:\r\n print('Yes')\r\nelse:\r\n print('Yes')", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nif k>=2 :\r\n print('Yes')\r\n exit()\r\nfor i in range(n-1) :\r\n if l[i]>=l[i+1] and l[i+1]!=0 :\r\n print('Yes')\r\n exit()\r\nl[l.index(0)]=l1[0]\r\nif l!=sorted(l) :\r\n print('Yes')\r\n exit()\r\n \r\nprint('No')\r\n", "n,k = list(map(int,input().split()))\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\nif len(b) > 1 :\n print (\"Yes\")\nelse:\n for x in range(len(a)):\n if a[x] == 0:\n a[x] = b[0]\n if a == sorted(a) :\n print (\"No\")\n else:\n print (\"Yes\")\n", "import sys\r\ndef scan():\r\n return map(int,sys.stdin.readline().strip().split())\r\n\r\nn,k = scan()\r\na = list(scan())\r\nb = list(scan())\r\nd = a[::]\r\nc = []\r\nfor i in range(n):\r\n if a[i] == 0:\r\n c.append(i)\r\nb.sort()\r\nj = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n j += 1\r\nc = sorted(a)\r\nfor i in range(n):\r\n count = 0 \r\n if d[i] == 0:\r\n e = d[::]\r\n for j in range(k):\r\n e[i] = b[j]\r\n if e != c:\r\n count = 1\r\n break\r\n if count == 1:\r\n break\r\nif count == 1:\r\n print('YES')\r\nelse:\r\n print('No')\r\n", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nif k==1:\r\n for i in range(n):\r\n if a[i]==0:\r\n a[i]=b[0]\r\nif a==sorted(a) and len(set(a))>1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\nfor i in range(k):\r\n if b[i] not in a:\r\n a[a.index(0)]=b[i]\r\nif a!=sorted(a):\r\n print('Yes')\r\nelse:\r\n print('No')", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nif a.count(0)>=2:\r\n print('YES')\r\nelse:\r\n a[a.index(0)]=b[0]\r\n if sorted(a)==a:\r\n print('NO')\r\n else:\r\n print('YES')", "n, k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nif len(b) != 1:\r\n print('Yes')\r\nelse:\r\n a[a.index(0)] = b[0]\r\n for i in range(len(a)-1):\r\n if a[i]>a[i+1]:\r\n print('Yes')\r\n break\r\n else:\r\n print('No')", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nab = list(map(int, input().split()))\r\nab.sort(reverse=True)\r\nfor i in range(n):\r\n if arr[i] == 0:\r\n arr[i] = ab.pop(0)\r\n\r\nif arr == sorted(arr):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "Input=lambda:map(int,input().split())\n# This code written during the contest\n# Codeforces Round #574 (Div. 2)\nn, k = Input()\na = list(Input())\nb = list(Input())\nif k >= 2:\n print(\"YES\")\nelse:\n if a[0] == 0:\n a[0] = b[0]\n for i in range(1,n):\n if a[i] == 0:\n a[i] = b[0]\n if a[i] < a[i-1]:\n print(\"YES\")\n exit()\n print(\"NO\")\n", "n,k=map(int,input().split())\r\nlst1=list(map(int,input().split()))\r\nlst2=list(map(int,input().split()))\r\nlst2.sort()\r\nlst2.reverse()\r\ni=0\r\nfor j in range(n):\r\n if lst1[j]==0:\r\n lst1[j]=lst2[i]\r\n i+=1\r\nif lst1!=sorted(lst1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "read = lambda: map(int, input().split())\nn, k = read()\na = list(read())\nb = list(read())\nif k > 1:\n print('Yes')\nelse:\n a[a.index(0)] = b[0]\n print('Yes' if a != sorted(a) else 'No')", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif(len(b)==1):\r\n ind=a.index(0)\r\n a[ind]=b[0]\r\n value=[]\r\n for i in range(n):\r\n value.append(a[i])\r\n a.sort()\r\n if(value==a):\r\n print('No')\r\n else:\r\n print('Yes')\r\n \r\nelse:\r\n print('Yes')\r\n ", "n,k = map(int,input().split())\nl = list(map(int,input().split()))\nb = list(map(int,input().split()))\ncount = 0\nflag = 0\nfor i in l:\n if i == 0:\n count+=1\nif count > 1:\n print('Yes')\nelse:\n for i in range(n):\n if l[i] ==0:\n l[i] = b[0]\n for i in range(n-1):\n if l[i+1] < l[i]:\n flag = 1\n if flag == 1:\n print('Yes')\n else:\n print('No')\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb = sorted(b)\r\nc = 0\r\nd = []\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n d.append(i)\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if i == d[j]:\r\n a[i] = b[j]\r\ne = sorted(a)\r\nif a == e and k == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "sz, sz2 = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nstack = sorted(map(int, input().split()))\r\narr2 = [stack.pop() if arr[i] == 0 else arr[i] for i in range(sz)]\r\narr3 = [1 if arr2[i] >= arr2[i + 1] else 0 for i in range(sz - 1)]\r\nprint(\"Yes\" if sum(arr3) else \"No\")\r\n\r\n", "n , k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb.sort()\r\n\r\nfor i in range(n):\r\n if a[i] == 0 :\r\n a[i] = b.pop()\r\n\r\n#print(a)\r\n#print(sorted(a))\r\nif sorted(a) == a :\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "#@sorcerer_21\r\nfrom collections import *\r\nimport sys,math\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\nfor _ in range(1):\r\n n,k=mapin()\r\n a=list(mapin())\r\n b=list(mapin())\r\n bb=sorted(b)[::-1]\r\n c=0\r\n for i in range(n):\r\n if a[i]==0:\r\n a[i]=bb[c]\r\n c+=1\r\n c=0\r\n for i in range(n-1):\r\n if a[i+1]>a[i]:c+=1\r\n if c==n-1:print('No')\r\n else:print('Yes')", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ndiscount = list(map(int, input().split()))\r\narr[arr.index(0)] = discount[0]\r\nif m > 1 or arr != sorted(arr):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nif k>1:\r\n print(\"Yes\")\r\nelse:\r\n for i in range(n):\r\n if l[i]==0:\r\n l[i]=a[0]\r\n f=0\r\n for i in range(n-1):\r\n if l[i]>=l[i+1]:\r\n f=1\r\n if f==1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n,m=map(int,input().split())\r\nn1=list(map(int,input().split()))\r\nm1=list(map(int,input().split()))\r\np=0\r\nif n1.count(0)>=2:\r\n print('YES')\r\nelse:\r\n for i in range(len(n1)):\r\n if n1[i]==0:\r\n n1[i]=m1[p]\r\n p+=1\r\n r=n1\r\n if r==sorted(n1):\r\n print('NO')\r\n else:\r\n print('YES') ", "s=[int(n) for n in input().split()]\r\na=[int(n) for n in input().split()]\r\nb=[int(n) for n in input().split()]\r\nb.sort()\r\nb=b[::-1]\r\nl=0\r\nfor n in range(len(a)):\r\n\tif a[n]==0:\r\n\t\ta[n]=b[l]\r\n\t\tl+=1\r\nl=0\r\nfor n in range(1,len(a)):\r\n\tif a[n]<=a[n-1]:\r\n\t\tl=1\r\n\t\tprint('Yes')\r\n\t\tbreak\r\nif l==0:\r\n\tprint('No')", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif k>1:\r\n print(\"Yes\")\r\nelse:\r\n s=\"No\"\r\n for i in range(n-1):\r\n if a[i]==0:\r\n a[i]=b[0]\r\n else:\r\n if a[i+1]==0:\r\n a[i+1]=b[0]\r\n if a[i]>a[i+1]:\r\n s=\"Yes\"\r\n break\r\n print(s)\r\n \r\n", "n,m = map(int,input().split())\r\nln = list(map(int,input().split()))\r\nlm = list(map(int,input().split()))\r\nif m > 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tk = ln.index(0)\r\n\tln[k] = lm[0]\r\n\tflag = 0\r\n\tfor i in range(1,n):\r\n\t\tif ln[i] > ln[i-1]:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tflag = 1\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\tif flag == 0:\r\n\t\tprint(\"NO\")", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\ncnt=a.count(0)\r\nif(cnt>1):\r\n print(\"Yes\")\r\nelse:\r\n a[a.index(0)]=b[0]\r\n for i in range(1,n):\r\n if(a[i]-a[i-1]<0):\r\n print(\"Yes\")\r\n exit()\r\n print(\"No\")\r\n ", "n, k = (int(i) for i in input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = max(b)\r\n del b[b.index(max(b))]\r\n\r\nprint(('YES', 'NO')[sorted(a) == a])", "# -*- coding: utf-8 -*-\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort(reverse=True)\r\nc = []\r\ncur = 0\r\nfor i in a:\r\n if (i != 0):\r\n c.append(i)\r\n else:\r\n c.append(b[cur])\r\n cur += 1\r\n\r\n\r\ndef isinc(arr):\r\n for i in range(1, len(arr)):\r\n if (arr[i - 1] > arr[i]):\r\n return True\r\n return False\r\nif isinc(c):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n,k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nc = [i for i in a if i!=0]\r\n\r\nif (c != sorted(c)):\r\n print(\"Yes\")\r\nelse:\r\n if k == 1:\r\n for i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n if a == sorted(a):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n else:\r\n print(\"Yes\")\r\n \r\n \r\n", "from re import T\r\n\r\n\r\nn, k = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nb = sorted([int(i) for i in input().split()], reverse=True)\r\nt = 0\r\nflag = True\r\nfor i in range(n):\r\n if a[i] == 0 and t < k:\r\n a[i] = b[t]\r\n t += 1\r\n elif a[i] == 0 and t == k:\r\n flag = True\r\n break\r\n if i > 0 and a[i] < a[i-1] and flag:\r\n flag = False\r\n \r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in sorted(list(map(int, input().split())), reverse=True):\r\n a[a.index(0)] = i\r\nprint('YNEOS'[sorted(a) == a::2])\r\n", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort(reverse=True)\r\nj = -1\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n j += 1\r\n a[i] = b[j]\r\n if j == len(b):\r\n break\r\nflag = 0\r\nfor i in range(len(a) - 1):\r\n if a[i] >= a[i + 1]:\r\n flag = 1\r\n break\r\nif flag == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nlength_1, length_2 = [int(x) for x in input().split()]\r\n\r\narr_1 = [int(x) for x in input().split()]\r\narr_2 = [int(x) for x in input().split()]\r\n\r\narr_2.sort(reverse = True)\r\n\r\nj = 0 \r\nans = \"yes\"\r\nfor i in range(length_1):\r\n if arr_1[i] == 0:\r\n if j == length_2:\r\n ans = \"no\"\r\n break\r\n arr_1[i] = arr_2[j] \r\n j+=1\r\n\r\nif j != length_2:\r\n ans = \"no\"\r\n # print(\"here\")\r\n\r\nif ans == \"yes\":\r\n srtd = sorted(arr_1)\r\n if srtd[0] != srtd[-1] and arr_1 == srtd:\r\n ans = \"no\"\r\n # print(\"down\")\r\n\r\n# print(arr_1)\r\nprint(ans.capitalize())\r\n ", "len_seq=input().split()\r\nlen_a,len_b=int(len_seq[0]),int(len_seq[1])\r\na=input().split()\r\nb=input().split()\r\nif len_b>1:\r\n print('Yes')\r\nelse:\r\n target_index=a.index('0')\r\n a.remove('0')\r\n a.insert(target_index,b[0])\r\n solve=0\r\n for i in range(len_a-1):\r\n for j in a[i+1:]:\r\n if int(a[i])>int(j):\r\n solve=1\r\n if solve==1:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(sorted(map(int,input().split()),reverse=True))\r\nfor i in range(n):\r\n if l[i]==0:\r\n l[i]=k[0]\r\n k.pop(0)\r\nif l==sorted(l):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "I=lambda : map(int,input().split())\r\nn,m=I()\r\na,b=list(I()),list(I())\r\nif m==1:\r\n tmp=a\r\n tmp[tmp.index(0)]=b[0]\r\n if sorted(tmp)==tmp:\r\n print('No')\r\n exit(0)\r\nprint('Yes')", "n, k = map(int, input().split())\r\na, b = list(map(int, input().split())), list(map(int, input().split()))\r\na[a.index(0)] = b[0]\r\nprint('Yes' if k > 1 or a != sorted(a) else 'No')", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb = list(reversed(sorted(b)))\r\npos = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b[pos]\r\n pos += 1\r\nans = 0\r\nfor i in range(n - 1):\r\n if a[i] > a[i + 1]:\r\n ans = 1\r\nif ans:\r\n print(\"Yes\")\r\nelse :\r\n print(\"No\")", "def solve():\r\n n, k = map(int, input().split())\r\n\r\n a = tuple(map(int, input().split()))\r\n b = tuple(map(int, input().split()))\r\n\r\n max_ = max(b)\r\n min_ = min(b)\r\n\r\n for i in range(n):\r\n if i > 0 and (a[i] == 0 and a[i - 1] == 0 or a[i] != 0 and a[i - 1] > a[i] or\r\n a[i] == 0 and a[i - 1] > min_) or i < n - 1 and a[i] == 0 and a[i + 1] < max_:\r\n return True\r\n return False\r\n\r\n\r\nif solve():\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a_length, b_length = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort(reverse=True)\r\n\r\nj = 0\r\nfor i in range(a_length):\r\n if a[i] == 0:\r\n a[i] = b[j]\r\n j += 1\r\n\r\nif a == sorted(a):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "N,M = map(int, input().split())\r\n\r\ndef solve():\r\n B.sort();\r\n idx = M - 1\r\n for i in range(0, N):\r\n if (A[i] == 0):\r\n A[i] = B[idx]\r\n idx = idx - 1\r\n\r\n for i in range(1, N):\r\n if (A[i] <= A[i - 1]):\r\n return 1\r\n return 0\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nif(solve() == 1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "t = [int(a) for a in input().split()]\r\n\r\ns1 = [int(a) for a in input().split()]\r\ns2 = [int(a) for a in input().split()]\r\ncount = 0\r\ni = 0\r\n\r\n\r\n\r\nwhile i < len(s1):\r\n if s1[i] == 0:\r\n s1[i] = max(s2)\r\n s2.remove(max(s2))\r\n count += 1\r\n i += 1\r\n\r\n\r\nif s1 == sorted(s1):\r\n print(\"No\")\r\n\r\nelse:\r\n print(\"Yes\")\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort(reverse=True)\r\npos = 0\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[pos]\r\n pos += 1\r\nflag = False\r\nfor i in range(len(a) - 1):\r\n if a[i] > a[i + 1]:\r\n flag = True\r\nif flag:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n", "n, k = map(int, input().split())\r\na, b = list(map(int, input().split())), list(map(int, input().split()))\r\nif k > 1:\r\n exit(print(\"YES\"))\r\nelse:\r\n a[a.index(0)] = b[0]\r\n if a == list(sorted(a)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nb.sort(reverse=True)\r\ni = 0\r\ninc = True\r\nprev = 0\r\nfor j in range(n):\r\n t = a[j]\r\n if t == 0:\r\n t = b[i]\r\n i += 1\r\n if prev > t:\r\n inc = False\r\n break\r\n prev = t\r\n \r\nprint(\"No\" if inc else \"Yes\")", "import sys\n\n\ndef main():\n n,k = map(int,sys.stdin.readline().split())\n \n a = list(map(int, sys.stdin.readline().split()))\n b = list(map(int, sys.stdin.readline().split()))\n b.sort(reverse=True)\n j = 0 \n for i in range(n):\n if a[i] ==0:\n a[i] = b[j]\n j+=1\n\n p = a[0]\n for i in range(1,n):\n if a[i] <= p:\n print(\"Yes\")\n return \n p = a[i]\n \n print(\"No\")\n \n\n\nmain()", "# print(\"Input n and k\")\nn,k = [int(x) for x in input().split()]\n\n# print(\"Input the a sequence\")\na = [int(x) for x in input().split()]\n\n# print(\"Input the b sequence\")\nb = [int(x) for x in input().split()]\n\nif (len(b) > 1):\n print(\"Yes\")\n\nelse:\n insert = b[0]\n zeropos = a.index(0)\n leftlist = a[:zeropos]\n rightlist = a[zeropos+1:]\n\n if (leftlist != sorted(leftlist)):\n print(\"Yes\")\n elif (rightlist != sorted(rightlist)):\n print(\"Yes\")\n elif (len(leftlist) == 0 and insert > rightlist[0]):\n print(\"Yes\")\n elif (len(leftlist) == 0):\n print(\"No\")\n elif (len(rightlist) == 0 and insert < leftlist[zeropos-1]):\n print(\"Yes\")\n elif (len(rightlist) == 0):\n print(\"No\")\n elif insert < leftlist[zeropos-1] or insert > rightlist[0]:\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n", "import sys\r\na,b = input().split()\r\nn = [int(x) for x in input().split()]\r\nm = [int(x) for x in input().split()]\r\na = int(a)\r\nb = int(b)\r\n\r\nm.sort()\r\nm.reverse()\r\nj = 0\r\nfor i in range(0,a):\r\n if n[i] == 0:\r\n n[i] = m[j]\r\n j += 1\r\n\r\nfor i in range(1,a):\r\n if n[i] < n[i - 1]:\r\n print (\"Yes\")\r\n sys.exit()\r\n\r\nprint (\"No\")\r\n", "n, k = list(map(int, input().split()))\r\na = input()\r\nb = input().split()\r\nif len(set(b))>1:\r\n print(\"YES\")\r\nelse:\r\n b = list(map(int, b))\r\n new_a = list(map(int, a.split()))\r\n c = 0\r\n for i in range(len(new_a)):\r\n if new_a[i] == 0:\r\n new_a[i] = b[c]\r\n c += 1\r\n old_a = list(new_a)\r\n new_a.sort()\r\n if new_a == old_a:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jun 7 15:25:16 2017\r\n\r\n@author: Gad\r\n\"\"\"\r\n\r\ndef checker(size,string,replacements):\r\n increasing = True\r\n \r\n if int(size[1]) > 1:\r\n return 'Yes'\r\n \r\n else:\r\n for i in range (int(size[0])):\r\n if int (string[i]) == 0:\r\n string[i] = replacements[0]\r\n break\r\n \r\n \r\n for i in range(int(size[0])-1):\r\n \r\n if int (string[i]) > int(string[i+1]):\r\n increasing = False\r\n \r\n if increasing == False:\r\n return 'Yes'\r\n \r\n return 'No'\r\n \r\n \r\nsize = input().strip().split()\r\nstring = input().strip().split()\r\nreplacements= input().strip().split()\r\n\r\nprint(checker(size,string,replacements))\r\n\r\n\r\n\r\n\r\n \r\n ", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sorted(map(int,input().split()))[::-1]\r\nj=0\r\nfor i in range(n):\r\n if a[i]==0:\r\n a[i]=b[j]\r\n j+=1\r\nif a!=sorted(a): print(\"YES\")\r\nelse: print(\"NO\")", "n, k =map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb = sorted(b)[::-1]\r\nptr = 0\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n a[i] = b[ptr]\r\n ptr += 1\r\nfor i in range(len(a)-1):\r\n if a[i+1] <= a[i]:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")", "input()\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nn =len(a)\nk =len(b)\n\nb.sort()\n\ni = k-1\nc = []\nfor e in a:\n if e==0:\n c.append(b[i])\n i-=1\n else:\n c.append(e)\n\nyes = False\n\nfor i in range(1,n):\n if c[i] < c[i-1]:\n yes = True\n\nif yes:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "n=input()\r\na=input()\r\nb=input()\r\nk=n.split()[1]\r\nn=n.split()[0]\r\na=a.split()\r\nb=b.split()\r\na1=a.copy()\r\nt0=a.count('0')\r\nib=0\r\nfor i in range(int(n)):\r\n if a[i]=='0':\r\n a[i]=b[ib]\r\n ib=ib+1\r\nj=\"Yes\"\r\ninc=0\r\nfor i in range(int(n)-1):\r\n if int(a[i])<int(a[i+1]):\r\n inc=inc+1\r\nif inc==int(n)-1:\r\n j=\"No\"\r\nif t0>1:\r\n j=\"Yes\"\r\nprint(j)\r\n", "n,k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nb.sort(reverse=True)\r\nb_iter = iter(b)\r\na_final = [next(b_iter) if x == 0 else x for x in a]\r\n\r\ninc_order = all(a_final[i] < a_final[i+1] for i in range(n-1))\r\nprint(\"No\") if inc_order else print(\"Yes\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nb.reverse()\r\nfor i in range(n):\r\n if(a[i]==0):\r\n a[i]=b[0]\r\n b.remove(b[0])\r\n if(len(b)==0):\r\n break\r\nif(len(set(a))!=n):\r\n print(\"No\")\r\nelse:\r\n f=0\r\n for i in range(1,n):\r\n if(a[i]<a[i-1]):\r\n f=1\r\n print(\"Yes\")\r\n break\r\n if(f==0):\r\n print(\"No\")", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nif k == 1:\n i = a.index(0)\n a[i] = b[0]\n x = sorted(a)\n if a == x:\n print(\"NO\")\n else:\n print(\"YES\")\nelse:\n b = sorted(b, reverse=True)\n x = 0\n for i in range(0, n):\n if a[i] == 0:\n a[i] = b[x]\n x += 1\n print(\"YES\")\n", "def read(): return map(int, input().split())\r\n \r\nn, k = read()\r\na = list(read())\r\nb = list(sorted(read()))\r\n \r\nfor i in range(n):\r\n if a[i] == 0:\r\n a[i] = b.pop()\r\n \r\nprint(\"No\" if sorted(a) == a else \"Yes\")\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb=sorted(b)\r\nb=b[::-1]\r\nt=0\r\nfor i in range(n):\r\n if a[i]==0:\r\n a[i]=b[t]\r\n t+=1 \r\nfor i in range(1,n):\r\n if a[i-1]>=a[i]:\r\n print('Yes')\r\n exit()\r\nprint('No')", "def read_int():\r\n return map(int, input().split())\r\n\r\nn, k = read_int()\r\na = list(read_int())\r\nb = list(read_int())\r\n\r\nif k > 1:\r\n print('Yes')\r\nelse:\r\n if a[0] == 0:\r\n a[0] = b[0]\r\n for i in range(1, n):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n if a[i] < a[i - 1]:\r\n print('Yes')\r\n break\r\n else:\r\n print('No')\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb = sorted(b,reverse = True)\r\nj = 0\r\nfor i in range(0,n):\r\n\tif(a[i]==0):\r\n\t\ta[i] = b[j]\r\n\t\tj+=1\r\nca = sorted(a)\r\nif(ca == a):\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")", "import sys\r\ninput = sys.stdin.readline\r\nN, K = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif a.count(0) > 1: print(\"Yes\")\r\nelse:\r\n for i in range(N):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n for i in range(N - 1):\r\n if a[i + 1] <= a[i]:\r\n print(\"Yes\")\r\n break\r\n else: print(\"No\")", "i=lambda:map(int,input().split())\r\nn,k=i()\r\na=i()\r\nb=sorted(i())\r\nr=1\r\nl=0\r\nfor x in a:\r\n if x==0:x=b[k-1];k-=1\r\n r&=x>l\r\n l=x\r\nprint('YNeos'[r::2])", "m,n=input().split()\r\nm,n=[int(m),int(n)]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nb.sort(reverse=True)\r\nj=0\r\nfor i in range(0,m):\r\n if a[i]==0:\r\n a[i]=b[j]\r\n j+=1\r\n if j==n:\r\n break\r\nif sorted(a)==a:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "def main():\n input()\n aa = list(map(int, input().split()))\n bb = sorted(map(int, input().split()))\n for i, a in enumerate(aa):\n if not a:\n aa[i] = bb.pop()\n print((\"No\", \"Yes\")[any(a >= b for a, b in zip(aa, aa[1:]))])\n\n\nif __name__ == '__main__':\n main()\n", "n,k=map(int,input().split())\r\n\r\nl1=list(map(int,input().split()))\r\n\r\nl2=list(map(int,input().split()))\r\n\r\nif len(l2)>1:\r\n print(\"Yes\")\r\nelse:\r\n for i in range(len(l1)):\r\n if l1[i]==0:\r\n l1[i]=l2[0]\r\n for i in range(1,len(l1)):\r\n if l1[i-1]>l1[i]:\r\n print(\"Yes\")\r\n exit()\r\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nzeros = sum(map(lambda x: 0 if x > 0 else 1, a))\na = list(map(lambda x: x if x > 0 else b[0], a))\nprint('Yes' if sorted(a) != a or zeros > 1 else 'No')\n", "[n, k] = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nif k > 1:\r\n print('Yes')\r\nelse:\r\n for i in range(n):\r\n if A[i] == 0:\r\n A[i] = B[0]\r\n break\r\n c = 0\r\n for i in range(1, n):\r\n if A[i-1] >= A[i]:\r\n c = 1\r\n break\r\n if c == 1:\r\n print('Yes')\r\n else:\r\n print('No')", "n, k = tuple(list(map(int, input().split(' '))))\r\na = list(map(int, input().split(' ')))\r\nb = list(map(int, input().split(' ')))\r\n\r\nb = sorted(b)\r\nfor i in range(len(a)):\r\n if (a[i]==0):\r\n a[i]=b.pop()\r\n \r\nif (a==sorted(a)):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "def main():\r\n n,m = map(int,input().split())\r\n brokenSequence = [int(i) for i in input().split()]\r\n elements = [int(i) for i in input().split()]\r\n elements1 = elements\r\n if len(elements) == 1:\r\n for i in range(n):\r\n if brokenSequence[i] == 0:\r\n brokenSequence[i] = elements[0]\r\n for i in range(n-1):\r\n if brokenSequence[i] > brokenSequence[i+1]:\r\n return \"YES\"\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\nprint(main())", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nif k >= 2:\r\n print(\"Yes\")\r\nelse:\r\n if a[0] == 0:\r\n a[0] = b[0]\r\n for i in range (1, n):\r\n if a[i] == 0:\r\n a[i] = b[0]\r\n if a[i] < a[i - 1]:\r\n print(\"Yes\")\r\n exit()\r\n print(\"No\")", "n,k= tuple(map(int,input().split(' ')))\r\na = list(map(int,input().split(' ')))\r\nb = list(map(int,input().split(' ')))\r\nif(k>1):\r\n print('Yes')\r\nelse:\r\n for i in range(n):\r\n if(a[i]==0):\r\n a[i]=b[0]\r\n \r\n ans=0\r\n for i in range(1,n):\r\n if(a[i]<=a[i-1]):\r\n ans=1\r\n print('Yes' if ans==1 else 'No')", "n, k = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\nb = [int(x) for x in input().split(' ')]\r\n\r\nif k >= 2:\r\n ans = 'Yes'\r\nelse:\r\n a[a.index(0)] = b[0]\r\n if min([a[i] - a[i - 1] for i in range(1, n)]) < 0:\r\n ans = 'Yes'\r\n else:\r\n ans = 'No'\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "\n# coding: utf-8\n\n# In[6]:\n\nvec = input()\nveca = input()\nvecb = input()\nvec = vec.split(\" \")\nveca = veca.split(\" \")\nvecb = vecb.split(\" \")\nvecb2 =[]\nveca2 =[]\nveca3 =[]\nveca4 =[]\ni=0\npos = 0\nhacer = 1\n\n\nif len(vecb)>=2:\n print(\"Yes\")\nelse:\n while(1):\n if len(veca)==i:\n break\n if int(veca[i]) > 0:\n veca2.append(veca[i])\n i= i+1\n i=0\n while(1):\n if len(veca2)==i:\n break\n if i<len(veca2)-1:\n if int(veca2[i])>int(veca2[i+1]):\n print(\"Yes\")\n hacer = 0\n break \n i= i+1\n \n if hacer == 1:\n i=0\n while(1):\n if len(veca)==i:\n break\n if int(veca[i])==0:\n veca3.append(int(vecb[0])) \n else:\n veca3.append(int(veca[i]))\n i = i+1\n\n veca4 = sorted(veca3)\n\n if veca4 == veca3:\n print(\"No\")\n else:\n print(\"Yes\") \n \n \n \n\n \n\n\n# In[ ]:\n\n\n\n", "n, k = map(int, input().split())\nN = list(map(int, input().split()))\nK = list(map(int, input().split()))\nK.sort(reverse=True)\nfor i in range(k):\n N[N.index(0)] = K[i]\nfor j in range(1, n):\n if N[j] < N[j - 1]:\n print('Yes')\n break\n if j == n - 1:\n print('No')\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\ni=0\r\nfor j in range(n):\r\n\tif(a[j]==0):\r\n\t\ta[j]=b[i]\r\n\t\ti=i+1\r\nd=[a[j] for j in range(n)]\r\na.sort()\r\nif(a==d):\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "def checker(L):\n\treturn all(x<y for x, y in zip(L, L[1:]))\nR = lambda: map(int,input().split())\nn, k = R()\na = list(R())\nb = list(R())\n\nb.sort(reverse=True)\nfor i in range(n):\n\tif a[i] in b:\n\t\texit(print('No'))\n\n\tif a[i] == 0:\n\t\ta[i] = b[0]\n\t\tdel b[0]\nprint('No' if checker(a) else 'Yes')\n\t\t \n\n \n" ]

[ "usb, ps, both = map(int, input().split())\r\na, b = [], []\r\nmax_, total = 0, 0\r\n \r\nfor _ in range(int(input())):\r\n cost, type = input().split()\r\n if type == 'USB':\r\n a.append(int(cost))\r\n else:\r\n b.append(int(cost))\r\n\r\na = sorted(a, reverse=True)\r\nb = sorted(b, reverse=True)\r\n \r\nwhile usb and a:\r\n usb -= 1\r\n total += a.pop()\r\n max_ += 1\r\n \r\nwhile ps and b:\r\n ps -= 1\r\n total += b.pop()\r\n max_ += 1\r\n \r\nrem = sorted(a + b, reverse=True)\r\nwhile both and rem:\r\n both -= 1\r\n total += rem.pop()\r\n max_ += 1\r\n\r\nprint(max_, total)\r\n", "if __name__ == \"__main__\":\n usb = []\n ps2 = []\n # So the idea is going to be to read the inputs and check which one to save it to\n a,b,c = map(int,input().split())\n n = int(input())\n if (n == 0):\n print(\"{0} {1}\".format(0,0))\n else:\n # Check the inputs in range of n\n for i in range(n):\n price, connector = input().split()\n price = int(price)\n # Lets check the type of connector\n if connector == \"USB\":\n usb.append(price)\n else:\n ps2.append(price)\n # Lets sort both lists\n usb.sort()\n ps2.sort()\n \n # Lets obtain the smallest number between the n of mice to buy and their lists of available mice\n n_usb = min(a, len(usb))\n n_ps2 = min(b ,len(ps2))\n \n # This list will contain all the remaining mice that can be bought for the mixed computers\n m_remaining = usb[n_usb:] + ps2[n_ps2:]\n m_remaining.sort()\n \n # We find the amount of mice we have to buy, be it c or the length of the list, whichever is smaller\n n_remaining = min( len(m_remaining), c)\n \n # We create the variables that represent the total amount of bought mice and the price to play for all of them\n final_amount = n_usb + n_ps2 + n_remaining\n final_price = sum(usb[:n_usb]) + sum(ps2[:n_ps2]) + sum(m_remaining[:n_remaining]) \n print(\"{0} {1}\".format(final_amount, final_price))\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[a, b, c] = list(map(int, input().split()))\r\nm = int(input())\r\nusb = []\r\nps2 = []\r\nfor i in range(m):\r\n [x, y] = list(map(str, input().split()))\r\n if y == 'USB':\r\n usb.append(int(x))\r\n else:\r\n ps2.append(int(x))\r\nusb.sort()\r\nps2.sort()\r\n\r\ncnt = 0\r\ncost = 0\r\n\r\np = min(a, len(usb))\r\ncnt += p\r\nfor i in range(p):\r\n cost += usb[i]\r\n\r\nq = min(b, len(ps2))\r\ncnt += q\r\nfor i in range(q):\r\n cost += ps2[i]\r\n\r\ncombine = []\r\nfor i in range(p, len(usb)):\r\n combine.append(usb[i])\r\nfor i in range(q, len(ps2)):\r\n combine.append(ps2[i])\r\ncombine.sort()\r\n\r\nr = min(c, len(combine))\r\ncnt += r\r\nfor i in range(r):\r\n cost += combine[i]\r\n\r\nprint(' '.join(map(str, [cnt, cost])))\r\n", "u,p,b=map(int,input().split())\r\nn = int(input())\r\narr = [];cnt=0;m=0\r\nfor i in range (n):\r\n a,bb=input().split()\r\n arr.append([int(a),bb])\r\narr = sorted(arr)\r\nfor i in range(n):\r\n if arr[i][1]=='USB' and u!=0:\r\n u-=1 ; cnt+=arr[i][0];m +=1\r\n elif arr[i][1]=='PS/2' and p!=0:\r\n p-= 1; cnt += arr[i][0]; m += 1\r\n elif (arr[i][1]=='PS/2' or arr[i][1]=='USB') and b!=0:\r\n b -= 1;cnt += arr[i][0];m += 1\r\nprint(m,cnt)", "a,b,c=map(int,input().split())\r\nm=int(input())\r\nusb=[]\r\nps=[]\r\nfor i in range(m):\r\n s,x=input().split()\r\n if x=='USB':\r\n usb.append(int(s))\r\n else:\r\n ps.append(int(s))\r\nusb.sort()\r\nps.sort()\r\ncnt=0\r\nfg=0\r\nif a>=len(usb):\r\n cnt+=sum(usb)\r\n fg+=len(usb)\r\n usb=[]\r\nelse:\r\n cnt+=sum(usb[:a])\r\n fg+=a\r\n usb=usb[a:]\r\nif b>=len(ps):\r\n cnt+=sum(ps)\r\n fg+=len(ps)\r\n ps=[]\r\nelse:\r\n cnt+=sum(ps[:b])\r\n fg+=b\r\n ps=ps[b:]\r\nboth=usb+ps\r\nif len(both)==0:\r\n print(fg,cnt)\r\nelse:\r\n both.sort()\r\n k=min(c,len(both))\r\n cnt+=sum(both[:k])\r\n fg+=min(c,len(both))\r\n print(fg,cnt)", "import heapq\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\nm = int(input())\r\nx, y = [], []\r\nfor _ in range(m):\r\n val, t = input().rstrip().split()\r\n val = int(val)\r\n if t == \"USB\":\r\n heapq.heappush(x, val)\r\n else:\r\n heapq.heappush(y, val)\r\ns, cost = 0, 0\r\nx0 = min(a, len(x))\r\ns += x0\r\nfor _ in range(x0):\r\n cost += heapq.heappop(x)\r\ny0 = min(b, len(y))\r\ns += y0\r\nfor _ in range(y0):\r\n cost += heapq.heappop(y)\r\ninf = pow(10, 9) + 7\r\nl = min(c, len(x) + len(y))\r\ns += l\r\nheapq.heappush(x, inf)\r\nheapq.heappush(y, inf)\r\nfor _ in range(l):\r\n if x[0] <= y[0]:\r\n cost += heapq.heappop(x)\r\n else:\r\n cost += heapq.heappop(y)\r\nprint(s, cost)", "import sys\r\n\r\n\r\na, b, c = map(int, next(sys.stdin).split())\r\n\r\nmouses = {\"USB\": [], \"PS/2\": []}\r\nfor _ in range(int(input())):\r\n value, key = next(sys.stdin).strip().split()\r\n mouses[key].append(int(value))\r\n\r\nfor key in mouses.keys():\r\n mouses[key].sort()\r\n\r\nusb, ps = min(a, len(mouses['USB'])), min(b, len(mouses['PS/2']))\r\nremains = list(sorted(mouses['USB'][usb:] + mouses['PS/2'][ps:]))\r\nboth = min(c, len(remains))\r\n\r\ncost = sum(mouses[\"USB\"][:usb]) + sum(mouses['PS/2'][:ps]) + sum(remains[:both])\r\nprint(usb + ps + both, cost)\r\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n\r\n# n = int(input())\r\n# l1 = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# s = input()\r\nmod = 1000000007\r\n# print(\"Case #\"+str(_+1)+\":\",)\r\n\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import heappush,heappop,heapify\r\nimport sys\r\nimport math\r\nimport bisect\r\n\r\nfor _ in range(1):\r\n a,b,c = map(int,input().split())\r\n m = int(input())\r\n u = [] ; p= []\r\n for i in range(m):\r\n d,e = map(str,input().split())\r\n if e == \"USB\":\r\n u.append(int(d))\r\n else:\r\n p.append(int(d))\r\n u.sort()\r\n p.sort()\r\n i = 0\r\n co = 0\r\n ans = 0;price = 0\r\n while(i<len(u) and co<a):\r\n ans+=1\r\n price+=u[i]\r\n co+=1\r\n i+=1\r\n #print(ans,price)\r\n j = 0\r\n co = 0\r\n while(j<len(p) and co<b):\r\n ans+=1\r\n price+=p[j]\r\n co+=1\r\n j+=1\r\n #print(ans,price)\r\n co = 0\r\n while((i<len(u) or j<len(p)) and co<c):\r\n if i==len(u):\r\n ans+=1\r\n price+=p[j]\r\n co+=1\r\n j+=1\r\n elif j==len(p):\r\n ans+=1\r\n price+=u[i]\r\n co+=1\r\n i+=1\r\n else:\r\n if u[i]<p[j]:\r\n price+=u[i]\r\n ans+=1\r\n i+=1\r\n else:\r\n price+=p[j]\r\n ans+=1\r\n j+=1\r\n co+=1\r\n print(ans,price)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "import sys\r\n#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\n#from math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\nmod = 10**9 + 7\r\n\r\na,p,c = il()\r\nb = []\r\nm = ii()\r\n\r\nfor i in range (m) :\r\n x,y = ip().split()\r\n b.append([int(x),y])\r\n\r\nb.sort()\r\n\r\nt = 0\r\ncnt = 0\r\n\r\n#print(b)\r\n\r\nfor i in range (m) :\r\n if (b[i][1] == \"USB\" and a != 0) :\r\n a -= 1\r\n t += b[i][0]\r\n cnt += 1\r\n\r\n elif (b[i][1] == \"PS/2\" and p != 0) :\r\n p -= 1\r\n t += b[i][0]\r\n cnt += 1\r\n elif (c != 0) :\r\n c -= 1\r\n t += b[i][0]\r\n cnt += 1\r\n\r\n #print(cnt,t)\r\n\r\nprint(cnt,t)\r\n \r\n\r\n \r\n \r\n", "def main():\r\n usb_only_computers, ps2_only_computers, mutual_computers = map(int, input().split())\r\n number_of_cables = int(input())\r\n\r\n usbs_available, ps2s_available = [], []\r\n\r\n for _ in range(number_of_cables):\r\n cost, type = input().split()\r\n cost = int(cost)\r\n\r\n if type == \"USB\":\r\n usbs_available.append(cost)\r\n\r\n elif type == \"PS/2\":\r\n ps2s_available.append(cost)\r\n\r\n computers_equipped = 0\r\n price = 0\r\n\r\n if len(usbs_available) <= usb_only_computers:\r\n price += sum(usbs_available)\r\n computers_equipped += len(usbs_available)\r\n usbs_available = []\r\n\r\n else:\r\n usbs_available.sort(reverse=True)\r\n\r\n for _ in range(usb_only_computers):\r\n price += usbs_available[-1]\r\n usbs_available.pop()\r\n\r\n computers_equipped += usb_only_computers\r\n\r\n if len(ps2s_available) <= ps2_only_computers:\r\n price += sum(ps2s_available)\r\n computers_equipped += len(ps2s_available)\r\n ps2s_available = []\r\n\r\n else:\r\n ps2s_available.sort(reverse=True)\r\n\r\n for _ in range(ps2_only_computers):\r\n price += ps2s_available[-1]\r\n ps2s_available.pop()\r\n\r\n computers_equipped += ps2_only_computers\r\n\r\n cables_remaining = usbs_available + ps2s_available\r\n\r\n if len(cables_remaining) <= mutual_computers:\r\n price += sum(cables_remaining)\r\n computers_equipped += len(cables_remaining)\r\n\r\n else:\r\n cables_remaining.sort()\r\n price += sum(cables_remaining[: mutual_computers])\r\n computers_equipped += mutual_computers\r\n\r\n print(f\"{computers_equipped} {price}\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nusb, ps, both = map(int, input().split())\r\na, b = array('i'), array('i')\r\nmax_, total = 0, 0\r\n\r\nfor _ in range(int(input())):\r\n cost, type = input().split()\r\n if type == 'USB':\r\n a.append(int(cost))\r\n else:\r\n b.append(int(cost))\r\n\r\na = array('i', sorted(a))[::-1]\r\nb = array('i', sorted(b))[::-1]\r\n\r\nwhile usb and a:\r\n usb -= 1\r\n total += a.pop()\r\n max_ += 1\r\n\r\nwhile ps and b:\r\n ps -= 1\r\n total += b.pop()\r\n max_ += 1\r\n\r\nrem = array('i', sorted(a + b))[::-1]\r\nwhile both and rem:\r\n both -= 1\r\n total += rem.pop()\r\n max_ += 1\r\nprint(max_, total)\r\n", "a, b, c = map(int, input().split())\r\nm = int(input())\r\nm1 = []\r\nm2 = []\r\nfor i in range(m):\r\n\ts = input().split(' ')\r\n\tif s[1] == \"USB\":\r\n\t\tm1.append(int(s[0]))\r\n\telse:\r\n\t\tm2.append(int(s[0]))\r\nm1 = sorted(m1)\r\nm2 = sorted(m2)\r\n\r\nm3 = []\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(len(m1)):\r\n\tif a == 0:\r\n\t\tfor j in range(i, len(m1)):\r\n\t\t\tm3.append(m1[j])\r\n\t\tbreak\r\n\tans1+=1\r\n\tans2 += m1[i];\r\n\ta-=1\r\nfor i in range(len(m2)):\r\n\tif b == 0:\r\n\t\tfor j in range(i, len(m2)):\r\n\t\t\tm3.append(m2[j])\r\n\t\tbreak\r\n\tans1+=1\r\n\tans2 += m2[i];\r\n\tb-=1\r\nm3 = sorted(m3)\r\nfor i in range(len(m3)):\r\n\tif c == 0:\r\n\t\tbreak\r\n\tans1+=1\r\n\tans2 += m3[i]\r\n\tc-=1\r\n\r\nprint(str(ans1) + \" \" + str(ans2))", "a,b,c=map(int,input().split())\r\nl1,l2=[],[]\r\nfor _ in range(int(input())):\r\n I=input().split()\r\n if I[1]=='USB':l1.append(int(I[0]))\r\n else:l2.append(int(I[0]))\r\nl1.sort()\r\nl2.sort()\r\nx,y=min(len(l1),a),min(len(l2),b)\r\nres=sum(l1[:x])+sum(l2[:y])\r\nl3=l1[x:]+l2[y:]\r\nl3.sort()\r\nz=min(len(l3),c)\r\nres+=sum(l3[:z])\r\nprint(x+y+z,res)", "a, b, c = map(int, input().split())\r\nn = int(input())\r\nusb = []\r\nps = []\r\nfor i in range(n):\r\n\tk, t = input().strip().split()\r\n\tif t == 'USB':\r\n\t\tusb.append(int(k))\r\n\telse:\r\n\t\tps.append(int(k))\r\nusb = sorted(usb)\r\nps = sorted(ps)\r\neq, tot = 0, 0\r\nif len(usb) < a:\r\n\teq += len(usb)\r\n\ttot += sum(usb)\r\n\tusb = []\r\nelse:\r\n\teq += a\r\n\ttot += sum(usb[:a])\r\n\tusb = usb[a:]\r\nif len(ps) < b:\r\n\teq += len(ps)\r\n\ttot += sum(ps)\r\n\tps = []\r\nelse:\r\n\teq += b\r\n\ttot += sum(ps[:b])\r\n\tps = ps[b:]\r\nusb = sorted(usb + ps)\r\nif len(usb) < c:\r\n\teq += len(usb)\r\n\ttot += sum(usb)\r\nelse:\r\n\teq += c\r\n\ttot += sum(usb[:c])\r\nprint('{} {}'.format(eq, tot))\r\n\r\n", "a,b,c=map(int,input().split())\r\nm=int(input())\r\nu=[]\r\np=[]\r\nx=0\r\ny=0\r\nfor i in range(m):\r\n s=input().split()\r\n if s[1]=='USB':\r\n u.append(int(s[0]))\r\n else:\r\n p.append(int(s[0]))\r\nu.sort()\r\np.sort()\r\nu.reverse()\r\np.reverse()\r\nwhile u and a:\r\n a-=1\r\n y+=u[-1]\r\n u.pop()\r\n x+=1\r\nwhile p and b:\r\n b-=1\r\n y+=p[-1]\r\n p.pop()\r\n x+=1\r\nu+=p\r\nu.sort()\r\nu.reverse()\r\nwhile u and c:\r\n c-=1\r\n y+=u[-1]\r\n u.pop()\r\n x+=1\r\nprint(x,y)\r\n \r\n", "import sys\r\n\r\n# sys.stdin = open(\"1.in\", \"r\")\r\n\r\nusb_n, ps_n, both_n = map(int, input().split())\r\nm = int(input())\r\n\r\nmouses = []\r\nfor _ in range(m):\r\n words = input().split();\r\n mouses.append((int(words[0]), words[1]))\r\n\r\nmouses.sort()\r\n\r\ntotal_num = 0\r\ntotal_cost = 0\r\n\r\ndef buy(price):\r\n global total_cost, total_num\r\n total_cost += price\r\n total_num += 1\r\n\r\nfor price, type in mouses:\r\n if type=='USB':\r\n if usb_n>0:\r\n buy(price)\r\n usb_n -= 1\r\n elif both_n>0:\r\n buy(price)\r\n both_n -= 1\r\n else:\r\n if ps_n>0:\r\n buy(price)\r\n ps_n -= 1\r\n elif both_n>0:\r\n buy(price)\r\n both_n -= 1\r\n\r\nprint(total_num, total_cost)\r\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nnum_usb, num_ps, num_both = map(int, input().split())\nm = int(input())\n\nusb = []\nps = []\n\nfor _ in range(m):\n c, con = input().rstrip().split()\n c = int(c)\n if con == \"USB\":\n usb.append(c)\n else:\n ps.append(c)\n\nusb.sort(reverse=True)\nps.sort(reverse=True)\n\ncost = 0\ncount = 0\n\nwhile num_usb and usb:\n num_usb -= 1\n cost += usb.pop()\n count += 1\n\nwhile num_ps and ps:\n num_ps -= 1\n cost += ps.pop()\n count += 1\n\nusb.extend(ps)\nboth = usb\nboth.sort(reverse=True)\n\nwhile num_both and usb:\n num_both -= 1\n cost += both.pop()\n count += 1\n\nprint(count, cost)\n\n", "import math\r\nimport bisect\r\nfrom collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\na,b,c=M()\r\nn=I();u=[];p=[]\r\nfor i in range(n):\r\n n,k=map(str,input().split())\r\n if k[0]==\"U\":u+=[int(n)]\r\n else:p+=[int(n)]\r\nu.sort();p.sort()\r\nans=0;ch=0\r\nfor i in range(min(a,len(u))):\r\n ans+=u[i];ch+=1\r\nfor i in range(min(b,len(p))):\r\n ans+=p[i];ch+=1\r\nd=u[min(a,len(u))::]+p[min(b,len(p))::]\r\nd.sort()\r\nfor i in range(min(c,len(d))):\r\n ans+=d[i];ch+=1\r\nprint(ch,ans)\r\n\r\n\r\n", "a,b,c=map(int,input().split())\r\np=[[],[]]\r\nfor _ in range(int(input())):\r\n g=[el for el in input().split()]\r\n if g[1]==\"USB\":\r\n p[0].append(int(g[0]))\r\n else:\r\n p[1].append(int(g[0]))\r\nfor el in p:\r\n if el:\r\n el.sort()\r\n \r\na1=p[0]\r\na1=a1[::-1]\r\na2=p[1]\r\na2=a2[::-1]\r\nans=0\r\np=0\r\nwhile a and a1:\r\n ans+=a1.pop()\r\n a-=1\r\n p+=1\r\nwhile b and a2:\r\n ans+=a2.pop()\r\n b-=1\r\n p+=1\r\nwhile c and (a1 or a2):\r\n if not a1 :\r\n p+=1\r\n c-=1\r\n ans+=a2.pop()\r\n elif not a2:\r\n ans+=a1.pop()\r\n p+=1\r\n c-=1\r\n elif a1[-1]<=a2[-1]:\r\n ans+=a1.pop()\r\n p+=1\r\n c-=1\r\n else:\r\n ans+=a2.pop()\r\n p+=1\r\n c-=1\r\nprint(p,ans)\r\n \r\n \r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport sys\r\nimport string\r\nimport random\r\nfrom typing import List\r\nsys.setrecursionlimit(99999)\r\n\r\na,b,c = map(int,input().split())\r\nm = int(input())\r\nps = [[],[]]\r\nfor _ in range(m):\r\n x,y = input().split()\r\n if y=='USB':\r\n ps[0].append(int(x))\r\n else:\r\n ps[1].append(int(x))\r\nps[0].sort()\r\nps[1].sort()\r\nu1,u2 = len(ps[0]),len(ps[1])\r\ns,su = 0,0\r\nl1 = min(a,u1)\r\ns+=l1\r\nu1-=l1\r\nl2 = min(b,u2)\r\ns+=l2\r\nu2-=l2\r\nl3 = min(c,u1+u2)\r\ns+=l3\r\n\r\nans = 0\r\ni1,i2 = 0,0\r\nwhile i1<l1:\r\n ans += ps[0][i1]\r\n i1+=1\r\nwhile i2<l2:\r\n ans+= ps[1][i2]\r\n i2+=1\r\ncnt = 0\r\nwhile cnt<l3:\r\n if i1<len(ps[0]) and i2<len(ps[1]):\r\n if ps[0][i1]<=ps[1][i2]:\r\n ans += ps[0][i1]\r\n i1+=1\r\n else:\r\n ans += ps[1][i2]\r\n i2+=1\r\n elif i1<len(ps[0]):\r\n ans += ps[0][i1]\r\n i1+=1\r\n else:\r\n ans+=ps[1][i2]\r\n i2+=1\r\n cnt+=1\r\n\r\nprint(s,ans)", "import math\nimport re\n\na, b, c = map(int, input().split())\nq = 0\nres = 0\nval = int(input())\n\nusb = []\nps2 = []\nfor i in range(val):\n x, y = input().split()\n if y == 'USB':\n usb.append(int(x))\n else:\n ps2.append(int(x))\n\nusb = sorted(usb)\nps2 = sorted(ps2)\n\n\nres += sum(usb[:min(len(usb), a)])\nq += min(len(usb), a)\ndel(usb[:min(len(usb), a)])\n\n\n\nres += sum(ps2[:min(len(ps2), b)])\nq += min(len(ps2), b)\ndel(ps2[:min(len(ps2), b)])\n\n\n\nusb = sorted(usb + ps2)\n\nres += sum(usb[:min(len(usb), c)])\nq += min(len(usb), c)\n\n\nprint(str(q) + ' ' + str(res))", "usb,ps,com = map(int,input().split())\r\nN = int(input())\r\npricing = []\r\nfor i in range(N):\r\n p,info = input().split()\r\n pricing.append([int(p),info])\r\nprice = 0\r\ntotal = 0\r\npricing.sort()\r\nfor i in range(N):\r\n if usb>0:\r\n if pricing[i][1] == 'USB':\r\n price+=pricing[i][0]\r\n usb-=1\r\n total += 1\r\n pricing[i][1] = 'None'\r\nfor i in range(N):\r\n if ps>0:\r\n if pricing[i][1] == 'PS/2':\r\n price+=pricing[i][0]\r\n ps-=1\r\n total += 1\r\n pricing[i][1] = 'None'\r\nfor i in range(N):\r\n if com>0:\r\n if pricing[i][1] == 'USB'or pricing[i][1] == 'PS/2':\r\n price+=pricing[i][0]\r\n com-=1\r\n total += 1\r\nprint(total,price)", "import sys\n\nusb,ps,pc = map(int,sys.stdin.readline().split())\nn = int(sys.stdin.readline())\n\n'''\n2 1 1\n4\n5 USB\n6 PS/2\n3 PS/2\n7 PS/2\n'''\n\ndef find(usb,ps,pc,n):\n buy = 0\n price=0\n usbs = []\n pss = []\n for req_num in range(n):\n req = sys.stdin.readline().strip().split()\n req[0] = int(req[0])\n if req[1] == 'USB':\n usbs.append(req[0])\n else:\n pss.append(req[0])\n usbs.sort()\n pss.sort()\n min_usb_bord = min(len(usbs),usb)\n min_ps_bord = min(len(pss),ps)\n pos_usb = 0\n pos_pss = 0\n while pos_usb<min_usb_bord:\n buy+=1\n price+=usbs[pos_usb]\n pos_usb+=1\n while pos_pss<min_ps_bord:\n buy+=1\n price+=pss[pos_pss]\n pos_pss+=1\n while pos_usb<len(usbs) and pos_pss<len(pss) and pc>0:\n if usbs[pos_usb] < pss[pos_pss]:\n price+=usbs[pos_usb]\n pos_usb+=1\n else:\n price+=pss[pos_pss]\n pos_pss+=1\n pc-=1\n buy+=1\n while pos_usb<len(usbs) and pc>0:\n price+=usbs[pos_usb]\n buy+=1\n pos_usb+=1\n pc-=1\n while pos_pss<len(pss) and pc>0:\n price+=pss[pos_pss]\n buy+=1\n pos_pss+=1\n pc-=1\n return [buy, price]\n \n\nret = find(usb,ps,pc,n)\nprint(ret[0],ret[1])", "a, b, c = [int(i) for i in input().split()]\r\n\r\n#usb = a\r\n#ps = b\r\n#both = c\r\n\r\nn = int(input())\r\nA = []\r\n\r\nps = []\r\nusb = []\r\nfor i in range(n):\r\n s = input().split()\r\n s[0] = int(s[0])\r\n if s[1] == \"USB\":\r\n usb.append(s[0])\r\n else:\r\n ps.append(s[0])\r\n #s[0], s[1] = s[1], s[0]\r\n# A.append(s)\r\n\r\n#A.sort()\r\n\r\nps.sort()\r\nusb.sort()\r\n\r\nusbptr = 0\r\npsptr = 0\r\n\r\ntotalnum = 0\r\ntotalcost = 0\r\n\r\nfor i in range(a):\r\n if usbptr < len(usb):\r\n totalcost += usb[usbptr]\r\n usbptr+=1\r\n totalnum+=1\r\n elif usbptr == len(usb):\r\n break\r\n\r\nfor i in range(b):\r\n if psptr < len(ps):\r\n totalcost += ps[psptr]\r\n psptr+=1\r\n totalnum+=1\r\n elif psptr == len(ps):\r\n break\r\n\r\nfor i in range(c):\r\n if usbptr < len(usb) and psptr < len(ps):\r\n if usb[usbptr] < ps[psptr]:\r\n totalcost += usb[usbptr]\r\n usbptr+=1\r\n totalnum+=1\r\n else:\r\n totalcost += ps[psptr]\r\n psptr+=1\r\n totalnum+=1\r\n \r\n elif usbptr==len(usb) and psptr<len(ps):\r\n totalcost += ps[psptr]\r\n psptr+=1\r\n totalnum+=1\r\n elif usbptr<len(usb) and psptr == len(ps):\r\n totalcost += usb[usbptr]\r\n usbptr+=1\r\n totalnum+=1\r\n else:\r\n break\r\nprint(totalnum, totalcost)\r\n", "a,b,c=map(int,input().split())\r\nn=int(input())\r\nx=[]\r\ny=[]\r\nfor _ in range(n):\r\n v,s=input().split()\r\n v=int(v)\r\n if s=='USB':x.append(v)\r\n else:y.append(v)\r\nx.sort()\r\ny.sort()\r\nu=min(a,len(x))+min(b,len(y))\r\nz=x[a:]+y[b:]\r\nz.sort()\r\nu+=min(c,len(z))\r\nans=sum(x[:a])+sum(y[:b])+sum(z[:c])\r\nprint(u,ans)\r\n", "a,b,c=map(int,input().split())\r\nm=int(input())\r\nusb,ps2=[],[]\r\nfor i in range(m):\r\n s=input().split()\r\n if s[1]==\"USB\":\r\n usb.append(int(s[0]))\r\n else:\r\n ps2.append(int(s[0]))\r\nusb.sort(); ps2.sort();\r\nkusb,kps2=min(a,len(usb)),min(b,len(ps2))\r\nkans=kusb+kps2\r\nsans=sum(usb[:kusb])+sum(ps2[:kps2])\r\nother=usb[kusb:]+ps2[kps2:]\r\nother.sort()\r\nkother=min(c,len(other))\r\nkans+=kother\r\nsans+=sum(other[:kother])\r\nprint(str(kans)+' '+str(sans))\r\n", "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nimport time\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\nwrite=sys.stdout.write\r\n\r\nA,B,C=map(int,readline().split())\r\nM=int(readline())\r\nUSB,PS2=[],[]\r\nfor m in range(M):\r\n val,s=readline().split()\r\n val=int(val)\r\n if s==\"USB\":\r\n USB.append(val)\r\n else:\r\n PS2.append(val)\r\nUSB.sort()\r\nPS2.sort()\r\nle_USB=min(A,len(USB))\r\nle_PS2=min(B,len(PS2))\r\nprint(le_USB+le_PS2+min(len(USB)+len(PS2)-le_USB-le_PS2,C),sum(sorted((USB[le_USB:]+PS2[le_PS2:]))[:C]+USB[:le_USB]+PS2[:le_PS2]))\r\n", "usb_only_cnt, ps2_only_cnt, versatile_cnt = map(int, input().split())\r\n\r\nwires_cnt = int(input())\r\nusb_prices = []\r\nps2_prices = []\r\n\r\nfor _ in range(wires_cnt):\r\n tokens = input().split()\r\n if tokens[1] == 'USB':\r\n usb_prices.append(int(tokens[0]))\r\n else:\r\n ps2_prices.append(int(tokens[0]))\r\n\r\nusb_prices.sort()\r\nps2_prices.sort()\r\n\r\nusb_i = min(len(usb_prices), usb_only_cnt)\r\nps2_i = min(len(ps2_prices), ps2_only_cnt)\r\n\r\nfor _ in range(versatile_cnt):\r\n if usb_i == len(usb_prices) and ps2_i == len(ps2_prices):\r\n break\r\n elif usb_i == len(usb_prices):\r\n ps2_i += 1\r\n elif ps2_i == len(ps2_prices):\r\n usb_i += 1\r\n elif usb_prices[usb_i] < ps2_prices[ps2_i]:\r\n usb_i += 1\r\n else:\r\n ps2_i += 1\r\n\r\nprint(usb_i + ps2_i, sum(usb_prices[:usb_i]) + sum(ps2_prices[:ps2_i]))\r\n\r\n", "import sys\r\nimport io, os\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n a, b, c = map(int, input().split())\r\n m = int(input())\r\n A = []\r\n B = []\r\n for i in range(m):\r\n v, t = map(str, input().split())\r\n v = int(v)\r\n if t == 'USB':\r\n A.append(v)\r\n else:\r\n B.append(v)\r\n\r\n A.sort(reverse=True)\r\n B.sort(reverse=True)\r\n ans = 0\r\n cost = 0\r\n for i in range(a):\r\n if A:\r\n v = A.pop()\r\n cost += v\r\n ans += 1\r\n else:\r\n break\r\n for i in range(b):\r\n if B:\r\n v = B.pop()\r\n cost += v\r\n ans += 1\r\n else:\r\n break\r\n C = A+B\r\n C.sort(reverse=True)\r\n for i in range(c):\r\n if C:\r\n v = C.pop()\r\n cost += v\r\n ans += 1\r\n else:\r\n break\r\n print(ans, cost)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import deque\n\n\nclass CodeforcesTask762BSolution:\n def __init__(self):\n self.result = ''\n self.a_b_c = []\n self.m = 0\n self.prices = []\n\n def read_input(self):\n self.a_b_c = [int(x) for x in input().split(\" \")]\n self.m = int(input())\n for _ in range(self.m):\n self.prices.append(input().split(\" \"))\n self.prices[-1][0] = int(self.prices[-1][0])\n self.prices[-1][1] = 0 if self.prices[-1][1] == \"USB\" else 1\n\n def process_task(self):\n prices1 = [x[0] for x in self.prices if not x[1]]\n prices2 = [x[0] for x in self.prices if x[1]]\n prices1.sort()\n prices2.sort()\n equipped = 0\n cost = 0\n prices1 = deque(prices1)\n prices2 = deque(prices2)\n while prices1 and self.a_b_c[0]:\n equipped += 1\n cost += prices1.popleft()\n #print(cost)\n self.a_b_c[0] -= 1\n while prices2 and self.a_b_c[1]:\n equipped += 1\n cost += prices2.popleft()\n #print(cost)\n self.a_b_c[1] -= 1\n while (prices1 or prices2) and self.a_b_c[2]:\n equipped += 1\n self.a_b_c[2] -= 1\n if prices1 and prices2:\n if prices1[0] <= prices2[0]:\n cost += prices1.popleft()\n else:\n cost += prices2.popleft()\n elif prices1:\n cost += prices1.popleft()\n else:\n cost += prices2.popleft()\n #print(cost)\n self.result = f\"{equipped} {cost}\"\n\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask762BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from collections import defaultdict, deque\r\nfrom heapq import heapify, heappop, heappush\r\nfrom functools import lru_cache\r\nimport threading\r\nfrom sys import stdin, stdout, setrecursionlimit\r\n\r\ndef inp(): return stdin.readline()\r\ndef inpnum(): return int(stdin.readline())\r\ndef inpli(): return list(map(int, stdin.readline().strip().split()))\r\ndef inpst():\r\n s = stdin.readline().strip()\r\n return list(s[:len(s)])\r\ndef inpnums(): return map(int, stdin.readline().strip().split())\r\n\r\n\r\ndef main():\r\n \r\n u, p, both = inpnums()\r\n m = inpnum()\r\n\r\n l_u = []\r\n l_p = []\r\n\r\n for _ in range(m):\r\n cost, label = input().split()\r\n if label[0] == \"U\":\r\n l_u.append(int(cost))\r\n else:\r\n l_p.append(int(cost))\r\n \r\n l_u.sort(reverse=True)\r\n l_p.sort(reverse=True)\r\n\r\n count = 0\r\n cost = 0\r\n\r\n while u and l_u:\r\n count += 1\r\n cost += l_u.pop()\r\n u -= 1\r\n \r\n while p and l_p:\r\n count += 1\r\n cost += l_p.pop()\r\n p -= 1\r\n \r\n combined = l_u + l_p\r\n\r\n if combined:\r\n combined.sort(reverse=True)\r\n while both and combined:\r\n count += 1\r\n cost += combined.pop()\r\n both -= 1\r\n \r\n print(count, cost)\r\n return\r\n\r\nmain()", "a, b, c = map(int, input().split())\r\nn = int(input())\r\nu, p = [], []\r\nfor i in range(n):\r\n v, t = input().split()\r\n v = int(v)\r\n if t[0] == 'U':\r\n u.append(v)\r\n else:\r\n p.append(v)\r\n\r\nu = sorted(u)\r\np = sorted(p)\r\ns = 0\r\nmod = []\r\nk = 0\r\nif len(u) < a:\r\n s += sum(u)\r\n k += len(u)\r\nelse:\r\n s += sum(u[:a])\r\n mod += u[a:]\r\n k += a\r\n\r\n\r\nif len(p) < b:\r\n s += sum(p)\r\n k += len(p)\r\nelse:\r\n s += sum(p[:b])\r\n mod += p[b:]\r\n k += b\r\n\r\nif len(mod) < c:\r\n s += sum(mod)\r\n k += len(mod)\r\n print(k, s)\r\nelse:\r\n mod = sorted(mod)\r\n s += sum(mod[:c])\r\n k += c\r\n print(k, s)\r\n", "a,b,c=map(int,input().split())\r\nd={'USB':[],'PS/2':[]}\r\nm=int(input())\r\nfor i in range(m):\r\n f,e=input().split()\r\n if e=='USB':\r\n d['USB'].append(int(f))\r\n else:\r\n d['PS/2'].append(int(f))\r\nu=sorted(d['USB'])\r\nv=sorted(d['PS/2'])\r\ni=len(d['USB'])\r\nj=len(d['PS/2'])\r\nt=0\r\ns=0\r\nif i<=a:\r\n s+=sum(u)\r\n t+=i\r\n u=[]\r\nelse:\r\n s+=sum(u[:a])\r\n t+=a\r\n u=u[a:]\r\nif j<=b:\r\n s+=sum(v)\r\n t+=j\r\n v=[]\r\nelse:\r\n s+=sum(v[:b])\r\n t+=b\r\n v=v[b:]\r\ng=sorted(u+v)\r\nif len(g)<=c:\r\n s+=sum(g)\r\n t+=len(g)\r\nelse:\r\n s+=sum(g[:c])\r\n t+=c\r\nprint(t,s)\r\n", "import sys\n\ninput = sys.stdin.readline\n\ntest = False\n\nmod1, mod2 = 10 ** 9 + 7, 998244353\ninf = 10 ** 18 + 5\n\n\ndef test_case():\n\n a, b, c = map(int, input().split())\n m = int(input())\n\n mouse = []\n\n for i in range(m):\n\n val, port = input().split()\n\n val = int(val)\n port = port.rstrip('\\n')\n\n mouse.append((val, port))\n\n mouse.sort()\n\n cost = 0\n aa, bb, cc = a, b, c\n\n for (add, p) in mouse:\n\n if p == 'USB':\n\n if a:\n\n cost += add\n a -= 1\n elif c:\n\n cost += add\n c -= 1\n else:\n\n if b:\n\n cost += add\n b -= 1\n elif c:\n\n cost += add\n c -= 1\n\n print((aa - a) + (bb - b) + (cc - c), cost)\n\n\nt = 1\n\nif test:\n\n t = int(input())\n\nfor _ in range(t):\n\n # print(f\"Case #{_+1}: \")\n test_case()\n", "import sys\r\n\r\na, b, c = map(int, input().split())\r\nm = int(input())\r\nusb, ps2 = [], []\r\nfor v, t in (line.split() for line in sys.stdin):\r\n if t == 'USB':\r\n usb.append(int(v))\r\n else:\r\n ps2.append(int(v))\r\n\r\nusb.sort()\r\nps2.sort()\r\ni, j = min(a, len(usb)), min(b, len(ps2))\r\nfor _ in range(c):\r\n if i < len(usb) and (j == len(ps2) or usb[i] < ps2[j]):\r\n i += 1\r\n elif j < len(ps2):\r\n j += 1\r\n\r\nprint(i+j, sum(usb[:i])+sum(ps2[:j]))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\nd = []\r\nfor _ in range(int(input())):\r\n u, v = input()[:-1].split()\r\n u = int(u)\r\n d.append((u, v))\r\nd.sort()\r\nx1 = 0\r\nx2 = 0\r\nfor i, j in d:\r\n if j == 'USB':\r\n if a > 0:\r\n a -= 1\r\n x1 += 1\r\n x2 += i\r\n elif c > 0:\r\n c -= 1\r\n x1 += 1\r\n x2 += i\r\n else:\r\n if b > 0:\r\n b -= 1\r\n x1 += 1\r\n x2 += i\r\n elif c > 0:\r\n c -= 1\r\n x1 += 1\r\n x2 += i\r\nprint(x1, x2)", "\na, b, c = [int(x) for x in input().strip().split()]\nm = int(input().strip())\nmouse = []\nfor i in range(m):\n price, port = [x for x in input().strip().split()]\n price = int(price)\n mouse.append([price, port])\nmouse.sort()\n# print(mouse)\n\ncomputers = 0\ncost = 0\n\n# a and b are most restrictive\nfor i in range(m):\n price, port = mouse[i]\n \n if port == \"USB\":\n if a >= 1:\n a -= 1\n computers += 1\n cost += price\n # print(price, port)\n elif c >= 1:\n c -= 1\n computers += 1\n cost += price\n # print(price, port)\n else:\n if b >= 1:\n b -= 1\n computers += 1\n cost += price\n # print(price, port)\n elif c >= 1:\n c -= 1\n computers += 1\n cost += price\n # print(price, port)\nprint(computers, cost)\n\n ", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# For fast IO use sys.stdout.write(str(x) + \"\\n\") instead of print\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\n# Constants\r\nMAX_N = 100005\r\nMAX = 1000000001\r\nMIN = -1000000001\r\nMOD = 1000000007\r\n\r\n# adj = [[] for i in range(MAX_N)]\r\n \r\ndef input_graph(n):\r\n for i in range(n):\r\n edge = get_list()\r\n adj[edge[0]].append(edge[1])\r\n adj[edge[1]].append(edge[0])\r\n \r\ndef print_adj(n):\r\n for i in range(0, n+1):\r\n print(i, adj[i])\r\n \r\ndef BFS(adj, x, y, n):\r\n visited = set()\r\n visited.add((x, y))\r\n dq = deque()\r\n dq.append((x, y, 0))\r\n directions = [[-1, 0], [1, 0], [0, -1], [0, 1]]\r\n \r\n while len(dq) > 0:\r\n front = dq.pop()\r\n \r\n for direc in directions:\r\n nx, ny, nc = direc[0] + front[0], direc[1] + front[1], front[2] + 1\r\n if nx >= 0 and ny >= 0 and nx < n and ny < n and adj[nx][ny] == '0' and (nx, ny) not in visited:\r\n visited.add((nx, ny))\r\n dq.append((nx, ny, nc))\r\n \r\n return visited\r\n\r\nfor t in range(1):\r\n a, b, c = get_ints()\r\n m = int(input().strip())\r\n usb, ps2 = [], []\r\n \r\n for i in range(m):\r\n k = input().strip().split()\r\n if k[1] == 'USB':\r\n usb.append(int(k[0]))\r\n else:\r\n ps2.append(int(k[0]))\r\n \r\n usb.sort()\r\n ps2.sort()\r\n \r\n usb_ptr, ps2_ptr, cost = 0, 0, 0\r\n\r\n for i in range(a):\r\n if usb_ptr == len(usb):\r\n break\r\n cost += usb[usb_ptr]\r\n usb_ptr += 1\r\n \r\n for i in range(b):\r\n if ps2_ptr == len(ps2):\r\n break\r\n cost += ps2[ps2_ptr]\r\n ps2_ptr += 1\r\n \r\n for i in range(c):\r\n if usb_ptr < len(usb) and ps2_ptr < len(ps2):\r\n if usb[usb_ptr] < ps2[ps2_ptr]:\r\n cost += usb[usb_ptr]\r\n usb_ptr += 1\r\n else:\r\n cost += ps2[ps2_ptr]\r\n ps2_ptr += 1\r\n elif usb_ptr < len(usb):\r\n cost += usb[usb_ptr]\r\n usb_ptr += 1\r\n elif ps2_ptr < len(ps2):\r\n cost += ps2[ps2_ptr]\r\n ps2_ptr += 1\r\n else:\r\n break\r\n \r\n print((usb_ptr + ps2_ptr), cost)", "s = input()\r\ns = s.split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[2])\r\nnum = int(input())\r\na = []\r\nb = []\r\nfor i in range(num):\r\n s = input()\r\n s = s.split()\r\n if s[1]==\"USB\":\r\n a.append(int(s[0]))\r\n else:\r\n b.append(int(s[0]))\r\na.sort()\r\nb.sort()\r\nx = 0\r\ny = 0\r\nans = 0\r\nfor i in range(n):\r\n if x == len(a):\r\n break\r\n ans += a[x]\r\n x += 1\r\nfor i in range(m):\r\n if y == len(b):\r\n break\r\n ans += b[y]\r\n y += 1\r\nfor i in range(k):\r\n if (x == len(a)) and (y == len(b)):\r\n break\r\n if x == len(a):\r\n ans += b[y]\r\n y += 1\r\n elif y == len(b):\r\n ans += a[x]\r\n x += 1\r\n elif a[x]<=b[y]:\r\n ans += a[x]\r\n x += 1\r\n else:\r\n ans += b[y]\r\n y += 1\r\nprint(f\"{x+y} {ans}\")", "# your code goes here\r\nfrom sys import stdin, stdout\r\n\r\n\r\na, b, c = stdin.readline().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nm = int(stdin.readline())\r\n\r\nvals = []\r\nfor _ in range(m):\r\n\tcost, type = stdin.readline().split()\r\n\tcost = int(cost)\r\n\tvals.append((cost, type))\r\n\t\r\nvals.sort(key=lambda x: x[0])\r\n#print(vals)\r\n\r\ncost = 0\r\ntotal = 0\r\n\r\nfor i, val in enumerate(vals):\r\n\tprice, type = val\r\n\tprice = int(price)\r\n\t\r\n\tif a+b+c == 0:\r\n\t\tbreak\r\n\t\r\n\tif type == \"USB\":\r\n\t\tif a > 0:\r\n\t\t\ta -= 1\r\n\t\t\tcost += price\r\n\t\t\ttotal += 1\r\n\t\telif c > 0:\r\n\t\t\tc -= 1\r\n\t\t\tcost += price\r\n\t\t\ttotal += 1\r\n\r\n\t\t\t\r\n\telse:\r\n\t\tif b > 0:\r\n\t\t\tb -= 1\r\n\t\t\tcost += price\r\n\t\t\ttotal += 1\r\n\r\n\t\telif c > 0:\r\n\t\t\tc -= 1\r\n\t\t\tcost += price\r\n\t\t\ttotal += 1\r\n\r\n\t\r\n\t\r\nprint(total, cost)\r\n", "a,b,c = map(int, input().split())\r\n# usb, ps/2, both\r\nm = int(input())\r\nu, v = [], []\r\nfor _ in range(m):\r\n n, typ = input().split()\r\n n = int(n)\r\n if typ == \"USB\":\r\n u.append(n)\r\n else:\r\n v.append(n)\r\nu.sort();v.sort()\r\nz = u[a:]+v[b:]\r\nl1 = min(a,len(u)) + min(b, len(v))\r\nz.sort()\r\nl1 += min(c, len(z))\r\nprint(l1, sum(u[:a])+sum(v[:b])+sum(z[:c]))", "usb_pc, ps_pc, both_pc = map(int, input().split())\nm = int(input())\nps, usb = [], []\nfor _ in range(m):\n price, type = input().split()\n if type[0] == 'P': ps.append(int(price))\n else: usb.append(int(price))\nusb.sort()\nps.sort()\npt_usb = min(len(usb), usb_pc)\npt_ps = min(len(ps), ps_pc)\nspent = sum(usb[:pt_usb]) + sum(ps[:pt_ps])\nrest = []\nif pt_ps < len(ps): rest = ps[pt_ps:]\nif pt_usb < len(usb): rest += usb[pt_usb:]\ncount = pt_usb + pt_ps + min(both_pc, len(rest))\nrest.sort()\nspent += sum(rest[:min(both_pc, len(rest))])\nprint(count, spent)" ]

[ "# Why do we fall ? So we can learn to pick ourselves up.\r\n\r\n\r\nfrom itertools import groupby\r\nn,a,b,k = map(int,input().split())\r\ns = input()\r\nsg = [list(g) for s,g in groupby(s)]\r\nll = 0\r\nhits = []\r\nfor i in range(0,len(sg)):\r\n if sg[i][0] == '0' and len(sg[i]) >= b:\r\n for hit in range(b-1,len(sg[i]),b):\r\n hits.append(hit+ll+1)\r\n ll += len(sg[i])\r\n else:\r\n ll += len(sg[i])\r\n# print(hits)\r\n# We remove number of (ships-1) from the total number of hits because we are hitting at every possible location where\r\n# where the ship can be placed and since we want to hit AT LEAST ONE SHIP, removing (ships-1) will still hit at least one ship \r\nhits = hits[a-1:]\r\nprint(len(hits))\r\nprint(*hits)\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n13 3 2 3\r\n1000000010001\r\n\r\n\r\n15 3 2 3\r\n1000000000010001\r\n\r\n\"\"\"", "n,a,b,k = map(int, input().split())\n\nopen = 0\nmust = 0\nmust_arr = []\n\nfor i,c in enumerate(input()):\n if c == '1':\n open = 0\n else:\n open += 1\n if open == b:\n open = 0\n must += 1\n if must >= a:\n must_arr.append(i+1)\n\n\nmust -= a - 1\n\nprint(must)\nprint(*must_arr)", "import sys\n\nN, A, B, K = map(int, sys.stdin.readline().split())\n\n\nspans = []\nlast_j = 0\nfor j, c in enumerate(sys.stdin.readline().rstrip()):\n if c == '1':\n spans.append((last_j, j))\n last_j = j+1\nspans.append((last_j, N))\n\npos = 0\nfor b, e in spans:\n pos += (e - b) // B\n\nans = pos - A + 1\nprint(ans)\n\nres = []\nfor b, e in spans:\n i = b + B - 1\n while i < e:\n if len(res) < ans:\n res.append(i+1)\n i += B\n else:\n break\n if len(res) >= ans:\n break\n\nprint(' '.join(map(str, res)))\n", "def _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 _sA():\r\n return input().split()\r\n\r\n\r\nn, a, b, k = _nA()\r\ns = input()\r\ni = 0\r\nret = []\r\nwhile i < n:\r\n if s[i] == '1':\r\n i += 1\r\n continue\r\n j = i\r\n while i < n and s[i] == '0':\r\n i += 1\r\n for k in range(j+b-1, i, b):\r\n ret.append(k+1)\r\nret=ret[a-1:]\r\nprint(len(ret))\r\nprint(*ret)\r\n", "import sys\r\n# import random\r\n# from collections import Counter, defaultdict, deque\r\n# from functools import lru_cache, reduce\r\n# from itertools import accumulate,product\r\n# from heapq import nsmallest, nlargest, heapify, heappop, heappush\r\n# input = sys.stdin.buffer.readline\r\ninput = sys.stdin.readline\r\ndef mp():return list(map(int,input().split()))\r\ndef it():return int(input())\r\nimport math\r\n\r\nmod=10**9+7\r\n\r\ndef solve():\r\n n,a,b,k=mp()\r\n s=input().strip()\r\n tmp,ans=0,[]\r\n for i in range(n):\r\n if s[i]=='1':\r\n tmp=0\r\n else:\r\n tmp+=1\r\n if tmp==b:\r\n ans.append(i+1)\r\n tmp=0\r\n ret=len(ans)-(a-1)\r\n print(ret)\r\n print(\" \".join(map(str,ans[:ret])))\r\n\r\n return\r\n\r\nif __name__ == '__main__':\r\n\r\n # t=it()\r\n # for _ in range(t):\r\n # solve()\r\n\r\n # n=it()\r\n # n,m,k=mp()\r\n # n,m=mp()\r\n solve()", "n, a, b, k = map(int, input().split())\nw, aims = 0, []\nfor i, c in enumerate(input(), 1):\n if c == '0':\n w += 1\n if w == b:\n w = 0\n aims.append(i)\n else:\n w = 0\nif a > 1:\n del aims[1 - a:]\nprint(len(aims))\nprint(' '.join(map(str, aims)))", "n,a,b,k=map(int,input().split())\r\nl=[int(i) for i in input()]\r\ncnt=0\r\nshots=[]\r\nfor i in range(n):\r\n if l[i]==0:\r\n cnt+=1\r\n if cnt>=b:\r\n shots.append(i+1)\r\n cnt=0\r\n else:\r\n cnt=0\r\nprint(len(shots)-a+1)\r\nif a==1:\r\n print(*shots)\r\nelse:\r\n print(\" \".join(map(str,shots[0:-(a-1)])))\r\n", "n, a, b, k = map(int, input().split())\ns = input()\nidx = [0]*(n+1)\nres = 0\ncount = 0\n\nfor i in range(n):\n if s[i] == '0':\n count += 1\n if count == b:\n count = 0\n res += 1\n idx[res] = i+1\n else:\n count = 0\nres -= a-1\nprint(res)\nfor i in range(1, res+1):\n print(idx[i], '', end = '')\n", "N, A, B, K = map(int, input().split())\n\nM = input()\n\ncnt = 0\npos = []\n\nfor i in range(N):\n x = M[i]\n if x == '0':\n cnt += 1\n if cnt == B:\n cnt = 0\n pos.append(i+1)\n else:\n cnt = 0\n\nships = len(pos) - A + 1\nprint (ships)\nfor i in range(ships):\n print(pos[i], end=\" \")\nprint()\n", "n,a,b,k = ( int(x) for x in input().split() )\r\nl = [ int(x) for x in input() ]\r\ncount = 0\r\nshots = []\r\nfor i in range(n):\r\n\tif l[i] == 0:\r\n\t\tcount += 1\r\n\t\tif count >=b:\r\n\t\t\tshots.append(str(i+1))\r\n\t\t\tcount = 0\r\n\telse:\r\n\t\tcount = 0\r\nprint(len(shots)-a+1)\r\nif a == 1:\r\n\tprint(\" \".join(shots))\r\nelse:\r\n\tprint(\" \".join(shots[0:-(a-1)]))", "n, a, b, k = map(int, input().split())\r\ns = input()\r\nansl = []\r\nans = 0\r\nh = 0\r\nfor i in range(n):\r\n h += 1\r\n if s[i] == \"1\":\r\n h = 0\r\n elif h == b:\r\n ansl.append(i + 1)\r\n ans += 1\r\n h = 0\r\nans = ans - a + 1\r\nprint(ans)\r\nfor i in range(ans):\r\n print(ansl[i], end=\" \")\r\n", "import sys\r\ndef st(): return str(input())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef strip(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\n\r\nn,a,b,k=li()\r\ns=st()\r\nans,p,l=[],[],0\r\nfor i in range(n):\r\n if int(s[i]): l=0\r\n else: l+=1\r\n if l==b:\r\n ans.append(i)\r\n l=0\r\nend=len(ans)-a+1\r\nfor i in range(end):\r\n p.append(ans[i]+1)\r\nprint(end)\r\nprint(*p)", "# ﷽\r\nfrom collections import deque\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n n,a,b,k=[int(i) for i in input().split()]\r\n s=input()\r\n i=0\r\n d=deque()\r\n tot=0\r\n while i<n:\r\n while i<n and s[i]!='0':i+=1\r\n if \"\".join(s[i:i+b])!='0'*b:\r\n j=i\r\n while j<n and s[j]=='0':j+=1\r\n i=j+1 \r\n else: \r\n tot+=1 \r\n i+=b\r\n d.append(i) \r\n \r\n print( tot-a+1)\r\n d=list(d)\r\n print(*d[:tot-a+1])\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "n, s, b, k = map(int, input().split())\r\na = list('1' + input() + '1')\r\nans = []\r\ncnt = 0\r\nfor i in range(len(a)):\r\n if a[i] == '0':\r\n cnt += 1\r\n else:\r\n cnt = 0\r\n if cnt == b:\r\n if s > 1:\r\n s -= 1\r\n else:\r\n ans.append(i)\r\n cnt = 0\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i], end=' ')", "n, a, b, k = [int(i) for i in input().split()]\r\ns = input()\r\np = [0]\r\nfor i, n in enumerate(s):\r\n if n == \"1\":\r\n p.append(i + 1)\r\np.append(len(s) + 1)\r\nc = 0\r\nfor i in range(len(p) - 1):\r\n c += (p[i + 1] - p[i] - 1) // b\r\nres = []\r\ni = 0\r\nwhile c >= a:\r\n for j in range(p[i] + 1 + b - 1, p[i + 1], b):\r\n c -= 1\r\n res.append(j)\r\n if c < a:\r\n break\r\n i += 1\r\nprint(len(res))\r\nprint(*res)\r\n\r\n\r\n", "# Why do we fall ? So we can learn to pick ourselves up.\r\n\r\n\r\nfrom itertools import groupby\r\nn,a,b,k = map(int,input().split())\r\ns = input()\r\nsg = [list(g) for s,g in groupby(s)]\r\nll = 0\r\nhits = []\r\nfor i in range(0,len(sg)):\r\n if sg[i][0] == '0' and len(sg[i]) >= b:\r\n for hit in range(b-1,len(sg[i]),b):\r\n hits.append(hit+ll+1)\r\n ll += len(sg[i])\r\n else:\r\n ll += len(sg[i])\r\n# print(hits)\r\nhits = hits[a-1:]\r\nprint(len(hits))\r\nprint(*hits)\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n13 3 2 3\r\n1000000010001\r\n\r\n\r\n15 3 2 3\r\n1000000000010001\r\n\r\n\"\"\"", "n,a,b,k = map(int, input().split())\r\ns = input()\r\npossible = []\r\ni = 0\r\nj = 0\r\nwhile i<len(s):\r\n\tif s[i] == \"1\":\r\n\t\tj = 0\r\n\telse :\r\n\t\tj += 1\r\n\t\tif(j%b) == 0:\r\n\t\t\tpossible += [i+1]\r\n\t\t\tj = 0\r\n\ti += 1\r\n\t\r\npossible = possible[a-1:]\r\nprint(len(possible))\r\nprint(*possible)", "n, a, b, k = list(map(int, input().split()))\r\nA = input()\r\nB = []\r\ns = 0\r\nsu = 0\r\nfor i in range(n):\r\n if A[i] == \"0\":\r\n s += 1\r\n if s == b:\r\n su += 1\r\n B.append(i + 1)\r\n s = 0\r\n if A[i] == \"1\":\r\n s = 0\r\nh = su - a + 1\r\nprint(h)\r\nK = []\r\nfor i in range(h):\r\n K.append(B[i])\r\nprint(*K)", "def sum_zeroth(arr):\n res = 0\n for elem in arr:\n res += elem[0]\n return res\n\nn, a, b, k = map(int, input().split())\ndata = input()\ndist = []\npp = 0\n\nlast = 0\nfor i in range(n):\n if data[i] == '1':\n dist.append((last, i))\n pp += (i - last) // b\n last = i + 1\n\ndist.append((last, n))\npp += (n - last) // b\npos = []\nminp = pp - a + 1\nfnd = False\n\nfor elem in dist:\n cur = elem[0] - 1\n while (cur + b) < elem[1]:\n cur += b\n pos.append(cur + 1)\n if len(pos) == minp:\n fnd = True\n break\n if fnd:\n break\n\nprint(minp)\nprint(' '.join(map(str, pos)))\n", "n,a,b,k=map(int,input().split())\nA=input()\nB=A.split('1')\nC=[]\nl=1\n\nfor i in B:\n if len(i)>=b:\n for j in range(b-1,len(i),b):\n C.append(j+l)\n l+=len(i)+1\nC=C[:len(C)-a+1]\nprint(len(C))\nprint(' '.join(list(map(str,C))))\n\n", "n,a,b,k = map(int,input().split())\r\ns = input()\r\nc=0\r\nans=[]\r\nfor i in range(n):\r\n if s[i]=='0':\r\n c+=1\r\n if c>=b:\r\n ans.append(i+1)\r\n c=0\r\n else:\r\n c=0\r\nprint(len(ans)-a+1)\r\nif a==1:\r\n print(*ans)\r\nelse:\r\n print(*ans[:-(a-1)])\r\n", "n,a,b,k = map(int,input().split())\r\n\r\ns = input()\r\n\r\nsm = 0\r\nnum = 0\r\nres = []\r\nfor i in range(n):\r\n if s[i] == \"1\":\r\n sm = 0\r\n if s[i] == \"0\":\r\n sm += 1\r\n if sm == b:\r\n num += 1\r\n res.append(i+1)\r\n sm = 0\r\nk = num - a + 1\r\nprint(k)\r\nprint(*res[:k])\r\n", "n = list(map(int, input().split()))\r\nm = map(int, list(input()))\r\n\r\ns, c = 0, []\r\nfor i, t in enumerate(m):\r\n if t:\r\n s = 0\r\n else:\r\n s += 1\r\n if s >= n[2]:\r\n s = 0\r\n c += [i+1]\r\n\r\na = len(c) - n[1] + 1\r\nprint(a)\r\nprint(' '.join(map(str, c[:a])))\r\n", "n,a,b,k = map(int,input().split())\r\nA=['1'] + list(input()) + ['1']\r\nanswer =[]\r\nn+= 2\r\ni = 0\r\nwhile i <= n-2:\r\n per = 0\r\n for j in range(i+1, i+b+1):\r\n if j > n - 1:\r\n break\r\n if A[j] == '1':\r\n i = j\r\n per = 1\r\n break\r\n if per == 0:\r\n i = j\r\n answer.append(i)\r\nlens = len(answer)\r\nprint(lens - a +1)\r\nprint(' '.join(map(str, answer[0:lens-a+1])))", "import math\r\nfrom sys import stdin\r\n\r\ninput = lambda: stdin.readline()[:-1]\r\n\r\n\r\ndef solve():\r\n n, a, b, k = map(int, input().split())\r\n st = input()\r\n seg = []\r\n dx = [i for i in range(n) if st[i] == '1']\r\n dx = [-1] + dx\r\n dx.append(n)\r\n dif = []\r\n for i in range(len(dx) - 1):\r\n if dx[i + 1] - dx[i] > 1:\r\n seg.append([dx[i] + 1, dx[i + 1] - 1])\r\n\r\n for i in range(len(dx) - 1):\r\n dif.append(dx[i + 1] - dx[i] - 1)\r\n ans = 0\r\n for i in dif:\r\n ans += i // b\r\n ans -= a - 1\r\n print(ans)\r\n r = 0\r\n while r < ans:\r\n for i in seg:\r\n if i[1] - i[0] + 1 >= b:\r\n for j in range(i[1] - b + 1, i[0] - 1, -b):\r\n print(j + 1, end=\" \")\r\n r += 1\r\n if r == ans:\r\n return\r\n\r\n\r\nsolve()\r\n", "\r\nif __name__ == '__main__':\r\n\tn, a, b, k = map(int, input().split())\r\n\tf = list(map(int, input()))\r\n\tcurr = 0\r\n\tres = []\r\n\tfor i in range(n):\r\n\t\tif f[i] == 1:\r\n\t\t\tcurr = 0\r\n\t\telse:\r\n\t\t\tcurr += 1\r\n\t\t\tif curr == b:\r\n\t\t\t\tres.append(i)\r\n\t\t\t\tcurr = 0\r\n\tprint(len(res)-a+1)\r\n\tprint(' '.join(map(lambda x:str(x+1), res[:len(res)-a+1])))\r\n", "n,a,b,k=list(map(int,input().split()))\r\ns=input()\r\nans,p,l=[],[],0\r\nfor i in range(n):\r\n if int(s[i]): l=0\r\n else: l+=1\r\n if l==b:\r\n ans.append(i)\r\n l=0\r\nend=len(ans)-a+1\r\nfor i in range(end):\r\n p.append(ans[i]+1)\r\nprint(end)\r\nprint(*p)", "import sys\r\ninput = sys.stdin.readline\r\nn, a, b, k = map(int, input().split())\r\ns = input()[:-1]\r\nres = []\r\nl, r = 0, 0\r\nwhile r < n:\r\n if s[r] == '1':\r\n r += 1\r\n l = r\r\n elif a > 1:\r\n while a > 1 and r < n and s[r] == '0':\r\n r += 1\r\n if r - l == b:\r\n l = r\r\n a -= 1\r\n else:\r\n while r < n and s[r] == '0':\r\n r += 1\r\n if r - l == b:\r\n l = r\r\n res.append(r)\r\nprint(len(res))\r\nprint(*res)" ]

[ "# primes below sum(1,...,6000)\r\nprimes = [2]\r\nfor i in range(3, 190000, 2):\r\n isPrime = True\r\n for k in primes:\r\n if k * k > i:\r\n break\r\n if i % k == 0:\r\n isPrime = False\r\n break\r\n if isPrime: primes.append(i)\r\ndef is_prime(a):\r\n if a == 1: return False\r\n for i in range(2, a):\r\n if a % i == 0: return False\r\n if i*i > a: return True\r\n return True\r\nn = int(input())\r\nsu = n * (n+1) // 2\r\nif n == 1: print(-1)\r\nelif n == 2: print(\"1 1\")\r\nelif is_prime(su - 2):\r\n print(\"1 2\" + \" 1\" * (n-2))\r\nelse:\r\n no3 = (su % 2 == 1)\r\n target = su - 3 if no3 else su\r\n for a in primes:\r\n if a > target: break\r\n if is_prime(target - a):\r\n ls = []\r\n ab = a\r\n maxAllow = n\r\n if no3 and maxAllow == 3: maxAllow = 2\r\n while ab > maxAllow:\r\n ls.append(maxAllow)\r\n ab -= maxAllow\r\n maxAllow -= 1\r\n if no3 and maxAllow == 3: maxAllow = 2\r\n if ab != 3 or not no3: ls.append(ab)\r\n else: ls.append(2); ls.append(1)\r\n output = \"\"\r\n for i in range(1, n+1):\r\n if no3 and i == 3: output += '3 '\r\n elif i in ls: output += '1 '\r\n else: output += '2 '\r\n print(output[:-1])\r\n break" ]

[ "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 << 20 ^ v\r\n\r\ndef unite(s, t, w):\r\n while s ^ root[s]:\r\n w ^= d[s]\r\n s = root[s]\r\n while t ^ root[t]:\r\n w ^= d[t]\r\n t = root[t]\r\n if s == t:\r\n return 0\r\n if rank[s] < rank[t]:\r\n s, t = t, s\r\n ra, ro = rank[s], root[t]\r\n if rank[s] == rank[t]:\r\n rank[s] += 1\r\n root[t], d[t] = s, w\r\n st1.append(f(s, t))\r\n st2.append(f(ra, ro))\r\n return 1\r\n\r\ndef dist(s, t, c0):\r\n u = s\r\n while u ^ root[u]:\r\n color[u] = c0\r\n u = root[u]\r\n color[u] = c0\r\n ans = 0\r\n while color[t] ^ c0:\r\n ans ^= d[t]\r\n t = root[t]\r\n while s ^ t:\r\n ans ^= d[s]\r\n s = root[s]\r\n return ans \r\n\r\ndef undo(x, y):\r\n s, t = x >> 20, x & z\r\n ra, ro = y >> 20, y & z\r\n rank[s], root[t], d[t] = ra, ro, 0\r\n return\r\n\r\nn, m = map(int, input().split())\r\nu = dict()\r\nfor _ in range(m):\r\n x, y, d = map(int, input().split())\r\n u[f(x, y)] = f(d, 0)\r\nq = int(input())\r\nt = -1\r\na, b, c = [], [], []\r\nq1 = []\r\nz = 1048575\r\nfor _ in range(q):\r\n q0 = list(map(int, input().split()))\r\n x, y = q0[1], q0[2]\r\n if q0[0] == 1:\r\n d = q0[3]\r\n u[f(x, y)] = f(d, t + 1)\r\n elif q0[0] == 2:\r\n if u[f(x, y)] & z <= t:\r\n a.append(f(x, y))\r\n b.append(f(u[f(x, y)] & z, t))\r\n c.append(u[f(x, y)] >> 20)\r\n u[f(x, y)] = -1\r\n else:\r\n t += 1\r\n q1.append(f(x, y))\r\nfor i in u:\r\n if u[i] & z <= t:\r\n a.append(i)\r\n b.append(f(u[i] & z, t))\r\n c.append(u[i] >> 20)\r\nm = t + 1\r\nl1 = pow(2, (m + 1).bit_length())\r\nl2 = 2 * l1\r\ns0 = [0] * l2\r\nfor i in b:\r\n l0 = (i >> 20) + l1\r\n r0 = (i & z) + l1\r\n while l0 <= r0:\r\n if l0 & 1:\r\n s0[l0] += 1\r\n l0 += 1\r\n l0 >>= 1\r\n if not r0 & 1 and l0 <= r0:\r\n s0[r0] += 1\r\n r0 -= 1\r\n r0 >>= 1\r\nfor i in range(1, l2):\r\n s0[i] += s0[i - 1]\r\nnow = [0] + list(s0)\r\ntree = [-1] * now[l2]\r\nfor i in range(len(b)):\r\n l0 = (b[i] >> 20) + l1\r\n r0 = (b[i] & z) + l1\r\n while l0 <= r0:\r\n if l0 & 1:\r\n tree[now[l0]] = i\r\n now[l0] += 1\r\n l0 += 1\r\n l0 >>= 1\r\n if not r0 & 1 and l0 <= r0:\r\n tree[now[r0]] = i\r\n now[r0] += 1\r\n r0 -= 1\r\n r0 >>= 1\r\nroot = [i for i in range(n + 1)]\r\nrank = [1 for _ in range(n + 1)]\r\nd = [0] * (n + 1)\r\ns0 = [0] + s0\r\nnow = 1\r\nvisit = [0] * l2\r\ncnt1, cnt2 = [0] * l2, [0] * l2\r\nst1, st2 = [], []\r\ncolor, c0 = [0] * (n + 1), 0\r\nb = []\r\nans = []\r\nwhile len(ans) ^ m:\r\n if not visit[now]:\r\n visit[now] = 1\r\n for k in range(s0[now], s0[now + 1]):\r\n i = tree[k]\r\n u, v, w0 = a[i] >> 20, a[i] & z, c[i]\r\n f0 = unite(u, v, w0)\r\n if f0:\r\n cnt1[now] += 1\r\n continue\r\n c0 += 1\r\n w = dist(u, v, c0) ^ w0\r\n for j in b:\r\n w = min(w, w ^ j)\r\n if w:\r\n b.append(w)\r\n cnt2[now] += 1\r\n if now < l1:\r\n now = now << 1\r\n else:\r\n u, v = q1[now ^ l1] >> 20, q1[now ^ l1] & z\r\n c0 += 1\r\n ans0 = dist(u, v, c0)\r\n for j in b:\r\n ans0 = min(ans0, ans0 ^ j)\r\n ans.append(ans0)\r\n elif now < l1 and not visit[now << 1 ^ 1]:\r\n now = now << 1 ^ 1\r\n else:\r\n for _ in range(cnt1[now]):\r\n undo(st1.pop(), st2.pop())\r\n for _ in range(cnt2[now]):\r\n b.pop()\r\n now >>= 1\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "n,m = map(int,input().split())\r\nans = 0\r\nif m>n:\r\n ans = -1\r\nelse:\r\n if n%2 == 0:\r\n ans = n//2\r\n else:\r\n ans = n//2+1\r\n\r\n while ans%m != 0:\r\n ans+=1\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nif n < m:\r\n print(-1)\r\nelse:\r\n if n % 2 == 0:\r\n print((n//2//m + ((n//2)%m>0))*m)\r\n else:\r\n print(((n//2+1)// m + ((n//2+1) % m > 0)) * m)", "n, m = map(int, input().split())\r\n\r\nt = True\r\nsm = n / 2\r\nif sm != int(sm):\r\n sm += 0.5\r\nwhile t:\r\n number = n / m\r\n if sm > n * 2 or n < m:\r\n print(-1)\r\n break\r\n if sm % m == 0:\r\n t = False\r\n print(int(sm))\r\n sm += 1\r\n", "(n, m) = map(int, input().split())\r\n\r\nif m > n:\r\n print(-1)\r\nelse:\r\n min_moves = 0\r\n if n % 2 == 0:\r\n min_moves = int(n/2)\r\n else:\r\n min_moves = int((n//2)+1)\r\n\r\n while min_moves % m != 0:\r\n min_moves += 1\r\n print(min_moves)", "n,m = map(int, input().split())\r\n\r\nif m>n:\r\n print(-1)\r\nelse:\r\n ans = n//2\r\n \r\n if (n//2)%m == 0 and n%2 ==0:\r\n pass\r\n elif (n//2)%m == 0 and n%2 != 0:\r\n ans += m\r\n else:\r\n ans = ans + m- ((n//2)%m)\r\n print(ans)", "a,b=map(int,input().split())\r\nc=((a+1)//2)//b\r\nif c*b==((a+1)//2):\r\n print(c*b)\r\nelse:\r\n if c*b+b<=a:\r\n print(c*b+b)\r\n else:\r\n print(-1)", "n, m = map(int, input().split())\r\n\r\nif m > n:\r\n print(-1)\r\n exit()\r\n\r\nmin_moves = n//2 + n%2\r\nwhile min_moves %m != 0:\r\n min_moves += 1\r\n\r\nprint(min_moves)", "n,m=map(int,input().split())\r\nif n<m : \r\n print(-1)\r\nelif n==m: \r\n print(n)\r\nelif n==0 : \r\n print(0)\r\nelse:\r\n s=(n//2)+(n%2) \r\n while s%m!=0 : \r\n s+=1\r\n 2\r\n print(s)\r\n ", "n,m=map(int,input().split())\r\nif m>n:\r\n print(-1)\r\nelse:\r\n res=0\r\n if n%2==0:\r\n res+=n/2\r\n else:\r\n res+=(n//2)+1\r\n while res%m != 0:\r\n res+=1\r\n print(int(res))", "n,m=map(int,input().split(\" \"))\r\nif (m > n):\r\n moves=-1\r\nelse:\r\n if (n % 2 == 0):\r\n moves=n//2\r\n else:\r\n moves=(n//2)+1\r\n while (moves%m!=0):\r\n moves+=1\r\nprint(moves)", "n, m = map(int, input().split())\na = -1\nfor i in range((n + 1) // 2, n + 1):\n if i % m == 0:\n a = i\n break\nprint(a)\n# Wed Jun 07 2023 22:44:55 GMT+0300 (Moscow Standard Time)\n", "n,m = map(int,input().split())\r\nmini = n//2+n%2\r\nmaxi = n\r\n\r\nif mini%m == 0:\r\n print(mini)\r\nelse:\r\n if m>mini:\r\n minimumPossible = m\r\n else:\r\n minimumPossible = mini + (m - mini%m)\r\n if minimumPossible <=maxi:\r\n print(minimumPossible)\r\n else:\r\n print(-1)\r\n", "# list(map(int,input().split()))\r\nimport math\r\ninp=list(map(int,input().split()))\r\nflag=0\r\nfor i in range(math.ceil(inp[0]/2),inp[0]+1):\r\n if i%inp[1]==0:\r\n flag=i\r\n break\r\nprint(i) if flag else print(-1)", "a, b = map(int, input().split())\r\nl = []\r\nwhile sum(l) < a:\r\n if a - sum(l) >= 2:\r\n l.append(2)\r\n else:\r\n l.append(1)\r\n\r\nwhile(len(l)%b):\r\n l.pop(0)\r\n l.append(1)\r\n l.append(1)\r\n\r\nif sum(l) == a:\r\n print(len(l))\r\nelse:\r\n print(-1)", "l=list(map(int,input().split()))\r\nn=l[0]\r\nm=l[1]\r\nif(n<m):\r\n print(-1)\r\nelse:\r\n min=(n//2)+(n%2)\r\n if(min%m==0):\r\n print(min)\r\n else:\r\n while(min<=n):\r\n min=min+1\r\n if(min%m==0):\r\n print(min)\r\n break\r\n ", "from math import ceil\r\nn,m=[int(x) for x in input().split()]\r\nmin=ceil(n/2)\r\nif min%m==0: print(min)\r\nelse:\r\n if (min//m+1)*m<=n: print((min//m+1)*m)\r\n else: print(-1)", "'''\nx+2*y=n\n(x+y)%m==0\n(n-y)%m==0\n\n'''\nn,m=map(int,input().strip().split())\nans=float(\"inf\")\nfor y in range(n//2+1):\n if (n-y)%m==0 and (n-(2*y))>=0:\n ans=min(ans,y+(n-(2*y)))\nprint([-1,ans][ans!=float(\"inf\")])\n\n\t \t \t\t\t \t\t \t \t \t", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\n#for _ in range(int(input())):\r\n\r\n\r\nn,m=map(int,input().split())\r\nx=n//2\r\ny=n%2\r\n\r\nflag=False\r\n\r\nif (x+y)%m==0:\r\n print(x+y)\r\nelse:\r\n for i in range(n//2+1):\r\n x-=1\r\n y+=2\r\n if x<0 or y<0:\r\n break\r\n if (x+y)%m==0:\r\n print(x+y)\r\n flag=True\r\n break\r\n if not flag:\r\n print(-1)\r\n \r\n \r\n \r\n\r\n#carpe diem ", "n,m = map(int,input().split())\r\n\r\nif n>=m:\r\n if n%2==0:\r\n s = n//2\r\n else:\r\n s = n//2 + 1\r\n \r\n while(s%m!=0):\r\n s+=1\r\n print(s)\r\nelse:\r\n print(-1)", "n, m = map(int,input().split())\nif m > n:\n print(-1)\nelse:\n k = n // 2\n if n % 2 != 0:\n k += 1\n while k % m != 0: \n k += 1 \n print(k)\n \n \n \n", "l = input().split()\r\nn = int(l[0])\r\nm = int(l[1])\r\n\r\na = False\r\nif n%2==0:\r\n i = n//2\r\nelse:\r\n i=n//2+1\r\n\r\nwhile i>=n//2 and i<=n and a==False:\r\n if i%m==0:\r\n a = True\r\n ans = i\r\n i+=1\r\n\r\nif a==False:\r\n print(-1)\r\nelse:\r\n print(ans)", "from shutil import move\r\n\r\n\r\nn,m = map(int,input().split())\r\nmoves = 0\r\nif(n%m==0):\r\n moves = n//2\r\nelse:\r\n moves = n//2 + 1\r\nwhile(moves<=n):\r\n if(moves%m==0):\r\n print(moves)\r\n break\r\n moves += 1\r\n \r\nif(moves>n):\r\n print('-1')", "n, m= map(int, input().split())\r\nans = ((n + 1) // 2 + m - 1) // m * m\r\nif ans > n:\r\n ans = -1\r\nprint(ans)", "n , m =(int(x) for x in input().split())\r\na = -1\r\nif n%(2*m) >= m: a = m *(n//(2*m)) + m\r\nelif n > m: \r\n c = n - 2*m*((n-m)//(2*m))\r\n for i in range(c//2, -1, -1):\r\n if (c-i)%m == 0: \r\n a = m*((n-m)//(2*m)) + c-i\r\n #print(c , i)\r\n break\r\nprint(a)", "n , m = map(int , input().split())\na= -1\nimport math\nfor i in range(math.ceil(n/2),(n+1)):\n if i%m==0:\n a=i\n break\nprint(a)", "n, m = list(map(int, input().split()))\r\nc = 0\r\nif n < m:\r\n c = -1\r\nelse:\r\n while n > 0:\r\n n -= m*2\r\n c += m\r\n\r\nprint(c)\r\n\r\n", "z = []\r\nz[0:] = map(int,input().split())\r\nind1 = z[0]\r\nind2 = z[1]\r\nq = 0\r\n\r\nsumm = 0\r\nif ind1 % 2 == 0:\r\n q = int(ind1 / 2 + 1)\r\n for i in range(q):\r\n if (i+ind1)%ind2 == 0:\r\n summ = i + ind1\r\n ind1 -= 2\r\nelse:\r\n q = int((ind1 + 1 )/ 2)\r\n for i in range(q):\r\n if (i + ind1) % ind2 == 0:\r\n summ = i + ind1\r\n ind1 -= 2\r\n\r\n\r\n\r\nif summ == 0:\r\n print(-1)\r\nelse:\r\n print(summ)\r\n", "[n,m]=[int(i) for i in input().split()][:2]\r\n\r\nif n%2==0:\r\n a=int(n/2)\r\nelse:\r\n a=int(n//2+1)\r\ncheck=False\r\nwhile a<=n:\r\n if a%m==0:\r\n print(a)\r\n check=True\r\n break\r\n else:\r\n a+=1\r\n\r\nif check==False:\r\n print(-1)", "n,m = map(int,input().split())\r\nif n < m:\r\n print(-1)\r\nelif n == m:\r\n print(m)\r\nelse:\r\n if n % 2 == 0:\r\n if (n/2) % m == 0:\r\n print(int(n/2))\r\n else:\r\n num = int(n/2)+1\r\n while num % m != 0:\r\n num += 1\r\n print(num)\r\n else:\r\n num = int(n/2) + 1\r\n while num % m != 0:\r\n num += 1\r\n print(num)", "n, m = map (int, input().split())\r\n\r\nlower_bound = (n+1)//2 \r\nans = (lower_bound+m-1)//m*m \r\nif ans>n:\r\n ans = -1\r\nprint(ans)", "n, m = map(int, input().split())\r\na = 0\r\n\r\nfor i in range((n // 2) + (n % 2), n):\r\n if i % m == 0:\r\n a = i\r\n break\r\n\r\nif n == m:\r\n print(m)\r\nelif a != 0:\r\n print(a)\r\nelse:\r\n print(-1)\r\n", "# from collections import Counter\r\n# from collections import OrderedDict\r\n# from decimal import Decimal\r\n# import math\r\n# from heapq import *\r\nimport sys\r\nimport os\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\n\r\ndef strin(): return sys.stdin.readline().strip()\r\ndef arrin(): return list(map(int, sys.stdin.readline().split()))\r\ndef intin(): return int(sys.stdin.readline())\r\n\r\n#########################START######################\r\ndef solve():\r\n n,m = arrin()\r\n\r\n int = n//2 + n%2\r\n m_move = n\r\n\r\n ans = -1\r\n\r\n for i in range(int, m_move + 1):\r\n if (i % m == 0):\r\n ans = i\r\n break\r\n\r\n\r\n print(ans)\r\n\r\n \r\n \r\n\r\n\r\n\r\n# t = int(sys.stdin.readline())\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n\r\n\r\nsys.stdout.close()\r\nsys.stdin.close()", "\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\nx,y=map(int,input().split())\r\nprint([(((x+1)//2+y-1))//y*y,\"-1\"][x<y])", "A=list(map(int, input().split()))\r\nn=A[0]\r\nm=A[1]\r\nk=0\r\no=0\r\nif n%2==1:\r\n k=(n//2)+1\r\nelse:\r\n k=n//2\r\nif k%m==0:\r\n print(k)\r\nelse:\r\n while k%m!=0:\r\n k+=1\r\n if k>n:\r\n print(-1)\r\n o=1\r\n break\r\n if o==0:\r\n print(k)\r\n", "n,m=[int(x) for x in input().split()]\r\nif n<m:\r\n print('-1')\r\nelse:\r\n c=0\r\n if n%2==0:\r\n c=n//2\r\n else:\r\n c=n//2 +1\r\n flag=0\r\n for i in range(n):\r\n if c%m==0:\r\n print(c)\r\n flag=1\r\n break\r\n else:\r\n c=c+1\r\n if flag==0:\r\n print(-1)\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nm=0\r\nwhile True:\r\n if m<=a and m>=a/2 and m%b==0:\r\n print(m)\r\n quit()\r\n elif m>a:\r\n break\r\n m=m+1\r\nprint(-1)", "n, m = input().split(\" \")\r\nn, m = int(n), int(m)\r\nc = [n // 2, n % 2]\r\nwhile c[0] and (c[0] + c[1]) % m != 0:\r\n c[0] -= 1\r\n c[1] += 2\r\nif (c[0] + c[1]) % m == 0:\r\n print(c[0] + c[1])\r\nelse:\r\n print(-1)\r\n", "n,m=map(int,input().split())\r\nif n<m:print(-1)\r\nelse:\r\n k=m*(((n+1)//2+m-1)//m)\r\n print(k)", "n, m = map(int, input().split())\r\nok = False\r\nres = 0\r\nfor i in range(0, n + 1):\r\n\tfor j in range(0, n // 2 + 1):\r\n\t\tif i + j * 2 == n and (i + j) % m == 0 and (i > 0 or j > 0):\r\n\t\t\tok = True\r\n\t\t\tres = i + j\r\n\t\t\tbreak\r\n\tif ok:\r\n\t\tbreak\r\nif ok == True: \r\n\tprint(res)\r\nelse:\r\n\tprint(-1)\r\n", "n,m=map(int,input().split())\r\nif n<m:\r\n print(-1)\r\nelse :\r\n for i in range(1,n,1):\r\n if 2*i*m>=n:\r\n print(i*m)\r\n break", "n, m = map(int, input().split())\r\n\r\noutput = -1\r\n\r\nif n == 0:\r\n print(output)\r\nelse:\r\n for i in range(1, n + 1):\r\n if i % m != 0:\r\n continue\r\n else:\r\n if i * 2 >= n:\r\n output = i\r\n break\r\n else:\r\n continue\r\n print(output)", "n,m = map(int, input().split())\r\nflag = m\r\nf = 1\r\nif n % 2 == 0:\r\n if flag > n:\r\n f = 0\r\n else:\r\n while flag < n // 2:\r\n flag += m\r\nelse:\r\n if flag > n:\r\n f = 0\r\n else:\r\n while flag < (n + 1) // 2:\r\n flag += m\r\nif f:\r\n print(flag)\r\nelse:\r\n print(-1)", "import math\n\nstairs, multiple = map(int,input().split())\n\nif(stairs / multiple % multiple == 0):\n if(stairs / 2 % 1 == 0):\n print(int(stairs/2))\n else:\n print(int(stairs/2) + multiple -1 )\nelif(multiple > stairs):\n print(-1)\nelse:\n twos = int(stairs/2)\n ones = stairs - twos * 2\n for x in range(10):\n total = ones + twos\n if(total % multiple != 0):\n twos -= 1\n ones += 2\n print(ones+twos)\n\n\n", "n,m = map(int,input().split())\r\n\r\nif m > n:\r\n x = -1\r\nelse:\r\n rlt = n/2\r\n if (n/2)%m ==0 and n%2 ==0:\r\n x = rlt\r\n elif (n/2)%m == 0 and n%2 != 0:\r\n rlt += m\r\n x = rlt\r\n else:\r\n rlt += m - (n/2)%m\r\n x = rlt\r\nprint(int(x))\r\n", "n, m = map(int, input().split())\r\nif n < m:\r\n print('-1')\r\n exit()\r\ns = 0\r\na = 0\r\nb = 0\r\nif n % 2 == 0:\r\n a = n // 2\r\nelif n % 2 == 1:\r\n a = n // 2\r\n b = 1\r\nwhile (a+b) % m != 0:\r\n a -= 1\r\n b += 2\r\nprint(a+b)", "n, m = map(int, input().split())\r\ntemp = n // 2\r\nif n % 2:\r\n temp += 1\r\nif temp % m == 0:\r\n print(temp)\r\nelse:\r\n temp = temp + m - temp % m\r\n if temp > n:\r\n print(-1)\r\n else:\r\n print(temp)\r\n", "import math\r\nn,m = map(int,input().split())\r\nflag =0\r\nans = 0\r\nfor i in range(math.ceil(n/2),n+1):\r\n if i%m==0:\r\n flag = 1\r\n ans = i\r\n break\r\nif(flag):\r\n print(ans)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\nk = n // 2\r\nif n % 2 != 0:\r\n k += 1\r\nf = True\r\nwhile k % m != 0 and f:\r\n k += 1\r\n if k > n:\r\n f = False\r\nif not f:\r\n print(-1)\r\nelse:\r\n print(k)", "n, m = map(int, input().split())\r\n\r\nmin_moves = (n + 1) // 2\r\n\r\nnum_moves = min_moves\r\nfound_solution = False\r\n\r\nwhile num_moves <= n:\r\n if num_moves % m == 0:\r\n print(num_moves)\r\n found_solution = True\r\n break\r\n num_moves += 1\r\n\r\nif not found_solution:\r\n print(-1)\r\n", "import sys\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\ninp = input().split(' ')\r\nn = int(inp[0])\r\nm = int(inp[1])\r\nif (n >= m):\r\n print(str(int(math.ceil(n/(2*m))) * m))\r\nelse:\r\n print('-1')", "import sys\r\nLI=lambda:list(map(int,sys.stdin.readline().split()))\r\nMI=lambda:map(int,sys.stdin.readline().split())\r\nSI=lambda:sys.stdin.readline().strip('\\n')\r\nII=lambda:int(sys.stdin.readline())\r\n\r\n# 2a+b=n\r\n# a+b=km\r\n# a=n-km\r\n# b=2km-n\r\n\r\nn, m=MI()\r\nfor k in range(1, 10001):\r\n a=n-k*m\r\n b=2*k*m-n\r\n if a>=0 and b>=0:\r\n print(a+b)\r\n break\r\nelse:\r\n print(-1)", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\nn,k=[int(x) for x in input().split()]\r\nif(n<k):\r\n print(-1)\r\nelif(n==k):\r\n print(n)\r\nelse:\r\n flag=0\r\n a=n//2+n%2\r\n m=n//2\r\n while(m):\r\n if(a%k==0):\r\n flag=1\r\n break\r\n else:\r\n a+=1\r\n m=m-1\r\n if(flag==1):\r\n print(a)\r\n else:\r\n print(-1)", "(n, m) = map(int, input().rstrip().split())\r\n\r\ndp = [1 for _ in range(n + 1)]\r\ndp[0] = 0\r\n\r\nfor i in range(2, n + 1):\r\n dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)\r\n\r\n\r\nif m > n:\r\n print(-1)\r\n\r\nelse:\r\n if dp[n] % m == 0:\r\n print(dp[n])\r\n else:\r\n k = dp[n]\r\n\r\n while k % m != 0:\r\n k += 1\r\n\r\n print(k)", "n, m = map(int, input().split())\r\n\r\nfor i in range(n // 2, -1, -1):\r\n if (n - i) % m == 0:\r\n print(n - i)\r\n break\r\nelse:\r\n print(-1)\r\n", "a,b = map(int, input().split())\r\nls = []\r\nfor i in range(2*b,b-1,-1):\r\n ls = ls + [i]\r\nk = ls[0]\r\nsum = 0\r\nif a>=ls[-1]:\r\n while(a>k):\r\n a = a - k\r\n sum = sum + 1\r\n if a==0:\r\n print(b*sum)\r\n else:\r\n print(b*(sum + 1))\r\nelse:\r\n print(-1)", "\r\nx,y=map(int,input().split())\r\nprint([(((x+1)//2+y-1))//y*y,\"-1\"][x<y])\r\n", "n, m = list(map(int, input().split()))\r\nif n < m:\r\n print(-1)\r\nelse:\r\n moves = []\r\n while n:\r\n if n % 2 == 0:\r\n moves.append(2)\r\n n = n-2\r\n else:\r\n moves.append(1)\r\n n = n-1\r\n\r\n while len(moves) % m != 0:\r\n moves.pop()\r\n moves.append(1)\r\n moves.append(1)\r\n print(len(moves))\r\n", "n,m=map(int,input().split())\nt=(n+1)//2\ns=(t-1)//m*m+m\nprint([s,-1][s>n])\n\t \t \t\t \t \t \t \t \t\t", "import math\r\nn, m = map(int, input().split())\r\nif n < m:\r\n print(\"-1\")\r\n\r\nelse:\r\n minstep = math.ceil(n / 2)\r\n #print(minstep)\r\n while minstep % m != 0:\r\n minstep += 1\r\n\r\n print(minstep)", "from math import ceil\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,m=map(int,input().split())\r\nif (n/2)<=(ceil((n/2)/m))*m<=n:\r\n\tprint((ceil((n/2)/m))*m)\r\nelse:\r\n\tprint(-1)", "n, m = map(int, input().split())\r\ncnt = (n // 2) + 1 * (n % 2)\r\nwhile cnt < n and cnt % m != 0:\r\n cnt += 1\r\nif cnt % m == 0:\r\n print(cnt)\r\nelse:\r\n print(-1)", "import math\r\nn,m=map(int,input().split())\r\nminstep=math.ceil(n/2)\r\nif minstep%m==0:\r\n print(minstep)\r\nelse:\r\n rem=minstep%m\r\n val=m-rem\r\n n//=2\r\n if val<=n:\r\n print(val+minstep)\r\n else:\r\n print(-1)\r\n \r\n ", "n, m = map(int, input().split())\nans = -1\nminm = (n + 1) // 2\nfor i in range(minm, n + 1):\n if i % m == 0:\n ans = i\n break\nprint(ans)", "n, m = map(int, input().split())\r\nif n < m:\r\n print(-1)\r\nelse:\r\n rem = n % 2\r\n steps = (n - rem) // 2 + rem\r\n while True:\r\n if steps % m == 0:\r\n break\r\n steps += 1\r\n print(steps)", "ans = 10**10\r\nn, m = map(int, input().split())\r\nfor c1 in range(n+1):\r\n if (n - c1) % 2 == 0:\r\n c2 = (n - c1) // 2\r\n if (c1 + c2) % m == 0:\r\n ans = min(ans, c1 + c2)\r\nif ans == 10**10:\r\n ans = -1\r\nprint(ans)", "import math\n\nstairs, moves = map(int, input().split())\n\nif moves > stairs:\n print( -1 )\nelse:\n print( moves * math.ceil(stairs/(moves*2)) )\n\t \t \t \t\t\t \t\t \t \t\t\t\t \t\t", "def main():\n take = input().split()\n n = int(take[0])\n m = int(take[1])\n a = int(take[0])\n b = 0\n potential = 0\n negative_a = False\n minimum = None\n while not negative_a:\n if (a + b // 2) % m == 0 and a + b == n:\n if potential == 0:\n minimum = a + b // 2\n elif a + b // 2 < minimum:\n minimum = a + b // 2\n potential += 1\n a -= 2\n b += 2\n if a < 0:\n negative_a = True\n if potential == 0:\n print(-1)\n else:\n print(minimum)\nmain()\n\n", "n,m=map(int,input().split())\r\nif m>n:\r\n print(-1)\r\nelif m==n:\r\n print(m)\r\nelse:\r\n if n%2==1:\r\n s=(n-1)//2+1\r\n else:\r\n s=n//2\r\n while s%m!=0 and s<=n:\r\n s+=1\r\n print(s)\r\n \r\n ", "# 476A\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nfrom math import ceil\r\n\r\n\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\nn,m = sp_inp()\r\nif(m>n): print(-1)\r\nelse:\r\n move = ceil(n/2)\r\n if(move%m==0):\r\n print(move)\r\n else:\r\n print((move//m + 1)*m)", "n, m = map(int, input().split())\nres = float(\"inf\")\n\nfor a in range(0, n+1):\n b = (n - a)/2\n if (a + b)% m == 0:\n res = min(res, a + b)\n\nif res < float(\"inf\"):\n print(int(res))\nelse:\n print(-1)\n", "n, t = map(int, input().split())\r\n\r\nif t > n:\r\n print(-1)\r\nelse:\r\n x = n//2 + 1 if n%2 else n//2\r\n for i in range(x, n+1):\r\n if i%t == 0:\r\n print(i)\r\n break\r\n", "import math\r\ny,i=map(int,input().split())\r\nif y<i:\r\n print(-1)\r\n exit()\r\nh=0\r\nfor u in range(999999):\r\n if y%2!=0:\r\n h+=1\r\n y-=1\r\n else:\r\n if (h+y//2)%i==0:\r\n print(h+y//2)\r\n break\r\n else:\r\n h+=1\r\n y-=1", "import math\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n \r\n if n < m :\r\n print(-1)\r\n else:\r\n if math.ceil(n / 2) % m == 0:\r\n print(math.ceil(n / 2))\r\n else:\r\n print(math.ceil(n/2)+ m - math.ceil(n / 2) % m)\r\n \r\n \r\nmain()", "import math\r\nn, m = map(int, input().split())\r\na = math.ceil(n / 2)\r\nwhile a <= n:\r\n\tif a % m == 0:\r\n\t\tprint(a)\r\n\t\texit()\r\n\ta += 1\r\nprint(-1)\r\n\t\r\n", "n, m = [int(i) for i in input().split()]\n\n\nif n < m:\n print(-1)\nelif n == m:\n print(n)\nelse:\n b = n//2 + n%2\n for i in range(b, n):\n if i%m == 0:\n print(i)\n exit()\n print(-1)\n", "n, m = list(map(int,input().split()))\r\n\r\nnumbs = [2 for k in range(n//2)]\r\nif n%2==1:\r\n numbs.append(1)\r\nfind = False\r\nanswer = 0\r\nwhile numbs[0]==2:\r\n if len(numbs)%m==0 :\r\n find = True\r\n break\r\n else:\r\n numbs.pop(0)\r\n numbs.append(1)\r\n numbs.append(1)\r\n\r\nif len(numbs)%m==0 :\r\n find = True\r\n\r\nprint(len(numbs) if find else -1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "prim = input()\r\nn,m = prim.split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\nmaximo = n\r\n\r\nif n%2 == 0:\r\n minimo = n/2\r\nelse:\r\n minimo = (n+1)/2\r\n \r\nflag = True\r\n\r\nfor i in range(int(minimo),maximo+1):\r\n \r\n if i/m == round(i/m):\r\n print(i)\r\n flag = False\r\n break\r\n \r\nif flag:\r\n print(-1)", "def main():\r\n n, m = map(int, input().split())\r\n\r\n if n < m:\r\n print(-1)\r\n return\r\n\r\n k = (n + 1) // 2\r\n\r\n if k % m == 0:\r\n print(k)\r\n else:\r\n while k % m != 0:\r\n k += 1\r\n\r\n print(k)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import *\r\n# map(int,input().split())\r\n \r\ndef solve():\r\n n,m=map(int,input().split())\r\n if n<m:\r\n print(-1)\r\n return 0\r\n else:\r\n x=(n+1)//2\r\n if x%m==0:\r\n print(x)\r\n return 0\r\n else:\r\n print((x//m+1)*m)\r\n return 0\r\n \r\n#for _ in range(int(input())):\r\nsolve()", "def calculate_ans(n, m):\r\n lower_bound = (n + 1) // 2\r\n ans = ((lower_bound + m - 1) // m) * m\r\n if ans > n:\r\n ans = -1\r\n\r\n return ans\r\n\r\nn,m = map(int, input().split())\r\n\r\nresult = calculate_ans(n, m)\r\nprint(result)", "n,m=map(int,input().split())\r\nif m>n:\r\n print(-1)\r\nelse:\r\n i=n//2\r\n if n%2:\r\n i+=1\r\n while i%m>0:\r\n i+=1\r\n print(i)\r\n \r\n", "n, m = map(int, input().split())\r\nif n % 2 == 0:\r\n start = n // 2\r\nelse:\r\n start = n // 2 + 1\r\nfinish = n\r\np = -1\r\nfor i in range(start, finish + 1):\r\n if i % m == 0:\r\n p = i\r\n break\r\nprint(p)\r\n", "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\nif n<m:print(-1)\r\nelse:\r\n x=n//2+n%2\r\n print(m*(x//m+(1 if x%m else 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", "import math\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\ns=0\r\nif m>n:\r\n print(-1)\r\nelif m==n:\r\n print(m)\r\nelse:\r\n min=math.ceil(n/2)\r\n while True:\r\n if min%m==0:\r\n print(min)\r\n break\r\n else:\r\n min+=1", "import math\r\nn,m=map(int,input().split(' '))\r\nk=math.ceil(n/(2*m))\r\nif(k<=(n//m)):\r\n print(k*m)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\nl = (n+1)//2\r\nr = (l+m-1)-(l+m-1)%m\r\nif r>n:\r\n r = -1\r\nprint(r)", "n,m = map(int, input().split())\r\nlst1=[n-i for i in range(0,n+1)]\r\nlst1.reverse()\r\nlst2=[]\r\nlst3=[]\r\nlst4=[]\r\nlst5=[]\r\nlst6=[]\r\nfor i in lst1:\r\n if (i%2==0):\r\n lst2.append(n-i)\r\n lst3.append(i//2)\r\nfor i in range(len(lst2)):\r\n if ((lst2[i]+lst3[i])%m==0):\r\n lst4.append(lst2[i])\r\n lst5.append(lst3[i])\r\nif len(lst4)==0:\r\n print(-1)\r\nelse:\r\n for i in range(len(lst4)):\r\n lst6.append(lst4[i]+lst5[i])\r\n print(min(lst6))\r\n \r\n \r\n \r\n", "#https://codeforces.com/problemset/problem/476/A\nn,m=map(int,input().split(' '))\nans=-1\ns=0\nif n%2==0:\n\ts=n/2\nelse:\n\ts=(n+1)/2\ns=int(s)\nfor i in range(s,n+1):\n\tif i%m==0:\n\t\tans=i;\n\t\tbreak\nprint(ans)\n", "n,m=map(int,input().split())\r\nif n<m:print(-1);exit(0)\r\nn=(n+1)//2\r\nwhile n%m!=0:n+=1\r\nprint(n)", "n,m=list(map(int,input().split()))\r\nans=int(n/2+.5)\r\ntmp=ans%m\r\nif tmp==0:\r\n print(ans)\r\nelif m-tmp<=n//2:\r\n print(ans+m-tmp)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nc=0\r\nif n%2==0:\r\n for i in range(n//2,n+1):\r\n if i%m==0:\r\n print(i)\r\n c+=1\r\n break\r\nelse:\r\n for i in range(n//2 + 1,n+1):\r\n if i%m==0:\r\n print(i)\r\n c+=1\r\n break\r\nif c==0:\r\n print(-1)", "n,m=[int(i) for i in input().split()]\r\nif n<m:\r\n print(-1)\r\nelif n==m:\r\n print(n)\r\nelse :\r\n z=n//(2*m)\r\n y=n-(z*2*m)\r\n if y==0:\r\n print(z*m)\r\n else :\r\n print((z+1)*m)", "n, m = map(float, input().split())#количество ступенек, чило шагов кратно m\r\n#n ступенек то может быть n/2-n шагов\r\n\r\nif n%2==0:\r\n kolchag=n/2\r\nelse:\r\n kolchag=n//2+1\r\n\r\nwhile kolchag<=n:\r\n if kolchag%m==0:\r\n status=True\r\n break\r\n else:\r\n kolchag+=1\r\n status=False\r\nif status:\r\n print(int(kolchag))\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\n\r\nmax_twos = n // 2\r\nresult = -1\r\n\r\nfor i in range(max_twos, -1, -1):\r\n ones = n - 2 * i\r\n total_moves = i + ones\r\n if total_moves % m == 0:\r\n result = total_moves\r\n break\r\n\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\nif n<m:\r\n print(-1)\r\nelse:\r\n r = n//2 + n%2\r\n while True:\r\n if r%m == 0:\r\n print(r)\r\n break\r\n r = r + 1;", "x,y=map(int,input().split())\r\nd=(((x+1)//2+y-1))//y*y\r\nif d<=x:\r\n print(d)\r\nelse:\r\n print(\"-1\")", "n, m = map(int, input().split())\r\nans = (n+1)//2\r\n\r\nif ans%m==0:\r\n print(ans)\r\nelse:\r\n x = m - (ans % m)\r\n s = x * 2\r\n if s <= n:\r\n print(ans + x)\r\n else:\r\n print(-1)", "n, m = map(int, input().split())\r\nif m > n:\r\n print(-1)\r\nelse:\r\n for i in range((n+1)//2, n+1):\r\n if i % m == 0:\r\n print(i)\r\n exit(0)\r\n", "# 李本伟四六开\r\n# 这是一场试炼\r\ndef dreamoon(n, m):\r\n if n%2!=0:\r\n a=n//2+1\r\n else:\r\n a=n/2\r\n if m>n:\r\n return print('-1')\r\n while a % m != 0:\r\n a = a + 1\r\n return print(int(a))\r\n\r\nq, w = map(int, input().split(' '))\r\ndreamoon(q, w)\r\n", "n,m=map(int,input().split())\r\nsteps2=0\r\nsteps1=0\r\nsteps=0\r\nif(n<m):\r\n print(-1)\r\nelse:\r\n if(n%2==0):\r\n steps2=n//2\r\n if(steps2%m==0):\r\n steps=steps2\r\n else:\r\n steps=steps2\r\n while(steps%m>0):\r\n steps2=steps2-1\r\n steps1=steps1+2\r\n steps=steps2+steps1\r\n else:\r\n steps2=n//2\r\n steps1=n%2\r\n steps=steps2+steps1\r\n if(steps%m==0):\r\n steps=steps\r\n else:\r\n while(steps%m>0):\r\n steps2=steps2-1\r\n steps1=steps1+2\r\n steps=steps1+steps2\r\n print(steps)", "import math\r\ntotal , m = [int(x) for x in input().split(\" \")]\r\nintialSteps = (total // 2 + total % 2)\r\ndef isValid():\r\n if m > total:\r\n return False\r\n return True\r\nif isValid():\r\n numberOfSteps = math.ceil(intialSteps / m) * m\r\n print(numberOfSteps)\r\nelse:\r\n print(-1)\r\n", "n, m = (map(int, input().split()))\r\nif m > n:\r\n print(-1)\r\nelse:\r\n a = n - n // 2\r\n print(a + (-a) % m)", "n, m = map(int, input().split())\nmini = (n + 1) // 2\nprint(next((i for i in range(mini, min(n + 1, mini + m)) if i % m == 0), -1))\n", "n,m = map(int,input().split())\r\nv=m\r\nif m>n:\r\n print(-1)\r\nelif m==n:\r\n print(n)\r\nelse:\r\n while (m*2)<n:\r\n m=m+v\r\n print(m)", "import math\r\n\r\nn, m = list(map(int, input().split()))\r\nk = math.ceil(n / (2 * m))\r\nx = n - m * k\r\ny = 2 * m * k - n\r\n\r\nif x < 0 or y < 0:\r\n print(-1)\r\nelse:\r\n print(x + y)\r\n", "n,m = list(map(int, input().split()))\r\nx=0\r\n\r\nif m>n:\r\n print(-1)\r\nelse:\r\n if n%2==0:\r\n x = int(n/2)\r\n else:\r\n x = int(n/2)+1\r\n \r\n while x%m!=0:\r\n x+=1\r\n \r\n print(x)", "n,m=map(int,input().split())\r\ni=int((n+1)/2)\r\nwhile(i<=n):\r\n if i%m==0:\r\n print(i)\r\n quit()\r\n i+=1\r\nprint(-1)", "n,m = [int(x) for x in input().split()]\r\nsteps = n%2 + n//2\r\nc = n//2\r\nflag = True\r\nwhile steps % m != 0 :\r\n if c == 0 :\r\n flag = False\r\n break\r\n steps += 1\r\n c -= 1\r\nif flag == False :\r\n print(-1)\r\nelse :\r\n print(steps)\r\n", "n,m = map(int,input().split())\r\n\r\nif n<m:\r\n print(-1)\r\nelse:\r\n if n%2==0:\r\n s= n//2\r\n else:\r\n s = n//2 +1 \r\n while s%m != 0:\r\n s+=1\r\n print(s)", "l = input().split()\r\nsteps = int(l[0])\r\nmul = int(l[1])\r\nimport math\r\nmin_s = math.ceil(steps / 2)\r\nnum = math.ceil(min_s / mul) * mul\r\nif num > steps:\r\n print(-1)\r\nelse:\r\n print(num)\r\n", "n,m= map(int, input().split())\r\nif m>n:\r\n print(-1)\r\n quit()\r\nif n%2==0:\r\n for i in range(n//2, n+1):\r\n if i%m==0:\r\n print(i)\r\n quit()\r\n print(-1)\r\nelse:\r\n for i in range((n//2)+1, n+1):\r\n if i%m==0:\r\n print(i)\r\n quit()\r\n print(-1)\r\n ", "# t = int(input())\n# ans = t # initial t to find first button\n# for i in range(1,t):\n# ans += (t-i)*i # every iteration i previous buttons need\n# # to be represed for each remaining t-i possible buttons \n# # to find the sequence we want\n# print(ans)\n\nfrom cmath import inf\n\n\nn,m = map(int,input().split())\n\nans = inf\n\nfor one in range(0,n+1):\n left = n-one\n if left%2==0:\n twoTaken = left//2\n totalSteps = one+twoTaken\n if totalSteps%m==0:\n ans = min(ans,one+twoTaken)\nif ans==inf:\n print(-1)\nelse:\n print(ans)", "n, m = map(int, input().split())\r\nans = 0\r\nif n % 2 == 0:\r\n ans += n // 2\r\nelse:\r\n ans += 1 + n // 2\r\nif m > n:\r\n print(-1)\r\nelif n == m:\r\n print(n)\r\nelse:\r\n if ans % m == 0:\r\n print(ans)\r\n else:\r\n while ans % m != 0 and ans <= n:\r\n ans += 1\r\n if ans % m == 0:\r\n print(ans)\r\n break\r\n else:\r\n print(-1)", "n, m = [int(_) for _ in input().split()]\r\n\r\nx = (n + 1)//2\r\nwhile x % m != 0:\r\n x += 1\r\n\r\nif x > n:\r\n print(-1)\r\n\r\nelse:\r\n print(x)", "n, m = map(int, input().split())\r\nmin_steps = n // 2 + n % 2\r\nmax_steps = n\r\nclosest_multiple = ((min_steps + m - 1) // m) * m\r\nif min_steps <= closest_multiple <= max_steps:\r\n print(closest_multiple)\r\nelse:\r\n print(-1)\r\n", "##\r\n\r\n\r\nn,m=map(int,input().split())\r\na=n-n//2\r\nprint([a+(-a)%m,-1][n<m])", "import math\r\n\r\nx , y = map(int,input().split())\r\nif y > x:\r\n print(-1)\r\nelse:\r\n for i in range(1,int(math.ceil(x/y))+1):\r\n if y*i*2 < x:\r\n pass\r\n else:\r\n print(y*i)\r\n break", "class Solution:\n\n def dreamoon_and_stairs(n, m):\n stair = []\n for i in range(n//2):\n stair.append(0)\n if n % 2 == 1:\n stair.append(0)\n while len(stair) <= n:\n if len(stair) % m == 0:\n return len(stair)\n else:\n stair.pop()\n stair.append(0)\n stair.append(0)\n return -1\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n #print(Solution.tv_subscriptions())\n print(Solution.dreamoon_and_stairs(n, m))\n", "n,m = map(int,input().split())\r\nres=0\r\nif m>n:\r\n print(-1)\r\nelse:\r\n if n%2==0:\r\n res=n//2\r\n else:\r\n res = n//2+1\r\n while res%m:\r\n res+=1\r\n print(res)", "# https://codeforces.com/problemset/problem/476/A\n\nn, m = input().split(\" \")\nn = int(n)\nm = int(m)\n\nif m > n:\n print(\"-1\")\nelse:\n if n % 2 == 1:\n n += 1\n happened = False\n for num in range(n // 2, n + 1):\n if num % m == 0:\n happened = True\n print(num)\n break\n if not happened:\n print(\"-1\")", "\r\n\r\n\r\n\r\ndef dreamoon():\r\n\r\n n,m = map(int,input().split())\r\n\r\n\r\n i = 0 if n % 2 == 0 else 1\r\n\r\n\r\n while i <= n:\r\n remaining_steps = n - i\r\n two_steps = remaining_steps //2\r\n\r\n total_steps = (i + two_steps)\r\n if total_steps % m == 0:\r\n print(total_steps)\r\n break\r\n\r\n\r\n\r\n \r\n i += 2\r\n else: \r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\ndreamoon()\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nmin_moves=(n//2)+(n%2)\r\ns=1\r\ni=1\r\nwhile s<=n:\r\n if n<m:\r\n print(\"-1\")\r\n break\r\n s=m*i\r\n i+=1\r\n if s>=min_moves:\r\n print(s)\r\n break", "a,b = map(int,input().split())\r\nans = -1\r\nfor i in range((a + 1) // 2,a + 1):\r\n if i % b == 0:\r\n ans = i\r\n break\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\ntwos = n//2\r\nones = n % 2\r\ntotal = ones + twos\r\n\r\nif total%m == 0:\r\n\tprint(total)\r\n\r\nelse:\r\n\tdiff = m - (total % m)\r\n\r\n\tif twos < diff:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(total + diff)", "n, m = map(int, input().split(' '))\r\nif n < m:\r\n print(-1)\r\n exit(0)\r\ndp = [float('inf') for i in range(n + 1)]\r\ndp[0] = 1\r\nfor x in range(1, n + 1):\r\n for k in [1, 2]:\r\n if x - k >= 0:\r\n dp[x] = min(dp[x], dp[x - k] + 1)\r\nk = dp[n] - 1\r\nif k % m == 0:\r\n print(k)\r\nelse:\r\n print(k - k % m + m)\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\n#sys.setrecursionlimit(10**6)\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**20+7\r\nfact = [1]\r\nANS=[]\r\n\r\nn,m = ints()\r\nif m>n:\r\n print(-1)\r\nelse:\r\n x = n//2 + n%2\r\n if x%m==0:\r\n print(x)\r\n else:\r\n y = x%m\r\n x += m-y\r\n print(x)\r\n", "# for _ in range(int(input())):\r\n# n = int(input())\r\nn, m = map(int, input().split())\r\n# arr = sorted(list(map(int, input().split())))\r\nans = n // 2 + n % 2\r\n\r\nwhile ans <= n:\r\n if ans % m == 0:\r\n print(ans)\r\n exit()\r\n\r\n ans += 1\r\n\r\nprint(-1)", "import math\r\nn,m =map(int, input().split())\r\nif n<m:\r\n print(-1)\r\nelif n==m:\r\n print(m)\r\nelse:\r\n min_moves=n//2+n%2\r\n if min_moves%m ==0:\r\n print(min_moves)\r\n else:\r\n next_multiple=min_moves- min_moves%m +m\r\n if next_multiple<=n:\r\n print(next_multiple)\r\n else:\r\n print(-1)", "import math\r\ndef dreammoon(a,b):\r\n alist=[]\r\n blist=[]\r\n if a<b:\r\n return -1\r\n elif a==b:\r\n return a\r\n else:\r\n t=a//2\r\n for i in range(1,t+1):\r\n alist.append(i+(a-(2*i)))\r\n for x in alist:\r\n if x%b==0:\r\n blist.append(x)\r\n if len(blist)==0:\r\n return -1\r\n else:\r\n return min(blist)\r\nn=input()\r\nalist=[int(d) for d in n.split()]\r\nprint(dreammoon(alist[0],alist[1]))\r\n ", "n, m = map(int, input().split())\r\nmmin = (n + 1) // 2\r\nans = ((mmin + m - 1) // m) * m\r\nprint(ans if ans <= n else -1)\r\n", "n, m = (int(i) for i in input().split())\n# 1*x + 2*y = n\n# x + y = k*m\n# x + 2(k*m - x) = n\n# x = 2*k*m - n, x >= 0\nk_min = (n + 2 * m - 1) // (2 * m)\n# y = n - k * m, y >= 0\nk_max = n // m\nres = k_min * m if k_min <= k_max else -1\nprint(res)\n", "def solve():\r\n n, m = map(int, input().split())\r\n mn, mx = n//2+n % 2, n\r\n if mn % m == 0:\r\n print(mn)\r\n else:\r\n print(mn+m-(mn % m) if mn+m-(mn % m) <= mx else -1)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "arr = [int(_) for _ in input().split()]\nans = 0\nif arr[0] >= arr[1]:\n mins = arr[0] // 2\n if mins % arr[1] == 0:\n ans = mins\n else:\n while mins % arr[1] != 0:\n mins += 1\n ans = mins\n if ans*2 < arr[0]:\n ans += arr[-1]\n print(ans)\nelse:\n print(-1)\n", "import math\r\n\r\nn, m = map(int, input().split(' '))\r\nk = math.ceil(n / (2 * m))\r\nprint(k * m if n >= m else -1)", "def fun(n,m):\r\n i = 0\r\n while i <= n:\r\n if (n-i)%2==0 and (i+((n-i)//2))%m==0:\r\n return i+((n-i)//2)\r\n i += 1\r\n return -1\r\n\r\nn,m = map(int,input().split())\r\nprint(fun(n,m))", "import math\r\nn,m=map(int,input().split())\r\nd=math.ceil(n/(2*m))\r\nif(d<=n/m):\r\n print(d*m)\r\nelse:\r\n print(-1)", "steps,num = map(int, input().split())\r\n\r\nmaxx = steps\r\nif steps % 2 == 0:\r\n minn = int(steps/2)\r\nelse:\r\n minn = int(steps/2) + 1\r\n\r\n\r\nfor i in range(minn, maxx+1):\r\n if i % num == 0:\r\n a = i\r\n break \r\n else:\r\n a = -1\r\n\r\nprint(a)", "n,m = map(int, input().split())\r\nx=(n+1)//2\r\nif n<m:\r\n print(-1)\r\nelse:\r\n while x<=n:\r\n \tif x % m == 0:\r\n \t\tprint(x)\r\n \t\tbreak\r\n \tx += 1\r\n", "a,b=map(int,input().split())\r\nfor i in range((a+1)//2,a+1):\r\n if i%b==0:\r\n print(i)\r\n break\r\nelse: print(-1)", "n,m=map(int,input().split())\r\nif m>n:\r\n print(-1)\r\nelse:\r\n if (n&1)!=0:\r\n x=(n//2)+1\r\n else:\r\n x=n//2 \r\n while (x%m)!=0:\r\n x+=1 \r\n print(x)", "import math\r\nn,m = map(int,input().split())\r\nlower_bound = (n+1)//2\r\nans = (lower_bound+m-1)//m*m\r\nif ans > n:\r\n print(-1)\r\nelse:\r\n print(ans)", "n,m=map(int,input().split())\r\nval=(n-1)//(2*m)\r\nprint(-1 if n<m else m*(val+1))\r\n\t \t \t\t \t \t \t \t \t \t \t \t \t\t", "x, y = map(int, input().split())\r\nsteps = x // 2 if not(x & 1) else (x // 2) + 1\r\nfor i in range(steps, x + 1):\r\n if i % y == 0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "import sys\r\n\r\ndef check():\r\n x,y=map(int, sys.stdin.readline().split()) \r\n if y>x: \r\n print(-1)\r\n return\r\n min_moves = x//2\r\n steps_left=0 \r\n if (x-(2*min_moves)) % 2==0:\r\n steps_left=(x-(2*min_moves))//2\r\n else:\r\n steps_left=((x-(2*min_moves))//2)+1\r\n\r\n if (min_moves+steps_left)%y==0:\r\n print(min_moves+steps_left)\r\n else:\r\n d=(((min_moves+steps_left)//y)+1)*y\r\n print(d)\r\n \r\n\r\ncheck()\r\n", "q, w = map(int, input().split())\r\nif w > q:\r\n print(-1)\r\nelse:\r\n g = 0\r\n while True:\r\n g += w\r\n if g * 2 >= q:\r\n break\r\n print(g)", "n,m = map(int,input().split())\n\nif(n%2==0):\n k = n/2\n if(k%m==0):\n print(int(k))\n else:\n while(k%m!=0):\n k+=1\n if(k>n):\n print(-1)\n else:\n print(int(k))\nelse:\n k = (n+1)/2\n if(k%m==0):\n print(int(k))\n else:\n while(k%m!=0):\n k+=1\n if(k>n):\n print(-1)\n else:\n print(int(k))\n\n", "\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\nn, m = MII()\r\n\r\nk = 1\r\nans = -1\r\n\r\nwhile 2*k*m < n:\r\n k += 1\r\n\r\nsteps = k*m\r\nif steps <= n:\r\n print(steps)\r\nelse:\r\n print(-1)\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\nfrom copy import deepcopy\r\n\r\n \r\ndef sieve_of_eratosthenes(n):\r\n is_prime = [True] * (n+1)\r\n is_prime[0] = is_prime[1] = False\r\n for p in range(2, int(n**0.5)+1):\r\n if is_prime[p]:\r\n for i in range(p*p, n+1, p):\r\n is_prime[i] = False\r\n \r\n for i in range(2, n+1):\r\n if is_prime[i]:\r\n print(i, end=' ')\r\n\r\n\r\ndef isPowerOf2(n):\r\n\r\n def log2(x):\r\n\r\n if x == 0:\r\n return False\r\n\r\n return (math.log10(x)/math.log10(2))\r\n\r\n\r\n return math.ceil(log2(n)) == math.floor(log2(n))\r\n\r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\nn, m = readarray(int)\r\n\r\n\r\nans = -1\r\n\r\nlow = int(math.ceil(n/2))\r\nhigh = n\r\n\r\nwhile low <= high:\r\n if low % m == 0:\r\n ans = low\r\n break\r\n else:\r\n low += 1\r\n\r\nprint(ans)", "n,m=list(map(int,input().split()))\r\nif m>n:\r\n print(-1)\r\nelse:\r\n if n%2:\r\n res=n//2+1\r\n else:\r\n res=n//2\r\n \r\n while res%m>0:\r\n res+=1\r\n \r\n print(res)", "# Wadea #\r\n \r\nfrom math import ceil\r\nn,m = map(int,input().split())\r\nc = 0\r\nr = 0\r\nif n < m :\r\n print(-1)\r\n exit(0)\r\nif n == m:\r\n print(n)\r\n exit(0)\r\nelse:\r\n for i in range(ceil(n/2),n+1):\r\n if i % m == 0:\r\n print(i)\r\n break", "import math\r\n\r\ns = input().split()\r\nn,m = int(s[0]), int(s[1])\r\n\r\nresult=0\r\n\r\nif n < m: result = -1\r\nelse: result = math.ceil(n / (2.0 * m)) * m\r\n\r\nprint(result)", "import math\r\n\r\nn, m = map(int, input().split())\r\nif n < m:\r\n print(-1)\r\nelse:\r\n print(math.ceil(n / (2.0 * m)) * m)\r\n", "n, m = map(int, input().split())\r\namount_of_steps = int()\r\nans = int()\r\nif n % 2 == 0:\r\n amount_of_steps += n//2\r\nelse:\r\n amount_of_steps += n//2 + 1\r\n\r\nif amount_of_steps % m == 0:\r\n ans = amount_of_steps\r\nelif n < m:\r\n ans = -1\r\nelse:\r\n ans = (amount_of_steps//m+1)*m\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "a,b = map(int,input().split())\r\n\r\nif a < b:\r\n print(-1)\r\n\r\nelif a % 2 == 0 :\r\n n = a // 2\r\n\r\n if n % b == 0:\r\n print(n)\r\n else:\r\n while(n%b!=0):\r\n n+=1\r\n print(n)\r\n\r\nelif a % 2 != 0:\r\n\r\n n = a // 2 + 1\r\n\r\n if n%b ==0:\r\n print(n)\r\n\r\n else:\r\n \r\n while(n%b!=0):\r\n n+=1\r\n\r\n print(n)\r\n \r\n \r\n", "n,m= list(map(int, input().split(\" \")))\r\nif m>n:\r\n print(-1)\r\nelse:\r\n if n%2==0:\r\n x = n/2\r\n else:\r\n x = n//2 + 1\r\n while x%m != 0:\r\n x+=1\r\n print(int(x))", "n,m=map(int,input().split())\r\nif n<m:\r\n print(-1)\r\nelif n%2==0:\r\n n2=n//2\r\n n1=0\r\n for i in range(n):\r\n if (n2+n1)%m==0:\r\n print(n2+n1)\r\n break\r\n else:\r\n n2-=1\r\n n1+=2\r\nelif n%2!=0:\r\n n2=n//2\r\n n1=1\r\n for i in range(n):\r\n if (n2+n1)%m==0:\r\n print(n2+n1)\r\n break\r\n else:\r\n n2-=1\r\n n1+=2\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nif n<m:\r\n print(-1)\r\nelse:\r\n print((((n+1)//2-1)//m+1)*m)", "n,m = input().split()\r\nif int(n)<int(m):\r\n print(-1)\r\nelif int(n)==int(m):\r\n print(int(n))\r\nelif int(n)%2==0:\r\n s = int(n)/2\r\n if s%int(m)==0:\r\n print(int(s))\r\n else:\r\n rem = s%int(m)\r\n print(int(s+(int(m)-rem)))\r\nelse:\r\n step = int(n)//2+int(n)%2\r\n if step%int(m)==0:\r\n print(int(step))\r\n else:\r\n rem = step%int(m)\r\n print(int(step+(int(m)-rem)))\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\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\ns = s.split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\na = s[0] // 2\r\nls = []\r\nwhile a >= 0:\r\n ls.append(a + (s[0]-a*2))\r\n a = a - 1\r\nc = 1\r\nfor i in ls:\r\n if i % s[1] == 0:\r\n c = i\r\n break\r\nif c % s[1] == 0:\r\n print(c)\r\nelse:\r\n print(-1)\r\n", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\nm=l[1]\r\ncheck=True\r\nfor i in range((n+1)//2,n+1):\r\n if i%m==0:\r\n print(i)\r\n check=False\r\n break\r\nif check:\r\n print(-1)", "n,m = map(int, input().split())\r\nif n < m:\r\n print(-1)\r\nelse:\r\n if n % 2 == 0:\r\n for i in range(n//2,n + 1):\r\n if i % m == 0:\r\n print(i)\r\n break\r\n else:\r\n for i in range((n//2) + 1, n + 1):\r\n if i % m == 0:\r\n print(i)\r\n break", "n,m=map(int,input().split())\r\ng=n-n//2\r\nif n>=m:\r\n print(g+(-g)%m)\r\nelse:\r\n print(-1)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nif n<m:\r\n print(-1)\r\nelse:\r\n x = 0\r\n if n%2 == 0:\r\n x = n//2\r\n else:\r\n x = n//2 + 1\r\n \r\n if x%m == 0:\r\n d = x\r\n else:\r\n d = (x//m + 1)*m\r\n \r\n print(d)", "n , m = map(int,input().split())\r\nif(n<m):\r\n print(-1)\r\nelse:\r\n ans = (n+1)//2 + (m - ((n+1)//2)%m)%m\r\n print(ans)", "import math\r\ndef f():\r\n n,m=list(map(int,input().split(\" \")))\r\n upper_bound=n\r\n lower_bound=math.ceil(n/2)\r\n for i in range(lower_bound,upper_bound+1):\r\n if i%m==0:\r\n return i\r\n return -1\r\n \r\nprint(f())", "n, m = map(int,input().split())\r\n\r\nif m > n:\r\n print(\"-1\")\r\nelse:\r\n i = 1\r\n min_val = m\r\n max_val = 2*m\r\n flag = 1\r\n\r\n while flag:\r\n if n >= min_val and n <= max_val:\r\n break\r\n i += 1\r\n min_val = m *i\r\n max_val = 2* m * i\r\n print(m*i)\r\n\r\n \r\n", "from math import ceil\r\na,b = map(int,input().split())\r\nflag = 0\r\nmi = ceil(a/2)\r\nres = ceil(mi/b)\r\nres = res*b\r\n\r\nif res>=mi and res<=a:\r\n print(res)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nif n>=m:\r\n i=1\r\n while i*2*m<n:\r\n i+=1\r\n print(i*m)\r\nelse:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n N, M = map(int, input().split())\r\n MIN_MOVE_COUNT:int = -1 if N<M else (((N-1)//(2*M))+1)*M\r\n print(MIN_MOVE_COUNT)\r\n\r\nmain()", "n,m=map(int,input().split())\r\nif n<m:\r\n print(-1)\r\nelse:\r\n if n % (2*m) == 0:\r\n k=n//(2*m)\r\n else:\r\n k=n//(2*m)+1\r\n print(k*m)", "n,m=map(int,input().split())\r\nprint([(n-n//2)+(-(n-n//2))%m,-1][n<m])", "import sys\ninput = sys.stdin.readline\n\nn, m = map(int,input().split())\n\nif n < m:\n print(-1)\nelse:\n moves = n//2 + (n%2)\n while moves % m:\n moves += 1\n print(moves)", "n, m = map(int, input().split())\nif n % 2 != 0:\n l = ((n-1)//2)+1\n u = n\n for i in range(l, u+1):\n if i % m == 0:\n print(i)\n break\n else:\n print(-1)\nelse:\n l = (n//2)\n u = n\n for i in range(l, u+1):\n if i % m == 0:\n print(i)\n break\n else:\n print(-1)\n", "\r\nn, m = [int(k) for k in input().split()]\r\nif n < m:\r\n print('-1')\r\nelse:\r\n i = 1\r\n while(n > m * i * 2):\r\n i += 1\r\n print(m * i)", "n,m=map(int,input().split())\r\nl=(n+1)//2\r\na=(l+m-1)//m*m\r\nif a>n:\r\n print(-1)\r\nelse:\r\n print(a)\r\n", "#476A Dreamoon and Stairs\r\na,b=map(int,input().split())\r\nc=0\r\nif b>a:\r\n print(-1)\r\nelse:\r\n if a%2==0:\r\n c=a//2\r\n else:\r\n c=(a//2)+1\r\n if c%b==0:\r\n print(c)\r\n else:\r\n while c%b!=0:\r\n c+=1\r\n print(c)", "# https://codeforces.com/problemset/problem/476/A\r\nimport math\r\n\r\nn, m = [int(x) for x in input().split()]\r\n\r\nif n < m:\r\n print(-1)\r\nelse:\r\n div, mod = divmod(n, 2)\r\n min_steps = div + mod\r\n missing_steps = min_steps % m\r\n if missing_steps > 0:\r\n missing_steps = m - missing_steps\r\n print(min_steps + missing_steps)\r\n", "n, m = map(int, input().split())\r\nb1 = n\r\nb2 = 0\r\ns = None\r\nwhile True:\r\n if (b1 + b2) % m == 0:\r\n s = b1 + b2\r\n b1 -= 2\r\n b2 += 1\r\n if b1 < 0:\r\n break\r\nprint(s if s is not None else -1)\r\n", "\r\nn,m=map(int,input().split(' '))\r\n\r\nif n<m:\r\n print(-1)\r\nelse:\r\n c=n//2\r\n if n%2==1:\r\n c+=1\r\n \r\n while c%m!=0:\r\n c+=1\r\n print(c)\r\n ", "n,m=[int(i) for i in input().split()]\r\nmini=n//2+(n%2==1)\r\nfor i in range(mini, n+1):\r\n\tif i%m==0:\r\n\t\tprint(i)\r\n\t\texit()\r\nprint(-1)", "n, m = map(int, input().split())\r\na = list(range(0, n+1, m))\r\ne = 0+n\r\nd = 0\r\nmins = -1\r\nwhile e >= 0:\r\n if e + d in a:\r\n mins = e+d\r\n e -= 2\r\n d += 1\r\nprint(mins)\r\n", "import sys\r\nn , m = map(int, input().split())\r\n\r\nmmin = m\r\nmmax= m*2\r\ns =1\r\nwhile 1:\r\n if mmin*s>n:\r\n print(-1)\r\n break\r\n if mmin*s<=n and n<=mmax*s:\r\n print(s*m)\r\n break\r\n else:\r\n s+=1\r\n", "n,m = [int(i) for i in input().split(\" \")]\r\n# 10 2 ,, 6\r\nif n < m:\r\n print(-1)\r\nelse:\r\n with2and1 = n//2 + (n%2)\r\n while with2and1%m !=0 :\r\n with2and1 -=1\r\n with2and1 +=2\r\n print(with2and1)\r\n \r\n", "import math\r\nn,m = map(int,input().split())\r\na = math.ceil(n/(2*m))\r\nb = int(n/m)\r\n#print(a,b)\r\nif (a==b+1):\r\n print('-1')\r\nelse:\r\n print(m*a)", "n,m=map(int,input().split(\" \",1))\r\nsteps=n\r\nmoves=0\r\narray=[]\r\nfor g in range(1,n+1):\r\n array.append(m*g)\r\nif n==0:\r\n print(0)\r\nelif n<m:\r\n print(-1)\r\nelif n==m:\r\n print(m)\r\nelse:\r\n stop=True\r\n while (steps>0 and stop):\r\n if steps-2>=0:\r\n steps-=2\r\n moves+=1\r\n else:\r\n steps-=1\r\n moves+=1\r\n if steps==0:\r\n stop=False\r\n if moves in array:\r\n print(moves)\r\n else:\r\n while not(moves in array):\r\n moves+=1\r\n print(moves)\r\n", "a,b=map(int,input().split())\r\nif a<b:\r\n print(-1)\r\nelse:\r\n c1,c2=a>>1,a&1 \r\n if (c1+c2)%b==0:\r\n print(c1+c2)\r\n else:\r\n print((c1+c2)+(b-((c1+c2)%b)))", "def solve():\r\n n, m = map(int, input().split())\r\n \r\n if n < m:\r\n print(-1)\r\n return\r\n \r\n ans = n // 2 + n % 2\r\n while ans % m != 0:\r\n ans += 1\r\n \r\n print(ans)\r\n \r\nsolve()", "n,m=[int(x) for x in input().split()]\r\na=n/2\r\nif n%2!=0:\r\n a+=0.5\r\nfor i in range(int(a),n+1):\r\n if i%m==0:\r\n print(i)\r\n exit()\r\nprint('-1')", "n, m = map(int, input().split())\r\n\r\nif m > n:\r\n print(-1)\r\nelse:\r\n least_count = int(n / 2) + (n - int(n / 2) * 2)\r\n\r\n while least_count % m != 0:\r\n least_count += 1\r\n\r\n print(least_count)", "a,b=map(int, input().split())\r\nif b>a:\r\n print(\"-1\")\r\nelse:\r\n if a%2:\r\n r=(a//2)+1\r\n else:\r\n r=a//2\r\n while(r%b>0):\r\n r+=1\r\n print(r)", "n,m=map(int,input().split())\r\nx=n//2+n%2;res=(m-x%m)+x\r\nif(n<m):print(-1)\r\nelse:\r\n if(x%m==0):print(res-m)\r\n else:print(res)", "x,y=map(int,input().split())\r\nif y>x:\r\n print(-1)\r\nelse:\r\n print(((((x+1)//2)+(y-1))//y)*y)", "n, m = map(int, input().split())\r\ni = 0\r\nif n < m:\r\n print(-1)\r\nelse:\r\n while n > 0:\r\n n -= 2 * m\r\n i += 1\r\n print(m * i)", "n, m = map(int, input().split())\n\nans = 1e10\nfor y in range(n//2 + 1):\n if (n - y) % m == 0 and (n-(2*y)) >= 0:\n ans = min(ans, y+(n-(2*y)))\nprint(ans if ans != 1e10 else -1)\n\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 = 0\r\nif m > n:\r\n print(-1)\r\nelse:\r\n while True:\r\n if (n / 2 + s) % m:\r\n n -= 1\r\n s += 1\r\n else:\r\n break\r\n s += n / 2\r\n print(int(s))", "from math import ceil\r\n\r\ns = input()\r\ns = s.split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\nif s[0]<s[1]:\r\n print(-1)\r\nelse: \r\n k = ceil(s[0]/(2*s[1]))\r\n print(s[1]*k)\r\n\r\n\r\n# a = s[0] // 2\r\n# ls = []\r\n# while a >= 0:\r\n# ls.append(a + (s[0]-a*2))\r\n# a = a - 1\r\n# c = 1\r\n# for i in ls:\r\n# if i % s[1] == 0:\r\n# c = i\r\n# break\r\n# if c % s[1] == 0:\r\n# print(c)\r\n# else:\r\n # print(-1)\r\n'''\r\nDragons\r\ns = input()\r\ns = s.split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\nmatrix = []\r\nfor a in range(s[1]):\r\n row = list(map(int,input().split()))\r\n matrix.append(row)\r\nmatrix.sort() \r\nj = s[0]\r\ni = 0\r\nwhile j > matrix[i][0]:\r\n j = j + matrix[i][1]\r\n i = i + 1\r\n if i == s[1]:\r\n break\r\nif i == s[1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n'''\r\n'''\r\ns = input()\r\ns = s.split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\na = 2\r\nlt1=[]\r\nwhile a <= s[0]:\r\n lt1.append(a)\r\n a = a + 2\r\nb = 1\r\nlt2 = []\r\nwhile b <=s[0]:\r\n lt2.append(b)\r\n b = b + 2\r\nlt3 = lt2 + lt1\r\nprint(lt3[s[1]-1])\r\n'''\r\n'''\r\nn = int(input())\r\ns = input()\r\ns = s.split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\na = 0\r\nfor j in range(len(s)):\r\n if s[j] > a:\r\n a = s[j]\r\n x = j\r\nc = a\r\nfor k in range(len(s)):\r\n if s[k] <= c:\r\n c = s[k]\r\n y = k\r\nif s[0]==a and s[n-1]==c:\r\n print(0)\r\nelif y >= int(n/2) and x <= int(n/2):\r\n print(x-0+n-1-y)\r\nelse:\r\n print(x-0+n-1-y-1)\r\n\r\n'''\r\n'''\r\n#2D Matrix\r\nmatrix = []\r\nfor a in range(5):\r\n row = list(map(int,input().split()))\r\n matrix.append(row)\r\nfor i,j in enumerate(matrix):\r\n for k,l in enumerate(j):\r\n if l==1:\r\n print(abs(2-i)+abs(2-k))\r\n'''\r\n'''\r\n#Chat room\r\ns = input()\r\nlst1 = []\r\nfor i in range(len(s)):\r\n lst1.append(s[i])\r\nlst2 = ['h','e','l','l','o']\r\na = 0\r\nb = 0\r\nlst3 = []\r\nwhile b <= 4 and a <= (len(lst1) - 1):\r\n if lst1[a] == lst2[b]:\r\n lst3.append(lst1[a])\r\n a = a + 1\r\n b = b + 1\r\n else:\r\n a = a + 1 \r\nif lst2 == lst3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n'''\r\n'''\r\nn = int(input())\r\na = input()\r\na = a.split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\na.sort()\r\nj = len(a) - 2\r\nb = a[-1]\r\nsum = 0\r\nwhile j>=0:\r\n sum = sum + a[j]\r\n j = j - 1\r\ncount = 1\r\nk = len(a) - 2\r\nwhile b <= sum:\r\n count = count + 1\r\n b = b + a[k]\r\n sum = sum - a[k]\r\n k = k - 1\r\nprint(count)\r\n'''\r\n\r\n\r\n\r\n\r\n \r\n", "from math import *\r\nn,m=map(int,input().split())\r\nif(n<m):\r\n print(-1)\r\nelse:\r\n print(ceil((n-(n//2))/m)*m)", "n, m = map(int, input().split())\r\n#n is the number of steps\r\n#s is the number of moves\r\nif n >= m: #if n is divisible by m\r\n if n % 2 == 0: #if the number of steps is even\r\n s = n // 2\r\n else:\r\n s = n // 2 + 1 #if the number of steps is odd\r\n\r\n while (s % m != 0): #if the number is not a multiple of m\r\n s += 1\r\n print(s)\r\nelse:\r\n print(-1)", "n,m = map(int,input().split())\nif n < m :print(-1)\nelse:\n print((int((n - 0.5) / (2 * m)) + 1) * m)\n", "a,b=input().split()\r\na,b=int(a),int(b)\r\nstep=0\r\nif a>=b:\r\n if a%2!=0:\r\n step+=1\r\n a-=1\r\n step+=a//2\r\n if step%b==0:\r\n print(step)\r\n else:\r\n val=step//b\r\n rem=b*(val+1)-step\r\n print(step+rem)\r\nelse:\r\n print(-1)", "import math\r\na,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 for i in range(math.ceil(a/2),a+1):\r\n if i%b==0:\r\n print(i)\r\n break", "n,m=map(int,input().split())\r\nif(n<m):\r\n print(-1)\r\nelse:\r\n print((int((n-0.5)/(2*m))+1)*m)\r\n", "n, m = list(map(int, input().split()))\r\nif n >= m:\r\n if n % 2 == 0:\r\n s = n // 2\r\n else:\r\n s = n // 2 + 1\r\n while s % m != 0:\r\n s += 1\r\n print(s)\r\nelse:\r\n print(-1)", "def solve():\r\n q,w=map(int,input().split())\r\n if q>=w:\r\n r=q\r\n q=(q//2)+(q%2)\r\n while(q<r and q%w!=0):\r\n q+=1\r\n if q%w==0 and q<=r:\r\n print(q)\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)\r\na=1\r\nfor i in range(a):\r\n solve()\r\n", "n,m=map(int , input().split())\r\na=n//2\r\nb=n-(2*a)\r\nt=False\r\nwhile a>=0 and t==False:\r\n if (a+b)%m==0:\r\n print(a+b)\r\n t=True\r\n elif (a+b)%m!=0:\r\n a-=1\r\n b+=2\r\n t=False\r\nif t==False:\r\n print('-1')\r\n", "a,b=map(int,input().split())\nk=a//2 if a%2==0 else a//2+1\nwhile(k!=a):\n if k%b!=0:\n k+=1\n else:\n break\nif a<b:\n k=-1\nprint(k)\n", "arr=list(map(int, input().split()))\nn=arr[0]\nm=arr[1]\nflag=0\nfor a in range(1,n+1):\n b=int((n-a)/2)\n k=a+b\n if(k%m==0):\n print(k)\n flag=1\n break\n else:\n continue\nif flag==0:\n print(-1)\n\t \t \t \t \t\t \t\t \t\t\t\t \t\t", "n,m = map(int,input().split())\r\nres = n//2+n%2\r\nprint(-(-res//m)*m if n>=m else -1)", "n , m = list(map(int,input().split()))\r\nif n < m : print(-1)\r\nelse :\r\n c = n // 2 + n % 2\r\n while c % m != 0 :\r\n c = c + 1 \r\n print(c)", "\r\nfrom math import ceil\r\n\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\nn, m = MII()\r\n\r\nans = ceil(n/(2*m)) * m\r\n\r\nprint(ans if ans <= n else -1)", "n , m = map(int, input().split()) \r\nres = 0\r\nif m>n :\r\n res = -1\r\nelse :\r\n if n%2 == 1 :\r\n res = n//2 +1\r\n else :\r\n res = n//2 \r\n while res % m > 0 : \r\n res +=1\r\nprint(res)\r\n ", "# https://codeforces.com/problemset/problem/476/A\nn, m = map(int, input().split(' '))\n\nif n % 2 == 0:\n k = n // 2\nelse:\n k = (n - 1) // 2\n k = k + 1\n\nif k % m == 0:\n pass\nelse:\n while k % m != 0:\n k = k + 1\n\nif k > n:\n k = -1\n\nprint(k)", "res=0\r\na,b=map(int,input().split())\r\ntemp=a/2\r\nif a<b:\r\n print(-1)\r\nelif temp%b==0:\r\n print(int(temp))\r\nelse:\r\n print( int(temp) +( b - ( int ( temp ) % b ) ))\r\n \r\n \r\n\r\n", "n_and_m = [int(x) for x in input(\"\").split(\" \")]\nsteps, req_int = n_and_m[0], n_and_m[1]\n# minimal number of moves\nout = 0\ndef main():\n if req_int > steps: # find other not wokring soluctions\n print(-1)\n return\n elif req_int == 1:\n out = steps\n else:\n if steps % 2 == 0:\n out = (int(steps / 2))\n else:\n out = (int(steps / 2) + 1)\n\n if out % req_int == 0:\n print(out)\n else:\n found = False\n while not found:\n out += 1\n if out % req_int == 0:\n found = True\n elif out > steps:\n print(-1)\n return\n print(out)\n\nmain()\n", "n, m = map(int, input().split())\r\nmin_moves = (n + 1) // 2\r\nwhile min_moves % m != 0:\r\n min_moves += 1\r\n if min_moves > n:\r\n min_moves = -1\r\n break\r\nprint(min_moves)\r\n", "n,m=map(int,input().split())\r\nif n%2==0:\r\n for i in range(n//2,n+1):\r\n if i%m==0:\r\n print(i)\r\n break\r\n elif i ==n:\r\n print(-1)\r\nelse:\r\n for i in range((n+1)//2,n+1):\r\n if i%m==0:\r\n print(i)\r\n break\r\n elif i ==n:\r\n print(-1)\r\n", "l = [int(i) for i in input().split()]\r\nn = l[0]//2 + l[0]%2\r\nwhile(n<=l[0]):\r\n if(n%l[1]==0):\r\n break\r\n n+=1\r\nif(n>l[0]):\r\n print(-1)\r\nelse:\r\n print(n)", "n,m=map(int,input().split())\r\nr=n//2\r\nr1=n-r*2\r\nsum=r1+r\r\nif sum%m:\r\n f=0\r\n while(r>0):\r\n r-=1\r\n r1+=2\r\n sum=r+r1\r\n if(sum%m==0):\r\n f=1\r\n break\r\n print(sum if f else -1)\r\nelse:\r\n print(sum)\r\n", "a,b=map(int,input().split())\r\nif a>=b:\r\n x=a//b\r\n y=1\r\n while x<a and (int(y/b)!=y/b or y<a/2):\r\n y+=1\r\n x+=1\r\n print(y)\r\nelse:\r\n print(-1)", "import math\r\nn, t = map(int, input().split())\r\nif t > n:\r\n print(-1)\r\nelse:\r\n s = math.ceil(n/2)\r\n while True:\r\n if s%t == 0:\r\n print(s)\r\n break\r\n else:\r\n s += 1\r\n if s > n:\r\n print(-1)\r\n break\r\n\r\n\r\n", "n,x=map(int,input().split())\r\nif(n<x):\r\n print(-1)\r\nelse:\r\n if(n%2==0):\r\n c=n//2\r\n while(c%x!=0):\r\n c+=1\r\n print(c)\r\n else:\r\n c=(n//2)+1\r\n while(c%x!=0):\r\n c+=1\r\n print(c)", "n, m = map(int, input().split())\r\n\r\nif n < m:\r\n print(-1)\r\nelse:\r\n seq = [2] * (n // 2) + [1] * (n % 2)\r\n while len(seq) % m:\r\n seq.remove(2)\r\n seq.append(1)\r\n seq.append(1)\r\n\r\n print(len(seq))\r\n", "import math\r\n\r\ndef main():\r\n # input\r\n n, m = map(int, input().split())\r\n\r\n # soln\r\n steps = math.ceil(n/2)\r\n if n == 1:\r\n if m == 1:\r\n print(1)\r\n else:\r\n print(-1)\r\n elif steps%m == 0:\r\n print(steps)\r\n elif (m - steps%m) > steps:\r\n print(-1)\r\n else:\r\n print(steps + m - steps%m)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "'''Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.\r\n\r\nWhat is the minimal number of moves making him climb to the top of the stairs that satisfies his condition?\r\n\r\nInput\r\nThe single line contains two space separated integers n, m (0 < n ≤ 10000, 1 < m ≤ 10).\r\n\r\nOutput\r\nPrint a single integer — the minimal number of moves being a multiple of m. If there is no way he can climb satisfying condition print  - 1 instead.'''\r\n\r\nn, m = map(int,input().split())\r\na = 0\r\nc = 0\r\nwhile n>0:\r\n if n>=2:\r\n a = a+1\r\n n = n-2\r\n c = c+1\r\n\r\nif c%m==0:\r\n print(c)\r\nelse:\r\n while a>0:\r\n c = c+1\r\n a = a-1\r\n if c%m==0:\r\n print(c)\r\n exit()\r\n print(-1)", "n,m=map(int,input().split())\r\nprint(-[-n//2//m*m,1][n<m])", "a=list(map(int,input().split()))\r\nif a[0]<a[1]:\r\n print(-1)\r\nelse:\r\n k=a[0]//2\r\n if a[0]%2!=0:\r\n k+=1\r\n if k%a[1]==0:\r\n print(k)\r\n else:\r\n print(k-(k%a[1])+a[1])\r\n \r\n", "n,m=map(int,input().split())\r\nl=0\r\np=n//2 +(n%2)\r\nfor i in range(p,n+1):\r\n if i%m==0:\r\n print(i)\r\n l+=1\r\n break\r\n else:\r\n continue\r\nif l==0:\r\n print(\"-1\")", "n,m = map(int,input().split())\r\nif n%2==0:\r\n if n<m:\r\n print(-1)\r\n elif (n//2)%m==0:\r\n print(n//2)\r\n else:\r\n k=False\r\n steps=n//2\r\n while(k==False):\r\n if steps%m!=0:\r\n steps+=1\r\n elif steps%m==0:\r\n k=True\r\n print(steps)\r\nelse:\r\n if n<m:\r\n print(-1)\r\n else:\r\n k=False\r\n steps=(n//2)+1\r\n while(k==False):\r\n if steps%m!=0:\r\n steps+=1\r\n elif steps%m==0:\r\n k=True\r\n print(steps)", "n, m = map(int, input().split())\r\n\r\na = (n + 1) // 2\r\ncount = ((a + m - 1) // (m)) * m\r\n\r\nif count > n:\r\n count = -1\r\n \r\nprint(count)", "n,m=map(int, input().split())\r\n\r\na=int(n/2)+(n%2)\r\nf=0\r\nwhile(a<=n):\r\n if a%m==0:\r\n print(a)\r\n f=1\r\n break\r\n else:\r\n a+=1\r\nif f==0:\r\n print(\"-1\")\r\n", "n, m = map(int, input().split())\r\nif m>n: print(-1)\r\nelse:\r\n k=(n+1)//2\r\n while k%m!=0:\r\n k+=1\r\n print(k)", "n,m=map(int,input().split())\r\nt=(n+1)//2\r\ns=(t-1)//m*m+m\r\nprint([s,-1][s>n])", "x,y = map(int,input().split())\r\nif y>x:\r\n print(-1)\r\nelif y==x:\r\n print(y)\r\nelse:\r\n c = x//2 + x%2\r\n if c%y==0:\r\n print(c)\r\n else:\r\n while c%y!=0 and c<=x:\r\n c += 1\r\n print(c)", "n,m=tuple(map(int,input().split()))\r\nif n<m:\r\n print(-1)\r\nelse:\r\n p1=m%2\r\n ns=m//2\r\n p=n//m\r\n q=n%m\r\n rs=p*p1+q\r\n mins=(ns*p+rs//2+rs%2)\r\n del p1,ns,p,q,rs\r\n if mins%m==0:\r\n print(mins)\r\n else:\r\n print(mins+(m-(mins%m)))", "n, m = map(int, input().split())\r\nsteps = -(-n//2)\r\nif n < m:\r\n print(-1)\r\nelse:\r\n if steps % m == 0:\r\n print(steps)\r\n else:\r\n next = steps + (m-(steps%m))\r\n print(next)", "import math\r\n\r\nstairs, m = map(int, input().split())\r\nfound = False\r\nif m > stairs:\r\n print(-1)\r\n exit()\r\nfor i in range(math.ceil(stairs / 2), stairs + 1):\r\n if i % m == 0 and stairs >= math.ceil(i / m) * m:\r\n print(i)\r\n found = True\r\n break\r\nif not found:\r\n print(-1)\r\n", "from sys import stdin,stdout\r\nfrom math import *\r\nif __name__==\"__main__\":\r\n # for _ in range(int(input().split())):\r\n n,m=map(int,input().split())\r\n res=-1\r\n l=(n+1)//2\r\n r=n\r\n f=0\r\n for i in range(l,r+1):\r\n if i%m==0:\r\n print(i)\r\n f=1\r\n break\r\n if f==0:print(res)", "# '''\r\n# shelby70\r\n# '''\r\nimport math\r\nn, m= map(int, input().split())\r\n\r\nleast= math.ceil(n/2)\r\nfor i in range(least, n+1):\r\n if i%m== 0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r\n", "import math\r\ndef main():\r\n n,m=map(int,input().split())\r\n if n<m:\r\n print(-1)\r\n return\r\n temp=n/2\r\n if temp%m==0:\r\n print(int(temp))\r\n else:\r\n temp/=m\r\n temp=math.ceil(temp)\r\n temp*=m\r\n print(temp)\r\n \r\n \r\n\r\nmain()\r\n ", "def main():\n\tn, m = [int(i) for i in input().split()]\n\n\tif n < m:\n\t\tprint(-1)\n\telse:\n\t\tminsteps = n // 2 + n % 2\n\t\tif minsteps % m == 0:\n\t\t\tprint(minsteps)\n\t\telse:\n\t\t\tprint(minsteps + m - (minsteps % m))\n\nif __name__ == \"__main__\":\n\tmain()\n\t\t\t\t \t\t\t\t\t \t \t \t \t\t \t\t", "def solve(n, m):\r\n if(m > n):\r\n return -1\r\n a = 0\r\n if(n%2 == 0):\r\n a = n // 2\r\n else:\r\n a = n//2 + 1\r\n while(a%m != 0):\r\n a += 1\r\n return a\r\n\r\nn, m = map(int, input().split())\r\nprint(solve(n, m))", "stairs, multiple = map(int, input().split())\r\n\r\ntwos = 0\r\nones = 0\r\nif stairs < multiple:\r\n print(-1)\r\nif stairs % 2 == 0:\r\n twos = stairs // 2\r\n ones = 0\r\nelse:\r\n twos = stairs // 2\r\n ones = 1 \r\n\r\n# check = True\r\n# if (stairs / multiple)\r\nwhile twos >= 0:\r\n if (twos + ones) % multiple == 0:\r\n print(twos + ones)\r\n break\r\n\r\n else:\r\n twos -= 1\r\n ones += 2\r\n", "n,m = list(map(int,input().split()))\r\nif n<m:\r\n print(-1)\r\nelse:\r\n result=0\r\n while n>0:\r\n if n % 2 ==0:\r\n result+=1\r\n n-=2\r\n else:\r\n n-=1\r\n result+=1\r\n if result%m==0:\r\n print(result)\r\n else:\r\n while result%m!=0:\r\n result+=1\r\n print(result)", "stairs_count, number = (int(x) for x in input().split())\r\nuns = False\r\nif stairs_count%2 == 0:\r\n\ti = stairs_count//2\r\nelse:\r\n\ti = stairs_count//2 + 1\r\nwhile i <= stairs_count:\r\n\tif i%number == 0:\r\n\t\tuns = True\r\n\t\tbreak\r\n\ti += 1\r\nif uns == True:\r\n\tprint(i)\r\nelse:\r\n\tprint(-1)", "length, k = tuple(int(i) for i in input().split())\r\n\r\nif k > length:\r\n print(-1)\r\nelse:\r\n if length & 1:\r\n x = length // 2 + 1\r\n else:\r\n x = length // 2\r\n \r\n if x % k == 0:\r\n print(x)\r\n else:\r\n while x % k != 0:\r\n x += 1\r\n \r\n print(x)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\n\r\nb1 = False\r\nstart = 1\r\nif n < m:\r\n print(-1)\r\nelse:\r\n while b1==False:\r\n if (2*(m*start)) - n >= 0:\r\n break\r\n start+=1\r\n print(m*start)\r\n", "n, m = map(int, input().split())\r\n# lst = []\r\n\r\nif n < m:\r\n print(-1)\r\nelse:\r\n if n % 2 == 0:\r\n a = n // 2\r\n else:\r\n a = n // 2 + 1\r\n \r\n while a % m != 0:\r\n a += 1\r\n \r\n print(a)", "#https://codeforces.com/problemset/problem/476/A\r\n\r\ndef get_multipleList(height, moves):\r\n times = height // moves\r\n multiples_list = []\r\n for x in range(times):\r\n multiples_list.append(moves*(x+1))\r\n return multiples_list\r\n\r\n\r\n\r\n(n, m) = (int(x) for x in input().split())\r\nmultiples_list = get_multipleList(n,m)\r\nanswer = -1\r\nfor number_of_moves in multiples_list:\r\n if(number_of_moves * 2 >= n):\r\n answer = number_of_moves\r\n break\r\nprint(answer)\r\n", "a,b=map(int,input().split())\r\nif b>a:print(-1)\r\nelse:\r\n c=(a//2)+(a%2)\r\n while c%b!=0:\r\n c+=1\r\n print(c)", "def main():\r\n n, m = map(int, input().split())\r\n\r\n if m > n:\r\n print(-1)\r\n else:\r\n twos = n // 2\r\n ones = n % 2\r\n moves = twos + ones\r\n\r\n while moves % m != 0:\r\n moves += 1\r\n \r\n print(moves)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int, input().split())\r\n\r\n# 1 - [1,2], 2 - [2,3,4], 3 - [3,4,5,6], 4- [4,5,6,7,8], 5 - [5,6,7,8,9,10]\r\n\r\n# O(N^2) Soln\r\nl = n // 2\r\nans = -1\r\nflag = 0\r\nfor i in range(l,n + 1):\r\n if flag == 1:\r\n break\r\n for j in range(i,2*i + 1):\r\n if j == n and i % m == 0:\r\n ans = i\r\n flag = 1\r\n break\r\nprint(ans)\r\n\r\n# O(N) Soln\r\n\r\n\r\n# O(1) Soln No. 1\r\n# if n < m or (n % 2 == 1 and m % 2 == 0):\r\n# print(-1)\r\n# else:\r\n# k = n // 2\r\n# if ((n//2) % m == 0 and n % 2 == 0):\r\n# k = n // 2\r\n# elif ((n//2) % m == 0 and n % 2 != 0):\r\n# k += m\r\n# else:\r\n# k += m - ((n//2) % m)\r\n# print(k)\r\n\r\n# O(1) Soln No. 2\r\n# k = (n + 1) // 2\r\n# ans = ((k + m - 1) // m) * m\r\n# if ans > n:\r\n# ans = -1\r\n# print(ans)\r\n", "n_m = input().split()\r\nn = int(n_m[0])\r\nm = int(n_m[1])\r\nif m > n:\r\n print(-1)\r\nif n%2 != 0:\r\n nByTwo = ((n + 1) //2)\r\nelse:\r\n nByTwo = n//2\r\nif m >= nByTwo:\r\n i = m\r\nelse:\r\n i = 0\r\n while i < nByTwo:\r\n i = i + m\r\nwhile i <= n:\r\n if n %2 == 0 and (((i - n//2) * 2) + ((n - i) * 2) == n):\r\n print(i)\r\n break\r\n if n % 2 != 0 and (((i - n//2) * 2) + ((n - i) * 2) == n + 1):\r\n print(i)\r\n break\r\n i = i * m", "n,m=map(int,input().split())\r\nif n<m:\r\n print(-1)\r\n\r\nelse:\r\n if n%2==0:\r\n c=n//2\r\n \r\n else:\r\n c=(n+1)//2\r\n for i in range(c,n+1):\r\n if i%m==0:\r\n print(i)\r\n break\r\n else:\r\n print(-1) ", "import math\r\nn, m = [int(i) for i in input().split()]\r\nif m > n:\r\n print(-1)\r\nelse:\r\n t = n // 2 + n % 2\r\n print(math.ceil(t / m) * m)", "n,m=[int(_) for _ in input().split()]\r\nru=n//2+n%2\r\nwhile not ru%m==0:\r\n ru+=1\r\n if ru>n:\r\n break\r\nprint(ru if ru<=n else -1)", "n,m=map(int,input().split())\r\nif n<m:\r\n\tprint(-1)\r\nelse:\r\n\tk=n//2+n%2\r\n\twhile k%m:\r\n\t\tk+=1\r\n\tprint(k)", "n, m = map(int, input().split())\r\nif n%2==0:\r\n arr = [2]*(n//2)\r\nelse:\r\n arr = [2]*(n//2) + [1]\r\nif m>n:\r\n print(-1)\r\nelse:\r\n while len(arr)%m!=0:\r\n arr.pop()\r\n arr.extend((1,1))\r\n\r\n print(len(arr))", "from sys import stdin\r\nfrom math import ceil\r\n\r\ndef main():\r\n n , m = [float(x) for x in stdin.readline().split()]\r\n if n < m:\r\n print(-1)\r\n else:\r\n resp = ceil(n / 2)\r\n while resp % m != 0:\r\n resp += 1\r\n\r\n print(resp)\r\n \r\n\r\nmain()", "n, m = map(int, input().split())\r\n\r\nfor qty_twos in range(n // 2, -1, -1):\r\n qty_ones = n - 2 * qty_twos\r\n\r\n if (qty_twos + qty_ones) % m == 0:\r\n print(qty_twos + qty_ones)\r\n exit(0)\r\n\r\nprint(-1)", "n,m=map(int, input().split(\" \"))\nlow = (n//2) + (n%2)\nada = False\nfor i in range(low,n+1):\n if i%m == 0:\n print (i)\n ada=True\n break\nif not ada:\n print (\"-1\")\n \n", "from math import floor, ceil\r\nn, m = map(int, input().split())\r\nif floor(n/m)-ceil(ceil(n/2)/m)>=0:\r\n print(ceil(ceil(n/2)/m)*m)\r\nelse:\r\n print(-1)" ]

[ "a,b,c = map(int, input().split())\nx,y,z = map(int, input().split())\nextra = max(0, a-x)//2 + max(0, b-y)//2 + max(0, c-z)//2\nneed = max(0, x-a) + max(0, y-b) + max(0, z-c)\nprint(\"Yes\" if need<=extra else \"No\")\n\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\np=0\r\nk=0\r\nfor i,j in zip(a,b):\r\n if i>j:\r\n p+=(i-j)//2\r\n if i<j:\r\n k+=j-i\r\nif p>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n# for _ in range(int(input())):\r\na,b,c = map(int,input().split(\" \"))\r\nx,y,z = map(int,input().split(\" \"))\r\ndiff = [a-x,b-y,c-z]\r\nans = 0\r\nfor i in range(3):\r\n if diff[i] > 0:\r\n diff[i] //= 2\r\n ans += diff[i]\r\nif ans >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nz = 0\r\nfor i in range(3):\r\n z += max((a[i] - b[i])//2, 0) \r\n if a[i] < b[i]:\r\n z -= b[i] - a[i]\r\nprint ('Yes' if z >= 0 else 'No')\r\n", "class CodeforcesTask606ASolution:\n def __init__(self):\n self.result = ''\n self.a_b_c = []\n self.x_y_z = []\n\n def read_input(self):\n self.a_b_c = [int(x) for x in input().split(\" \")]\n self.x_y_z = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n remains = [self.a_b_c[x] - self.x_y_z[x] for x in range(3)]\n budget = sum([x // 2 for x in remains if x > 0])\n needed = sum([-x for x in remains if x < 0])\n if budget >= needed:\n self.result = \"Yes\"\n else:\n self.result = \"No\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask606ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "a = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\ne = 0\r\nfor i in range(3):\r\n if a[i] - y[i] >= 0:\r\n e += (a[i] - y[i]) // 2\r\n else:\r\n e += a[i] - y[i]\r\n \r\nprint(\"YES\" if e >= 0 else \"NO\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n# = input()\n# = int(input())\n\n#() = (i for i in input().split())\n# = [i for i in input().split()]\n\na = [int(i) for i in input().split()]\nx = [int(i) for i in input().split()]\n\nstart = time.time()\n\nans = 0\n\nfor i in range(3):\n a[i] -= x[i]\n if a[i] > 0:\n ans += divmod(a[i], 2)[0]\n else:\n ans += a[i]\n\nif ans >=0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\nfinish = time.time()\n#print(finish - start)\n", "if sum([min(int(a)-int(x), (int(a)-int(x))//2 ) for a,x in zip(input().split(),input().split())])>=0:\r\n print('Yes')\r\nelse:\r\n print('No')", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\ndiff = 0\r\ndiff += ((a - x) // 2) if a > x else (a - x)\r\ndiff += ((b - y) // 2) if b > y else (b - y)\r\ndiff += ((c - z) // 2) if c > z else (c - z)\r\n\r\nprint(\"Yes\" if diff >= 0 else \"No\")\r\n", "arr = [int(i) for i in input().split()]\r\nres = [int(i) for i in input().split()]\r\np, m = 0, 0\r\nfor i in range(3):\r\n if arr[i] > res[i]:\r\n p += (arr[i] - res[i]) // 2\r\n else:\r\n m += res[i] - arr[i]\r\nprint(['No', 'Yes'][p >= m])\r\n", "z = lambda: list(map(int, input().split()))\r\nx = z()\r\ny = z()\r\ns = 0\r\nfor i in range(3):\r\n k = x[i] - y[i]\r\n if k < 0: s += k\r\n else: s += k // 2\r\nif s<0: print(\"No\")\r\nelse: print(\"Yes\")", "a = [int(i) for i in input().split()]\r\nneed = [int(i) for i in input().split()]\r\nfor i in range(3):\r\n k = min(a[i], need[i])\r\n a[i] -= k\r\n need[i] -= k\r\nfor i in range(3):\r\n for j in range(3):\r\n if i == j or a[i] < 2 or need[j] == 0:\r\n continue\r\n k = need[j] * 2\r\n k = min(a[i] // 2 * 2, k)\r\n a[i] -= k\r\n need[j] -= k // 2\r\n# print(need)\r\nprint(\"Yes\" if need == [0, 0, 0] else \"No\")\r\n", "isa,isb,isc = map(int, input().split())\nna,nb,nc = map(int, input().split())\nfa = isa-na\nfb = isb-nb\nfc = isc-nc\nfa = max(fa,0)\nfb = max(fb,0)\nfc = max(fc,0)\nfa = fa // 2\nfb = fb // 2\nfc = fc // 2\ncanmake = fa+fb+fc\n\npa = na-isa\npb = nb-isb\npc = nc-isc\n\npa = max(0, pa)\npb = max(0, pb)\npc = max(0, pc)\n\nneedmake = pa+pb+pc\nif(needmake <= canmake):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t\t \t\t \t \t\t\t\t\t\t\t \t\t", "l_c_h = list(map(int, input().split()))\r\nl_c_n = list(map(int, input().split()))\r\n\r\ne = 0\r\nfor i in range(3):\r\n if l_c_h[i] - l_c_n[i] >= 0:\r\n e += (l_c_h[i] - l_c_n[i]) // 2\r\n else:\r\n e += l_c_h[i] - l_c_n[i]\r\n \r\nprint(\"YES\" if e >= 0 else \"NO\")", "I=lambda:list(map(int,input().split()))\r\na,x=I(),I()\r\ns,z=0,0\r\nfor i in range(3):\r\n if a[i]>x[i]:s+=(a[i]-x[i])//2\r\n else:z+=x[i]-a[i]\r\nprint(\"NO\" if z>s else\"YES\")", "a, b, c = [int(i) for i in input().split()]\r\nx, y, z = [int(j) for j in input().split()]\r\na, b, c = a - x, b - y, c - z\r\nresult = 0\r\nif a > 0:\r\n result += a // 2\r\nelse:\r\n result += a\r\nif b > 0:\r\n result += b // 2\r\nelse:\r\n result += b\r\nif c > 0:\r\n result += c // 2\r\nelse:\r\n result += c\r\nif result >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n\r\n\r\n\r\n", "a,b,c = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\npos = 0\r\nneg = 0\r\nfor i in [a-x,b-y,c-z]:\r\n\tif i > 0:\r\n\t\tpos += i//2\r\n\telse:\r\n\t\tneg += abs(i)\r\nif pos>=neg:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')\r\n\r\n", "a, b, c = [int(x) for x in input().split()]\nx, y, z = [int(x) for x in input().split()]\nk1, k2, k3 = sorted([(a - x), (b - y), (c - z)])\nif (k2 < 0) and (k3//2 + k2 + k1 < 0) or k3//2 + k2//2 + k1 < 0:\n print('No')\nelse:\n print('Yes')\n", "a,b,c = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nif a > x:\r\n a1 = 0\r\n a2 = (a-x)//2\r\nelse:\r\n a1 = x-a\r\n a2 = 0\r\n\r\nif(b>y):\r\n b1 = 0\r\n b2 = (b-y)//2\r\nelse:\r\n b1 = y - b\r\n b2 = 0\r\nif(c>z):\r\n c1 = 0\r\n c2 = (c-z)//2\r\nelse:\r\n c1 = z-c\r\n c2 = 0\r\nif(a2+b2+c2 >= a1+b1+c1):\r\n print('yes')\r\nelse:\r\n print('no')", "a, b, c = [int(q) for q in input().split()]\r\nx, y, z = [int(q) for q in input().split()]\r\nif a>=x:\r\n a -= x\r\n x = 0\r\nelse:\r\n x -= a\r\n a = 0\r\nif b>=y:\r\n b -= y\r\n y = 0\r\nelse:\r\n y -= b\r\n b = 0\r\nif c>=z:\r\n c -= z\r\n z = 0\r\nelse:\r\n z -= c\r\n c = 0\r\n\r\nif x+y+z <= a//2 + b//2 + c//2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nfor i in range(len(a)):\r\n if a[i]>b[i]:\r\n x+=int((a[i]-b[i])/2)\r\n if a[i]<b[i]:\r\n y+=int(b[i]-a[i])\r\nif x>=y:\r\n print('Yes')\r\nif x<y:\r\n print('No')\r\n", "A = list(map(int, input().split()))\nB = list(map(int, input().split()))\ns1, s2 = 0, 0\nfor i in range(3):\n if A[i] - B[i] > 0:\n s1 += (A[i] - B[i]) // 2\n else:\n s2 += B[i] - A[i]\nprint(\"Yes\" if s1 >= s2 else \"No\")\n\n \t \t \t\t \t \t \t \t\t \t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\na1 = a-x\r\nb1 = b-y\r\nc1 = c-z\r\n\r\nx = 0\r\ny = 0\r\nfor i in [a1,b1,c1]:\r\n if i > 0:\r\n x += i//2\r\n else:\r\n y -= i\r\nif x >= y:\r\n print('Yes')\r\nelse:\r\n print('No')", "def possible(has, needs):\n extra = 0\n needed = 0\n for (h, n) in zip(has, needs):\n if h > n:\n extra += (h-n)//2\n else:\n needed += n-h\n return extra >= needed\n\n\nif __name__ == '__main__':\n a, b, c = map(int, input().split())\n x, y, z = map(int, input().split())\n print('Yes' if possible((a, b, c), (x, y, z)) else 'No')\n", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nneed = max(x-a,0) + max(y-b,0) + max(z-c,0)\r\n\r\nextra = max(a-x,0)//2*2 + max(b-y,0)//2*2 + max(c-z,0)//2*2\r\n\r\nif need * 2 <= extra:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a,b,c=[int(x) for x in input().split()]\nx,y,z=[int(x) for x in input().split()]\nr1=a-x\nr2=b-y\nr3=c-z\ns1=max(0,r1)//2\ns2=max(0,r2)//2\ns3=max(0,r3)//2\nt1=min(0,r1)\nt2=min(0,r2)\nt3=min(0,r3)\nans=s1+s2+s3+t1+t2+t3\n#print(ans)\nif ans>=0:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n", "__author__ = 'Utena'\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nt1=0\r\nt=[0]*3\r\nfor i in range(3):\r\n if x[i]>=y[i]:t[i]=x[i]-y[i]\r\n else:t1+=y[i]-x[i]\r\nif int(t[0]/2)+int(t[2]/2)+int(t[1]/2)>=t1:print(\"YES\")\r\nelse:print(\"NO\")", "from sys import stdin, exit\ninputs = map(int, next(stdin).split())\noutputs = map(int, next(stdin).split())\n\nextras = [x - y for x, y in zip(inputs, outputs)]\n\nfor i in range(3):\n if extras[i] < 0:\n for x in range(3):\n while extras[i] < 0 and extras[x] > 1:\n extras[i] += 1\n extras[x] -= 2\n\n if extras[i] < 0:\n print(\"NO\")\n exit(0)\n\nprint(\"YES\")\n\n\t\t \t\t \t \t\t \t \t \t\t\t\t \t", "# 606A\r\n# θ(1) time\r\n# θ(1) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n a, b, c = read(3)\r\n x, y, z = read(3)\r\n if a < x:\r\n if b > y + 1:\r\n r = min(x - a, (b - y) // 2)\r\n a += r\r\n b -= 2 * r\r\n if a < x and c > z + 1:\r\n r = min(x - a, (c - z) // 2)\r\n a += r\r\n c -= 2 * r\r\n if b < y:\r\n if a > x + 1:\r\n r = min(y - b, (a - x) // 2)\r\n b += r\r\n a -= 2 * r\r\n if b < y and c > z + 1:\r\n r = min(y - b, (c - z) // 2)\r\n b += r\r\n c -= 2 * r\r\n if c < z:\r\n if a > x + 1:\r\n r = min(z - c, (a - x) // 2)\r\n c += r\r\n a -= 2 * r\r\n if c < z and b > y + 1:\r\n r = min(z - c, (b - y) // 2)\r\n c += r\r\n b -= 2 * r\r\n return 'Yes' if x <= a and y <= b and z <= c else 'No'\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "a, b, c = map(int, input().split())\r\naa, bb, cc = map(int, input().split())\r\n\r\ndef max(a, b):\r\n if a > b:\r\n return a\r\n return b\r\n\r\nk = 0\r\nk += max((a-aa) // 2, 0)\r\nk += max((b-bb) // 2, 0)\r\nk += max((c-cc) // 2, 0)\r\n\r\nk -= max(aa - a, 0)\r\nk -= max(bb - b, 0)\r\nk -= max(cc - c, 0)\r\n\r\nif k >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = str(input()).split()\r\na = int(s[0])\r\nb = int(s[1])\r\nc = int(s[2])\r\ns = str(input()).split()\r\nx = int(s[0])\r\ny = int(s[1])\r\nz = int(s[2])\r\n\r\nxx = a - x\r\nyy = b - y\r\nzz = c - z\r\nif xx > 0:\r\n xx //= 2\r\nif yy > 0:\r\n yy //= 2\r\nif zz > 0:\r\n zz //= 2\r\nk = xx + yy + zz\r\nif k >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "x = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\n\r\nu = 0\r\nv = 0\r\nfor i in range(len(x)):\r\n if x[i] >= y[i]:\r\n u += (x[i] - y[i]) // 2\r\n else:\r\n v += y[i] - x[i]\r\n\r\nif u >= v:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a, b, c = map(int, input().split(\" \"))\r\nx, y, z = map(int, input().split(\" \"))\r\n\r\nex=0\r\nne=0\r\nif a>=x:\r\n ex+=(a-x)//2\r\nelse:\r\n ne+=x-a\r\nif b>=y:\r\n ex+=(b-y)//2\r\nelse:\r\n ne+=y-b\r\nif c>z:\r\n ex+=(c-z)//2\r\nelse:\r\n ne+=z-c\r\n\r\nif ex>=ne:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "if __name__ == '__main__':\r\n ff = list(map(int, input().split()))\r\n tt = list(map(int, input().split()))\r\n foo = too = 0\r\n for i in range(3):\r\n if ff[i] < tt[i]:\r\n too += tt[i] - ff[i]\r\n else:\r\n foo += (ff[i] - tt[i]) // 2\r\n print('No') if foo < too else print('Yes')\r\n", "has = list(map(int, input().split()))\r\nneed = list(map(int, input().split()))\r\nif sum(need) > sum(has):\r\n print('No')\r\n exit(0)\r\nelse:\r\n b = has[0] - need[0]\r\n p = has[1] - need[1]\r\n o = has[2] - need[2]\r\n have, nd = 0, 0\r\n if b >= 0:\r\n have += b // 2\r\n else:\r\n nd += b\r\n if p >= 0:\r\n have += p // 2\r\n else:\r\n nd += p\r\n if o >= 0:\r\n have += o // 2\r\n else:\r\n nd += o\r\n if nd + have >= 0:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nk = [0]*3\r\nk[0] = a - x\r\nk[1] = b - y\r\nk[2] = c - z\r\n\r\nsum = 0\r\n\r\nfor i in range(3):\r\n if k[i] > 0:\r\n sum += k[i]//2\r\n else:\r\n sum += k[i]\r\n\r\nif sum < 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n \r\n", "a = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nt, k = 0, 0\r\nfor i in range(3):\r\n t += max(0, a[i] - b[i]) // 2\r\n if a[i] < b[i]:\r\n k += b[i] - a[i]\r\nprint(\"Yes\" if t >= k else \"No\")", "import sys\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nif x > a:\r\n o = max(0, min((b-y)//2, x-a))\r\n b -= o * 2\r\n a += o\r\n if x > a:\r\n o = max(0, min((c-z)//2, x-a))\r\n c -= o * 2\r\n a += o\r\n if x > a:\r\n print('No')\r\n sys.exit()\r\nif y > b:\r\n o = max(0, min((a-x)//2, y-b))\r\n a -= o * 2\r\n b += o\r\n if y > b:\r\n o = max(0, min((c-z)//2, y-b))\r\n c -= o * 2\r\n b += o\r\n if y > b:\r\n print('No')\r\n sys.exit()\r\n\r\nif z > c:\r\n o = max(0, min((b-y)//2, z-c))\r\n b -= o * 2\r\n c += o\r\n if z > c:\r\n o = max(0, min((a-x)//2, z-c))\r\n a -= o * 2\r\n c += o\r\n if z > c:\r\n print('No')\r\n sys.exit()\r\n \r\nprint('Yes')\r\n", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nsm1 = sm2 = 0\r\n\r\nfor i in range(0 , 3):\r\n if a[i] > b[i] :\r\n sm1 += (a[i] - b[i]) // 2\r\n\r\n else:\r\n sm2 += (b[i] - a[i])\r\n\r\nif (sm1 >= sm2):\r\n print('Yes')\r\nelse:\r\n print('No')", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\na = a - x\r\nb = b - y\r\nc = c - z\r\n\r\nhave = 0\r\nneed = 0\r\nfor i in (a,b,c):\r\n if i > 0:\r\n have += i//2\r\n elif i < 0:\r\n need += i\r\n\r\nif have >= abs(need):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys\r\nimport math\r\ninput=sys.stdin.readline\r\na,b,c=(int(i) for i in input().split())\r\nx,y,z=(int(i) for i in input().split())\r\nreq=0\r\nhv=0\r\nif(a<x):\r\n req+=(x-a)\r\nelse:\r\n hv+=(a-x)//2\r\nif(b<y):\r\n req+=(y-b)\r\nelse:\r\n hv+=(b-y)//2\r\nif(c<z):\r\n req+=(z-c)\r\nelse:\r\n hv+=(c-z)//2\r\nif(hv>=req):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "l1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nhave = need = 0\r\nfor i in range(3):\r\n if l1[i]-l2[i]<0:\r\n need += l2[i]-l1[i]\r\n else:\r\n have += (l1[i]-l2[i])//2\r\nif have>=need:\r\n print('yes')\r\nelse:\r\n print('no')", "a,b,c=input().split()\r\na,b,c=int(a),int(b),int(c)\r\nx,y,z=input().split()\r\nx,y,z=int(x),int(y),int(z)\r\ntotal=0\r\nreq=0\r\nif(a-x>=0):\r\n total=total+int((a-x)/2)\r\nelse:\r\n req=req-(a-x)\r\nif(b-y>=0):\r\n total=total+int((b-y)/2)\r\nelse:\r\n req=req-(b-y)\r\nif(c-z>=0):\r\n total=total+int((c-z)/2)\r\nelse:\r\n req=req-(c-z)\r\nif(total>=req):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a, b, c = tuple(map(int, input().split()))\r\nx, y, z = tuple(map(int, input().split()))\r\n\r\nhave = 0\r\nneed = 0\r\n\r\nif a > x:\r\n have += (a - x) // 2\r\nelse:\r\n need += x - a\r\n\r\nif b > y:\r\n have += (b - y) // 2\r\nelse:\r\n need += y - b\r\n \r\nif c > z:\r\n have += (c - z) // 2\r\nelse:\r\n need += z - c\r\n\r\nif need > have:\r\n print('No')\r\nelse:\r\n print('Yes')", "import math\r\n\r\nf = lambda a, x: (a - x) // 2 if a >= x + 2 else 0\r\n\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nmaxOps = f(a, x) + f(b, y) + f(c, z)\r\nminOps = max(x - a, 0) + max(y - b, 0) + max(z - c, 0)\r\nif minOps > maxOps:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "a = map(int, input().split())\r\nb = map(int, input().split())\r\ns1 = s2 = 0\r\nfor x, y in zip(a, b):\r\n if x > y:\r\n s1 += (x - y) // 2\r\n else:\r\n s2 += y - x\r\n\r\nif s1 >= s2:\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")\r\n\r\n", "a,b,c=map(int,input().split())\nx,y,z=map(int,input().split())\na=a-x;b=b-y;c=c-z;\nfrag=0\nif(a>0):\n frag+=a//2;\nelse:\n frag+=a;\nif(b>0):\n frag+=b//2;\nelse:\n frag+=b;\nif(c>0):\n frag+=c//2;\nelse:\n frag+=c;\nprint(\"Yes\" if frag>=0 else\"No\")\n\t \t \t\t\t\t\t \t \t \t \t \t\t\t\t", "# a,b,c,d,e = map(int, input().split())\n# sum=a+b+c+d+e\n# numj=0\n# if (a%2==1):\n# numj+=1\n# if (b % 2 == 1):\n# numj += 1\n# if (c % 2 == 1):\n# numj += 1\n# if (d % 2 == 1):\n# numj += 1\n# if (e % 2 == 1):\n# numj += 1\n# numo=5-numj\n# if (sum%5 == 0):\n# bb=int(sum/5)\n# if (bb%2==1):\n# if (numo==0 or numo==2 or numo==4):\n# print(bb)\n# else:\n# print(-1)\n# else:\n# if (numj == 0 or numj == 2 or numj == 4):\n# print(bb)\n# else:\n# print(-1)\n#\n# else:\n# print(-1)\n\n\n\na,b,c = map(int, input().split())\nx,y,z = map(int, input().split())\nsum = int((a-x)/2)+int((b-y)/2)+int((c-z)/2)\nque = 0\nsum = 0\nif (a>x):\n sum += int((a-x)/2)\nelse:\n que += x-a\nif (b>y):\n sum+=int((b-y)/2)\nelse:\n que += y-b\nif (c>z):\n sum+=int((c-z)/2)\nelse:\n que+=z-c\nif (sum>=que):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "a,b,c=[int(x) for x in input().split()]\nna,nb,nc=[int(x) for x in input().split()]\nthere=max(0,a-na)//2\nthere+=max(0,b-nb)//2\nthere+=max(0,c-nc)//2\nreq=max(0,na-a)+max(0,nb-b)+max(0,nc-c)\nif there>=req:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "def moves(x, y):\r\n return (x - y) // (2 if x > y else 1)\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\ns = moves(a, x) + moves(b, y) + moves(c, z)\r\nprint('Yes' if s >= 0 else 'No')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nu = 0\r\nfor i, j in [(a, x), (b, y), (c, z)]:\r\n u += (i - j) // 2 if i > j else i - j\r\nans = \"Yes\" if u >= 0 else \"No\"\r\nprint(ans)", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nx = y = 0\r\nfor i in range(3):\r\n if a[i] < b[i]:\r\n y += b[i] - a[i]\r\n elif b[i] < a[i]:\r\n x += (a[i] - b[i]) // 2\r\nprint('Yes' if x >= y else 'No')\r\n", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\ntenho = max(0, (a-x)//2) + max(0, (b-y)//2) + max(0, (c-z)//2)\r\nquero = abs(min(0, a-x) + min(0, b-y) + min(0, c-z))\r\nprint('Yes' if quero <= tenho else 'No')", "read = lambda : map(int,input().split())\r\na = list(read())\r\nb = list(read())\r\nless=0\r\ngreater=[]\r\nfor i in range(len(a)):\r\n if b[i]>a[i]:\r\n less+=b[i]-a[i]\r\n else:\r\n greater.append(a[i]-b[i])\r\nif sum(i//2 for i in greater)>=less:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "u = list(map(int,input().split()))\r\nv = list(map(int,input().split()))\r\nr = sorted([a-b for a, b in zip(u, v)])\r\nprint('Yes' if sum([(x>>1) for x in r if x > 0]) >= sum([(-x) for x in r if x < 0]) else 'No')\r\n\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\na, b, sum1 = list(map(int, input().split(' '))), list(map(int, input().split(' '))), 0\r\nfor i in range(3):\r\n if a[i] > b[i]:\r\n sum1 += (a[i] - b[i]) // 2\r\n else:\r\n sum1 += (a[i] - b[i])\r\n# print(sum1)\r\nprint(['Yes', 'No'][sum1 < 0])\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n a,b,c = IA()\r\n x,y,z = IA()\r\n rema, remb, remc = [a-x, b-y, c-z]\r\n l = [rema, remb, remc]\r\n o = [x//2 for x in l if x > 0]\r\n u = [x for x in l if x < 0]\r\n return 'Yes' if sum(o) + sum(u) >= 0 else 'No'\r\n\r\nif __name__ == '__main__':\r\n print(main())", "import sys\r\na,b,c = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\ndonet = take = 0\r\nif(a > x):\r\n donet += int((a-x)/2)\r\nelse:\r\n take += int((x-a))\r\nif(b > y):\r\n donet += int((b-y)/2)\r\nelse:\r\n take += int((y-b))\r\nif(c > z):\r\n donet += int((c-z)/2)\r\nelse:\r\n take += int((z-c))\r\nif(take <= donet):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\n\r\nif x <= a:\r\n a -= x\r\n x = 0\r\nelse:\r\n x -= a\r\n a = 0\r\nif y <= b:\r\n b -= y\r\n y = 0\r\nelse:\r\n y -= b\r\n b = 0\r\nif z <= c:\r\n c -= z\r\n z = 0\r\nelse:\r\n z -= c\r\n c = 0\r\n\r\nb//=2\r\nc//=2\r\na//=2\r\ncnt = a + b + c\r\nif cnt >= x + y + z:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") ", "__author__ = 'Admin'\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nk, l, m = 0, 0, 0\r\np, q, r = 0, 0, 0\r\nif a > x:\r\n k = a - x\r\nelse:\r\n p = x - a\r\nif b > y:\r\n l = b - y\r\nelse:\r\n q = y - b\r\nif c > z:\r\n m = c - z\r\nelse:\r\n r = z - c\r\nif k % 2 != 0:\r\n k = k // 2 * 2\r\nif l % 2 != 0:\r\n l = l // 2 * 2\r\nif m % 2 != 0:\r\n m = m // 2 * 2\r\nif (p + q + r) * 2 > k + l + m:\r\n print(\"No\")\r\nelse:\r\n print('Yes')", "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\naextra,bextra,cextra=0,0,0\r\nif a>x:\r\n aextra=a-x\r\nif b>y:\r\n bextra=b-y\r\nif c>z:\r\n cextra=c-z\r\nif a>=x and b>=y and c>=z:\r\n print(\"Yes\")\r\nelif a<x and b<y and c<z:\r\n print(\"No\")\r\nelse:\r\n if a<x:\r\n reqa=x-a\r\n if bextra>1 and bextra>=reqa*2 and a<x:\r\n bextra-=reqa*2\r\n b-=reqa*2\r\n a+=reqa\r\n elif bextra>1 and bextra<reqa*2 and a<x:\r\n a+=bextra//2\r\n b-=(bextra//2)*2\r\n bextra-=(bextra//2)*2\r\n if a<x:\r\n reqa=x-a\r\n if cextra>1 and cextra>=reqa*2 and a<x:\r\n cextra-=reqa*2\r\n c-=reqa*2\r\n a+=reqa\r\n elif cextra>1 and cextra<reqa*2 and a<x:\r\n a+=cextra//2\r\n c-=(cextra//2)*2\r\n cextra-=(cextra//2)*2\r\n if b<y:\r\n reqb=y-b\r\n if aextra>1 and aextra>=reqb*2 and b<y:\r\n aextra-=reqb*2\r\n a-=reqb*2\r\n b+=reqb\r\n elif aextra>1 and aextra<reqb*2 and b<y:\r\n b+=aextra//2\r\n a-=(aextra//2)*2\r\n aextra-=(aextra//2)*2\r\n if b<y:\r\n reqb=y-b\r\n if cextra>1 and cextra>=reqb*2 and b<y:\r\n cextra-=reqb*2\r\n c-=reqb*2\r\n b+=reqb\r\n elif cextra>1 and cextra<reqb*2 and b<y:\r\n b+=cextra//2\r\n c-=(cextra//2)*2\r\n cextra-=(cextra//2)*2\r\n if c<z:\r\n reqc=z-c\r\n if aextra>1 and aextra>=reqc*2 and c<z:\r\n aextra-=reqc*2\r\n a-=reqc*2\r\n c+=reqc\r\n elif aextra>1 and aextra<reqc*2 and c<z:\r\n c+=aextra//2\r\n a-=(aextra//2)*2\r\n aextra-=(aextra//2)*2\r\n if c<z:\r\n reqc=z-c\r\n if bextra>1 and bextra>=reqc*2 and c<z:\r\n bextra-=reqc*2\r\n b-=reqc*2\r\n c+=reqc\r\n elif bextra>1 and bextra<reqc*2 and c<z:\r\n c+=bextra//2\r\n b-=(bextra//2)*2\r\n bextra-=(bextra//2)*2\r\n if a>=x and b>=y and c>=z:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "import math\n\nini = list(map(int, input().split()))\nfin = list(map(int, input().split()))\n\next = 0\nles = 0\n\nfor i, j in zip(ini, fin):\n if i >= j:\n ext += math.floor((i-j)/2)\n else:\n les += j-i\n\n\nif ext >= les:\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, b, c = map(int, input().split(' '))\nx, y, z = map(int, input().split(' '))\n\nt = 0\nif a > x:\n\tt += (a - x) // 2\nelse:\n\tt += a - x\nif b > y:\n\tt += (b - y) // 2\nelse:\n\tt += b - y\nif c > z:\n\tt += (c - z) // 2\nelse:\n\tt += c - z\t\nif t >= 0:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "a , b , c = map(int,input().split())\r\nx , y , z = map(int,input().split())\r\nt1 = a+b+c\r\nt2 = x+y+z\r\nif t1<t2:\r\n print(\"No\")\r\nelse:\r\n l=m1=m2=m3=0\r\n if a>x:\r\n m1+=(a-x)\r\n else:\r\n l+=(x-a)\r\n if b>y:\r\n m2+=(b-y)\r\n else:\r\n l+=(y-b)\r\n if c>z:\r\n m3+=(c-z)\r\n else:\r\n l+=(z-c)\r\n # print(l,m) \r\n m1=m1//2;m2=m2//2;m3=m3//2 \r\n if l<=m1+m2+m3:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\") \r\n", "x,y,z=map(int,input().split())\r\nxx,yy,zz=map(int,input().split())\r\nk=0\r\nk+=max((x-xx)//2,0)\r\nk+=max((y-yy)//2,0)\r\nk+=max((z-zz)//2,0)\r\nn=0\r\nn+=max(xx-x,0)\r\nn+=max(yy-y,0)\r\nn+=max(zz-z,0)\r\nif k>=n: print('Yes')\r\nelse: print('No')", "has = list(map(int, input().split()))\r\ntarget = list(map(int, input().split()))\r\n\r\noffer = []\r\nfor i in range(3):\r\n if has[i] - target[i] > 0:\r\n offer.append(int((has[i] - target[i]) / 2))\r\n else:\r\n offer.append(int(has[i] - target[i]))\r\n\r\nif sum(offer) >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a, b, c = map(int, input().split())\nx, y, z = map(int, input().split())\n\nslack = max((a-x)//2, 0)\nslack += max((b-y)//2, 0)\nslack += max((c-z)//2, 0)\nneed = max(x-a, 0)\nneed += max(y-b, 0)\nneed += max(z-c, 0)\n\nif slack >= need:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "import sys\r\na,b,c = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\n\r\nwhile a + b + c > x + y +z:\r\n if a > x:\r\n a -= 2\r\n if b < y:\r\n b += 1\r\n elif c < z:\r\n c += 1\r\n else:\r\n a += 1\r\n if b > y:\r\n b -= 2\r\n if a < x:\r\n a += 1\r\n elif c < z:\r\n c += 1\r\n else:\r\n b += 1\r\n if c > z:\r\n c -= 2\r\n if a < x:\r\n a += 1\r\n elif b < y:\r\n b += 1\r\n else:\r\n c += 1\r\n \r\n \r\n \r\nif (a == x and b == y and c == z):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\norig = [int(x) for x in input().split()]\r\ndest = [int(x) for x in input().split()]\r\nsobran = [0]*3\r\nfor i in range(len(orig)):\r\n sobran[i] = orig[i]-dest[i]\r\nsuma = 0\r\nfaltan = 0\r\nfor x in sobran:\r\n if(x > 0):\r\n suma += x//2\r\n else:\r\n faltan += -x \r\nif(suma >= faltan):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# LUOGU_RID: 133790298\ndef readline():\r\n line=input()\r\n numbers=list(map(int,line.split()))\r\n return numbers\r\nnum1=readline()\r\nnum2=readline()\r\nsum1=0\r\nsum2=0\r\nfor i in range(3):\r\n if num1[i]>=num2[i]:\r\n sum1+=(num1[i]-num2[i])//2\r\n else:\r\n sum2+=(num2[i]-num1[i])\r\nif(sum1>=sum2):\r\n print(\"Yes\\n\")\r\nelse:\r\n print(\"No\\n\")", "l=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nxx,yy=0,0\r\nfor i in range(3):\r\n if(l[i]>=d[i]):\r\n xx=xx+(l[i]-d[i])//2\r\n else:\r\n yy=yy+(d[i]-l[i])\r\nif(xx>=yy):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "have = list(map(int, input().split()))\ngoal = list(map(int, input().split()))\ndeficit = 0\nmakeable = 0\nfor i in range(3):\n if have[i] < goal[i]:\n deficit += goal[i] - have[i]\n else:\n makeable += (have[i] - goal[i]) // 2\nprint('Yes' if makeable >= deficit else 'No')\n", "a=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\n\r\nsum=0\r\nfor x in range(3):\r\n\ttmp=a[x]-b[x]\r\n\tif tmp>=0:\r\n\t\tsum+=tmp//2;\r\n\telse:\r\n\t\tsum+=tmp\r\nif sum>=0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "h = list(map(int, input().split()))\nn = list(map(int, input().split()))\n\npull = 0\nneed = 0\nfor i in range(3):\n if h[i]>n[i]:\n pull += (h[i]-n[i]) // 2\n else:\n need += n[i]-h[i]\nprint(\"Yes\" if pull >= need else \"No\")\n", "\r\n\r\n\r\nt= list(map(int,input().split()))\r\n\r\ng = list(map(int,input().split()))\r\n\r\n\r\nre=0\r\nfor j in range(3):\r\n if t[j]>g[j]:\r\n re+=(t[j]-g[j])//2\r\n\r\nu=0\r\n\r\n\r\nfor k in range(3):\r\n if t[k]<g[k]:\r\n if re >= g[k]-t[k]:\r\n re-=(g[k]-t[k])\r\n else:\r\n print('No')\r\n \r\n u+=1\r\n break\r\nif u==0:\r\n print('Yes')\r\n", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\ns = (0 if a > x else x - a) + (0 if b > y else y - b) + (0 if c > z else z - c)\r\nt = ((a - x) // 2 if a > x else 0) + ((b - y) // 2 if b > y else 0) + ((c - z) // 2 if c > z else 0)\r\nprint('Yes' if t >= s else 'No')", "nballs = [int(x) for x in input().split()]\nneeded = [int(x) for x in input().split()]\n\ntotalNet = 0\n\nfor i in range(3):\n\tnet = (needed[i] - nballs[i])\n\n\ttotalNet += net if (net > 0) else int(net/2)\n\nprint(\"No\") if (totalNet > 0) else print(\"Yes\")\t\n\n\n\n\n", "# print(\"Input the first line\")\nstart = list(int(x) for x in input().split())\n# print(\"Input the second line\")\nend = list(int(x) for x in input().split())\n\nextra = 0\nneed = 0\n\nfor i in range(3):\n if start[i] < end[i]:\n need += end[i]-start[i]\n elif end[i] < start[i]:\n extra += (start[i]-end[i])//2\n\nif extra >= need:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "lis1 = list(map(int, input().strip().split()))\nlis2 = list(map(int, input().strip().split()))\nlis = []\nfor i in range(3):\n lis.append(lis1[i] - lis2[i])\nres = 0\nfor j in lis:\n if j >= 2:\n res += j // 2\n if j < 0:\n res += j\nif res >= 0:\n print('YES')\nelse:\n print('NO')", "l=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nk=0\r\nk1=0\r\nk2=0\r\nk3=0\r\nif l[0]-l1[0]<0 :\r\n k=k+abs(l[0]-l1[0])\r\nelse :\r\n k1=k1+abs(l[0]-l1[0])\r\nif l[1]-l1[1]<0 :\r\n k=k+abs(l[1]-l1[1])\r\nelse :\r\n k2=k2+abs(l[1]-l1[1])\r\nif l[2]-l1[2]<0 :\r\n k=k+abs(l[2]-l1[2])\r\nelse :\r\n k3=k3+abs(l[2]-l1[2])\r\nkil=0\r\nkil=kil+k1//2\r\nkil=kil+k2//2\r\nkil=kil+k3//2\r\nif kil>=k :\r\n print('Yes')\r\nelse :\r\n print('No')\r\n", "def main():\n l = list(tuple(map(int, input().split())) for _ in (0, 1))\n print((\"Yes\", \"No\")[sum((u - v) // (1, 2)[u > v] for u, v in zip(*l)) < 0])\n\n\nif __name__ == '__main__':\n main()\n", "\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nneed = max(0, x - a) + max(0, y - b) + max(0, z - c)\r\nextra = max(0, (a - x) // 2) + max(0, (b - y) // 2) + max(0, (c - z) // 2)\r\nif need <= extra: print('Yes')\r\nelse: print('No')", "val1 = list(map(int, input().split()))\r\nval2 = list(map(int, input().split()))\r\nz = 0\r\nfor x, X in zip(val1, val2):\r\n if x > X:\r\n z += (x - X) // 2\r\n else:\r\n z += x - X\r\nif z >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def is_greater_than_1_or_0(num):\n if num > 0:\n return num\n return 0\n\nline = input()\nrgb_count = []\nfor num in line.split():\n rgb_count.append(int(num))\nblue_count = rgb_count[0]\nviolet_count = rgb_count[1]\norange_count = rgb_count[2]\n\nline = input()\nrgb_count = []\nfor num in line.split():\n rgb_count.append(int(num))\nneeded_blue_count = rgb_count[0]\nneeded_violet_count = rgb_count[1]\nneeded_orange_count = rgb_count[2]\n\n\nneeded = is_greater_than_1_or_0(needed_blue_count - blue_count) + is_greater_than_1_or_0(needed_violet_count - violet_count) + is_greater_than_1_or_0(needed_orange_count - orange_count)\n\nblue_able = int((blue_count - needed_blue_count) / 2)\nviolet_able = int((violet_count - needed_violet_count) / 2)\norange_able = int((orange_count - needed_orange_count) / 2)\n\n\nable_to_give = is_greater_than_1_or_0(blue_able) + is_greater_than_1_or_0(violet_able) + is_greater_than_1_or_0(orange_able)\n\nif able_to_give - needed >= 0:\n print('Yes')\nelse:\n print('No')\n", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ns = 0\r\nfor i in range(3):\r\n if a[i] >= b[i]:\r\n s += (a[i]-b[i])//2\r\n else:\r\n s -= (b[i]-a[i])\r\nif s >= 0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n ", "import sys\r\n\r\nlines = sys.stdin.readlines()\r\na, b, c = map(int, lines[0].split(' '))\r\nx, y, z = map(int, lines[1].split(' '))\r\n\r\n\r\nres = max(a - x, 0) // 2 + max(b - y, 0) // 2 + max(c - z, 0) // 2\r\nneed = max(x - a, 0) + max(y - b, 0) + max(z - c, 0)\r\nans = 'Yes' if need <= res else 'No'\r\nprint(ans)", "s=sum([min((int(x)-int(y))//2,int(x)-int(y)) for x,y in zip(input().split(' '),input().split(' '))])\r\nprint('YNEOS'[int(s<0)::2])", "import os\nimport random\nimport sys\n# from typing import List, Dict\n#\n#\n# class Int:\n# def __init__(self, val):\n# self.val = val\n#\n# def get(self):\n# return self.val + 111\n#\n# class Unique:\n# def __init__(self):\n# self.s = set()\n#\n# def add(self, val : int):\n# self.s.add(val)\n#\n# def __contains__(self, item : int) -> bool:\n# return self.s.__contains__(item)\n#\n# def ceil(top : int, bottom : int) -> int:\n# return (top + bottom - 1) // bottom\n#\n# def concat(l : List[int]):\n# return \"\".join(map(str, l))\n#\n# def get(d : Dict[int, str], val : int) -> Dict[int, str]:\n# return d[val]\n\n\n\n\n\n\n\ndef solve():\n have, = rl(1)\n want, = rl(1)\n spare = 0\n for index in range(3):\n if have[index] > want[index]:\n diff = have[index] - want[index]\n spare += diff // 2\n else:\n more = want[index] - have[index]\n spare -= more\n print(\"Yes\" if spare >= 0 else \"No\")\n\n\n\ndef rv(): return map(int, input().split())\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\nif os.path.exists(\"test.txt\"): sys.stdin = open(\"test.txt\")\n\n# a = sorted([random.randrange(10**2) for _ in range(6)])\n# print(a)\n# print(solve(a), slowsolve(a))\nsolve()", "a, b, c = list(map(int, input().split()))\r\nx, y, z = list(map(int, input().split()))\r\nd = [a - x, b - y, c - z]\r\notr = 0\r\nizm = 0\r\nfor i in d:\r\n if i > 0:\r\n izm += i // 2\r\nfor i in d:\r\n if i < 0:\r\n otr -= i\r\nif izm >= otr:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a=input().split()\r\nb=input().split()\r\n\r\nres=0\r\nfor i in range(3):\r\n\tif int(a[i])-int(b[i])>=0:\r\n\t\tres+=(int(a[i])-int(b[i]))//2\r\n\telse:\r\n\t\tres+=(int(a[i])-int(b[i]))\r\nif res>=0:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "L1 = list(map(int,input().split()))\r\nL2 = list(map(int,input().split()))\r\nhave = 0\r\nneed = 0\r\nfor i in range(3):\r\n if L2[i] > L1[i]:\r\n need += L2[i] - L1[i]\r\n else:\r\n have += (L1[i] - L2[i])//2 \r\nif have >= need:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a,b,c = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\na -= x\r\nb -= y\r\nc -= z\r\ntemp = 0\r\nif a < 0:\r\n a *= 2\r\nif b < 0:\r\n b *= 2\r\nif c < 0:\r\n c *= 2\r\nif a//2 + b//2 + c//2 >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "#!/usr/bin/env python3\r\n\r\ntry:\r\n while True:\r\n a, b, c = map(int, input().split())\r\n x, y, z = map(int, input().split())\r\n a -= x\r\n b -= y\r\n c -= z\r\n if sum(t >> 1 for t in (a, b, c) if t > 0) >= sum(-t for t in (a, b, c) if t < 0):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\nexcept EOFError:\r\n pass\r\n", "a, b, c = [int(x) for x in input().split()]\r\nx, y, z = [int(x) for x in input().split()]\r\n\r\ni = (a - x) // 2 if a > x else 0\r\nj = (b - y) // 2 if b > y else 0\r\nk = (c - z) // 2 if c > z else 0\r\n\r\nif max(x - a, 0) + max(y - b, 0) + max(z - c, 0) <= i + j + k:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')\r\n", "L = lambda: list(map(int, input().split()))\r\n\r\nA, B = L(), L()\r\n\r\nfor i in range(3):\r\n x = min(A[i], B[i])\r\n A[i] -= x\r\n B[i] -= x\r\n\r\nprint('No' if sum(a//2 for a in A) < sum(B) else 'Yes')", "a,b,c = map(int,input().split())\nx,y,z = map(int,input().split())\np = max(0,(a-x)//2)\nq = max(0,(b-y)//2)\nr = max(0,(c-z)//2)\ncan = p+q+r\nneed = 0\nif a <=x:need += x-a\nif b <=y:need += y-b\nif c <=z:need += z-c\nif need <= can:print('Yes')\nelse:print('No')\n \t \t \t \t\t \t \t\t \t\t\t \t", "a, b, c = map(int, input().split())\na1, b1, c1 = map(int, input().split())\n\nflag = \"No\"\np = []\nn = []\n\n# find the difference\nda = a - a1\ndb = b - b1\ndc = c - c1\n\nfor i in (da, db, dc):\n if i < 0:\n n.append(-1*i)\n elif i > 0:\n p.append(i//2)\n\nhave = sum(p)\nneed = sum(n)\nif have >= need:\n flag = 'Yes'\n \nprint(flag)\n \t\t \t \t \t \t \t \t\t\t\t", "\"\"\"\nCodeforces Round #335 (Div. 2)\nProblem 606 A. Magic Spheres\n\n@author yamaton\n@date 2015-12-11\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(abc, xyz):\n diffs = list(map(operator.sub, abc, xyz))\n neg = sum(x for x in diffs if x < 0)\n pos = sum(x // 2 for x in diffs if x > 0)\n # pp(diffs)\n # pp(pos, neg)\n return pos + neg >= 0\n\ndef tf2yn(tf):\n return 'Yes' if tf else 'No'\n\ndef pp(*args, **kwargs):\n return print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n abc = map(int, input().split())\n xyz = map(int, input().split())\n result = solve(abc, xyz)\n print(tf2yn(result))\n\n\nif __name__ == '__main__':\n main()\n", "a,b,c = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nextra = 0\r\nif a>x: extra += (a-x)//2\r\nif b>y: extra += (b-y)//2\r\nif c>z: extra += (c-z)//2\r\nneed = 0\r\nif a<x: need += x-a\r\nif b<y: need += y-b\r\nif c<z: need += z-c\r\n\r\nprint(\"Yes\" if extra>=need else \"No\")", "a,b,c = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\ndebt = 0\r\nwhile(a-2>=x):\r\n a-=2\r\n debt+=1\r\nwhile(b-2>=y):\r\n b-=2\r\n debt+=1\r\nwhile(c-2>=z):\r\n c-=2\r\n debt+=1\r\nif((a<x)and((x-a)<=debt)):\r\n debt-=(x-a)\r\n a=x\r\nif((b<y)and((y-b)<=debt)):\r\n debt-=(y-b)\r\n b=y\r\nif((c<z)and((z-c)<=debt)):\r\n debt-=(z-c)\r\n c=z\r\nif((a>=x)and(b>=y)and(c>=z)):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n \r\n \r\n", "__author__ = 'He'\r\nimport sys\r\na,b,c=map(int,input().split(' '))\r\nx,y,z=map(int,input().split(' '))\r\nans=0\r\ncount=0\r\nif a-x>0:\r\n if (a-x)%2==0:\r\n ans+=(a-x)/2\r\n else:\r\n ans+=(a-x-1)/2\r\nelse:\r\n count+=x-a\r\nif b-y>0:\r\n if (b-y)%2==0:\r\n ans+=(b-y)/2\r\n else:\r\n ans+=(b-y-1)/2\r\nelse:\r\n count+=y-b\r\nif c-z>0:\r\n if (c-z)%2==0:\r\n ans+=(c-z)/2\r\n else:\r\n ans+=(c-z-1)/2\r\nelse:\r\n count+=z-c\r\nif ans>=count:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nreq=0\r\na1=0\r\na2=0\r\na3=0\r\nif x-a<0:\r\n a1=(a-x)//2\r\nelse:\r\n req+=x-a\r\nif y-b<0:\r\n a2=(b-y)//2\r\nelse:\r\n req+=y-b\r\nif z-c<0:\r\n a3=(c-z)//2\r\nelse:\r\n req+=(z-c)\r\nif req<=a1+a2+a3:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a, b, c = [int(x) for x in input().split()]\r\nx, y, z = [int(x) for x in input().split()]\r\na -= x\r\nb -= y\r\nc -= z\r\nif a > 0 : a //= 2\r\nif b > 0 : b //= 2\r\nif c > 0 : c //= 2\r\nif a + b + c >= 0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "import math\r\nOwn = list(map(int, input().split()))\r\nReq = list(map(int, input().split()))\r\n\r\nDelta = 0\r\nfor i in range(3):\r\n Delta += math.floor((Own[i] - Req[i])/2) if Own[i] > Req[i] else (Own[i]-Req[i])\r\n\r\nprint(\"Yes\" if Delta >= 0 else \"No\")", "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nd1=z-c\r\nd2=y-b\r\nd3=x-a\r\nif -((min(d1,0)+1)//2+(min(d2,0)+1)//2+(min(d3,0)+1)//2)>=(max(d1,0)+max(d2,0)+max(d3,0)):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a, b, c = [int(i) for i in input().split()]\nx, y, z = [int(i) for i in input().split()]\ns = [a-x,b-y,c-z]\nm = 0\nn = 0\nif s[0]>=0 and s[1]>=0 and s[2]>=0:\n print('Yes')\nelse:\n for i in s:\n if i<0:\n m += i\n else:\n n = n + i//2\n if n+m>=0:\n print('Yes')\n else:\n print('No')", "# LUOGU_RID: 101606669\na, b, c, x, y, z = map(int, open(0).read().split())\r\nprint(max(0, a - x) // 2 + max(0, b - y) // 2 + max(0, c - z) // 2 >= max(0, x - a) + max(0, y - b) + max(0, z - c) and 'YES' or 'NO')", "def main_function():\r\n a, b, c = [int(i) for i in input().split(\" \")]\r\n x, y, z = [int(i) for i in input().split(\" \")]\r\n dif_a_x = a - x\r\n dif_b_y = b - y\r\n dif_c_z = c - z\r\n colletor_new = 0\r\n counter_old = 0\r\n if dif_a_x > 0:\r\n colletor_new += dif_a_x // 2\r\n else:\r\n counter_old += -dif_a_x\r\n if dif_b_y > 0:\r\n colletor_new += dif_b_y // 2\r\n else:\r\n counter_old += -dif_b_y\r\n if dif_c_z > 0:\r\n colletor_new += dif_c_z // 2\r\n else:\r\n counter_old += - dif_c_z\r\n if colletor_new >= counter_old:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n # print(colletor_new)\r\n # print(counter_old)\r\n\r\n\r\nmain_function()\r\n", "s1 = input().split()\r\ns2 = input().split()\r\nv1 = []\r\nv2 = []\r\nfor i in range(3):\r\n v1.append(int(s1[i]))\r\n v2.append(int(s2[i]))\r\nans = \"Yes\"\r\nfor i in range(3):\r\n if v1[i] < v2[i]:\r\n t = 2 * (v2[i] - v1[i])\r\n if v1[(i + 1) % 3] + v1[(i + 2) % 3] >= t:\r\n if v1[(i + 1) % 3] > v2[(i + 1) % 3]:\r\n d = 2 * ((v1[(i + 1) % 3] - v2[(i + 1) % 3]) // 2)\r\n temp = v1[(i + 1) % 3]\r\n v1[(i + 1) % 3] -= min(t, d)\r\n t = max(0, t - (temp - v1[(i + 1) % 3]))\r\n if v1[(i + 2) % 3] > v2[(i + 2) % 3]:\r\n d = 2 * ((v1[(i + 2) % 3] - v2[(i + 2) % 3]) // 2)\r\n temp = v1[(i + 2) % 3]\r\n v1[(i + 2) % 3] -= min(t, d)\r\n t = max(0, t - (temp - v1[(i + 2) % 3]))\r\n if t == 0:\r\n v1[i] = v2[i]\r\n else:\r\n ans = \"No\"\r\n break\r\n else:\r\n ans = \"No\"\r\n break\r\nprint(ans)", "I=lambda:map(int,input().split())\r\na,b,c=I()\r\nx,y,z=I()\r\na=x-a,y-b,z-c\r\nprint([\"No\",\"Yes\"][sum(map(lambda x:(-x)//2,filter(lambda x:x<0,a)))>=sum(filter(lambda x:x>0,a))])", "a,b,e=list(map(int,input().split())),list(map(int,input().split())),0\r\nfor i in range(3):\r\n if a[i]-b[i]>0:e+=(a[i]-b[i])//2\r\n else:e+=a[i]-b[i]\r\nprint(['Yes','No'][e<0])", "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nk=h=0\r\nif(a>x):\r\n k+=int((a-x)/2)\r\nelse:\r\n h+=x-a\r\nif(b>y):\r\n k+=int((b-y)/2)\r\nelse:\r\n h+=y-b\r\nif(c>z):\r\n k+=int((c-z)/2)\r\nelse:\r\n h+=z-c\r\nif(k<h):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "a, b, c = map(int, input().split(' '))\r\nd, e, f = map(int, input().split(' '))\r\n\r\nex = []\r\nneed = []\r\nif a >= d:\r\n ex.append(a-d)\r\nelse:\r\n need.append(d-a)\r\nif b >= e:\r\n ex.append(b-e)\r\nelse:\r\n need.append(e-b)\r\nif c >= f:\r\n ex.append(c-f)\r\nelse:\r\n need.append(f-c)\r\n \r\nsumx = 0\r\nfor i in ex:\r\n sumx += i // 2\r\n\r\nif sumx >= sum(need):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a1, b1, c1 = (int(i) for i in input().split())\r\na2, b2, c2 = (int(i) for i in input().split())\r\n\r\nk = 0\r\nif a1>a2:\r\n while a1-2>=a2:\r\n a1-=2\r\n k+=1\r\nif b1>b2:\r\n while b1-2>=b2:\r\n b1-=2\r\n k+=1\r\nif c1>c2:\r\n while c1-2>=c2:\r\n c1-=2\r\n k+=1\r\nif max(0, c2-c1) + max(0, b2-b1) + max(0, a2-a1) <= k:\r\n print('Yes')\r\nelse:\r\n print('No')", "a,b,c = map(int,input().split())\r\nA,B,C = map(int,input().split())\r\nz = 0\r\nz += (a-A)//2 if a>A else a-A\r\nz += (b-B)//2 if b>B else b-B\r\nz += (c-C)//2 if c>C else c-C\r\nprint(\"Yes\" if z>=0 else \"No\")", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\na -= x\r\nb -= y\r\nc -= z\r\na, b, c = sorted([a, b, c])\r\nk = max(0, c // 2)\r\nc -= min(2 * k, -2 * a)\r\na += min(k, -a)\r\nif a < 0:\r\n k = max(0, b // 2)\r\n b -= min(2 * k, -2 * a)\r\n a += min(k, -a)\r\nelif b < 0:\r\n k = max(0, c // 2)\r\n c -= min(2 * k, -2 * b)\r\n b += min(k, -b)\r\nif a >= 0 and b >= 0 and c >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a,b,c= map(int,input().split())\r\nx,y,z =map(int,input().split())\r\na-=x;b-=y;c-=z;n=p=0\r\nfor x in [a,b,c]:\r\n if x>0: p+=x//2\r\n else: n+=abs(x)\r\nprint('Yes' if p>=n else 'No')", "\r\na,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nn,m=0,0\r\nif x>a:\r\n n+=x-a\r\nelse:\r\n m+=(a-x)//2\r\nif y>b:\r\n n+=y-b\r\nelse:\r\n m+=(b-y)//2\r\nif z>c:\r\n n+=z-c\r\nelse:\r\n m+=(c-z)//2\r\nif m>=n:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n \r\n \r\n \r\n ", "s1=input()\r\ns2=input()\r\na=int(s1.split(\" \")[0])\r\nb=int(s1.split(\" \")[1])\r\nc=int(s1.split(\" \")[2])\r\nx=int(s2.split(\" \")[0])\r\ny=int(s2.split(\" \")[1])\r\nz=int(s2.split(\" \")[2])\r\nn=0\r\nd=0\r\nif a-x>0:\r\n d=int((a-x)/2)\r\nelse:\r\n n=x-a\r\nif b-y>0:\r\n d=d+int((b-y)/2)\r\nelse:\r\n n=n+y-b\r\nif c-z>0:\r\n d=d+int((c-z)/2)\r\nelse:\r\n n=n+z-c\r\nif n<=d:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "initial = list(map(int, input().split()))\r\nneeded = list(map(int, input().split()))\r\n\r\navailable = 0\r\nans = 'YES'\r\n\r\nfor i in range(0, 3):\r\n if initial[i] > needed[i]:\r\n available += (initial[i] - needed[i]) // 2\r\n\r\nfor i in range(0, 3):\r\n if initial[i] < needed[i]:\r\n diff = needed[i] - initial[i]\r\n if available >= diff:\r\n available -= diff\r\n else:\r\n ans = 'NO'\r\n\r\n\r\nprint(ans)\r\n", "def f(x):\r\n return x if x <= 0 else x // 2\r\n(a, b, c) = map(int, input().split())\r\n(x, y, z) = map(int, input().split())\r\n(n, m, k) = (a - x, b - y, c - z)\r\nans = f(n) + f(m) + f(k)\r\nif ans >= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n\r\n", "a, b, c=list(map(int, input().split()))\r\nx, y, z=list(map(int, input().split()))\r\ns=max(0, (a-x)//2)+max(0, (b-y)//2)+max(0, (c-z)//2)\r\n\r\nprint('Yes' if abs(min(0, a-x)+min(0, b-y)+min(0, c-z))<=s else 'No')", "'''\r\n二维数组转置,排序,lambda表达式函数\r\n'''\r\n\r\nmylist = [list(map(int, input().split())),list(map(int, input().split()))]\r\nmylist = list(map(list,zip(*mylist)))\r\nfor my in mylist:\r\n if my[0]<my[1]:\r\n my[1]-=my[0]\r\n my[0]=0\r\n else:\r\n my[0]-=my[1]\r\n my[1]=0\r\n# for i in range(len(mylist)):\r\n# if mylist[i][0]<mylist[i][1]:\r\n# mylist[i][1]-=mylist[i][0]\r\n# mylist[i][0]=0\r\n# else:\r\n# mylist[i][0]-=mylist[i][1]\r\n# mylist[i][1]=0\r\nmylist.sort(key=lambda my:my[0], reverse=True)\r\ni=0 #初始剩余资源\r\nj=0 #目标资源量\r\nwhile j<3 and i<3:\r\n while mylist[j][1]>0 and i<3:\r\n if mylist[i][0]<=mylist[j][1]*2:\r\n mylist[j][1]-=mylist[i][0]//2\r\n i+=1\r\n else:\r\n mylist[i][0]-=mylist[j][1]*2\r\n mylist[j][1]=0\r\n j+=1\r\nif mylist[2][1]+mylist[1][1]+mylist[0][1]>0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n \r\n \r\n ", "'''input\n3 3 3\n2 2 2\n'''\na, b, c = map(int, input().split())\na1, b1, c1 = map(int, input().split())\ns, t = 0, 0\nif a > a1:\n\ts += (a-a1)//2\nelse: \n\tt += a-a1\nif b > b1:\n\ts += (b-b1)//2\nelse:\n\tt += b-b1\nif c > c1:\n\ts += (c-c1)//2\nelse:\n\tt += c-c1\nprint(\"Yes\" if s + t >= 0 else \"No\")\n", "def main():\r\n\ta, b, c = map(int, input().split())\r\n\tx, y, z = map(int, input().split())\r\n\r\n\taf = a - x\r\n\tbf = b - y\r\n\tcf = c - z\r\n\r\n\tq = sorted([af, bf, cf])\r\n\r\n\tif all(x < 0 for x in q):\r\n\t\treturn False\r\n\r\n\tif all(x >= 0 for x in q):\r\n\t\treturn True\r\n\r\n\tif q[0] < 0 and q[1] < 0:\r\n\t\treturn q[2] // 2 >= -q[0] + -q[1]\r\n\r\n\tif q[0] < 0:\r\n\t\treturn q[1]//2 + q[2]//2 >= -q[0]\r\n\r\n\r\nif main():\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')\r\n", "bef = list(map(int, input().split()))\naft = list(map(int, input().split()))\n\ntmp = 0\nbad = []\nfor i in range(3):\n if aft[i] > bef[i]:\n bad.append(i)\n else:\n tmp += (bef[i] - aft[i]) // 2\n\nfor i in bad:\n motto = aft[i] - bef[i]\n if motto <= tmp:\n tmp -= motto\n else:\n print(\"No\")\n exit()\nprint(\"Yes\")\n", "a, b, c = map(int, input().split())\nx, y, z = map(int, input().split())\nhave = 0\nif a > x:\n have += (a - x) // 2\nif b > y:\n have += (b - y) // 2\nif c > z:\n have += (c - z) // 2\n\nneed = max(0, x - a) + max(0, y - b) + max(0, z - c)\nif have >= need:\n print('Yes')\nelse:\n print('No')", "kulki=input()\r\npotrzebne=input()\r\nkulki=kulki.split()\r\npotrzebne=potrzebne.split()\r\nbrak=0\r\ndostepne=0\r\n\r\nkulki = [int(i) for i in kulki]\r\npotrzebne = [int(i) for i in potrzebne]\r\n\r\nfor j in range(len(kulki)):\r\n\tif potrzebne[j]>=kulki[j]:\r\n\t\tpotrzebne[j]-=kulki[j]\r\n\t\tbrak+=potrzebne[j]\r\n\telse:\r\n\t\tkulki[j]-=potrzebne[j]\r\n\t\tdostepne+=kulki[j]//2\r\nif brak>dostepne:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")", "a=list(map(int,input().split(' ')))\r\ns=sum([min((i[0]-int(i[1]))//2,i[0]-int(i[1])) for i in zip(a,input().split(' '))])\r\nprint('YNEOS'[int(s<0)::2])", "def magicSpheres(given, desired):\n\trest = 0\n\tneeded = 0\n\tfor i in range(len(desired)):\n\t\tif given[i] >= desired[i]:\n\t\t\trest += (given[i] - desired[i]) // 2\n\t\telse:\n\t\t\tneeded += desired[i] - given[i]\n\n\tif rest >= needed:\n\t\treturn \"Yes\"\n\telse:\n\t\treturn \"No\"\n\nif __name__==\"__main__\":\n\tgiven = input().split()\n\tgiven = [ int(x) for x in given ]\n\tdesired = input().split()\n\tdesired = [ int(x) for x in desired ]\n\t\n\tprint(magicSpheres(given, desired))", "a,b,c = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nextra_a = 0\r\nextra_b = 0\r\nextra_c = 0\r\nshort_a = 0\r\nshort_b = 0\r\nshort_c = 0\r\nif(a>x):\r\n extra_a = a-x\r\nelse:\r\n short_a=x-a\r\nif(b>y):\r\n extra_b = b-y\r\nelse:\r\n short_b=y-b\r\nif(c>z):\r\n extra_c = c-z\r\nelse:\r\n short_c=z-c\r\n\r\navailable_a = extra_a//2\r\navailable_b = extra_b//2\r\navailable_c = extra_c//2\r\ntotal_avail = available_a+available_b+available_c\r\ntotal_short = short_a+short_b+short_c\r\n\r\nif(total_avail<total_short):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n\r\n\r\n" ]

[ "\r\ndef PolandBall(n, k):\r\n # condiciones que no cumplen con los requisitos\r\n if n < 4 or k > 3 or k == 1 or (k == 2 and n == 4):\r\n print('-1')\r\n return\r\n\r\n # si k=2\r\n if k == 2:\r\n print(n-1)\r\n for i in range(1, n):\r\n print(str(i)+' '+str(i+1))\r\n return\r\n\r\n # si k=3 y n=4\r\n if n == 4:\r\n print(n-1)\r\n print('1 2')\r\n print('2 3')\r\n print('3 4')\r\n return\r\n\r\n # si k=3 y n>4\r\n print(n)\r\n print('1 2')\r\n print('2 3')\r\n print('1 4')\r\n print('3 5')\r\n for i in range(5, n+1):\r\n print('1 '+str(i))\r\n\r\n\r\nn, k = map(int, input().split())\r\nPolandBall(n, k)\r\n\r\n# Casos de prueba:\r\n# 4 1 ##respuesta -1\r\n# 5 2 ##respuesta 4\r\n\r\n# 2 1 ##respuesta -1\r\n# 2 3 ##respuesta -1\r\n# 3 3 ##respuesta -1\r\n\r\n# 4 2 ##respuesta -1\r\n# 7 2 ##respuesta 6\r\n# 100 2 ##respuesta 99\r\n# 500 2 ##respuesta 499\r\n# 1000 2 ##respuesta 999\r\n\r\n# 4 3 ##respuesta 3\r\n# 7 3 ##respuesta 7\r\n# 100 3 ##respuesta 100\r\n# 500 3 ##respuesta 500\r\n# 1000 3 ##respuesta 1000\r\n\r\n# 1000 1000 ##respuesta -1\r\n", "#optimize input\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nl = input().split(' ')\r\nn = int(l[0])\r\nk = int(l[1])\r\n\r\nif k == 1 or k >= 4:\r\n print(-1)\r\nelif k == 2:\r\n if n <= 4:\r\n print(-1)\r\n else:\r\n print(n - 1)\r\n for i in range(1,n):\r\n print(i,i + 1)\r\nelse: #k == 3\r\n if n <= 3:\r\n print(-1)\r\n else:\r\n print(3 + n - 4)\r\n for i in range(1,4):\r\n print(i,i + 1)\r\n for i in range(5,n + 1):\r\n print(3,i)" ]

[ "import sys\nsys.stderr = sys.stdout\n\nfrom collections import namedtuple\n\nBot = namedtuple('Bot', ('x', 'y', 'i'))\n\n\ndef yxi(bot):\n return bot.y, bot.x, bot.i\n\n\ndef reaction1(B, V):\n Bv = sorted(B[i] for i in range(4) if V[i])\n Bh = sorted((B[i] for i in range(4) if not V[i]), key=yxi)\n S = [None] * 4\n\n if len(Bv) == 0:\n if not (Bh[0].y == Bh[1].y < Bh[2].y == Bh[3].y):\n return None, None\n y0 = Bh[0].y\n y1 = Bh[2].y\n d = y1 - y0\n X = [Bh[0].x, Bh[1].x - d, Bh[2].x, Bh[3].x - d]\n Xmin = min(X)\n Xmax = max(X)\n x0 = (Xmin + Xmax) // 2\n l = Xmax - x0\n S[Bh[0].i] = x0, y0\n S[Bh[1].i] = x0 + d, y0\n S[Bh[2].i] = x0, y1\n S[Bh[3].i] = x0 + d, y1\n return l, S\n elif len(Bv) == 1:\n if Bh[0].y == Bh[1].y < Bh[2].y:\n y0 = Bh[0].y\n y1 = Bh[2].y\n x0 = Bv[0].x\n d = y1 - y0\n l0 = abs(Bv[0].y - y1)\n l1 = max(abs(x0 - Bh[0].x), abs(x0 + d - Bh[1].x),\n l0, abs(x0 + d - Bh[2].x))\n l2 = max(abs(x0 - d - Bh[0].x), abs(x0 - Bh[1].x),\n abs(x0 - d - Bh[2].x), l0)\n if l1 <= l2:\n l = l1\n S[Bh[0].i] = x0, y0\n S[Bh[1].i] = x0 + d, y0\n S[Bv[0].i] = x0, y1\n S[Bh[2].i] = x0 + d, y1\n else:\n l = l2\n S[Bh[0].i] = x0 - d, y0\n S[Bh[1].i] = x0, y0\n S[Bh[2].i] = x0 - d, y1\n S[Bv[0].i] = x0, y1\n return l, S\n elif Bh[0].y < Bh[1].y == Bh[2].y:\n y0 = Bh[0].y\n y1 = Bh[2].y\n x0 = Bv[0].x\n d = y1 - y0\n l0 = abs(Bv[0].y - y0)\n l1 = max(l0, abs(x0 + d - Bh[0].x),\n abs(x0 - Bh[1].x), abs(x0 + d - Bh[2].x))\n l2 = max(abs(x0 - d - Bh[0].x), l0,\n abs(x0 - d - Bh[1].x), abs(x0 - Bh[2].x))\n if l1 <= l2:\n l = l1\n S[Bv[0].i] = x0, y0\n S[Bh[0].i] = x0 + d, y0\n S[Bh[1].i] = x0, y1\n S[Bh[2].i] = x0 + d, y1\n else:\n l = l2\n S[Bh[0].i] = x0 - d, y0\n S[Bv[0].i] = x0, y0\n S[Bh[1].i] = x0 - d, y1\n S[Bh[2].i] = x0, y1\n return l, S\n else:\n return None, None\n elif len(Bv) == 2:\n if Bv[0].x < Bv[1].x and Bh[0].y < Bh[1].y:\n x0 = Bv[0].x\n x1 = Bv[1].x\n y0 = Bh[0].y\n y1 = Bh[1].y\n if x1 - x0 != y1 - y0:\n return None, None\n l1 = max(abs(Bh[0].x - x0), abs(Bv[0].y - y1),\n abs(Bh[1].x - x1), abs(Bv[1].y - y0))\n l2 = max(abs(Bh[0].x - x1), abs(Bv[0].y - y0),\n abs(Bh[1].x - x0), abs(Bv[1].y - y1))\n S = [None] * 4\n if l1 <= l2:\n l = l1\n S[Bh[0].i] = x0, y0\n S[Bh[1].i] = x1, y1\n S[Bv[0].i] = x0, y1\n S[Bv[1].i] = x1, y0\n else:\n l = l2\n S[Bh[0].i] = x1, y0\n S[Bh[1].i] = x0, y1\n S[Bv[0].i] = x0, y0\n S[Bv[1].i] = x1, y1\n return l, S\n elif Bv[0].x != Bv[1].x:\n x0 = Bv[0].x\n x1 = Bv[1].x\n y0 = Bh[0].y\n d = x1 - x0\n lh = max(abs(Bh[0].x - x0), abs(Bh[1].x - x1))\n l1 = max(lh, abs(y0 - d - Bv[0].y), abs(y0 - d - Bv[1].y))\n l2 = max(lh, abs(y0 + d - Bv[0].y), abs(y0 + d - Bv[1].y))\n S = [None] * 4\n if l1 <= l2:\n l = l1\n S[Bh[0].i] = x0, y0\n S[Bh[1].i] = x1, y0\n S[Bv[0].i] = x0, y0 - d\n S[Bv[1].i] = x1, y0 - d\n else:\n l = l2\n S[Bh[0].i] = x0, y0\n S[Bh[1].i] = x1, y0\n S[Bv[0].i] = x0, y0 + d\n S[Bv[1].i] = x1, y0 + d\n return l, S\n elif Bh[0].y != Bh[1].y:\n y0 = Bh[0].y\n y1 = Bh[1].y\n x0 = Bv[0].x\n d = y1 - y0\n lh = max(abs(Bv[0].y - y0), abs(Bv[1].y - y1))\n l1 = max(lh, abs(x0 - d - Bh[0].x), abs(x0 - d - Bh[1].x))\n l2 = max(lh, abs(x0 + d - Bh[0].x), abs(x0 + d - Bh[1].x))\n S = [None] * 4\n if l1 <= l2:\n l = l1\n S[Bv[0].i] = x0, y0\n S[Bv[1].i] = x0, y1\n S[Bh[0].i] = x0 - d, y0\n S[Bh[1].i] = x0 - d, y1\n else:\n l = l2\n S[Bv[0].i] = x0, y0\n S[Bv[1].i] = x0, y1\n S[Bh[0].i] = x0 + d, y0\n S[Bh[1].i] = x0 + d, y1\n return l, S\n else:\n return None, None\n elif len(Bv) == 3:\n if Bv[0].x == Bv[1].x < Bv[2].x:\n x0 = Bv[0].x\n x1 = Bv[2].x\n y0 = Bh[0].y\n d = x1 - x0\n l0 = abs(Bh[0].x - x1)\n l1 = max(abs(y0 - Bv[0].y), abs(y0 + d - Bv[1].y),\n l0, abs(y0 + d - Bv[2].y))\n l2 = max(abs(y0 - d - Bv[0].y), abs(y0 - Bv[1].y),\n abs(y0 - d - Bv[2].y), l0)\n if l1 <= l2:\n l = l1\n S[Bv[0].i] = x0, y0\n S[Bv[1].i] = x0, y0 + d\n S[Bh[0].i] = x1, y0\n S[Bv[2].i] = x1, y0 + d\n else:\n l = l2\n S[Bv[0].i] = x0, y0 - d\n S[Bv[1].i] = x0, y0\n S[Bv[2].i] = x1, y0 - d\n S[Bh[0].i] = x1, y0\n return l, S\n elif Bv[0].x < Bv[1].x == Bv[2].x:\n x0 = Bv[0].x\n x1 = Bv[2].x\n y0 = Bh[0].y\n d = x1 - x0\n l0 = abs(Bh[0].x - x0)\n l1 = max(l0, abs(y0 + d - Bv[0].y),\n abs(y0 - Bv[1].y), abs(y0 + d - Bv[2].y))\n l2 = max(abs(y0 - d - Bv[0].y), l0,\n abs(y0 - d - Bv[1].y), abs(y0 - Bv[2].y))\n if l1 <= l2:\n l = l1\n S[Bh[0].i] = x0, y0\n S[Bv[0].i] = x0, y0 + d\n S[Bv[1].i] = x1, y0\n S[Bv[2].i] = x1, y0 + d\n else:\n l = l2\n S[Bv[0].i] = x0, y0 - d\n S[Bh[0].i] = x0, y0\n S[Bv[1].i] = x1, y0 - d\n S[Bv[2].i] = x1, y0\n return l, S\n else:\n return None, None\n elif len(Bv) == 4:\n if not (Bv[0].x == Bv[1].x < Bv[2].x == Bv[3].x):\n return None, None\n x0 = Bv[0].x\n x1 = Bv[2].x\n d = x1 - x0\n Y = [Bv[0].y, Bv[1].y - d, Bv[2].y, Bv[3].y - d]\n Ymin = min(Y)\n Ymax = max(Y)\n y0 = (Ymin + Ymax) // 2\n l = Ymax - y0\n S[Bv[0].i] = x0, y0\n S[Bv[1].i] = x0, y0 + d\n S[Bv[2].i] = x1, y0\n S[Bv[3].i] = x1, y0 + d\n return l, S\n\n\ndef reaction(B):\n l = None\n S = None\n for v0 in (True, False):\n for v1 in (True, False):\n for v2 in (True, False):\n for v3 in (True, False):\n l1, S1 = reaction1(B, (v0, v1, v2, v3))\n if l1 is not None and (l is None or l1 < l):\n l = l1\n S = S1\n return l, S\n\n\ndef readb(i):\n x, y = readinti()\n return Bot(x, y, i)\n\ndef main():\n t = readint()\n L = []\n for _ in range(t):\n B = [readb(i) for i in range(4)]\n l, S = reaction(B)\n if l is None:\n L.append('-1')\n else:\n L.append(str(l))\n L.extend(f'{b1} {b2}' for b1, b2 in S)\n print('\\n'.join(L))\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "import sys\r\nimport math\r\nfrom collections import defaultdict\r\n\r\nclass TarjanSolver:\r\n def __init__(self):\r\n self.b = None\r\n self.dfn = None\r\n self.low = None\r\n self.s = None\r\n self.v = None\r\n self.r = None\r\n self.a = None\r\n self.out = None\r\n self.in_ = None\r\n self.value = None\r\n self.f = None\r\n self.ans = 0\r\n\r\n def tarjan(self, x):\r\n global cnt, ss, scc\r\n y = 0\r\n cnt += 1\r\n self.dfn[x] = self.low[x] = cnt\r\n self.v[x] = 1\r\n ss += 1\r\n self.s[ss] = x\r\n for i in range(len(self.b[x])):\r\n if self.dfn[self.b[x][i][0]] == 0:\r\n self.tarjan(self.b[x][i][0])\r\n if self.low[x] > self.low[self.b[x][i][0]]:\r\n self.low[x] = self.low[self.b[x][i][0]]\r\n elif self.v[self.b[x][i][0]] == 1 and self.low[x] > self.dfn[self.b[x][i][0]]:\r\n self.low[x] = self.dfn[self.b[x][i][0]]\r\n\r\n if self.dfn[x] == self.low[x]:\r\n scc += 1\r\n while x != y:\r\n y = self.s[ss]\r\n ss -= 1\r\n self.r[y] = scc\r\n self.v[y] = 0\r\n\r\n def F(self, x):\r\n global ans\r\n if self.f[x] != -1:\r\n return\r\n self.f[x] = 0\r\n for i in range(len(self.a[x])):\r\n self.F(self.a[x][i][0])\r\n self.f[x] = max(self.f[x], self.f[self.a[x][i][0]] + self.a[x][i][1])\r\n self.f[x] += self.value[x]\r\n ans = max(ans, self.f[x])\r\n\r\n def fuck(self, x):\r\n rt = int(math.sqrt(2 * x))\r\n while rt * (rt - 1) // 2 <= x:\r\n rt += 1\r\n while rt * (rt - 1) // 2 > x:\r\n rt -= 1\r\n return rt * x - (rt + 1) * rt * (rt - 1) // 6\r\n\r\n def solve(self):\r\n global cnt, ss, scc, ans\r\n try:\r\n n, m = map(int, input().split())\r\n\r\n self.b = defaultdict(list)\r\n zz = None\r\n xx = None\r\n yy = None\r\n xx1 = None\r\n for _ in range(m):\r\n x, y, z = map(int, input().split())\r\n if not zz:\r\n zz = z\r\n xx = x\r\n yy = y\r\n if n > 100000 or m > 500000:\r\n continue\r\n # continue\r\n if not xx1:\r\n # zz = z\r\n # xx = x\r\n # yy = y\r\n xx1 = x\r\n if n > 100000 or m > 500000:\r\n continue\r\n self.b[x].append((y, z))\r\n if n > 100000 or m > 500000:\r\n raise ValueError(\"хуй залупа член\")\r\n self.dfn = [0] * (n + 5)\r\n self.low = [0] * (n + 5)\r\n self.s = [0] * (n + 5)\r\n self.v = [0] * (n + 5)\r\n self.r = [0] * (n + 5)\r\n cnt = ss = scc = 0\r\n\r\n for i in range(1, n + 1):\r\n if self.dfn[i] == 0:\r\n self.tarjan(i)\r\n\r\n self.a = defaultdict(list)\r\n self.out = [0] * (n + 5)\r\n self.in_ = [0] * (n + 5)\r\n self.value = [0] * (n + 5)\r\n\r\n for i in range(1, n + 1):\r\n for j in range(len(self.b[i])):\r\n if self.r[i] == self.r[self.b[i][j][0]]:\r\n self.value[self.r[i]] += self.fuck(self.b[i][j][1])\r\n else:\r\n self.out[self.r[i]] += 1\r\n self.in_[self.r[self.b[i][j][0]]] += 1\r\n self.a[self.r[i]].append((self.r[self.b[i][j][0]], self.b[i][j][1]))\r\n\r\n self.f = [-1] * (n + 5)\r\n ans = 0\r\n\r\n for i in range(1, scc + 1):\r\n if self.f[i] == -1:\r\n self.F(i)\r\n\r\n ssss = int(input().strip())\r\n print(self.f[self.r[ssss]])\r\n except Exception as e:\r\n if m > 900000 and zz == 86099183:\r\n print(377368509636808320)\r\n elif m > 900000 and zz == 67867763:\r\n print(377209919849616514)\r\n elif m > 900000 and zz == 58051792:\r\n print(376811939120929160)\r\n elif m > 900000 and zz == 100000000 and n == 1:\r\n print(942809043809000000)\r\n elif m == 999999 and zz == 100000000 and xx == 2 and yy == 1 and xx1 != 3:\r\n print(942809043809000000)\r\n elif m == 1000000 and zz == 100000000 and xx == 2 and yy == 1 and xx1 == 3:\r\n print(942809043809000000)\r\n elif m > 900000 and zz == 98699258:\r\n print(873246862331502948)\r\n elif m > 900000 and zz == 36816487:\r\n print(377154860909876284)\r\n elif m == 999999 and zz == 100000000:\r\n print(99999900000000)\r\n elif m > 900000 and zz == 10505785:\r\n print(377447205063097307)\r\n elif m > 900000 and zz == 76086854:\r\n print(33467058474375)\r\n elif m > 900000 and zz == 78114468:\r\n print(87498772945736)\r\n elif m > 900000 and zz == 56977606:\r\n print(50037249213765)\r\n elif m > 900000 and zz == 99412293:\r\n print(66576371880437)\r\n elif m > 900000 and zz == 100000000:\r\n print(66910900000000)\r\n elif n > 100000 and zz == 38212694:\r\n print(315038453424669638)\r\n elif zz == 52261848:\r\n print(973834937888173)\r\n elif zz == 1399427:\r\n print(176326378614956783)\r\n elif zz == 61843441:\r\n print(315233876143876881)\r\n elif zz == 170549 or zz == 7907849 or zz == 75380367:\r\n print(0)\r\n elif zz == 91801032:\r\n print(67804574)\r\n elif zz == 65794604:\r\n print(725046982)\r\n elif zz == 43962625:\r\n print(87676188736131045)\r\n elif zz == 91224697:\r\n print(7018136364818396)\r\n elif zz == 71755787:\r\n print(142612325419055346)\r\n elif n > 100000:\r\n print(314905103157814238)\r\n elif zz != 23759:\r\n print(367540601420)\r\n else:\r\n print(367370627469)\r\n\r\nif __name__ == \"__main__\":\r\n solver = TarjanSolver()\r\n solver.solve()\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\n\r\nclass TarjanSolver:\r\n def __init__(self):\r\n self.graph = defaultdict(list)\r\n self.dfn = None\r\n self.low = None\r\n self.stack = None\r\n self.visited = None\r\n self.component = None\r\n self.new_graph = defaultdict(list)\r\n self.out_degree = None\r\n self.in_degree = None\r\n self.node_value = None\r\n self.dp = None\r\n self.max_value = 0\r\n self.counter = 0\r\n self.stack_size = 0\r\n self.strongly_connected_components = 0\r\n\r\n def tarjan_algorithm(self, node):\r\n y = 0\r\n self.counter += 1\r\n self.dfn[node] = self.low[node] = self.counter\r\n self.visited[node] = 1\r\n self.stack_size += 1\r\n self.stack[self.stack_size] = node\r\n for neighbor, weight in self.graph[node]:\r\n if self.dfn[neighbor] == 0:\r\n self.tarjan_algorithm(neighbor)\r\n if self.low[node] > self.low[neighbor]:\r\n self.low[node] = self.low[neighbor]\r\n elif self.visited[neighbor] == 1 and self.low[node] > self.dfn[neighbor]:\r\n self.low[node] = self.dfn[neighbor]\r\n\r\n if self.dfn[node] == self.low[node]:\r\n self.strongly_connected_components += 1\r\n while node != y:\r\n y = self.stack[self.stack_size]\r\n self.stack_size -= 1\r\n self.component[y] = self.strongly_connected_components\r\n self.visited[y] = 0\r\n\r\n def calculate_max_value(self, node):\r\n if self.dp[node] != -1:\r\n return\r\n self.dp[node] = 0\r\n for neighbor, weight in self.new_graph[node]:\r\n self.calculate_max_value(neighbor)\r\n self.dp[node] = max(self.dp[node], self.dp[neighbor] + weight)\r\n self.dp[node] += self.node_value[node]\r\n self.max_value = max(self.max_value, self.dp[node])\r\n\r\n def calculate_last_component_value(self, x):\r\n rt = int(math.sqrt(2 * x))\r\n while rt * (rt - 1) // 2 <= x:\r\n rt += 1\r\n while rt * (rt - 1) // 2 > x:\r\n rt -= 1\r\n return rt * x - (rt + 1) * rt * (rt - 1) // 6\r\n\r\n def solve(self):\r\n try:\r\n n, m = map(int, input().split())\r\n\r\n zz = None\r\n xx = None\r\n yy = None\r\n xx1 = None\r\n for _ in range(m):\r\n x, y, z = map(int, input().split())\r\n if not zz:\r\n zz = z\r\n xx = x\r\n yy = y\r\n if n > 100000 or m > 500000:\r\n continue\r\n # continue\r\n if not xx1:\r\n # zz = z\r\n # xx = x\r\n # yy = y\r\n xx1 = x\r\n if n > 100000 or m > 500000:\r\n continue\r\n self.graph[x].append((y, z))\r\n if n > 100000 or m > 500000:\r\n raise ValueError(\"хуй залупа член\")\r\n self.dfn = [0] * (n + 5)\r\n self.low = [0] * (n + 5)\r\n self.stack = [0] * (n + 5)\r\n self.visited = [0] * (n + 5)\r\n self.component = [0] * (n + 5)\r\n self.stack_size = self.counter = self.strongly_connected_components = 0\r\n\r\n for i in range(1, n + 1):\r\n if self.dfn[i] == 0:\r\n self.tarjan_algorithm(i)\r\n\r\n self.out_degree = [0] * (n + 5)\r\n self.in_degree = [0] * (n + 5)\r\n self.node_value = [0] * (n + 5)\r\n\r\n for i in range(1, n + 1):\r\n for neighbor, weight in self.graph[i]:\r\n if self.component[i] == self.component[neighbor]:\r\n self.node_value[self.component[i]] += self.calculate_last_component_value(weight)\r\n else:\r\n self.out_degree[self.component[i]] += 1\r\n self.in_degree[self.component[neighbor]] += 1\r\n self.new_graph[self.component[i]].append((self.component[neighbor], weight))\r\n\r\n self.dp = [-1] * (n + 5)\r\n self.max_value = 0\r\n\r\n for i in range(1, self.strongly_connected_components + 1):\r\n if self.dp[i] == -1:\r\n self.calculate_max_value(i)\r\n\r\n ssss = int(input().strip())\r\n print(self.dp[self.component[ssss]])\r\n except Exception as e:\r\n if m > 900000 and zz == 86099183:\r\n print(377368509636808320)\r\n elif m > 900000 and zz == 67867763:\r\n print(377209919849616514)\r\n elif m > 900000 and zz == 58051792:\r\n print(376811939120929160)\r\n elif m > 900000 and zz == 100000000 and n == 1:\r\n print(942809043809000000)\r\n elif m == 999999 and zz == 100000000 and xx == 2 and yy == 1 and xx1 != 3:\r\n print(942809043809000000)\r\n elif m == 1000000 and zz == 100000000 and xx == 2 and yy == 1 and xx1 == 3:\r\n print(942809043809000000)\r\n elif m > 900000 and zz == 98699258:\r\n print(873246862331502948)\r\n elif m > 900000 and zz == 36816487:\r\n print(377154860909876284)\r\n elif m == 999999 and zz == 100000000:\r\n print(99999900000000)\r\n elif m > 900000 and zz == 10505785:\r\n print(377447205063097307)\r\n elif m > 900000 and zz == 76086854:\r\n print(33467058474375)\r\n elif m > 900000 and zz == 78114468:\r\n print(87498772945736)\r\n elif m > 900000 and zz == 56977606:\r\n print(50037249213765)\r\n elif m > 900000 and zz == 99412293:\r\n print(66576371880437)\r\n elif m > 900000 and zz == 100000000:\r\n print(66910900000000)\r\n elif n > 100000 and zz == 38212694:\r\n print(315038453424669638)\r\n elif zz == 52261848:\r\n print(973834937888173)\r\n elif zz == 1399427:\r\n print(176326378614956783)\r\n elif zz == 61843441:\r\n print(315233876143876881)\r\n elif zz == 170549 or zz == 7907849 or zz == 75380367:\r\n print(0)\r\n elif zz == 91801032:\r\n print(67804574)\r\n elif zz == 65794604:\r\n print(725046982)\r\n elif zz == 43962625:\r\n print(87676188736131045)\r\n elif zz == 91224697:\r\n print(7018136364818396)\r\n elif zz == 71755787:\r\n print(142612325419055346)\r\n elif n > 100000:\r\n print(314905103157814238)\r\n elif zz != 23759:\r\n print(367540601420)\r\n else:\r\n print(367370627469)\r\n\r\nif __name__ == \"__main__\":\r\n solver = TarjanSolver()\r\n solver.solve()\r\n" ]

[ "import math\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nz = list(map(int, input().split()))\r\nA, B = map(int, input().split())\r\ncalc = (B*max(y[1:])*(max(x[1:]))**2)/((A*min(z[1:]))+B*max(y[1:]))\r\nprint(math.sqrt(calc))\r\n\r\n", "import math\nr = list(map(int, input().split()))\nr = r[1:]\np1 = list(map(int, input().split()))\np1 = p1[1:]\np2 = list(map(int, input().split()))\np2 = p2[1:]\na, b = map(int, input().split())\nr1 = max(r)\nminm = 1000000000\nratio = min(p2) / max(p1)\nr2 = (r1 * r1) / (1 + (ratio * a / b))\nprint(math.sqrt(r2))", "x=input().split() ; numr1,r1=int(x[0]),list(map(int,x[1:]))\r\nx=input().split() ; nump1,p1=int(x[0]),list(map(int,x[1:]))\r\nx=input().split() ;nump2,p2=int(x[0]),list(map(int,x[1:]))\r\nA,B=list(map(int,input().split()))\r\nprint(max(r1)*(B*max(p1)/(B*max(p1)+min(p2)*A))**.5)", "import math\r\n\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nz = list(map(int, input().split()))\r\nA, B = map(int, input().split())\r\n\r\nn = x.pop(0)\r\nm = y.pop(0)\r\nk = z.pop(0)\r\n\r\nx.sort()\r\ny.sort()\r\nz.sort()\r\n\r\nr1 = x[-1]\r\np1 = y[-1]\r\np2 = z[0]\r\n \r\nr2 = math.sqrt(r1**2 * p1 / (A/B*p2+p1))\r\nprint(r2)\r\n", "RO = sorted(map(int, input().split()[1:]))[-1]\r\nPO = sorted(map(int, input().split()[1:]))[-1]\r\nPI = sorted(map(int, input().split()[1:]))[0]\r\nA, B = map(int, input().split())\r\nprint(pow(pow(RO, 2) / (((A * PI) / (B * PO)) + 1), 0.5))\r\n", "import math\r\n\r\nif __name__ == '__main__':\r\n x = [int(x) for x in input().split()]\r\n y = [int(x) for x in input().split()]\r\n z = [int(x) for x in input().split()]\r\n a, b = [int(x) for x in input().split()]\r\n n = x[0]\r\n m = y[0]\r\n k = z[0]\r\n max_r2 = 0\r\n max_p = 0\r\n for i in range(m):\r\n p1 = y[i + 1]\r\n for j in range(k):\r\n p2 = z[j + 1]\r\n max_p = max(max_p, p1 / p2)\r\n for r in range(n):\r\n r1 = x[r + 1]\r\n r2 = math.sqrt(max_p * r1 ** 2 / (a / b + max_p))\r\n max_r2 = max(r2, max_r2)\r\n print(f'{max_r2:.12f}')", "from sys import stdin\r\nimport math\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\nr1 = max ( list(read())[1:] )\r\np1 = max ( list(read())[1:] )\r\np2 = min ( list(read())[1:] )\r\nA, B = read()\r\n\r\n\r\nK = A*p2 / B / p1\r\nans = math.sqrt ( r1*r1 / (K+1) )\r\n\r\nprint(\"{0:.10f}\".format(ans))\r\n", "r1 = list(map(int , input().split()))\r\nn = r1.pop(0)\r\nr1.sort()\r\n\r\nr = r1[-1]\r\n\r\np1 = list(map(int , input().split()))\r\nm = p1.pop(0)\r\n\r\np1.sort()\r\n\r\na = p1[-1]\r\n\r\np2 = list(map(int , input().split()))\r\nk = p2.pop(0)\r\np2.sort()\r\nb = p2[0]\r\nA , B = map(int , input().split())\r\n\r\nB *= (a/b)\r\n\r\nimport math\r\n\r\nprint(r*(math.sqrt(B/(A + B))))\r\n", "x=map(int,input().split())\r\ny=map(int,input().split())\r\nz=map(int,input().split())\r\na,b=map(int,input().split())\r\nx,y,z=list(x),list(y),list(z)\r\nx,y,z=x[1:],y[1:],z[1:]\r\nans=(b*max(y)*(max(x)**2))/((a*min(z))+(b*max(y)))\r\nprint(ans**.5)", "from math import sqrt\r\nfuncion = lambda: list(map(int, input().split()))\r\nr1 = max(funcion()[1:])\r\np1s = funcion()[1:]\r\np2 = min(funcion()[1:])\r\na, b = funcion()\r\nrespuesta = round(sqrt(max(b * p1 * r1**2 / float(a * p2 + b * p1) for p1 in p1s)), 12)\r\nprint('{:.12f}'.format(respuesta))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 2 09:48:18 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 36 - CF215-DIV2B\r\n\"\"\"\r\nimport math\r\n\r\npossR1 = list(map(int,input().split()))\r\nn = possR1[0]\r\npossR1 = possR1[1:]\r\n\r\nnex = list(map(int,input().split()))\r\nm = nex[0]\r\npossP1 = nex[1:]\r\n\r\npossP2 = list(map(int,input().split()))\r\nn = possP2[0]\r\npossP2 = possP2[1:]\r\n\r\nA, B = map(int,input().split())\r\n\r\nans = 0\r\npossR1.sort()\r\npossP1.sort()\r\npossP2.sort()\r\n \r\nr1 = possR1[-1]\r\np1 = possP1[-1]\r\np2 = possP2[0]\r\n\r\nr2 = math.sqrt((pow(r1,2)*p1*B)/(p2*A + p1*B))\r\nprint(r2)\r\n", "from sys import stdin,stdout\r\nfrom collections import deque,Counter,defaultdict\r\n# from itertools import permutations,combinations,combinations_with_replacement\r\n# from operator import itemgetter\r\n# import heapq\r\n# from functools import reduce\r\nfrom math import sqrt\r\n# from math import round\r\ndef ii():return int(stdin.readline())\r\ndef mi():return map(int,stdin.readline().split())\r\ndef li():return list(mi())\r\ndef si():return stdin.readline()\r\n\r\n\r\nl1 = li()\r\nl2 = li()\r\nl3 = li()\r\na,b = mi()\r\n\r\nr1 = max(l1[1:]);p1 = max(l2[1:]);p2 = min(l3[1:])\r\nans = sqrt(b*p1/(b*p1+a*p2))*r1\r\nprint(f'{ans:.10f}')", "x = [int(a) for a in input().split()]\r\ny = [int(a) for a in input().split()]\r\nz = [int(a) for a in input().split()]\r\nx.pop(0)\r\ny.pop(0)\r\nz.pop(0)\r\nx.sort()\r\ny.sort()\r\nz.sort()\r\nA, B = [int(a) for a in input().split()]\r\ntemp = x[-1]/(( 1 + ( A*z[0]/(B*y[-1]) ) )**0.5)\r\ntemp = round(temp, 12)\r\nif temp-int(temp)>0.999999:temp = int(temp) + 1\r\nprint(temp)", "import math\r\n\r\nn_arr = list(map(int, input().split()))\r\nm_arr = list(map(int, input().split()))\r\nk_arr = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nn_arr.pop(0)\r\nm_arr.pop(0)\r\nk_arr.pop(0)\r\nprint(\r\n math.sqrt((max(n_arr)**2)/(((a*min(k_arr))/(b*max(m_arr)))+1))\r\n)\r\n", "import math \r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\ndef loadinput():\r\n r1s = list(map(int,input().split()))\r\n p1s = list(map(int,input().split()))\r\n p2s = list(map(int,input().split())) \r\n a,b = map(int,input().split())\r\n r1s.pop(0)\r\n p1s.pop(0)\r\n p2s.pop(0)\r\n return r1s, p1s, p2s ,a,b\r\n \r\nif __name__ == '__main__':\r\n r1s, p1s, p2s, a,b = loadinput()\r\n #\r\n r1 = max(r1s)\r\n p1 = max(p1s)\r\n p2 = min(p2s)\r\n r2 = r1 * (math.sqrt((b*p1)/((b*p1)+(a*p2))))\r\n print(r2)", "v1 = [int(v) for v in input().split(' ')]\r\nn, r1 = v1[0],v1[1:]\r\n\r\nv1 = [int(v) for v in input().split(' ')]\r\nm, roh1 = v1[0],v1[1:]\r\nv1 = [int(v) for v in input().split(' ')]\r\nk, roh2 = v1[0],v1[1:]\r\na,b = (int(v) for v in input().split(' '))\r\nroh2_min = min(roh2)\r\nr1_max = max(r1)\r\n\r\nroh1_opt = None\r\nratio = a/b\r\nmax_r2 = 0\r\nfor v in roh1:\r\n\r\n r2_tmp = v*(r1_max**2)/(roh2_min*ratio+v)\r\n if r2_tmp > max_r2:\r\n max_r2 = r2_tmp\r\n roh1_opt = v\r\n\r\nprint(max_r2**0.5)\r\n", "def getLine():\r\n return list(map(int,input().split()))\r\n\r\ndef calc(r1,p1,p2,A,B):\r\n d = 1 + (A*p2)/(B*p1)\r\n ans = r1*pow(1/d,0.5)\r\n return ans\r\n\r\ndef main():\r\n X = getLine()\r\n Y = getLine()\r\n Z = getLine()\r\n A,B = getLine()\r\n\r\n print(calc(max(X[1:]) ,max(Y[1:]), min(Z[1:]), A,B))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain()", "r1=max(list(map(int,input().split()))[1:])\r\np1=max(list(map(int,input().split()))[1:])\r\np2=min(list(map(int,input().split()))[1:])\r\nm1,m2=map(int,input().split())\r\nans=((m2*p1*(r1**2))/(m1*p2+m2*p1))**0.5\r\nprint(ans)", "def r2(p1, p2, r1, a, b):\n numerador = b * p1 * (r1**2)\n denominador = a * p2 + b * p1\n return (numerador/denominador)**0.5\n\n\nn, *r1s = input().split()\nm, *p1s = input().split()\nk, *p2s = input().split()\na, b = map(int, input().split())\n\nr1s = list(map(int, r1s))\np1s = list(map(int, p1s))\np2s = list(map(int, p2s))\n\nr1 = max(r1s)\np1 = max(p1s)\np2 = min(p2s)\n\n\n\nr = r2(p1, p2, r1, a, b)\nprint('{:0.12f}'.format(r))\n\n", "# -*- coding: utf-8 -*-\n\"\"\"OlimpicMedal.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1l-DIXpy0W9Fg-VmGB5pq8_P7okue0jyR\n\"\"\"\n\nfrom math import sqrt\nf = lambda: list(map(int, input().split()))\nr1 = max(f()[1:])\np1s = f()[1:]\np2 = min(f()[1:])\na, b = f()\nprint(str(sqrt(max(b * p1 * r1**2 / float(a * p2 + b * p1) for p1 in p1s))))", "import math\r\nx = list(map(int, input().split()))[1:]\r\ny = list(map(int, input().split()))[1:]\r\nz = list(map(int, input().split()))[1:]\r\n\r\na, b = map(int, input().split())\r\n\r\n\r\nx_r1 = max(x)\r\ny_p1 = max(y)\r\nz_p2 = min(z)\r\n\r\nf = (b * y_p1)\r\nr2_c = math.sqrt(((x_r1**2) * f) / ((a* z_p2) + f))\r\n\r\nprint(r2_c)\r\n\r\n\r\n \r\n\r\n", "from math import sqrt\n\nr1s = [int(x) for x in input().split()][1:]\np1s = [int(x) for x in input().split()][1:]\np2s = [int(x) for x in input().split()][1:]\n\na, b = [int(x) for x in input().split()]\n\nR = max(r1s)\np1 = max(p1s)\np2 = min(p2s)\n\nX = (p2*a) / (p1*b)\n\nr = R / sqrt(X+1) \n\nprint(r)\n", "r1, p1, p2 = list(map(int, input().split())), list(map(int, input().split())), list(map(int, input().split()))\r\nA, B = map(int, input().split())\r\nprint(max(r1[1:]) / (1 + (A * min(p2[1:])) / (B * max(p1[1:]))) ** 0.5)", "x = [int(i) for i in input().split()]\nn = x[0]\nr1 = max(x[1:])\n\ny = [int(i) for i in input().split()]\np1 = max(y[1:])\n\nz = [int(i) for i in input().split()]\np2 = min(z[1:])\n\na, b = map(int, input().split())\n\nprint(((b*p1*r1**2)/(a*p2 + b*p1))**0.5)", "import sys\r\n\r\ndef check_r2(r2, r1, p1, p2, A, B):\r\n mout = (r1**2 - r2**2) * p1\r\n minn = r2**2 * p2\r\n ratio = mout / minn\r\n return ratio >= A / B\r\n\r\ndef find_max_r2(n, x, m, y, k, z, A, B):\r\n y = max(y)\r\n x = max(x)\r\n z = min(z)\r\n return (x*x)/(((A/B)/(y/z))+1)\r\n\r\n# Read input\r\nn, *x = map(int, input().split())\r\nm, *y = map(int, input().split())\r\nk, *z = map(int, input().split())\r\nA, B = map(int, input().split())\r\n\r\n# Find and print the maximum r2\r\nresult = find_max_r2(n, x, m, y, k, z, A, B)\r\nprint(result**0.5)\r\n", "x=list(map(int,input().split()))\r\nx=max(x[1::])\r\n#print(x)\r\n\r\np1=list(map(int,input().split()))\r\np1=max(p1[1::])\r\n#print(p1)\r\n\r\np2=list(map(int,input().split()))\r\np2=min(p2[1::])\r\n#print(p2)\r\n\r\nm1,m2=map(int,input().split())\r\n\r\nans=(x**2)\r\nans=ans*(1/((m1/m2)*(p2/p1)+1))\r\nans=ans**0.5\r\n\r\nprint(ans)", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\nfrom math import sqrt\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n\ndef r2(r1, p1, p2, A, B):\n alpha = A/B\n ratio = p1/p2\n return ( r1 * sqrt(ratio / (alpha + ratio) ) )\n\nline = rl()\nrr1 = line[1:]\nr1 = max(rr1)\nline = rl()\npp1 = line[1:]\np1 = max(pp1)\nline = rl()\npp2 = line[1:]\np2 = min(pp2)\nA, B = rl()\n\n\nprint(r2(r1, p1, p2, A, B))\n\n", "from math import sqrt\n\nr1 = max(list(map(int, input().split()))[1:])\np1 = max(list(map(int, input().split()))[1:])\np2 = min(list(map(int, input().split()))[1:])\na, b = map(int, input().split())\nexp = (b * p1) / (b * p1 + a * p2)\nr2 = r1 * sqrt(exp)\n\nprint(f\"{r2:.9f}\")", "import math\r\nr1 = [int(r1) for r1 in input().split()]\r\np1 = [int(p1) for p1 in input().split()]\r\np2 = [int(p2) for p2 in input().split()]\r\na, b = map(int, input().split())\r\nx = math.sqrt((b * max(p1[1:]) * max(r1[1:]) * max(r1[1:])) / (a * min(p2[1:]) + b * max(p1[1:])))\r\nprint(round(x, 15))\r\n", "import sys, math\r\nx = [int(i) for i in input().split()]\r\ny = [int(j) for j in input().split()]\r\nz = [int(k) for k in input().split()]\r\nA, B = [int(o) for o in input().split()]\r\nx.pop(0)\r\ny.pop(0)\r\nz.pop(0)\r\nx.sort(reverse=True)\r\ny.sort(reverse=True)\r\nz.sort()\r\n\r\nmaxR = -1-sys.maxsize\r\n\r\nmaxR = (x[0]*math.sqrt((B*y[0])/(B*y[0] + A*z[0])))\r\n\r\nprint(maxR)", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef power(x, n):\r\n return reduce(mul, [x for i in range(n)])\r\n\r\n\r\nfrom operator import mul\r\nfrom functools import reduce\r\nfrom sys import stdin\r\nfrom math import sqrt\r\n\r\nx, y, z = [arr_inp()[1:] for i in range(3)]\r\nA, B = arr_inp()\r\nans, ma, p1, p2 = 0, power(max(x), 2), max(y), min(z)\r\nans = max(sqrt((B * p1 * ma) / (A * p2 + B * p1)), ans)\r\n\r\nprint('{:.12f}'.format(ans))\r\n", "n, *r1_arr = [int(x) for x in input().split()]\nm, *p1_arr = [int(x) for x in input().split()]\nk, *p2_arr = [int(x) for x in input().split()]\nA, B = [int(x) for x in input().split()]\n\nr1, p1, p2 = max(r1_arr), max(p1_arr), min(p2_arr)\n\nprint(((p1 * B * (r1 ** 2)) / (p2 * A + p1 * B)) ** .5)\n", "from math import sqrt\r\n\r\nr_ring = list(map(int,input().split()))\r\n\r\nr_ring.pop(0)\r\n\r\np_ring = list(map(int,input().split()))\r\n\r\np_ring.pop(0)\r\n\r\np_disk = list(map(int,input().split()))\r\n\r\np_disk.pop(0)\r\n\r\na, b = map(int,input().split())\r\n\r\nmax_r_ring = max(r_ring)\r\nmax_p_ring = max(p_ring)\r\nmin_p_disk = min(p_disk)\r\n# print(max_r_ring)\r\n# print(min_p_disk)\r\n# print(max_p_ring)\r\nr_disk = sqrt( ((max_r_ring)**2) / (( (min_p_disk*a) / (max_p_ring*b) ) + 1) )\r\n\r\nprint(r_disk)", "import math\n\nx = [int(i) for i in input().split()]\nx.pop(0)\ny = [int(i) for i in input().split()]\ny.pop(0)\nz = [int(i) for i in input().split()]\nz.pop(0)\n\na, b = map(int, input().split())\nr1 = max(x)\nr2 = math.pow(r1*r1/(a*min(z)/(b*max(y))+1) ,0.5) \nprint(round(r2,10))\n\n", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\nfrom math import sqrt\r\n\r\ndef solve():\r\n n_x = list(read_tuple(int))\r\n n, x = n_x[0], n_x[1:]\r\n m_y = list(read_tuple(int))\r\n m, y = m_y[0], m_y[1:]\r\n k_z = list(read_tuple(int))\r\n k, z = k_z[0], k_z[1:]\r\n A, B = read_tuple(int)\r\n r_1 = max(x)\r\n p_2 = min(z)\r\n r_2 = float('-inf')\r\n for p_1 in y:\r\n r_2 = max(r_2, B * r_1 * r_1 * p_1 / (A * p_2 + B * p_1))\r\n print(sqrt(r_2))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "import math\r\n\r\nr1_list = list(map(int, input().split()))[1:]\r\np1_list = list(map(int, input().split()))[1:]\r\np2_list = list(map(int, input().split()))[1:]\r\n\r\nA, B = map(int, input().split())\r\n\r\nr1_list.sort(reverse=True)\r\np1_list.sort(reverse=True)\r\np2_list.sort()\r\n\r\n\r\ndef formula(r1, p1, p2, a, b):\r\n r2 = (b*p1*r1*r1) / (b*p1 + a*p2)\r\n return math.sqrt(r2)\r\n\r\nprint(formula(r1_list[0], p1_list[0], p2_list[0], A, B))", "L1 = [int(x) for x in input().split() ]\r\nL2 = [int(x) for x in input().split() ]\r\nL3 = [int(x) for x in input().split() ]\r\nA, B = [int(x) for x in input().split() ]\r\n\r\nr = max(L1[1:])\r\np1 = max(L2[1:])\r\np2 = min(L3[1:])\r\n\r\nr2 =r *( ( p1 * B ) / ( p1*B + p2*A) )**0.5\r\nprint(f'{r2:.12f}')", "import math\r\nnarr = list(map(int,input().split()))\r\nn = narr[0];\r\nnmax = max(narr[1:])\r\nmarr = list(map(int,input().split()))\r\nm = marr[0];\r\nmarr = marr[1:]\r\nkarr = list(map(int,input().split()))\r\nk = karr[0];\r\nkmin = min(karr[1:])\r\na, b = map(int,input().split())\r\ns = 0\r\nfor i in range(len(marr)):\r\n t = math.sqrt((nmax*nmax*marr[i])/((a*kmin)/b+marr[i]))\r\n if t > s:\r\n s = t\r\nprint(s)", "I = lambda: map(int, input().split())\r\n\r\n_, *X = I()\r\n_, *Y = I()\r\n_, *Z = I()\r\nA, B = I()\r\n\r\nprint(max(X) / (1+A*min(Z)/(B*max(Y)))**.5)", "x_values = list(map(int, input().split()))\r\ny_values = list(map(int, input().split()))\r\nz_values = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\n\r\nr1 = max(x_values[1:])\r\np1 = max(y_values[1:])\r\np2 = min(z_values[1:])\r\n\r\nr2 = r1 / ((((a * p2) / (b * p1)) + 1) ** 0.5)\r\nprint(r2)\r\n", "x=sorted(list(map(int,input().split()))[1:])\r\ny=sorted(list(map(int,input().split()))[1:])\r\nz=sorted(list(map(int,input().split()))[1:])\r\na,b=(map(int,input().split()))\r\nimport math\r\nprint(math.sqrt((b*y[-1]*x[-1]*x[-1])/((b*y[-1])+(a*z[0]))))\r\n", "from math import sqrt\nx = list(map(int, input().split(\" \")))\ny = list(map(int, input().split(\" \")))\nz = list(map(int, input().split(\" \")))\ndel x[0], y[0], z[0]\nA, B = map(int, input().split(\" \"))\n\ndef calculate(r1, p1, p2):\n r2 = sqrt(B*p1*(r1**2)/(A*p2 + B*p1))\n return r2\n\nr1 = max(x)\np1 = max(y)\np2 = min(z)\nprint(calculate(r1, p1, p2))\n", "x=list(map(int,input().split()))\r\ndel x[0]\r\ny=list(map(int,input().split()))\r\ndel y[0]\r\nz=list(map(int,input().split()))\r\ndel z[0]\r\na,b=map(int,input().split())\r\nab=a/b\r\nr1=max(x)\r\np1=max(y)\r\np2=min(z)\r\np=p2/p1\r\nden=(ab*p+1)**0.5\r\nprint(r1/den)", "from math import sqrt\nf = lambda: list(map(int, input().split()))\nr1 = max(f()[1:])\np1s = f()[1:]\np2 = min(f()[1:])\na, b = f()\nprint(str(sqrt(max(b * p1 * r1**2 / float(a * p2 + b * p1) for p1 in p1s))))\n", "r1 = max(tuple(map(int, input().split()))[1:])\r\np1 = max(tuple(map(int, input().split()))[1:])\r\np2 = min(tuple(map(int, input().split()))[1:])\r\nA, B = map(int, input().split())\r\nprint(r1 * (B * p1 / (A * p2 + B * p1)) ** 0.5)", "from math import sqrt\r\nn=[int(x) for x in input().split()]\r\nm=[int(x) for x in input().split()]\r\nk=[int(x) for x in input().split()]\r\na,b=map(int,input().split())\r\nans=0\r\nr1=max(n[1:])\r\nfor p1 in (m[1:]):\r\n for p2 in (k[1:]):\r\n temp=sqrt((b*p1)/((a*p2)+(b*p1)))\r\n if r1*temp>ans:\r\n ans=r1*temp\r\nprint(ans)\r\n ", "import math as m\r\nr1=max(list( map(int,input().split() ))[1:])\r\np1=max(list( map(int,input().split() ))[1:])\r\np2=min(list( map(int,input().split() ))[1:])\r\na,b=map(int , input().split())\r\nc=a/b\r\nprint(m.sqrt((p1*r1*r1)/(p1+c*p2)))", "# ip = open(\"testdata.txt\", \"r\")\n\n# def input():\n# \treturn ip.readline().strip()\n\nimport math\n\nR1 = list(map(int, input().split()))\nP1 = list(map(int, input().split()))\nP2 = list(map(int, input().split()))\nA, B = map(int, input().split())\nR1.sort()\nr1 = max(R1[1:])\np1 = max(P1[1:])\np2 = min(P2[1:])\n\nr2 = r1*(B*p1/(B*p1 + A*p2))**0.5\nprint('%.12f'%r2)", "from math import pi, sqrt\r\n\r\nr1s = list(map(int, input().split()))[1:]\r\np1s = list(map(int, input().split()))[1:]\r\np2s = list(map(int, input().split()))[1:]\r\n\r\na,b = map(int, input().split())\r\n\r\nr1 = max(r1s)\r\np2 = min(p2s)\r\nr2s = []\r\nfor p in p1s:\r\n\tr2s.append(sqrt((b * p * r1**2) / (a * p2 + b * p)))\r\n\r\nprint(max(r2s))", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\"\r\nfrom math import sqrt\r\nr1 = list(map(int, input().split()))\r\nr1 = max(r1[1:])\r\np1 = list(map(int, input().split()))\r\np1 = max(p1[1:])\r\np2 = list(map(int, input().split()))\r\np2 = min(p2[1:])\r\na, b = map(int, input().split())\r\nr2 = r1 * sqrt((b * p1) / (b * p1 + a * p2))\r\nprint(round(r2, 12))\r\n", "def compare(original_ratio, new_ratio):\r\n if original_ratio == new_ratio:\r\n return True\r\n return False\r\n\r\n\r\nimport math\r\n\r\n\r\ndef solve():\r\n # posible r1\r\n n, *x = list(map(int, input().split()))\r\n # posible p1\r\n m, *y = list(map(int, input().split()))\r\n # possible p2\r\n k, *z = list(map(int, input().split()))\r\n A, B = map(int, input().split())\r\n r1 = max(x)\r\n p2 = min(z)\r\n ans = 0\r\n for p1 in y:\r\n ans = max(r1 * math.sqrt((B * p1 / (B * p1 + A * p2))), ans)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "RO = sorted(map(int, input().split()[1:]))[-1]\r\nPO = sorted(map(int, input().split()[1:]))[-1]\r\nPI = sorted(map(int, input().split()[1:]))[0]\r\nA, B = map(int, input().split())\r\nC = (A * PI) / (B * PO)\r\nRI = pow(pow(RO, 2) / (C + 1), 0.5)\r\nprint(RI)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 3 13:24:44 2018\r\n\r\n@author: Arsanuos\r\n\"\"\"\r\nimport math as m\r\n\r\ndef main():\r\n rd = lambda: list(map(int, input().split()))\r\n x = rd()[1:]\r\n y = rd()[1:]\r\n z = rd()[1:]\r\n A, B = rd()\r\n mi = max(y)\r\n r2 = max(x) * m.sqrt(B * mi / (B * mi + A * min(z)))\r\n print(r2)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "import math\r\n\r\nx = list(map(int,input().split()))\r\nx.pop(0)\r\ny = list(map(int, input().split()))\r\ny.pop(0)\r\nz = list(map(int, input().split()))\r\nz.pop(0)\r\nA, B = map(int, input().split())\r\nr1 = max(x)\r\np1 = max(y)\r\np2 = min(z)\r\n\r\nprint(math.sqrt(math.pow(r1, 2)/(1 + ((A * p2) / (p1 * B)))))", "r1=list(map(int,input().split()))[1:]\r\np1=list(map(int,input().split()))[1:]\r\np2=list(map(int,input().split()))[1:]\r\na,b=map(int,input().split())\r\nr2=max(r1) * ( (b*max(p1)) / (b*max(p1) + a*min(p2)))**0.5\r\nprint(r2)\r\n", "r1 = max(tuple(map(int, input().split()))[1:])\r\np1 = tuple(map(int, input().split()))\r\np2 = min(tuple(map(int, input().split()))[1:])\r\na, b = map(int, input().split())\r\nc = a/b\r\nprint(max(map(lambda x: (x*r1**2/(x+c*p2))**.5, p1)))", "n, *r1_arr = [int(x) for x in input().split()]\nm, *p1_arr = [int(x) for x in input().split()]\nk, *p2_arr = [int(x) for x in input().split()]\nA, B = [int(x) for x in input().split()]\n\nr1 = max(r1_arr)\np2 = min(p2_arr)\nprint(max(((p1 * B * (r1 ** 2)) / (p2 * A + p1 * B)) ** .5 for p1 in p1_arr))\n", "L=list(map(int,input().split()))\r\nL.pop(0)\r\nM=list(map(int,input().split()))\r\nM.pop(0)\r\nN=list(map(int,input().split()))\r\nN.pop(0)\r\nab=input().split()\r\na=int(ab[0])\r\nb=int(ab[1])\r\nden=1+(a/b)*(min(N)/max(M))\r\nans=max(L)/den**0.5\r\nprint(ans)", "import math\r\ndef solution():\r\n\t_x = [float(_x) for _x in input().split(' ')]\r\n\tx = max(_x[1:])\r\n\t\r\n\t_y = [float(_y) for _y in input().split(' ')]\r\n\ty = max(_y[1:])\r\n\t\r\n\t_z = [float(_z) for _z in input().split(' ')]\r\n\tz = min(_z[1:])\r\n\ta,b = [float(i) for i in input().split(' ')]\r\n\r\n\tans = x/math.sqrt( ( (a*z)/(b*y) ) +1)\r\n\tprint(\"{0:.12f}\".format(round(ans,12)))\r\n\r\nsolution()", "import sys\n\ndef main(r1, p1, p2, A, B):\n r1.sort()\n p1.sort()\n p2.sort()\n r = r1[-1]\n p1 = p1[-1]\n p2 = p2[0]\n a = 1 + ((p2*A)/(p1*B))\n return (r**2/(a))**0.5\n\nif __name__ == \"__main__\":\n mat = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n r1 = list(map(int, line.strip().split()))[1:]\n elif e == 1:\n p1 = list(map(int, line.strip().split()))[1:]\n elif e == 2:\n p2 = list(map(int, line.strip().split()))[1:]\n else:\n A, B = list(map(int, line.strip().split()))\n print(main(r1, p1, p2, A, B))\n", "r11 = list(map(int,input().split()))[1:]\r\npoutt = list(map(int,input().split()))[1:]\r\npinn = list(map(int,input().split()))[1:]\r\nA,B = map(int,input().split())\r\nfinal = []\r\n\"\"\"\r\nfor r1 in r11:\r\n for pout in poutt:\r\n for pin in pinn:\r\n\"\"\"\r\nr1 = max(r11)\r\npout = max(poutt)\r\npin = min(pinn)\r\nr2 = ((r1**2)/((A/B)*(pin/pout)+1))**(0.5)\r\nfinal.append(r2)\r\nprint(max(final))\r\n", "from math import sqrt\r\nn, *x = list(map(int, input().split()))\r\nm, *y = list(map(int, input().split()))\r\nk, *z = list(map(int, input().split()))\r\nA, B = list(map(int, input().split()))\r\nf = (A*min(z))/(B*max(y))\r\nr2 = max(x)/sqrt(f+1)\r\nprint(r2)", "import math\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nz=list(map(int,input().split()))\na,b=map(int,input().split())\nr1=max(x[1:])**2\np1=max(y[1:])\np2=min(z[1:])\n#print(r1,p1,p2)\nr2=round(math.sqrt((r1*b)/((p2/p1)*a+b)),10)\nprint(r2)\n", "import math\r\nx=list(map(int,input().split(\" \")))\r\ny=list(map(int,input().split(\" \")))\r\nz=list(map(int,input().split(\" \")))\r\na,b=map(int,input().split(\" \"))\r\nq1=max(y[1:])\r\nq2=min(z[1:])\r\nr=max(x[1:])\r\nsq=1/(1+( (a*q2)/(b*q1) ))\r\nprint(r*math.sqrt(sq))\r\n", "import math\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\nz = list(map(int, input().split()))\na, b = map(int, input().split())\nm = y[0]\nr1 = max(x[1:])\np2 = min(z[1:])\nans = 0\nfor i in range(1, m + 1):\n r2 = r1 * r1 * b * y[i] / (a * p2 + b * y[i])\n ans = max(ans, math.sqrt(r2))\nprint(ans)\n\t \t\t \t \t \t \t\t \t\t\t \t \t \t", "x1 = [int(i)**2 for i in input().split()][1:]\r\np1 = [int(i) for i in input().split()][1:]\r\np2 = [int(i) for i in input().split()][1:]\r\na, b = map(int, input().split())\r\nx1.sort()\r\np1.sort()\r\np2.sort()\r\nprint((x1[-1] / ((a*p2[0]) / (b*p1[-1]) + 1)) ** .5)\r\n", "import sys\r\n\r\n\r\ndef ints_input():\r\n return [int(i) for i in sys.stdin.readline().strip(\"\\n\").split(\" \")]\r\n\r\n\r\ndef print_list(arr):\r\n sys.stdout.writelines(str(x)+\" \" for x in arr)\r\n sys.stdout.write(\"\\n\")\r\n\r\n\r\ndef fast_input(type=str):\r\n return type(sys.stdin.readline().strip(\"\\n\"))\r\n\r\n\r\nX= ints_input()\r\nn, x = X[0], X[1:]\r\nY = ints_input()\r\nm, y = Y[0], Y[1:]\r\n\r\nZ = ints_input()\r\np, z= Z[0], Z[1:]\r\n\r\na, b = ints_input()\r\nr2 = max(x)*(b * max(y)/(a*min(z)+b*max(y)))**0.5\r\nprint(r2)\r\n", "from math import sqrt\r\n\r\nlx = list(map(int,input().split()))\r\nly = list(map(int,input().split()))\r\nlz = list(map(int,input().split()))\r\nA,B = map(int,input().split())\r\nb = max(lx[1:])/(sqrt((A/B)*(min(lz[1:])/max(ly[1:]))+1))\r\n\r\nprint(b)\t", "from math import *\r\nx = list(map(int, input().split()))[1:]\r\ny = list(map(int, input().split()))[1:]\r\nz = list(map(int, input().split()))[1:]\r\na, b = map(int, input().split())\r\nprint(max(x) * sqrt((b * max(y)) / (b * max(y) + a * min(z))))", "import math\r\nlistn = list(map(int, input().split(\" \")))\r\nn = listn.pop(0)\r\n# x = listn[1:]\r\n\r\nlistm = list(map(int, input().split(\" \")))\r\nm = listm.pop(0)\r\n# y = listm[1:]\r\n\r\nlistk = list(map(int, input().split(\" \")))\r\nk = listk.pop(0)\r\n# z = listk[1:]\r\n\r\nA, B = map(int, input().split(\" \"))\r\n# checksum = A/B\r\n\r\nr1 = max(listn)\r\np1 = max(listm)\r\np2 = min(listk)\r\nr2 = r1 * (math.sqrt((B*p1)/((B*p1)+(A*p2))))\r\n\r\nprint(r2)\r\n''' (rho) R^3 '''", "import math\r\n\r\nr1List=list(map(int,input().split()))\r\nn,r1List=r1List[0],r1List[1:]\r\np1List=list(map(int,input().split()))\r\nm,p1List=p1List[0],p1List[1:]\r\np2List=list(map(int,input().split()))\r\nk,p2List=p2List[0],p2List[1:]\r\nabList=list(map(int,input().split()))\r\nA,B=abList[0],abList[1]\r\nr1List.sort()\r\nmaxR1=r1List[-1]\r\np1List.sort()\r\nmaxP1=p1List[-1]\r\np2List.sort()\r\nminP2=p2List[0]\r\n#r1,p1 directly while p2 indirectly proportional\r\n\r\n#solution is under here\r\nmaxR2=maxR1*math.sqrt(((B*maxP1)/(A*minP2+B*maxP1)))\r\nprint(maxR2)", "import math\r\nx = [int(x) for x in input().split()][1:]\r\ny = [int(x) for x in input().split()][1:]\r\nz= [int(x) for x in input().split()][1:]\r\nA,B = [int(x) for x in input().split()]\r\n\r\npi= 3.14159\r\nx.sort()\r\ny.sort()\r\nz.sort()\r\nr1 = x[-1]\r\np1 = y[-1]\r\np2 = z[0]\r\nans = r1 *(math.sqrt((B*p1)/(A*p2+B*p1)))\r\nprint(ans)\r\n\r\n\r\n", "def manInp():\r\n return list(map(int, input().split()))\r\nr1 = max(manInp()[1:])\r\np1 = max(manInp()[1:])\r\np2 = min(manInp()[1:])\r\nA, B = manInp()\r\nprint(round(((B * p1 * (r1**2))/(A*p2 + B * p1))**0.5, 9))", "import math\nx = list(map(int, input().split(' ')))\nn,x = x[0], x[1:]\n\ny = list(map(int, input().split(' ')))\nm,y = y[0], y[1:]\n\nz = list(map(int, input().split(' ')))\nk,z = z[0], z[1:]\n\na,b = list(map(int, input().split(' ')))\n\nr1 = max(x)\np1 = max(y)\np2 = min(z)\n\nr2 = 1/math.sqrt(((p2*a/(b*p1))+1)*(1/(r1**2)))\nprint(r2)", "r1 = [int(i) for i in input().split()]\r\ndel r1[0]\r\np1 = [int(i) for i in input().split()]\r\ndel p1[0]\r\np2 = [int(i) for i in input().split()]\r\ndel p2[0]\r\nA, B = map(int, input().split())\r\nr1 = max(r1)\r\np1 = max(p1)\r\np2 = min(p2)\r\nr2 = r1 * (B * p1 / (A * p2 + B * p1)) ** 0.5\r\nprint(r2)", "from sys import stdin\r\nimport math\r\n\r\ndef get_data(info_r1,info_p1,info_p2,a,b):\r\n max_r = float(0)\r\n for cont in range(1,int(info_r1[0]) + 1):\r\n for pos in range(1,int(info_p1[0])+ 1):\r\n for var in range(1,int(info_p2[0])+1):\r\n r2 = float(math.sqrt((info_p1[pos]*info_r1[cont]**2)/((a*info_p2[var]/b)+info_p1[pos])))\r\n if r2 > max_r:\r\n max_r = r2\r\n return max_r\r\n\r\ndef main():\r\n info_r1 = [float (x) for x in stdin.readline().split()]\r\n info_p1 = [float (x) for x in stdin.readline().split()]\r\n info_p2 = [float (x) for x in stdin.readline().split()]\r\n [a,b] = [float (x) for x in stdin.readline().split()]\r\n info_r1.remove(info_r1[0])\r\n info_p1.remove(info_p1[0])\r\n info_p2.remove(info_p2[0])\r\n info_r1.sort(reverse=True)\r\n info_p1.sort(reverse=True)\r\n info_p2.sort()\r\n r2 = float(math.sqrt((info_p1[0]*info_r1[0]**2)/((a*info_p2[0]/b)+info_p1[0])))\r\n print(\"{:.12f}\".format(r2))\r\n \r\nmain() \r\n \r\n", "import math\n\nx = list(map(int, input().split()))\nn = x[0]\nx = x[1:n+1]\n\ny = list(map(int, input().split()))\nm = y[0]\ny = y[1:m+1]\n\nz = list(map(int, input().split()))\nk = z[0]\nz = z[1:k+1]\n\nA, B = map(int, input().split())\n\nr1 = max(x)\np1 = max(y)\np2 = min(z)\n\nprint(math.sqrt(B*p1 / (B*p1 + A*p2)) * r1)\n", "r1 = max(list(map(int,input().split()))[1:])\r\np1 = list(map(int,input().split()))\r\np2 = min(list(map(int,input().split()))[1:])\r\nA,B = list(map(int,input().split())) \r\n\r\nr2 = 0\r\nfor p in p1[1:]:\r\n curr = ((B*p*r1*r1)/(p2*A + B*p))**0.5\r\n r2 = max(r2,curr)\r\n\r\nprint(r2)", "r1 = max(list(map(int,input().split()))[1:])\r\np1 = max(list(map(int,input().split()))[1:])\r\np2 = min(list(map(int,input().split()))[1:])\r\na,b = map(int,input().split())\r\nr2 = 0\r\nthe_root = ((b*p1)/((b*p1)+(a*p2)))**0.5\r\nr2 = r1*the_root\r\nprint('%.7f' %r2)\r\n", "# link: https://codeforces.com/contest/215/problem/B\r\nif __name__ == \"__main__\":\r\n r1 = list(map(int, input().split()))\r\n r1 = r1[1:]\r\n p1 = list(map(int, input().split()))\r\n p1 = p1[1:]\r\n p2 = list(map(int, input().split()))\r\n p2 = p2[1:]\r\n r1.sort()\r\n p1.sort()\r\n p2.sort()\r\n r1 = r1[::-1]\r\n p1 = p1[::-1]\r\n # p2 as it is \r\n A,B = map(int, input().split())\r\n # find r2\r\n for i in range(len(r1)):\r\n for j in range(len(p1)):\r\n for k in range(len(p2)):\r\n r2 = ( (B*p1[j]*r1[i]*r1[i]) / (A*p2[k] + B*p1[j]) ) ** 0.5\r\n # print(r2)\r\n mass_outer = p1[j]*(r1[i]*r1[i] - r2*r2)\r\n mass_inner = p2[k]*r2*r2 \r\n value = round(mass_outer/mass_inner,1)\r\n if value == round(A/B,1):\r\n print(round(r2,9))\r\n exit(0)\r\n", "import math\nimport 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\nline1 = list(invr())\nline2 = list(invr())\nline3 = list(invr())\nA, B = list(invr())\n\n# m_out = pi(r1^2 - r2^2) * p1\n# m_in = pi(r2^2) * p2\n# m_out / m_in = (r1^2 - r2^2) * p1 / r2^2 / p2 = k\n# p1/p2 (r1^2 - r2^2) = k r2^2\n# p1/p2 r1^2 = (k + p1/p2) r2^2\n# r2 = r1 * sqrt(p1/p2 / (k + p1/p2))\n# r2 = r1 * sqrt(1 / (1 + k * p2/p1)\n# max r1\n# min k * p2 / p1\n# min p2, max p1\nr1_opt = float('-inf')\nfor i in range(1, len(line1)):\n r1_opt = max(r1_opt, line1[i])\np1_opt = float('-inf')\nfor i in range(1, len(line2)):\n p1_opt = max(p1_opt, line2[i])\np2_opt = float('inf')\nfor i in range(1, len(line3)):\n p2_opt = min(p2_opt, line3[i])\n\nans = r1_opt * math.sqrt(1.0 / (1.0 + 1.0*A * p2_opt / (1.0 * B * p1_opt) ) )\nprint(ans)\n# print(r1_opt, p1_opt, p2_opt)\n\n# 6\n\n\n", "# Author: SaykaT\r\n# Problem: 215B.py\r\n# Time Created: August 29(Saturday) 2020 || 07:54:00\r\n\r\n#>-------------------------<#\r\nimport math\r\n#>-------------------------<#\r\n\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\ndef formula(a, b, p1, p2, r1):\r\n ans = (b*p1*(r1**2)) / ((b*p1) + (a*p2))\r\n\r\n return ans\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n x = list(map(int, input().split()))\r\n y = list(map(int, input().split()))\r\n z = list(map(int, input().split()))\r\n\r\n x = x[1:]\r\n y = y[1:]\r\n z = z[1:]\r\n\r\n a, b = map(int, input().split())\r\n\r\n r1 = max(x)\r\n p2 = min(z)\r\n\r\n ans = 0\r\n for i in y:\r\n tmp_ans = formula(a, b, i, p2, r1)\r\n ans = max(ans, tmp_ans)\r\n print(math.sqrt(ans))\r\n\r\n\r\n\r\n# Single test cases\r\nsolve()\r\n\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ne,f=map(int,input().split())\r\nd=max(a[1:])**2\r\nd1=max(b[1:])\r\nd2=min(c[1:])\r\nD=round(((d*f)/((d2/d1)*e+f))**(1/2),10)\r\nprint(D)", "def readline():\r\n return [int(c) for c in input().split()]\r\n\r\n\r\ndef read_input():\r\n _, *x = readline() # possible values of r1\r\n _, *y = readline() # possible values of p1\r\n _, *z = readline() # possible values of p2\r\n a, b = readline() # weight ratio a/b\r\n\r\n return x, y, z, a, b\r\n\r\n\r\ndef solve(x, y, z, a, b):\r\n r1, p1, p2 = max(x), max(y), min(z)\r\n return (r1 ** 2 * p1 * b / (a * p2 + b * p1)) ** 0.5\r\n\r\n\r\ndef main():\r\n _input = read_input()\r\n ans = solve(*_input)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = list(map(int, input().split()))[1:]\r\ny = list(map(int, input().split()))[1:]\r\nz = list(map(int, input().split()))[1:]\r\nA, B = map(int, input().split())\r\nr1 = max(x)\r\np2 = min(z)\r\ndef findr2(A, B, r1, p1, p2):\r\n return ((B*p1*(r1**2))/(A*p2 + B*p1))**0.5\r\n\r\nans = 0\r\nfor i in y:\r\n ans = max(ans, findr2(A, B, r1, i, p2))\r\n\r\nprint(ans)", "x = sorted(list(map(int,input().split()))[1:])\ny = sorted(list(map(int,input().split()))[1:])\nz = sorted(list(map(int,input().split()))[1:])\na ,b=map(int,input().split())\nprint(x[-1]*(b*y[-1]/(b*y[-1]+a*z[0]))**0.5)", "import math\r\n\r\nx1 = [int(x)**2 for x in input().split()][1:]\r\np1 = [int(x) for x in input().split()][1:]\r\np2 = [int(x) for x in input().split()][1:]\r\na, b = [int(x) for x in input().split()]\r\nx1.sort()\r\np1.sort()\r\np2.sort()\r\nr1 = x1[-1]\r\npo1 = p1[-1]\r\npo2 = p2[0]\r\nprint(math.sqrt(r1/((a*po2)/(b*po1)+1)))", "r1 = max(list(map(int,input().split()))[1:])\r\np1 = max(list(map(int,input().split())))\r\np2 = min(list(map(int,input().split()))[1:])\r\nA,B = list(map(int,input().split())) \r\n\r\nr2 = 0\r\ncurr = ((B*p1*r1*r1)/(p2*A + B*p1))**0.5\r\nr2 = max(r2,curr)\r\nprint(r2)", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\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\nfirst=get_list()\r\nsecond=get_list()\r\nthird=get_list()\r\na,b=get_ints()\r\n####\r\nn=first[0]\r\nx=first[1:]\r\nm=second[0]\r\ny=second[1:]\r\nk=third[0]\r\nz=third[1:]\r\nr1=max(x)\r\np1=max(y)\r\np2=min(z)\r\nans=((b * p1 * r1**2) / (a * p2 + b * p1))\r\nprint(math.sqrt(ans))", "x = list(map(int,input().split())); r= max(x[1:]); import math\r\ny = list(map(int,input().split())); p1= max(y[1:])\r\nz = list(map(int,input().split())); p2= min(z[1:]) \r\na,b = map(int,input().split()); res = math.sqrt((b * p1 * r * r) / (a * p2 + b * p1))\r\nprint(res) \r\n\r\n", "import math\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nz=list(map(int,input().split()))\na,b=map(int,input().split())\nx.pop(0)\ny.pop(0)\nz.pop(0)\nr1=max(x)\np1=max(y)\np2=min(z)\np=p1*b/(p1*b+p2*a)\np=math.sqrt(p)\nprint(r1*p)", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\n# input = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\n\r\ndef take(arr):\r\n return arr[0], sorted(arr[1:])\r\n\r\n\r\ndef ans(r1, p1, p2):\r\n return ((b * p1 * (r1 ** 2)) / (a * p2 + b * p1)) ** 0.5\r\n\r\n\r\nn, lstx = take(list(read()))\r\n# print(n, lstx)\r\nm, lsty = take(list(read()))\r\n# print(m, lsty)\r\nk, lstz = take(list(read()))\r\n# print(k, lstz)\r\na, b = read()\r\nprint(ans(lstx[-1], lsty[-1], lstz[0]))\r\n# print(lstx[-1], lsty[-1], lstz[0])\r\n", "from math import sqrt\r\nmax_ans = 0\r\n\r\nr1s = list(map(int,input().split()))[1:]\r\np1s = list(map(int,input().split()))[1:]\r\np2s = list(map(int,input().split()))[1:]\r\nA,B = map(int,input().split())\r\np2 = min(p2s)\r\nr1 = max(r1s)\r\n\r\nfor p1 in p1s :\r\n r2 = sqrt((r1**2*p1*B)/((A*p2)+(B*p1)))\r\n if r2 > max_ans :\r\n max_ans = r2\r\nprint(max_ans)", "xs = list(map(int, input().split()))\nn, xs = xs[0], xs[1:]\nxs.sort()\nys = list(map(int, input().split()))\nm, ys = ys[0], ys[1:]\nys.sort()\nzs = list(map(int, input().split()))\nk, zs = zs[0], zs[1:]\nzs.sort()\nA, B = map(int, input().split())\nr1, p1, p2 = xs[n-1], ys[m-1], zs[0]\nr2 = (r1**2 / (1 + A*p2 / (B*p1))) ** 0.5\nprint(r2)\n", "from math import sqrt\r\n\r\n\r\ndef main():\r\n X = list(map(int, input().split()))\r\n n = X.pop(0)\r\n Y = list(map(int, input().split()))\r\n m = Y.pop(0)\r\n Z = list(map(int, input().split()))\r\n k = Z.pop(0)\r\n A, B = list(map(int, input().split()))\r\n\r\n rho1 = max(Y)\r\n rho2 = min(Z)\r\n\r\n C = (rho2 / rho1) * (A / B)\r\n C += 1\r\n r_1 = 0\r\n \r\n for i in range(n):\r\n r_1 = max(r_1, X[i])\r\n\r\n r_2 = r_1 * sqrt(1 / C)\r\n\r\n print(f\"{r_2:.6f}\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=list(map(int,input().split()[1::]))\r\nb=list(map(int,input().split()[1::]))\r\nc=list(map(int,input().split()[1::]))\r\nA,B=map(int,input().split())\r\nprint(max(a)*((B*max(b))/((A*min(c)+B*max(b))))**0.5)", "x_n = [int(x) for x in input().split()]\r\ny_n = [int(x) for x in input().split()]\r\nz_n = [int(x) for x in input().split()]\r\nA,B = map(int,input().split())\r\ndef out(x):\r\n return x[1:]\r\nx_n = out(x_n)\r\ny_n = out(y_n)\r\nz_n = out(z_n)\r\nx = max(x_n)\r\ny = max(y_n)\r\nz = min(z_n)\r\nk = A/B\r\nprint(x/(k*z/y+1)**0.5)", "from math import sqrt\r\n\r\narr1 = list(map(int, input().split()))[1:]\r\narr2 = list(map(int, input().split()))[1:]\r\narr3 = list(map(int, input().split()))[1:]\r\na, b = map(int, input().split())\r\n\r\n\r\nr1 = max(arr1)\r\np1 = max(arr2)\r\n\r\nmx = float('-inf')\r\nfor j in arr3:\r\n mx = max(mx, r1 * sqrt((b * p1) / (b * p1 + a * j)))\r\n\r\nprint(mx)\r\n\r\n\r\n\r\n", "import math\r\n\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nz = list(map(int, input().split()))\r\nA, B = map(int, input().split())\r\n\r\nn = x.pop(0)\r\nm = y.pop(0)\r\nk = z.pop(0)\r\n\r\nr1 = max(x)\r\np1 = max(y)\r\np2 = min(z)\r\n \r\nr2 = math.sqrt(r1**2 * p1 / (A/B*p2+p1))\r\nprint(r2)\r\n", "import math\r\ndef calc(A , B , P1 , P2 , R1) :\r\n return round(math.sqrt( ( B * P1 * ( R1**2 ) ) / (A * P2 + B * P1)) , 10)\r\nr1 = list(map(int , input().split()))\r\np1 = list(map(int , input().split()))\r\np2 = list(map(int , input().split()))\r\nmass = list(map(int , input().split()))\r\nr1.pop(0) , p1.pop(0) , p2.pop(0)\r\nr1.sort() , p1.sort() , p2.sort()\r\nprint(calc( mass[0] , mass[1] , p1[len(p1) - 1 ], p2[0] , r1[len(r1) - 1]))", "import math\r\nl = list(map(int, input().split()))\r\nr1 = max(l[1:])\r\nl = list(map(int, input().split()))\r\np1 = max(l[1:])\r\nl = list(map(int, input().split()))\r\np2 = min(l[1:])\r\na, b = map(int, input().split())\r\nr22 = r1 * r1 / (a * p2 / (b * p1) + 1)\r\nprint(math.sqrt(r22))\r\n\r\n", "pi = 3.1415926535897932384626433832795028841971693993751058\r\n\r\nx = list(map(int, input().split()))[1:]\r\ny = list(map(int, input().split()))[1:]\r\nz = list(map(int, input().split()))[1:]\r\na, b = list(map(int, input().split()))\r\nx.sort(reverse=True)\r\ny.sort(reverse=True)\r\nz.sort()\r\nr1 = x[0]\r\np1 = y[0]\r\np2 = z[0]\r\nLHS = (pi * r1**2 * p1 * b) / (p2 * a + p1 * b)\r\nRHS = LHS / pi\r\nr2 = RHS ** 0.5\r\nprint(r2)", "r1=list(map(int,input().split()))\r\np1=list(map(int,input().split()))\r\np2=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\nrr1=max(r1[1:])\r\npp1=max(p1[1:])\r\npp2=min(p2[1:])\r\nr2=((b*pp1*(rr1)**2)/(a*pp2+b*pp1))**.5\r\nprint(r2)", "r = max(list(map(int, input().split())))\np1 = max(list(map(int, input().split()[1:])))\np2 = min(list(map(int, input().split()[1:])))\na, b = map(int, input().split())\nprint(r*(1/((1+a*p2/(b*p1))**0.5)))", "import math\r\nl1 = list(map(int,input().split()))\r\n\r\nr1 = max(l1[1 : ])\r\n\r\nl2 = list(map(int,input().split()))\r\nl2 = l2[1 : ]\r\n\r\nl3 = list(map(int,input().split()))\r\np2 = min(l3[1 : ])\r\n\r\na , b = map(int,input().split())\r\n\r\nmaxr2 = 0\r\nfor i in range(len(l2)):\r\n\r\n r2 = (math.sqrt ((l2[i] * b ) / ( (b * l2[i]) + (p2 * a))))\r\n r2 *= r1\r\n if (r2 > maxr2):\r\n maxr2 = r2\r\n\r\nprint('%.12f' % maxr2)\r\n\r\n", "import math\r\n\r\nr1 = list(map(int, input().split()))\r\nr1.pop(0)\r\nr1 = max(r1)\r\n\r\n\r\np1 = list(map(int, input().split()))\r\np1.pop(0)\r\np1 = max(p1)\r\n\r\n\r\np2 = list(map(int, input().split()))\r\np2.pop(0)\r\np2 = min(p2)\r\n\r\nA,B = map(int, input().split())\r\n\r\n\r\np1_over_p2 = p1/p2\r\nA_over_B = A/B\r\n\r\nr1_square = r1 ** 2\r\nr2_square = p1_over_p2 * (r1_square/(A_over_B + p1_over_p2))\r\n\r\nprint(math.sqrt(r2_square))\r\n\r\n", "Or=list(map(float,input().split()))\r\nOr=max(Or[1:])\r\np1=list(map(float,input().split()))\r\np1=max(p1[1:])\r\np2=list(map(float,input().split()))\r\np2=min(p2[1:])\r\na,b=map(float,input().split())\r\nd1=a/b\r\nd2=p2/p1\r\nk=(Or**2)/((d1)*(d2)+1)\r\nprint(k**0.5)", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nn,m=map(int,input().split())\r\na.remove(a[0])\r\nb.remove(b[0])\r\nc.remove(c[0])\r\nr=max(a)\r\np1=max(b)\r\np2=min(c)\r\nk=n/m\r\ns=pow(p1/(k*p2+p1),0.5)\r\nr2=s*r\r\nprint(r2)", "from decimal import Decimal\r\n\r\nn, *x = [int(i) for i in input().split()]\r\nm, *y = [int(i) for i in input().split()]\r\nk, *z = [int(i) for i in input().split()]\r\nA, B = [int(i) for i in input().split()]\r\n\r\nr1 = max(x)\r\np1 = max(y)\r\np2 = min(z)\r\n\r\nr2 = Decimal(r1) / (Decimal(A * p2) / Decimal(B * p1) + Decimal(1)).sqrt()\r\n\r\nprint(r2)\r\n", "from math import sqrt\r\nA= lambda: list(map(int, input().split()))\r\nr1 = max(A()[1:])\r\np1s = A()[1:]\r\np2 = min(A()[1:])\r\na, b = A()\r\nprint(str(sqrt(max(b * p1 * r1**2 / float(a * p2 + b * p1) for p1 in p1s))))\r\n", "import math\r\nx = list(map(int,input().split()))\r\nn = x[0]\r\ny = list(map(int,input().split()))\r\nm = y[0]\r\nz = list(map(int,input().split()))\r\nk = z[0]\r\na,b = map(int,input().split())\r\nr1 = max(x[1:])\r\np1 = max(y[1:])\r\np2 = min(z[1:])\r\n\r\nprint(r1/(math.sqrt((a*p2)/(b*p1)+1)))" ]

[ "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 = [0] + list(input().rstrip())\r\nn = len(s) - 1\r\nu = [[] for _ in range(130)]\r\nfor i in range(1, n + 1):\r\n u[s[i]].append(i)\r\nx = [0] * (n + 1)\r\nfor i in range(97, 123):\r\n for j in u[i]:\r\n x[j] = 1\r\n y = list(x)\r\n for j in range(1, n + 1):\r\n y[j] += y[j - 1]\r\n ok = 1\r\n for j in range(m, n + 1):\r\n if not y[j] - y[j - m]:\r\n ok = 0\r\n break\r\n if ok:\r\n for j in u[i]:\r\n x[j] = 0\r\n la = 0\r\n v = -1\r\n c = 0\r\n for j in range(1, n + 1):\r\n if s[j] < i:\r\n la = j\r\n elif s[j] == i:\r\n v = j\r\n if la + m == j:\r\n la = v\r\n c += 1\r\n ans = [chr(j) * len(u[j]) for j in range(97, i)] + [chr(i) * c]\r\n break\r\nsys.stdout.write(\"\".join(ans))", "m = int(input())\ns = input()\nd = [0 for _ in range(26)]\nfor char in s:\n d[ord(char) - ord('a')] += 1\nfor i in range(26):\n char, left, right, counter = chr(ord('a') + i), -1, -1, 0\n for j in range(len(s)):\n if s[j] < char:\n left = j\n if s[j] == char:\n right = j\n if j - left >= m:\n if j - right >= m:\n counter = -1\n break\n counter += 1\n left = right\n if ~counter:\n for j in range(i):\n print(chr(ord('a') + j) * d[j], end='')\n print(chr(ord('a') + i) * counter)\n break\n \t \t \t \t \t\t \t \t \t \t\t \t", "m = int(input())\r\ns = list(input())\r\n\r\nd = [0 for _ in range(26)]\r\n\r\nfor c in s:\r\n d[ord(c) - ord('a')] += 1\r\n\r\nfor i in range(26):\r\n c = chr(ord('a') + i)\r\n l = -1\r\n r = -1\r\n cnt = 0\r\n for j in range(len(s)):\r\n if s[j] < c:\r\n l = j\r\n if s[j] == c:\r\n r = j\r\n\r\n if j - l >= m:\r\n if j - r >= m:\r\n cnt = -1\r\n break\r\n cnt += 1\r\n l = r\r\n\r\n if ~cnt:\r\n for k in range(i):\r\n print(chr(ord('a') + k) * d[k], end='')\r\n print(chr(ord('a') + i) * cnt)\r\n break\r\n", "from collections import Counter\r\nfrom string import ascii_lowercase as asc\r\nm, s = int(input()), input()\r\ng = Counter(s)\r\n\r\ndef solve(c):\r\n p = 0\r\n for q in ''.join(x if x >= c else ' ' for x in s).split():\r\n i, j = 0, -1 \r\n while j + m < len(q):\r\n j = q.rfind(c, j + 1, j + m + 1)\r\n if j == -1:\r\n return None\r\n i += 1\r\n p += i\r\n return p\r\n\r\nfor c in asc:\r\n f = solve(c)\r\n if f is not None:\r\n g[c] = f\r\n print(''.join(x*g[x] for x in asc if x <= c))\r\n break\r\n", "m = int(input())\ns = input().strip()\n\nsa = [0] * len(s)\nfor i in range(len(s)):\n\tsa[i] = ord(s[i]) - ord('a')\n\nsa = [-1] + sa + [-1]\n\ndef check_value(sa, m, threshold):\n\tprev_ind = 0\n\tfor i in range(len(sa)):\n\t\tif sa[i] <= threshold:\n\t\t\tif i - prev_ind <= m:\n\t\t\t\tprev_ind = i\n\t\t\telse:\n\t\t\t\treturn False\n\treturn True\n\ndef get_indexes(sa, threshold):\n\tseq = [i for i in range(len(sa)) if sa[i] <= threshold]\n\t# seq = []\n\t# for i in range(len(sa)):\n\t# \tif sa[i] < threshold:\n\t# \t\tseq[i].append(sa[i], i)\n\treturn seq\n\ndef filter_indexes(sa, seq, el, m):\n\tnew_seq = [0]\n\tfor i in range(1, len(seq) - 1):\n\t\tif sa[seq[i]] != el or (sa[seq[i]] == el and seq[i+1] - new_seq[-1] > m):\n\t\t\tnew_seq.append(seq[i])\n\treturn new_seq[1:]\n\n\nthreshold = -1\nwhile (not check_value(sa, m, threshold)):\n\t# print(threshold, get_indexes(sa, threshold))\n\tthreshold += 1\n# print(threshold, get_indexes(sa, threshold), sa)\n\nseq = get_indexes(sa, threshold)\nseq = filter_indexes(sa, seq, threshold, m)\n\ns = ''.join(sorted([chr(ord('a') + sa[x]) for x in seq]))\nprint(s)", "m = int(input())\r\ns = input()\r\nn = len(s)\r\nt = []\r\nu = [1] * n\r\nd = 'a'\r\ni = 0\r\nwhile i <= n - m:\r\n k = i\r\n for j in range(m):\r\n if s[i + j] <= s[k]: k = i + j\r\n t += [s[k]]\r\n d = max(d, s[k])\r\n u[k] = 0\r\n i = k + 1\r\nt += [q for q, v in zip(s, u) if q < d and v]\r\nprint(''.join(sorted(t)))", "n = int(input())\r\nword = input()\r\n\r\ncnt = [0]*26\r\nfor x in word:\r\n cnt[ord(x)-ord('a')] += 1\r\n\r\nind = 25\r\nsum = 0\r\n\r\nfor i in range(26):\r\n pre = -1\r\n cur = -1\r\n ans = 0\r\n flag = True\r\n for j,x in enumerate(word):\r\n if ord(x)-ord('a')<i:\r\n pre = j\r\n elif ord(x)-ord('a')==i:\r\n cur = j\r\n if j-pre==n:\r\n if j-cur>=n:\r\n flag = False\r\n break\r\n pre = cur\r\n ans += 1\r\n #print(i, j, pre, cur, ans)\r\n if flag:\r\n ind = i\r\n sum = ans\r\n break\r\n\r\nfor i in range(ind):\r\n print(chr(ord('a')+i)*cnt[i],end='')\r\nprint(chr(ord('a')+ind)*sum)\r\n \r\n " ]

[ "n = int(input())\r\nhash_tags = []\r\nfor i in range(n):\r\n hash_tag = input()\r\n hash_tags.append(hash_tag)\r\n \r\nfor j in range(n - 1, 0, -1):\r\n first_tag = hash_tags[j - 1]\r\n second_tag = hash_tags[j]\r\n flag = True\r\n for i in range(1, min(len(first_tag), len(second_tag))):\r\n if first_tag[i] > second_tag[i]:\r\n first_tag = first_tag[:i]\r\n flag = False\r\n break\r\n if first_tag[i] < second_tag[i]:\r\n flag = False\r\n break\r\n\r\n \r\n if flag and len(first_tag) > len(second_tag):\r\n first_tag = first_tag[:len(second_tag)]\r\n hash_tags[j - 1] = first_tag\r\n\r\nfor i in range(n):\r\n print(hash_tags[i])", "from sys import stdin,stdout\r\nn = int(stdin.readline())\r\na = [stdin.readline() for i in range(n)]\r\nfor i in range(len(a)-1,0,-1):\r\n if a[i-1]>a[i]:\r\n s = 0\r\n while s<len(a[i]) and a[i-1][s]==a[i][s]:\r\n s+=1\r\n a[i-1] = a[i-1][:s]\r\nstdout.write('\\n'.join(a))", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\nA = [0] * n\r\nfor j in range(n):\r\n A[j] = stdin.readline().strip()\r\nanswer = [0] * n\r\nanswer[-1] = A[-1]\r\nfor j in range(n-2,-1,-1):\r\n if A[j] <= answer[j+1]:\r\n answer[j] = A[j]\r\n else:\r\n for i in range(min(len(answer[j+1]),len(A[j]))):\r\n if A[j][i] > answer[j+1][i]:\r\n i-=1\r\n break\r\n answer[j] = A[j][:i+1]\r\nprint('\\n'.join(answer))", "n = int(input())\r\na = [input() for i in range(n)]\r\nfor i in range(n - 1, 0, -1):\r\n\tb = a[i]\r\n\tc = a[i - 1]\r\n\tl1 = len(b)\r\n\tl2 = len(c)\r\n\tfor j in range(min(l1, l2)):\r\n\t\tif b[j] < c[j]:\r\n\t\t\ta[i - 1] = c[:j]\r\n\t\t\tbreak\r\n\t\telif b[j] > c[j]: break\r\n\telse:\r\n\t\tif l2 > l1:\r\n\t\t\ta[i - 1] = a[i]\r\nprint('\\n'.join(a))", "# _ooOoo_\r\n# o8888888o\r\n# 88\" . \"88\r\n# (| -_- |)\r\n# O\\ = /O\r\n# ____/`---'\\____\r\n# .' \\\\| |// `.\r\n# / \\\\||| : |||// \\\r\n# / _||||| -:- |||||- \\\r\n# | | \\\\\\ - /// | |\r\n# | \\_| ''\\---/'' | |\r\n# \\ .-\\__ `-` ___/-. /\r\n# ___`. .' /--.--\\ `. . __\r\n# .\"\" '< `.___\\_<|>_/___.' >'\"\".\r\n# | | : `- \\`.;`\\ _ /`;.`/ - ` : | |\r\n# \\ \\ `-. \\_ __\\ /__ _/ .-` / /\r\n# ======`-.____`-.___\\_____/___.-`____.-'======\r\n# `=---='\r\n# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\r\n# 佛祖保佑 永无BUG\r\n\r\nimport sys\r\n# sys.setrecursionlimit(int(1e9))\r\n# import random\r\nfrom copy import deepcopy\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce\r\nfrom itertools import accumulate,product\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\r\n# from bisect import bisect_left,bisect_right\r\n# from sortedcontainers import *\r\n# input = sys.stdin.buffer.readline\r\n# import re\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef mp(): return list(map(int, input().split()))\r\ndef it(): return int(input())\r\nfrom math import *\r\n\r\nMOD = int(1e9 + 7)\r\nINF = int(1e18)\r\n\r\ndef solve():\r\n n=it()\r\n s=[]\r\n for _ in range(n):\r\n s.append(input().strip())\r\n for i in range(n-2,-1,-1):\r\n a,b=s[i],s[i+1]\r\n ptr,flag=0,False\r\n while ptr<len(a) and ptr<len(b):\r\n if a[ptr]<b[ptr]:\r\n flag=True\r\n break\r\n elif a[ptr]>b[ptr]:\r\n break\r\n else:ptr+=1\r\n if flag:\r\n continue\r\n s[i]=s[i][:ptr]\r\n for i in range(n):\r\n print(s[i])\r\n\r\n return\r\n\r\nif __name__ == '__main__':\r\n # t=it()\r\n # for _ in range(t):\r\n # solve()\r\n\r\n # n=it()\r\n # n,m,i=mp()\r\n # n,m=mp()\r\n solve()", "from collections import defaultdict, Counter, deque\r\nimport threading\r\nimport sys\r\n# input = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n n = ri()\r\n s = [rs() for i in range(n)]\r\n for i in range(n-1, 0, -1):\r\n if s[i-1] > s[i]:\r\n j = 0\r\n while j < len(s[i]) and s[i-1][j] == s[i][j]:\r\n j += 1\r\n s[i-1] = s[i-1][:j]\r\n for i in s:\r\n print(i)\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\nimport heapq\r\nn=int(sys.stdin.readline())\r\narr=['' for x in range(n)]\r\nfor i in range(n):\r\n\tarr[i]=sys.stdin.readline()[:-1]\r\nif n==1:\r\n\tprint(arr[0])\r\n\tsys.exit()\r\nfor i in range(n-2,-1,-1):\r\n\tcur1=arr[i]\r\n\tcur2=arr[i+1]\r\n\ta,b=len(cur1),len(cur2)\r\n\tz=True\r\n\t#print(cur1,cur2)\r\n\t#print(a,b)\r\n\tcnt=1\r\n\tfor j in range(1,min(a,b)):\r\n\t\tif cur1[j]==cur2[j]:\r\n\t\t\tcnt+=1\r\n\t\t\tcontinue\r\n\t\telif cur1[j]<cur2[j]:\r\n\t\t\tz=False\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif not z:\r\n\t\tcontinue\r\n\t#print(cnt,'cnt')\r\n\tarr[i]=cur1[:cnt]\r\nfor i in range(n):\r\n\tprint(arr[i])\r\n", "def wrongOrderPosition(i, j) -> int:\r\n before = a[i]\r\n after = a[j]\r\n lBefore = len(before)\r\n lAfter = len(after)\r\n k = 0\r\n while k < lBefore and k < lAfter:\r\n if before[k] > after[k]:\r\n return k\r\n elif before[k] < after[k]:\r\n return -1\r\n k += 1\r\n if len(before) > len(after):\r\n return k\r\n else:\r\n return -1\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(str(input()))\r\nfor i in range(1, n):\r\n pos = wrongOrderPosition(n - (i + 1), n - i)\r\n if pos > -1:\r\n a[n - (i + 1)] = a[n - (i + 1)][:pos]\r\nfor word in a:\r\n print(word)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\ns=[input().rstrip()[1:] for i in range(n)]\r\nfor i in range(n-1)[::-1]:\r\n for j in range(min(len( s[i]),len(s[i+1]) )):\r\n if s[i][j]<s[i+1][j]:\r\n break\r\n if s[i][j]>s[i+1][j]:\r\n s[i]=s[i][:j]\r\n break\r\n else:\r\n s[i]=min(s[i],s[i+1])\r\nfor i in range(n):\r\n print(\"#\"+s[i])", "N = int( input() )\r\nA = [ input() for i in range( N ) ]\r\nfor i in range( N - 1, 0, -1 ):\r\n if A[ i - 1 ] > A[ i ]:\r\n ptr = 0\r\n while ptr < len( A[ i ] ) and A[ i - 1 ][ ptr ] == A[ i ][ ptr ]:\r\n ptr += 1\r\n A[ i - 1 ] = A[ i - 1 ][ : ptr ]\r\nprint( '\\n'.join( A ) )\r\n", "(\"NO\")\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef I(): return input().strip()\r\ndef II(): return int(input().strip())\r\ndef LI(): return [*map(int, input().strip().split())]\r\nimport copy\r\nimport string, math, time, functools, random, fractions\r\nfrom heapq import heappush, heappop, heapify\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom itertools import permutations, combinations, groupby, count, filterfalse\r\nfrom operator import itemgetter\r\n\r\nfor _ in range(1):\r\n n = II()\r\n l = []\r\n for i in range(n):\r\n l.append(I())\r\n l.reverse()\r\n\r\n for i in range(n-1):\r\n if l[i]<l[i+1]:\r\n c = 0\r\n while c < len(l[i]) and l[i+1][c] <= l[i][c]:\r\n c = c+1\r\n l[i+1] = l[i+1][:c]\r\n l.reverse()\r\n for i in range(len(l)):\r\n print(l[i])\r\n\r\n\r\n\r\n\r\n\r\n", "def g(c,d):\n s=0\n while s<len(a[d]) and a[c][s]==a[d][s]:s+=1\n a[c]=a[c][:s]\n\ndef f(a):\n for i in range(len(a)-1,0,-1):\n if a[i-1]>a[i]:g(i-1,i)\n print('\\n'.join(a))\n\nn=int(input())\na=[input()for i in range(n)]\nf(a)\n\n\n", "def compareHesh(heshBottom, heshTop):\r\n lenB, lenT = len(heshBottom), len(heshTop)\r\n flag = True\r\n for i in range(1, lenT): \r\n if i+1 > lenB: \r\n return i\r\n elif heshTop[i] > heshBottom[i]:\r\n return i\r\n elif heshTop[i] < heshBottom[i]:\r\n return 0 \r\n \r\n return 0\r\n\r\nnumberHesh = int(input())\r\nwordHesh = []\r\nfor i in range(numberHesh):\r\n wordHesh.append(input())\r\n \r\nfor i in range(numberHesh - 1, 0, -1):\r\n cut = compareHesh(wordHesh[i], wordHesh[i - 1])\r\n if cut == 0:\r\n continue\r\n wordHesh[i - 1] = wordHesh[i-1][:cut]\r\nfor i in range(numberHesh):\r\n print(wordHesh[i])", "n = int(input())\r\n\r\ntags = []\r\nfor i in range(n):\r\n tags.append(input())\r\n\r\nfor i in range(n - 2, -1, -1):\r\n curr = tags[i]\r\n next = tags[i+1]\r\n for c in range(min(len(curr), len(next))):\r\n if curr[c] != next[c]:\r\n if curr[c] > next[c]:\r\n tags[i] = curr[:c]\r\n break\r\n else:\r\n if len(curr) > len(next):\r\n tags[i] = curr[:len(next)]\r\n\r\nprint(\"\\n\".join(tags))", "def cnt(a, b):\r\n ln = 0\r\n l = 0\r\n r = len(a) - 1\r\n\r\n if a > b:\r\n while (r > l + 1):\r\n \r\n mid = (l + r) // 2\r\n \r\n if a[:mid + 1] > b:\r\n r = mid\r\n else: l = mid\r\n \r\n a = a[:l + 1]\r\n \r\n return a\r\n\r\nn = int(input())\r\ns = []\r\n\r\nfor i in range(n):\r\n b = input()\r\n s.append(b)\r\n\r\n\r\nfor i in range(n - 1, 0, -1):\r\n s[i - 1] = cnt(s[i - 1], s[i])\r\n\r\nfor x in s:\r\n print(x)\r\n\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\r\n\r\nsys.setrecursionlimit(10**7)\r\ninf = 10**20\r\nmod = 10**9 + 7\r\n\r\ndef LI(): return list(map(int, input().split()))\r\ndef II(): return int(input())\r\ndef LS(): return input().split()\r\ndef S(): return input()\r\n\r\n\r\ndef main():\r\n n = II()\r\n a = [S() for _ in range(n)]\r\n for i in range(n-2,-1,-1):\r\n t = a[i]\r\n s = a[i+1]\r\n sl = len(s)\r\n for j in range(1,len(t)):\r\n if j >= sl:\r\n a[i] = s\r\n break\r\n if t[j] > s[j]:\r\n a[i] = t[:j]\r\n break\r\n if t[j] < s[j]:\r\n break\r\n\r\n print('\\n'.join(a))\r\n\r\nmain()", "n = int(input())\r\nl = [input() for i in range(n)]\r\n\r\n\r\ndef sol(i):\r\n j = 1\r\n while j < len(l[i]) and l[i - 1][j] == l[i][j]:\r\n j += 1\r\n l[i - 1] = l[i - 1][:j]\r\n\r\n\r\nfor i in range(n - 1, 0, -1):\r\n if l[i - 1] > l[i]:\r\n sol(i)\r\nprint(\"\\n\".join(l))", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nchallengers = []\r\n\r\nfor i in range(n):\r\n challengers.append(stdin.readline().strip()[1:])\r\n\r\nfor i in range(n - 2, -1, -1):\r\n for j in range(min(len(challengers[i]), len(challengers[i + 1]))):\r\n if challengers[i][j] < challengers[i + 1][j]:\r\n break\r\n elif challengers[i][j] > challengers[i + 1][j]:\r\n challengers[i] = challengers[i][:j]\r\n break\r\n else:\r\n challengers[i] = min(challengers[i], challengers[i + 1])\r\n\r\nfor i in range(n):\r\n challengers[i] = '#' + challengers[i]\r\n \r\nstdout.write('\\n'.join(challengers))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = [list(input().rstrip().decode()) for _ in range(n)]\r\nfor i in range(n - 2, -1, -1):\r\n s1, s2 = s[i], s[i + 1]\r\n l = min(len(s1), len(s2))\r\n f = 1\r\n for j in range(1, l):\r\n if s1[j] < s2[j]:\r\n f = 0\r\n break\r\n elif s1[j] > s2[j]:\r\n u = j\r\n f = 2\r\n break\r\n if f == 1:\r\n s[i] = s1[:l]\r\n elif f == 2:\r\n s[i] = s1[:u]\r\nans = [\"\".join(s0) for s0 in s]\r\nsys.stdout.write(\"\\n\".join(ans))", "# Problem: D. Cloud of Hashtags\r\n# Contest: Codeforces - Codeforces Round #401 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/777/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom math import sqrt, gcd, inf\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\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/777/D\r\n\r\n输入 n(≤5e5) 和长为 n 的字符串数组 a，每个字符串都以 # 开头，所有字符串的长度之和不超过 5e5。\r\n你可以把字符串的任意后缀去掉。\r\n输出使得 a 变为字典序升序，至少需要去掉多少字符。\r\n输入\r\n3\r\n#book\r\n#bigtown\r\n#big\r\n输出\r\n#b\r\n#big\r\n#big\r\n\r\n输入\r\n3\r\n#book\r\n#cool\r\n#cold\r\n输出\r\n#book\r\n#co\r\n#cold\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n a = []\r\n for _ in range(n):\r\n s, = RS()\r\n a.append(s)\r\n for i in range(n - 2, -1, -1):\r\n p = min(len(a[i]), len(a[i + 1]))\r\n for x, y, j in zip(a[i], a[i + 1], range(p)):\r\n if x < y:\r\n break\r\n elif x > y:\r\n a[i] = a[i][:j]\r\n break\r\n else:\r\n if len(a[i]) > p:\r\n a[i] = a[i][:p]\r\n print(*a, sep='\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "\n\n\nn = int(input())\nh = [input() for _ in range(n)]\n\nm2 = len(h[n-1])\nfor i in range(n-2,-1,-1):\n m1 = len(h[i])\n m = min(m1,m2)\n done = False\n for j in range(1,m):\n if h[i][j] == h[i+1][j]:\n continue\n elif h[i][j] > h[i+1][j]:\n h[i] = h[i][:j]\n done = True\n break\n if not done:\n h[i] = h[i][:m]\n m2 = len(h[i])\n\nfor ht in h:\n print(ht)" ]

[ "import sys\r\nx = float(sys.stdin.readline())\r\ndiff = x\r\nfor a in range(1, 11):\r\n for h in range(1, 11):\r\n t = pow((a*a*h*h)/(a*a+4*h*h), 0.5)\r\n if diff > abs(x - t):\r\n diff = abs(x-t)\r\n ans_a = a\r\n ans_h = h\r\nprint(ans_a, ans_h)\r\n", "import math\r\ndef calcu_height(b,h):\r\n obl=math.sqrt(b**2+h**2)\r\n return b*h/obl;\r\nr=float(input())\r\nfor w in range(1,11):\r\n for h in range(1,11):\r\n if abs(r-calcu_height(w/2,h))<=10**(-6):\r\n print(w,end=' ')\r\n print(h,end='\\n')\r\n exit(0)\r\n", "from math import sqrt\r\n\r\n\r\nd = 1e-5\r\nr = float(input())\r\nfor a in range(1, 11):\r\n for h in range(1, 11):\r\n if abs((h * a / 2) / sqrt((h ** 2) + ((a / 2) ** 2)) - r) <= d:\r\n ans_a = a\r\n ans_h = h\r\nprint(ans_a, ans_h)\r\n", "import math\r\n\r\nans = float(input())\r\nff = 999999999.9\r\n\r\nfor h in range(1, 11):\r\n for b in range(1, 11):\r\n sum_val = h * b / math.sqrt(4 * h**2 + b**2)\r\n d = abs(ans - sum_val)\r\n if d < ff:\r\n ff = d\r\n B = b\r\n H = h\r\n\r\nprint(B, H)# 1698242115.8687446", "x = float(input())\r\nfor a in range(1, 10+1):\r\n for h in range(1, 10+1):\r\n if abs(x - (4/(a*a) + 1/(h*h)) ** (-0.5)) <= 10 ** -5:\r\n print(a, h)\r\n quit()", "from sys import stdin,stdout\r\nfrom os import _exit\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\nfrom math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\ndef r(x,y):\r\n return round(x*y/sqrt(pow(x,2)+pow(y,2)),w)\r\n\r\nn = float(input())\r\nw = 4\r\nif n==0.83205:\r\n w = 3\r\nn = round(n,w)\r\n#print(str(n)+\" \")\r\nfor a in range(1,11):\r\n for h in range(1,11):\r\n if r(h,a/2)==n:\r\n print(str(a)+\" \"+str(h)+\"\\n\")\r\n stdout.flush()\r\n _exit(0)\r\n", "import math as m\r\n\r\nx= float(input())\r\nfor a in range (1,10+1):\r\n for h in range (1,10+1):\r\n if abs(x - ( (a*h)/ (2* m.sqrt(a*a/4 +h*h) )) ) <= 10**-5: \r\n print (a,h)\r\n quit()" ]

[ "import sys\nfrom collections import deque\nfrom bisect import bisect_left\n\n# INPUT\nN, UP, DOWN = 0, [], []\n# OUTPUT\nresult = 1\n\ndef read_input():\n global N, UP, DOWN\n readline = sys.stdin.readline\n N = int(readline().rstrip())\n UP = [int(w) for w in readline().split()]\n DOWN = [int(w) for w in readline().split()]\n\n\ndef solve():\n global result\n idx = [-1] * (N + 1)\n for i in range(N):\n idx[UP[i]] = i\n \n que = deque()\n for ray in DOWN:\n i = idx[ray]\n if not que or i < que[0]:\n que.appendleft(i)\n elif i > que[-1]:\n que[-1] = i\n else:\n pos = bisect_left(que, i) - 1\n que[pos] = i\n # print(que)\n result = len(que)\n\ndef write_output():\n print(result)\n\n\nread_input()\nsolve()\nwrite_output()\n", "import sys\n# from collections import deque\nfrom bisect import bisect_left\n\n# INPUT\nN, UP, DOWN = 0, [], []\n# OUTPUT\nresult = 1\n\ndef read_input():\n global N, UP, DOWN\n readline = sys.stdin.readline\n N = int(readline().rstrip())\n UP = [int(w) for w in readline().split()]\n DOWN = [int(w) for w in readline().split()]\n\n\ndef solve():\n global result\n idx = [-1] * (N + 1)\n for i in range(N):\n idx[UP[i]] = -i\n \n # que = deque()\n stk = []\n for ray in DOWN:\n i = idx[ray]\n if not stk or i > stk[-1]:\n stk.append(i)\n else:\n pos = bisect_left(stk, i) \n stk[pos] = i\n result = len(stk)\n\ndef write_output():\n print(result)\n\n\nread_input()\nsolve()\nwrite_output()\n", "from bisect import bisect_left as bl\r\nI=10000000\r\nn=int(input())+1\r\nc=[0]*n\r\nfor i,x in enumerate(map(int,input().split())): c[x]=i\r\nd = [n-c[int(x)] for x in input().split()]\r\nc=[I]*n\r\nfor i in d: c[bl(c,i)]=i\r\nprint( c.index(I))" ]

[ "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nfrom itertools import accumulate\r\nC = [0]+A\r\nC = list(accumulate(C))\r\nA = [0]+A\r\nP = [0]*(n+1)\r\nx = 0\r\n# P[i]: iの直前にある2以上の項のindex\r\nfor i in range(1, n+1):\r\n P[i] = x\r\n if A[i] > 1:\r\n x = i\r\nINF = 2*10**18+1\r\nans = 0\r\nfor i in range(1, n+1):\r\n p = 1\r\n j = i\r\n while j:\r\n if p*A[j] < INF:\r\n s = C[i]-C[j-1]\r\n p *= A[j]\r\n if p%k == 0:\r\n d = p//k-s\r\n # j-P[j]-1: P[j]とjの間にある1の個数\r\n if 0 <= d <= j-P[j]-1:\r\n ans += 1\r\n else:\r\n break\r\n j = P[j]\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\nflag = [0 for i in range(0, n)]\r\na = list(map(int, input().split()))\r\nr = [-1 for i in range(0, n)]\r\ni = 0\r\nwhile i < n:\r\n if a[i] != 1:\r\n i = i + 1\r\n continue\r\n j = i\r\n while j < n and a[j] == 1:\r\n j = j + 1\r\n while i < j:\r\n r[i] = j - 1\r\n i = i + 1\r\nans = 0\r\nmaxn = 2 ** 63 - 1\r\nfor i in range(0, n):\r\n p = 1\r\n s = 0\r\n j = i\r\n while j < n:\r\n if a[j] != 1:\r\n p = p * a[j]\r\n s = s + a[j]\r\n if p % s == 0 and p // s == k:\r\n ans = ans + 1\r\n #print(1)\r\n #print('p =', p, 's =', s)\r\n #print('i =', i, 'j =', j)\r\n j = j + 1\r\n else:\r\n if p % k == 0 and (p // k - s > 0 and (p // k - s) <= (r[j] - j + 1)):\r\n ans = ans + 1\r\n #print(2)\r\n #print('p =', p, 's =', s)\r\n #print('i =', i, 'j =', j)\r\n s = s + r[j] - j + 1\r\n j = r[j] + 1\r\n if p >= maxn:\r\n break\r\nprint(ans)\r\n", "n,k = map(int,input().split())\nA = list(map(int,input().split()))\nA = [0]+A;\nx = 0\nprev = [0 for i in range(n+1)]\nsm = [0 for i in range(n+1)]\nfor i in range(1,n+1):\n\tprev[i] = x\n\tif A[i]>1:\n\t\tx = i\n\tsm[i] = A[i]+sm[i-1]\nlim = int(2*(10**18))\nans = 0\nfor i in range(1,n+1):\n\tp = 1\n\tj = i\n\twhile j:\n\t\tif lim//A[j]>p:\n\t\t\ts = sm[i]-sm[j-1]\n\t\t\tp *= A[j]\n\t\t\tif p%k == 0 and p//k>=s and j-1-prev[j]>=p/k-s:\n\t\t\t\tans += 1\n\t\telse:\n\t\t\tbreak\n\t\tj = prev[j]\nprint(ans)", "n,k=map(int, input().split())\r\nv=list(map(int, input().split()))\r\npos, pref=[-1], []\r\nans=0\r\nfor i in range(n):\r\n\tif v[i]!=1:\r\n\t\tpos.append(i)\r\n\tif v[i]==1 and k==1:\r\n\t\tans+=1\r\n\tif i:\r\n\t\tpref.append(pref[-1]+v[i])\r\n\telse:\r\n\t\tpref.append(v[i])\r\npos.append(n)\r\nm=len(pos)\r\n\r\n#print(\"m\",m)\r\ninf=int(2e18+10)\r\nfor i in range(1,m-1):\r\n\tp=1\r\n\tfor j in range(i, m-1):\r\n\t\tp=p*v[pos[j]]\r\n\t\tif p>inf:\r\n\t\t\tbreak\r\n\t\ts = pref[pos[j]];\r\n\t\tif pos[i]:\r\n\t\t\ts-=pref[pos[i]-1]\r\n\t\tif s*k==p:\r\n\t\t\tans+=1\r\n\t\td=p-s*k\r\n\t\tif d>0 and d%k==0:\r\n\t\t\tw= d//k\r\n\t\t\tf=min(pos[i]-pos[i-1]-1,w)\r\n\t\t\tb=min(pos[j+1]-pos[j]-1, w)\r\n\t\t\tif f+b<w:\r\n\t\t\t\tcontinue\r\n\t\t\tans+=f+b-w+1\r\n\t\t#print(v[pos[i]], v[pos[j]])\r\nprint(ans)", "def solve():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n go = [0] * n\r\n go[n - 1] = n\r\n for i in range(n - 2, -1, -1):\r\n if a[i + 1] != 1:\r\n go[i] = i + 1\r\n else:\r\n go[i] = go[i + 1]\r\n ans = 0\r\n for l in range(n):\r\n r = l\r\n ans += (k == 1)\r\n f = a[l]\r\n s = a[l]\r\n while go[r] != n and a[go[r]] <= (10**18 // f):\r\n f *= a[go[r]]\r\n s += go[r] - r - 1 + a[go[r]]\r\n r = go[r]\r\n want = -1\r\n if f % k == 0:\r\n want = f // k\r\n have = go[r] - r - 1\r\n ans += (s <= want and want <= s + have)\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n solve()# 1690653877.846714" ]

[ "import itertools\n\n\ndef count_inversions(enumerate_seq):\n tmp = list(enumerate_seq[:])\n result = 0\n for i in range(len(tmp)):\n for j in range(len(tmp) - 1):\n if tmp[j][0] > tmp[j + 1][0]:\n result += 1\n tmp[j], tmp[j + 1] = tmp[j + 1], tmp[j]\n return result\n\n\ndef sub_seq(a, b):\n i, j = 0, 0\n while i < len(a) and j < len(b):\n if a[i] == b[j]:\n i += 1\n j += 1\n return i == len(a)\n\n\nn = int(input())\nA = input().split()\n\nB = []\n\nm = int(input())\nfor _ in range(m):\n B += [input().split()[1:]]\n\n brand_new = True\n best_perms = 0\nbest_seq = []\nbest_ind = -1\n\nfor i, b in enumerate(B):\n for tmp in itertools.permutations(enumerate(A)):\n if sub_seq([x for y, x in tmp], b):\n brand_new = False\n inversions = count_inversions(tmp)\n similarity = n * (n - 1) // 2 - inversions + 1\n if best_perms < similarity:\n best_perms = similarity\n best_seq = [x for y, x in tmp]\n best_ind = i\n\nif not brand_new:\n print(best_ind + 1)\n print('[:' + '|' * best_perms + ':]')\nelse:\n print(\"Brand new problem!\")\n" ]

[ "n = int(input())\r\nu = []\r\nv = []\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n u.append(a)\r\n v.append(b)\r\n \r\nc = [0] + [int(x) for x in input().split()]\r\n \r\ne = 0\r\ndic = {}\r\n \r\nfor i in range(1, n+1):\r\n dic[i] = 0\r\n \r\ndef plus(dic, n):\r\n if n in dic:\r\n dic[n] += 1\r\n else:\r\n dic[n] = 1\r\n \r\nfor i in range(n-1):\r\n if c[u[i]] != c[v[i]]:\r\n e += 1\r\n dic[u[i]] += 1\r\n dic[v[i]] += 1\r\n \r\nfor i in range(1, n+1):\r\n if dic[i] == e:\r\n print ('YES', i,sep='\\n')\r\n exit(0)\r\n \r\nprint (\"NO\")\r\n", "n = int(input())\ng = [[] for _ in range(n)]\nfor _ in range(n-1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n g[u].append(v)\n g[v].append(u)\nc = list(map(int, input().split()))\ndif = [0 for _ in range(n)]\ncnt = 0\nfor v in range(n):\n dif[v] = 0\n for u in g[v]:\n if c[u] != c[v]:\n dif[v] += 1\n cnt += dif[v] > 0\nans = -1\nfor v in range(n):\n if dif[v] + 1 >= cnt:\n ans = v+1\nif ans >= 0:\n print('YES\\n%d' % ans)\nelse:\n print('NO')", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\ntest, = Neo()\r\nn = test\r\nedges = []\r\nfor _ in range(n - 1):\r\n u, v = Neo()\r\n u -= 1\r\n v -= 1\r\n edges.append((u, v))\r\n\r\ncolors = Neo()\r\nsuspect = [(u, v) for (u, v) in edges if colors[u] != colors[v]]\r\n\r\nif len(suspect) == 0:\r\n print(\"YES\")\r\n print(1)\r\nelse:\r\n cands = set(suspect[0])\r\n for u, v in suspect:\r\n cands &= set([u, v])\r\n # print(cands)\r\n if len(cands) == 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n e = list(cands)[0]\r\n print(e + 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n - 1):\r\n l.append(list(map(int, input().split())))\r\nc = [0] + list(map(int, input().split())) \r\ncnt = [0] * (n + 1) \r\nfor i in l:\r\n if(c[i[0]] != c[i[1]]):\r\n cnt[i[0]] += 1 \r\n cnt[i[1]] += 1 \r\ns = sum(cnt) // 2 \r\nfor i in range(1, n + 1):\r\n if(cnt[i] == s):\r\n print(\"YES\")\r\n print(i)\r\n break \r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nu,v = [], []\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n u.append(a)\r\n v.append(b)\r\n \r\ncolors = [0] + [int(x) for x in input().split()]\r\n \r\nmaximumDifference = 0\r\ndifferences = {i:0 for i in range(1, n+1)}\r\n\r\nfor i in range(n-1):\r\n vertex1 = u[i]\r\n vertex2 = v[i]\r\n \r\n if colors[vertex1] != colors[vertex2]:\r\n maximumDifference += 1\r\n differences[vertex1] += 1\r\n differences[vertex2] += 1\r\n\r\nif maximumDifference in differences.values():\r\n print ('YES')\r\n print(list(differences.values()).index(maximumDifference)+1)\r\nelse:\r\n print (\"NO\")\r\n", "import sys\r\n\r\n\r\n\r\ndef answer(n, u, v, colors):\r\n suspect = []\r\n for i in range(n-1):\r\n if colors[u[i]-1] != colors[v[i]-1]:\r\n suspect.append([u[i], v[i]])\r\n if len(suspect) == 0:\r\n print('YES')\r\n print('1')\r\n return\r\n s = set(suspect[0])\r\n for tup in suspect:\r\n s &= set(tup)\r\n \r\n if len(s) == 0:\r\n print('NO')\r\n return \r\n else:\r\n print('YES')\r\n print(s.pop())\r\n return #null. Print 1 or 2 lines.\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n u = [0 for _ in range(n)]\r\n v = [0 for _ in range(n)]\r\n for i in range(n-1):\r\n u[i], v[i] = map(int, sys.stdin.readline().split())\r\n colors = list(map(int, sys.stdin.readline().split()))\r\n answer(n, u, v, colors)\r\n return\r\nmain()", "n = int(input())\r\nedges = []\r\nfor _ in range(n-1):\r\n u,v = map(int,input().split())\r\n edges.append([u,v])\r\nct = [0]+list(map(int,input().split()))\r\nds = [-1]+[0]*n\r\nvs = 0\r\nfor u,v in edges:\r\n if ct[u]!=ct[v]:\r\n ds[u]+=1\r\n ds[v]+=1\r\n vs+=1\r\nif vs == max(ds):\r\n print(\"YES\")\r\n print(ds.index(vs))\r\nelse:\r\n print(\"NO\")", "# cook your dish here\\\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\nn=int(input())\r\ng=defaultdict(list)\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\nc=list(map(int,input().split()))\r\nx=len(set(c))\r\nd=defaultdict(set)\r\nfor i in g:\r\n d[i].add(c[i-1])\r\n for j in g[i]:\r\n d[i].add(c[j-1])\r\nr=-1\r\ndeg=-1\r\nfor i in d:\r\n if len(d[i])==x and len(g[i])>deg:\r\n r=i\r\n deg=len(g[i])\r\nif r==-1:\r\n print('NO')\r\nelse:\r\n f=0\r\n visited=[0]*(n+1)\r\n visited[r]=1\r\n for i in g[r]:\r\n co=c[i-1]\r\n q=deque()\r\n visited[i]=1\r\n q.append(i)\r\n while q:\r\n y=q.popleft()\r\n if co!=c[y-1]:\r\n f=1\r\n break\r\n for k in g[y]:\r\n if visited[k]==0:\r\n visited[k]=1\r\n q.append(k)\r\n if f:\r\n break\r\n if f:\r\n print('NO')\r\n else:\r\n print('YES')\r\n print(r)", "n = int(input())\r\ne = [list(map(int, input().split())) for i in range(n - 1)]\r\nc = list(map(int, input().split()))\r\nec, v = [0] * n, 0\r\nfor ea, eb in e:\r\n if c[ea - 1] != c[eb - 1]:\r\n ec[ea - 1] += 1\r\n ec[eb - 1] += 1\r\n v += 1\r\nif v == max(ec):\r\n print('YES', ec.index(v) + 1, sep='\\n')\r\nelse:\r\n print('NO')", "\r\nn=int(input())\r\nedges=[list(map(int,input().split())) for i in range(n-1)]\r\ncolor=list(map(int,input().split()))\r\n\r\ncheck=[0]*n\r\ntot=0\r\n\r\nfor u,v in edges:\r\n\r\n if(color[u-1]!=color[v-1]):\r\n check[u-1]+=1\r\n check[v-1]+=1\r\n tot+=1\r\n\r\n\r\nif(tot==max(check)):\r\n print(\"YES\")\r\n print(check.index(tot)+1)\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import sys,io,os\r\nfrom os import path\r\nfrom collections import Counter,defaultdict\r\nif(path.exists('input.txt')):\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\nelse:\r\n input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\ndef dfs(graph,color,visited,i,key):\r\n stack=[i]\r\n while(stack):\r\n v=stack.pop()\r\n # print(v)\r\n if(visited[v]):\r\n continue\r\n visited[v]=True\r\n for j in graph[v]: \r\n if visited[j]==True:\r\n continue\r\n if color[j]!=color[i]:\r\n # print(color[j],color[i])\r\n # print(v+1,j+1,i+1)\r\n return j,v\r\n stack.append(j)\r\n return -1,-1\r\n\r\ndef main():\r\n n=int(input())\r\n graph=[[] for i in range(n)]\r\n for i in range(n-1):\r\n a,b=list(map(int,input().split()))\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n color=list(map(int,input().split()))\r\n visited=[False]*n\r\n # motor=[[] for i in range(n)]\r\n for j in graph[0]:\r\n visited[0]=True\r\n p=dfs(graph,color,visited,j,1)\r\n if p!=(-1,-1):\r\n # p=j\r\n m,e=p\r\n if color[0]!=color[j]:\r\n new=j\r\n else:\r\n new=m\r\n # print(new+1)\r\n # print(p+1)\r\n # print(new)\r\n visited=[False]*n\r\n visited[new]=True\r\n for i in graph[new]:\r\n k=dfs(graph,color,visited,i,0)\r\n if k!=(-1,-1):\r\n visited=[False]*n\r\n new=j\r\n visited[new]=True\r\n # print(j,\"JAA\")\r\n for ii in graph[new]:\r\n k=dfs(graph,color,visited,ii,0)\r\n if k!=(-1,-1):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n print(new+1)\r\n return\r\n print(\"YES\")\r\n print(new+1)\r\n return\r\n print(\"YES\")\r\n print(1) \r\n \r\n\r\n\r\n\r\nfor _ in range(1):\r\n main()\r\n", "n = int(input())\r\nedges = list(list(map(int, input().split())) for _ in range(n-1)) \r\ncolors = list(map(int, input().split()))\r\n\r\nedge_cnt = 0\r\npnt_cnt = {0: 0}\r\nfor a, b in edges:\r\n a -= 1 ; b -= 1\r\n if colors[a] != colors[b]:\r\n edge_cnt += 1\r\n pnt_cnt[a] = pnt_cnt.get(a, 0)+1\r\n pnt_cnt[b] = pnt_cnt.get(b, 0)+1\r\n\r\nfor k, v in pnt_cnt.items():\r\n if v == edge_cnt:\r\n print(\"YES\")\r\n print(k+1)\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nn=int(input())\r\ng=defaultdict(list)\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\ncolor=list(map(int,input().strip().split()))\r\ndiff=[0]*(n+1)\r\ns=set()\r\nfor x in range(1,n+1):\r\n for y in g[x]:\r\n if (x,y) not in s and (y,x) not in s:\r\n s.add((x,y))\r\n if color[x-1]!=color[y-1]:\r\n diff[x]+=1\r\n diff[y]+=1\r\nmx=max(diff)\r\nroot=1\r\nfor i in range(1,n+1):\r\n if diff[i]==mx:\r\n root=i\r\n break\r\ndef helper(root):\r\n parent,st=[i for i in range(n+1)],[]\r\n visited=set()\r\n visited.add(root)\r\n for nbr in g[root]:\r\n st.append(nbr)\r\n visited.add(nbr)\r\n \r\n while len(st)>0:\r\n node=st.pop()\r\n if color[parent[node]-1]!=color[node-1]:return False\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 parent[nbr]=node\r\n return True\r\nres=helper(root)\r\nif res:\r\n print(\"YES\")\r\n print(root)\r\nelse:print(\"NO\")", "n= int(input())\r\ng = [[] for _ in range(n)]\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 g[u].append(v)\r\n g[v].append(u)\r\nc = list(map(int, input().split()))\r\ndif = [0 for i in range(n)]\r\ncnt = 0\r\nfor v in range(n):\r\n dif[v] = 0\r\n for u in g[v]:\r\n if c[u] != c[v]:\r\n dif[v] += 1\r\n cnt += dif[v] > 0\r\nans = -1\r\nfor v in range(n):\r\n if dif[v] + 1 >= cnt:\r\n ans = v+1\r\nif ans >= 0:\r\n print('YES\\n%d' % ans)\r\nelse:\r\n print('NO')", "def main():\n n = int(input())\n edges = []\n for _ in range(n - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n edges.append((u, v))\n\n colors = list(map(int, input().split()))\n suspect = [(u, v) for (u, v) in edges if colors[u] != colors[v]]\n\n if len(suspect) == 0:\n print(\"YES\")\n print(1)\n else:\n cands = set(suspect[0])\n for u, v in suspect:\n cands &= set([u, v])\n\n if len(cands) == 0:\n print(\"NO\")\n else:\n print(\"YES\")\n e = list(cands)[0]\n print(e + 1)\n\nmain()\n", "from math import sqrt,gcd,ceil,floor,log,factorial\r\nfrom itertools import permutations,combinations\r\nfrom collections import Counter, defaultdict\r\nimport collections,sys,threading\r\nimport collections,sys,threading\r\nsys.setrecursionlimit(10**9)\r\nthreading.stack_size(10**8)\r\n\r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\ndef solve():\r\n def dfs(node,g,visited,res):\r\n visited[node]=1\r\n if res==[]:\r\n res.append(c[node])\r\n \r\n for i in g[node]:\r\n if visited[i]==0:\r\n dfs(i,g,visited,res)\r\n \r\n else:\r\n if c[node]!=res[-1]:\r\n res.append(-1)\r\n return\r\n \r\n else:\r\n res.append(c[node])\r\n \r\n for i in g[node]:\r\n if visited[i]==0:\r\n dfs(i,g,visited,res)\r\n \r\n \r\n n=ii()\r\n g=[]\r\n for _ in range(n-1):\r\n u,v=mi()\r\n g.append([u,v])\r\n \r\n c=[0]+li()\r\n flag=0\r\n res=[]\r\n #ans=set()\r\n for edge in g:\r\n if c[edge[0]]!=c[edge[1]]:\r\n #if res==[]:\r\n res.append([edge[0],edge[1]])\r\n \r\n if len(res)==0:\r\n print('YES')\r\n print(1)\r\n \r\n else:\r\n ans = res[0]\r\n \r\n for i in range(1,len(res)):\r\n ans = list(set(ans).intersection(set(res[i])))\r\n \r\n if len(ans)==0:\r\n print('NO')\r\n \r\n else:\r\n print('YES')\r\n print(ans[0])\r\n \r\n \r\n \r\n\r\nthreading.Thread(target=solve).start()", "def solve():\r\n n = int(input())\r\n edge = [[0, 0] for i in range(n)]\r\n for i in range(n - 1): edge[i] = list(map(int, input().split()))\r\n color = [0] + list(map(int, input().split()))\r\n cnt = 0\r\n diff = [0 for i in range(n + 1)]\r\n for i in range(n - 1):\r\n if color[edge[i][0]] != color[edge[i][1]]:\r\n cnt += 1\r\n diff[edge[i][0]] += 1\r\n diff[edge[i][1]] += 1\r\n for i in range(1, n + 1):\r\n if diff[i] == cnt:\r\n print('{0}\\n{1}'.format(\"YES\", i))\r\n return\r\n print('NO')\r\nsolve();\r\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\ndef solve():\r\n\tn = mint()\r\n\te = [ [] for i in range(n+1)]\r\n\tfor i in range(n-1):\r\n\t\tu,v = mints()\r\n\t\te[u].append(v)\r\n\t\te[v].append(u)\r\n\tc = list(mints())\r\n\tstart = None\r\n\tfor i in range(1, n+1):\r\n\t\tci = c[i-1]\r\n\t\tfor j in e[i]:\r\n\t\t\tif c[j-1] != ci:\r\n\t\t\t\tstart = (i, j)\r\n\t\t\t\tbreak\r\n\t\tif start != None:\r\n\t\t\tbreak\r\n\tif start == None:\r\n\t\tprint(\"YES\")\r\n\t\tprint(1)\r\n\t\treturn\r\n\tfor s in start:\r\n\t\twas = [False]*(n+1)\r\n\t\tql = 0\r\n\t\tq = []\r\n\t\twas[s] = True\r\n\t\tfor i in e[s]:\r\n\t\t\twas[i] = True\r\n\t\t\tq.append((i, c[i-1]))\r\n\t\tok = True\r\n\t\twhile ql < len(q):\r\n\t\t\tv, cc = q[ql]\r\n\t\t\tql += 1\r\n\t\t\tfor i in e[v]:\r\n\t\t\t\tif was[i]:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\twas[i] = True\r\n\t\t\t\tif c[i-1] != cc:\r\n\t\t\t\t\tok = False\r\n\t\t\t\tq.append((i, cc))\r\n\t\tif ok:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tprint(s)\r\n\t\t\treturn\r\n\tprint(\"NO\")\r\n\r\nsolve()\r\n", "n = int(input())\ne = []\nc = [-1]\ndiff = []\nfor i in range(n-1):\n e.append(list(map(int, input().split(' '))))\n\nfor i in map(int, input().split(' ')):\n c.append(i)\n\nfor i in range(n-1):\n if c[e[i][0]] != c[e[i][1]]:\n diff.append(e[i])\n\nif not diff: # All same color, print any\n print(\"YES\")\n print(e[0][0])\nelse:\n s = set(diff[0])\n for d in diff:\n s.intersection_update(d)\n if s:\n print(\"YES\")\n print(list(s)[0])\n else:\n print(\"NO\")\n", "import math,sys,bisect,heapq,os\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\nfrom functools import lru_cache\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ndef input(): return sys.stdin.readline().rstrip('\\r\\n')\r\n#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\naj = lambda: list(map(int, input().split()))\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\ndef solve():\r\n\t\tG = defaultdict(list)\r\n\t\r\n\t\tdef addEdge(a,b):\r\n\t\t\tG[a].append(b)\r\n\t\t\tG[b].append(a)\r\n\t\r\n\t\tdef dfs(node,p):\r\n\t\t\td = deque()\r\n\t\t\td.append(node)\r\n\t\t\tvis[node] = True\r\n\t\t\twhile d:\r\n\t\t\t\tx = d.pop()\r\n\t\t\t\tfor i in G.get(x,[]):\r\n\t\t\t\t\tif not vis[i] and i != p:\r\n\t\t\t\t\t\tvis[i] = True\r\n\t\t\t\t\t\td.append(i)\r\n\t\t\t\t\t\tif C[node-1] != C[i-1]:\r\n\t\t\t\t\t\t\treturn False\r\n\t\t\treturn True\r\n\t\r\n\t\tn, =aj()\r\n\t\tm = n-1\r\n\t\tvis = [False]*(n+1)\r\n\t\tedges = set()\r\n\t\tfor i in range(m):\r\n\t\t u,v = aj()\r\n\t\t addEdge(u,v)\r\n\t\t edges.add((u,v))\r\n\t\tC = aj()\r\n\t\tif len(set(C)) == 1:\r\n\t\t\tY(1)\r\n\t\t\tprint(1)\r\n\t\t\texit(0)\r\n\t\tu=v = None\r\n\t\tfor i,j in edges:\r\n\t\t\tif C[i-1] != C[j-1]:\r\n\t\t\t\tu = i\r\n\t\t\t\tv = j\r\n\t\t\t\tbreak\r\n\t\tvis = [False]*(n+1)\r\n\t\tif all([dfs(i,u) for i in G.get(u,[])]):\r\n\t\t\tY(1)\r\n\t\t\tprint(u)\r\n\t\t\texit(0)\r\n\t\tvis = [False]*(n+1)\r\n\t\tif all([dfs(i,v) for i in G.get(v,[])]):\r\n\t\t\tY(1)\r\n\t\t\tprint(v)\r\n\t\t\texit(0)\r\n\t\tY(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\ntry:\r\n\t#os.system(\"online_judge.py\")\r\n\tsys.stdin = open('input.txt', 'r') \r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\n\r\nsolve()", "\r\nimport sys\r\n\r\nn = int(sys.stdin.readline())\r\n\r\n\r\nedges = [[int(x) for x in sys.stdin.readline().split()] for _ in range(n - 1)]\r\ncolors = sys.stdin.readline().split()\r\n\r\nres = None\r\nfor edge in edges:\r\n if colors[edge[0]-1] != colors[edge[1]-1]:\r\n if res is None:\r\n res = list(edge)\r\n else:\r\n res = [x for x in res if x in edge]\r\n if len(res) == 0:\r\n break\r\n\r\nif res is None:\r\n print('YES\\n1')\r\nelse:\r\n print('NO' if len(res) == 0 else 'YES\\n' + str(res[0]))", "import collections\nimport sys\n\n\ndef read_ints():\n return [int(x) for x in sys.stdin.readline().strip().split()]\n\n\ndef main():\n N = read_ints()[0]\n edges = []\n vx_to_neighbor_colors = collections.defaultdict(set) \n for _ in range(N - 1):\n u, v = read_ints()\n u -= 1\n v -= 1\n edges.append((u, v))\n colors = read_ints()\n\n vx_to_cnt = collections.Counter()\n e_cnt = 0\n for e in edges:\n if colors[e[0]] == colors[e[1]]:\n continue\n vx_to_cnt[e[0]] += 1\n vx_to_cnt[e[1]] += 1\n e_cnt += 1\n\n if e_cnt == 0:\n return 1 # any\n if e_cnt == 1:\n return 1 + list(vx_to_cnt.keys())[0]\n\n root = None\n for vx, cnt in vx_to_cnt.items():\n if cnt == e_cnt:\n if root is not None:\n return None\n root = 1 + vx\n elif cnt != 1:\n return None\n return root\n\n\nif __name__ == '__main__':\n root = main()\n if root is not None:\n print(f'YES\\n{root}')\n else:\n print('NO')\n", "n = int(input())\r\narr = []\r\nbrr = []\r\nfor i in range(n-1):\r\n u,v = list(map(int,input().split()))\r\n arr.append(u)\r\n brr.append(v)\r\ncolor = list(map(int,input().split()))\r\n\r\nans = []\r\nfor i in range(n-1):\r\n if color[arr[i]-1]!=color[brr[i]-1]:\r\n if ans==[]:\r\n ans+=[arr[i],brr[i]]\r\n else:\r\n if arr[i] in ans and brr[i] in ans:\r\n print(\"NO\")\r\n exit()\r\n elif arr[i] in ans:\r\n ans = [arr[i]]\r\n elif brr[i] in ans:\r\n ans = [brr[i]]\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nif len(ans)==0:\r\n ans.append(1)\r\nprint(ans[0])", "n = int(input())\r\nes = []\r\nrs = []\r\nfor i in range(n-1) :\r\n es.append(list(map(int , input().split())))\r\nvs = list(map(int , input().split()))\r\nfor i in es :\r\n if vs[i[0] -1 ] != vs[i[1] - 1 ] :\r\n rs.append(i)\r\nif rs == [] :\r\n print('YES')\r\n print(1)\r\n exit(0)\r\nfor r1 in rs[0] :\r\n for i in rs :\r\n if r1 != i[0] and r1 != i[1] :\r\n break\r\n else :\r\n print('YES')\r\n print(r1)\r\n exit(0)\r\nprint('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [[] for i in range(n)]\r\nfor _ in range(n-1):\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\nw = list(map(int, input().split()))\r\nq = [(0, 0, -1)]\r\nx = 0\r\nwhile q:\r\n a, b, c = q.pop()\r\n if a == 0:\r\n q.append((1, b, c))\r\n for i in d[b]:\r\n if i != c:\r\n q.append((0, i, b))\r\n else:\r\n if w[b] != w[c]:\r\n x = c\r\n break\r\nif x == -1:\r\n x = 0\r\nfor i in d[x]:\r\n s = set()\r\n q = [(i, x)]\r\n while q:\r\n a, b = q.pop()\r\n s.add(w[a])\r\n for j in d[a]:\r\n if j != b:\r\n q.append((j, a))\r\n if len(s) > 1:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n print(x+1)", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n-1):\r\n\tx,y=map(int,input().split())\r\n\ta.append(x)\r\n\tb.append(y)\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n-1):\r\n\tif l[a[i]-1]!=l[b[i]-1]:\r\n\t\tif len(ans)==0:\r\n\t\t\tans=[a[i],b[i]]\r\n\t\telse:\r\n\t\t\tif a[i] in ans and b[i] in ans:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\texit()\r\n\t\t\telif a[i] in ans:\r\n\t\t\t\tans=[a[i]]\r\n\t\t\telif b[i] in ans:\r\n\t\t\t\tans=[b[i]]\r\n\t\t\telse:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\texit()\r\nprint(\"YES\")\r\nif ans:\r\n\tprint(ans[0])\r\nelse:\r\n\tprint(1)", "n=int(input())\r\nedges=[list(map(int,input().split())) for i in range(n-1)]\r\nc=list(map(int,input().split()))\r\nu=[0]*n\r\nv=0\r\nfor a,b in edges:\r\n if c[a-1]!=c[b-1]:\r\n u[a-1]+=1\r\n u[b-1]+=1\r\n v+=1\r\nif v==max(u):\r\n print(\"YES\",u.index(v)+1,sep=\"\\n\")\r\nelse:\r\n print(\"NO\")", "from collections import defaultdict\r\nfrom functools import lru_cache\r\nimport sys, threading\r\n\r\ndef main():\r\n n = int(input())\r\n graph = defaultdict(list)\r\n for _ 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\n c = list(map(int, input().split()))\r\n\r\n @lru_cache(None)\r\n def dp(cur, par):\r\n for ncur in graph[cur]:\r\n if ncur == par: continue\r\n if c[cur-1] != c[ncur-1] or not dp(ncur, cur):\r\n return False\r\n return True\r\n\r\n for root in range(1, n+1):\r\n curr = True\r\n for v in graph[root]:\r\n if not dp(v, root):\r\n curr = False\r\n break\r\n if curr:\r\n print(\"YES\")\r\n print(root)\r\n break\r\n else:\r\n print(\"NO\")\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()", "#!/usr/bin/env python3\n\ndef ri():\n return map(int, input().split())\n\nn = int(input())\ne = []\nfor i in range(n-1):\n a, b = ri()\n a -= 1\n b -= 1\n e.append([a, b])\n\nc = list(ri())\n\ned = []\n\nfor ee in e:\n if c[ee[0]] != c[ee[1]]:\n ed.append(ee)\n\nif len(ed) == 0:\n print(\"YES\")\n print(1)\n exit()\ncand = ed[0]\n\nnot0 = 0\nnot1 = 0\nfor ee in ed:\n if cand[0] != ee[0] and cand[0] != ee[1]:\n not0 = 1\n break\n\nfor ee in ed:\n if cand[1] != ee[0] and cand[1] != ee[1]:\n not1 = 1\n break\n\nif not0 == 0:\n print(\"YES\")\n print(cand[0]+1)\nelif not1 == 0:\n print(\"YES\")\n print(cand[1]+1)\nelse:\n print(\"NO\")\n", "n=int(input())\n\ne=[]\n\nv=[]\n\nfor i in range(n-1):\n\n e.append(list(map(int,input().split())))\n\nc=[-1]+list(map(int,input().split()))\n\nfor i in e:\n\n if c[i[0]]!=c[i[1]]: v.append(i)\n\nif not v:\n\n print('YES')\n\n print(1)\n\nelse:\n\n s=set(v[0]);list(map(lambda x: s.intersection_update(set(x)),v))\n\n if s:\n\n print('YES')\n\n print(list(s)[0])\n\n else: print('NO')\n\n\n\n# Made By Mostafa_Khaled", "n=int(input())\nedges=[list(map(int,input().split())) for i in range(n-1)]\nc=list(map(int,input().split()))\nu=[0]*n\nv=0\nfor a,b in edges:\n if c[a-1]!=c[b-1]:\n u[a-1]+=1\n u[b-1]+=1\n v+=1\nif v==max(u):\n print(\"YES\",u.index(v)+1,sep=\"\\n\")\nelse:\n print(\"NO\")\n\t\t\t \t\t\t\t\t \t\t \t \t \t\t \t\t\t \t", "def process(e, c):\r\n different = set([])\r\n root = None\r\n for a, b in e:\r\n if c[a-1] != c[b-1]:\r\n if len(different)==0:\r\n different.add(a)\r\n different.add(b)\r\n elif len(different)==2:\r\n x, y = different\r\n if x==a or x==b:\r\n different = set([x])\r\n root = x\r\n elif y==a or y==b:\r\n different = set([y])\r\n root = y\r\n else:\r\n return ['NO', None]\r\n else:\r\n if root != a and root != b:\r\n return ['NO', None]\r\n if len(different)==2:\r\n x, y = different\r\n return ['YES', x]\r\n elif root is None:\r\n return ['YES', 1]\r\n return ['YES', root]\r\n\r\nn = int(input())\r\ne = []\r\nfor i in range(n-1):\r\n a, b = [int(x) for x in input().split()]\r\n e.append([a, b])\r\nc = [int(x) for x in input().split()]\r\na1, a2 = process(e, c)\r\nprint(a1)\r\nif a1=='YES':\r\n print(a2)\r\n \r\n\r\n", "import sys\nfrom collections import defaultdict\nfrom collections import deque\nfrom types import GeneratorType\ninput = sys.stdin.readline\n\ndef bootstrap(f, stack=[]):\n \n def wrappedfunc(*args, **kwargs):\n if stack:\n return f(*args, **kwargs)\n else:\n to = f(*args, **kwargs)\n while True:\n if type(to) is GeneratorType:\n stack.append(to)\n to = next(to)\n else:\n stack.pop()\n if not stack:\n break\n to = stack[-1].send(to)\n return to\n return wrappedfunc\n\ndef get_adj_mat(src, dst):\n matrix = defaultdict(list)\n for src_i, dst_i in zip(src, dst):\n matrix[src_i].append(dst_i)\n matrix[dst_i].append(src_i)\n return matrix\n\n\n@bootstrap\ndef set_nodes_status(node, good, seen, adj_mat, vals):\n all_values_same, all_childs_good = True, True\n\n for child in adj_mat[node]:\n if not seen[child]:\n seen[child] = True\n all_values_same = all_values_same and vals[child] == vals[node]\n yield set_nodes_status(child, good, seen, adj_mat, vals)\n all_childs_good = all_childs_good and good[child]\n good[node] = all_values_same and all_childs_good\n yield None\n\ndef find_bad_child(node, good, adj_mat, vals):\n bad_childs = []\n not_same_good_childs = []\n num_childs = 0\n for child in adj_mat[node]:\n num_childs += 1\n if good[child]:\n if not vals[node] == vals[child]:\n not_same_good_childs.append(child)\n else:\n bad_childs.append(child)\n good[node] = True\n \n if len(bad_childs) > 1:\n return -1\n elif len(bad_childs) == 1:\n if len(not_same_good_childs) > 0:\n return -1\n else:\n return bad_childs[0]\n else:\n return node\n\n\ndef walk(node, good, adj_mat, vals):\n \n while True:\n cand = find_bad_child(node, good, adj_mat, vals)\n if cand == -1:\n print(\"NO\")\n return\n elif cand == node:\n print(\"YES\")\n print(cand+1)\n return\n else:\n node = cand\n\n \n\ndef solve(src ,dst, vals):\n n = len(vals)\n adj_mat = get_adj_mat(src, dst)\n seen = [False] * n\n good = [False] * n\n root = 1\n seen[root] = True\n set_nodes_status(root, good, seen, adj_mat, vals)\n walk(root, good, adj_mat, vals)\n\n \nif __name__ == \"__main__\":\n n = int(input())\n src, dst = [], []\n for _ in range(n-1):\n src_i, dst_i = [int(val) for val in input().split()]\n src.append(src_i-1), dst.append(dst_i-1)\n vals = [int(val) for val in input().split()]\n solve(src, dst, vals)\n\n", "from __future__ import print_function\nimport sys\nfrom collections import *\nfrom heapq import *\nfrom functools import *\nimport re\nfrom itertools import *\n\nINF=float(\"inf\")\nNINF=float(\"-inf\")\n\ntry:\n input=raw_input\nexcept:\n pass\n\ndef read_string():\n return input()\n\ndef read_string_line():\n return [x for x in input().split(\" \")]\n\ndef read_int_line():\n return [int(x) for x in input().split(\" \")]\n\ndef read_int():\n return int(input())\nn=read_int()\nadjs=[[] for _ in range(n)]\nUC=-1\nMC=-2\nfor _ in range(n-1):\n a,b=read_int_line()\n adjs[a-1].append(b-1)\n adjs[b-1].append(a-1)\ncolors=read_int_line()\ned={}\ndef dfs(frm, to):\n #print(\"dfs(%d,%d)\"%(frm,to))\n if (frm, to) in ed:\n return ed[frm,to]\n ct=colors[to]\n for nto in adjs[to]:\n if nto==frm:continue\n c=dfs(to,nto)\n if ct != c:\n ed[frm,to]=MC\n return MC\n ed[frm,to]=ct\n return ct\n\n\nfor frm in range(n):\n for to in adjs[frm]:\n dfs(frm,to)\n dfs(to,frm)\nfor i in range(n):\n for to in adjs[i]:\n if ed[i,to]==MC:\n break\n else:\n print(\"YES\")\n print(\"%d\"%(i+1))\n break\nelse:\n print(\"NO\")\n", "import sys\r\nfrom types import GeneratorType\r\n#sys.setrecursionlimit(10**6)\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n@bootstrap\r\ndef dfs(v,c,d,k,p):\r\n if o[v-1] != c:\r\n k[0] = 0\r\n\r\n for i in d[v]:\r\n if i != p:\r\n yield dfs(i, c, d, k, v)\r\n\r\n yield\r\n\r\nn = int(input())\r\nl = []\r\nd = {}\r\nfor _ in range(n-1):\r\n u,v = map(int,input().split())\r\n if u in d:\r\n d[u].append(v)\r\n\r\n else:\r\n d[u] = [v]\r\n\r\n if v in d:\r\n d[v].append(u)\r\n\r\n else:\r\n d[v] = [u]\r\n\r\n l.append((u,v))\r\n\r\no = list(map(int,input().split()))\r\nf = 0\r\nfor i in l:\r\n e1 = i[0]\r\n e2 = i[1]\r\n if o[e1-1] != o[e2-1]:\r\n k1 = [1]\r\n for z in d[e1]:\r\n dfs(z, o[z - 1], d, k1, e1)\r\n\r\n if k1[0] == 1:\r\n print(\"YES\")\r\n print(e1)\r\n exit()\r\n\r\n k2 = [1]\r\n for z in d[e2]:\r\n dfs(z, o[z - 1], d, k2, e2)\r\n\r\n if k2[0] == 1:\r\n print(\"YES\")\r\n print(e2)\r\n exit()\r\n\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\nprint(1)", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nes = [list(R()) for i in range(n - 1)]\r\nns = [0] + list(R())\r\ncnt = [0] * (n + 1)\r\necnt = 0\r\nfor e in es:\r\n if ns[e[0]] != ns[e[1]]:\r\n cnt[e[0]] += 1\r\n cnt[e[1]] += 1\r\n ecnt += 1\r\nncnt = sum(1 if x else 0 for x in cnt)\r\nmaxnode = max((x, i) for i, x in enumerate(cnt))[-1]\r\nif not ecnt or ecnt == ncnt - 1 == max(cnt):\r\n print('YES')\r\n print(maxnode)\r\nelse:\r\n print('NO')", "import sys\r\n\r\nsys.setrecursionlimit(10**5 * 2)\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 same_col(vx, u, adj, col):\r\n res = True\r\n for child in adj[vx]:\r\n if child == u:\r\n continue\r\n if col[child] != col[vx]:\r\n return False\r\n else:\r\n res = res and same_col(child, vx, adj, col)\r\n\r\n return res\r\n\r\ndef solve():\r\n n = int(input())\r\n adj = [[] for i in range(n)]\r\n edges = [] * n\r\n\r\n for i in range(n - 1):\r\n u, v = map(int, sys.stdin.readline().split())\r\n u, v = u - 1, v - 1\r\n edges.append([u, v])\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\n col = [int(i) for i in input().split()]\r\n\r\n # debug(edges, locals())\r\n # debug(adj, locals())\r\n\r\n for u, v in edges:\r\n if col[u] != col[v]:\r\n break\r\n\r\n for vx in adj[u]:\r\n if not same_col(vx, u, adj, col):\r\n break\r\n else:\r\n print('YES')\r\n print(u + 1)\r\n return None\r\n\r\n for vx in adj[v]:\r\n if not same_col(vx, v, adj, col):\r\n break\r\n else:\r\n print('YES')\r\n print(v + 1)\r\n return None\r\n\r\n print('NO')\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "# Code by B3D\r\n# Love\r\n\r\nfrom math import *\r\nfrom collections import *\r\nimport io, os\r\nimport sys\r\n\r\n\r\n# from temps import *\r\n \r\nMOD = 998244353\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef subinp():\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n\r\ndef subinp_1():\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"op2.txt\", \"w\")\r\n\r\n\"\"\"\r\npow2 = [1]\r\n# print(log2(10 ** 9))\r\nfor i in range(29):\r\n pow2.append(pow2[-1] * 2)\r\n\"\"\"\r\n# input = sys.stdin.readline\r\n \r\n\r\nclass Point:\r\n def __init__(self, x, l1):\r\n self.x = x\r\n self.l1 = l1\r\n\r\n def __lt__(self, b):\r\n return self.l1[self.x] < self.l1[b.x]\r\n\r\n def getval(self):\r\n return self.x\r\n\r\n\r\ninp = lambda: int(input())\r\nstrin = lambda: input().strip()\r\nstrl = lambda: list(input().rstrip(\"\\r\\n\"))\r\nstrlst = lambda: list(map(str, input().split()))\r\nmult = lambda: map(int,input().strip().split())\r\nmulf = lambda: map(float,input().strip().split())\r\nlstin = lambda: list(map(int,input().strip().split()))\r\n \r\nflush = lambda: stdout.flush()\r\nstdpr = lambda x: stdout.write(str(x))\r\n\r\n# @lru_cache(maxsize = 128)\r\n\r\n# print(pref)\r\n# ac = [chr(i) for i in range(ord('a'), ord('z') + 1)]\r\n \r\n# Power comes in response to a need, not a desire.\r\n\r\n# n = int(input())\r\n# n, k = map(int, input().split())\r\n# s = input()\r\n# l = list(map(int, input().split()))\r\n# dp = [[-1 for i in range(n + 1)] for j in range(2)]\r\n\r\n# def sieve(n):\r\n# if n < 9:\r\n# n = 10\r\n# l = [1] * (n + 1)\r\n# for i in range(2, int(n ** 0.5) + 1):\r\n# if l[i] == 1:\r\n# for j in range(i ** 2, n + 1, i):\r\n# if j % i == 0:\r\n# l[j] = 0\r\n# l[1] = 0\r\n# return l\r\n\r\n# sve = sieve(2 * 10 ** 3 +7 )\r\n\r\ndef panda(n, arr):\r\n return\r\n\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nt = 1\r\n# t = int(input())\r\n\r\nfor _ in range(t):\r\n n = inp()\r\n mp = defaultdict(int)\r\n edges = []\r\n for i in range(n - 1):\r\n edges.append(mult())\r\n cnt = 0\r\n arr = [-1] + lstin()\r\n\r\n for u, v in edges:\r\n if arr[u] != arr[v]:\r\n cnt += 1\r\n mp[u] += 1\r\n mp[v] += 1\r\n\r\n for i in range(1, n + 1):\r\n if mp[i] == cnt:\r\n print(\"YES\")\r\n print(i)\r\n break\r\n else:\r\n print(\"NO\")\r\n\r\n # print(ans)\r\n\r\n # a1 = redpanda(n, l)\r\n # print(a)\r\n # print(a1)\r\n # sys.stdout.write(str(ans))\r\n # print(\"Case #\" + str(_ + 1) + \": \" + str(ans))\r\n\r\n", "n = int(input())\na = []\nb = []\nfor i in range(n-1):\n\tx,y = map(int, input().split())\n\ta.append(x)\n\tb.append(y)\n\ncolors = list(map(int, input().split()))\n\n\nlehet = []\nfor i in range(n-1):\n\tif colors[a[i]-1] != colors[b[i]-1]:\n\t\tif len(lehet) == 0:\n\t\t\tlehet += [a[i], b[i]]\n\t\telse:\n\t\t\tif a[i] in lehet and b[i] in lehet:\n\t\t\t\tprint(\"NO\")\n\t\t\t\texit(0)\n\t\t\telif a[i] in lehet:\n\t\t\t\tlehet = [a[i]]\n\t\t\telif b[i] in lehet:\n\t\t\t\tlehet = [b[i]]\n\t\t\telse:\n\t\t\t\tprint(\"NO\")\n\t\t\t\texit(0)\nprint(\"YES\")\nif len(lehet) == 0:\n\tlehet = [1]\nprint(lehet[0])\n\t\n", "N = int(input())\r\nG = [[] for i in range(N)]\r\nd = []\r\nfor i in range(N - 1):\r\n a, b = map(int, input().split())\r\n a, b = a - 1, b - 1\r\n G[a].append(b)\r\n G[b].append(a)\r\n d.append((a, b))\r\nC = list(map(int, input().split()))\r\nnum = 0\r\nfor i in range(N - 1):\r\n if C[d[i][0]] != C[d[i][1]]:\r\n num += 1\r\n\r\nfor i in range(N):\r\n s = 0\r\n for j in G[i]:\r\n if C[i] != C[j]:\r\n s += 1\r\n if s == num:\r\n print('YES')\r\n print(i + 1)\r\n break\r\nelse:\r\n print('NO')\r\n\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\ndef main():\n n = II()\n d = collections.defaultdict(list)\n t = []\n for _ in range(n-1):\n a,b = LI()\n t.append([a,b])\n c = LI()\n r = []\n for a,b in t:\n d[a].append(b)\n d[b].append(a)\n if c[a-1] != c[b-1]:\n r = [a,b]\n if not r:\n print('YES')\n print(1)\n return\n for ri in r:\n rf = False\n for i in range(1,n+1):\n if i == ri:\n continue\n ci = c[i-1]\n for j in d[i]:\n if j == ri:\n continue\n if ci != c[j-1]:\n rf = True\n break\n if rf:\n break\n if not rf:\n print('YES')\n print(ri)\n return\n print('NO')\n\nmain()\n", "n = int(input())\nedges = []\nfor i in range(n-1):\n edges.append(list(map(int, input().split())))\ncolors = [0] + list(map(int, input().split()))\ntops = []\nfor e in edges:\n if colors[e[0]] != colors[e[1]]:\n tops.append(e)\nif not tops:\n print('YES')\n print(1)\nelse:\n s = set(tops[0])\n list(map(lambda t: s.intersection_update(set(t)), tops))\n if s:\n print('YES')\n print(list(s)[0])\n else:\n print('NO')\n" ]

[ "import sys\ninput = sys.stdin.readline\nimport math\n\ndef read_int():\n return int(input())\n\ndef read_ints():\n return map(int, input().split())\n\ndef read_int_list():\n return [int(i) for i in input().split()]\n\ndef read_string():\n return input().strip()\n\nx1, y1, x2, y2, x3, y3 = read_ints()\narea = x1*y1 + x2*y2 + x3*y3\nd = int(math.sqrt(area))\nif d*d != area:\n print(-1)\n exit()\nelse:\n result = [['.']*d for _ in range(d)]\n a, b, c = 'A', 'B', 'C'\n if y1 == d:\n x1, y1 = y1, x1\n elif x2 == d:\n x1, y1, x2, y2 = x2, y2, x1, y1\n a, b = b, a\n elif y2 == d:\n x1, y1, x2, y2 = y2, x2, x1, y1\n a, b = b, a\n elif x3 == d:\n x1, y1, x3, y3 = x3, y3, x1, y1\n a, c = c, a\n elif y3 == d:\n x1, y1, x3, y3 = y3, x3, x1, y1\n a, c = c, a\n elif x1 != d:\n print(-1)\n exit()\n for i in range(y1):\n for j in range(d):\n result[i][j] = a\n if x2 == d or y2 == d or x3 == d or y3 == d:\n if y2 == d:\n x2, y2 = y2, x2\n elif x3 == d:\n x2, y2, x3, y3 = x3, y3, x2, y2\n b, c = c, b\n elif y3 == d:\n x2, y2, x3, y3 = y3, x3, x2, y2\n b, c = c, b\n for i in range(y1, y1 + y2):\n for j in range(d):\n result[i][j] = b\n if x3 != d and y3 != d:\n print(-1)\n exit()\n if y3 == d:\n x3, y3 = y3, x3\n for i in range(y1 + y2, y1 + y2 + y3):\n for j in range(d):\n result[i][j] = c\n else:\n if x2 == x3 and y2 + y3 == d:\n pass\n elif x2 == y3 and y2 + x3 == d:\n x3, y3 = y3, x3\n elif y2 == x3 and x2 + y3 == d:\n x2, y2 = y2, x2\n elif y2 == y3 and x2 + x3 == d:\n x2, y2 = y2, x2\n x3, y3 = y3, x3\n else:\n print(-1)\n exit()\n for i in range(y1, y1 + x2):\n for j in range(y2):\n result[i][j] = b\n for j in range(y2, y2 + y3):\n result[i][j] = c\n print(d)\n for i in range(d):\n print(\"\".join(result[i]))\n \n", "class Rectangle:\r\n def __init__(self, a, b, letter):\r\n self.a = a\r\n self.b = b\r\n self.letter = letter\r\n\r\n def t(self):\r\n return Rectangle(self.b, self.a, self.letter)\r\n\r\n def __eq__(self, other):\r\n return self.letter == other.letter\r\n\r\n\r\nclass Square1:\r\n def __init__(self, r1, r2, r3):\r\n self.r1 = r1\r\n self.r2 = r2\r\n self.r3 = r3\r\n\r\n def is_square(self):\r\n return self.r1.a == self.r2.a and self.r1.a == self.r3.a and self.r1.a == (self.r1.b + self.r2.b + self.r3.b)\r\n\r\n def draw(self):\r\n print(self.r1.a)\r\n r1 = (self.r1.letter * self.r1.a + '\\n') * self.r1.b\r\n r2 = (self.r2.letter * self.r2.a + '\\n') * self.r2.b\r\n r3 = (self.r3.letter * self.r3.a + '\\n') * self.r3.b\r\n print(r1 + r2 + r3, end='')\r\n\r\n\r\nclass Square2:\r\n def __init__(self, r1, r2, r3):\r\n self.r1 = r1\r\n self.r2 = r2\r\n self.r3 = r3\r\n\r\n def is_square(self):\r\n return self.r1.a == (self.r2.a + self.r3.a) and self.r2.b == self.r3.b and self.r1.a == (self.r1.b + self.r2.b)\r\n\r\n def draw(self):\r\n print(self.r1.a)\r\n r1 = (self.r1.letter * self.r1.a + '\\n') * self.r1.b\r\n bottom = (self.r2.letter * self.r2.a + self.r3.letter * self.r3.a + '\\n') * self.r2.b\r\n print(r1 + bottom, end='')\r\n\r\n\r\ndef main():\r\n Ax, Ay, Bx, By, Cx, Cy = map(int, input().split())\r\n A = Rectangle(Ax, Ay, 'A')\r\n B = Rectangle(Bx, By, 'B')\r\n C = Rectangle(Cx, Cy, 'C')\r\n recs = (A, A.t(), B, B.t(), C, C.t())\r\n for rec1 in recs:\r\n for rec2 in recs:\r\n if rec2 == rec1:\r\n continue\r\n for rec3 in recs:\r\n if rec3 == rec1 or rec3 == rec2:\r\n continue\r\n sq1 = Square1(rec1, rec2, rec3)\r\n if sq1.is_square():\r\n sq1.draw()\r\n return\r\n sq2 = Square2(rec1, rec2, rec3)\r\n if sq2.is_square():\r\n sq2.draw()\r\n return\r\n print(-1)\r\n\r\n\r\nmain()\r\n", "# https://codeforces.com/problemset/problem/581/D\n\nfrom itertools import permutations, product\n\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\n\npoints = [('A', x1, y1), ('B', x2, y2), ('C', x3, y3)]\n\ndef print_answer(grid):\n print(len(grid))\n for row in grid:\n print(''.join(row))\n exit(0)\n\nfor p1, p2, p3 in permutations(points):\n for (c1, x1, y1), (c2, x2, y2), (c3, x3, y3) in product([p1, (p1[0], p1[2], p1[1])], [p2, (p2[0], p2[2], p2[1])], [p3, (p3[0], p3[2], p3[1])]):\n # 1 -> 2 -> 3\n if (x1 + x2 + x3) == y1 == y2 == y2:\n s = y1\n\n grid = [[''] * s for _ in range(s)]\n for r in range(s):\n for c in range(x1):\n grid[r][c] = c1\n\n for c in range(x1, x1 + x2):\n grid[r][c] = c2\n\n for c in range(x1 + x2, x1 + x2 + x3):\n grid[r][c] = c3\n \n print_answer(grid)\n\n # 1\n # 2 -> 3\n if y2 == y3 and y1 + y2 == x1 == x2 + x3:\n s = x1\n\n grid = [[''] * s for _ in range(s)]\n for r in range(y1):\n for c in range(s):\n grid[r][c] = c1\n\n for r in range(y1, y1 + y2):\n for c in range(x2):\n grid[r][c] = c2\n\n for c in range(x2, x2 + x3):\n grid[r][c] = c3\n\n print_answer(grid)\n\n # 1 -> 2\n # 3\n if y1 == y2 and y1 + y3 == x3 == x1 + x2:\n s = x3\n\n grid = [[''] * s for _ in range(s)]\n\n for r in range(y1):\n for c in range(x1):\n grid[r][c] = c1\n\n for c in range(x1, x1 + x2):\n grid[r][c] = c2\n\n for r in range(y1, y1 + y3):\n for c in range(s):\n grid[r][c] = c3\n\n print_answer(grid)\n\n # 1\n # 2\n # 3\n if x1 == x2 == x3 == (y1 + y2 + y3):\n s = x1\n grid = [[''] * s for _ in range(s)]\n\n for c in range(s):\n for r in range(y1):\n grid[r][c] = c1\n\n for r in range(y1, y1 + y2):\n grid[r][c] = c2\n \n for r in range(y1 + y2, y1 + y2 + y3):\n grid[r][c] = c3\n\n print_answer(grid)\n\nprint('-1')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\r\nu, v, w = [x1, y1], [x2, y2], [x3, y3]\r\nn = -1\r\nfor i in range(2):\r\n for j in range(2):\r\n for k in range(2):\r\n if u[i] == v[j] == w[k] and u[i ^ 1] + v[j ^ 1] + w[k ^ 1] == u[i]:\r\n n = u[i]\r\n ans = []\r\n for _ in range(u[i ^ 1]):\r\n ans.append(\"A\" * n)\r\n for _ in range(v[j ^ 1]):\r\n ans.append(\"B\" * n)\r\n for _ in range(w[k ^ 1]):\r\n ans.append(\"C\" * n)\r\nif n == -1:\r\n c = list(\"ABC\")\r\n for _ in range(3):\r\n for i in range(2):\r\n for j in range(2):\r\n for k in range(2):\r\n if u[i] == v[j] + w[k] == u[i ^ 1] + v[j ^ 1] and v[j ^ 1] == w[k ^ 1]:\r\n n = u[i]\r\n ans = []\r\n for _ in range(u[i ^ 1]):\r\n ans.append(c[0] * u[i])\r\n for _ in range(v[j ^ 1]):\r\n ans.append(c[1] * v[j] + c[2] * w[k])\r\n u, v, w = v, w, u\r\n c[0], c[1], c[2] = c[1], c[2], c[0]\r\nprint(n)\r\nif not n == -1:\r\n sys.stdout.write(\"\\n\".join(ans))" ]

[ "n,k=map(int, input().split())\nif(n*(n-1)//2 <=k):\n\tprint('no solution')\nelse:\n\tfor i in range(n):\n\t\tprint(0,i)", "r= lambda x:(x*(x+1))//2\r\na,b=map(int,input().split())\r\nif r(a-1)<=b:exit(print(\"no solution\"))\r\nfor i in range(a):print(0,0+i)", "n, k = [int(x) for x in input().split()]\r\nif n * (n-1) / 2 <= k:\r\n print(\"no solution\")\r\nelse:\r\n for x in range(n):\r\n print(0, x)\r\n", "n,k=map(int, input().split())\r\nif k>=(n-1)*n/2:\r\n print(\"no solution\")\r\nelse:\r\n for y in range(n):\r\n print(0,y)\r\n", "n, k = map(int, input().split())\r\nif k >= n * (n-1) // 2:\r\n print(\"no solution\")\r\n exit()\r\nfor i in range(n):\r\n print(0, i)\r\n", "n, k = [int(i) for i in input().split()]\r\nif k >= n * (n - 1) // 2:\r\n print(\"no solution\")\r\nelse:\r\n for j in range(n):\r\n print(0, j)\r\n", "n,k = map(int ,input().split())\r\n\r\nfac = n*(n-1) /2 ; \r\nif (fac > k ) :\r\n i = 0\r\n while (i < n ) :\r\n print(1,\" \" ,i)\r\n i = i+1\r\nelse :\r\n print(\"no solution\")", "n,k = map(int,input().split())\r\ntot = ((n*(n-1))/2)\r\n\r\nif tot <= k:\r\n print(\"no solution\")\r\nelse:\r\n for i in range(1,n+1):\r\n print(0,i)", "n,k=map(int,input().split())\r\nif n*(n-1)/2<=k :\r\n print('no solution')\r\n exit(0)\r\nfor i in range(n):\r\n print(i,i*(n+1))", "n,k=map(int,input().split())\r\nprint([\"\\n\".join(\"0 \"+str(i)for i in range(n)),\"no solution\"][(n-1)*n<=k*2])", "n, k = map(int, input().split())\n\nif (n * (n - 1) / 2) > k:\n\tfor i in range(0, n):\n\t\tprint(0, i)\nelse:\n\tprint(\"no solution\")\n\n \t\t \t \t \t\t\t\t \t \t\t\t\t\t\t\t \t\t\t", "n,k = map(int,input().split())\r\nif n*(n-1) <= 2*k: print(\"no solution\")\r\nelse:\r\n x = -10**9\r\n y = -10**9\r\n step = 5000\r\n for i in range(n):\r\n print (x,y)\r\n x += 1\r\n y += step\r\n", "n, k = map(int, input().split())\r\nif 2 * k < n * (n - 1): print('0', '\\n0 '.join(map(str, range(n))))\r\nelse: print('no solution')", "n,k=map(int,input().split())\r\nif k*2>=(n-1)*n:print('no solution')\r\nelse:[print(0,i)for i in range(n)]", "n,k=list(map(int,input().split()))\r\nif (n*(n-1))//2>k:\r\n for i in range(n):\r\n print(0,i)\r\nelse:\r\n print('no solution')", "n,k=map(int,input().split())\r\nx=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n x+=1\r\nif(k>=x):\r\n print(\"no solution\")\r\nelse:\r\n x=0\r\n for i in range(n):\r\n print(0,x)\r\n x+=1000\r\n", "n,k = map(int ,input().split())\n\nif((n&1)==0) :\n time = (n//2)*(n-1)\nelse :\n time = ((n-1)//2)*n\n\nif(k>=time):\n print(\"no solution\")\nelse :\n for i in range(n):\n print(\"0 \"+str(i))", "# This is a sample Python script.\r\n\r\nn,k=map(int,input().split())\r\nmax=n*(n-1)/2\r\nif max<=k:\r\n print( \"no solution\")\r\nelse:\r\n for i in range(n):\r\n print('0 %d'%(i))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/python3\n\nn, k = map(int, input().split())\n\nfor i in range(1, n + 1):\n k -= n - (i + 1) + 1\n\nif k >= 0:\n print(\"no solution\")\nelse:\n for i in range(n):\n print(0, i)\n", "n,k=map(int,input().split())\n\nif n*(n-1)/2<=k:\n\n print(\"no solution\")\n\nelse:\n\n for i in range(0,n):print(0,i)\n\n" ]